@johnhenry/math-sample 0.0.1 → 0.1.0

package/README.md

@@ -1,6 +1,6 @@
 # @johnhenry/math-sample
 
-Sampling for plots, as a library with no DOM in it. Give it a `(x) => number`
+Sampling for plots (1D curves, 2D implicit/contour/gradient fields, 3D meshes, complex rasters, ODEs, series), as a library with no DOM in it. Give it a `(x) => number`
 (or an `@johnhenry/math` expression) and a viewport; get back `Float64Array`s
 with the poles and jumps already turned into gaps, plus the viewport maths,
 "nice" ticks and SVG path output a plot needs. Pure ESM, zero runtime
@@ -111,14 +111,122 @@ dependency**; the main entry never imports it. In a Worker: post the source
 string and params, compile there, sample, and `postMessage` the arrays with
 `[s.x.buffer, s.y.buffer]` as transferables.
 
+## 2D and 3D samplers, ODEs, series (part 2/3)
+
+All of these take plain functions, return typed arrays, and never draw spikes: a
+non-finite value is a **hole** (a gap row in curves, a skipped vertex in meshes,
+`NaN` in rasters). The grid and field samplers (`sampleSurface`, `sampleParametricSurface`,
+`sampleSpaceCurve`, `sampleVectorField3`, `sampleComplexRaster`, `findZerosAndPoles`, `sampleSlopeField`,
+`samplePhasePortrait` (field pass), `sampleImplicit`, `sampleContours`, `sampleGradient`) accept a
+**budget** and the cancellation options of part 1 (`signal`, `isCancelled`, which throw
+`SampleCancelledError`). `conformalGrid`, the ODE integrators, and the series/Fourier samplers do not take a budget
+(they are bounded by their own `samplesPerLine`, `maxSteps`, `samples` arguments):
+
+```ts
+{ maxCells?: number; maxMillis?: number; now?: () => number }
+```
+
+When the budget runs out the sampler stops at a row (or slab) boundary and
+**returns what it has** with `progress: { rows, of, complete, reason? }`
+(`reason` is `"cells"` or `"time"`), so a UI can say "stopped at row 120 of 161:
+the time limit". The time limit is checked per row, so one row can overrun it.
+
+### 3D (typed-array meshes)
+
+| Function | Returns |
+|---|---|
+| `sampleSurface(f(x, y), xDomain, yDomain, { columns, rows, zRange, ...budget })` | `Mesh` for `z = f(x, y)` |
+| `sampleParametricSurface(f(u, v) => [x, y, z], uDomain, vDomain, opts)` | `Mesh` |
+| `sampleSpaceCurve(f(t) => [x, y, z], tDomain, { samples, maxStep, ...budget })` | `Curve3` |
+| `curve3Runs(curve)` | `[start, end)` row ranges of consecutive data |
+| `sampleVectorField3(f(x, y, z) => [a, b, c], xD, yD, zD, { grid, ...budget })` | `VectorField3` |
+
+`Mesh` is `{ positions: Float32Array, normals: Float32Array, indices: Uint32Array, valid: Uint8Array,
+vertexCount, columns, rows, bounds, progress }` (3 floats per vertex; triangles are counter-clockwise
+seen from the side the normals point to, which is `+z` for `sampleSurface`, and `dP/du x dP/dv` for a
+parametric surface). A hole vertex has `NaN` position, zero normal and `valid = 0`, and **no triangle
+references it**, so GPU upload needs no special casing. `zRange` also turns a pole's huge but finite
+shoulders into holes. A quad with one hole corner keeps its other triangle. `bounds` covers valid vertices
+(`NaN`s when there are none). A valid vertex whose own normal degenerates (the poles of a sphere parameterisation) borrows
+a neighbouring vertex's normal. Mind the sign: `dP/du x dP/dv` on the usual sphere parameterisation
+`(sin v cos u, sin v sin u, cos v)` points **inward**; swap the arguments or negate a component for outward normals.
+`Curve3` is `{ positions: Float64Array (3 per row), t, count, progress }` with `NaN` rows as gaps (never first,
+last or adjacent). `VectorField3` is `{ origins, vectors, magnitudes: Float32Array, maxMagnitude, count,
+skipped, progress }`; points where the field is non-finite are dropped and counted in `skipped`.
+
+### Complex functions
+
+`ComplexFn` is `(re, im) => [re, im]`.
+
+- `sampleComplexRaster(f, reDomain, imDomain, { width, height })`: `{ re, im, abs, arg: Float32Array,
+  width, height, progress }` sampled at cell centres, row 0 at the smallest imaginary part; `arg` in
+  `(-PI, PI]`. Colour it yourself (hue from `arg`, brightness from `abs`).
+- `conformalGrid(f, reDomain, imDomain, { reLines, imLines, samplesPerLine, bound, maxStep })`: the image of a
+  rectangular grid of lines as `{ kind: "re" | "im", value, x, y }[]`; `NaN` gaps where `|f| > bound` (a pole)
+  or a step exceeds `maxStep` (a branch cut).
+- `findZerosAndPoles(f, reDomain, imDomain, { grid, tolerance })`: argument principle on every grid cell
+  (winding number = zeros - poles), then Newton on `f` or `1/f` scaled by the multiplicity. Returns
+  `{ items: { re, im, kind, order, refined }[] }`. A zero and a pole in one cell cancel, and two distinct
+  roots in one cell are reported as one root of the combined order (Newton's step scaled by that order may fail to converge,
+  giving `refined: false` at the cell centre): raise `grid` if you suspect it. A genuine multiple root (`z^3`) reports
+  its multiplicity once with `refined: true`. The search grid is offset by an irrational fraction of a cell and
+  extended past the rectangle, so roots and poles on round-number domains and on grid vertices are found; results
+  outside the rectangle are dropped.
+
+### ODEs
+
+- `sampleSlopeField(f(x, y), xDomain, yDomain, { columns, rows })`: slopes and unit directions
+  (`dirX`, `dirY`; vertical slopes are `(0, +-1)`; `NaN` where undefined).
+- `integrateRk4(f(t, y[]) => number[], t0, y0[], tEnd, { steps })` and `integrateAdaptive(...,
+  { atol, rtol, hMin, hMax })` (Dormand-Prince 5(4)): a `Trajectory { t, y (steps x dim), dim, steps,
+  reason }` where `reason` is `"end" | "blowup" | "maxSteps" | "stopped" | "stepTooSmall"`. Either direction in
+  `t`. `stop(t, y)` ends the run; `blowup` (default 1e12) catches finite-time singularities cleanly.
+- `sampleSolutionCurve(f(x, y), x0, y0, xDomain, { method: "adaptive" | "rk4" })`: the solution through a
+  point both ways as `Samples`, ending (not spiking) at an asymptote.
+- `samplePhasePortrait(F(x, y) => [dx, dy], xDomain, yDomain, { grid, seeds, tMax, fixedPointStarts })`:
+  `{ field, trajectories, fixedPoints, progress }`. Fixed points are found by Newton from a grid of starts
+  and classified from the Jacobian by `classifyFixedPoint(J)`: `stable/unstable node`, `saddle`,
+  `stable/unstable spiral`, `center`, the star/degenerate case, or `non-hyperbolic` (det ~ 0; linearisation
+  says nothing). A `center` is a linear classification: the nonlinear system may spiral.
+
+### Series
+
+- `taylorCoefficients(expr, x0, order)` (in `/expr`, needs `@johnhenry/math`; computed by power-series arithmetic, so order
+  12 or more is instant for `+ - * /`, powers, `exp ln sqrt sin cos tan sinh cosh tanh atan asin acos`; any other function
+  falls back to repeated symbolic differentiation, keep `order` <= 8 there) then
+  `sampleTaylorPartialSums(coefficients, x0, domain, orders, samples)`: one curve per order.
+- `sampleSeriesPartialSums(term(k, x), from, domain, orders, samples)`: function-series partial sums in
+  one pass over `k` (each term evaluated once per sample).
+- `partialSums(term(k), from, to)`: numeric partial sums plus an Aitken delta-squared `limitEstimate`
+  (a hint, not a convergence proof).
+- `fourierCoefficients(f, { min, max }, terms)` (midpoint rule on 4096 samples by default; the interval is one
+  period), `evaluateFourier`, `sampleFourierPartialSums(coefficients, domain, orders)`. Trig form
+  `a0/2 + sum a_k cos(k pi (x - c) / L) + b_k sin(...)`. A function with jumps shows the Gibbs overshoot, as it should.
+
+### 2D (implicit, contours, gradient)
+
+- `sampleImplicit(f(x, y), xDomain, yDomain, { grid, level })`: marching squares, saddle cells settled by the
+  centre value. Segments come back as `Samples` rows: two endpoints then a `NaN` row per segment, so
+  `runsOf` gives one run per segment. Cells with a non-finite corner are skipped.
+- `sampleContours(f, xDomain, yDomain, { grid, levels | count })`: one pass for all levels; default levels are
+  spread strictly between the grid's least and greatest value.
+- `sampleGradient(fx, fy, xDomain, yDomain, { grid })`: arrow tails and components with magnitudes.
+
 ## What it does not do (yet)
 
 - **Implicit multiplication is opt-in.** `2x` fails to parse by default; write
   `2*x`, or pass `compileExpression(src, { implicitMultiplication: true })`
   (needs `@johnhenry/math` 0.1.0+; multi-letter variable names such as `theta`
   then become products, use `x_1`).
