@danielsimonjr/mathts-expression 0.10.3 → 0.11.1

package/dist/scalar-structure.d.ts

@@ -0,0 +1,167 @@
+/**
+ * Structural utilities over {@link ScalarNode}: traversal, metrics, and
+ * canonical form with a stable structural key.
+ *
+ * @packageDocumentation
+ */
+import { type LoweredScalarFn, type ScalarNode, type ScalarOperator } from './scalar-builder.js';
+/**
+ * Per-node weights for {@link scalarComplexity}.
+ *
+ * Omitted fields default to 1. A `symbol` record supplies per-name weights; a
+ * name that is absent from the record still weighs 1. Weights are summed
+ * across the stored tree and then rounded with `Math.round`.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, scalarComplexity } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const tree = b.op('+', [b.symbol('y'), b.op('*', [b.symbol('x'), b.symbol('x')])]);
+ * scalarComplexity(tree, { symbol: { x: 2 } }); // 7
+ * scalarComplexity(b.symbol('constructor')); // 1 (no own key → weight 1)
+ * ```
+ */
+export interface ScalarComplexityWeights {
+    /** Weight of one operator node. Default 1 for every {@link ScalarOperator}. */
+    readonly op?: Partial<Record<ScalarOperator, number>>;
+    /** Weight of one call node, keyed by the lowered name (`ln` is `log`). Default 1. */
+    readonly call?: Partial<Record<LoweredScalarFn, number>>;
+    /** Weight of one number node. Default 1. */
+    readonly number?: number;
+    /** Weight of one symbol node: one number for every name, or a per-name record. Default 1. */
+    readonly symbol?: number | Readonly<Record<string, number>>;
+}
+/**
+ * Preorder walk. The root is visited first, at `depth` 0, then each child
+ * left to right. `depth` here is not {@link scalarDepth}: a leaf visited by
+ * this function has depth 0 when it is the root, while `scalarDepth` of any
+ * leaf is 1.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, forEachScalar } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const tree = b.op('+', [b.symbol('y'), b.op('*', [b.symbol('x'), b.symbol('x')])]);
+ * const depths: number[] = [];
+ * forEachScalar(tree, (_n, depth) => depths.push(depth));
+ * depths.join(','); // '0,1,1,2,2'
+ * ```
+ */
+export declare function forEachScalar(node: ScalarNode, visit: (n: ScalarNode, depth: number) => void): void;
+/**
+ * Post-order immutable map. Children are mapped first. `fn` then receives
+ * the node with those children and its return value replaces the node.
+ * The replacement is not walked again.
+ *
+ * When a child result is the same reference and `fn` returns the rebuilt
+ * node, the original node reference is kept. The input tree is never mutated,
+ * including a deep-frozen input.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, mapScalar, scalarSize } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const tree = b.op('+', [b.symbol('y'), b.op('*', [b.symbol('x'), b.symbol('x')])]);
+ * const mapped = mapScalar(tree, (n) =>
+ *   n.kind === 'symbol' && n.name === 'x' ? { kind: 'number', value: 9 } : n
+ * );
+ * scalarSize(mapped); // 5 — replacement is not walked again
+ * ```
+ */
+export declare function mapScalar(node: ScalarNode, fn: (n: ScalarNode) => ScalarNode): ScalarNode;
+/**
+ * Number of nodes in the stored tree. An empty `+` is one node.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, scalarSize } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const tree = b.op('+', [b.symbol('y'), b.op('*', [b.symbol('x'), b.symbol('x')])]);
+ * scalarSize(tree); // 5
+ * ```
+ */
+export declare function scalarSize(node: ScalarNode): number;
+/**
+ * Stored-tree depth. A number or symbol is 1. A call is `1 + scalarDepth(arg)`.
+ * An operator is `1 + max(child depths)`, or 1 when it has no children.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, scalarDepth } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const tree = b.op('+', [b.symbol('y'), b.op('*', [b.symbol('x'), b.symbol('x')])]);
+ * scalarDepth(tree); // 3
+ * ```
+ */
+export declare function scalarDepth(node: ScalarNode): number;
+/**
+ * Weighted node count of the stored tree. See {@link ScalarComplexityWeights}.
+ * The return value is `Math.round` of the sum, so default weights make this
+ * equal `scalarSize`. Walks `-` and `/` as stored; it does not rewrite them first.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, scalarComplexity } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const tree = b.op('+', [b.symbol('y'), b.op('*', [b.symbol('x'), b.symbol('x')])]);
+ * scalarComplexity(tree); // 5
+ * scalarComplexity(tree, { symbol: { x: 2 } }); // 7
+ * ```
+ */
+export declare function scalarComplexity(node: ScalarNode, weights?: ScalarComplexityWeights): number;
+/**
+ * Sorted unique `symbol` names in the stored tree. Function names and number
+ * literals are not included. Sort is UTF-16 code-unit order (`<` on strings).
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, scalarSymbols } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const tree = b.op('+', [b.symbol('y'), b.op('*', [b.symbol('x'), b.symbol('x')])]);
+ * scalarSymbols(tree).join(','); // 'x,y'
+ * ```
+ */
+export declare function scalarSymbols(node: ScalarNode): readonly string[];
+/**
+ * Canonical tree. Idempotent: `scalarCanonical(scalarCanonical(n))` is deeply
+ * equal to `scalarCanonical(n)`. Does not mutate `n`. The result uses only
+ * `number`, `symbol`, `call`, `+`, `*`, and `^`. See the algorithm below.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, scalarCanonical, scalarEquals } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const aa = b.op('*', [b.symbol('a'), b.symbol('a')]);
+ * const aSquared = b.op('^', [b.symbol('a'), b.number(2)]);
+ * scalarEquals(aa, aSquared); // true — canonical uses only +, *, ^
+ * scalarCanonical(b.op('^', [b.number(2), b.number(3)])); // does not fold 2^3 to 8
+ * ```
+ */
+export declare function scalarCanonical(node: ScalarNode): ScalarNode;
+/**
+ * `JSON.stringify` of {@link scalarCanonical}, with the key order fixed in
+ * "Key encoding". Equal keys are the definition of structural equality.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, scalarCanonicalKey } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * scalarCanonicalKey(b.op('^', [b.number(2), b.number(3)]));
+ * // {"k":"^","b":{"k":"n","v":"2"},"e":{"k":"n","v":"3"}}
+ * ```
+ */
+export declare function scalarCanonicalKey(node: ScalarNode): string;
+/**
+ * `scalarCanonicalKey(a) === scalarCanonicalKey(b)`.
+ *
+ * @example
+ * ```ts
+ * import { createScalarBuilder, scalarEquals } from '@danielsimonjr/mathts-expression';
+ * const b = createScalarBuilder();
+ * const aa = b.op('*', [b.symbol('a'), b.symbol('a')]);
+ * const aSquared = b.op('^', [b.symbol('a'), b.number(2)]);
+ * scalarEquals(aa, aSquared); // true
+ * ```
+ */
+export declare function scalarEquals(a: ScalarNode, b: ScalarNode): boolean;
+//# sourceMappingURL=scalar-structure.d.ts.map

