basedpl 0.1.55__tar.gz → 0.1.58__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.
Files changed (469) hide show
  1. {basedpl-0.1.55 → basedpl-0.1.58}/.github/workflows/ci.yml +7 -0
  2. {basedpl-0.1.55 → basedpl-0.1.58}/.github/workflows/speed.yml +5 -6
  3. {basedpl-0.1.55 → basedpl-0.1.58}/.github/workflows/test.yml +1 -1
  4. {basedpl-0.1.55 → basedpl-0.1.58}/Cargo.lock +16 -15
  5. {basedpl-0.1.55 → basedpl-0.1.58}/Cargo.toml +3 -5
  6. {basedpl-0.1.55 → basedpl-0.1.58}/DEV.md +34 -22
  7. {basedpl-0.1.55 → basedpl-0.1.58}/PKG-INFO +3 -2
  8. {basedpl-0.1.55 → basedpl-0.1.58}/lib/README.md +1 -1
  9. {basedpl-0.1.55 → basedpl-0.1.58}/lib/array.bpl +1 -1
  10. {basedpl-0.1.55 → basedpl-0.1.58}/lib/dyalog.bpl +7 -7
  11. {basedpl-0.1.55 → basedpl-0.1.58}/lib/graph.bpl +1 -1
  12. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/assignment.ipynb +4 -4
  13. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/cli.qmd +1 -0
  14. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/comparison.qmd +6 -5
  15. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/evaluation.qmd +3 -3
  16. basedpl-0.1.58/nbs/glyphs/at.qmd +111 -0
  17. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/brackets.qmd +1 -1
  18. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle-backslash.qmd +3 -1
  19. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/colon.qmd +1 -1
  20. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/delta-stile.qmd +8 -1
  21. basedpl-0.1.58/nbs/glyphs/diamond-underbar.qmd +75 -0
  22. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/dot.qmd +22 -2
  23. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/downstile.qmd +1 -1
  24. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/equal-underbar.qmd +10 -0
  25. basedpl-0.1.58/nbs/glyphs/inverted-question.qmd +24 -0
  26. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/iota.qmd +2 -2
  27. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/jot-diaeresis.qmd +13 -0
  28. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/left-arrow.qmd +3 -1
  29. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/partial.qmd +5 -3
  30. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/quad-colon.qmd +2 -1
  31. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/quad-diamond.qmd +7 -1
  32. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/right-shoe.qmd +10 -13
  33. basedpl-0.1.58/nbs/glyphs/squad.qmd +108 -0
  34. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/up-down-arrow.qmd +22 -2
  35. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/upstile.qmd +1 -1
  36. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs.qmd +5 -3
  37. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/hanzi-notation-zh.ipynb +19 -1
  38. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/hanzi-notation.ipynb +20 -2
  39. basedpl-0.1.58/nbs/indexing.ipynb +1081 -0
  40. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/keyed.ipynb +135 -8
  41. basedpl-0.1.58/nbs/llms.txt +106 -0
  42. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/modules.qmd +4 -4
  43. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/numbers.qmd +40 -9
  44. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/principles.ipynb +55 -0
  45. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/python.ipynb +22 -2
  46. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/regex.ipynb +1 -1
  47. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/repl.qmd +1 -1
  48. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/scripts.ipynb +1 -1
  49. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/sidebar.yml +3 -0
  50. basedpl-0.1.58/nbs/style.qmd +13 -0
  51. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/syntax.qmd +14 -6
  52. basedpl-0.1.58/nbs/system/detach.qmd +15 -0
  53. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/distribution.qmd +1 -1
  54. basedpl-0.1.58/nbs/system/edge.qmd +29 -0
  55. basedpl-0.1.58/nbs/system/element.qmd +5 -0
  56. basedpl-0.1.58/nbs/system/explain.qmd +43 -0
  57. basedpl-0.1.58/nbs/system/float.qmd +19 -0
  58. basedpl-0.1.58/nbs/system/index.qmd +35 -0
  59. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/load.qmd +1 -1
  60. basedpl-0.1.58/nbs/system/prefs.qmd +77 -0
  61. basedpl-0.1.58/nbs/system/rand.qmd +18 -0
  62. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/storage.qmd +1 -1
  63. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system-functions.qmd +10 -0
  64. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/web.ipynb +2 -2
  65. basedpl-0.1.58/nbs/xml.ipynb +928 -0
  66. {basedpl-0.1.55 → basedpl-0.1.58}/provenance/README.md +1 -1
  67. {basedpl-0.1.55 → basedpl-0.1.58}/py/Cargo.toml +1 -1
  68. {basedpl-0.1.55 → basedpl-0.1.58}/py/src/lib.rs +36 -26
  69. {basedpl-0.1.55 → basedpl-0.1.58}/pyproject.toml +2 -1
  70. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/__init__.py +7 -11
  71. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/bpltests.py +92 -71
  72. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/functions.py +1 -1
  73. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/worker.py +7 -3
  74. {basedpl-0.1.55 → basedpl-0.1.58}/src/array/storage.rs +58 -40
  75. {basedpl-0.1.55 → basedpl-0.1.58}/src/array/text.rs +14 -10
  76. {basedpl-0.1.55 → basedpl-0.1.58}/src/array.rs +76 -42
  77. {basedpl-0.1.55 → basedpl-0.1.58}/src/csv.rs +3 -3
  78. {basedpl-0.1.55 → basedpl-0.1.58}/src/data.rs +7 -7
  79. {basedpl-0.1.55 → basedpl-0.1.58}/src/date.rs +2 -2
  80. {basedpl-0.1.55 → basedpl-0.1.58}/src/derivative.rs +58 -47
  81. {basedpl-0.1.55 → basedpl-0.1.58}/src/display.rs +52 -31
  82. {basedpl-0.1.55 → basedpl-0.1.58}/src/distribution.rs +68 -17
  83. {basedpl-0.1.55 → basedpl-0.1.58}/src/element.rs +6 -1
  84. {basedpl-0.1.55 → basedpl-0.1.58}/src/error.rs +10 -12
  85. {basedpl-0.1.55 → basedpl-0.1.58}/src/eval/assign.rs +132 -130
  86. {basedpl-0.1.55 → basedpl-0.1.58}/src/eval/binder.rs +81 -50
  87. {basedpl-0.1.55 → basedpl-0.1.58}/src/eval/idioms.rs +9 -10
  88. {basedpl-0.1.55 → basedpl-0.1.58}/src/eval/operators.rs +511 -109
  89. {basedpl-0.1.55 → basedpl-0.1.58}/src/eval/session.rs +46 -41
  90. {basedpl-0.1.55 → basedpl-0.1.58}/src/eval.rs +100 -58
  91. {basedpl-0.1.55 → basedpl-0.1.58}/src/execution.rs +0 -2
  92. basedpl-0.1.58/src/explain.rs +159 -0
  93. {basedpl-0.1.55 → basedpl-0.1.58}/src/files.rs +4 -4
  94. basedpl-0.1.58/src/fusion/blocks.rs +187 -0
  95. basedpl-0.1.58/src/fusion.rs +753 -0
  96. {basedpl-0.1.55 → basedpl-0.1.58}/src/host.rs +3 -53
  97. {basedpl-0.1.55 → basedpl-0.1.58}/src/host_web.rs +2 -2
  98. {basedpl-0.1.55 → basedpl-0.1.58}/src/image.rs +3 -3
  99. {basedpl-0.1.55 → basedpl-0.1.58}/src/inspection.rs +10 -8
  100. {basedpl-0.1.55 → basedpl-0.1.58}/src/js.rs +2 -2
  101. {basedpl-0.1.55 → basedpl-0.1.58}/src/json.rs +2 -2
  102. {basedpl-0.1.55 → basedpl-0.1.58}/src/keyed.rs +5 -5
  103. {basedpl-0.1.55 → basedpl-0.1.58}/src/lib.rs +1 -1
  104. basedpl-0.1.58/src/linear.rs +755 -0
  105. {basedpl-0.1.55 → basedpl-0.1.58}/src/number.rs +133 -26
  106. {basedpl-0.1.55 → basedpl-0.1.58}/src/number_theory.rs +1 -1
  107. {basedpl-0.1.55 → basedpl-0.1.58}/src/optimize.rs +4 -4
  108. {basedpl-0.1.55 → basedpl-0.1.58}/src/pervasive.rs +489 -222
  109. {basedpl-0.1.55 → basedpl-0.1.58}/src/polynomial.rs +6 -6
  110. basedpl-0.1.58/src/primitive/indexing.rs +541 -0
  111. {basedpl-0.1.55 → basedpl-0.1.58}/src/primitive/numeric.rs +18 -18
  112. {basedpl-0.1.55 → basedpl-0.1.58}/src/primitive/search.rs +20 -22
  113. {basedpl-0.1.55 → basedpl-0.1.58}/src/primitive/structural.rs +24 -13
  114. {basedpl-0.1.55 → basedpl-0.1.58}/src/primitive.rs +136 -83
  115. {basedpl-0.1.55 → basedpl-0.1.58}/src/protocol.rs +3 -3
  116. {basedpl-0.1.55 → basedpl-0.1.58}/src/reference.rs +4 -3
  117. {basedpl-0.1.55 → basedpl-0.1.58}/src/regex.rs +3 -3
  118. {basedpl-0.1.55 → basedpl-0.1.58}/src/search.rs +22 -9
  119. {basedpl-0.1.55 → basedpl-0.1.58}/src/selection.rs +12 -8
  120. {basedpl-0.1.55 → basedpl-0.1.58}/src/symbols.rs +3 -3
  121. {basedpl-0.1.55 → basedpl-0.1.58}/src/syntax.rs +157 -67
  122. {basedpl-0.1.55 → basedpl-0.1.58}/src/system.rs +126 -50
  123. {basedpl-0.1.55 → basedpl-0.1.58}/src/timing.rs +32 -19
  124. {basedpl-0.1.55 → basedpl-0.1.58}/tests/conftest.py +1 -1
  125. {basedpl-0.1.55 → basedpl-0.1.58}/tests/core.rs +29 -9
  126. {basedpl-0.1.55 → basedpl-0.1.58}/tests/derivatives.rs +1 -1
  127. {basedpl-0.1.55 → basedpl-0.1.58}/tests/explain.rs +21 -0
  128. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/aplcart.bpl +245 -245
  129. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/april.bpl +699 -699
  130. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/bqn.bpl +4 -4
  131. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/core.bpl +763 -202
  132. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/distributions.bpl +15 -2
  133. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/dyalog.bpl +44 -44
  134. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/lib.bpl +61 -61
  135. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/ngn.bpl +8 -9
  136. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/regex.bpl +4 -4
  137. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference.rs +1 -1
  138. {basedpl-0.1.55 → basedpl-0.1.58}/tests/scaling.rs +13 -10
  139. basedpl-0.1.58/tests/speed.rs +25 -0
  140. {basedpl-0.1.55 → basedpl-0.1.58}/tests/speed.txt +299 -222
  141. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_api.py +10 -2
  142. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_basic.py +10 -0
  143. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_bpltests.py +8 -6
  144. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_kernel.py +4 -1
  145. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_repl.py +3 -3
  146. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_worker.py +2 -0
  147. basedpl-0.1.58/tests/units.rs +193 -0
  148. {basedpl-0.1.55 → basedpl-0.1.58}/tests/wasm-speed.mjs +16 -20
  149. basedpl-0.1.55/nbs/glyphs/at.qmd +0 -93
  150. basedpl-0.1.55/nbs/glyphs/diamond-underbar.qmd +0 -22
  151. basedpl-0.1.55/nbs/glyphs/inverted-question.qmd +0 -18
  152. basedpl-0.1.55/nbs/glyphs/squad.qmd +0 -97
  153. basedpl-0.1.55/nbs/llms.txt +0 -96
  154. basedpl-0.1.55/nbs/system/element.qmd +0 -5
  155. basedpl-0.1.55/nbs/system/explain.qmd +0 -21
  156. basedpl-0.1.55/nbs/system/float.qmd +0 -11
  157. basedpl-0.1.55/nbs/system/prefs.qmd +0 -50
  158. basedpl-0.1.55/nbs/system/rand.qmd +0 -10
  159. basedpl-0.1.55/nbs/xml.ipynb +0 -928
  160. basedpl-0.1.55/src/explain.rs +0 -88
  161. basedpl-0.1.55/src/fusion.rs +0 -639
  162. basedpl-0.1.55/src/linear.rs +0 -579
  163. basedpl-0.1.55/src/primitive/indexing.rs +0 -376
  164. basedpl-0.1.55/tests/speed.rs +0 -29
  165. basedpl-0.1.55/tests/timing-lock.mjs +0 -39
  166. basedpl-0.1.55/tests/units.rs +0 -108
  167. {basedpl-0.1.55 → basedpl-0.1.58}/.cargo/config.toml +0 -0
  168. {basedpl-0.1.55 → basedpl-0.1.58}/.gitattributes +0 -0
  169. {basedpl-0.1.55 → basedpl-0.1.58}/.github/workflows/docs.yml +0 -0
  170. {basedpl-0.1.55 → basedpl-0.1.58}/.gitignore +0 -0
  171. {basedpl-0.1.55 → basedpl-0.1.58}/CONTRIBUTING.md +0 -0
  172. {basedpl-0.1.55 → basedpl-0.1.58}/LICENSE +0 -0
  173. {basedpl-0.1.55 → basedpl-0.1.58}/README.md +0 -0
  174. {basedpl-0.1.55 → basedpl-0.1.58}/_config.yml +0 -0
  175. {basedpl-0.1.55 → basedpl-0.1.58}/_layouts/default.html +0 -0
  176. {basedpl-0.1.55 → basedpl-0.1.58}/build.rs +0 -0
  177. {basedpl-0.1.55 → basedpl-0.1.58}/editors/jetbrains/BPL.tmbundle/Syntaxes/bpl.tmLanguage.json +0 -0
  178. {basedpl-0.1.55 → basedpl-0.1.58}/editors/jetbrains/BPL.tmbundle/info.plist +0 -0
  179. {basedpl-0.1.55 → basedpl-0.1.58}/editors/jetbrains/BPL.xml +0 -0
  180. {basedpl-0.1.55 → basedpl-0.1.58}/editors/jetbrains/README.md +0 -0
  181. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-de.bundle/Contents/Info.plist +0 -0
  182. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-de.bundle/Contents/Resources/BasedPL-de.icns +0 -0
  183. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-de.bundle/Contents/Resources/BasedPL-de.keylayout +0 -0
  184. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-de.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  185. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-de.bundle/Contents/version.plist +0 -0
  186. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-de.txt +0 -0
  187. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-es.bundle/Contents/Info.plist +0 -0
  188. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-es.bundle/Contents/Resources/BasedPL-es.icns +0 -0
  189. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-es.bundle/Contents/Resources/BasedPL-es.keylayout +0 -0
  190. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-es.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  191. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-es.bundle/Contents/version.plist +0 -0
  192. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-es.txt +0 -0
  193. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-fr.bundle/Contents/Info.plist +0 -0
  194. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-fr.bundle/Contents/Resources/BasedPL-fr.icns +0 -0
  195. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-fr.bundle/Contents/Resources/BasedPL-fr.keylayout +0 -0
  196. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-fr.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  197. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-fr.bundle/Contents/version.plist +0 -0
  198. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-fr.txt +0 -0
  199. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-uk.bundle/Contents/Info.plist +0 -0
  200. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-uk.bundle/Contents/Resources/BasedPL-uk.icns +0 -0
  201. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-uk.bundle/Contents/Resources/BasedPL-uk.keylayout +0 -0
  202. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-uk.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  203. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-uk.bundle/Contents/version.plist +0 -0
  204. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-uk.txt +0 -0
  205. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-us.bundle/Contents/Info.plist +0 -0
  206. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-us.bundle/Contents/Resources/BasedPL-us.icns +0 -0
  207. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-us.bundle/Contents/Resources/BasedPL-us.keylayout +0 -0
  208. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-us.bundle/Contents/Resources/en.lproj/InfoPlist.strings +0 -0
  209. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-us.bundle/Contents/version.plist +0 -0
  210. {basedpl-0.1.55 → basedpl-0.1.58}/editors/macos/BasedPL-us.txt +0 -0
  211. {basedpl-0.1.55 → basedpl-0.1.58}/editors/vim/ftdetect/bpl.vim +0 -0
  212. {basedpl-0.1.55 → basedpl-0.1.58}/editors/vim/syntax/bpl.vim +0 -0
  213. {basedpl-0.1.55 → basedpl-0.1.58}/editors/windows/README.md +0 -0
  214. {basedpl-0.1.55 → basedpl-0.1.58}/editors/windows/build.ps1 +0 -0
  215. {basedpl-0.1.55 → basedpl-0.1.58}/editors/windows/install.ps1 +0 -0
  216. {basedpl-0.1.55 → basedpl-0.1.58}/editors/windows/keyboard.c +0 -0
  217. {basedpl-0.1.55 → basedpl-0.1.58}/editors/windows/keyboard.def +0 -0
  218. {basedpl-0.1.55 → basedpl-0.1.58}/editors/windows/keyboard.rc +0 -0
  219. {basedpl-0.1.55 → basedpl-0.1.58}/editors/windows/layout.h +0 -0
  220. {basedpl-0.1.55 → basedpl-0.1.58}/index_files/figure-commonmark/cell-17-output-1.svg +0 -0
  221. {basedpl-0.1.55 → basedpl-0.1.58}/index_files/figure-commonmark/cell-18-output-1.svg +0 -0
  222. {basedpl-0.1.55 → basedpl-0.1.58}/index_files/figure-html/cell-17-output-1.svg +0 -0
  223. {basedpl-0.1.55 → basedpl-0.1.58}/index_files/figure-html/cell-18-output-1.svg +0 -0
  224. {basedpl-0.1.55 → basedpl-0.1.58}/lib/LICENSE-april +0 -0
  225. {basedpl-0.1.55 → basedpl-0.1.58}/lib/numeric.bpl +0 -0
  226. {basedpl-0.1.55 → basedpl-0.1.58}/lib/power.bpl +0 -0
  227. {basedpl-0.1.55 → basedpl-0.1.58}/lib/regex.bpl +0 -0
  228. {basedpl-0.1.55 → basedpl-0.1.58}/lib/string.bpl +0 -0
  229. {basedpl-0.1.55 → basedpl-0.1.58}/lib/tree.bpl +0 -0
  230. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/.gitignore +0 -0
  231. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/_quarto.yml +0 -0
  232. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/arrays.ipynb +0 -0
  233. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/bpl.xml +0 -0
  234. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/bqn.xml +0 -0
  235. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/bracket-types.ipynb +0 -0
  236. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/data.ipynb +0 -0
  237. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/dfns.ipynb +0 -0
  238. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/distributions.ipynb +0 -0
  239. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/driver.js +0 -0
  240. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/dyalog.ipynb +0 -0
  241. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/dyalog.xml +0 -0
  242. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/fonts/LICENSE-SAX2 +0 -0
  243. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/fonts/README.md +0 -0
  244. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/fonts/SAX2B.ttf +0 -0
  245. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/fonts/SAX2B.woff2 +0 -0
  246. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/fonts.css +0 -0
  247. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/attractor.bpl +0 -0
  248. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/boids.bpl +0 -0
  249. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/dragon.bpl +0 -0
  250. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/flow.bpl +0 -0
  251. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/mandelbrot.bpl +0 -0
  252. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/mandelbrot32.bpl +0 -0
  253. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/orbits.bpl +0 -0
  254. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/phyllotaxis.bpl +0 -0
  255. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/prefs.bpl +0 -0
  256. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery/reaction.bpl +0 -0
  257. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/gallery.qmd +0 -0
  258. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/getting-started.ipynb +0 -0
  259. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/_metadata.yml +0 -0
  260. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/alpha-underbar.qmd +0 -0
  261. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/alpha.qmd +0 -0
  262. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/backslash-bar.qmd +0 -0
  263. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/backslash.qmd +0 -0
  264. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/braces.qmd +0 -0
  265. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/bullet.qmd +0 -0
  266. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle-bar.qmd +0 -0
  267. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle-diaeresis.qmd +0 -0
  268. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle-divide.qmd +0 -0
  269. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle-slash.qmd +0 -0
  270. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle-star.qmd +0 -0
  271. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle-stile.qmd +0 -0
  272. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle-times.qmd +0 -0
  273. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/circle.qmd +0 -0
  274. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/comma-bar.qmd +0 -0
  275. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/comma.qmd +0 -0
  276. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/del-diaeresis.qmd +0 -0
  277. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/del-stile.qmd +0 -0
  278. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/del.qmd +0 -0
  279. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/diaeresis.qmd +0 -0
  280. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/diamond.qmd +0 -0
  281. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/domino.qmd +0 -0
  282. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/down-arrow.qmd +0 -0
  283. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/down-shoe.qmd +0 -0
  284. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/down-tack.qmd +0 -0
  285. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/epsilon-underbar.qmd +0 -0
  286. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/epsilon.qmd +0 -0
  287. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/equal-underbar-slash.qmd +0 -0
  288. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/equals.qmd +0 -0
  289. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/error-guard.qmd +0 -0
  290. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/exclamation.qmd +0 -0
  291. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/greater-than-or-equal.qmd +0 -0
  292. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/greater-than.qmd +0 -0
  293. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/hash.qmd +0 -0
  294. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/hydrant.qmd +0 -0
  295. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/infinity.qmd +0 -0
  296. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/iota-underbar.qmd +0 -0
  297. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/jot.qmd +0 -0
  298. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/lamp.qmd +0 -0
  299. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/left-shoe-underbar.qmd +0 -0
  300. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/left-shoe.qmd +0 -0
  301. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/left-tack.qmd +0 -0
  302. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/left-tail-arrow.qmd +0 -0
  303. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/less-than-or-equal.qmd +0 -0
  304. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/less-than.qmd +0 -0
  305. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/minus.qmd +0 -0
  306. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/not-equals.qmd +0 -0
  307. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/obelus.qmd +0 -0
  308. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/omega-underbar.qmd +0 -0
  309. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/omega.qmd +0 -0
  310. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/overbar.qmd +0 -0
  311. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/parentheses.qmd +0 -0
  312. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/pi.qmd +0 -0
  313. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/plus.qmd +0 -0
  314. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/quad-equal.qmd +0 -0
  315. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/quad-jot.qmd +0 -0
  316. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/quad.qmd +0 -0
  317. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/question.qmd +0 -0
  318. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/quote.qmd +0 -0
  319. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/radical.qmd +0 -0
  320. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/rho.qmd +0 -0
  321. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/right-arrow-from-bar.qmd +0 -0
  322. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/right-left-arrows.qmd +0 -0
  323. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/right-tack.qmd +0 -0
  324. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/right-tail-arrow.qmd +0 -0
  325. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/slash-bar.qmd +0 -0
  326. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/slash.qmd +0 -0
  327. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/star-diaeresis.qmd +0 -0
  328. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/star.qmd +0 -0
  329. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/stile-tilde.qmd +0 -0
  330. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/stile.qmd +0 -0
  331. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/thorn.qmd +0 -0
  332. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/tilde-diaeresis.qmd +0 -0
  333. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/tilde.qmd +0 -0
  334. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/times.qmd +0 -0
  335. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/up-arrow.qmd +0 -0
  336. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/up-shoe.qmd +0 -0
  337. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/up-tack.qmd +0 -0
  338. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/vee-bar.qmd +0 -0
  339. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/vee.qmd +0 -0
  340. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/wedge-bar.qmd +0 -0
  341. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/wedge.qmd +0 -0
  342. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/glyphs/zilde.qmd +0 -0
  343. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/index.ipynb +0 -0
  344. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/introspection.ipynb +0 -0
  345. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/keyboard.qmd +0 -0
  346. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/magics.ipynb +0 -0
  347. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/nbdev.yml +0 -0
  348. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/notebooks.ipynb +0 -0
  349. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/overview.ipynb +0 -0
  350. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/papers/aplwiki-arrays.md +0 -0
  351. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/papers/brickman-depth-1-scalars.md +0 -0
  352. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/papers/mercer-based-system.md +0 -0
  353. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/playground/bpl.js +0 -0
  354. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/playground/gallery.js +0 -0
  355. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/playground/monaco-worker.js +0 -0
  356. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/playground/page.js +0 -0
  357. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/playground/worker.js +0 -0
  358. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/playground.qmd +0 -0
  359. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/plot.ipynb +0 -0
  360. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/processes.qmd +0 -0
  361. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/puppy.jpg +0 -0
  362. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/strings.ipynb +0 -0
  363. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/styles.css +0 -0
  364. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/_metadata.yml +0 -0
  365. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/c.qmd +0 -0
  366. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/canvas.qmd +0 -0
  367. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/constants.qmd +0 -0
  368. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/copy.qmd +0 -0
  369. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/csv.qmd +0 -0
  370. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/date.qmd +0 -0
  371. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/decompose.qmd +0 -0
  372. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/deflate.qmd +0 -0
  373. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/delay.qmd +0 -0
  374. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/ex.qmd +0 -0
  375. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/fetch.qmd +0 -0
  376. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/hash.qmd +0 -0
  377. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/host.qmd +0 -0
  378. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/image.qmd +0 -0
  379. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/js.qmd +0 -0
  380. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/json.qmd +0 -0
  381. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/literal.qmd +0 -0
  382. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/memory.qmd +0 -0
  383. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/metadata.qmd +0 -0
  384. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/mime.qmd +0 -0
  385. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/mkdir.qmd +0 -0
  386. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/nc.qmd +0 -0
  387. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/nget.qmd +0 -0
  388. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/nl.qmd +0 -0
  389. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/normalize.qmd +0 -0
  390. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/nput.qmd +0 -0
  391. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/path.qmd +0 -0
  392. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/plot.qmd +0 -0
  393. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/r.qmd +0 -0
  394. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/readdir.qmd +0 -0
  395. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/remove.qmd +0 -0
  396. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/rename.qmd +0 -0
  397. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/signal.qmd +0 -0
  398. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/src.qmd +0 -0
  399. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/svg.qmd +0 -0
  400. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/time.qmd +0 -0
  401. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/ucs.qmd +0 -0
  402. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/uuid.qmd +0 -0
  403. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/vfi.qmd +0 -0
  404. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/system/xml.qmd +0 -0
  405. {basedpl-0.1.55 → basedpl-0.1.58}/nbs/terms.qmd +0 -0
  406. {basedpl-0.1.55 → basedpl-0.1.58}/package-lock.json +0 -0
  407. {basedpl-0.1.55 → basedpl-0.1.58}/package.json +0 -0
  408. {basedpl-0.1.55 → basedpl-0.1.58}/provenance/aplcart.jsonl +0 -0
  409. {basedpl-0.1.55 → basedpl-0.1.58}/provenance/april.jsonl +0 -0
  410. {basedpl-0.1.55 → basedpl-0.1.58}/provenance/bqn.jsonl +0 -0
  411. {basedpl-0.1.55 → basedpl-0.1.58}/provenance/core.jsonl +0 -0
  412. {basedpl-0.1.55 → basedpl-0.1.58}/provenance/dyalog.jsonl +0 -0
  413. {basedpl-0.1.55 → basedpl-0.1.58}/provenance/ngn.jsonl +0 -0
  414. {basedpl-0.1.55 → basedpl-0.1.58}/py/build.rs +0 -0
  415. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/_modidx.py +0 -0
  416. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/bpl.tmLanguage.json +0 -0
  417. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/dyalog.py +0 -0
  418. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/editors.py +0 -0
  419. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/font.py +0 -0
  420. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/fonts.css +0 -0
  421. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/input.js +0 -0
  422. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/ipython.py +0 -0
  423. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/keyboards.json +0 -0
  424. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/keyboards.py +0 -0
  425. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/layout.json +0 -0
  426. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/lb.js +0 -0
  427. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/notebook_runner.py +0 -0
  428. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/notebooks.py +0 -0
  429. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/printing.py +0 -0
  430. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/reference.py +0 -0
  431. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/syntax.py +0 -0
  432. {basedpl-0.1.55 → basedpl-0.1.58}/python/basedpl/windows_keyboard.py +0 -0
  433. {basedpl-0.1.55 → basedpl-0.1.58}/rustfmt.toml +0 -0
  434. {basedpl-0.1.55 → basedpl-0.1.58}/scripts/install-macos.sh +0 -0
  435. {basedpl-0.1.55 → basedpl-0.1.58}/scripts/prep.py +0 -0
  436. {basedpl-0.1.55 → basedpl-0.1.58}/src/agreement.rs +0 -0
  437. {basedpl-0.1.55 → basedpl-0.1.58}/src/canvas.js +0 -0
  438. {basedpl-0.1.55 → basedpl-0.1.58}/src/canvas.rs +0 -0
  439. {basedpl-0.1.55 → basedpl-0.1.58}/src/eval/dissect.rs +0 -0
  440. {basedpl-0.1.55 → basedpl-0.1.58}/src/image/codecs.rs +0 -0
  441. {basedpl-0.1.55 → basedpl-0.1.58}/src/image/imageio.rs +0 -0
  442. {basedpl-0.1.55 → basedpl-0.1.58}/src/plot.rs +0 -0
  443. {basedpl-0.1.55 → basedpl-0.1.58}/src/xml.rs +0 -0
  444. {basedpl-0.1.55 → basedpl-0.1.58}/tests/highlighting.mjs +0 -0
  445. {basedpl-0.1.55 → basedpl-0.1.58}/tests/input.mjs +0 -0
  446. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/LICENSE-aplcart +0 -0
  447. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/LICENSE-april +0 -0
  448. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/LICENSE-bqn +0 -0
  449. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/LICENSE-bqncrate +0 -0
  450. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/LICENSE-dyalog +0 -0
  451. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/LICENSE-ngn +0 -0
  452. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/README.md +0 -0
  453. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/graphics.bpl +0 -0
  454. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/support/april.bpl +0 -0
  455. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/support/avl.bpl +0 -0
  456. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/support/redblack.bpl +0 -0
  457. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/support/sbst.bpl +0 -0
  458. {basedpl-0.1.55 → basedpl-0.1.58}/tests/reference/support/splay.bpl +0 -0
  459. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_glyphs.py +0 -0
  460. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_graphics.py +0 -0
  461. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_ipython.py +0 -0
  462. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_keylayout.py +0 -0
  463. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_notebooks.py +0 -0
  464. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_reference.py +0 -0
  465. {basedpl-0.1.55 → basedpl-0.1.58}/tests/test_windows_keyboard.py +0 -0
  466. {basedpl-0.1.55 → basedpl-0.1.58}/tests/wasm-pkg.mjs +0 -0
  467. {basedpl-0.1.55 → basedpl-0.1.58}/tests/wasm.mjs +0 -0
  468. {basedpl-0.1.55 → basedpl-0.1.58}/tests/windows_keyboard.c +0 -0
  469. {basedpl-0.1.55 → basedpl-0.1.58}/wheel/data/share/jupyter/kernels/bpl/kernel.json +0 -0
