basedpl 0.1.58__tar.gz → 0.1.60__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Potentially problematic release.


This version of basedpl might be problematic. Click here for more details.

Files changed (457) hide show
  1. {basedpl-0.1.58 → basedpl-0.1.60}/Cargo.lock +14 -13
  2. {basedpl-0.1.58 → basedpl-0.1.60}/Cargo.toml +3 -3
  3. {basedpl-0.1.58 → basedpl-0.1.60}/DEV.md +22 -14
  4. {basedpl-0.1.58 → basedpl-0.1.60}/PKG-INFO +2 -2
  5. {basedpl-0.1.58 → basedpl-0.1.60}/editors/jetbrains/BPL.tmbundle/Syntaxes/bpl.tmLanguage.json +1 -1
  6. {basedpl-0.1.58 → basedpl-0.1.60}/editors/jetbrains/BPL.xml +10 -0
  7. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-de.bundle/Contents/Resources/BasedPL-de.keylayout +1 -0
  8. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-es.bundle/Contents/Resources/BasedPL-es.keylayout +1 -0
  9. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-fr.bundle/Contents/Resources/BasedPL-fr.keylayout +1 -0
  10. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-uk.bundle/Contents/Resources/BasedPL-uk.keylayout +1 -0
  11. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-us.bundle/Contents/Resources/BasedPL-us.keylayout +1 -0
  12. {basedpl-0.1.58 → basedpl-0.1.60}/editors/vim/syntax/bpl.vim +1 -1
  13. {basedpl-0.1.58 → basedpl-0.1.60}/editors/windows/layout.h +1 -0
  14. {basedpl-0.1.58 → basedpl-0.1.60}/lib/dyalog.bpl +3 -3
  15. {basedpl-0.1.58 → basedpl-0.1.60}/lib/numeric.bpl +3 -3
  16. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/assignment.ipynb +1 -1
  17. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/bpl.xml +1 -1
  18. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/comparison.qmd +4 -4
  19. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/distributions.ipynb +25 -7
  20. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/evaluation.qmd +21 -3
  21. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/fonts/SAX2B.ttf +0 -0
  22. basedpl-0.1.60/nbs/fonts/SAX2B.woff2 +0 -0
  23. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/getting-started.ipynb +2 -2
  24. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/brackets.qmd +6 -4
  25. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle-times.qmd +2 -0
  26. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/colon.qmd +2 -0
  27. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/diaeresis.qmd +2 -0
  28. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/diamond-underbar.qmd +6 -0
  29. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/dot.qmd +2 -2
  30. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/exclamation.qmd +2 -0
  31. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/inverted-question.qmd +1 -1
  32. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/jot-diaeresis.qmd +5 -3
  33. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/partial.qmd +3 -3
  34. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/quad-diamond.qmd +2 -0
  35. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/squad.qmd +23 -8
  36. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/stile-tilde.qmd +1 -1
  37. basedpl-0.1.60/nbs/glyphs/superscript-b.qmd +25 -0
  38. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs.qmd +3 -2
  39. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/indexing.ipynb +50 -4
  40. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/keyboard.qmd +1 -1
  41. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/keyed.ipynb +14 -14
  42. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/llms.txt +5 -3
  43. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/magics.ipynb +13 -11
  44. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/notebooks.ipynb +4 -4
  45. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/numbers.qmd +2 -2
  46. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/python.ipynb +1326 -235
  47. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/scripts.ipynb +22 -2
  48. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/style.qmd +1 -1
  49. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/syntax.qmd +1 -1
  50. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/explain.qmd +16 -4
  51. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/prefs.qmd +4 -1
  52. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/rand.qmd +1 -1
  53. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/terms.qmd +1 -0
  54. {basedpl-0.1.58 → basedpl-0.1.60}/provenance/README.md +1 -1
  55. {basedpl-0.1.58 → basedpl-0.1.60}/py/Cargo.toml +2 -1
  56. {basedpl-0.1.58 → basedpl-0.1.60}/py/src/lib.rs +129 -18
  57. {basedpl-0.1.58 → basedpl-0.1.60}/pyproject.toml +1 -1
  58. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/__init__.py +51 -40
  59. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/bpl.tmLanguage.json +1 -1
  60. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/bpltests.py +12 -9
  61. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/font.py +1 -1
  62. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/functions.py +34 -8
  63. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/layout.json +1 -1
  64. basedpl-0.1.60/src/agreement.rs +97 -0
  65. {basedpl-0.1.58 → basedpl-0.1.60}/src/array/storage.rs +64 -88
  66. {basedpl-0.1.58 → basedpl-0.1.60}/src/array/text.rs +8 -7
  67. {basedpl-0.1.58 → basedpl-0.1.60}/src/array.rs +94 -134
  68. basedpl-0.1.60/src/batch.rs +363 -0
  69. {basedpl-0.1.58 → basedpl-0.1.60}/src/derivative.rs +364 -236
  70. {basedpl-0.1.58 → basedpl-0.1.60}/src/display.rs +22 -19
  71. {basedpl-0.1.58 → basedpl-0.1.60}/src/distribution.rs +55 -27
  72. {basedpl-0.1.58 → basedpl-0.1.60}/src/error.rs +7 -3
  73. {basedpl-0.1.58 → basedpl-0.1.60}/src/eval/assign.rs +13 -7
  74. {basedpl-0.1.58 → basedpl-0.1.60}/src/eval/binder.rs +196 -87
  75. {basedpl-0.1.58 → basedpl-0.1.60}/src/eval/idioms.rs +9 -12
  76. {basedpl-0.1.58 → basedpl-0.1.60}/src/eval/operators.rs +328 -272
  77. {basedpl-0.1.58 → basedpl-0.1.60}/src/eval/session.rs +41 -37
  78. basedpl-0.1.60/src/eval/tree.rs +263 -0
  79. {basedpl-0.1.58 → basedpl-0.1.60}/src/eval.rs +76 -59
  80. {basedpl-0.1.58 → basedpl-0.1.60}/src/explain.rs +8 -3
  81. {basedpl-0.1.58 → basedpl-0.1.60}/src/fusion/blocks.rs +10 -11
  82. {basedpl-0.1.58 → basedpl-0.1.60}/src/fusion.rs +125 -68
  83. {basedpl-0.1.58 → basedpl-0.1.60}/src/image/imageio.rs +3 -3
  84. {basedpl-0.1.58 → basedpl-0.1.60}/src/js.rs +1 -0
  85. {basedpl-0.1.58 → basedpl-0.1.60}/src/json.rs +3 -1
  86. {basedpl-0.1.58 → basedpl-0.1.60}/src/keyed.rs +2 -3
  87. {basedpl-0.1.58 → basedpl-0.1.60}/src/lib.rs +2 -0
  88. {basedpl-0.1.58 → basedpl-0.1.60}/src/linear.rs +112 -58
  89. {basedpl-0.1.58 → basedpl-0.1.60}/src/number.rs +42 -36
  90. {basedpl-0.1.58 → basedpl-0.1.60}/src/pervasive.rs +89 -25
  91. {basedpl-0.1.58 → basedpl-0.1.60}/src/primitive/indexing.rs +176 -102
  92. {basedpl-0.1.58 → basedpl-0.1.60}/src/primitive/numeric.rs +27 -13
  93. {basedpl-0.1.58 → basedpl-0.1.60}/src/primitive/search.rs +47 -22
  94. {basedpl-0.1.58 → basedpl-0.1.60}/src/primitive/structural.rs +10 -16
  95. {basedpl-0.1.58 → basedpl-0.1.60}/src/primitive.rs +289 -148
  96. {basedpl-0.1.58 → basedpl-0.1.60}/src/protocol.rs +2 -1
  97. {basedpl-0.1.58 → basedpl-0.1.60}/src/reference.rs +79 -44
  98. {basedpl-0.1.58 → basedpl-0.1.60}/src/search.rs +1 -1
  99. {basedpl-0.1.58 → basedpl-0.1.60}/src/selection.rs +3 -3
  100. {basedpl-0.1.58 → basedpl-0.1.60}/src/symbols.rs +3 -4
  101. {basedpl-0.1.58 → basedpl-0.1.60}/src/syntax.rs +34 -10
  102. {basedpl-0.1.58 → basedpl-0.1.60}/src/system.rs +18 -10
  103. basedpl-0.1.60/src/transform.rs +432 -0
  104. {basedpl-0.1.58 → basedpl-0.1.60}/tests/core.rs +1 -2
  105. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/README.md +3 -3
  106. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/aplcart.bpl +4 -4
  107. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/april.bpl +12 -12
  108. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/core.bpl +592 -29
  109. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/distributions.bpl +73 -4
  110. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/ngn.bpl +3 -3
  111. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference.rs +5 -2
  112. {basedpl-0.1.58 → basedpl-0.1.60}/tests/speed.txt +62 -18
  113. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_api.py +126 -42
  114. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_basic.py +19 -4
  115. basedpl-0.1.58/nbs/fonts/SAX2B.woff2 +0 -0
  116. basedpl-0.1.58/src/agreement.rs +0 -35
  117. {basedpl-0.1.58 → basedpl-0.1.60}/.cargo/config.toml +0 -0
  118. {basedpl-0.1.58 → basedpl-0.1.60}/.gitattributes +0 -0
  119. {basedpl-0.1.58 → basedpl-0.1.60}/.github/workflows/ci.yml +0 -0
  120. {basedpl-0.1.58 → basedpl-0.1.60}/.github/workflows/docs.yml +0 -0
  121. {basedpl-0.1.58 → basedpl-0.1.60}/.github/workflows/speed.yml +0 -0
  122. {basedpl-0.1.58 → basedpl-0.1.60}/.github/workflows/test.yml +0 -0
  123. {basedpl-0.1.58 → basedpl-0.1.60}/.gitignore +0 -0
  124. {basedpl-0.1.58 → basedpl-0.1.60}/CONTRIBUTING.md +0 -0
  125. {basedpl-0.1.58 → basedpl-0.1.60}/LICENSE +0 -0
  126. {basedpl-0.1.58 → basedpl-0.1.60}/README.md +0 -0
  127. {basedpl-0.1.58 → basedpl-0.1.60}/_config.yml +0 -0
  128. {basedpl-0.1.58 → basedpl-0.1.60}/_layouts/default.html +0 -0
  129. {basedpl-0.1.58 → basedpl-0.1.60}/build.rs +0 -0
  130. {basedpl-0.1.58 → basedpl-0.1.60}/editors/jetbrains/BPL.tmbundle/info.plist +0 -0
  131. {basedpl-0.1.58 → basedpl-0.1.60}/editors/jetbrains/README.md +0 -0
  132. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-de.bundle/Contents/Info.plist +0 -0
  133. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-de.bundle/Contents/Resources/BasedPL-de.icns +0 -0
  134. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-de.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  135. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-de.bundle/Contents/version.plist +0 -0
  136. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-de.txt +0 -0
  137. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-es.bundle/Contents/Info.plist +0 -0
  138. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-es.bundle/Contents/Resources/BasedPL-es.icns +0 -0
  139. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-es.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  140. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-es.bundle/Contents/version.plist +0 -0
  141. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-es.txt +0 -0
  142. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-fr.bundle/Contents/Info.plist +0 -0
  143. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-fr.bundle/Contents/Resources/BasedPL-fr.icns +0 -0
  144. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-fr.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  145. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-fr.bundle/Contents/version.plist +0 -0
  146. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-fr.txt +0 -0
  147. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-uk.bundle/Contents/Info.plist +0 -0
  148. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-uk.bundle/Contents/Resources/BasedPL-uk.icns +0 -0
  149. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-uk.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  150. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-uk.bundle/Contents/version.plist +0 -0
  151. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-uk.txt +0 -0
  152. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-us.bundle/Contents/Info.plist +0 -0
  153. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-us.bundle/Contents/Resources/BasedPL-us.icns +0 -0
  154. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-us.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  155. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-us.bundle/Contents/version.plist +0 -0
  156. {basedpl-0.1.58 → basedpl-0.1.60}/editors/macos/BasedPL-us.txt +0 -0
  157. {basedpl-0.1.58 → basedpl-0.1.60}/editors/vim/ftdetect/bpl.vim +0 -0
  158. {basedpl-0.1.58 → basedpl-0.1.60}/editors/windows/README.md +0 -0
  159. {basedpl-0.1.58 → basedpl-0.1.60}/editors/windows/build.ps1 +0 -0
  160. {basedpl-0.1.58 → basedpl-0.1.60}/editors/windows/install.ps1 +0 -0
  161. {basedpl-0.1.58 → basedpl-0.1.60}/editors/windows/keyboard.c +0 -0
  162. {basedpl-0.1.58 → basedpl-0.1.60}/editors/windows/keyboard.def +0 -0
  163. {basedpl-0.1.58 → basedpl-0.1.60}/editors/windows/keyboard.rc +0 -0
  164. {basedpl-0.1.58 → basedpl-0.1.60}/index_files/figure-commonmark/cell-17-output-1.svg +0 -0
  165. {basedpl-0.1.58 → basedpl-0.1.60}/index_files/figure-commonmark/cell-18-output-1.svg +0 -0
  166. {basedpl-0.1.58 → basedpl-0.1.60}/index_files/figure-html/cell-17-output-1.svg +0 -0
  167. {basedpl-0.1.58 → basedpl-0.1.60}/index_files/figure-html/cell-18-output-1.svg +0 -0
  168. {basedpl-0.1.58 → basedpl-0.1.60}/lib/LICENSE-april +0 -0
  169. {basedpl-0.1.58 → basedpl-0.1.60}/lib/README.md +0 -0
  170. {basedpl-0.1.58 → basedpl-0.1.60}/lib/array.bpl +0 -0
  171. {basedpl-0.1.58 → basedpl-0.1.60}/lib/graph.bpl +0 -0
  172. {basedpl-0.1.58 → basedpl-0.1.60}/lib/power.bpl +0 -0
  173. {basedpl-0.1.58 → basedpl-0.1.60}/lib/regex.bpl +0 -0
  174. {basedpl-0.1.58 → basedpl-0.1.60}/lib/string.bpl +0 -0
  175. {basedpl-0.1.58 → basedpl-0.1.60}/lib/tree.bpl +0 -0
  176. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/.gitignore +0 -0
  177. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/_quarto.yml +0 -0
  178. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/arrays.ipynb +0 -0
  179. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/bqn.xml +0 -0
  180. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/bracket-types.ipynb +0 -0
  181. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/cli.qmd +0 -0
  182. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/data.ipynb +0 -0
  183. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/dfns.ipynb +0 -0
  184. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/driver.js +0 -0
  185. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/dyalog.ipynb +0 -0
  186. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/dyalog.xml +0 -0
  187. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/fonts/LICENSE-SAX2 +0 -0
  188. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/fonts/README.md +0 -0
  189. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/fonts.css +0 -0
  190. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/attractor.bpl +0 -0
  191. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/boids.bpl +0 -0
  192. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/dragon.bpl +0 -0
  193. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/flow.bpl +0 -0
  194. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/mandelbrot.bpl +0 -0
  195. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/mandelbrot32.bpl +0 -0
  196. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/orbits.bpl +0 -0
  197. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/phyllotaxis.bpl +0 -0
  198. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/prefs.bpl +0 -0
  199. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery/reaction.bpl +0 -0
  200. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/gallery.qmd +0 -0
  201. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/_metadata.yml +0 -0
  202. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/alpha-underbar.qmd +0 -0
  203. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/alpha.qmd +0 -0
  204. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/at.qmd +0 -0
  205. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/backslash-bar.qmd +0 -0
  206. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/backslash.qmd +0 -0
  207. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/braces.qmd +0 -0
  208. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/bullet.qmd +0 -0
  209. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle-backslash.qmd +0 -0
  210. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle-bar.qmd +0 -0
  211. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle-diaeresis.qmd +0 -0
  212. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle-divide.qmd +0 -0
  213. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle-slash.qmd +0 -0
  214. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle-star.qmd +0 -0
  215. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle-stile.qmd +0 -0
  216. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/circle.qmd +0 -0
  217. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/comma-bar.qmd +0 -0
  218. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/comma.qmd +0 -0
  219. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/del-diaeresis.qmd +0 -0
  220. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/del-stile.qmd +0 -0
  221. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/del.qmd +0 -0
  222. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/delta-stile.qmd +0 -0
  223. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/diamond.qmd +0 -0
  224. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/domino.qmd +0 -0
  225. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/down-arrow.qmd +0 -0
  226. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/down-shoe.qmd +0 -0
  227. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/down-tack.qmd +0 -0
  228. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/downstile.qmd +0 -0
  229. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/epsilon-underbar.qmd +0 -0
  230. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/epsilon.qmd +0 -0
  231. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/equal-underbar-slash.qmd +0 -0
  232. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/equal-underbar.qmd +0 -0
  233. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/equals.qmd +0 -0
  234. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/error-guard.qmd +0 -0
  235. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/greater-than-or-equal.qmd +0 -0
  236. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/greater-than.qmd +0 -0
  237. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/hash.qmd +0 -0
  238. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/hydrant.qmd +0 -0
  239. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/infinity.qmd +0 -0
  240. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/iota-underbar.qmd +0 -0
  241. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/iota.qmd +0 -0
  242. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/jot.qmd +0 -0
  243. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/lamp.qmd +0 -0
  244. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/left-arrow.qmd +0 -0
  245. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/left-shoe-underbar.qmd +0 -0
  246. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/left-shoe.qmd +0 -0
  247. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/left-tack.qmd +0 -0
  248. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/left-tail-arrow.qmd +0 -0
  249. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/less-than-or-equal.qmd +0 -0
  250. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/less-than.qmd +0 -0
  251. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/minus.qmd +0 -0
  252. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/not-equals.qmd +0 -0
  253. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/obelus.qmd +0 -0
  254. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/omega-underbar.qmd +0 -0
  255. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/omega.qmd +0 -0
  256. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/overbar.qmd +0 -0
  257. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/parentheses.qmd +0 -0
  258. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/pi.qmd +0 -0
  259. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/plus.qmd +0 -0
  260. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/quad-colon.qmd +0 -0
  261. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/quad-equal.qmd +0 -0
  262. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/quad-jot.qmd +0 -0
  263. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/quad.qmd +0 -0
  264. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/question.qmd +0 -0
  265. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/quote.qmd +0 -0
  266. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/radical.qmd +0 -0
  267. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/rho.qmd +0 -0
  268. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/right-arrow-from-bar.qmd +0 -0
  269. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/right-left-arrows.qmd +0 -0
  270. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/right-shoe.qmd +0 -0
  271. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/right-tack.qmd +0 -0
  272. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/right-tail-arrow.qmd +0 -0
  273. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/slash-bar.qmd +0 -0
  274. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/slash.qmd +0 -0
  275. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/star-diaeresis.qmd +0 -0
  276. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/star.qmd +0 -0
  277. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/stile.qmd +0 -0
  278. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/thorn.qmd +0 -0
  279. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/tilde-diaeresis.qmd +0 -0
  280. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/tilde.qmd +0 -0
  281. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/times.qmd +0 -0
  282. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/up-arrow.qmd +0 -0
  283. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/up-down-arrow.qmd +0 -0
  284. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/up-shoe.qmd +0 -0
  285. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/up-tack.qmd +0 -0
  286. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/upstile.qmd +0 -0
  287. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/vee-bar.qmd +0 -0
  288. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/vee.qmd +0 -0
  289. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/wedge-bar.qmd +0 -0
  290. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/wedge.qmd +0 -0
  291. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/glyphs/zilde.qmd +0 -0
  292. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/hanzi-notation-zh.ipynb +0 -0
  293. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/hanzi-notation.ipynb +0 -0
  294. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/index.ipynb +0 -0
  295. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/introspection.ipynb +0 -0
  296. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/modules.qmd +0 -0
  297. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/nbdev.yml +0 -0
  298. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/overview.ipynb +0 -0
  299. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/papers/aplwiki-arrays.md +0 -0
  300. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/papers/brickman-depth-1-scalars.md +0 -0
  301. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/papers/mercer-based-system.md +0 -0
  302. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/playground/bpl.js +0 -0
  303. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/playground/gallery.js +0 -0
  304. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/playground/monaco-worker.js +0 -0
  305. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/playground/page.js +0 -0
  306. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/playground/worker.js +0 -0
  307. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/playground.qmd +0 -0
  308. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/plot.ipynb +0 -0
  309. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/principles.ipynb +0 -0
  310. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/processes.qmd +0 -0
  311. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/puppy.jpg +0 -0
  312. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/regex.ipynb +0 -0
  313. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/repl.qmd +0 -0
  314. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/sidebar.yml +0 -0
  315. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/strings.ipynb +0 -0
  316. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/styles.css +0 -0
  317. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/_metadata.yml +0 -0
  318. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/c.qmd +0 -0
  319. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/canvas.qmd +0 -0
  320. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/constants.qmd +0 -0
  321. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/copy.qmd +0 -0
  322. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/csv.qmd +0 -0
  323. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/date.qmd +0 -0
  324. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/decompose.qmd +0 -0
  325. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/deflate.qmd +0 -0
  326. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/delay.qmd +0 -0
  327. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/detach.qmd +0 -0
  328. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/distribution.qmd +0 -0
  329. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/edge.qmd +0 -0
  330. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/element.qmd +0 -0
  331. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/ex.qmd +0 -0
  332. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/fetch.qmd +0 -0
  333. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/float.qmd +0 -0
  334. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/hash.qmd +0 -0
  335. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/host.qmd +0 -0
  336. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/image.qmd +0 -0
  337. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/index.qmd +0 -0
  338. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/js.qmd +0 -0
  339. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/json.qmd +0 -0
  340. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/literal.qmd +0 -0
  341. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/load.qmd +0 -0
  342. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/memory.qmd +0 -0
  343. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/metadata.qmd +0 -0
  344. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/mime.qmd +0 -0
  345. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/mkdir.qmd +0 -0
  346. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/nc.qmd +0 -0
  347. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/nget.qmd +0 -0
  348. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/nl.qmd +0 -0
  349. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/normalize.qmd +0 -0
  350. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/nput.qmd +0 -0
  351. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/path.qmd +0 -0
  352. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/plot.qmd +0 -0
  353. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/r.qmd +0 -0
  354. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/readdir.qmd +0 -0
  355. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/remove.qmd +0 -0
  356. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/rename.qmd +0 -0
  357. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/signal.qmd +0 -0
  358. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/src.qmd +0 -0
  359. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/storage.qmd +0 -0
  360. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/svg.qmd +0 -0
  361. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/time.qmd +0 -0
  362. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/ucs.qmd +0 -0
  363. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/uuid.qmd +0 -0
  364. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/vfi.qmd +0 -0
  365. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system/xml.qmd +0 -0
  366. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/system-functions.qmd +0 -0
  367. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/web.ipynb +0 -0
  368. {basedpl-0.1.58 → basedpl-0.1.60}/nbs/xml.ipynb +0 -0
  369. {basedpl-0.1.58 → basedpl-0.1.60}/package-lock.json +0 -0
  370. {basedpl-0.1.58 → basedpl-0.1.60}/package.json +0 -0
  371. {basedpl-0.1.58 → basedpl-0.1.60}/provenance/aplcart.jsonl +0 -0
  372. {basedpl-0.1.58 → basedpl-0.1.60}/provenance/april.jsonl +0 -0
  373. {basedpl-0.1.58 → basedpl-0.1.60}/provenance/bqn.jsonl +0 -0
  374. {basedpl-0.1.58 → basedpl-0.1.60}/provenance/core.jsonl +0 -0
  375. {basedpl-0.1.58 → basedpl-0.1.60}/provenance/dyalog.jsonl +0 -0
  376. {basedpl-0.1.58 → basedpl-0.1.60}/provenance/ngn.jsonl +0 -0
  377. {basedpl-0.1.58 → basedpl-0.1.60}/py/build.rs +0 -0
  378. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/_modidx.py +0 -0
  379. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/dyalog.py +0 -0
  380. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/editors.py +0 -0
  381. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/fonts.css +0 -0
  382. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/input.js +0 -0
  383. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/ipython.py +0 -0
  384. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/keyboards.json +0 -0
  385. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/keyboards.py +0 -0
  386. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/lb.js +0 -0
  387. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/notebook_runner.py +0 -0
  388. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/notebooks.py +0 -0
  389. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/printing.py +0 -0
  390. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/reference.py +0 -0
  391. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/syntax.py +0 -0
  392. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/windows_keyboard.py +0 -0
  393. {basedpl-0.1.58 → basedpl-0.1.60}/python/basedpl/worker.py +0 -0
  394. {basedpl-0.1.58 → basedpl-0.1.60}/rustfmt.toml +0 -0
  395. {basedpl-0.1.58 → basedpl-0.1.60}/scripts/install-macos.sh +0 -0
  396. {basedpl-0.1.58 → basedpl-0.1.60}/scripts/prep.py +0 -0
  397. {basedpl-0.1.58 → basedpl-0.1.60}/src/canvas.js +0 -0
  398. {basedpl-0.1.58 → basedpl-0.1.60}/src/canvas.rs +0 -0
  399. {basedpl-0.1.58 → basedpl-0.1.60}/src/csv.rs +0 -0
  400. {basedpl-0.1.58 → basedpl-0.1.60}/src/data.rs +0 -0
  401. {basedpl-0.1.58 → basedpl-0.1.60}/src/date.rs +0 -0
  402. {basedpl-0.1.58 → basedpl-0.1.60}/src/element.rs +0 -0
  403. {basedpl-0.1.58 → basedpl-0.1.60}/src/eval/dissect.rs +0 -0
  404. {basedpl-0.1.58 → basedpl-0.1.60}/src/execution.rs +0 -0
  405. {basedpl-0.1.58 → basedpl-0.1.60}/src/files.rs +0 -0
  406. {basedpl-0.1.58 → basedpl-0.1.60}/src/host.rs +0 -0
  407. {basedpl-0.1.58 → basedpl-0.1.60}/src/host_web.rs +0 -0
  408. {basedpl-0.1.58 → basedpl-0.1.60}/src/image/codecs.rs +0 -0
  409. {basedpl-0.1.58 → basedpl-0.1.60}/src/image.rs +0 -0
  410. {basedpl-0.1.58 → basedpl-0.1.60}/src/inspection.rs +0 -0
  411. {basedpl-0.1.58 → basedpl-0.1.60}/src/number_theory.rs +0 -0
  412. {basedpl-0.1.58 → basedpl-0.1.60}/src/optimize.rs +0 -0
  413. {basedpl-0.1.58 → basedpl-0.1.60}/src/plot.rs +0 -0
  414. {basedpl-0.1.58 → basedpl-0.1.60}/src/polynomial.rs +0 -0
  415. {basedpl-0.1.58 → basedpl-0.1.60}/src/regex.rs +0 -0
  416. {basedpl-0.1.58 → basedpl-0.1.60}/src/timing.rs +0 -0
  417. {basedpl-0.1.58 → basedpl-0.1.60}/src/xml.rs +0 -0
  418. {basedpl-0.1.58 → basedpl-0.1.60}/tests/conftest.py +0 -0
  419. {basedpl-0.1.58 → basedpl-0.1.60}/tests/derivatives.rs +0 -0
  420. {basedpl-0.1.58 → basedpl-0.1.60}/tests/explain.rs +0 -0
  421. {basedpl-0.1.58 → basedpl-0.1.60}/tests/highlighting.mjs +0 -0
  422. {basedpl-0.1.58 → basedpl-0.1.60}/tests/input.mjs +0 -0
  423. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/LICENSE-aplcart +0 -0
  424. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/LICENSE-april +0 -0
  425. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/LICENSE-bqn +0 -0
  426. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/LICENSE-bqncrate +0 -0
  427. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/LICENSE-dyalog +0 -0
  428. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/LICENSE-ngn +0 -0
  429. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/bqn.bpl +0 -0
  430. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/dyalog.bpl +0 -0
  431. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/graphics.bpl +0 -0
  432. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/lib.bpl +0 -0
  433. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/regex.bpl +0 -0
  434. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/support/april.bpl +0 -0
  435. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/support/avl.bpl +0 -0
  436. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/support/redblack.bpl +0 -0
  437. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/support/sbst.bpl +0 -0
  438. {basedpl-0.1.58 → basedpl-0.1.60}/tests/reference/support/splay.bpl +0 -0
  439. {basedpl-0.1.58 → basedpl-0.1.60}/tests/scaling.rs +0 -0
  440. {basedpl-0.1.58 → basedpl-0.1.60}/tests/speed.rs +0 -0
  441. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_bpltests.py +0 -0
  442. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_glyphs.py +0 -0
  443. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_graphics.py +0 -0
  444. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_ipython.py +0 -0
  445. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_kernel.py +0 -0
  446. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_keylayout.py +0 -0
  447. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_notebooks.py +0 -0
  448. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_reference.py +0 -0
  449. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_repl.py +0 -0
  450. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_windows_keyboard.py +0 -0
  451. {basedpl-0.1.58 → basedpl-0.1.60}/tests/test_worker.py +0 -0
  452. {basedpl-0.1.58 → basedpl-0.1.60}/tests/units.rs +0 -0
  453. {basedpl-0.1.58 → basedpl-0.1.60}/tests/wasm-pkg.mjs +0 -0
  454. {basedpl-0.1.58 → basedpl-0.1.60}/tests/wasm-speed.mjs +0 -0
  455. {basedpl-0.1.58 → basedpl-0.1.60}/tests/wasm.mjs +0 -0
  456. {basedpl-0.1.58 → basedpl-0.1.60}/tests/windows_keyboard.c +0 -0
  457. {basedpl-0.1.58 → basedpl-0.1.60}/wheel/data/share/jupyter/kernels/bpl/kernel.json +0 -0