package/dist/scalar-structure.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scalar-structure.d.ts","sourceRoot":"","sources":["../src/scalar-structure.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAGL,KAAK,eAAe,EACpB,KAAK,UAAU,EACf,KAAK,cAAc,EACpB,MAAM,qBAAqB,CAAC;AAQ7B;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,uBAAuB;IACtC,+EAA+E;IAC/E,QAAQ,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC;IACtD,qFAAqF;IACrF,QAAQ,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,eAAe,EAAE,MAAM,CAAC,CAAC,CAAC;IACzD,4CAA4C;IAC5C,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,6FAA6F;IAC7F,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CAC7D;AAiCD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,aAAa,CAC3B,IAAI,EAAE,UAAU,EAChB,KAAK,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GAC5C,IAAI,CAYN;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,KAAK,UAAU,GAAG,UAAU,CAiBzF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAMnD;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAkBpD;AA8BD;;;;;;;;;;;;;GAaG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,GAAE,uBAA4B,GAAG,MAAM,CAMhG;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,UAAU,GAAG,SAAS,MAAM,EAAE,CAQjE;AAiRD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,UAAU,GAAG,UAAU,CAE5D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,UAAU,GAAG,MAAM,CAE3D;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,GAAG,OAAO,CAElE"}

package/dist/transform/and.transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"and.transform.d.ts","sourceRoot":"","sources":["../../src/transform/and.transform.ts"],"names":[],"mappings":"AAGA,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;CACtC;AAKD,eAAO,MAAM,kBAAkB,gFAkB9B,CAAC"}
+{"version":3,"file":"and.transform.d.ts","sourceRoot":"","sources":["../../src/transform/and.transform.ts"],"names":[],"mappings":"AAGA,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;CACtC;AAKD,eAAO,MAAM,kBAAkB,gFAe9B,CAAC"}

