/usr/share/scheme48-1.9/srfi/srfi-25.scm is in scheme48 1.9-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 | ;; Copyright (C) Jussi Piitulainen (2001). All Rights Reserved.
;;
;; Permission is hereby granted, free of charge, to any person
;; obtaining a copy of this software and associated documentation
;; files (the "Software"), to deal in the Software without
;; restriction, including without limitation the rights to use, copy,
;; modify, merge, publish, distribute, sublicense, and/or sell copies
;; of the Software, and to permit persons to whom the Software is
;; furnished to do so, subject to the following conditions:
;;
;; The above copyright notice and this permission notice shall be
;; included in all copies or substantial portions of the Software.
;;
;; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
;; EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
;; MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
;; NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
;; BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
;; ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
;; CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
;; SOFTWARE.
;;; 1997 - 2001 Jussi Piitulainen
;;; --- Intro ---
;;; This interface to arrays is based on Alan Bawden's array.scm of
;;; 1993 (earlier version in the Internet Repository and another
;;; version in SLIB). This is a complete rewrite, to be consistent
;;; with the rest of Scheme and to make arrays independent of lists.
;;; Some modifications are due to discussion in srfi-25 mailing list.
;;; (array? obj)
;;; (make-array shape [obj]) changed arguments
;;; (shape bound ...) new
;;; (array shape obj ...) new
;;; (array-rank array) changed name back
;;; (array-start array dimension) new
;;; (array-end array dimension) new
;;; (array-ref array k ...)
;;; (array-ref array index) new variant
;;; (array-set! array k ... obj) changed argument order
;;; (array-set! array index obj) new variant
;;; (share-array array shape proc) changed arguments
;;; All other variables in this file have names in "array:".
;;; Should there be a way to make arrays with initial values mapped
;;; from indices? Sure. The current "initial object" is lame.
;;;
;;; Removed (array-shape array) from here. There is a new version
;;; in arlib though.
;;; --- Representation type dependencies ---
;;; The mapping from array indices to the index to the underlying vector
;;; is whatever array:optimize returns. The file "opt" provides three
;;; representations:
;;;
;;; mbda) mapping is a procedure that allows an optional argument
;;; tter) mapping is two procedures that takes exactly the indices
;;; ctor) mapping is a vector of a constant term and coefficients
;;;
;;; Choose one in "opt" to make the optimizer. Then choose the matching
;;; implementation of array-ref and array-set!.
;;;
;;; These should be made macros to inline them. Or have a good compiler
;;; and plant the package as a module.
;;; 1. Pick an optimizer.
;;; 2. Pick matching index representation.
;;; 3. Pick a record implementation; as-procedure is generic; syntax inlines.
;;; 3. This file is otherwise portable.
;; Scheme 48 note: We picked the "ctor" representation
(define-record-type array :array
(array:make vec ind shp)
array:array?
(vec array:vector)
(ind array:index)
(shp array:shape))
;; Contents of ix-ctor.scm
(define (array-ref a . xs)
(or (array:array? a)
(assertion-violation 'array-ref "not an array" a))
(let ((shape (array:shape a)))
(if (null? xs)
(array:check-indices "array-ref" xs shape)
(let ((x (car xs)))
(if (vector? x)
(array:check-index-vector "array-ref" x shape)
(if (integer? x)
(array:check-indices "array-ref" xs shape)
(if (array:array? x)
(array:check-index-actor "array-ref" x shape)
(assertion-violation 'array-ref "not an index object" x))))))
(vector-ref
(array:vector a)
(if (null? xs)
(vector-ref (array:index a) 0)
(let ((x (car xs)))
(if (vector? x)
(array:index/vector
(quotient (vector-length shape) 2)
(array:index a)
x)
(if (integer? x)
(array:vector-index (array:index a) xs)
(if (array:array? x)
(array:index/array
(quotient (vector-length shape) 2)
(array:index a)
(array:vector x)
(array:index x))
(assertion-violation 'array-ref "bad index object" x)))))))))
(define (array-set! a x . xs)
(or (array:array? a)
(assertion-violation 'array-set! "not an array"))
(let ((shape (array:shape a)))
(if (null? xs)
(array:check-indices "array-set!" '() shape)
(if (vector? x)
(array:check-index-vector "array-set!" x shape)
(if (integer? x)
(array:check-indices.o "array-set!" (cons x xs) shape)
(if (array:array? x)
(array:check-index-actor "array-set!" x shape)
(assertion-violation 'array-set! "not an index object" x)))))
(if (null? xs)
(vector-set! (array:vector a) (vector-ref (array:index a) 0) x)
(if (vector? x)
(vector-set! (array:vector a)
(array:index/vector
(quotient (vector-length shape) 2)
(array:index a)
x)
(car xs))
(if (integer? x)
(let ((v (array:vector a))
(i (array:index a))
(r (quotient (vector-length shape) 2)))
(do ((sum (* (vector-ref i 0) x)
(+ sum (* (vector-ref i k) (car ks))))
(ks xs (cdr ks))
(k 1 (+ k 1)))
((= k r)
(vector-set! v (+ sum (vector-ref i k)) (car ks)))))
(if (array:array? x)
(vector-set! (array:vector a)
(array:index/array
(quotient (vector-length shape) 2)
(array:index a)
(array:vector x)
(array:index x))
(car xs))
(assertion-violation 'array-set!
"bad index object"
x)))))))
;; Contents of op-ctor.scm
(begin
(define array:opt-args '(ctor (4)))
(define (array:optimize f r)
(case r
((0) (let ((n0 (f))) (array:0 n0)))
((1) (let ((n0 (f 0))) (array:1 n0 (- (f 1) n0))))
((2)
(let ((n0 (f 0 0)))
(array:2 n0 (- (f 1 0) n0) (- (f 0 1) n0))))
((3)
(let ((n0 (f 0 0 0)))
(array:3
n0
(- (f 1 0 0) n0)
(- (f 0 1 0) n0)
(- (f 0 0 1) n0))))
(else
(let ((v
(do ((k 0 (+ k 1)) (v '() (cons 0 v)))
((= k r) v))))
(let ((n0 (apply f v)))
(apply
array:n
n0
(array:coefficients f n0 v v)))))))
(define (array:optimize-empty r)
(let ((x (make-vector (+ r 1) 0)))
(vector-set! x r -1)
x))
(define (array:coefficients f n0 vs vp)
(case vp
((()) '())
(else
(set-car! vp 1)
(let ((n (- (apply f vs) n0)))
(set-car! vp 0)
(cons n (array:coefficients f n0 vs (cdr vp)))))))
(define (array:vector-index x ks)
(do ((sum 0 (+ sum (* (vector-ref x k) (car ks))))
(ks ks (cdr ks))
(k 0 (+ k 1)))
((null? ks) (+ sum (vector-ref x k)))))
(define (array:shape-index) '#(2 1 0))
(define (array:empty-shape-index) '#(0 0 -1))
(define (array:shape-vector-index x r k)
(+
(* (vector-ref x 0) r)
(* (vector-ref x 1) k)
(vector-ref x 2)))
(define (array:actor-index x k)
(+ (* (vector-ref x 0) k) (vector-ref x 1)))
(define (array:0 n0) (vector n0))
(define (array:1 n0 n1) (vector n1 n0))
(define (array:2 n0 n1 n2) (vector n1 n2 n0))
(define (array:3 n0 n1 n2 n3) (vector n1 n2 n3 n0))
(define (array:n n0 n1 n2 n3 n4 . ns)
(apply vector n1 n2 n3 n4 (append ns (list n0))))
(define (array:maker r)
(case r
((0) array:0)
((1) array:1)
((2) array:2)
((3) array:3)
(else array:n)))
(define array:indexer/vector
(let ((em
(vector
(lambda (x i) (+ (vector-ref x 0)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(vector-ref x 1)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(vector-ref x 2)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(* (vector-ref x 2) (vector-ref i 2))
(vector-ref x 3)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(* (vector-ref x 2) (vector-ref i 2))
(* (vector-ref x 3) (vector-ref i 3))
(vector-ref x 4)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(* (vector-ref x 2) (vector-ref i 2))
(* (vector-ref x 3) (vector-ref i 3))
(* (vector-ref x 4) (vector-ref i 4))
(vector-ref x 5)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(* (vector-ref x 2) (vector-ref i 2))
(* (vector-ref x 3) (vector-ref i 3))
(* (vector-ref x 4) (vector-ref i 4))
(* (vector-ref x 5) (vector-ref i 5))
(vector-ref x 6)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(* (vector-ref x 2) (vector-ref i 2))
(* (vector-ref x 3) (vector-ref i 3))
(* (vector-ref x 4) (vector-ref i 4))
(* (vector-ref x 5) (vector-ref i 5))
(* (vector-ref x 6) (vector-ref i 6))
(vector-ref x 7)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(* (vector-ref x 2) (vector-ref i 2))
(* (vector-ref x 3) (vector-ref i 3))
(* (vector-ref x 4) (vector-ref i 4))
(* (vector-ref x 5) (vector-ref i 5))
(* (vector-ref x 6) (vector-ref i 6))
(* (vector-ref x 7) (vector-ref i 7))
(vector-ref x 8)))
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(* (vector-ref x 2) (vector-ref i 2))
(* (vector-ref x 3) (vector-ref i 3))
(* (vector-ref x 4) (vector-ref i 4))
(* (vector-ref x 5) (vector-ref i 5))
(* (vector-ref x 6) (vector-ref i 6))
(* (vector-ref x 7) (vector-ref i 7))
(* (vector-ref x 8) (vector-ref i 8))
(vector-ref x 9)))))
(it
(lambda (w)
(lambda (x i)
(+
(* (vector-ref x 0) (vector-ref i 0))
(* (vector-ref x 1) (vector-ref i 1))
(* (vector-ref x 2) (vector-ref i 2))
(* (vector-ref x 3) (vector-ref i 3))
(* (vector-ref x 4) (vector-ref i 4))
(* (vector-ref x 5) (vector-ref i 5))
(* (vector-ref x 6) (vector-ref i 6))
(* (vector-ref x 7) (vector-ref i 7))
(* (vector-ref x 8) (vector-ref i 8))
(* (vector-ref x 9) (vector-ref i 9))
(do ((xi
0
(+
(* (vector-ref x u) (vector-ref i u))
xi))
(u (- w 1) (- u 1)))
((< u 10) xi))
(vector-ref x w))))))
(lambda (r) (if (< r 10) (vector-ref em r) (it r)))))
(define array:indexer/array
(let ((em
(vector
(lambda (x v i) (+ (vector-ref x 0)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(vector-ref x 1)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(vector-ref x 2)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(*
(vector-ref x 2)
(vector-ref v (array:actor-index i 2)))
(vector-ref x 3)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(*
(vector-ref x 2)
(vector-ref v (array:actor-index i 2)))
(*
(vector-ref x 3)
(vector-ref v (array:actor-index i 3)))
(vector-ref x 4)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(*
(vector-ref x 2)
(vector-ref v (array:actor-index i 2)))
(*
(vector-ref x 3)
(vector-ref v (array:actor-index i 3)))
(*
(vector-ref x 4)
(vector-ref v (array:actor-index i 4)))
(vector-ref x 5)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(*
(vector-ref x 2)
(vector-ref v (array:actor-index i 2)))
(*
(vector-ref x 3)
(vector-ref v (array:actor-index i 3)))
(*
(vector-ref x 4)
(vector-ref v (array:actor-index i 4)))
(*
(vector-ref x 5)
(vector-ref v (array:actor-index i 5)))
(vector-ref x 6)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(*
(vector-ref x 2)
(vector-ref v (array:actor-index i 2)))
(*
(vector-ref x 3)
(vector-ref v (array:actor-index i 3)))
(*
(vector-ref x 4)
(vector-ref v (array:actor-index i 4)))
(*
(vector-ref x 5)
(vector-ref v (array:actor-index i 5)))
(*
(vector-ref x 6)
(vector-ref v (array:actor-index i 6)))
(vector-ref x 7)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(*
(vector-ref x 2)
(vector-ref v (array:actor-index i 2)))
(*
(vector-ref x 3)
(vector-ref v (array:actor-index i 3)))
(*
(vector-ref x 4)
(vector-ref v (array:actor-index i 4)))
(*
(vector-ref x 5)
(vector-ref v (array:actor-index i 5)))
(*
(vector-ref x 6)
(vector-ref v (array:actor-index i 6)))
(*
(vector-ref x 7)
(vector-ref v (array:actor-index i 7)))
(vector-ref x 8)))
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(*
(vector-ref x 2)
(vector-ref v (array:actor-index i 2)))
(*
(vector-ref x 3)
(vector-ref v (array:actor-index i 3)))
(*
(vector-ref x 4)
(vector-ref v (array:actor-index i 4)))
(*
(vector-ref x 5)
(vector-ref v (array:actor-index i 5)))
(*
(vector-ref x 6)
(vector-ref v (array:actor-index i 6)))
(*
(vector-ref x 7)
(vector-ref v (array:actor-index i 7)))
(*
(vector-ref x 8)
(vector-ref v (array:actor-index i 8)))
(vector-ref x 9)))))
(it
(lambda (w)
(lambda (x v i)
(+
(*
(vector-ref x 0)
(vector-ref v (array:actor-index i 0)))
(*
(vector-ref x 1)
(vector-ref v (array:actor-index i 1)))
(*
(vector-ref x 2)
(vector-ref v (array:actor-index i 2)))
(*
(vector-ref x 3)
(vector-ref v (array:actor-index i 3)))
(*
(vector-ref x 4)
(vector-ref v (array:actor-index i 4)))
(*
(vector-ref x 5)
(vector-ref v (array:actor-index i 5)))
(*
(vector-ref x 6)
(vector-ref v (array:actor-index i 6)))
(*
(vector-ref x 7)
(vector-ref v (array:actor-index i 7)))
(*
(vector-ref x 8)
(vector-ref v (array:actor-index i 8)))
(*
(vector-ref x 9)
(vector-ref v (array:actor-index i 9)))
(do ((xi
0
(+
(*
(vector-ref x u)
(vector-ref
v
(array:actor-index i u)))
xi))
(u (- w 1) (- u 1)))
((< u 10) xi))
(vector-ref x w))))))
(lambda (r) (if (< r 10) (vector-ref em r) (it r)))))
(define array:applier-to-vector
(let ((em
(vector
(lambda (p v) (p))
(lambda (p v) (p (vector-ref v 0)))
(lambda (p v)
(p (vector-ref v 0) (vector-ref v 1)))
(lambda (p v)
(p
(vector-ref v 0)
(vector-ref v 1)
(vector-ref v 2)))
(lambda (p v)
(p
(vector-ref v 0)
(vector-ref v 1)
(vector-ref v 2)
(vector-ref v 3)))
(lambda (p v)
(p
(vector-ref v 0)
(vector-ref v 1)
(vector-ref v 2)
(vector-ref v 3)
(vector-ref v 4)))
(lambda (p v)
(p
(vector-ref v 0)
(vector-ref v 1)
(vector-ref v 2)
(vector-ref v 3)
(vector-ref v 4)
(vector-ref v 5)))
(lambda (p v)
(p
(vector-ref v 0)
(vector-ref v 1)
(vector-ref v 2)
(vector-ref v 3)
(vector-ref v 4)
(vector-ref v 5)
(vector-ref v 6)))
(lambda (p v)
(p
(vector-ref v 0)
(vector-ref v 1)
(vector-ref v 2)
(vector-ref v 3)
(vector-ref v 4)
(vector-ref v 5)
(vector-ref v 6)
(vector-ref v 7)))
(lambda (p v)
(p
(vector-ref v 0)
(vector-ref v 1)
(vector-ref v 2)
(vector-ref v 3)
(vector-ref v 4)
(vector-ref v 5)
(vector-ref v 6)
(vector-ref v 7)
(vector-ref v 8)))))
(it
(lambda (r)
(lambda (p v)
(apply
p
(vector-ref v 0)
(vector-ref v 1)
(vector-ref v 2)
(vector-ref v 3)
(vector-ref v 4)
(vector-ref v 5)
(vector-ref v 6)
(vector-ref v 7)
(vector-ref v 8)
(vector-ref v 9)
(do ((k r (- k 1))
(r
'()
(cons (vector-ref v (- k 1)) r)))
((= k 10) r)))))))
(lambda (r) (if (< r 10) (vector-ref em r) (it r)))))
(define array:applier-to-actor
(let ((em
(vector
(lambda (p a) (p))
(lambda (p a) (p (array-ref a 0)))
(lambda (p a)
(p (array-ref a 0) (array-ref a 1)))
(lambda (p a)
(p
(array-ref a 0)
(array-ref a 1)
(array-ref a 2)))
(lambda (p a)
(p
(array-ref a 0)
(array-ref a 1)
(array-ref a 2)
(array-ref a 3)))
(lambda (p a)
(p
(array-ref a 0)
(array-ref a 1)
(array-ref a 2)
(array-ref a 3)
(array-ref a 4)))
(lambda (p a)
(p
(array-ref a 0)
(array-ref a 1)
(array-ref a 2)
(array-ref a 3)
(array-ref a 4)
(array-ref a 5)))
(lambda (p a)
(p
(array-ref a 0)
(array-ref a 1)
(array-ref a 2)
(array-ref a 3)
(array-ref a 4)
(array-ref a 5)
(array-ref a 6)))
(lambda (p a)
(p
(array-ref a 0)
(array-ref a 1)
(array-ref a 2)
(array-ref a 3)
(array-ref a 4)
(array-ref a 5)
(array-ref a 6)
(array-ref a 7)))
(lambda (p a)
(p
(array-ref a 0)
(array-ref a 1)
(array-ref a 2)
(array-ref a 3)
(array-ref a 4)
(array-ref a 5)
(array-ref a 6)
(array-ref a 7)
(array-ref a 8)))))
(it
(lambda (r)
(lambda (p a)
(apply
a
(array-ref a 0)
(array-ref a 1)
(array-ref a 2)
(array-ref a 3)
(array-ref a 4)
(array-ref a 5)
(array-ref a 6)
(array-ref a 7)
(array-ref a 8)
(array-ref a 9)
(do ((k r (- k 1))
(r '() (cons (array-ref a (- k 1)) r)))
((= k 10) r)))))))
(lambda (r)
"These are high level, hiding implementation at call site."
(if (< r 10) (vector-ref em r) (it r)))))
(define array:applier-to-backing-vector
(let ((em
(vector
(lambda (p ai av) (p))
(lambda (p ai av)
(p (vector-ref av (array:actor-index ai 0))))
(lambda (p ai av)
(p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))))
(lambda (p ai av)
(p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))
(vector-ref av (array:actor-index ai 2))))
(lambda (p ai av)
(p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))
(vector-ref av (array:actor-index ai 2))
(vector-ref av (array:actor-index ai 3))))
(lambda (p ai av)
(p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))
(vector-ref av (array:actor-index ai 2))
(vector-ref av (array:actor-index ai 3))
(vector-ref av (array:actor-index ai 4))))
(lambda (p ai av)
(p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))
(vector-ref av (array:actor-index ai 2))
(vector-ref av (array:actor-index ai 3))
(vector-ref av (array:actor-index ai 4))
(vector-ref av (array:actor-index ai 5))))
(lambda (p ai av)
(p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))
(vector-ref av (array:actor-index ai 2))
(vector-ref av (array:actor-index ai 3))
(vector-ref av (array:actor-index ai 4))
(vector-ref av (array:actor-index ai 5))
(vector-ref av (array:actor-index ai 6))))
(lambda (p ai av)
(p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))
(vector-ref av (array:actor-index ai 2))
(vector-ref av (array:actor-index ai 3))
(vector-ref av (array:actor-index ai 4))
(vector-ref av (array:actor-index ai 5))
(vector-ref av (array:actor-index ai 6))
(vector-ref av (array:actor-index ai 7))))
(lambda (p ai av)
(p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))
(vector-ref av (array:actor-index ai 2))
(vector-ref av (array:actor-index ai 3))
(vector-ref av (array:actor-index ai 4))
(vector-ref av (array:actor-index ai 5))
(vector-ref av (array:actor-index ai 6))
(vector-ref av (array:actor-index ai 7))
(vector-ref av (array:actor-index ai 8))))))
(it
(lambda (r)
(lambda (p ai av)
(apply
p
(vector-ref av (array:actor-index ai 0))
(vector-ref av (array:actor-index ai 1))
(vector-ref av (array:actor-index ai 2))
(vector-ref av (array:actor-index ai 3))
(vector-ref av (array:actor-index ai 4))
(vector-ref av (array:actor-index ai 5))
(vector-ref av (array:actor-index ai 6))
(vector-ref av (array:actor-index ai 7))
(vector-ref av (array:actor-index ai 8))
(vector-ref av (array:actor-index ai 9))
(do ((k r (- k 1))
(r
'()
(cons
(vector-ref
av
(array:actor-index ai (- k 1)))
r)))
((= k 10) r)))))))
(lambda (r)
"These are low level, exposing implementation at call site."
(if (< r 10) (vector-ref em r) (it r)))))
(define (array:index/vector r x v)
((array:indexer/vector r) x v))
(define (array:index/array r x av ai)
((array:indexer/array r) x av ai))
(define (array:apply-to-vector r p v)
((array:applier-to-vector r) p v))
(define (array:apply-to-actor r p a)
((array:applier-to-actor r) p a)))
;; Contents of array.scm
;;; --- Portable R5RS (R4RS and multiple values) ---
;;; (array? obj)
;;; returns #t if `obj' is an array and #t or #f otherwise.
(define (array? obj)
(array:array? obj))
;;; (make-array shape)
;;; (make-array shape obj)
;;; makes array of `shape' with each cell containing `obj' initially.
(define (make-array shape . rest)
(or (array:good-shape? shape)
(assertion-violation 'make-array "shape is not a shape" shape))
(apply array:make-array shape rest))
(define (array:make-array shape . rest)
(let ((size (array:size shape)))
(array:make
(if (pair? rest)
(apply (lambda (o) (make-vector size o)) rest)
(make-vector size))
(if (= size 0)
(array:optimize-empty
(vector-ref (array:shape shape) 1))
(array:optimize
(array:make-index shape)
(vector-ref (array:shape shape) 1)))
(array:shape->vector shape))))
;;; (shape bound ...)
;;; makes a shape. Bounds must be an even number of exact, pairwise
;;; non-decreasing integers. Note that any such array can be a shape.
(define (shape . bounds)
(let ((v (list->vector bounds)))
(or (even? (vector-length v))
(assertion-violation
'shape "uneven number of bounds: "
(array:list->string bounds)))
(let ((shp (array:make
v
(if (pair? bounds)
(array:shape-index)
(array:empty-shape-index))
(vector 0 (quotient (vector-length v) 2)
0 2))))
(or (array:good-shape? shp)
(assertion-violation 'shape
"bounds are not pairwise non-decreasing exact integers"
bounds))
shp)))
;;; (array shape obj ...)
;;; is analogous to `vector'.
(define (array shape . elts)
(or (array:good-shape? shape)
(assertion-violation 'array "shape is not a shape" shape))
(let ((size (array:size shape)))
(let ((vector (list->vector elts)))
(or (= (vector-length vector) size)
(assertion-violation
'array
"mismatch between elements cound and values count"
shape
size
(vector-length vector)
elts))
(array:make
vector
(if (= size 0)
(array:optimize-empty
(vector-ref (array:shape shape) 1))
(array:optimize
(array:make-index shape)
(vector-ref (array:shape shape) 1)))
(array:shape->vector shape)))))
;;; (array-rank array)
;;; returns the number of dimensions of `array'.
(define (array-rank array)
(quotient (vector-length (array:shape array)) 2))
;;; (array-start array k)
;;; returns the lower bound index of array along dimension k. This is
;;; the least valid index along that dimension if the dimension is not
;;; empty.
(define (array-start array d)
(vector-ref (array:shape array) (+ d d)))
;;; (array-end array k)
;;; returns the upper bound index of array along dimension k. This is
;;; not a valid index. If the dimension is empty, this is the same as
;;; the lower bound along it.
(define (array-end array d)
(vector-ref (array:shape array) (+ d d 1)))
;;; (share-array array shape proc)
;;; makes an array that shares elements of `array' at shape `shape'.
;;; The arguments to `proc' are indices of the result. The values of
;;; `proc' are indices of `array'.
;;; Todo: in the error message, should recognise the mapping and show it.
(define (share-array array subshape f)
(or (array:good-shape? subshape)
(assertion-violation 'share-array
"shape is not a shape" subshape))
(let ((subsize (array:size subshape)))
(or (array:good-share? subshape subsize f (array:shape array))
(assertion-violation 'share-array
"subshape does not map into supershape under mapping"
subshape
(array:shape array)
f))
(let ((g (array:index array)))
(array:make
(array:vector array)
(if (= subsize 0)
(array:optimize-empty
(vector-ref (array:shape subshape) 1))
(array:optimize
(lambda ks
(call-with-values
(lambda () (apply f ks))
(lambda ks (array:vector-index g ks))))
(vector-ref (array:shape subshape) 1)))
(array:shape->vector subshape)))))
;;; --- Hrmph ---
;;; (array:share/index! ...)
;;; reuses a user supplied index object when recognising the
;;; mapping. The mind balks at the very nasty side effect that
;;; exposes the implementation. So this is not in the spec.
;;; But letting index objects in at all creates a pressure
;;; to go the whole hog. Arf.
;;; Use array:optimize-empty for an empty array to get a
;;; clearly invalid vector index.
;;; Surely it's perverse to use an actor for index here? But
;;; the possibility is provided for completeness.
(define (array:share/index! array subshape proc index)
(array:make
(array:vector array)
(if (= (array:size subshape) 0)
(array:optimize-empty
(quotient (vector-length (array:shape array)) 2))
((if (vector? index)
array:optimize/vector
array:optimize/actor)
(lambda (subindex)
(let ((superindex (proc subindex)))
(if (vector? superindex)
(array:index/vector
(quotient (vector-length (array:shape array)) 2)
(array:index array)
superindex)
(array:index/array
(quotient (vector-length (array:shape array)) 2)
(array:index array)
(array:vector superindex)
(array:index superindex)))))
index))
(array:shape->vector subshape)))
(define (array:optimize/vector f v)
(let ((r (vector-length v)))
(do ((k 0 (+ k 1)))
((= k r))
(vector-set! v k 0))
(let ((n0 (f v))
(cs (make-vector (+ r 1)))
(apply (array:applier-to-vector (+ r 1))))
(vector-set! cs 0 n0)
(let wok ((k 0))
(if (< k r)
(let ((k1 (+ k 1)))
(vector-set! v k 1)
(let ((nk (- (f v) n0)))
(vector-set! v k 0)
(vector-set! cs k1 nk)
(wok k1)))))
(apply (array:maker r) cs))))
(define (array:optimize/actor f a)
(let ((r (array-end a 0))
(v (array:vector a))
(i (array:index a)))
(do ((k 0 (+ k 1)))
((= k r))
(vector-set! v (array:actor-index i k) 0))
(let ((n0 (f a))
(cs (make-vector (+ r 1)))
(apply (array:applier-to-vector (+ r 1))))
(vector-set! cs 0 n0)
(let wok ((k 0))
(if (< k r)
(let ((k1 (+ k 1))
(t (array:actor-index i k)))
(vector-set! v t 1)
(let ((nk (- (f a) n0)))
(vector-set! v t 0)
(vector-set! cs k1 nk)
(wok k1)))))
(apply (array:maker r) cs))))
;;; --- Internals ---
(define (array:shape->vector shape)
(let ((idx (array:index shape))
(shv (array:vector shape))
(rnk (vector-ref (array:shape shape) 1)))
(let ((vec (make-vector (* rnk 2))))
(do ((k 0 (+ k 1)))
((= k rnk)
vec)
(vector-set! vec (+ k k)
(vector-ref shv (array:shape-vector-index idx k 0)))
(vector-set! vec (+ k k 1)
(vector-ref shv (array:shape-vector-index idx k 1)))))))
;;; (array:size shape)
;;; returns the number of elements in arrays of shape `shape'.
(define (array:size shape)
(let ((idx (array:index shape))
(shv (array:vector shape))
(rnk (vector-ref (array:shape shape) 1)))
(do ((k 0 (+ k 1))
(s 1 (* s
(- (vector-ref shv (array:shape-vector-index idx k 1))
(vector-ref shv (array:shape-vector-index idx k 0))))))
((= k rnk) s))))
;;; (array:make-index shape)
;;; returns an index function for arrays of shape `shape'. This is a
;;; runtime composition of several variable arity procedures, to be
;;; passed to array:optimize for recognition as an affine function of
;;; as many variables as there are dimensions in arrays of this shape.
(define (array:make-index shape)
(let ((idx (array:index shape))
(shv (array:vector shape))
(rnk (vector-ref (array:shape shape) 1)))
(do ((f (lambda () 0)
(lambda (k . ks)
(+ (* s (- k (vector-ref
shv
(array:shape-vector-index idx (- j 1) 0))))
(apply f ks))))
(s 1 (* s (- (vector-ref
shv
(array:shape-vector-index idx (- j 1) 1))
(vector-ref
shv
(array:shape-vector-index idx (- j 1) 0)))))
(j rnk (- j 1)))
((= j 0)
f))))
;;; --- Error checking ---
;;; (array:good-shape? shape)
;;; returns true if `shape' is an array of the right shape and its
;;; elements are exact integers that pairwise bound intervals `[lo..hi)ยด.
(define (array:good-shape? shape)
(and (array:array? shape)
(let ((u (array:shape shape))
(v (array:vector shape))
(x (array:index shape)))
(and (= (vector-length u) 4)
(= (vector-ref u 0) 0)
(= (vector-ref u 2) 0)
(= (vector-ref u 3) 2))
(let ((p (vector-ref u 1)))
(do ((k 0 (+ k 1))
(true #t (let ((lo (vector-ref
v
(array:shape-vector-index x k 0)))
(hi (vector-ref
v
(array:shape-vector-index x k 1))))
(and true
(integer? lo)
(exact? lo)
(integer? hi)
(exact? hi)
(<= lo hi)))))
((= k p) true))))))
;;; (array:good-share? subv subsize mapping superv)
;;; returns true if the extreme indices in the subshape vector map
;;; into the bounds in the supershape vector.
;;; If some interval in `subv' is empty, then `subv' is empty and its
;;; image under `f' is empty and it is trivially alright. One must
;;; not call `f', though.
(define (array:good-share? subshape subsize f super)
(or (zero? subsize)
(letrec
((sub (array:vector subshape))
(dex (array:index subshape))
(ck (lambda (k ks)
(if (zero? k)
(call-with-values
(lambda () (apply f ks))
(lambda qs (array:good-indices? qs super)))
(and (ck (- k 1)
(cons (vector-ref
sub
(array:shape-vector-index
dex
(- k 1)
0))
ks))
(ck (- k 1)
(cons (- (vector-ref
sub
(array:shape-vector-index
dex
(- k 1)
1))
1)
ks)))))))
(let ((rnk (vector-ref (array:shape subshape) 1)))
(or (array:unchecked-share-depth? rnk)
(ck rnk '()))))))
;;; Check good-share on 10 dimensions at most. The trouble is,
;;; the cost of this check is exponential in the number of dimensions.
(define (array:unchecked-share-depth? rank)
(if (> rank 10)
(begin
(display `(warning: unchecked depth in share:
,rank subdimensions))
(newline)
#t)
#f))
;;; (array:check-indices caller indices shape-vector)
;;; (array:check-indices.o caller indices shape-vector)
;;; (array:check-index-vector caller index-vector shape-vector)
;;; return if the index is in bounds, else signal error.
;;;
;;; Shape-vector is the internal representation, with
;;; b and e for dimension k at 2k and 2k + 1.
(define (array:check-indices who ks shv)
(or (array:good-indices? ks shv)
(array:not-in who ks shv)))
(define (array:check-indices.o who ks shv)
(or (array:good-indices.o? ks shv)
(array:not-in who (reverse (cdr (reverse ks))) shv)))
(define (array:check-index-vector who ks shv)
(or (array:good-index-vector? ks shv)
(array:not-in who (vector->list ks) shv)))
(define (array:check-index-actor who ks shv)
(let ((shape (array:shape ks)))
(or (and (= (vector-length shape) 2)
(= (vector-ref shape 0) 0))
(assertion-violation who "not an actor" shape))
(or (array:good-index-actor?
(vector-ref shape 1)
(array:vector ks)
(array:index ks)
shv)
(array:not-in who (do ((k (vector-ref shape 1) (- k 1))
(m '() (cons (vector-ref
(array:vector ks)
(array:actor-index
(array:index ks)
(- k 1)))
m)))
((= k 0) m))
shv))))
(define (array:good-indices? ks shv)
(let ((d2 (vector-length shv)))
(do ((kp ks (if (pair? kp)
(cdr kp)))
(k 0 (+ k 2))
(true #t (and true (pair? kp)
(array:good-index? (car kp) shv k))))
((= k d2)
(and true (null? kp))))))
(define (array:good-indices.o? ks.o shv)
(let ((d2 (vector-length shv)))
(do ((kp ks.o (if (pair? kp)
(cdr kp)))
(k 0 (+ k 2))
(true #t (and true (pair? kp)
(array:good-index? (car kp) shv k))))
((= k d2)
(and true (pair? kp) (null? (cdr kp)))))))
(define (array:good-index-vector? ks shv)
(let ((r2 (vector-length shv)))
(and (= (* 2 (vector-length ks)) r2)
(do ((j 0 (+ j 1))
(k 0 (+ k 2))
(true #t (and true
(array:good-index? (vector-ref ks j) shv k))))
((= k r2) true)))))
(define (array:good-index-actor? r v i shv)
(and (= (* 2 r) (vector-length shv))
(do ((j 0 (+ j 1))
(k 0 (+ k 2))
(true #t (and true
(array:good-index? (vector-ref
v
(array:actor-index i j))
shv
k))))
((= j r) true))))
;;; (array:good-index? index shape-vector 2d)
;;; returns true if index is within bounds for dimension 2d/2.
(define (array:good-index? w shv k)
(and (integer? w)
(exact? w)
(<= (vector-ref shv k) w)
(< w (vector-ref shv (+ k 1)))))
(define (array:not-in who ks shv)
(let ((index (array:list->string ks))
(bounds (array:shape-vector->string shv)))
(assertion-violation who
"index not in bounds" index bounds)))
(define (array:list->string ks)
(do ((index "" (string-append index (array:thing->string (car ks)) " "))
(ks ks (cdr ks)))
((null? ks) index)))
(define (array:shape-vector->string shv)
(do ((bounds "" (string-append bounds
"["
(number->string (vector-ref shv t))
".."
(number->string (vector-ref shv (+ t 1)))
")"
" "))
(t 0 (+ t 2)))
((= t (vector-length shv)) bounds)))
(define (array:thing->string thing)
(cond
((number? thing) (number->string thing))
((symbol? thing) (string-append "#<symbol>" (symbol->string thing)))
((char? thing) "#<char>")
((string? thing) "#<string>")
((list? thing) (string-append "#" (number->string (length thing))
"<list>"))
((pair? thing) "#<pair>")
((array? thing) "#<array>")
((vector? thing) (string-append "#" (number->string
(vector-length thing))
"<vector>"))
((procedure? thing) "#<procedure>")
(else
(case thing
((()) "()")
((#t) "#t")
((#f) "#f")
(else
"#<whatsit>")))))
;;; And to grok an affine map, vector->vector type. Column k of arr
;;; will contain coefficients n0 ... nm of 1 k1 ... km for kth value.
;;;
;;; These are for the error message when share fails.
(define (array:index-ref ind k)
(if (vector? ind)
(vector-ref ind k)
(vector-ref
(array:vector ind)
(array:actor-index (array:index ind) k))))
(define (array:index-set! ind k o)
(if (vector? ind)
(vector-set! ind k o)
(vector-set!
(array:vector ind)
(array:actor-index (array:index ind) k)
o)))
(define (array:index-length ind)
(if (vector? ind)
(vector-length ind)
(vector-ref (array:shape ind) 1)))
(define (array:map->string proc r)
(let* ((m (array:grok/arguments proc r))
(s (vector-ref (array:shape m) 3)))
(do ((i "" (string-append i c "k" (number->string k)))
(c "" ", ")
(k 1 (+ k 1)))
((< r k)
(do ((o "" (string-append o c (array:map-column->string m r k)))
(c "" ", ")
(k 0 (+ k 1)))
((= k s)
(string-append i " => " o)))))))
(define (array:map-column->string m r k)
(let ((v (array:vector m))
(i (array:index m)))
(let ((n0 (vector-ref v (array:vector-index i (list 0 k)))))
(let wok ((j 1)
(e (if (= n0 0) "" (number->string n0))))
(if (<= j r)
(let ((nj (vector-ref v (array:vector-index i (list j k)))))
(if (= nj 0)
(wok (+ j 1) e)
(let* ((nj (if (= nj 1) ""
(if (= nj -1) "-"
(string-append (number->string nj)
" "))))
(njkj (string-append nj "k" (number->string j))))
(if (string=? e "")
(wok (+ j 1) njkj)
(wok (+ j 1) (string-append e " + " njkj))))))
(if (string=? e "") "0" e))))))
(define (array:grok/arguments proc r)
(array:grok/index!
(lambda (vec)
(call-with-values
(lambda ()
(array:apply-to-vector r proc vec))
vector))
(make-vector r)))
(define (array:grok/index! proc in)
(let ((m (array:index-length in)))
(do ((k 0 (+ k 1)))
((= k m))
(array:index-set! in k 0))
(let* ((n0 (proc in))
(n (array:index-length n0)))
(let ((arr (make-array (shape 0 (+ m 1) 0 n)))) ; (*)
(do ((k 0 (+ k 1)))
((= k n))
(array-set! arr 0 k (array:index-ref n0 k))) ; (**)
(do ((j 0 (+ j 1)))
((= j m))
(array:index-set! in j 1)
(let ((nj (proc in)))
(array:index-set! in j 0)
(do ((k 0 (+ k 1)))
((= k n))
(array-set! arr (+ j 1) k (- (array:index-ref nj k) ; (**)
(array:index-ref n0 k))))))
arr))))
;; (*) Should not use `make-array' and `shape' here
;; (**) Should not use `array-set!' here
;; Should use something internal to the library instead: either lower
;; level code (preferable but complex) or alternative names to these same.
|