-- **1D `y = f(x)` only.** Implicit/interval curves, parametric and polar,
-  surfaces, ODEs and series samplers are planned as later parts.
+- **No interval-robust implicit mode.** `sampleImplicit` is a plain grid; thin features narrower
+  than a cell and isolated points can be missed (the quadtree/interval variant needs
+  `Symbolic.evaluateInterval`, johnhenry/math#108). Segments are not joined into long polylines.
+- **Meshes are uniform grids.** No adaptive refinement for surfaces or space curves; normals come from
+  finite differences of the vertex grid (one-sided at holes and edges), not from analytic gradients.
+- **Budgets stop at row boundaries**, and the time limit is only checked there. The ODE integrators take
+  `maxSteps`, not a budget.
+- **Polar/parametric 2D curves and 3D adaptive sampling** are not here; wrap `sampleSpaceCurve`
+  (with `z = 0`) or sample a parametric function through `sampleUniform` on each coordinate.
 - **Gaps from steep or fast-oscillating functions.** Jump detection is a
   heuristic; a function that oscillates faster than the grid resolves can read
   as a jump. Raise the resolution or `maxDepth`, or set `jumpFraction: Infinity`.

package/dist/budget.d.ts

@@ -0,0 +1,47 @@
+import { type CancelSignal } from "./sample.ts";
+/**
+ * A work limit for the 2D/3D samplers. When it runs out the sampler stops at a
+ * row boundary and returns what it has, with a {@link Progress} saying where
+ * it stopped (it does not throw).
+ */
+export interface Budget {
+    /** Most function evaluations ("cells") the call may spend. Checked per row/slab. */
+    maxCells?: number;
+    /** Wall-clock limit in milliseconds. Checked per row/slab, so a single row can overrun it. */
+    maxMillis?: number;
+    /** Clock override for tests; default `performance.now` when present, else `Date.now`. */
+    now?: () => number;
+}
+export interface Cancellable {
+    signal?: CancelSignal;
+    isCancelled?: () => boolean;
+}
+export interface Progress {
+    /** Rows (or slabs, or steps) completed. */
+    rows: number;
+    /** Rows the full job needed. */
+    of: number;
+    complete: boolean;
+    /** Why it stopped early. Absent when `complete`. */
+    reason?: "cells" | "time";
+}
+/** Tracks a {@link Budget} and cancellation for one call. */
+export declare class Meter {
+    private readonly start;
+    private spent;
+    private readonly now;
+    private readonly budget;
+    private readonly cancel;
+    constructor(budget: Budget | undefined, cancel: Cancellable | undefined);
+    /** Throws on cancellation; returns a reason when the budget cannot afford `cost` more evaluations. */
+    check(cost: number): "cells" | "time" | undefined;
+    spend(n: number): void;
+    get cells(): number;
+}
+export declare function progress(rows: number, of: number, reason?: "cells" | "time"): Progress;
+export declare function assertCount(name: string, n: number, min?: number): void;
+export declare function assertRange(name: string, d: {
+    min: number;
+    max: number;
+}): void;
+//# sourceMappingURL=budget.d.ts.map

package/dist/budget.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"budget.d.ts","sourceRoot":"","sources":["../src/budget.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,YAAY,EAAwB,MAAM,aAAa,CAAC;AAEtE;;;;GAIG;AACH,MAAM,WAAW,MAAM;IACrB,oFAAoF;IACpF,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,8FAA8F;IAC9F,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,yFAAyF;IACzF,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,WAAW;IAC1B,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,WAAW,CAAC,EAAE,MAAM,OAAO,CAAC;CAC7B;AAED,MAAM,WAAW,QAAQ;IACvB,2CAA2C;IAC3C,IAAI,EAAE,MAAM,CAAC;IACb,gCAAgC;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,OAAO,CAAC;IAClB,oDAAoD;IACpD,MAAM,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;CAC3B;AAED,6DAA6D;AAC7D,qBAAa,KAAK;IAChB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAS;IAC/B,OAAO,CAAC,KAAK,CAAK;IAClB,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAe;IACnC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAqB;IAC5C,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA0B;gBACrC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,MAAM,EAAE,WAAW,GAAG,SAAS;IAMvE,sGAAsG;IACtG,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,GAAG,MAAM,GAAG,SAAS;IAOjD,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAGtB,IAAI,KAAK,IAAI,MAAM,CAElB;CACF;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,MAAM,GAAG,QAAQ,CAEtF;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,SAAI,GAAG,IAAI,CAElE;AAED,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE;IAAE,GAAG,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAG/E"}

package/dist/budget.js

@@ -0,0 +1,44 @@
+import { SampleCancelledError } from "./sample.js";
+/** Tracks a {@link Budget} and cancellation for one call. */
+export class Meter {
+    start;
+    spent = 0;
+    now;
+    budget;
+    cancel;
+    constructor(budget, cancel) {
+        this.budget = budget;
+        this.cancel = cancel;
+        this.now = budget?.now ?? (typeof performance !== "undefined" ? () => performance.now() : () => Date.now());
+        this.start = this.now();
+    }
+    /** Throws on cancellation; returns a reason when the budget cannot afford `cost` more evaluations. */
+    check(cost) {
+        if (this.cancel?.signal?.aborted || this.cancel?.isCancelled?.())
+            throw new SampleCancelledError();
+        const b = this.budget;
+        if (b?.maxCells !== undefined && this.spent + cost > b.maxCells)
+            return "cells";
+        if (b?.maxMillis !== undefined && this.now() - this.start > b.maxMillis)
+            return "time";
+        return undefined;
+    }
+    spend(n) {
+        this.spent += n;
+    }
+    get cells() {
+        return this.spent;
+    }
+}
+export function progress(rows, of, reason) {
+    return reason === undefined ? { rows, of, complete: rows >= of } : { rows, of, complete: false, reason };
+}
+export function assertCount(name, n, min = 2) {
+    if (!Number.isInteger(n) || n < min)
+        throw new RangeError(`${name} must be an integer >= ${min}, got ${n}`);
+}
+export function assertRange(name, d) {
+    if (!Number.isFinite(d.min) || !Number.isFinite(d.max) || !(d.min < d.max))
+        throw new RangeError(`${name} must be finite with min < max`);
+}
+//# sourceMappingURL=budget.js.map

package/dist/budget.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"budget.js","sourceRoot":"","sources":["../src/budget.ts"],"names":[],"mappings":"AAAA,OAAO,EAAqB,oBAAoB,EAAE,MAAM,aAAa,CAAC;AA+BtE,6DAA6D;AAC7D,MAAM,OAAO,KAAK;IACC,KAAK,CAAS;IACvB,KAAK,GAAG,CAAC,CAAC;IACD,GAAG,CAAe;IAClB,MAAM,CAAqB;IAC3B,MAAM,CAA0B;IACjD,YAAY,MAA0B,EAAE,MAA+B;QACrE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,GAAG,GAAG,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,WAAW,KAAK,WAAW,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC5G,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC1B,CAAC;IACD,sGAAsG;IACtG,KAAK,CAAC,IAAY;QAChB,IAAI,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE;YAAE,MAAM,IAAI,oBAAoB,EAAE,CAAC;QACnG,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,EAAE,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ;YAAE,OAAO,OAAO,CAAC;QAChF,IAAI,CAAC,EAAE,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,SAAS;YAAE,OAAO,MAAM,CAAC;QACvF,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,KAAK,CAAC,CAAS;QACb,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF;AAED,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,EAAU,EAAE,MAAyB;IAC1E,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;AAC3G,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,IAAY,EAAE,CAAS,EAAE,GAAG,GAAG,CAAC;IAC1D,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG;QAAE,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,0BAA0B,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;AAC9G,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,IAAY,EAAE,CAA+B;IACvE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;QACxE,MAAM,IAAI,UAAU,CAAC,GAAG,IAAI,gCAAgC,CAAC,CAAC;AAClE,CAAC"}