package/dist/transform/bitAnd.transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bitAnd.transform.d.ts","sourceRoot":"","sources":["../../src/transform/bitAnd.transform.ts"],"names":[],"mappings":"AAGA,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;CACzC;AAKD,eAAO,MAAM,qBAAqB,gFAuBjC,CAAC"}
+{"version":3,"file":"bitAnd.transform.d.ts","sourceRoot":"","sources":["../../src/transform/bitAnd.transform.ts"],"names":[],"mappings":"AAGA,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;CACzC;AAKD,eAAO,MAAM,qBAAqB,gFAqBjC,CAAC"}

package/dist/transform/bitOr.transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bitOr.transform.d.ts","sourceRoot":"","sources":["../../src/transform/bitOr.transform.ts"],"names":[],"mappings":"AAGA,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;CACxC;AAKD,eAAO,MAAM,oBAAoB,gFA0BhC,CAAC"}
+{"version":3,"file":"bitOr.transform.d.ts","sourceRoot":"","sources":["../../src/transform/bitOr.transform.ts"],"names":[],"mappings":"AAGA,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;CACxC;AAKD,eAAO,MAAM,oBAAoB,gFAwBhC,CAAC"}

package/dist/transform/cumsum.transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cumsum.transform.d.ts","sourceRoot":"","sources":["../../src/transform/cumsum.transform.ts"],"names":[],"mappings":"AAIA,UAAU,aAAa,CAAC,CAAC,GAAG,OAAO;IACjC,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;CACzB;AAED,UAAU,YAAY;IACpB,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;IACxC,KAAK,EAAE,aAAa,CAAC;CACtB;AAYD,eAAO,MAAM,qBAAqB,sEAyBjC,CAAC"}
+{"version":3,"file":"cumsum.transform.d.ts","sourceRoot":"","sources":["../../src/transform/cumsum.transform.ts"],"names":[],"mappings":"AAIA,UAAU,aAAa,CAAC,CAAC,GAAG,OAAO;IACjC,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;CACzB;AAED,UAAU,YAAY;IACpB,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;IACxC,KAAK,EAAE,aAAa,CAAC;CACtB;AAYD,eAAO,MAAM,qBAAqB,sEAiBjC,CAAC"}

package/dist/transform/filter.transform.d.ts

@@ -1,16 +1,16 @@
 interface TypedFunction<T = unknown> {
     (...args: unknown[]): T;
 }
+interface TransformFunction {
+    (args: Node[], math: unknown, scope: unknown): unknown;
+    rawArgs?: boolean;
+}
 interface Node {
     compile(): CompiledExpression;
 }
 interface CompiledExpression {
     evaluate(scope: unknown): unknown;
 }
-interface TransformFunction {
-    (args: Node[], math: unknown, scope: unknown): unknown;
-    rawArgs?: boolean;
-}
 interface Dependencies {
     filter: (...args: unknown[]) => unknown;
     typed: TypedFunction;

package/dist/transform/filter.transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"filter.transform.d.ts","sourceRoot":"","sources":["../../src/transform/filter.transform.ts"],"names":[],"mappings":"AAKA,UAAU,aAAa,CAAC,CAAC,GAAG,OAAO;IACjC,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;CACzB;AAED,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;IACxC,KAAK,EAAE,aAAa,CAAC;CACtB;AAKD,eAAO,MAAM,qBAAqB,gFAuDjC,CAAC"}
+{"version":3,"file":"filter.transform.d.ts","sourceRoot":"","sources":["../../src/transform/filter.transform.ts"],"names":[],"mappings":"AAIA,UAAU,aAAa,CAAC,CAAC,GAAG,OAAO;IACjC,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;CACzB;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,YAAY;IACpB,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;IACxC,KAAK,EAAE,aAAa,CAAC;CACtB;AAKD,eAAO,MAAM,qBAAqB,gFA2BjC,CAAC"}