@@ -34,6 +34,13 @@ jobs:
34
34
  manylinux: auto
35
35
  # This runs inside the manylinux container, whose old glibc lets the binary run on older Linux distributions.
36
36
  before-script-linux: export PATH="/opt/python/cp311-cp311/bin:$PATH" && python3.11 -m pip install 'fastws-cli>=0.0.25' && ${{ env.STAGE_BPL }}
37
+ # The release build's own costs, for comparison with CI's. `basedpl.bpltests.logged_costs` reads this log. Timing never fails the release.
38
+ - name: Time the release build
39
+ continue-on-error: true
40
+ timeout-minutes: 20
41
+ run: |
42
+ echo "model name : $(if [ "$RUNNER_OS" = macOS ]; then sysctl -n machdep.cpu.brand_string; else lscpu | sed -n 's/^Model name: *//p' | head -1; fi)"
43
+ bin/${{ matrix.binary }} --costs tests/speed.txt
37
44
  - uses: actions/upload-artifact@v7
38
45
  with:
39
46
  name: wheels-${{ matrix.os }}
@@ -11,14 +11,13 @@ jobs:
11
11
  steps:
12
12
  - uses: actions/checkout@v7
13
13
  - uses: dtolnay/rust-toolchain@stable
14
- - run: cargo generate-lockfile
15
- # Only the `Test` workflow's `test` job saves this cache. This job builds only part of what `test` builds. GitHub never replaces a saved cache under the same key.
16
- - uses: Swatinem/rust-cache@v2
14
+ - uses: actions/setup-python@v7
17
15
  with:
18
- shared-key: native
19
- save-if: false
16
+ python-version: '3.12'
17
+ # This job times the `bpl` that releases ship, which `cargo stage --profile dist` builds, as the `Release` workflow does. `bpl --costs` prints every case's cost and budget for `basedpl.bpltests.logged_costs`. A case over its budget doesn't fail it. The job builds without a cache. The `Test` workflow's caches hold only test-profile builds.
18
+ - run: pip install 'fastws-cli>=0.0.25' && cargo stage --profile dist
20
19
  - run: grep -m1 'model name' /proc/cpuinfo
21
- - run: BASEDPL_COSTS=1 cargo test --test speed
20
+ - run: wheel/scripts/bpl --costs tests/speed.txt
22
21
 
23
22
  wasm:
24
23
  runs-on: ubicloud-standard-4
@@ -17,7 +17,6 @@ jobs:
17
17
  - uses: dtolnay/rust-toolchain@stable
18
18
  # The repository has no `Cargo.lock`. Creating one first makes rust-cache's key change when a dependency publishes a new version.
19
19
  - run: cargo generate-lockfile
20
- # The `Speed` workflow restores this cache and the `wasm` job's, by their `shared-key`.
21
20
  - uses: Swatinem/rust-cache@v2
22
21
  with:
23
22
  shared-key: native