package/dist/complex.d.ts

@@ -0,0 +1,79 @@
+import { type Budget, type Cancellable, type Progress } from "./budget.ts";
+import type { Domain } from "./sample.ts";
+/** A complex function over plain numbers: `(re, im) -> [re, im]`. */
+export type ComplexFn = (re: number, im: number) => readonly [number, number];
+export interface ComplexRasterOptions extends Budget, Cancellable {
+    /** Pixels across (real axis). Default 128. */
+    width?: number;
+    /** Pixels down (imaginary axis). Default 128. */
+    height?: number;
+}
+/**
+ * Grid of `f(z)` values for domain colouring. Row 0 is the *smallest* imaginary part (mathematical
+ * orientation); flip when drawing to a canvas. Cells where `f` is not finite hold `NaN` in all four arrays
+ * (a pole shows as `abs = Infinity` only if `f` returned an infinite modulus with finite parts; otherwise NaN).
+ * `arg` is in `(-PI, PI]`.
+ */
+export interface ComplexRaster {
+    width: number;
+    /** Rows completed (may be fewer than requested when the budget ran out). */
+    height: number;
+    re: Float32Array;
+    im: Float32Array;
+    abs: Float32Array;
+    arg: Float32Array;
+    progress: Progress;
+}
+/** Sample `f` at the centre of each cell of a `width` x `height` grid over the rectangle. */
+export declare function sampleComplexRaster(f: ComplexFn, reDomain: Domain, imDomain: Domain, options?: ComplexRasterOptions): ComplexRaster;
+export interface ConformalLine {
+    /** `"re"`: the image of the vertical line `Re z = value`; `"im"`: of the horizontal line `Im z = value`. */
+    kind: "re" | "im";
+    value: number;
+    /** Image points; `NaN` rows are gaps (never first, last or adjacent). */
+    x: Float64Array;
+    y: Float64Array;
+}
+export interface ConformalGridOptions {
+    /** Vertical grid lines (constant real part), evenly spaced including both edges. Default 11. */
+    reLines?: number;
+    /** Horizontal grid lines (constant imaginary part). Default 11. */
+    imLines?: number;
+    /** Samples along each line. Default 200. */
+    samplesPerLine?: number;
+    /** Image points with modulus above this become gaps (poles). Default 1e6. */
+    bound?: number;
+    /** Segments whose image is longer than this become gaps (branch cuts). Default: no limit. */
+    maxStep?: number;
+}
+/** The image under `f` of a rectangular grid of lines: where the grid lines go, drawn as the conformal-map picture. */
+export declare function conformalGrid(f: ComplexFn, reDomain: Domain, imDomain: Domain, options?: ConformalGridOptions): ConformalLine[];
+export interface ZeroOrPole {
+    re: number;
+    im: number;
+    kind: "zero" | "pole";
+    /** Multiplicity (zero) or order (pole), from the winding number of the cell it was found in. */
+    order: number;
+    /** `false` when the local refinement did not converge and `re`/`im` is only the cell centre. */
+    refined: boolean;
+}
+export interface ZerosPolesOptions extends Budget, Cancellable {
+    /** Cells per side of the search grid. Default 24. */
+    grid?: number;
+    /** Convergence tolerance on the root position. Default 1e-10 (relative to the rectangle size). */
+    tolerance?: number;
+}
+export interface ZerosPoles {
+    items: ZeroOrPole[];
+    progress: Progress;
+}
+/**
+ * Zeros and poles of `f` inside a rectangle, by the argument principle: the winding number of `f` around each
+ * grid cell is (zeros - poles) inside it; non-zero cells are refined with Newton's method (on `f` for a
+ * zero, on `1/f` for a pole, scaled by the multiplicity). A zero and a pole inside one cell cancel and are missed:
+ * raise `grid`. The search grid is offset by an irrational fraction of a cell and extended past the
+ * rectangle, so round-number domains do not put roots on cell edges; results inside the rectangle (or on its edge) are
+ * kept and results within the tolerance are merged. `progress.rows` counts grid rows searched.
+ */
+export declare function findZerosAndPoles(f: ComplexFn, reDomain: Domain, imDomain: Domain, options?: ZerosPolesOptions): ZerosPoles;
+//# sourceMappingURL=complex.d.ts.map