@@ -93,7 +93,7 @@ checksum = "ac07cdecf99051d9a5238b80f35af32cdeba5b336e55d957b318b50137e18da5"
93
93
 
94
94
  [[package]]
95
95
  name = "basedpl"
96
- version = "0.1.58"
96
+ version = "0.1.60"
97
97
  dependencies = [
98
98
  "base64 0.23.1",
99
99
  "bytemuck",
@@ -139,7 +139,7 @@ dependencies = [
139
139
 
140
140
  [[package]]
141
141
  name = "basedpl-cli"
142
- version = "0.1.58"
142
+ version = "0.1.60"
143
143
  dependencies = [
144
144
  "async-trait",
145
145
  "basedpl",
@@ -153,7 +153,7 @@ dependencies = [
153
153
 
154
154
  [[package]]
155
155
  name = "basedpl-py"
156
- version = "0.1.58"
156
+ version = "0.1.60"
157
157
  dependencies = [
158
158
  "basedpl",
159
159
  "num-bigint",
@@ -161,13 +161,14 @@ dependencies = [
161
161
  "num-rational",
162
162
  "pyo3",
163
163
  "pyo3-build-config",
164
+ "rustymath",
164
165
  "rustymath-buffer",
165
166
  "serde_json",
166
167
  ]
167
168
 
168
169
  [[package]]
169
170
  name = "basedpl-wasm"
170
- version = "0.1.58"
171
+ version = "0.1.60"
171
172
  dependencies = [
172
173
  "basedpl",
173
174
  "js-sys",
@@ -859,9 +860,9 @@ dependencies = [
859
860
 
860
861
  [[package]]
861
862
  name = "json5"
862
- version = "1.3.2"
863
+ version = "1.3.3"
863
864
  source = "registry+https://github.com/rust-lang/crates.io-index"
864
- checksum = "c77a3f1d413a994290ebe4f96047763a84d04a1f31492c51328402986d7fe5fa"
865
+ checksum = "6efe947c4a8f66438994e559a1e1309ae2a315cabf67476f155e27281f11cbc1"
865
866
  dependencies = [
866
867
  "serde",
867
868
  "ucd-trie",
@@ -1415,9 +1416,9 @@ dependencies = [
1415
1416
 
1416
1417
  [[package]]
1417
1418
  name = "rustymath"
1418
- version = "0.1.35"
1419
+ version = "0.1.37"
1419
1420
  source = "registry+https://github.com/rust-lang/crates.io-index"
1420
- checksum = "1816c6f17d66e4aa29bc1652afd9679746db47f73c00f126dbd68979a5d1f087"
1421
+ checksum = "e3573ba578a66a7c824b2c8c363944de6554fbc4e013c844a28c3ea05b3005aa"
1421
1422
  dependencies = [
1422
1423
  "half",
1423
1424
  "hashbrown 0.17.1",
@@ -1434,9 +1435,9 @@ dependencies = [
1434
1435
 
1435
1436
  [[package]]
1436
1437
  name = "rustymath-buffer"
1437
- version = "0.1.35"
1438
+ version = "0.1.37"
1438
1439
  source = "registry+https://github.com/rust-lang/crates.io-index"
1439
- checksum = "0a895306248b69ae1bb1bf0b93f71262578f1fb367fb652534cc8a8616b08b25"
1440
+ checksum = "4a278e395c7e860372e8c8a1f4d4228f21232ac10f94955aff83dbffc3d497cf"
1440
1441
  dependencies = [
1441
1442
  "pyo3",
1442
1443
  "rustymath",
@@ -1700,9 +1701,9 @@ dependencies = [
1700
1701
 
1701
1702
  [[package]]
1702
1703
  name = "tokio"
1703
- version = "1.53.3"
1704
+ version = "1.54.0"
1704
1705
  source = "registry+https://github.com/rust-lang/crates.io-index"
1705
- checksum = "ce3335fa71841cda333a58d7615b03901380ecf09d59b3296d21f8bbac0dde4e"
1706
+ checksum = "a0c168a474b95bfecfe908a65d4bdffc523144b649a74c09c286afb35d53e0bc"
1706
1707
  dependencies = [
1707
1708
  "bytes",
1708
1709
  "libc",
@@ -2092,7 +2093,7 @@ checksum = "3ad82d2a33cdc9674dc7465672f271e096168fcdbe0f799d9e6db8c5892679dc"
2092
2093
 
2093
2094
  [[package]]
2094
2095
  name = "xtask"
2095
- version = "0.1.58"
2096
+ version = "0.1.60"
2096
2097
  dependencies = [
2097
2098
  "anyhow",
2098
2099
  "rustymath",
@@ -5,8 +5,8 @@ members = ["py"]
5
5
  join_comments = true
6
6
 
7
7
  [workspace.package]
8
- version = "0.1.58"
9
- edition = "2021"
8
+ version = "0.1.60"
9
+ edition = "2024"
10
10
  rust-version = "1.98"
11
11
  license = "Apache-2.0"
12
12
 
@@ -60,7 +60,7 @@ num-complex = { version = ">=0.4.6, <1", features = ["bytemuck"] }
60
60
  num-bigint = ">=0.4.6, <0.5"
61
61
  num-traits = ">=0.2.19, <1"
62
62
  half = { version = ">=2.7.1, <3", features = ["num-traits", "bytemuck"] }
63
- rustymath = { version = ">=0.1.35, <1", default-features = false }
63
+ rustymath = { version = ">=0.1.37, <1", default-features = false }
64
64
  strength_reduce = ">=0.2.4, <1"
65
65
  rand = { version = ">=0.10.2, <1", features = ["chacha"] }
66
66
  # AnswerDotAI's fork measures text with a canvas, which works in a Web Worker: plotters-rs/plotters#746.
@@ -16,17 +16,17 @@ cargo test
16
16
  pytest
17
17
  ```
18
18
 
19
- Use `cargo develop` to rebuild and install the native extension and `bpl` after Rust changes. It uses the `test` profile shared with `cargo test`. Cargo tests compile missing code but don't install it. Run plain `cargo test` while you work; use one test binary for a focused check. Run `pytest` at the end of a piece of work. Give builds three minutes and test runs one minute; Cargo serializes builds in the same target directory.
19
+ Use `cargo develop` to rebuild and install the native extension and `bpl` after Rust changes. It uses the `test` profile shared with `cargo test`. Cargo tests compile missing code but don't install it. Run plain `cargo test` while you work; use one test binary for a focused check. Run `pytest` at the end of a piece of work. Before you report a `pytest` failure in code you didn't touch, run `cargo develop` and rerun it. Give builds three minutes and test runs one minute; Cargo serializes builds in the same target directory.
20
20
 
21
21
  Build nothing else without discussion: no scratch crates, alternate target directories, `--release`, `-p` or other-target builds. The documented build diagnostics, browser work and x86-64 inspection below are exceptions. Don't use `maturin develop`; its configuration does not reuse the normal local build.
22
22
 
23
23
  When another agent's unfinished edits stop the shared tree compiling, run `cargo wait` with the Bash tool's `run_in_background`, then build after it exits. `cargo wait` comes from `fastws-cli`, as `cargo develop` does. It runs `cargo check` on every target of the workspace each time a source file or manifest of a local package changes, rustymath's included. It exits once the tree compiles, or after 30 minutes with the remaining errors. `cargo wait --path ~/aai-ws/rustymath` waits for rustymath's own workspace, its Python extension included. Use it rather than writing a wait loop.
24
24
 
25
- An already-running Python process retains its loaded extension. In a kernel, use `from basedpl.worker import fresh; fresh(code)` to check the installed `bpl` in a fresh worker instead of restarting the kernel. A BPL error raises `BplError`. `fresh(code, bpl=PATH)` runs a saved copy of `bpl`, such as the baseline described below. Check one expression and read its result before building on it. `basedpl.bpltests.check_file` and `check_page` check reference files and documentation through the worker without building Rust.
25
+ An already-running Python process retains its loaded extension. In a kernel, use `from basedpl.worker import fresh; fresh(code)` to check the installed `bpl` in a fresh worker instead of restarting the kernel. A BPL error raises `BplError`. `fresh(code, bpl=PATH)` runs a saved copy of `bpl`, such as the baseline described below. Check one expression and read its result before building on it. `basedpl.bpltests.check_file` and `check_page` check reference files and documentation through the worker without building Rust. With `bpl=PATH`, they check a saved copy without installing it.
26
26
 
27
27
  Measure with `BASEDPL_COSTS=1 cargo test --test speed` or `basedpl.bpltests.time_cases(cases)`. Both count costs in copies. A copy is the time to write as many floats as the data has items, each negated, into a second buffer. Budgets are single-thread measurements. Use `time_cases(..., threads=...)` separately for scaling. `speed_costs()` reads the cases in `tests/speed.txt`. `cases=` selects expressions, `wasm=DIR` selects a browser build, `bpl=PATH` selects another native `bpl`, such as a saved copy, and `native=True` times rustymath's own linear algebra, which dev builds compile in. `logged_costs(log)` reads CI output. `cargo_costs(path)` runs either project's Rust speed test, and `pytest_costs(path)` runs rustymath's Python speed test.
28
28
 
29
- `bpl-tests NAME ARGUMENT...` runs one of these functions from the shell and prints its result: `check_file`, `check_page`, `time_cases`, `speed_costs`, `cargo_costs`, `pytest_costs` or `wasm_test`. Run long checks and timings this way, not in the shared kernel, which runs one cell at a time for every agent. For example, `bpl-tests time_cases '+/v' --threads 4` times `+/v` on four threads. `bpl-tests NAME -h` lists a function's arguments.
29
+ `bpl-tests NAME ARGUMENT...` runs one of these functions from the shell and prints its result: `check_file`, `check_page`, `time_cases`, `speed_costs`, `cargo_costs`, `pytest_costs` or `wasm_test`. Run long checks and timings this way, not in the shared kernel, which runs one cell at a time for every agent. For example, `bpl-tests time_cases '+/v' --threads 4` times `+/v` on four threads. `time_cases` and `speed_costs` take cases as positional arguments. When a case starts with `-`, put the cases last, after `--`, as in `bpl-tests speed_costs -- '-.×m' '+/v'`. `bpl-tests NAME -h` lists a function's arguments.
30
30
 
31
31
  On each push, the `Test` workflow logs every native cost in its `test` job and every wasm cost in its `wasm` job. Set budgets from these logs. The speed test that writes them times the test-profile build that the budgets limit. `bpl --costs FILE` times the cases in a file in `speed.txt`'s format as the speed test does, and prints each cost with this machine's budget, without failing on a budget. The manual `Speed` workflow runs it on a `dist` build, the profile releases use, on CI's runner, beside its wasm timing. The `Release` workflow runs it on each binary it builds, on GitHub's runners. Their logs show what releases cost, for comparison with the `Test` workflow's. `logged_costs` reads all three workflows' logs. When you review a run, look for costs that changed by more than 20%. Study a slowdown until you know its cause only when it appears in more than one CI run, or when two or more similar cases slow by similar amounts. Treat any other slowdown as normal variation. Never raise budgets mechanically from a run's costs, because mechanical rises can lock in poor performance. Raise a budget only for a slowdown you've studied and judged reasonable, never for normal variation. Each case line in a budget file holds a native budget for macOS on Apple silicon, then one for Linux on CI's x86 runner, then, in basedpl's file, a wasm budget. `set_budgets(native, wasm, cases=cases)` applies the rules in the budget file to the cases that `cases` names. Each native run sets the budgets of its own platform. This Mac's `speed_costs()`, `cargo_costs` and `pytest_costs` set the macOS budgets. `logged_costs(log)` reads a CI log as Linux costs. Time Mac runs that set budgets while no other agent builds or times. Name only the cases whose budgets should change. Without `cases`, it changes every case with a cost. A case can appear in more than one section, such as `[copies]` and `[widths]`. `sections=` limits the change to the sections it names. For a new case that CI hasn't timed, pass this Mac's costs with `untimed=True`. Those costs then set the Linux and wasm budgets, at four times the Mac cost for a budget in copies, as the budget file's header says. Set the new case's macOS budget with a second call, without `untimed`. For a case that runs matrix products or decompositions, take the untimed costs from a run with `native=True`, which `time_cases`, `speed_costs`, `cargo_costs` and `pytest_costs` all take. macOS runs them on Accelerate, while CI runs rustymath's own kernels. `path=` selects one of rustymath's budget files, `tests/speed.txt` or `tests/speed_python.txt`.
32
32
 
@@ -62,7 +62,7 @@ Read the newest `lib<crate>-<hash>.rlib` under `/tmp/aai-ws-x86/x86_64-unknown-l
62
62
 
63
63
  The default workspace members are core, CLI and Python; wasm/xtask build only when requested. Frontends use the core's public API. Core/CLI Rust tests live in `tests/` and `cli/tests/`. Libraries set `test = false` to avoid separate `cfg(test)` builds. Because no build runs `#[cfg(test)]` code, libraries hold no inline tests or test-only counters. Any internal behaviour worth a test, such as whether an expression fuses, is worth knowing for every user too. Tests in `tests/` check it through the public API, such as `•explain`, `•storage` or `•memory`. PyO3 is in its own crate, not an optional core feature. The core uses `serde_json` for the process protocol and data functions.
64
64
 
65
- Rust 1.98 or later supplies algebraic float operations. `test` inherits `release`: opt-level 2, incremental compilation, LTO off, no debug information, overflow checks or debug assertions. `.cargo/config.toml` explicitly enables LLVM's SLP vectorizer and targets x86-64-v3 on x86. Target-specific rustflags repeat the SLP setting because they replace build-wide flags. `dist` disables incremental compilation, enables within-crate LTO and strips symbols. Keep these settings aligned with rustymath's.
65
+ Rust 1.98 or later supplies algebraic float operations. `test` inherits `release`: opt-level 2, incremental compilation, LTO off, no debug information, overflow checks or debug assertions. A `debug_assert!` therefore never runs here. Write a check that matters as an always-on test. `.cargo/config.toml` explicitly enables LLVM's SLP vectorizer and targets x86-64-v3 on x86. Target-specific rustflags repeat the SLP setting because they replace build-wide flags. `dist` disables incremental compilation, enables within-crate LTO and strips symbols. Keep these settings aligned with rustymath's.
66
66
 
67
67
  `fastws`'s `cargo develop` builds profile `test`, installs the extension and stages `bpl` into the venv. `py/` enables PyO3's `extension-module` and supplies its link arguments without libpython. Editable installs use `fastws.build_backend`; they install metadata and a path to `python/` without compiling Rust. After a standalone `uv sync` or editable pip install, run `cargo develop`. `ws-sync` performs that rebuild after syncing. Wheels use maturin for the extension and `cargo stage` for the Python-free CLI. Linux staging runs inside the manylinux container.
68
68
 
@@ -76,9 +76,9 @@ Use published dependency ranges with the lower bounds required by the APIs in us
76
76
 
77
77
  ### Codegen and rebuilds
78
78
 
79
- LTO-off incremental builds keep an edit from recompiling every caller that inlined it. Measured on 18 October 2026 in a local incremental build, thin-local LTO doubled the rebuild after a one-line edit that recompiles large units, from about 8 s to about 18 s, cut the calls from `Steps::combined` into other units from 21 to 8, and moved the speed cases by 5% or less. Moving lines changes the code below them, because each panic site, such as a bounds check, holds its line. Every unit that holds that code then recompiles. Related source is split into child modules to limit those shifts. For example, `fusion/blocks.rs` holds the generic block runner of `fusion.rs`. A line added to `Graph::run` then recompiles one small unit in about 2 s, against about 9 s when the runner sat below it in the same file. Children use `use super::*` and expose items to parents and siblings with `pub(super)`. Parents own public re-exports.
79
+ LTO-off incremental builds keep an edit from recompiling every caller that inlined it. Measured on 18 October 2026 in a local incremental build, thin-local LTO doubled the rebuild after a one-line edit that recompiles large units, from about 8 s to about 18 s, cut the calls from `Steps::combined` into other units from 21 to 8, and moved the speed cases by 5% or less. Moving lines changes the code below them, because each panic site, such as a bounds check, holds its line. Every unit that holds that code then recompiles. Related source is split into child modules to limit those shifts. For example, `fusion/blocks.rs` holds the generic block runner of `fusion.rs`. After a one-line edit to `Graph::run`, the rebuild recompiles one unit of about 140 KB and takes about 2.4 s. It took about 9 s when the runner sat below it in the same file. Children use `use super::*` and expose items to parents and siblings with `pub(super)`. Parents own public re-exports.
80
80
 
81
- Generic loop instances can concentrate in the defining module's codegen unit. Mark loop helpers `#[inline]` when their instances need to compile with the caller's kernel table, including nested helpers. Kernel tables have separate modules: `booleans`, `wholes`, `float_arithmetic`, `float_kernels` and `complex_kernels`. `at_widths!` gives the concrete widths their own modules. Keep new tables separate and add kernel specializations only for measured gains.
81
+ Generic loop instances can concentrate in the defining module's codegen unit. A closure passed to a generic adapter such as `map` makes an instance that can compile in another codegen unit. Every edit to the closure's function then recompiles that unit. When `Graph::run` built a vector with `map`, an edit to it recompiled a 1.9 MB unit in about 8 s. It now uses a plain loop. Mark loop helpers `#[inline]` when their instances need to compile with the caller's kernel table, including nested helpers. Kernel tables have separate modules: `booleans`, `wholes`, `float_arithmetic`, `float_kernels` and `complex_kernels`. `at_widths!` gives the concrete widths their own modules. Keep new tables separate and add kernel specializations only for measured gains.
82
82
 
83
83
  Use `cargo build --lib --bins --profile test --timings` to inspect the normal build. Its report under `target/cargo-timings/` separates frontend and codegen time. `BASEDPL_UNITS=1 cargo test --test units -- --nocapture` lists large units and their functions. `BASEDPL_SIZES=pattern cargo test --test units -- --nocapture` measures machine code matching a demangled-name regex. `BASEDPL_SIZES` sees only basedpl's own codegen units. `BASEDPL_SIZES_DIFF=old:new cargo test --test units machine_code_growth -- --nocapture` compares two binaries, such as copies of `bpl` from before and after a change, by generic function across every crate. `BASEDPL_CALLS=pattern cargo test --test units -- --nocapture` lists each call from a function whose demangled name matches to a function in another codegen unit, in basedpl's build and in the rustymath rlib it links. LLVM can't inline those calls in this profile. rustymath's DEV.md gives the cause, under "Loops and codegen". After an edit, `BASEDPL_RECOMPILED=pattern cargo test --test units -- --nocapture` lists the units that the rebuild compiled again, each with its biggest functions whose demangled names match. These commands diagnose the current compilation arrangement; don't create scratch builds to approximate it.
84
84
 
@@ -86,7 +86,7 @@ Use `cargo build --lib --bins --profile test --timings` to inspect the normal bu
86
86
 
87
87
  | Files | Responsibility |
88
88
  |---|---|
89
- | `syntax.rs`, `eval/binder.rs` | Structural parse, runtime category binding, trains, dot access and subscripts. |
89
+ | `syntax.rs`, `eval/binder.rs`, `eval/tree.rs` | Structural parse, runtime category binding, trains, dot access and subscripts, and the recordings that dfn statements replay. |
90
90
  | `eval.rs`, `eval/session.rs`, `eval/operators.rs`, `eval/idioms.rs`, `eval/assign.rs` | Shared calls, sessions/modules, operators, fast combinations, scopes and assignments. |
91
91
  | `execution.rs`, `error.rs` | Cancellation, deadlines, input/output and retained diagnostics. |
92
92
  | `array.rs`, `array/storage.rs`, `array/text.rs` | Values, layouts, compact/mixed storage, gathering and source formatting. |
@@ -94,6 +94,8 @@ Use `cargo build --lib --bins --profile test --timings` to inspect the normal bu
94
94
  | `primitive.rs`, `primitive/` | Primitive metadata, ranks/axes, inverses and array operations. Structural glyphs read their arguments, take each result's layout and `Steps` from a plan in rustymath's `structure`, and copy by it. |
95
95
  | `number.rs`, `element.rs`, `pervasive.rs`, `fusion.rs`, `explain.rs` | Numeric domains, item operations, compact kernels, pending arrays with the graphs that compute them, and the events that `•explain` records and the live nodes that `•memory` counts. |
96
96
  | `derivative.rs`, `linear.rs` | `∂`: duals, tags, seeding, the partials table and the rules for operators, and the record of linear calls that reverse mode transposes. |
97
+ | `transform.rs` | The core that running transformations share: one stack of levels, routing to the newest level among a call's arguments, and the read point for code that isn't a call. |
98
+ | `batch.rs` | Batched maps: the batch carrier, the try in `each_pair` that calls the operand of an Each, a Rank, a stencil or an outer product once on batches of its cells while the `batch` pref is on, and the batch rules that routing hands calls to. The pref is on by default. `tests/reference.rs` runs every reference case with it off and on. `bpl-tests check_page PAGE --unbatched` checks a page with it off. |
97
99
  | `search.rs`, `number_theory.rs`, `polynomial.rs`, `distribution.rs` | Array-level adapters to rustymath. |
98
100
  | `system.rs`, `data.rs` | System-function metadata, native functions, options and import rules. |
99
101
  | `csv.rs`, `json.rs`, `xml.rs`, `image.rs`, `plot.rs`, `canvas.rs`, `display.rs` | Formats, rich values and rendering. |
@@ -120,11 +122,13 @@ Module 0 owns session names. Each `•load` runs in a new module, without the ca
120
122
 
121
123
  Dfns run statements in order and return the last statement's value. Final assignments are silent. An absent left argument propagates through the binder's absent-binding rules; default-left assignment runs only when needed. Guard handlers see bindings as they stood at failure; nothing rolls back. Wildcard `∞::` excludes interrupt, timeout and unsupported errors. Explicit named guards can catch them; catching an interrupt clears its flag.
122
124
 
125
+ The binder records a dfn statement's steps on the statement's first evaluation (`eval/tree.rs`). Later evaluations replay that recording: they make the same calls in the same order, checking the category of each name, group and call result against the recorded one. Where a category differs, the binder carries on from the replay's state (`Binder::resumed`). A name can turn a run into an operator, so each replay first checks again the runs that start or end with a node that `Session::names_valence` lists. The binder evaluates a statement every time when the statement assigns, uses dot access or subscripts, selects, derives an operator, builds a train, contains a run that ends in a dyadic operator, or needs more than 8 items on a stack. The parse tree depends on the evaluator, because each `syntax::Statement` holds its own recording. A change to a reduction that the binder records (a drop, a strand, an attach or a call) must change the replay too. `strand`, `attached`, `split_call` and `tail_call` in `eval/binder.rs` serve both. The `_ => rc.fail()` arm in `Binder::reduce` stops recording any statement with a reduction that the replay doesn't cover. The binder then evaluates that statement correctly every time.
126
+
123
127
  Tail calls reuse frames while preserving lexical dependencies. Handlers disable tail reuse. Native call depth is capped at 20,000; the browser cap is 380. A separate 20,000-frame limit bounds retained lexical frames. Late-bound name resolution stops at 128 levels. These are execution limits, not a sandbox against arbitrarily deep source, arrays or function graphs.
124
128
 
125
129
  ## Values, layouts and assignment
126
130
 
127
- `Value` holds a number, character, function, operator or shared array. Compact storage holds a rustymath `buffer::Buffer` of Booleans, narrow integers, width-specific floats or complex numbers, or characters, all of one dtype, and `Items` borrows it as a `buffer::View`. BPL's promotion rules for those dtypes stay in basedpl, as `Promotion` in `array/storage.rs`. A rustymath buffer keeps the dtype it's given, and basedpl picks an integer's width from its values. Mixed storage holds `Value`s and memoizes its prototype and innermost lexical dependency. Other properties are computed when needed. An array holds its layout and its storage in one allocation. Its `Shape` holds ranks 0 to 2 inline, so a small array allocates no shape. Constructors take `impl Into<Shape>`: pass a slice, or an array such as `[n]`, rather than building a `Vec`. A shape, key or name change on a shared array makes a view of the base array's storage and copies no items. A large result of a fusible float call holds a pending call in place of its storage, and computes the storage on the first read (`fusion.rs`). `Value::view` and `from_buffer` are the public width-preserving frontend boundary. They give and take rustymath's `View` and `Buffer`, which basedpl's API re-exports as `basedpl::buffer`.
131
+ `Value` holds a number, character, function, operator or shared array. Compact storage holds a rustymath `buffer::Buffer` of Booleans, narrow integers, width-specific floats or complex numbers, or characters, all of one dtype, and `Items` borrows it as a `buffer::View`. BPL's promotion rules for those dtypes stay in basedpl, as `Promotion` in `array/storage.rs`. A rustymath buffer keeps the dtype it's given, and basedpl picks an integer's width from its values. Mixed storage holds `Value`s and memoizes its prototype and innermost lexical dependency. Other properties are computed when needed. An array holds its layout and its storage in one allocation. Its `Shape` holds ranks 0 to 2 inline, so a small array allocates no shape. Constructors take `impl Into<Shape>`: pass a slice, or an array such as `[n]`, rather than building a `Vec`. A shape, key or name change on a shared array makes a view of the base array's storage and copies no items. A large result of a fusible float call holds a pending call in place of its storage, and computes the storage on the first read (`fusion.rs`). `Value::view` and `imported_buffer` are the public width-preserving frontend boundary. They give and take rustymath's `View` and `Buffer`, which basedpl's API re-exports as `basedpl::buffer`.
128
132
 
129
133
  Atoms, rank-0 arrays and singleton vectors are distinct. Function nodes retain handles, not lexical frames or Python objects. Functions match by their parts; dfns and generators match by identity. Operators can be values and can cross the native Python boundary. Values and function nodes are `Send + Sync`.
130
134
 
@@ -138,9 +142,9 @@ Selective assignment and structural Under share label-based target discovery. Fu
138
142
 
139
143
  Selective assignment removes the binding before writing. `Arc::make_mut` copies only when another holder needs the old array. Repeated targets must read values written by earlier occurrences. `pervasive::scatter` combines each target of `+ - × ÷ ⌈ ⌊` into compact numbers in place, in turn, at the kind that the call computes in, through rustymath's `try_scatter_with`. Other pervasive modifiers group repeated targets into rounds of distinct positions. A target at a fill reads the fill, and its write is dropped. Append updates use `Value::append` when layouts permit it; rank/key/name changes fall back to ordinary catenation. Modified destructuring calls modifiers left to right; ordinary destructuring assigns right to left. An assignment's RHS runs once.
140
144
 
141
- Rank/Each/Outer assemble cells through shared layout/prototype rules. A 0-cell preserves an atom or encloses an array item. For custom operands, empty Each/Outer/Rank calls substitute prototypes for empty arguments and use prototype mode. Explicit effects remain observable when a call runs. Catchable prototype-call failures produce prototype zero, but interrupt, timeout and unsupported errors propagate. Restore prototype mode on success and error.
145
+ Each, Rank, outer products and stencils call their operand through `each_pair` in `eval/operators.rs`. It first tries one batched call (`batch::tried`), then calls the operand once for each cell and assembles the results through shared layout and prototype rules. A 0-cell preserves an atom or encloses an array item. For custom operands, empty Each, Rank, outer product and stencil calls substitute prototypes for empty arguments and use prototype mode. Explicit effects remain observable when a call runs. Catchable prototype-call failures produce prototype zero, but interrupt, timeout and unsupported errors propagate. Restore prototype mode on success and error.
142
146
 
143
- Rank tries `try_bulk` before it calls its operand once for each cell. `try_bulk` takes a call with no frame, `stacked`'s matrix kernels and `pervasive_cells`, then `cell_rule` for a monadic operand. `cell_rule` runs the operand on the whole argument along the cells' axes. A form that `extends` runs whole at a cell rank at least its own. `⊖ , ↑ ↓ ⌷` and rotate-first call their axis forms. A pervasive primitive folds or scans a simple array along the cell's axis. `f/∘,` folds all the cell axes at once. `≢` and `⍴` give constants. A reshape that keeps a cell's items in order is a view. An atop applies its inner function's rule, then Rank for its outer function. Each rule applies only where Rank's mix of the cells' results gives what the whole-array call gives. Nested results, and folds by other functions, keep the call for each cell.
147
+ Rank tries `whole` before `each_pair`. `whole` calls the operand once where neither argument has a frame. It then tries `decomposed`, for `•decompose⍤2` on a stack of matrices, and `whole_cells` for a primitive or a product. `whole_cells` holds Rank's routes for whole arguments, which batched calls share (`batch::whole_call`). In order, they are `primitive::stacked`'s kernels for `+.×`, `⌹` and `-.×` on stacks of matrices, one padded call of a pervasive primitive (`padded_call`), `primitive_cells` for a primitive with one argument or with a left argument that every cell shares, and `paired_cells` for a primitive whose arguments' frames match or whose right argument every cell shares. An argument with no axes besides its cells' is the same in every cell. After `whole_cells`, `whole` tries `pervasive_cells`, for a pervasive primitive under nested Rank, and then, for a monadic operand, `cell_rule`, which also takes folds, atops and a bound left argument. `primitive_cells` runs a primitive on the whole argument along the cells' axes. A form that `extends` runs whole at a cell rank at least its own. Other forms follow the `cells` fact (`CellRule`) in their row of `Primitive::info()`. With it, `⊖ , ↑ ↓ ⌷ #` and rotate-first call their axis forms, `⍉` sends each cell's axes after the frame's, `≢` and `⍴` give constants, and a reshape that keeps a cell's items in order is a view. Any other form with a left argument that every cell shares takes `paired_cells`. `paired_cells` joins each pair of cells for `,` and `⍪`, and calls a form that extends once where both cells are at least its ranks. It first repeats an argument that every cell shares over the frame (`agreement::spread`). A pervasive primitive folds or scans a simple array along the cell's axis (`folded_cells`). `f/∘,` folds all the cell axes at once. An atop applies its inner function's rule, then Rank for its outer function. Each rule applies only where Rank's mix of the cells' results gives what the whole-array call gives. Nested results, and folds by other functions, keep the call for each cell.
144
148
 
145
149
  Axis nodes select/move axes and reuse Rank when the function has no direct axis meaning. Vector-axis reduction uses the general composed-ravel rule, preserving axis order and the whole seed. Single-axis reductions retain direct kernels. Layout-only changes share storage. Structural results retain renderers where their rank permits; scans and in-place changes copy complete layouts. Match ignores renderers.
146
150
 
@@ -186,13 +190,15 @@ Custom elementwise closures use `rustymath::pairs` and its uninitialized append
186
190
 
187
191
  A failed compact kernel leaves placeholder results and triggers a wider/exact/complex or scalar path for the whole call. Complex fallback is shared with `Number` policy. Overflow detection belongs to rustymath: the integer forms of its arithmetic objects, its checked reductions and its checked products. Cheap integer multiplication uses bounds to select an exact width without a per-item overflow check. Add no blanket NaN/signed-zero canonicalization pass; algorithm-specific failure checks and rustymath's SIMD kernels remain part of their algorithms.
188
192
 
189
- `fusion.rs` defers eligible float calls: `Primitive::pervasive_mapped` gives a pending array (`Data::Node` holding a `fusion::Pending`) in place of the result. Pending arrays survive assignment and link to the pending arrays they read. Reading one forces it through `ArrayData::storage`, which builds a `Graph` from the pending calls that only that graph reads and runs it block by block through the same pervasive kernels. Readers that need only the shape, kind or prototype, such as `Value::len` and `Value::environment`, answer without forcing. `Value::force` forces a result, as timing does. Each node writes a block to a buffer that later nodes reuse once its readers have run. A comparison that a later call in the graph reads writes 1 and 0 as floats there (`Dyad::compared`, rustymath's `tolerant::Indicator`). Small graphs run unfused unless a supported reduction consumes them directly. Node-making code stays out of line from dispatch, because inlined code grows the frame that stays on the stack at every recursion level. The module doc owns eligibility rules and limits; don't copy its thresholds here. A structural copy of one source through rustymath `Steps` (`remapped`) whose result has at least `MIN_ITEMS` items gives a pending copy (`fusion::copy`) for any compact kind. Its map is a `Mapping::Steps` with one entry for each result axis. Broadcasting's maps use the same variant. Forcing composes a read of a copy with the copy's map, and moves a read with no repeat or fill under the pervasive calls it reaches (`Pending::resolved`), so `2×⌽v+1` reads `v` backwards in one graph. A read that copies (rustymath's `Mapping::copies`) moves only under a call that reads one array. A call whose two array arguments copy arrays of one layout through one map runs on those arrays, and the map then copies its result once (`fusion::copied_once`). `Graph::block` shrinks a graph's blocks where its buffers wouldn't fit in the cache. Rustymath's `agreement::expanded` reads a forward run in place, and copies anything else through `gather::walk_range`. A copy that no call reads through is walked as `remapped` walks it. Fused and ordinary folds share rustymath's `reduce::along`/`fold_into` traversal. A fold of a copy of windows along its own axis slides over the copy's source instead (`fusion::slide`, through rustymath's `reduce::sliding`). Under `∂`, `fold_rule` takes a maximum's or minimum's positions in such windows from the source (`fusion::picks`).
193
+ `fusion.rs` defers eligible float calls: `Primitive::pervasive_mapped` gives a pending array (`Data::Node` holding a `fusion::Pending`) in place of the result. Pending arrays survive assignment and link to the pending arrays they read. Reading one forces it through `ArrayData::storage`, which builds a `Graph` from the pending calls that only that graph reads and runs it block by block through the same pervasive kernels. Readers that need only the shape, kind or prototype, such as `Value::len` and `Value::environment`, answer without forcing. `Value::force` forces a result, as timing does. Each node writes a block to a buffer that later nodes reuse once its readers have run. A comparison that a later call in the graph reads writes 1 and 0 as floats there (`Dyad::compared`, rustymath's `tolerant::Indicator`). `⍚` and `@[p]` run cases that can't fail on every item and select their results by a Boolean mask (`selected` in `eval/operators.rs`). `fusion::select` defers the select where the mask is such a comparison, and otherwise runs it at once through rustymath's `chosen`. Small graphs run unfused unless a supported reduction consumes them directly. Node-making code stays out of line from dispatch, because inlined code grows the frame that stays on the stack at every recursion level. The module doc owns eligibility rules and limits; don't copy its thresholds here. A structural copy of one source through rustymath `Steps` (`remapped`) whose result has at least `MIN_ITEMS` items gives a pending copy (`fusion::copy`) for any compact kind. Its map is a `Mapping::Steps` with one entry for each result axis. Broadcasting's maps use the same variant. Forcing composes a read of a copy with the copy's map, and moves a read with no repeat or fill under the pervasive calls it reaches (`Pending::resolved`), so `2×⌽v+1` reads `v` backwards in one graph. A read that copies (rustymath's `Mapping::copies`) moves only under a call that reads one array. A call whose two array arguments copy arrays of one layout through one map runs on those arrays, and the map then copies its result once (`fusion::copied_once`). `Graph::block` shrinks a graph's blocks where its buffers wouldn't fit in the cache. Rustymath's `agreement::expanded` reads a forward run in place, and copies anything else through `gather::walk_range`. A copy that no call reads through is walked as `remapped` walks it. Fused and ordinary folds share rustymath's `reduce::along`/`fold_into` traversal. A fold of a copy of windows along its own axis slides over the copy's source instead (`fusion::slide`, through rustymath's `reduce::sliding`). Under `∂`, `fold_rule` takes a maximum's or minimum's positions in such windows from the source (`fusion::picks`).
190
194
 
191
195
  Ordinary pervasive kernels also read pending copies through their maps. `fusion::source` snapshots the source and mapping without taking the pending work, and rustymath composes that mapping with the call's agreement. `pervasive::Input` keeps the snapshot alive while kernels read its storage through existing blocked readers. Folds by rustymath's reductions read a pending copy through `fusion::source` too (`pervasive::mapped_fold`). `reduce::along_mapped` folds a copy that reads a contiguous block of its source with its axes in another order, as `Mapping::block` finds it, in the block's own order. Transposes, reversals and windows that don't overlap read such blocks. Where the totals come out in another order, `pervasive::fold` makes them a copy through the tables that `along_mapped` gives, and the next fold reads that copy as a block again. It reads any other copy block by block. A read of a few items from a pending array goes through `fusion::narrow`, which narrows the pending work to the positions read without consuming it. A chain of copies becomes a read of its source, for any item kind. A call or graph that nothing else holds becomes one over only those positions, when the read takes at most 1 in 128 of its items. Where maps don't compose, as a rotation's doesn't with a take, such a read lists its items' offsets. A pending array that a name holds is computed whole on its first read and keeps its items, so a loop of single reads doesn't compute it again. `fusion::item` serves single items and picks, and `Gather::walk` serves small copies and gathers through `fusion::walk_through`. Checks of a whole input's values, such as bounds and finiteness, read only the items that its logical `ArrayView` selects. Unsupported compositions and dense readers retain the pending array's one cached compact result.
192
196
 
193
197
  `explain.rs` holds the events that `•explain` reports. One check in `Function::reported` serves both `•prefs ["fusion":$t]` and `•explain`: a call that computes a pending argument writes the pref's line and records a `forced` event. `Graph::explained` records a fused group where a graph runs, and where a fold reads through one. `Idiom::call` records each fast combination taken, by the name `Idiom::name` gives. `linear::scatter_add`, and the transpose of a gather that scatters a source's items, record each accumulation. Fusion runs graphs without a session, so events go to a sink on the evaluating thread, which holds them only while `•explain` runs. Outside it, `call` pays one branch on the session's flags. Each record node and pending array holds an `explain::Live` guard, which counts it for the thread that made it until it is dropped, on any thread. `•memory` reports those counts, and `Value::footprint` walks a value's allocations for its `bytes`.
194
198
 
195
- `derivative.rs` implements `∂`. A dual is a tag, a primal and a tangent: `Repr::Dual` for a number and `Data::Dual` for an array, whose primal and tangent can be pending. `call_axis` sends a call with a dual argument to `derivative::call`. It applies the partials table to pervasive glyphs and its own rule to `⌻`, and calls glyphs whose results carry no tangent on the primals. Structural glyphs, Under and selective assignment need no rules, because `Gather` copies a dual's primal and tangent together. A glyph that copies its right argument through one plan, and a broadcast, copy a record tangent as one `Op::Copy` of the plan's `Steps` (`primitive::copied`, `linear::planned`). Its transpose reads through rustymath's `Steps::transposed`: the inverse map for a copy that reads each item at most once, and a correlation for windows that move by 1. A copy of a copy transposes in one read where the composed copy still transposes by reads (`linear::composed`). The record keeps the chain, because recognising windows needs each copy's own shape. A sum along a window's axis transposes as a sliding sum (`linear::slide`), and a spread axis as a sum along it. Windows that move by more than 1 transpose by rustymath's `signal::overlap_add`, which adds each window back where it read (`linear::strided_back`). Other copies, and copies of several sources, keep ids and scatter. `•explain` lists each scatter as an accumulation. In reverse mode, the rule for a `⌈` or `⌊` fold is a sum of the tangent times a mask of each lane's chosen item. Its transpose reads. Mix of a dual whose primal is nested mixes the primal and the tangent apart (`Rule::Parts`). `fold` and scans with `+`, `×`, `⌈` and `⌊`, `+.×` and outer products have rules, and kernels that read numbers directly leave active arguments to their general paths. `Function::apply` sends a call of `⌹` or `⊥` with an active argument to `derivative::operated`, because their rules call `+.×` and scans, which need a `&mut Context` that `call_axis` doesn't have. `expansion` sends monadic `-.×` to `derivative::determinant`. The rules for `⌹` and `-.×` keep the glyph's own result as the primal, so that a function computes the same values with or without `∂`. Their tangents and transposes multiply by `R`, the inverse that `numeric::matrix_inverse` takes from one factorization through rustymath's `linalg::inverse`. `regular_inverse` gives UNSUPPORTED where rustymath's regularity test finds the matrix singular. With only `B` active, `R` is `⌹A`, a pseudoinverse included. With one number in `x`, `f∂ x` runs `f` once with `x` seeded along it. With more, `linearized` runs `f` once with each part of `x` seeded with a record from `linear.rs`: a tangent whose items are never computed, which the same rules extend into a graph of linear calls. `reverse` then reads the Jacobian from the record, by a transpose for each result item or a forward evaluation for each number of `x`, whichever are fewer. A function with a JVP rule that `f∂←g` attached calls the rule with `⍺` a dual of zeros whose tangent is the argument's, so in reverse mode the rule extends the record too (`derivative::attached`). A call of such a function with two arguments gives DOMAIN ERROR wherever `∂` needs a derivative through it (`derivative::two_arguments`). Code that reads a dual array's storage gets its items as number duals, which is correct at per-item speed. A number that reaches code that can't differentiate it gives an UNSUPPORTED error. Writes to bindings outside a `∂` call are recorded and stripped when it returns.
199
+ `derivative.rs` implements `∂`. A dual is a tag, a primal and a tangent: a `transform::Carrier`, held in `Value::Carried` for a number and in `Data::Carried` for an array, whose primal and tangent can be pending. A record of linear calls is the other kind of carrier. Routing (`transform::call` and `transform::route`) hands a call to the newest level among its arguments, as `Value::newest` finds it. It reads their outer layer, but a newer level inside an argument held in mixed storage wins, as an array of dual atoms beside an older dual shows. A call whose newest level is a `∂` call goes to `derivative::call`, which reads how to run it from the form's facts in `Primitive::info()` (`primitive::Facts`). It applies the partials table to pervasive forms and its own rule to `⌻`, and calls forms whose results carry no tangent on the primals. Structural glyphs, Under and selective assignment need no rules. Their own code moves each part of a carried array through the carrier's moves: `Carrier::view`, `Carrier::at`, `Carrier::copied`, and `transform::written` for writes, which a record answers through its ids. `Gather` copies a dual's primal and tangent together through `derivative::Join`. A glyph that copies its right argument through one plan, and a broadcast, copy a record tangent as one `Op::Copy` of the plan's `Steps` (`primitive::copied`, and `Form::Moves`'s `planned`). Its transpose reads through rustymath's `Steps::transposed`: the inverse map for a copy that reads each item at most once, and a correlation for windows that move by 1. A copy of a copy transposes in one read where the composed copy still transposes by reads (`linear::composed`). The record keeps the chain, because recognising windows needs each copy's own shape. A sum along a window's axis transposes as a sliding sum (`linear::slide`), and a spread axis as a sum along it. Windows that move by more than 1 transpose by rustymath's `signal::overlap_add`, which adds each window back where it read (`linear::strided_back`). Other copies, and copies of several sources, keep ids and scatter. `•explain` lists each scatter as an accumulation. In reverse mode, the rule for a `⌈` or `⌊` fold is a sum of the tangent times a mask of each lane's chosen item. Its transpose reads. Mix of a dual whose primal is nested mixes the primal and the tangent apart. `fold` and scans with `+`, `×`, `⌈` and `⌊`, `+.×` and outer products have rules, and kernels that read numbers directly leave active arguments to their general paths. `transform::route` sends a call of `⌹` or `⊥` with an active argument to `derivative::operated`, because their rules call `+.×` and scans, which need a `&mut Context` that `call_axis` doesn't have. With a value that `∂` tracks, Rank's routes for whole arguments leave the two to calls on each cell (`operators::by_cells`), which each take that route. It sends monadic `-.×` to `derivative::determinant`. The rules for `⌹` and `-.×` keep the glyph's own result as the primal, so that a function computes the same values with or without `∂`. Their tangents and transposes multiply by `R`, the inverse that `numeric::matrix_inverse` takes from one factorization through rustymath's `linalg::inverse`. `regular_inverse` gives UNSUPPORTED where rustymath's regularity test finds the matrix singular. With only `B` active, `R` is `⌹A`, a pseudoinverse included. With one number in `x`, `f∂ x` runs `f` once with `x` seeded along it. With more, `linearized` pushes a record level just below its `∂` call's level, then runs `f` once with each part of `x` seeded with a record at that level, from `linear.rs`: a tangent whose items are never computed, which the same rules extend into a graph of linear calls. A call whose newest level is a record level records the linear map that its form's facts name (`linear::call`). `reverse` then reads the Jacobian from the record, by a transpose for each result item or a forward evaluation for each number of `x`, whichever are fewer. A function with a JVP rule that `f∂←g` attached calls the rule with `⍺` a dual of zeros whose tangent is the argument's, so in reverse mode the rule extends the record too (`derivative::attached`). A call of such a function with two arguments gives DOMAIN ERROR wherever `∂` needs a derivative through it (`derivative::two_arguments`). Code that reads a dual array's storage gets its items as dual atoms, which is correct at per-item speed. A rule packs an array that holds its level's duals, at any depth, into one dual before it splits the array (`derivative::packed`). A reader outside a call sees a value through `transform.rs`'s read point. `Value::observed`, which counts, positions, ranks, selectors, `≡` and guards' predicates use, reads a dual's primal. The integer readers of `Items` read carried items through it (`Value::observed_number`), so a count or position that `∂` carries reads its primal. It returns a `Result` whose error, `transform::Stop`, names the level that owns a batched run. A stop is `ErrorKind::Stop`, which no guard catches, even one that names it, and which a handler that catches every error lets pass (`ErrorKind::is_control`). Display reads through `Value::displayed`, because it never runs inside a batched run. `Value::computed`, which kernels use through `primitive::numeric`, gives UNSUPPORTED for a dual atom. Writes to bindings outside a `∂` call are recorded and stripped when it returns.
200
+
201
+ `batch.rs` makes a map's batched call. `batch::tried`, which `each_pair` calls, pushes a map level that batches (`Levels::batch`), wraps each argument that has a frame in a `Batch` carrier at that level, and calls the operand once. Each map first lays its arguments over its frame through its own agreement, the pairing that its calls on each cell read (`batch::Arguments::laid` and `agreement::laid_cells`). `each_pair` makes no batched call for one cell of atoms, which runs faster without one. Routing hands each call whose newest level is that map's to `batch::call`, for a primitive, or to `batch::route`, for another operation. Both leave `⍕` and system functions to their own code, whose effect check decides for every argument (`Levels::effect`). Both run the call on the whole arguments by Rank's routes: `eval::whole_cells` through `batch::whole_call`, and `eval::folded_cells` for a fold. A primitive therefore batches wherever Rank runs it on whole arguments. A call that no route covers stops the run (`transform::Stop`). So does a call whose constants with axes, repeated over the frame, would hold more than 4 times the items of its arguments and more than 2²⁴ items (`oversized`). The map then calls its operand once for each cell. Code that must run once for each cell asks the levels first (`Levels::effect`): output, input, `⍕` of a carried value and system functions other than random draws (`Effect::Acts`), a guard or a call on prototypes that would catch an error (`Effect::Catches`), and a write to a binding outside the map's frames (`Effect::Writes`, through `Levels::record_write`). A read through `Value::observed`, as a predicate, a count or a position makes, stops the run too. Each stop carries its cause (`transform::Cause`), which says how long a dfn operand remembers it (`Cause::kept`). An effect, a write or an observing read lasts for every later call. A call that no route covers lasts while later calls repeat the arguments' kinds and cell shapes, and the memory guard lasts while they also repeat the frame's shape. A caught error never lasts, because whether an error arises depends on the cells' values. The dfn's `Definition` holds what it remembers (`Definition::remember`): `ALWAYS`, or a signature of the arguments (`batch::signature`), each holding the stop's cause (`batch::holding`). A later try that it covers falls back without calling the operand, with an `"an earlier stop"` event that names the cause. A stop's own `fallbacks` event names its cause (`Cause::reason`), and the glyph of a primitive whose call no rule covers (`Stop::refusing`). Code with no rule for batches that reads a batch's items gets item carriers, item i of every cell, and records an `"item reads"` event. A kernel that then reads a number meets `Value::computed`'s refusal, which stops the run (`Carrier::refused`). A missed reader therefore costs speed or a fallback, never a wrong result. A `∂` call inside the run batches where the numbers it differentiates with respect to are batches of atoms, and stops where they're batches of arrays, which no rule of `∂` covers (`derivative::numbers`). A random draw takes each cell's own stream (`drawn_value` with `batch::cell`). Seeded draws match a run cell by cell. The map's result must be a batch at its level, a strand of batches whose kinds join (`joined`), or an atom or compact array with no carrier, as every cell's result. Any other result falls back. A pervasive call stops where its result's kind differs from the kind that one route gives every item (`pervasive::expected`). Each cell then keeps the kind that a run cell by cell gives it. `reference::check` runs each reference case with the `batch` pref off and then on, and compares the storage kinds of the two runs' values.
196
202
 
197
203
  Rustymath owns numeric folds, scans, adjacent pairs, grouped reductions and integer bounds. Basedpl selects kernels, tolerance, seeds, storage widths and exact fallbacks. Folds by algebraic float operations can regroup. Contiguous subtraction/division folds use `Alternating`; quotients fall back to item-by-item folding if their products leave the normal range. Boolean scans compose truth-table maps; comparison scans compute both possible totals in bulk and use `reduce::chosen`. Seeds, axis lanes and scalar fallback preserve the language's accumulation direction. Generic reductions stay right-associated and preserve operand call order/effects. Monadic `f.g` is the exception: it memoizes each minor's expansion, and a cached minor does not repeat operand calls or their effects. Determinant/permanent fast paths use the appropriate rustymath backend.
198
204
 
@@ -216,7 +222,9 @@ Packed numeric, Boolean and equality-count inner products use `rustymath::linalg
216
222
 
217
223
  `.fn()` retains a late-bound expression. Calls resolve affected nodes against the calling session while sharing unaffected graph nodes. This preserves primitive fast paths, inverses and reduction identities. The binder still resolves ordinary names during execution. Cyclic resolution is a LIMIT error.
218
224
 
219
- Arrays retain native values. `.py` and `.np` make copies; NumPy is optional and lazy. The buffer export lends compact items read-only. An unbuilt structural copy whose read is affine (`Value::affine`) lends its source's items with strides, so windows reach NumPy without being built. Any object with a buffer, NumPy arrays included, imports at its own width with one copy, through rustymath-buffer's `read`. NumPy arrays first convert signed bytes to int16 and wider unsigned integers to int64; uint64 above int64 raises ValueError. `own()` moves compact items into a writable NumPy array where nothing else holds them, holding Booleans as `u8` and characters as `i32`, because NumPy can write any bytes. Exact integers/fractions cross through native integers, not decimal strings. String/object arrays convert per item. Lists follow the shared import rule and dictionaries stay mixed. `syntax.py` wraps the native syntax tree with character spans and span-editing helpers.
225
+ Arrays retain native values. `.py` and `.np` make copies; NumPy is optional and lazy. The native `_Array` buffer export lends compact items read-only. An unbuilt structural copy whose read is affine (`Value::affine`) lends its source's items with strides, so windows reach NumPy without being built. Numeric buffers import with one copy through `rustymath_buffer::read_array`. `Value::imported_buffer` preserves supported item widths. The shared reader normalizes signed bytes, wider unsigned integers and foreign byte order. Sibling snapshots carry keys and names. A NumPy uint64 array containing a value above int64's range imports item by item as exact integers. `own()` moves compact items into a writable NumPy array where nothing else holds them, holding Booleans as `u8` and characters as `i32`, because NumPy can write any bytes. Exact integers/fractions cross through native integers, not decimal strings. String/object arrays convert per item. Lists follow the shared import rule and dictionaries stay mixed. `syntax.py` wraps the native syntax tree with character spans and span-editing helpers.
226
+
227
+ `Array(existing)` creates an independent native handle. Assignment and `.keys`/`.names` setters replace the owner's handle without changing prior views or captured functions. Both Python packages decode written selectors to lossless `structure::IndexPart` tokens through `rustymath/buffer/src/selection.rs`. `structure::addressed_parts` routes source groups and expands `Rest` against the applicable frame. BPL's coordinate and path adapter retains the written parts until the source or ending-cell geometry is known. `_Array.select` and `_Array.assign` use carrier-aware structural selection and writeback. Python assignment uses leading-axis broadcasting. Language writeback retains its own agreement.
220
228
 
221
229
  Each `_Session` request waits for its evaluator mutex without the GIL, then evaluates on the caller's thread with the GIL released. A separate interrupt handle supports interruption from another thread. Signal polling briefly takes the GIL. Python input and optional streaming-output callbacks also cross at explicit boundary adapters. No Python numeric objects enter core values; arrays can be dropped on any thread without an unsafe Send implementation.
222
230
 
@@ -232,7 +240,7 @@ The Jupyter adapter in `cli/src/kernel.rs` uses kernmini and a `ThreadWorker`. I
232
240
 
233
241
  ### Browser
234
242
 
235
- `cargo wasm` builds an incremental release-profile npm package with wasm-bindgen glue, language/input assets, grammar and canvas support. `--out DIR` leaves the docs' local playground assets alone; `--strip` removes function-name metadata for distribution. Keep wasm-bindgen glue and crate versions aligned through the workspace lock. Avoid fat LTO here because rebuild cost and enlarged stack frames conflict with browser development and recursion limits. `wasm-objdump -h DIR/basedpl_wasm_bg.wasm` lists the module's section sizes, including `name`. `twiggy diff` matches functions by full name, including crate hashes that change between builds. To compare two builds by function, compare their `twiggy top -n 1000000 -f json` listings with the hashes removed.
243
+ `cargo wasm` builds an incremental release-profile npm package with wasm-bindgen glue, language/input assets, grammar and canvas support. `--out DIR` leaves the docs' local playground assets alone; `--strip` removes function-name metadata for distribution. Keep wasm-bindgen glue and crate versions aligned through the workspace lock. Avoid fat LTO here because rebuild cost and enlarged stack frames conflict with browser development and recursion limits. Liftoff, V8's first compiler, gives each wasm local its own stack slot, whether or not the path that uses it runs. So a function that recursion passes through keeps its general path out of line, as Each, Rank and the outer product do (`each_items`). For the same reason, `ErrorKind`, which the `Result` in every frame holds, stays at 16 bytes in wasm32 (`transform::Stop`). To find a frame that grew, read the function names in the stack of the `RangeError` at an overflow, then compare those functions' wasm locals between builds. `wasm-objdump -h DIR/basedpl_wasm_bg.wasm` lists the module's section sizes, including `name`. `twiggy diff` matches functions by full name, including crate hashes that change between builds. To compare two builds by function, compare their `twiggy top -n 1000000 -f json` listings with the hashes removed.
236
244
 
237
245
  Browser `Session.run` streams MIME events and returns a protocol error or null. `eval` transfers values through `js.rs` but discards output and cannot export BPL functions/operators; `bind` imports page values/functions. Typed arrays transfer without another page-worker copy. JavaScript functions live in a thread-local registry and core function nodes hold slots, preserving Send/Sync values. `host_web.rs` implements the browser's clock, synchronous I/O/fetch and RegExp behaviour. File/URL reads resolve against the configured base. Unsupported native filesystem/locale operations stay unavailable; browser `•nput` writes only stdout and `•js` is browser-only.
238
246
 
@@ -1,6 +1,6 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: basedpl
3
- Version: 0.1.58
3
+ Version: 0.1.60
4
4
  Classifier: Programming Language :: Rust
5
5
  Classifier: Programming Language :: Python :: Implementation :: CPython
6
6
  Requires-Dist: fastcore
@@ -14,7 +14,7 @@ Requires-Dist: ipython>=9.17.1 ; extra == 'dev'
14
14
  Requires-Dist: nbdev>=3.3.24 ; extra == 'dev'
15
15
  Requires-Dist: conkernelclient>=0.0.23 ; extra == 'dev'
16
16
  Requires-Dist: pillow ; extra == 'dev'
17
- Requires-Dist: rustymath>=0.1.34 ; extra == 'dev'
17
+ Requires-Dist: rustymath>=0.1.37 ; extra == 'dev'
18
18
  Provides-Extra: dev
19
19
  License-File: LICENSE
20
20
  Summary: BasedPL, the Based-array Programming Language, is an APL-derived array language, borrowing ideas from J and BQN, with an emphasis on simple, consistent notation.
@@ -89,7 +89,7 @@
89
89
  "name": "support.function.bpl"
90
90
  },
91
91
  {
92
- "match": "[¨遍⍨己换換⊗表⌸组組⇄优優∂导梯導/总總⌿汇匯\\\\累⍀续續⁰¹²³⁴⁵⁶⁷⁸⁹⁻ᵀᵘ]",
92
+ "match": "[¨遍ᵇ按⍨己换換⊗表⌸组組⇄优優∂导梯導/总總⌿汇匯\\\\累⍀续續⁰¹²³⁴⁵⁶⁷⁸⁹⁻ᵀᵘ]",
93
93
  "name": "keyword.operator.monadic.bpl"
94
94
  },
95
95
  {
@@ -79,6 +79,11 @@
79
79
  <option name="OTHER" value="true" />
80
80
  </context>
81
81
  </template>
82
+ <template name="bitwise" value="ᵇ" description="ᵇ" shortcut="TAB">
83
+ <context>
84
+ <option name="OTHER" value="true" />
85
+ </context>
86
+ </template>
82
87
  <template name="bullet" value="•" description="•" shortcut="TAB">
83
88
  <context>
84
89
  <option name="OTHER" value="true" />
@@ -1144,6 +1149,11 @@
1144
1149
  <option name="OTHER" value="true" />
1145
1150
  </context>
1146
1151
  </template>
1152
+ <template name="superscript-b" value="ᵇ" description="ᵇ" shortcut="TAB">
1153
+ <context>
1154
+ <option name="OTHER" value="true" />
1155
+ </context>
1156
+ </template>
1147
1157
  <template name="system" value="•" description="•" shortcut="TAB">
1148
1158
  <context>
1149
1159
  <option name="OTHER" value="true" />
@@ -1613,6 +1613,7 @@
1613
1613
  </action>
1614
1614
  <action id="k11-m0">
1615
1615
  <when state="none" output="b"/>
1616
+ <when state="superscript" output="ᵇ"/>
1616
1617
  <when state="circle" output="⍎"/>
1617
1618
  </action>
1618
1619
  <action id="k13-m0">
@@ -1610,6 +1610,7 @@
1610
1610
  </action>
1611
1611
  <action id="k11-m0">
1612
1612
  <when state="none" output="b"/>
1613
+ <when state="superscript" output="ᵇ"/>
1613
1614
  <when state="circle" output="⍎"/>
1614
1615
  </action>
1615
1616
  <action id="k13-m0">
@@ -1601,6 +1601,7 @@
1601
1601
  </action>
1602
1602
  <action id="k11-m0">
1603
1603
  <when state="none" output="b"/>
1604
+ <when state="superscript" output="ᵇ"/>
1604
1605
  <when state="circle" output="⍎"/>
1605
1606
  </action>
1606
1607
  <action id="k12-m0">
@@ -1610,6 +1610,7 @@
1610
1610
  </action>
1611
1611
  <action id="k11-m0">
1612
1612
  <when state="none" output="b"/>
1613
+ <when state="superscript" output="ᵇ"/>
1613
1614
  <when state="circle" output="⍎"/>
1614
1615
  </action>
1615
1616
  <action id="k13-m0">
@@ -1610,6 +1610,7 @@
1610
1610
  </action>
1611
1611
  <action id="k11-m0">
1612
1612
  <when state="none" output="b"/>
1613
+ <when state="superscript" output="ᵇ"/>
1613
1614
  <when state="circle" output="⍎"/>
1614
1615
  </action>
1615
1616
  <action id="k13-m0">
@@ -6,7 +6,7 @@ syntax match bplName /\v[A-Za-z_∆⍙][A-Za-z0-9_∆⍙]*(\.[A-Za-z_∆⍙][A-Z
6
6
  syntax match bplSystem /\v[•系][A-Za-z_∆⍙][A-Za-z0-9_∆⍙]*/
7
7
  syntax match bplString /\v\$[ad]/
8
8
  syntax match bplFunction /[+加减減×乘号號÷除⌈上⌊下|绝余絕餘*幂冪⍟对對○圆圓π周√根!阶拣階揀∧极且極∨析或⊼方否⊽双莫雙~非无無=等≠别初別<小≤限退>大≥达进達進⍳位↦至:键卸鍵⍴形≢数异數異≡同深,连連⍪接矩⊂包⊃选合選⊆巢段∊属展屬∪并独併獨∩交重⍋升⍒降↑取↓去拆⌽转轉⊖纵縱⍉翻⊤编編⊥译譯⍎行⍕文⌷索⌹解逆#复複↕窗⍭素⨸因⌻零值⍸处间處間⍷寻群尋⊢右⊣左¿掷抽擲-]/
9
- syntax match bplMonadicOperator #[¨遍⍨己换換⊗表⌸组組⇄优優∂导梯導/总總⌿汇匯\\累⍀续續⁰¹²³⁴⁵⁶⁷⁸⁹⁻ᵀᵘ]#
9
+ syntax match bplMonadicOperator #[¨遍ᵇ按⍨己换換⊗表⌸组組⇄优優∂导梯導/总總⌿汇匯\\累⍀续續⁰¹²³⁴⁵⁶⁷⁸⁹⁻ᵀᵘ]#
10
10
  syntax match bplDyadicOperator /[↣先⍤秩∘承⍠轴軸⍥经經↢后後.内內⍣次止⊘兼@于於⍚择擇⌺邻鄰]/
11
11
  syntax match bplArgument /[⍺甲⍵乙⍶丙⍹丁∇递遞⍢循]/
12
12
  syntax match bplKeyword /[←是⎕出入⋄句?若₀₁₂₃₄₅₆₇₈₉₋]/
@@ -117,6 +117,7 @@ static DEADKEY deadkeys[] = {
117
117
  DEADTRANS(0x0038, 0x005e, 0x2078, 0),
118
118
  DEADTRANS(0x0039, 0x005e, 0x2079, 0),
119
119
  DEADTRANS(0x002d, 0x005e, 0x207b, 0),
120
+ DEADTRANS(0x0062, 0x005e, 0x1d47, 0),
120
121
  DEADTRANS(0x0074, 0x005e, 0x1d40, 0),
121
122
  DEADTRANS(0x0075, 0x005e, 0x1d58, 0),
122
123
  DEADTRANS(0x0020, 0x005e, 0x005e, 0),
@@ -488,7 +488,7 @@ box←{ ⍝ Frame a text array, with optional internal row and column borders.
488
488
  [r c]←rh{∪⍺{(⍵∊⍳≥⍺)#⍵}⍵,(~¯1∊⍵)#0,⍺}¨,¨2↑ar
489
489
  [rw cl]←rh{<⍵∪0,⍺}¨[r c]
490
490
  (~ 0,rh₁ ∊ c){
491
- (↑⍺)↓⍠1(-⍺₁)↓⍠1[∞ ⍋(≥⍳rh₁),cl]⌷⍵
491
+ (↑⍺)↓⍠1(-⍺₁)↓⍠1[: ⍋(≥⍳rh₁),cl]⌷⍵
492
492
  }(~ 0,rh₀ ∊ r){
493
493
  (↑⍺)↓⍠0(-⍺₁)↓⍠0[⍋(≥⍳rh₀),rw]⌷⍵
494
494
  }{
@@ -496,7 +496,7 @@ box←{ ⍝ Frame a text array, with optional internal row and column borders.
496
496
  hz←(h,rh₁)⍴ch₈
497
497
  vr←(rh₀,w)⍴ch₉
498
498
  ∨/0∊¨⍴¨[rw cl]?(⍵⍪hz),vr⍪q;
499
- q₀←ch₄ ⋄ q.[∞ ¯1]←ch₅ ⋄ q.[∞ 0]←ch₆ ⋄ q₋₁←ch₇
499
+ q₀←ch₄ ⋄ q.[: ¯1]←ch₅ ⋄ q.[: 0]←ch₆ ⋄ q₋₁←ch₇
500
500
  [0 ¯1;0 ¯1]⌷q ←2 2⍴ch ⋄ (⍵⍪hz),vr⍪q
501
501
  }z
502
502
  }
@@ -799,7 +799,7 @@ packH←{ ⍝ Huffman packing.
799
799
 
800
800
  eval←{ ⍝ ⍺: environment, ⍵: expression
801
801
  isNum ⍵?⍵;
802
- isAtom ⍵?[⍺.[∞ 0]⍳⊂⍵ 1]⌷⍺;
802
+ isAtom ⍵?[⍺.[: 0]⍳⊂⍵ 1]⌷⍺;
803
803
  0≡≢⍵?⍬;
804
804
  "quote"≡↑⍵?⍵₁;
805
805
  (1↑⍵)∊,¨'\' "lambda"?["closure" ⍺],1↓⍵;
@@ -223,7 +223,7 @@ alt ← { ⍝ Alternant.
223
223
  0=r?⍹⌿,⍵;
224
224
  1≥c?⍶⌿,⍵;
225
225
  M←(⍳r)~⍤1⍪⍳r ⍝ minors
226
- ⍵.[∞ 0]⍶.⍹∇¨⊂⍠[1 2][M 1↓⍳c]⌷⍵
226
+ ⍵.[: 0]⍶.⍹∇¨⊂⍠[1 2][M 1↓⍳c]⌷⍵
227
227
  }
228
228
 
229
229
  bayes ← {⍺ ×÷+.× ⍵} ⍝ Bayes' formula. (implemented as a fork)
@@ -254,10 +254,10 @@ det ← { ⍝ Determinant of square matrix.
254
254
 
255
255
  gauss_jordan ← { ⍝ Gauss-Jordan elimination.
256
256
  elim←{ ⍝ elimination of row/col ⍺
257
- p←⍺+↑⍒|⍺↓[∞ ⍺]⌷⍵
257
+ p←⍺+↑⍒|⍺↓[: ⍺]⌷⍵
258
258
  swap←⊖@[⍺ p] ⍵ ⍝ ⍺th and pth rows exchanged
259
259
  mat←swap.[⍺ ⍺]÷⍨@⍺ swap ⍝ col diagonal reduced to 1
260
- mat-(mat.[∞ ⍺]×⍺≠⍳≢⍵)×⊗⍺⌷mat
260
+ mat-(mat.[: ⍺]×⍺≠⍳≢⍵)×⊗⍺⌷mat
261
261
  }
262
262
  ⍺←=/⊃⍳⍴⍵
263
263
  (⍴⍺)⍴(0 1×⍴⍵)↓(⍵,⍺)elim/⌽⍳⌊/⍴⍵
@@ -537,7 +537,7 @@
537
537
  "id": "46f0fb79",
538
538
  "metadata": {},
539
539
  "source": [
540
- "`f∂←g` attaches `g` as the derivative, which [`∂`](glyphs/partial.qmd) and [`⇄`](glyphs/right-left-arrows.qmd) call. `g` is a JVP rule: `t g x` gives the derivative of `f` at `x` along the direction `t`, and must be linear in `t`. `∂` calls it with `t` set to each direction it needs:"
540
+ "`f∂←g` attaches `g` as the derivative, which [`∂`](glyphs/partial.qmd) and [`⇄`](glyphs/right-left-arrows.qmd) call. `g` is a JVP rule: `t g x` gives the derivative of `f` at `x` along the direction `t`, and must be linear in `t`. `∂` calls `g` wherever it differentiates a call of `f`:"
541
541
  ]
542
542
  },
543
543
  {
@@ -15,7 +15,7 @@
15
15
  <RegExpr String="\$[ad]" attribute="String"/>
16
16
  <RegExpr String="[\])](?=ₓ)" attribute="Normal Text" context="Mark"/>
17
17
  <AnyChar String="+加-减減×乘号號÷除⌈上⌊下|绝余絕餘*幂冪⍟对對○圆圓π周√根!阶拣階揀∧极且極∨析或⊼方否⊽双莫雙~非无無=等≠别初別&lt;小≤限退&gt;大≥达进達進⍳位↦至:键卸鍵⍴形≢数异數異≡同深,连連⍪接矩⊂包⊃选合選⊆巢段∊属展屬∪并独併獨∩交重⍋升⍒降↑取↓去拆⌽转轉⊖纵縱⍉翻⊤编編⊥译譯⍎行⍕文⌷索⌹解逆#复複↕窗⍭素⨸因⌻零值⍸处间處間⍷寻群尋⊢右⊣左¿掷抽擲" attribute="Function"/>
18
- <AnyChar String="¨遍⍨己换換⊗表⌸组組⇄优優∂导梯導/总總⌿汇匯\累⍀续續⁰¹²³⁴⁵⁶⁷⁸⁹⁻ᵀᵘ" attribute="MonadicOperator"/>
18
+ <AnyChar String="¨遍ᵇ按⍨己换換⊗表⌸组組⇄优優∂导梯導/总總⌿汇匯\累⍀续續⁰¹²³⁴⁵⁶⁷⁸⁹⁻ᵀᵘ" attribute="MonadicOperator"/>
19
19
  <AnyChar String="↣先⍤秩∘承⍠轴軸⍥经經↢后後.内內⍣次止⊘兼@于於⍚择擇⌺邻鄰" attribute="DyadicOperator"/>
20
20
  <AnyChar String="⍺甲⍵乙⍶丙⍹丁∇递遞⍢循" attribute="Argument"/>
21
21
  <AnyChar String="←是⎕出入⋄句?若₀₁₂₃₄₅₆₇₈₉₋" attribute="Keyword"/>
@@ -46,7 +46,7 @@ av {(⍋𝕨++`𝕨)⊏𝕩} bv
46
46
 
47
47
  ### Sort rows by a column
48
48
 
49
- Source: APLcart. `[∞ ⍺]⌷⍵` is column `⍺` of `⍵`. Index takes one position for each axis, with `∞` for a whole axis. The outer `⌷` gets one item, the grade, and selects rows with it.
49
+ Source: APLcart. `[: ⍺]⌷⍵` is column `⍺` of `⍵`. Index takes one position for each axis, with `:` for a whole axis. The outer `⌷` gets one item, the grade, and selects rows with it.
50
50
 
51
51
  ```dyalog
52
52
  I{⍵[⍋⍵[;⍺];]}Ym
@@ -54,7 +54,7 @@ I{⍵[⍋⍵[;⍺];]}Ym
54
54
 
55
55
  ```bpl
56
56
  I←1 ⋄ Ym←[5 3⋄1 9⋄4 2]
57
- I{[⍋[∞ ⍺]⌷⍵]⌷⍵}Ym ⍝ [4 2⋄5 3⋄1 9]
57
+ I{[⍋[: ⍺]⌷⍵]⌷⍵}Ym ⍝ [4 2⋄5 3⋄1 9]
58
58
  ```
59
59
 
60
60
  ```bqn
@@ -145,14 +145,14 @@ next←(𝕨⊏graph)(∊/⊣)¨</𝕩=¯2
145
145
 
146
146
  ### Chained indexing
147
147
 
148
- Source: the April tests. `⌷` takes one item for each axis, like APL's index fields. `;` separates the items. `∞` takes a whole axis, in place of an empty field.
148
+ Source: the April tests. `⌷` takes one item for each axis, like APL's index fields. `;` separates the items. `:` takes a whole axis, in place of an empty field.
149
149
 
150
150
  ```dyalog
151
151
  (6 8 5⍴⍳9)[1 4;;2 1][1;2 4 5;]
152
152
  ```
153
153
 
154
154
  ```bpl
155
- [0;1 3 4]⌷[0 3;∞;1 0]⌷6 8 5⍴⍳9 ⍝ [6 5⋄7 6⋄3 2]
155
+ [0;1 3 4]⌷[0 3;:;1 0]⌷6 8 5⍴⍳9 ⍝ [6 5⋄7 6⋄3 2]
156
156
  ```
157
157
 
158
158
  ```bqn