basedpl 0.1.48__tar.gz → 0.1.49__tar.gz

{basedpl-0.1.48 → basedpl-0.1.49}/Cargo.lock

@@ -93,7 +93,7 @@ checksum = "ac07cdecf99051d9a5238b80f35af32cdeba5b336e55d957b318b50137e18da5"
 
 [[package]]
 name = "basedpl"
-version = "0.1.48"
+version = "0.1.49"
 dependencies = [
  "base64 0.23.1",
  "bytemuck",
@@ -140,7 +140,7 @@ dependencies = [
 
 [[package]]
 name = "basedpl-cli"
-version = "0.1.48"
+version = "0.1.49"
 dependencies = [
  "async-trait",
  "basedpl",
@@ -154,7 +154,7 @@ dependencies = [
 
 [[package]]
 name = "basedpl-py"
-version = "0.1.48"
+version = "0.1.49"
 dependencies = [
  "basedpl",
  "bytemuck",
@@ -169,7 +169,7 @@ dependencies = [
 
 [[package]]
 name = "basedpl-wasm"
-version = "0.1.48"
+version = "0.1.49"
 dependencies = [
  "basedpl",
  "js-sys",
@@ -1417,9 +1417,9 @@ dependencies = [
 
 [[package]]
 name = "rustymath"
-version = "0.1.18"
+version = "0.1.19"
 source = "registry+https://github.com/rust-lang/crates.io-index"
-checksum = "a56363f0b8b7fe94b0035c30839b56349b48c8d1576b0265072ff96914c6241b"
+checksum = "708c702fa9ff66ef712a124e51aa467e699a322e4cc8aebdd83c4ce05e7e592b"
 dependencies = [
  "half",
  "hashbrown 0.17.1",
@@ -2083,7 +2083,7 @@ checksum = "3ad82d2a33cdc9674dc7465672f271e096168fcdbe0f799d9e6db8c5892679dc"
 
 [[package]]
 name = "xtask"
-version = "0.1.48"
+version = "0.1.49"
 dependencies = [
  "anyhow",
  "serde_json",

{basedpl-0.1.48 → basedpl-0.1.49}/Cargo.toml

@@ -2,7 +2,7 @@
 members = ["py"]
 
 [workspace.package]
-version = "0.1.48"
+version = "0.1.49"
 edition = "2021"
 rust-version = "1.98"
 license = "Apache-2.0"

{basedpl-0.1.48 → basedpl-0.1.49}/DEV.md

@@ -22,7 +22,7 @@ An already-running Python process retains its loaded extension. In a kernel, use
 
 Measure with `BASEDPL_COSTS=1 cargo test --test speed -- --nocapture` 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`, 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.
 
-The manual `Speed` workflow measures the native and wasm builds on CI. 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. Pass `run=` only when the run sets every budget. It replaces the header line that names the run all the CI figures come from. `path=` selects rustymath's `tests/speed.txt`.
+The manual `Speed` workflow measures the native and wasm builds on CI. 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. Pass `run=` only when the run sets every budget. It replaces the header line that names the run all the CI figures come from. `path=` selects rustymath's `tests/speed.txt`.
 
 To compare a change with the build before it, copy the installed `bpl` before the change, then time both copies in turn with `speed_costs(bpl=path)` or `time_cases(..., bpl=path)`. 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.
 
@@ -103,7 +103,7 @@ The lexer/parser records byte spans and structural syntax without evaluating exp
 
 The binder resolves runtime categories right to left. It owns unfinished strands, trains and bound arguments; shared function nodes are immutable. Grammatical reduction produces application requests instead of calling functions. Primitive/operator rows own names, operand kinds, ranks, pervasion, axis behaviour and reduction identities. Change those rows instead of duplicating metadata in consumers. A non-extending primitive above its natural ranks runs through Rank; pervasive Each/Outer/Rank paths reuse whole-array kernels.
 
-Dot names rewrite to Pick, and dot brackets/subscripts to selection. Dot parentheses evaluate a namespace: `T.(expr)` and `T⍎text` use the keyed entries of `T` as locals, resolve other names in the caller and keep assignments local. They share the scoped execution route and lexical lifetime checks. Between functions, dot remains inner product.
+Dot names rewrite to Pick, and dot brackets/subscripts to selection. Dot parentheses evaluate a namespace: `T.(expr)` and `T⍎text` bind each key on the first axis of `T` to its item or major cell as a local, resolve other names in the caller and keep assignments local. They share the scoped execution route and lexical lifetime checks. Between functions, dot remains inner product.
 
 Lexical frames use non-owning parent indices. Closures see live bindings, not snapshots. Plain assignment is local; modified/selective assignment updates the nearest existing binding. Retain the resolved owner and original array across modifier calls rather than looking the name up again. Returns and outer writes reject functions, including those nested in arrays/prototypes, whose frames would not survive. Tail calls retain dependencies from arguments and the called function. No collector is used; recheck this lifetime reasoning before permitting escaping lexical captures.
 
@@ -219,7 +219,7 @@ The playground and gallery load released assets from jsDelivr, or local `nbs/pla
 
 `system.rs` owns case-insensitive system names, valence, item mapping and result prototypes. Native records use ordinary function nodes and calls. Empty native item mapping returns its declared prototype without calling the function. `data::Options` is the shared keyed-option decoder; formats don't invent separate option parsers.
 
-`minimize.rs` implements `⇄` on `rustymath::optimize`. A vector operand holds the options before the function, and a left argument binds to the function through `↣`. `Goal` evaluates the function at points in the start's layout. Where `Function::differentiable` holds, `Goal` also calls `f∂` for the gradient. `∂` itself uses the same test.
+`optimize.rs` implements `⇄` on `rustymath::optimize`. The left argument holds the options. `Goal` evaluates the function at points in the start's layout for `minimize`. Where `Function::differentiable` holds, `Goal` also calls `f∂` for the gradient. `∂` itself uses the same test. With `"solve":$t`, `Residual` is the `Mapping` that `solve` takes, or that `solve_affine` takes with `"linear":$t` as well. An attached derivative gives its vector–Jacobian products, and the function in option `precondition` gives its preconditioner.
 
 CSV columns, JSON arrays and Python lists share `data::imported`: a non-fill finite float or any nonfinite float triggers float promotion when every number converts losslessly. Finite fills alone do not trigger it. Otherwise items keep their kinds. JSON objects/dictionaries stay mixed. Binary data uses exact bytes. Writes validate before opening and create exclusively unless overwrite is explicit. CSV/JSON/XML exports use `•csv⁻¹`, `•json⁻¹` and `•xml⁻¹`.
 

{basedpl-0.1.48 → basedpl-0.1.49}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: basedpl
-Version: 0.1.48
+Version: 0.1.49
 Classifier: Programming Language :: Rust
 Classifier: Programming Language :: Python :: Implementation :: CPython
 Requires-Dist: fastcore
@@ -188,11 +188,11 @@ Under (`@`) transforms the argument, applies a function, then reverses the trans
 
     1.2 2.7
 
-Explore [iteration and inverses](https://answerdotai.github.io/basedpl/glyphs/power.html), [Under](https://answerdotai.github.io/basedpl/glyphs/under.html), [windows](https://answerdotai.github.io/basedpl/glyphs/windows.html) and [function selection](https://answerdotai.github.io/basedpl/glyphs/agenda.html).
+Explore [iteration and inverses](https://answerdotai.github.io/basedpl/glyphs/star-diaeresis.html), [Under](https://answerdotai.github.io/basedpl/glyphs/at.html), [windows](https://answerdotai.github.io/basedpl/glyphs/up-down-arrow.html) and [function selection](https://answerdotai.github.io/basedpl/glyphs/diamond-underbar.html).
 
 ### Mathematical tools
 
-[Primes](https://answerdotai.github.io/basedpl/glyphs/prime.html) and [factorisation](https://answerdotai.github.io/basedpl/glyphs/factor.html) are built in:
+[Primes](https://answerdotai.github.io/basedpl/glyphs/stile-tilde.html) and [factorisation](https://answerdotai.github.io/basedpl/glyphs/circle-divide.html) are built in:
 
 ``` bpl
 ⨸360ₓ
@@ -200,7 +200,7 @@ Explore [iteration and inverses](https://answerdotai.github.io/basedpl/glyphs/po
 
     [2 2 2 3 3 5]ₓ
 
-[Polynomials](https://answerdotai.github.io/basedpl/glyphs/polynomial.html) support coefficients, roots and evaluation. Polynomial functions can be [differentiated](https://answerdotai.github.io/basedpl/glyphs/derivative.html): for f(x) = 1 + 2x + 3x², f′(2) = 14.
+[Polynomials](https://answerdotai.github.io/basedpl/glyphs/quad-jot.html) support coefficients, roots and evaluation. Polynomial functions can be [differentiated](https://answerdotai.github.io/basedpl/glyphs/partial.html): for f(x) = 1 + 2x + 3x², f′(2) = 14.
 
 ``` bpl
 f←[1 2 3]ₓ⌻ ⋄ f∂2ₓ

{basedpl-0.1.48 → basedpl-0.1.49}/README.md

@@ -160,11 +160,11 @@ Under (`@`) transforms the argument, applies a function, then reverses the trans
 
     1.2 2.7
 
-Explore [iteration and inverses](https://answerdotai.github.io/basedpl/glyphs/power.html), [Under](https://answerdotai.github.io/basedpl/glyphs/under.html), [windows](https://answerdotai.github.io/basedpl/glyphs/windows.html) and [function selection](https://answerdotai.github.io/basedpl/glyphs/agenda.html).
+Explore [iteration and inverses](https://answerdotai.github.io/basedpl/glyphs/star-diaeresis.html), [Under](https://answerdotai.github.io/basedpl/glyphs/at.html), [windows](https://answerdotai.github.io/basedpl/glyphs/up-down-arrow.html) and [function selection](https://answerdotai.github.io/basedpl/glyphs/diamond-underbar.html).
 
 ### Mathematical tools
 
-[Primes](https://answerdotai.github.io/basedpl/glyphs/prime.html) and [factorisation](https://answerdotai.github.io/basedpl/glyphs/factor.html) are built in:
+[Primes](https://answerdotai.github.io/basedpl/glyphs/stile-tilde.html) and [factorisation](https://answerdotai.github.io/basedpl/glyphs/circle-divide.html) are built in:
 
 ``` bpl
 ⨸360ₓ
@@ -172,7 +172,7 @@ Explore [iteration and inverses](https://answerdotai.github.io/basedpl/glyphs/po
 
     [2 2 2 3 3 5]ₓ
 
-[Polynomials](https://answerdotai.github.io/basedpl/glyphs/polynomial.html) support coefficients, roots and evaluation. Polynomial functions can be [differentiated](https://answerdotai.github.io/basedpl/glyphs/derivative.html): for f(x) = 1 + 2x + 3x², f′(2) = 14.
+[Polynomials](https://answerdotai.github.io/basedpl/glyphs/quad-jot.html) support coefficients, roots and evaluation. Polynomial functions can be [differentiated](https://answerdotai.github.io/basedpl/glyphs/partial.html): for f(x) = 1 + 2x + 3x², f′(2) = 14.
 
 ``` bpl
 f←[1 2 3]ₓ⌻ ⋄ f∂2ₓ