package/dist/complex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"complex.d.ts","sourceRoot":"","sources":["../src/complex.ts"],"names":[],"mappings":"AAAA,OAAO,EAA4B,KAAK,MAAM,EAAE,KAAK,WAAW,EAAS,KAAK,QAAQ,EAAY,MAAM,aAAa,CAAC;AACtH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAE1C,qEAAqE;AACrE,MAAM,MAAM,SAAS,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAE9E,MAAM,WAAW,oBAAqB,SAAQ,MAAM,EAAE,WAAW;IAC/D,8CAA8C;IAC9C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,iDAAiD;IACjD,MAAM,CAAC,EAAE,MAAM,CAAC;CACjB;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,4EAA4E;IAC5E,MAAM,EAAE,MAAM,CAAC;IACf,EAAE,EAAE,YAAY,CAAC;IACjB,EAAE,EAAE,YAAY,CAAC;IACjB,GAAG,EAAE,YAAY,CAAC;IAClB,GAAG,EAAE,YAAY,CAAC;IAClB,QAAQ,EAAE,QAAQ,CAAC;CACpB;AAED,6FAA6F;AAC7F,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,SAAS,EACZ,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE,oBAAyB,GACjC,aAAa,CAyCf;AAED,MAAM,WAAW,aAAa;IAC5B,4GAA4G;IAC5G,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,yEAAyE;IACzE,CAAC,EAAE,YAAY,CAAC;IAChB,CAAC,EAAE,YAAY,CAAC;CACjB;AAED,MAAM,WAAW,oBAAoB;IACnC,gGAAgG;IAChG,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,mEAAmE;IACnE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,4CAA4C;IAC5C,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,6EAA6E;IAC7E,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,6FAA6F;IAC7F,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,uHAAuH;AACvH,wBAAgB,aAAa,CAC3B,CAAC,EAAE,SAAS,EACZ,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE,oBAAyB,GACjC,aAAa,EAAE,CAiDjB;AAED,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IACtB,gGAAgG;IAChG,KAAK,EAAE,MAAM,CAAC;IACd,gGAAgG;IAChG,OAAO,EAAE,OAAO,CAAC;CAClB;AAED,MAAM,WAAW,iBAAkB,SAAQ,MAAM,EAAE,WAAW;IAC5D,qDAAqD;IACrD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,kGAAkG;IAClG,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,QAAQ,EAAE,QAAQ,CAAC;CACpB;AAQD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAC/B,CAAC,EAAE,SAAS,EACZ,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE,iBAAsB,GAC9B,UAAU,CA+HZ"}