package/dist/transform/forEach.transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"forEach.transform.d.ts","sourceRoot":"","sources":["../../src/transform/forEach.transform.ts"],"names":[],"mappings":"AAKA,UAAU,aAAa,CAAC,CAAC,GAAG,OAAO;IACjC,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;CACzB;AAED,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;IACzC,KAAK,EAAE,aAAa,CAAC;CACtB;AAKD,eAAO,MAAM,sBAAsB,gFAoDlC,CAAC"}
+{"version":3,"file":"forEach.transform.d.ts","sourceRoot":"","sources":["../../src/transform/forEach.transform.ts"],"names":[],"mappings":"AAIA,UAAU,aAAa,CAAC,CAAC,GAAG,OAAO;IACjC,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;CACzB;AAED,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,OAAO,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;IACzC,KAAK,EAAE,aAAa,CAAC;CACtB;AAKD,eAAO,MAAM,sBAAsB,gFAyBlC,CAAC"}

package/dist/transform/mapSlices.transform.d.ts

@@ -9,7 +9,7 @@ interface Dependencies {
  * Attach a transform function to math.mapSlices
  * Adds a property transform containing the transform function.
  *
- * This transform changed the last `dim` parameter of function mapSlices
+ * This transform changes the second `dim` argument of function mapSlices
  * from one-based to zero based
  */
 export declare const createMapSlicesTransform: import("../utils/factory.js").FactoryFunction<Dependencies, unknown>;

package/dist/transform/mapSlices.transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mapSlices.transform.d.ts","sourceRoot":"","sources":["../../src/transform/mapSlices.transform.ts"],"names":[],"mappings":"AAIA,UAAU,aAAa,CAAC,CAAC,GAAG,OAAO;IACjC,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;CACzB;AAED,UAAU,YAAY;IACpB,SAAS,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;IAC3C,KAAK,EAAE,aAAa,CAAC;CACtB;AAKD;;;;;;GAMG;AACH,eAAO,MAAM,wBAAwB,sEAyBpC,CAAC"}
+{"version":3,"file":"mapSlices.transform.d.ts","sourceRoot":"","sources":["../../src/transform/mapSlices.transform.ts"],"names":[],"mappings":"AAIA,UAAU,aAAa,CAAC,CAAC,GAAG,OAAO;IACjC,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;CACzB;AAED,UAAU,YAAY;IACpB,SAAS,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;IAC3C,KAAK,EAAE,aAAa,CAAC;CACtB;AAKD;;;;;;GAMG;AACH,eAAO,MAAM,wBAAwB,sEAqBpC,CAAC"}

package/dist/transform/or.transform.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"or.transform.d.ts","sourceRoot":"","sources":["../../src/transform/or.transform.ts"],"names":[],"mappings":"AAGA,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;CACrC;AAKD,eAAO,MAAM,iBAAiB,gFAkB7B,CAAC"}
+{"version":3,"file":"or.transform.d.ts","sourceRoot":"","sources":["../../src/transform/or.transform.ts"],"names":[],"mappings":"AAGA,UAAU,IAAI;IACZ,OAAO,IAAI,kBAAkB,CAAC;CAC/B;AAED,UAAU,kBAAkB;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;CACnC;AAED,UAAU,iBAAiB;IACzB,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC;IACvD,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,UAAU,YAAY;IACpB,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,CAAC;CACrC;AAKD,eAAO,MAAM,iBAAiB,gFAe7B,CAAC"}

package/dist/transform/utils/dimToZeroBase.d.ts

@@ -1,5 +1,8 @@
 /**
- * Change last argument dim from one-based to zero-based.
+ * Convert a one-based dimension to zero-based.
+ * Numbers are shifted with `- 1`. BigNumbers use `.sub(1)` (MathTS core)
+ * and fall back to decimal.js `.minus(1)` when that is the only subtract API.
+ * Any other value is returned unchanged.
  */
 export declare function dimToZeroBase(dim: unknown): unknown;
 /**

package/dist/transform/utils/dimToZeroBase.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dimToZeroBase.d.ts","sourceRoot":"","sources":["../../../src/transform/utils/dimToZeroBase.ts"],"names":[],"mappings":"AACA;;GAEG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAQnD;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEvD"}
+{"version":3,"file":"dimToZeroBase.d.ts","sourceRoot":"","sources":["../../../src/transform/utils/dimToZeroBase.ts"],"names":[],"mappings":"AAOA;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAgBnD;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAEvD"}

package/dist/transform/utils/prepareTransformArgs.d.ts

@@ -0,0 +1,23 @@
+interface TransformArgNode {
+    compile(): {
+        evaluate(scope: unknown): unknown;
+    };
+}
+export interface PreparedTransformArgs {
+    x: unknown;
+    callback: unknown;
+    callbackArity: number;
+}
+/**
+ * Shared tail of filter/forEach transforms: evaluate the collection argument and
+ * compile the callback (symbol, function assignment, or inline expression).
+ */
+export declare function prepareTransformArrayAndCallback(args: TransformArgNode[], math: Record<string, unknown>, scope: Map<string, unknown>): PreparedTransformArgs;
+/**
+ * Shared filter/forEach transform body: arity 0 calls `op()`; arity 1 passes
+ * the raw node (not a compiled value) to `op`; otherwise compile the collection
+ * and callback via {@link prepareTransformArrayAndCallback}.
+ */
+export declare function applyArrayCallbackTransform(args: TransformArgNode[], math: Record<string, unknown>, scope: Map<string, unknown>, op: (...args: unknown[]) => unknown, transformCallback: (callback: unknown, arity: number) => unknown): unknown;
+export {};
+//# sourceMappingURL=prepareTransformArgs.d.ts.map