@@ -41,6 +40,7 @@ jobs:
41
40
  with:
42
41
  targets: wasm32-unknown-unknown
43
42
  - run: cargo generate-lockfile
43
+ # The `Speed` workflow's `wasm` job restores this cache, by its `shared-key`.
44
44
  - uses: Swatinem/rust-cache@v2
45
45
  with:
46
46
  shared-key: wasm
@@ -93,7 +93,7 @@ checksum = "ac07cdecf99051d9a5238b80f35af32cdeba5b336e55d957b318b50137e18da5"
93
93
 
94
94
  [[package]]
95
95
  name = "basedpl"
96
- version = "0.1.55"
96
+ version = "0.1.58"
97
97
  dependencies = [
98
98
  "base64 0.23.1",
99
99
  "bytemuck",
@@ -108,7 +108,6 @@ dependencies = [
108
108
  "image",
109
109
  "js-sys",
110
110
  "json5",
111
- "libc",
112
111
  "nix",
113
112
  "num-bigint",
114
113
  "num-complex",
@@ -140,7 +139,7 @@ dependencies = [
140
139
 
141
140
  [[package]]
142
141
  name = "basedpl-cli"
143
- version = "0.1.55"
142
+ version = "0.1.58"
144
143
  dependencies = [
145
144
  "async-trait",
146
145
  "basedpl",
@@ -154,7 +153,7 @@ dependencies = [
154
153
 
155
154
  [[package]]
156
155
  name = "basedpl-py"
157
- version = "0.1.55"
156
+ version = "0.1.58"
158
157
  dependencies = [
159
158
  "basedpl",
160
159
  "num-bigint",
@@ -168,7 +167,7 @@ dependencies = [
168
167
 
169
168
  [[package]]
170
169
  name = "basedpl-wasm"
171
- version = "0.1.55"
170
+ version = "0.1.58"
172
171
  dependencies = [
173
172
  "basedpl",
174
173
  "js-sys",
@@ -259,9 +258,9 @@ checksum = "fc652a48c352aef3ea3aed32080501cf3ef6ed5da78602a020c991775b0aff04"
259
258
 
260
259
  [[package]]
261
260
  name = "cc"
262
- version = "1.8.0"
261
+ version = "1.9.0"
263
262
  source = "registry+https://github.com/rust-lang/crates.io-index"
264
- checksum = "6651c9ed80effdc7db0ff72512157f901af5e3549e341e24b1dd4887d836d838"
263
+ checksum = "877bf67ac8e52449eb2f9e98a344ea163beb70dd1f9eebe3cc5357dcfeaee4df"
265
264
  dependencies = [
266
265
  "find-msvc-tools",
267
266
  "shlex",
@@ -536,9 +535,9 @@ dependencies = [
536
535
 
537
536
  [[package]]
538
537
  name = "find-msvc-tools"
539
- version = "0.1.14"
538
+ version = "0.1.15"
540
539
  source = "registry+https://github.com/rust-lang/crates.io-index"
541
- checksum = "aedcfb3409746eddb02b9e19ebda1c3394f759a152e48ee875a0844d1b955484"
540
+ checksum = "1c66915cc5391097de7a2b0b972e8505aa33c0df401fd3a6811dbdb32881ba48"
542
541
 
543
542
  [[package]]
544
543
  name = "flate2"
@@ -1399,7 +1398,7 @@ checksum = "cf54715a573b99ac80df0bc206da022bcd442c974952c7b9720069370852e21f"
1399
1398
  [[package]]
1400
1399
  name = "rustyline"
1401
1400
  version = "18.0.0"
1402
- source = "git+https://github.com/AnswerDotAI/rustyline.git?branch=master#ea46621f7d527167012133e52157d468eed4e641"
1401
+ source = "git+https://github.com/AnswerDotAI/rustyline.git?branch=master#4b74b68d37cec5ac2e4713994297e9f0da873c61"
1403
1402
  dependencies = [
1404
1403
  "bitflags",
1405
1404
  "clipboard-win",
@@ -1416,12 +1415,13 @@ dependencies = [
1416
1415
 
1417
1416
  [[package]]
1418
1417
  name = "rustymath"
1419
- version = "0.1.28"
1418
+ version = "0.1.35"
1420
1419
  source = "registry+https://github.com/rust-lang/crates.io-index"
1421
- checksum = "f314692c6406796c90b8b3569bcbd57e3c119bd9975a828197553c057ac91635"
1420
+ checksum = "1816c6f17d66e4aa29bc1652afd9679746db47f73c00f126dbd68979a5d1f087"
1422
1421
  dependencies = [
1423
1422
  "half",
1424
1423
  "hashbrown 0.17.1",
1424
+ "libc",
1425
1425
  "num-bigint",
1426
1426
  "num-complex",
1427
1427
  "num-integer",
@@ -1434,9 +1434,9 @@ dependencies = [
1434
1434
 
1435
1435
  [[package]]
1436
1436
  name = "rustymath-buffer"
1437
- version = "0.1.28"
1437
+ version = "0.1.35"
1438
1438
  source = "registry+https://github.com/rust-lang/crates.io-index"
1439
- checksum = "c47b6c4e1bae1a9e89ff8271bfa5907e5443f9c16a71a735d3d81cc6ed8a48eb"
1439
+ checksum = "0a895306248b69ae1bb1bf0b93f71262578f1fb367fb652534cc8a8616b08b25"
1440
1440
  dependencies = [
1441
1441
  "pyo3",
1442
1442
  "rustymath",
@@ -2092,9 +2092,10 @@ checksum = "3ad82d2a33cdc9674dc7465672f271e096168fcdbe0f799d9e6db8c5892679dc"
2092
2092
 
2093
2093
  [[package]]
2094
2094
  name = "xtask"
2095
- version = "0.1.55"
2095
+ version = "0.1.58"
2096
2096
  dependencies = [
2097
2097
  "anyhow",
2098
+ "rustymath",
2098
2099
  "serde_json",
2099
2100
  "toml",
2100
2101
  "wasm-bindgen-cli-support",
@@ -5,7 +5,7 @@ members = ["py"]
5
5
  join_comments = true
6
6
 
7
7
  [workspace.package]
8
- version = "0.1.55"
8
+ version = "0.1.58"
9
9
  edition = "2021"
10
10
  rust-version = "1.98"
11
11
  license = "Apache-2.0"
@@ -60,9 +60,9 @@ 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.28, <1", default-features = false }
63
+ rustymath = { version = ">=0.1.35, <1", default-features = false }
64
64
  strength_reduce = ">=0.2.4, <1"
65
- rand = ">=0.10.2, <1"
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.
67
67
  plotters = { git = "https://github.com/AnswerDotAI/plotters.git", branch = "master", default-features = false, features = ["svg_backend", "colormaps", "full_palette"] }
68
68
  base64 = ">=0.22.1, <1"
@@ -80,8 +80,6 @@ rustix = { version = ">=1.1.5, <2", features = ["termios", "fs"] }
80
80
  nix = { version = ">=0.31.3, <1", default-features = false, features = ["user"] }
81
81
 
82
82
  [target.'cfg(target_vendor = "apple")'.dependencies]
83
- # The timing lock's QoS call, which keeps a timing on the performance cores.
84
- libc = ">=0.2.190, <1"
85
83
  # The Mac build links the zlib that macOS ships, in place of compiling `miniz_oxide`.
86
84
  flate2 = { version = ">=1.1.10, <2", default-features = false, features = ["zlib"] }
87
85
 
@@ -4,9 +4,11 @@ Keep the language concise to write, simple to read and consistent to understand.
4
4
 
5
5
  Speed and simplicity come before edge cases no real user meets. Follow IEEE, Rust and CPU behaviour where it gives a reasonable result. The last bits of a result can differ between thread counts, platforms, builds and runs. Never spend speed, memory or code to make them agree. Don't add precision, sign normalization or defensive passes without an agreed need.
6
6
 
7
+ A form with a reasonable meaning gives a result, not an error. A result that would be a bug in some programs, with no error, is acceptable when it buys useful behaviour or speed. Negative positions count from the end in every selection, as in Python, even though `x.[i-1]` at `i=0` then reads the last item. `⌈` beside NaN gives NaN or the other argument, whichever its kernel gives. Jeremy settled negative positions on 18 October 2026, after the question had come up repeatedly.
8
+
7
9
  ## You MUST read this ENTIRE section in FULL first
8
10
 
9
- LLMS: Read `nbs/llms.txt` in full before doing any work. BPL differs substantially from Dyalog APL in grouping, names, numbers and operators. Use BPL syntax, not APL idioms assumed to carry over.
11
+ LLMS: Read `nbs/llms.txt` in full before doing any work. BPL differs substantially from Dyalog APL in grouping, names, numbers and operators. Use BPL syntax, not APL idioms assumed to carry over. The links in `nbs/llms.txt` are relative to the published site. In this repository, read each linked page's source under `nbs/`, as in `nbs/glyphs/at.qmd` for `glyphs/at.html.md` and `nbs/indexing.ipynb` for `indexing.html.md`. The published site lacks unreleased changes.
10
12
 
11
13
  ```bash
12
14
  cargo develop
@@ -18,17 +20,21 @@ Use `cargo develop` to rebuild and install the native extension and `bpl` after
18
20
 
19
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.
20
22
 
21
- 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`. 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.
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
+
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.
26
+
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.
22
28
 
23
- 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, and `cargo_costs(path)` runs either project's speed test.
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.
24
30
 
25
- The manual `Speed` workflow measures the native and wasm builds on CI. On each push, the `Test` workflow also logs every native cost in its `test` job and every wasm cost in its `wasm` job. `logged_costs` reads those logs like a `Speed` run's. When you review a run, look mainly for costs that changed by more than 20%, especially where several similar operations changed by similar amounts. Never raise budgets mechanically from a run's costs, because mechanical rises can lock in poor performance. Study each slowdown until you know its cause. Raise a budget only for a slowdown you've judged reasonable, never for a minor variation. `set_budgets(native, wasm, cases=cases)` applies the rule in the budget file to the cases that `cases` names. 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`. A budget in copies is then four times the Mac cost, as the budget file's header says. `path=` selects rustymath's `tests/speed.txt`.
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`.
26
32
 
27
- The speed tests and the scaling test time each failing case again after the rest, after each pause in `basedpl::timing::RETRY_PAUSES`, and fail only for a case that fails every time. Each retry prints the case's earlier and new costs, even in a passing run. `logged_costs` keeps a retried case's lowest cost. Study a case that needs a retry in most runs, as you would a slowdown.
33
+ The speed tests and the scaling test time each failing case again after the rest, after each pause in `rustymath::timing::RETRY_PAUSES`, and fail only for a case that fails every time. Each retry prints the case's earlier and new costs, even in a passing run. `logged_costs` keeps a retried case's lowest cost. Study a case that needs a retry in most runs, as you would a slowdown.
28
34
 
29
35
  For a change meant to make something faster, or a change to code that every call goes through, time the cases it affects before and after the change. Before your first `cargo develop`, copy the installed `bpl` in the kernel with `shutil.copy(basedpl.worker.INSTALLED_BPL, '/tmp/<prefix>_bpl')`. Time that copy with `bpl='/tmp/<prefix>_bpl'`, and your build with the default. Another agent's `cargo develop` can replace the installed `bpl` at any time. The copy keeps your baseline fixed while agents build in parallel. Because costs in copies correct for the machine's overall speed, the two timings compare directly at the 20% level that review looks for. A budget allows twice a case's worst cost. The speed test alone misses any smaller slowdown. Other changes need only the speed test. Don't restore old code in the shared tree to get a baseline. On macOS, native timings of matrix products and decompositions mostly measure Accelerate. Rustymath's DEV.md says how to time rustymath's own kernels.
30
36
 
31
- Cooperating tools share `/tmp/aai-ws-timing.lock`. Timings take it exclusively. `cargo develop`, `cargo wasm`, the reference test and pytest take it shared. Other Rust tests and bare Cargo commands do not all take it. After five minutes a timing fails; a build/test proceeds without the lock. After 30 seconds, an exclusive wait prints the processes with the lock file open. The list can include processes that are only waiting for the lock. Never hold it in the shared kernel process or coordinate timings manually. A timing launched there would block behind the hold and stall other agents' kernel calls. Native timings set rustymath's current-thread count to one and request user-interactive macOS QoS to favour performance cores. QoS is not CPU affinity.
37
+ Cooperating tools share the machine's timing lock, `/tmp/aai-ws-timing.lock`. Timings take it exclusively. `cargo develop`, `cargo wait`, `cargo wasm`, the reference test, pytest and `wasm_test` without `speed` take it shared. Rust code takes it through `rustymath::timing`. Python code takes it with `fastws.cargo.timing_lock`. Node can't lock a file. `wasm_test` and `speed_costs(wasm=DIR)` hold the lock in Python while Node runs. Other Rust tests and bare Cargo commands do not all take it. After five minutes a timing fails. A build or test run then goes ahead without the lock. After 30 seconds, an exclusive wait prints the processes with the lock file open. The list can include processes that are only waiting for the lock. Never take the lock yourself in the shared kernel process. Never coordinate timings by hand. A hold that outlasts its call blocks the timings that later calls launch. Each such call stalls every other agent's kernel calls while it waits. Native timings run on one thread and request user-interactive macOS QoS, which favours the performance cores. QoS is not CPU affinity.
32
38
 
33
39
  Run `cargo wasm` during development only for browser work. Agents use `cargo wasm --out DIR`, then run the browser tests against that build with `basedpl.bpltests.wasm_test(DIR)` for `tests/wasm.mjs` and `wasm_test(DIR, speed=True)` for `tests/wasm-speed.mjs`. This avoids replacing a module another agent is using. For other edits under `cfg(web)` or `host_web.rs`, check compilation with `cargo check -p basedpl --target wasm32-unknown-unknown`.
34
40
 
@@ -37,10 +43,10 @@ Run `cargo wasm` during development only for browser work. Agents use `cargo was
37
43
  To inspect the x86-64 code that CI and Linux run, build the library for Linux x86-64. In basedpl:
38
44
 
39
45
  ```bash
40
- CC_x86_64_unknown_linux_gnu=clang cargo build --lib --release --target x86_64-unknown-linux-gnu --target-dir /tmp/aai-ws-x86 -p basedpl
46
+ CARGO_INCREMENTAL=0 CC_x86_64_unknown_linux_gnu=clang cargo build --lib --release --target x86_64-unknown-linux-gnu --target-dir /tmp/aai-ws-x86 -p basedpl
41
47
  ```
42
48
 
43
- In rustymath, use `-p rustymath`. The target is Linux because macOS builds leave out rustymath's native linear algebra kernels. That target is installed here. `-p` builds only the library, because the Python extension crates can't be built for Linux on this Mac. `CC_x86_64_unknown_linux_gnu=clang` lets Apple's `clang` assemble the x86-64 source in basedpl's `psm` dependency, because this Mac has no `x86_64-linux-gnu-gcc`. Don't move that setting into `.cargo/config.toml`. CI's Linux release builds also read that file, and their manylinux container has no `clang`. The build matches CI's `test` profile in its x86-64 flags and optimization settings. Run it only to answer an x86-code question. It doesn't take the timing lock and can disturb timings running alongside it.
49
+ In rustymath, use `-p rustymath`. The target is Linux because macOS builds leave out rustymath's native linear algebra kernels. That target is installed here. `-p` builds only the library, because the Python extension crates can't be built for Linux on this Mac. `CC_x86_64_unknown_linux_gnu=clang` lets Apple's `clang` assemble the x86-64 source in basedpl's `psm` dependency, because this Mac has no `x86_64-linux-gnu-gcc`. Don't move that setting into `.cargo/config.toml`. CI's Linux release builds also read that file, and their manylinux container has no `clang`. The build matches CI's `test` profile in its x86-64 flags and optimization settings. CI turns off the profile's incremental compilation with `CARGO_INCREMENTAL=0`. The command does the same, to split code into compilation units as CI does. Run it only to answer an x86-code question. It doesn't take the timing lock and can disturb timings running alongside it.
44
50
 
45
51
  Read the newest `lib<crate>-<hash>.rlib` under `/tmp/aai-ws-x86/x86_64-unknown-linux-gnu/release/deps` with `objdump -d -r --no-show-raw-insn --disassemble-symbols=NAME`. `-r` identifies called functions. `objdump` warns for each archive object without that symbol. `-C` matches demangled names but splits them at commas; for a generic name containing a comma, get its mangled name from `nm` and omit `-C`. Generic code belongs to the crate that instantiates it. Don't use `--emit asm`: the resulting codegen-unit arrangement can inline differently from the build being inspected.
46
52
 
@@ -52,7 +58,7 @@ Read the newest `lib<crate>-<hash>.rlib` under `/tmp/aai-ws-x86/x86_64-unknown-l
52
58
  | `cli/` (`basedpl-cli`) | `bpl`, REPL, Jupyter kernel and JSON-lines worker. |
53
59
  | `py/` (`basedpl-py`) | Unpublished PyO3 extension, `basedpl._core`. |
54
60
  | `wasm/` (`basedpl-wasm`) | Browser bindings. |
55
- | `xtask/` | Browser package build tooling. |
61
+ | `xtask/` | `cargo wasm`, which builds the browser package. |
56
62
 
57
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.
58
64
 
@@ -64,17 +70,17 @@ Basedpl's crates pass on rustymath's default `native` feature, which rustymath's
64
70
 
65
71
  Use published dependency ranges with the lower bounds required by the APIs in use. `Cargo.toml` names a published rustymath range; the `~/aai-ws` Cargo patch selects the sibling checkout locally. CI resolves published crates. Release rustymath changes before relying on them in basedpl CI. Don't edit fastws-generated Cargo patches, `.git/fastws-cargo-key` or workspace configuration, and don't commit the workspace-generated `Cargo.lock`. `meta/` is ignored planning material, not contributor documentation. `[tool.uv] cache-keys` tracks packaging manifests, not Rust sources.
66
72
 
67
- `Test` runs native and wasm jobs on pushes to main and pull requests. Native CI runs `cargo test`, editable installation, `cargo develop`, pytest, `bpl-nb` and `nbdev-test`. Python tests use the same test-profile build. The wasm job builds with `cargo wasm --strip` and runs both Node suites. Both jobs use `ubicloud-standard-4`; speed budgets are set for that runner. They generate a lockfile before restoring `Swatinem/rust-cache`, making dependency changes part of the cache key. `Speed` is manually triggered and restores those caches.
73
+ `Test` runs native and wasm jobs on pushes to main and pull requests. Native CI runs `cargo test`, editable installation, `cargo develop`, pytest, `bpl-nb` and `nbdev-test`. Python tests use the same test-profile build. The wasm job builds with `cargo wasm --strip` and runs both Node suites. Both jobs use `ubicloud-standard-4`; speed budgets are set for that runner. They generate a lockfile before restoring `Swatinem/rust-cache`, making dependency changes part of the cache key. `Speed` is manually triggered. Its `wasm` job restores the `Test` workflow's wasm cache. Its native job builds the `dist` profile without one.
68
74
 
69
75
  `Release` runs separately on `v*` tags on GitHub's runners. It builds dist wheels, sdist, standalone CLI artifacts and the Windows keyboard archive, then publishes Python artifacts and the GitHub release. Its npm job publishes the stripped browser package through trusted publishing and purges jsDelivr's package files to avoid stale unversioned URLs. Release neither runs tests nor waits for the Test workflow.
70
76
 
71
77
  ### Codegen and rebuilds
72
78
 
73
- LTO-off incremental builds keep an edit from recompiling every caller that inlined it. Debug line tables increase rebuild work when lines move. Related source is split into child modules to limit those shifts. Children use `use super::*` and expose items to parents/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`. 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.
74
80
 
75
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.
76
82
 
77
- 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. These commands diagnose the current compilation arrangement; don't create scratch builds to approximate it.
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.
78
84
 
79
85
  ## Code map
80
86
 
@@ -100,7 +106,7 @@ User-facing language rules belong in `nbs/syntax.qmd`, `evaluation.qmd`, `number
100
106
 
101
107
  ## Parser, evaluator and scopes
102
108
 
103
- The lexer/parser records byte spans and structural syntax without evaluating expressions. `parse_at` distinguishes complete input, incomplete input and errors at a given float width. Public `parse` uses f64; `Session::parse` uses the session width. `syntax_tree` supplies source tools with structural nodes and recovers invalid chunks as `Error` nodes. `highlight` shares the lexer.
109
+ The lexer/parser records byte spans and structural syntax without evaluating expressions. `parse` distinguishes complete input, incomplete input and errors. It reads numbers under the thread's current settings, which `Session::parse` sets from the session first. `syntax_tree` supplies source tools with structural nodes and recovers invalid chunks as `Error` nodes. `highlight` shares the lexer.
104
110
 
105
111
  `symbols.rs` owns APL, simplified and traditional Hanzi spellings. Its rows also hold each glyph's names: a glyph name for the character, which is also its page's file name in `nbs/glyphs/`, and a name for each valence, or one name where both valences do the same thing. The glyph reference, named entry, help and Python's exported names all read them there. Parsing always accepts them together, canonicalizing token decisions while retaining original source and spans. Han characters are reserved outside strings and comments. The `notation` preference affects structured function/operator display, not stored source, serialization or structural APIs; help and editor metadata use the same spelling table.
106
112
 
@@ -130,10 +136,12 @@ Numeric storage fills with zero and characters with blank. Mixed nonempty arrays
130
136
 
131
137
  Selective assignment and structural Under share label-based target discovery. Function-Under applies its selector to both arguments independently before calling its operand; labels then identify writeback into the right argument. Positions-Under passes the left argument whole. Keep those contracts distinct. Keyed values align to selected keys, and nested paths retain empty-cell structure.
132
138
 
133
- 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 modifiers group repeated targets into rounds or a suitable column scan; they do not apply all targets to the original values. 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.
139
+ 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.
134
140
 
135
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.
136
142
 
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.
144
+
137
145
  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.
138
146
 
139
147
  Inverse nodes propagate fixed-argument sides through composition. `f⁻¹←g` and `f∂←g` replace the binding with a `Ruled` node, which holds the function with its hand-written inverse and derivative. Calling it calls the function. `⁻¹` and `∂` use the rules, and Under counts an attached inverse as keeping every item. Candidate-building primitive inverses validate by applying the primitive again. Inverse scans share forward scan's seed/axis validation. Agenda calls its selector once, then passes the original arguments to the selected branch. Computed operands for Rank, Axis, Stencil and Agenda use shared operand evaluation. Python constructs these nodes directly, not by generating source.
@@ -144,14 +152,18 @@ Inverse nodes propagate fixed-argument sides through composition. `f⁻¹←g` a
144
152
 
145
153
  `number.rs` owns scalar kinds, promotion and exactness. Integers and BigRational share an exact domain. Overflowing scalar integer arithmetic widens to exact rationals; integral rational results narrow back when possible. Booleans are a distinct kind. Arithmetic reads them as 0/1; logical operations preserve them. Match/search/grade compare their numeric value, while reference checks also distinguish representation and exactness.
146
154
 
147
- Joining compact arrays widens Boolean -> integer -> float -> complex, and float widths join at the wider width. Item-by-item construction preserves exact/approximate kinds and stays mixed when needed; only approximate real/complex items widen together. Rearranging or updating mixed storage never scans it for compaction. Fresh computations choose storage from their result path. Keep this distinction between whole-array joining and element assembly.
155
+ Joining compact arrays widens Boolean -> integer -> float -> complex, and float widths join at the wider width. Item-by-item construction preserves exact/approximate kinds and stays mixed when needed; only approximate real/complex items widen together. Rearranging or updating mixed storage never scans it for compaction. Fresh computations choose storage from their result path. Results that an operation computes one cell at a time, as Each, Rank, Key, `⌺`, power histories, and the polynomial and number-theory functions do, assemble as items, through `Value::assemble`. Mix and catenation join arrays. Keep this distinction between whole-array joining and element assembly.
148
156
 
149
157
  Bare numbers, empty literals and NaN use the parsed float width. Top-level `evaluate_code` first validates the whole syntax, runs leading literal-record `•prefs` statements, then parses the remainder at the new width. A syntax error prevents header execution. The default width also applies to imported numbers, random data and float results from exact operands. Time/date/metadata values use f64. Formatting marks non-default widths; serialization marks every float for width-independent readback.
150
158
 
151
- Float operations compute at the wider operand width. Exact operands round to that width first. f16 whole operations run on f32 copies through `pervasive::halves`, rounding exact inputs to f16 before widening and rounding float outputs back. The scalar `Number` path rounds each f16 step. Complex parts have f32/f64 widths; f16 becoming complex uses f32 parts. Scalar Complex32 arithmetic computes at Complex64 and rounds, while kernels can compute at f32. These paths need not agree in their last bits.
159
+ Float operations compute at the wider operand width. Exact operands round to the width an operation computes at. f16 operations run on f32 copies. `Numeric::halving` decides when: for a call with an f16 operand, or any call while the default width is 16 bits. `pervasive::halves` applies it to whole operations and `Number::halves` to scalar arithmetic and comparisons. `fusion::defer` declines those calls. Exact inputs convert once, to f32, and float outputs round back to f16. The scalar `Number` path rounds each f16 step. Complex parts have f32/f64 widths; f16 becoming complex uses f32 parts. Scalar Complex32 arithmetic computes at Complex64 and rounds, while kernels can compute at f32. These paths need not agree in their last bits.
152
160
 
153
161
  Floats use IEEE NaN, infinity and signed zero. Comparison treats NaN as unequal; match/search treat it as one value, and grade puts it last. Exact arithmetic involving division by zero can produce those float values. Floor/ceiling retain an exact operand beside infinity and give NaN beside NaN. Monadic floor/ceiling/sign turn whole finite results into exact integers, including big integers; nonfinite results remain floats. Use `Number::float(value, width)` and explicit-width array construction outside `number.rs` instead of implicit f64 conversion.
154
162
 
163
+ Under `•prefs ["kinds":"static"]`, a result's kind follows from its arguments' kinds alone, as `meta/kinds.md` describes. `Numeric` carries `kinds` and `int`. `pervasive::map` chooses a dyadic call's kind through `joined`, which applies rustymath's `DType::common` after `Numeric::kind`. Atoms promote as arrays do. Python's API makes its scalar arguments weak through `Value::weakened`. The loops keep the failed results that `keeps` names: floats' NaNs, and the wrapped integers of objects that report `WRAPS`. The kernel tables choose float `⌊ ⌈ ×` and wrapping negation from `run.numeric()`. `Stored::build_at` keeps complex results complex. `Primitive::number` gives every pervasive result on numbers, as well as each step of the fold of numbers, and `statically` adjusts it. `Number::parse` keeps complex literals and checks integer literals against the `int` width.
164
+
165
+ Session settings live in one central place and are read from there, not passed through functions, except where a read is slow and on a hot path. That place is a per-thread variable that `Numeric::current` reads. `Session::evaluation` and `Session::parse` copy the session's `Numeric` into it when they start. `•prefs` updates both. Nothing resets it. A value read after its evaluation ends, by Python, the JSON worker, display or a Rust embedder, reads under its session's settings, unless another session has run on the thread since. Every frontend reads values on the thread that evaluated them. A `•prefs` call partway through a session changes the settings from then on, and a value made before it can read or compute under the new settings. A module that `•load` runs uses its loader's session and settings. Each call reads `Numeric::current` once where it starts: `pervasive::halves`, which every `pervasive` entry point goes through, `fusion::defers` and `defer`, `Domain::of`, the lexer and `Storage::item`'s complex items. Values derived from the settings within a call stay explicit arguments. `halves` passes 16-bit floats' widened settings to its inner call. The loop structs keep them because their closures run on rustymath's worker threads. A fused graph takes the current settings when it's built at forcing, for the same reason. `Number`'s tolerance methods and `Primitive::number` take them because they run once per item. The parser's leaves take a width marker's width, and `matches_within` takes `⍣∞`'s convergence tolerance. Imports build complex numbers with `Number::complex_in_session`: Python's `_Session.array` and the JSON protocol's `request`. JavaScript values hold no complex numbers.
166
+
155
167
  Only f64 comparisons use the session tolerance, from 0 to `1E-14`. f32/f16 compare exactly except fixed-point convergence, which uses four ulps; f64 convergence uses `1E-14` independently of the preference. Index/count/Boolean/character-offset conversion uses `near_integer` with the fixed default tolerance, not the comparison preference. The tolerant types and objects come from rustymath. Keep independent inside/outside-tolerance tests with exact/mixed controls; don't use language comparison as its own oracle.
156
168
 
157
169
  `search.rs` selects compact exact or tolerant backends. Exact integer/Boolean/character storage uses keys; float searches use their width. Integer haystacks accept the whole-number shortcut only for exactly whole float needles. Tolerant indexing validates whole-key matches unless the haystack is exactly whole and falls back to buckets on mismatch. Classification intentionally chains tolerance through sorted runs, so it need not match every member to one representative. Other cells use exact hashes or first-number buckets with `Value::matches` confirmation, falling back to pairwise comparison where indexing is unsuitable. Grade is stable. Position buffers use u32 and become integer storage without another pass. `⍷` and monadic Key take each class's positions from `search::class_positions`, which keeps a class's own buffer for 32-bit positions and copies narrower ones once from the shared buffer. Dyadic Key selects rows through `Grouped::each` slices. Key with the operand `≢⊢`, which `≢∘⊢` also builds, counts its classes through `search::class_counts` and builds no positions.
@@ -174,19 +186,19 @@ Custom elementwise closures use `rustymath::pairs` and its uninitialized append
174
186
 
175
187
  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.
176
188
 
177
- `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. 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. 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.
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`).
178
190
 
179
- 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. 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.
191
+ 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.
180
192
 
181
- `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. 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`.
193
+ `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`.
182
194
 
183
- `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. 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.
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.
184
196
 
185
197
  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.
186
198
 
187
199
  The automatic Rayon scheduler serves rustymath elementwise `many` and `pairs`, broadcasts through `agreement::blocks`, folds through `reduce::along`, fused graphs and matrix products. Scans don't split. Decompositions split in the products of their blocked updates, the passes of their Hermitian and bidiagonal reductions, and their divide-and-conquer merges. `rank` sends dyadic `+.×` and `⌹`, monadic `⌹` and `-.×`, and `•decompose` over the 2-cells of an unkeyed stack with compact storage to `primitive::stacked` and `stacked_decompositions`. They run each cell through the rustymath function it uses alone. A pervasive operand, or Rank nested down to one, runs as one call: each argument gets length-1 axes after each level's frame, so leading-axis agreement pairs frames with frames and cells with cells. Arguments with axis names still go cell by cell. Rustymath's `parallel::stack_with` splits whole cells across threads in rounds, with `check_now` between rounds. A caller whose checks run far apart, such as a round or a rustymath `_with` callback, calls `check_now`, because `Context::check` reads the clock only on every 64th call. The scheduler adapts to call cost, uses `RAYON_NUM_THREADS` by default and accepts current-thread overrides through `parallel::set_threads` (0 default, 1 serial). `Session::evaluation` applies a session's `•prefs ["threads":n]` to each of its evaluations, then restores the thread's own setting. A session that never sets it keeps the evaluating thread's setting, such as the timing harness's one thread. Nested Rayon work does not split again; wasm is serial. A fused graph splits in pieces of whole blocks: an elementwise graph through `parallel::extended`, and a folded one through `reduce::fold_pieces`. On one thread an elementwise graph appends straight to its result, because copying each block into a piece's slots cost up to 1.2 copies there. Small converted chunks limit the work available to the scheduler. Don't infer multicore execution from a large array alone.
188
200
 
189
- Packed numeric, Boolean and equality-count inner products use `rustymath::linalg`. Other native pairs use its bounded `inner_with` runner and `reduce::right_fold`, carrying the right tail across blocks. Basedpl supplies its primitive kernels, tolerance and exact-widening fallback. Integer calls use `Inner::checked` before relying on an exact compact result. `pervasive::inner` takes each operand's `Orientation`. Its float and complex products read a transposed operand in place, as reverse mode's `product_transpose` needs. Structural gather/compress and interval index also reuse rustymath. Measure generic/backend changes in both projects; callers' codegen and layout determine costs that isolated kernels miss.
201
+ Packed numeric, Boolean and equality-count inner products use `rustymath::linalg`. Other native pairs use its bounded `inner_with` runner and `reduce::right_fold`, carrying the right tail across blocks. Basedpl supplies its primitive kernels, tolerance and exact-widening fallback. Integer calls use `Inner::checked` before relying on an exact compact result. `pervasive::inner` takes each operand's `Orientation`. Its float and complex products read a transposed operand in place, as reverse mode's `product_transpose` needs. A float `+.×` whose operand is a pending copy, or a view of one, hands rustymath's `Inner::inner_mapped` the copy's source and map (`fusion::source`, `pervasive::mapped_product`). Rustymath gives gemm an operand that its map reads at strides, such as a transpose, where it lies (`Mapped::matrix`). It reads any other copy a block of rows at a time, except in a product with one column, where the copy's rows are adjacent in storage, as for a vector or a single-channel image. It then adds each column of the copy where it lies (`linalg::by_columns`). Neither builds the copy. A copy that a name holds is read again for each product rather than cached. Reverse mode transposes a product whose operand is windows that move by 1 as one product: the windows of the zero-padded cotangent with the kernel reversed (`linear::convolved_back`, rustymath's `signal::correlation`). Structural gather/compress and interval index also reuse rustymath. Measure changes to generic or backend code in both projects. The callers' codegen and layout decide costs that a kernel measured alone misses.
190
202
 
191
203
  ## Evaluation and frontend boundaries
192
204
 
@@ -204,7 +216,7 @@ Packed numeric, Boolean and equality-count inner products use `rustymath::linalg
204
216
 
205
217
  `.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.
206
218
 
207
- Arrays retain native values. `.py` and `.np` make copies; NumPy is optional and lazy. 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.
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.
208
220
 
209
221
  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.
210
222
 
@@ -1,11 +1,11 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: basedpl
3
- Version: 0.1.55
3
+ Version: 0.1.58
4
4
  Classifier: Programming Language :: Rust
5
5
  Classifier: Programming Language :: Python :: Implementation :: CPython
6
6
  Requires-Dist: fastcore
7
7
  Requires-Dist: fastship>=0.0.11 ; extra == 'dev'
8
- Requires-Dist: fastws-cli>=0.0.25 ; extra == 'dev'
8
+ Requires-Dist: fastws-cli>=0.0.26 ; extra == 'dev'
9
9
  Requires-Dist: maturin>=1.9.4,<2.0 ; extra == 'dev'
10
10
  Requires-Dist: pytest ; extra == 'dev'
11
11
  Requires-Dist: numpy ; extra == 'dev'
@@ -14,6 +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
18
  Provides-Extra: dev
18
19
  License-File: LICENSE
19
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.
@@ -5,7 +5,7 @@ BPL utilities and Dyalog dfns adapted from [April's ports](https://github.com/ph
5
5
  Each file is a module. `•load` runs it and returns a record of its names. Take the names you use, with paths relative to the repository root:
6
6
 
7
7
  ```bpl
8
- [phinary]←•load "lib/numeric.bpl"
8
+ [phinary:]←•load "lib/numeric.bpl"
9
9
  phinary 42 ⍝ "10100010.00100001"
10
10
  ```
11
11
 
@@ -253,7 +253,7 @@ from ← { ⍝ Select (1↓⍴⍵)-cells from array ⍵.
253
253
  [indx axis]←⍺ ⍝ index and axis for selection.
254
254
  indx≡,⊂⍬?⍵; ⍝ skip: select all items.
255
255
  vec←⊂⍠(⍳⍴⍴⍵ ~ [axis])⍵ ⍝ vector along given axis.
256
- sel←⊃indx⊃¨⊂vec
256
+ sel←⊃[indx]⌷vec
257
257
  pos←axis+⍳⍴⍴indx
258
258
  (pos , ⍳⍴⍴sel ~ pos)⍉sel ⍝ simple selection.
259
259
  }/⌽(⊂⍵),↓⍉⊃[indx axes]
@@ -484,11 +484,11 @@ box←{ ⍝ Frame a text array, with optional internal row and column borders.
484
484
  ⍺←⍬ ⍬ 0 ⋄ ar←{⍵,(≢⍵)↓⍬ ⍬ 0}{2>≡⍵?,⊂,⍵;⍵}⍺
485
485
  ch←{⍵?"++++++++-|+";"┌┐└┘┬┤├┴─│┼"}1=ar₂
486
486
  rh←(×/¯1↓⍴⍵),¯1↑1,⍴⍵ ⋄ z←rh⍴⍵
487
- 0∊⍴∊2↑ar?q←ch₈⍪(ch₉,z,ch₉)⍪ch₈ ⋄ q.[0 ¯1;0 ¯1]←2 2⍴ch ⋄ q;
487
+ 0∊⍴∊2↑ar?q←ch₈⍪(ch₉,z,ch₉)⍪ch₈ ⋄ [0 ¯1;0 ¯1]⌷q ←2 2⍴ch ⋄ q;
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
  }{
@@ -497,7 +497,7 @@ box←{ ⍝ Frame a text array, with optional internal row and column borders.
497
497
  vr←(rh₀,w)⍴ch₉
498
498
  ∨/0∊¨⍴¨[rw cl]?(⍵⍪hz),vr⍪q;
499
499
  q₀←ch₄ ⋄ q.[∞ ¯1]←ch₅ ⋄ q.[∞ 0]←ch₆ ⋄ q₋₁←ch₇
500
- q.[0 ¯1;0 ¯1]←2 2⍴ch ⋄ (⍵⍪hz),vr⍪q
500
+ [0 ¯1;0 ¯1]⌷q ←2 2⍴ch ⋄ (⍵⍪hz),vr⍪q
501
501
  }z
502
502
  }
503
503
 
@@ -1091,8 +1091,8 @@ eis←{{⊂1#⍵}⍣ 1=≡,⍵ ⍵}⊘{(eis ⍺),eis ⍵} ⍝ Enclose if simple
1091
1091
  (⊂[b c])∊1↓bkts?∇ rgt [[∆l L] Aa (ebk b) R ∆r]; ⍝ empty brackets [].
1092
1092
  (⊂[a c])∊bkts?∇ rgt [∆l L (a bkt Bb) R ∆r]; ⍝ bracketed single value Bb.
1093
1093
  (⊂a)∊rbs?∇ lft lft ⍵; ⍝ right bracket: skip left.
1094
- ≥/([[[A B] [B C]]]⌷xmat)?∇ lft ⍵; ⍝ A:B ≥ B:C → skip left.
1095
- BbCc←zmat.[≤B;≤C],⊂[b c] ⍝ B bound with C.
1094
+ ≥/xmat.[[A B] [B C]]?∇ lft ⍵; ⍝ A:B ≥ B:C → skip left.
1095
+ BbCc←zmat.[≤B ≤C],⊂[b c] ⍝ B bound with C.
1096
1096
  ∇ show [[∆l L] Aa BbCc R ∆r] ⍝ binds with token to the right?
1097
1097
  } ⍝ :: ∇ stream → stream
1098
1098
 
@@ -1133,7 +1133,7 @@ eis←{{⊂1#⍵}⍣ 1=≡,⍵ ⍵}⊘{(eis ⍺),eis ⍵} ⍝ Enclose if simple
1133
1133
  class←{ ⍝ classification of expr tokens.
1134
1134
  pairs←,/⍺,¨¨≥⍳⍴⍺ ⍝ token-category pairs.
1135
1135
  [toks cats]←↓⍉⊃pairs ⍝ category of each token.
1136
- (toks⍳⍵)⊃¨⊂cats,0 ⍝ token categories.
1136
+ [toks⍳⍵]⌷cats,0 ⍝ token categories.
1137
1137
  }
1138
1138
 
1139
1139
  pfmt←atop↢tfmt⌿ ⍝ format of (token cat) pair.
@@ -1301,7 +1301,7 @@ ratsum←{
1301
1301
  ntab←vals+⊗vals
1302
1302
  base←2#⍴⍵
1303
1303
  vtab←-min-base⊤base⊥min+base⊤ntab
1304
- ptab←↓(min+vtab)⊃¨⊂⍵
1304
+ ptab←↓[min+vtab]⌷⍵
1305
1305
  {(ptab,⍵)⍪⍵,⊂"0."}⍵,¨'.'
1306
1306
  }
1307
1307
  rsum←(atab ⍶~"{}"){
@@ -232,7 +232,7 @@ stpaths ← { ⍝ Spanning tree paths.
232
232
  paths{ ⍝ path to current vertices.
233
233
  next←(⍵=⊂tree)#¨⊂⍳⍴tree ⍝ vertices at next tree level.
234
234
  (⊂⍬)∧.≡next?⍺; ⍝ all null: finished.
235
- exts←⊂¨⍵⊃¨⊂⍺ ,¨¨ next ⍝ paths to next tree level.
235
+ exts←⊂¨[⍵]⌷⍺ ,¨¨ next ⍝ paths to next tree level.
236
236
  indx←,/next
237
237
  paths←,/exts @indx ⍺
238
238
  paths ∇ indx ⍝ advance to next tree level.
@@ -778,7 +778,7 @@
778
778
  "id": "9d44541a",
779
779
  "metadata": {},
780
780
  "source": [
781
- "When the leading axis has a key on every position, each name takes the item, or the major cell, with its key:\n"
781
+ "A list of names destructures by position even when the value has keys. A pattern takes items by key instead. Each cell of a pattern gives a key, then the name that takes the key's item, as in `[a:x]`. A cell with only a key, as in `[a:]`, gives the item to the name spelled like the key. A key is never a value: the `a` in `[a:x]` stands for the key `\"a\"`, whatever `a` holds. A string key, as in `[\"first name\":n]`, serves a key that isn't a name. The cells can come in any order:\n"
782
782
  ]
783
783
  },
784
784
  {
@@ -798,8 +798,8 @@
798
798
  }
799
799
  ],
800
800
  "source": [
801
- "[b a]←[\"a\":1 \"b\":2 \"c\":3]\n",
802
- "a b"
801
+ "[b: a:x]←[\"a\":1 \"b\":2 \"c\":3]\n",
802
+ "x b"
803
803
  ]
804
804
  },
805
805
  {
@@ -807,7 +807,7 @@
807
807
  "id": "e5a4e6fc",
808
808
  "metadata": {},
809
809
  "source": [
810
- "A program takes names from a [module](modules.qmd) this way, as in `[disp]←•load \"lib/array.bpl\"`."
810
+ "A program takes names from a [module](modules.qmd) this way, as in `[disp:]←•load \"lib/array.bpl\"`."
811
811
  ]
812
812
  },
813
813
  {
@@ -52,5 +52,6 @@ Use actual glyphs in files, pipes and `-e`; backtick names are a [REPL input met
52
52
  | `bpl --help` | Usage |
53
53
  | `bpl --version` | Version |
54
54
  | `bpl --worker` | JSON-lines requests with deadlines and interruption |
55
+ | `bpl --costs FILE` | Times the cases in a file in `tests/speed.txt`'s format, as the speed test does, and prints each cost with this machine's budget. A case over its budget leaves the exit status at 0 |
55
56
 
56
57
  See [process interfaces](processes.qmd) for machine-readable output. The exit status is 0 on success, 1 after an evaluation or I/O error, and 2 for invalid command arguments. An error doesn't discard the output written before it.