package/dist/complex.js

@@ -0,0 +1,236 @@
+import { assertCount, assertRange, Meter, progress } from "./budget.js";
+/** Sample `f` at the centre of each cell of a `width` x `height` grid over the rectangle. */
+export function sampleComplexRaster(f, reDomain, imDomain, options = {}) {
+    const width = options.width ?? 128;
+    const height = options.height ?? 128;
+    assertCount("width", width, 1);
+    assertCount("height", height, 1);
+    assertRange("re domain", reDomain);
+    assertRange("im domain", imDomain);
+    const meter = new Meter(options, options);
+    const re = new Float32Array(width * height).fill(Number.NaN);
+    const im = new Float32Array(width * height).fill(Number.NaN);
+    const abs = new Float32Array(width * height).fill(Number.NaN);
+    const arg = new Float32Array(width * height).fill(Number.NaN);
+    let rows = 0;
+    let reason;
+    for (let j = 0; j < height; j++) {
+        reason = meter.check(width);
+        if (reason)
+            break;
+        const y = imDomain.min + ((imDomain.max - imDomain.min) * (j + 0.5)) / height;
+        for (let i = 0; i < width; i++) {
+            const x = reDomain.min + ((reDomain.max - reDomain.min) * (i + 0.5)) / width;
+            const w = f(x, y);
+            const k = j * width + i;
+            if (Number.isFinite(w[0]) && Number.isFinite(w[1])) {
+                re[k] = w[0];
+                im[k] = w[1];
+                abs[k] = Math.hypot(w[0], w[1]);
+                arg[k] = Math.atan2(w[1], w[0]);
+            }
+        }
+        meter.spend(width);
+        rows++;
+    }
+    return {
+        width,
+        height: rows,
+        re: re.slice(0, width * rows),
+        im: im.slice(0, width * rows),
+        abs: abs.slice(0, width * rows),
+        arg: arg.slice(0, width * rows),
+        progress: progress(rows, height, reason),
+    };
+}
+/** The image under `f` of a rectangular grid of lines: where the grid lines go, drawn as the conformal-map picture. */
+export function conformalGrid(f, reDomain, imDomain, options = {}) {
+    const nRe = options.reLines ?? 11;
+    const nIm = options.imLines ?? 11;
+    const n = options.samplesPerLine ?? 200;
+    const bound = options.bound ?? 1e6;
+    assertCount("reLines", nRe, 1);
+    assertCount("imLines", nIm, 1);
+    assertCount("samplesPerLine", n);
+    assertRange("re domain", reDomain);
+    assertRange("im domain", imDomain);
+    const lines = [];
+    const trace = (kind, value, d) => {
+        const xs = [];
+        const ys = [];
+        let pending = false;
+        let px = Number.NaN;
+        let py = Number.NaN;
+        for (let k = 0; k < n; k++) {
+            const s = k === n - 1 ? d.max : d.min + ((d.max - d.min) * k) / (n - 1);
+            const w = kind === "re" ? f(value, s) : f(s, value);
+            const good = Number.isFinite(w[0]) && Number.isFinite(w[1]) && Math.hypot(w[0], w[1]) <= bound;
+            if (!good) {
+                pending = xs.length > 0;
+                px = Number.NaN;
+                continue;
+            }
+            const cut = options.maxStep !== undefined && !Number.isNaN(px) && Math.hypot(w[0] - px, w[1] - py) > options.maxStep;
+            if ((pending || cut) && xs.length > 0) {
+                xs.push(Number.NaN);
+                ys.push(Number.NaN);
+            }
+            xs.push(w[0]);
+            ys.push(w[1]);
+            px = w[0];
+            py = w[1];
+            pending = false;
+        }
+        return { kind, value, x: Float64Array.from(xs), y: Float64Array.from(ys) };
+    };
+    for (let i = 0; i < nRe; i++)
+        lines.push(trace("re", nRe === 1 ? reDomain.min : reDomain.min + ((reDomain.max - reDomain.min) * i) / (nRe - 1), imDomain));
+    for (let j = 0; j < nIm; j++)
+        lines.push(trace("im", nIm === 1 ? imDomain.min : imDomain.min + ((imDomain.max - imDomain.min) * j) / (nIm - 1), reDomain));
+    return lines;
+}
+const wrap = (d) => {
+    while (d > Math.PI)
+        d -= 2 * Math.PI;
+    while (d < -Math.PI)
+        d += 2 * Math.PI;
+    return d;
+};
+/**
+ * Zeros and poles of `f` inside a rectangle, by the argument principle: the winding number of `f` around each
+ * grid cell is (zeros - poles) inside it; non-zero cells are refined with Newton's method (on `f` for a
+ * zero, on `1/f` for a pole, scaled by the multiplicity). A zero and a pole inside one cell cancel and are missed:
+ * raise `grid`. The search grid is offset by an irrational fraction of a cell and extended past the
+ * rectangle, so round-number domains do not put roots on cell edges; results inside the rectangle (or on its edge) are
+ * kept and results within the tolerance are merged. `progress.rows` counts grid rows searched.
+ */
+export function findZerosAndPoles(f, reDomain, imDomain, options = {}) {
+    const grid = options.grid ?? 24;
+    assertCount("grid", grid, 1);
+    assertRange("re domain", reDomain);
+    assertRange("im domain", imDomain);
+    const size = Math.max(reDomain.max - reDomain.min, imDomain.max - imDomain.min);
+    const tol = (options.tolerance ?? 1e-10) * size;
+    const meter = new Meter(options, options);
+    const dx = (reDomain.max - reDomain.min) / grid;
+    const dy = (imDomain.max - imDomain.min) / grid;
+    const found = [];
+    const argAt = (x, y) => {
+        const w = f(x, y);
+        if (w[0] === 0 && w[1] === 0)
+            return Number.NaN; // an exact zero has no argument
+        return Math.atan2(w[1], w[0]);
+    };
+    // winding of f along segment p->q, subdividing until the phase moves < 1 rad per piece
+    const segment = (x0, y0, a0, x1, y1, a1, depth) => {
+        const d = wrap(a1 - a0);
+        // a minimum depth keeps a high-order root from aliasing a whole turn (3 theta moving 2 pi in one piece)
+        if ((depth >= 4 && Math.abs(d) < 1) || depth >= 14)
+            return d;
+        const xm = (x0 + x1) / 2;
+        const ym = (y0 + y1) / 2;
+        const am = argAt(xm, ym);
+        return segment(x0, y0, a0, xm, ym, am, depth + 1) + segment(xm, ym, am, x1, y1, a1, depth + 1);
+    };
+    const winding = (x0, y0, x1, y1) => {
+        const pts = [
+            [x0, y0],
+            [x1, y0],
+            [x1, y1],
+            [x0, y1],
+            [x0, y0],
+        ];
+        const args = pts.map(([x, y]) => argAt(x, y));
+        if (args.some((a) => !Number.isFinite(a)))
+            return Number.NaN;
+        let total = 0;
+        for (let k = 0; k < 4; k++) {
+            const p = pts[k];
+            const q = pts[k + 1];
+            total += segment(p[0], p[1], args[k], q[0], q[1], args[k + 1], 0);
+        }
+        return Math.round(total / (2 * Math.PI));
+    };
+    const newton = (x, y, kind, order, box) => {
+        const g = (a, b) => {
+            const w = f(a, b);
+            if (kind === "zero")
+                return [w[0], w[1]];
+            const m = w[0] * w[0] + w[1] * w[1];
+            return [w[0] / m, -w[1] / m]; // 1/f
+        };
+        let zx = x;
+        let zy = y;
+        for (let it = 0; it < 60; it++) {
+            const [gr, gi] = g(zx, zy);
+            if (!Number.isFinite(gr) || !Number.isFinite(gi))
+                return undefined;
+            const h = 1e-7 * Math.max(1, Math.abs(zx), Math.abs(zy));
+            const [ar, ai] = g(zx + h, zy);
+            const dr = (ar - gr) / h; // derivative of an analytic function = d/dx
+            const di = (ai - gi) / h;
+            const den = dr * dr + di * di;
+            if (!(den > 0) || !Number.isFinite(den))
+                return undefined;
+            // step = order * g / g'
+            const sr = (order * (gr * dr + gi * di)) / den;
+            const si = (order * (gi * dr - gr * di)) / den;
+            zx -= sr;
+            zy -= si;
+            if (Math.hypot(sr, si) < tol) {
+                const pad = 0.5 * Math.max(dx, dy);
+                if (zx < box[0] - pad || zx > box[1] + pad || zy < box[2] - pad || zy > box[3] + pad)
+                    return undefined;
+                return [zx, zy];
+            }
+            if (!Number.isFinite(zx) || !Number.isFinite(zy))
+                return undefined;
+        }
+        return undefined;
+    };
+    // The search grid is shifted by an irrational fraction of a cell and extended by one cell on each side, so
+    // roots and poles on a round-number domain (z^3 - z on [-2, 2]) sit inside cells, not on their edges or
+    // corners. Candidates outside the requested rectangle are discarded at the end.
+    const OFFSET = 0.3819660112501051;
+    const gx0 = reDomain.min - (1 - OFFSET) * dx;
+    const gy0 = imDomain.min - (1 - OFFSET) * dy;
+    const cells = grid + 1;
+    const slack = 1e-9 * size;
+    const insideRect = (x, y) => x >= reDomain.min - slack && x <= reDomain.max + slack && y >= imDomain.min - slack && y <= imDomain.max + slack;
+    let rows = 0;
+    let reason;
+    for (let j = 0; j < cells; j++) {
+        reason = meter.check(cells * 4);
+        if (reason)
+            break;
+        for (let i = 0; i < cells; i++) {
+            const x0 = gx0 + i * dx;
+            const y0 = gy0 + j * dy;
+            let w = winding(x0, y0, x0 + dx, y0 + dy);
+            let ex = 0;
+            if (Number.isNaN(w)) {
+                // f is zero or non-finite on this cell's boundary (an exact root/pole on an edge): retry slightly inflated
+                ex = 0.0123 * dx;
+                w = winding(x0 - ex, y0 - 0.0123 * dy, x0 + dx + ex, y0 + dy + 0.0123 * dy);
+            }
+            if (!Number.isFinite(w) || w === 0)
+                continue;
+            const kind = w > 0 ? "zero" : "pole";
+            const order = Math.abs(w);
+            const cx = x0 + dx / 2;
+            const cy = y0 + dy / 2;
+            const refined = newton(cx, cy, kind, order, [x0, x0 + dx, y0, y0 + dy]);
+            const [rx, ry] = refined ?? [cx, cy];
+            if (!insideRect(rx, ry))
+                continue;
+            if (found.some((p) => p.kind === kind && Math.hypot(p.re - rx, p.im - ry) < Math.max(tol * 1e3, 1e-7 * size)))
+                continue;
+            found.push({ re: rx, im: ry, kind, order, refined: refined !== undefined });
+        }
+        meter.spend(cells * 4);
+        rows++;
+    }
+    found.sort((a, b) => a.re - b.re || a.im - b.im);
+    return { items: found, progress: progress(rows, cells, reason) };
+}
+//# sourceMappingURL=complex.js.map