package/dist/transform/utils/prepareTransformArgs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prepareTransformArgs.d.ts","sourceRoot":"","sources":["../../../src/transform/utils/prepareTransformArgs.ts"],"names":[],"mappings":"AAGA,UAAU,gBAAgB;IACxB,OAAO,IAAI;QAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAA;KAAE,CAAC;CAClD;AAMD,MAAM,WAAW,qBAAqB;IACpC,CAAC,EAAE,OAAO,CAAC;IACX,QAAQ,EAAE,OAAO,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,wBAAgB,gCAAgC,CAC9C,IAAI,EAAE,gBAAgB,EAAE,EACxB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,GAC1B,qBAAqB,CAsBvB;AAED;;;;GAIG;AACH,wBAAgB,2BAA2B,CACzC,IAAI,EAAE,gBAAgB,EAAE,EACxB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,EAC3B,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,OAAO,EAAE,KAAK,OAAO,EACnC,iBAAiB,EAAE,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,GAC/D,OAAO,CAcT"}

package/dist/transform/utils/shortCircuitBinary.d.ts

@@ -0,0 +1,21 @@
+interface EvalNode {
+    compile(): {
+        evaluate(scope: unknown): unknown;
+    };
+}
+/** Short-circuit decision for the left operand of a binary transform. */
+export type Absorb = {
+    readonly take: false;
+} | {
+    readonly take: true;
+    readonly value: unknown;
+};
+/**
+ * Evaluate a lazy binary operator transform: compile/evaluate the left arg
+ * with `scope`, optionally return early via `absorb` when the left value is
+ * not a collection (so the right arg is never compiled/evaluated), otherwise
+ * evaluate the right arg with the same `scope` and call `op`.
+ */
+export declare function evalShortCircuitBinary(args: EvalNode[], scope: unknown, op: (left: unknown, right: unknown) => unknown, absorb: (left: unknown) => Absorb): unknown;
+export {};
+//# sourceMappingURL=shortCircuitBinary.d.ts.map

package/dist/transform/utils/shortCircuitBinary.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortCircuitBinary.d.ts","sourceRoot":"","sources":["../../../src/transform/utils/shortCircuitBinary.ts"],"names":[],"mappings":"AAEA,UAAU,QAAQ;IAChB,OAAO,IAAI;QAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAAA;KAAE,CAAC;CAClD;AAED,yEAAyE;AACzE,MAAM,MAAM,MAAM,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAA;CAAE,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAA;CAAE,CAAC;AAEjG;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,QAAQ,EAAE,EAChB,KAAK,EAAE,OAAO,EACd,EAAE,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,KAAK,OAAO,EAC9C,MAAM,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,MAAM,GAChC,OAAO,CAUT"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-expression",
-  "version": "0.10.3",
+  "version": "0.11.1",
   "description": "Expression parser and evaluator for MathTS",
   "author": "Daniel Simon Jr.",
   "license": "MIT",
@@ -42,11 +42,11 @@
     }
   },
   "dependencies": {
-    "@danielsimonjr/mathts-core": "^0.19.0",
-    "typed-function": "^4.0.0"
+    "@danielsimonjr/mathts-core": "^0.21.0"
   },
   "devDependencies": {
     "@types/node": "^26.4.0",
+    "fast-check": "^4.9.0",
     "tsdown": "^0.23.0",
     "typescript": "^7.0.2",
     "vitest": "^5.0.0"