package/dist/complex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"complex.js","sourceRoot":"","sources":["../src/complex.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,WAAW,EAAiC,KAAK,EAAiB,QAAQ,EAAE,MAAM,aAAa,CAAC;AA8BtH,6FAA6F;AAC7F,MAAM,UAAU,mBAAmB,CACjC,CAAY,EACZ,QAAgB,EAChB,QAAgB,EAChB,UAAgC,EAAE;IAElC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,GAAG,CAAC;IACnC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,GAAG,CAAC;IACrC,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC;IAC/B,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IACjC,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACnC,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7D,MAAM,EAAE,GAAG,IAAI,YAAY,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC7D,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9D,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9D,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,MAAoC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,MAAM;YAAE,MAAM;QAClB,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC;QAC9E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;YAC7E,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACxB,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnD,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACb,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBACb,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,EAAE,CAAC;IACT,CAAC;IACD,OAAO;QACL,KAAK;QACL,MAAM,EAAE,IAAI;QACZ,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;QAC7B,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;QAC7B,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;QAC/B,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;QAC/B,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC;KACzC,CAAC;AACJ,CAAC;AAwBD,uHAAuH;AACvH,MAAM,UAAU,aAAa,CAC3B,CAAY,EACZ,QAAgB,EAChB,QAAgB,EAChB,UAAgC,EAAE;IAElC,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC;IAClC,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC;IAClC,MAAM,CAAC,GAAG,OAAO,CAAC,cAAc,IAAI,GAAG,CAAC;IACxC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,GAAG,CAAC;IACnC,WAAW,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC/B,WAAW,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC/B,WAAW,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;IACjC,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACnC,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACnC,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,IAAiB,EAAE,KAAa,EAAE,CAAS,EAAiB,EAAE;QAC3E,MAAM,EAAE,GAAa,EAAE,CAAC;QACxB,MAAM,EAAE,GAAa,EAAE,CAAC;QACxB,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC;QACpB,IAAI,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACxE,MAAM,CAAC,GAAG,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACpD,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;YAC/F,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,GAAG,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;gBACxB,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC;gBAChB,SAAS;YACX,CAAC;YACD,MAAM,GAAG,GACP,OAAO,CAAC,OAAO,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC;YAC3G,IAAI,CAAC,OAAO,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACpB,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACtB,CAAC;YACD,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACd,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACd,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACV,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACV,OAAO,GAAG,KAAK,CAAC;QAClB,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;IAC7E,CAAC,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,IAAI,CACR,KAAK,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CACjH,CAAC;IACJ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;QAC1B,KAAK,CAAC,IAAI,CACR,KAAK,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CACjH,CAAC;IACJ,OAAO,KAAK,CAAC;AACf,CAAC;AAwBD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,EAAE;IACzB,OAAO,CAAC,GAAG,IAAI,CAAC,EAAE;QAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACrC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IACtC,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,CAAY,EACZ,QAAgB,EAChB,QAAgB,EAChB,UAA6B,EAAE;IAE/B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;IAChC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAC7B,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACnC,WAAW,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,EAAE,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAChF,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,SAAS,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC;IAChD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;IAChD,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;IAChD,MAAM,KAAK,GAAiB,EAAE,CAAC;IAE/B,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;QAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,gCAAgC;QACjF,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC,CAAC;IACF,uFAAuF;IACvF,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,KAAa,EAAU,EAAE;QAChH,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;QACxB,wGAAwG;QACxG,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,EAAE;YAAE,OAAO,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,EAAE,GAAG,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzB,OAAO,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IACjG,CAAC,CAAC;IACF,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAU,EAAE;QACzE,MAAM,GAAG,GAA4B;YACnC,CAAC,EAAE,EAAE,EAAE,CAAC;YACR,CAAC,EAAE,EAAE,EAAE,CAAC;YACR,CAAC,EAAE,EAAE,EAAE,CAAC;YACR,CAAC,EAAE,EAAE,EAAE,CAAC;YACR,CAAC,EAAE,EAAE,EAAE,CAAC;SACT,CAAC;QACF,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC;QAC7D,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAqB,CAAC;YACrC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAqB,CAAC;YACzC,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAW,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAW,EAAE,CAAC,CAAC,CAAC;QACxF,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC;IAEF,MAAM,MAAM,GAAG,CACb,CAAS,EACT,CAAS,EACT,IAAqB,EACrB,KAAa,EACb,GAAqC,EACrC,EAAE;QACF,MAAM,CAAC,GAAG,CAAC,CAAS,EAAE,CAAS,EAAoB,EAAE;YACnD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClB,IAAI,IAAI,KAAK,MAAM;gBAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM;QACtC,CAAC,CAAC;QACF,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAAE,OAAO,SAAS,CAAC;YACnE,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/B,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,4CAA4C;YACtE,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YACzB,MAAM,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;YAC9B,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,OAAO,SAAS,CAAC;YAC1D,wBAAwB;YACxB,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC;YAC/C,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC;YAC/C,EAAE,IAAI,EAAE,CAAC;YACT,EAAE,IAAI,EAAE,CAAC;YACT,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC;gBAC7B,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;gBACnC,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG;oBAAE,OAAO,SAAS,CAAC;gBACvG,OAAO,CAAC,EAAE,EAAE,EAAE,CAAU,CAAC;YAC3B,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAAE,OAAO,SAAS,CAAC;QACrE,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,2GAA2G;IAC3G,wGAAwG;IACxG,gFAAgF;IAChF,MAAM,MAAM,GAAG,kBAAkB,CAAC;IAClC,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;IAC7C,MAAM,GAAG,GAAG,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;IAC7C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IACvB,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;IAC1B,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAC1C,CAAC,IAAI,QAAQ,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAG,GAAG,KAAK,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAG,GAAG,KAAK,CAAC;IACnH,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,MAAoC,CAAC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAChC,IAAI,MAAM;YAAE,MAAM;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YACxB,IAAI,CAAC,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAC1C,IAAI,EAAE,GAAG,CAAC,CAAC;YACX,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,2GAA2G;gBAC3G,EAAE,GAAG,MAAM,GAAG,EAAE,CAAC;gBACjB,CAAC,GAAG,OAAO,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,MAAM,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,MAAM,GAAG,EAAE,CAAC,CAAC;YAC9E,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,SAAS;YAC7C,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;YACrC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACvB,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YACxE,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC;gBAAE,SAAS;YAClC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC;gBAC3G,SAAS;YACX,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC;QAC9E,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACvB,IAAI,EAAE,CAAC;IACT,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IACjD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;AACnE,CAAC"}

package/dist/expr.d.ts

@@ -23,4 +23,16 @@ export interface CompileOptions {
  * `implicitMultiplication: true` to accept `2x`.
  */
 export declare function compileExpression(expr: Expr | string, options?: CompileOptions): Fn1;
+/**
+ * Taylor coefficients `a_k = f^(k)(x0) / k!` for `k = 0..order` of an expression. They are computed by truncated
+ * power-series ("jet") arithmetic, O(order^2) per node, so order 12 of `sin(x)*exp(x)/(1+x^2)` takes well under a
+ * millisecond. Supported: `+ - * /`, powers (integer or real exponent, or a variable exponent), and `exp ln sqrt cbrt sin
+ * cos tan sinh cosh tanh atan asin acos`. Any other node falls back to repeated symbolic differentiation with
+ * simplification after every derivative, which grows quickly: keep `order` at or below 8 there. A coefficient that is
+ * not finite at `x0` (a pole, `ln(0)`) is `NaN` or `Infinity`, and the partial sums built on it are gaps.
+ */
+export declare function taylorCoefficients(expr: Expr | string, x0: number, order: number, options?: {
+    variable?: string;
+    params?: Record<string, number>;
+}): Float64Array;
 //# sourceMappingURL=expr.d.ts.map

package/dist/expr.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"expr.d.ts","sourceRoot":"","sources":["../src/expr.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,IAAI,EAAY,MAAM,iBAAiB,CAAC;AACtD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAEvC,MAAM,WAAW,cAAc;IAC7B,kEAAkE;IAClE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uEAAuE;IACvE,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC;;;;OAIG;IACH,sBAAsB,CAAC,EAAE,OAAO,CAAC;CAClC;AAED;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,EAAE,OAAO,GAAE,cAAmB,GAAG,GAAG,CAYxF"}
+{"version":3,"file":"expr.d.ts","sourceRoot":"","sources":["../src/expr.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,IAAI,EAAY,MAAM,iBAAiB,CAAC;AACtD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAEvC,MAAM,WAAW,cAAc;IAC7B,kEAAkE;IAClE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,uEAAuE;IACvE,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAChC;;;;OAIG;IACH,sBAAsB,CAAC,EAAE,OAAO,CAAC;CAClC;AAED;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,EAAE,OAAO,GAAE,cAAmB,GAAG,GAAG,CAYxF;AAqND;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,IAAI,GAAG,MAAM,EACnB,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,MAAM,EACb,OAAO,GAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAO,GACnE,YAAY,CAkBd"}