@johnhenry/math-sample 0.0.0-stage → 0.1.0

package/dist/field2d.js

@@ -0,0 +1,199 @@
+import { assertCount, assertRange, Meter, progress } from "./budget.js";
+function dims(g) {
+    const [nx, ny] = typeof g === "number" ? [g, g] : (g ?? [128, 128]);
+    assertCount("grid", nx, 1);
+    assertCount("grid", ny, 1);
+    return [nx, ny];
+}
+function marching(f, xDomain, yDomain, levels, options) {
+    const [nx, ny] = dims(options.grid);
+    assertRange("x domain", xDomain);
+    assertRange("y domain", yDomain);
+    const meter = new Meter(options, options);
+    const hx = (xDomain.max - xDomain.min) / nx;
+    const hy = (yDomain.max - yDomain.min) / ny;
+    const segs = levels.map(() => []);
+    let prev = new Float64Array(nx + 1);
+    let cur = new Float64Array(nx + 1);
+    const row = (j, out) => {
+        const y = yDomain.min + j * hy;
+        for (let i = 0; i <= nx; i++)
+            out[i] = f(xDomain.min + i * hx, y);
+    };
+    let reason;
+    row(0, prev);
+    meter.spend(nx + 1);
+    let done = 0;
+    for (let j = 0; j < ny; j++) {
+        reason = meter.check(nx + 1);
+        if (reason)
+            break;
+        row(j + 1, cur);
+        meter.spend(nx + 1);
+        const y0 = yDomain.min + j * hy;
+        for (let i = 0; i < nx; i++) {
+            const x0 = xDomain.min + i * hx;
+            const v = [prev[i], prev[i + 1], cur[i + 1], cur[i]]; // corners ccw from bottom-left
+            if (!v.every(Number.isFinite))
+                continue; // holes: no segments through undefined cells
+            const cx = [x0, x0 + hx, x0 + hx, x0];
+            const cy = [y0, y0, y0 + hy, y0 + hy];
+            levels.forEach((level, li) => {
+                const s = v.map((q) => q - level);
+                // edge e joins corner e and corner e+1
+                const cross = (e) => {
+                    const a = s[e];
+                    const b = s[(e + 1) % 4];
+                    if (a < 0 === b < 0)
+                        return undefined; // a === 0 counts as >= 0 on the positive side
+                    const t = a / (a - b);
+                    const ea = e;
+                    const eb = (e + 1) % 4;
+                    return [
+                        cx[ea] + t * (cx[eb] - cx[ea]),
+                        cy[ea] + t * (cy[eb] - cy[ea]),
+                    ];
+                };
+                const pts = [0, 1, 2, 3].map(cross);
+                const idx = [0, 1, 2, 3].filter((e) => pts[e]);
+                const out = segs[li];
+                const emit = (p, q) => out.push(p[0], p[1], q[0], q[1]);
+                if (idx.length === 2)
+                    emit(pts[idx[0]], pts[idx[1]]);
+                else if (idx.length === 4) {
+                    // saddle: the cell centre decides which corners are connected
+                    const centre = (s[0] + s[1] + s[2] + s[3]) / 4;
+                    const p = pts;
+                    const bottomLeftPositive = s[0] >= 0;
+                    const joinsCorner0 = centre >= 0 === bottomLeftPositive; // centre agrees with corner 0: corners 0 and 2 are linked through the middle, so the curve cuts off corners 1 and 3
+                    if (joinsCorner0) {
+                        emit(p[0], p[1]);
+                        emit(p[2], p[3]);
+                    }
+                    else {
+                        emit(p[3], p[0]);
+                        emit(p[1], p[2]);
+                    }
+                }
+            });
+        }
+        [prev, cur] = [cur, prev];
+        done++;
+    }
+    return { segs, progress: progress(done, ny, reason) };
+}
+function toSamples(flat) {
+    const n = flat.length / 4;
+    const x = new Float64Array(n === 0 ? 0 : n * 3 - 1);
+    const y = new Float64Array(x.length);
+    for (let s = 0; s < n; s++) {
+        const o = s * 3;
+        x[o] = flat[4 * s];
+        y[o] = flat[4 * s + 1];
+        x[o + 1] = flat[4 * s + 2];
+        y[o + 1] = flat[4 * s + 3];
+        if (s < n - 1) {
+            x[o + 2] = Number.NaN;
+            y[o + 2] = Number.NaN;
+        }
+    }
+    return { x, y };
+}
+/**
+ * The curve `f(x, y) = level` (default 0) by marching squares on a regular grid. A saddle cell is joined by its
+ * centre value. Cells with a non-finite corner are skipped (a hole, not a spike). With a budget,
+ * `progress.rows` counts grid rows finished.
+ */
+export function sampleImplicit(f, xDomain, yDomain, options = {}) {
+    const { segs, progress: p } = marching(f, xDomain, yDomain, [options.level ?? 0], options);
+    const flat = segs[0];
+    return { segments: toSamples(flat), segmentCount: flat.length / 4, progress: p };
+}
+/**
+ * Contour lines of `f` at the given `levels`, or `count` (default 9) levels evenly spread strictly between the
+ * grid's least and greatest values. One pass over the grid for all levels.
+ */
+export function sampleContours(f, xDomain, yDomain, options = {}) {
+    let levels = options.levels;
+    if (!levels) {
+        const [nx, ny] = dims(options.grid);
+        let lo = Infinity;
+        let hi = -Infinity;
+        for (let j = 0; j <= ny; j++)
+            for (let i = 0; i <= nx; i++) {
+                const v = f(xDomain.min + ((xDomain.max - xDomain.min) * i) / nx, yDomain.min + ((yDomain.max - yDomain.min) * j) / ny);
+                if (Number.isFinite(v)) {
+                    if (v < lo)
+                        lo = v;
+                    if (v > hi)
+                        hi = v;
+                }
+            }
+        const count = options.count ?? 9;
+        levels = lo < hi ? Array.from({ length: count }, (_, k) => lo + ((hi - lo) * (k + 1)) / (count + 1)) : [];
+    }
+    const { segs, progress: p } = marching(f, xDomain, yDomain, levels, options);
+    return {
+        levels,
+        curves: levels.map((level, k) => ({
+            level,
+            segments: toSamples(segs[k]),
+            segmentCount: segs[k].length / 4,
+        })),
+        progress: p,
+    };
+}
+/** Sample the vector field `(fx, fy)` (e.g. the two partial derivatives of a scalar field) on a grid including the edges. */
+export function sampleGradient(fx, fy, xDomain, yDomain, options = {}) {
+    const [cols, rws] = typeof options.grid === "number" ? [options.grid, options.grid] : (options.grid ?? [16, 16]);
+    assertCount("grid", cols);
+    assertCount("grid", rws);
+    assertRange("x domain", xDomain);
+    assertRange("y domain", yDomain);
+    const meter = new Meter(options, options);
+    const n = cols * rws;
+    const X = new Float64Array(n);
+    const Y = new Float64Array(n);
+    const U = new Float64Array(n).fill(Number.NaN);
+    const V = new Float64Array(n).fill(Number.NaN);
+    const M = new Float64Array(n).fill(Number.NaN);
+    let done = 0;
+    let reason;
+    let max = 0;
+    for (let j = 0; j < rws; j++) {
+        reason = meter.check(cols);
+        if (reason)
+            break;
+        const y = j === rws - 1 ? yDomain.max : yDomain.min + ((yDomain.max - yDomain.min) * j) / (rws - 1);
+        for (let i = 0; i < cols; i++) {
+            const x = i === cols - 1 ? xDomain.max : xDomain.min + ((xDomain.max - xDomain.min) * i) / (cols - 1);
+            const k = j * cols + i;
+            X[k] = x;
+            Y[k] = y;
+            const a = fx(x, y);
+            const b = fy(x, y);
+            if (Number.isFinite(a) && Number.isFinite(b)) {
+                U[k] = a;
+                V[k] = b;
+                M[k] = Math.hypot(a, b);
+                if (M[k] > max)
+                    max = M[k];
+            }
+        }
+        meter.spend(cols);
+        done++;
+    }
+    const m = cols * done;
+    return {
+        columns: cols,
+        rows: done,
+        x: X.slice(0, m),
+        y: Y.slice(0, m),
+        u: U.slice(0, m),
+        v: V.slice(0, m),
+        magnitude: M.slice(0, m),
+        maxMagnitude: max,
+        progress: progress(done, rws, reason),
+    };
+}
+//# sourceMappingURL=field2d.js.map

package/dist/field2d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"field2d.js","sourceRoot":"","sources":["../src/field2d.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,WAAW,EAAiC,KAAK,EAAiB,QAAQ,EAAE,MAAM,aAAa,CAAC;AAoBtH,SAAS,IAAI,CAAC,CAAwC;IACpD,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACpE,WAAW,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,WAAW,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;AAClB,CAAC;AAED,SAAS,QAAQ,CACf,CAAM,EACN,OAAe,EACf,OAAe,EACf,MAAgB,EAChB,OAAqB;IAErB,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACpC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACjC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IAC5C,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IAC5C,MAAM,IAAI,GAAe,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,IAAI,IAAI,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,IAAI,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACnC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,GAAiB,EAAE,EAAE;QAC3C,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC;IACF,IAAI,MAAoC,CAAC;IACzC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACb,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC7B,IAAI,MAAM;YAAE,MAAM;QAClB,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QAChB,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAa,CAAC,CAAC,+BAA+B;YACjG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC;gBAAE,SAAS,CAAC,6CAA6C;YACtF,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC;YACtC,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;gBAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;gBAClC,uCAAuC;gBACvC,MAAM,KAAK,GAAG,CAAC,CAAS,EAAgC,EAAE;oBACxD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAW,CAAC;oBACzB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;oBACnC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;wBAAE,OAAO,SAAS,CAAC,CAAC,8CAA8C;oBACrF,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACtB,MAAM,EAAE,GAAG,CAAC,CAAC;oBACb,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;oBACvB,OAAO;wBACJ,EAAE,CAAC,EAAE,CAAY,GAAG,CAAC,GAAG,CAAE,EAAE,CAAC,EAAE,CAAY,GAAI,EAAE,CAAC,EAAE,CAAY,CAAC;wBACjE,EAAE,CAAC,EAAE,CAAY,GAAG,CAAC,GAAG,CAAE,EAAE,CAAC,EAAE,CAAY,GAAI,EAAE,CAAC,EAAE,CAAY,CAAC;qBACnE,CAAC;gBACJ,CAAC,CAAC;gBACF,MAAM,GAAG,GAAwC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACzE,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAa,CAAC;gBACjC,MAAM,IAAI,GAAG,CAAC,CAAmB,EAAE,CAAmB,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5F,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;oBAClB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAW,CAAqB,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAW,CAAqB,CAAC,CAAC;qBACxF,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1B,8DAA8D;oBAC9D,MAAM,MAAM,GAAG,CAAE,CAAC,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAC,CAAY,GAAI,CAAC,CAAC,CAAC,CAAY,CAAC,GAAG,CAAC,CAAC;oBAC/F,MAAM,CAAC,GAAG,GAA8B,CAAC;oBACzC,MAAM,kBAAkB,GAAI,CAAC,CAAC,CAAC,CAAY,IAAI,CAAC,CAAC;oBACjD,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,KAAK,kBAAkB,CAAC,CAAC,oHAAoH;oBAC7K,IAAI,YAAY,EAAE,CAAC;wBACjB,IAAI,CAAC,CAAC,CAAC,CAAC,CAAqB,EAAE,CAAC,CAAC,CAAC,CAAqB,CAAC,CAAC;wBACzD,IAAI,CAAC,CAAC,CAAC,CAAC,CAAqB,EAAE,CAAC,CAAC,CAAC,CAAqB,CAAC,CAAC;oBAC3D,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,CAAC,CAAC,CAAC,CAAqB,EAAE,CAAC,CAAC,CAAC,CAAqB,CAAC,CAAC;wBACzD,IAAI,CAAC,CAAC,CAAC,CAAC,CAAqB,EAAE,CAAC,CAAC,CAAC,CAAqB,CAAC,CAAC;oBAC3D,CAAC;gBACH,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;QACD,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1B,IAAI,EAAE,CAAC;IACT,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;AACxD,CAAC;AAED,SAAS,SAAS,CAAC,IAAc;IAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACpD,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;QAC7B,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAW,CAAC;QACjC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAW,CAAC;QACrC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAW,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACd,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC;YACtB,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC;QACxB,CAAC;IACH,CAAC;IACD,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,CAAM,EACN,OAAe,EACf,OAAe,EACf,UAA6C,EAAE;IAE/C,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IAC3F,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAa,CAAC;IACjC,OAAO,EAAE,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,YAAY,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;AACnF,CAAC;AASD;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,CAAM,EACN,OAAe,EACf,OAAe,EACf,UAAgE,EAAE;IAElE,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAC5B,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,GAAG,CAAC,CACT,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EACpD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CACrD,CAAC;gBACF,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvB,IAAI,CAAC,GAAG,EAAE;wBAAE,EAAE,GAAG,CAAC,CAAC;oBACnB,IAAI,CAAC,GAAG,EAAE;wBAAE,EAAE,GAAG,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAC;QACjC,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC5G,CAAC;IACD,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAC7E,OAAO;QACL,MAAM;QACN,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAChC,KAAK;YACL,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAa,CAAC;YACxC,YAAY,EAAG,IAAI,CAAC,CAAC,CAAc,CAAC,MAAM,GAAG,CAAC;SAC/C,CAAC,CAAC;QACH,QAAQ,EAAE,CAAC;KACZ,CAAC;AACJ,CAAC;AAgBD,6HAA6H;AAC7H,MAAM,UAAU,cAAc,CAC5B,EAAO,EACP,EAAO,EACP,OAAe,EACf,OAAe,EACf,UAAwB,EAAE;IAE1B,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,OAAO,OAAO,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACjH,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC1B,WAAW,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACzB,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACjC,WAAW,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC;IACrB,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC/C,MAAM,CAAC,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC/C,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,MAAoC,CAAC;IACzC,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,MAAM;YAAE,MAAM;QAClB,MAAM,CAAC,GAAG,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACpG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9B,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACtG,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;YACvB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACnB,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7C,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACT,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACxB,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG;oBAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAW,CAAC;YACvC,CAAC;QACH,CAAC;QACD,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,EAAE,CAAC;IACT,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC;IACtB,OAAO;QACL,OAAO,EAAE,IAAI;QACb,IAAI,EAAE,IAAI;QACV,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAChB,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAChB,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAChB,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAChB,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QACxB,YAAY,EAAE,GAAG;QACjB,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,CAAC;KACtC,CAAC;AACJ,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,11 @@
+export type { Budget, Cancellable, Progress } from "./budget.ts";
+export { type ComplexFn, type ComplexRaster, type ComplexRasterOptions, type ConformalGridOptions, type ConformalLine, conformalGrid, findZerosAndPoles, sampleComplexRaster, type ZeroOrPole, type ZerosPoles, type ZerosPolesOptions, } from "./complex.ts";
+export { type Contours, type GradientField, type Grid2Options, type ImplicitCurve, sampleContours, sampleGradient, sampleImplicit, } from "./field2d.ts";
+export { type Curve3, type CurveFn3, type CurveOptions, curve3Runs, type Fn2, type Mesh, type MeshOptions, type ParametricSurfaceFn, sampleParametricSurface, sampleSpaceCurve, sampleSurface, sampleVectorField3, type VectorField3, type VectorField3Options, type VectorFn3, } from "./mesh.ts";
+export { type AdaptiveOdeOptions, classifyFixedPoint, type Field2, type FixedPoint, type FixedPointType, integrateAdaptive, integrateRk4, jacobian2, type OdeOptions, type PhasePortrait, type PhasePortraitOptions, type Rk4Options, type Slope, type SlopeField, type SlopeFieldOptions, type SolutionCurveOptions, type StopReason, type System, samplePhasePortrait, sampleSlopeField, sampleSolutionCurve, type Trajectory, } from "./ode.ts";
+export { type AdaptiveOptions, type CancelSignal, type Domain, type Fn1, findCrossings, findDiscontinuities, findIntersections, findRoots, type Point, type RootOptions, runsOf, SampleCancelledError, type SampleOptions, type Samples, sampleAdaptive, sampleUniform, toPoints, type YRange, } from "./sample.ts";
+export { evaluateFourier, evaluateTaylor, type FourierCoefficients, fourierCoefficients, type NumericSeries, type PartialSumCurves, partialSums, sampleFourierPartialSums, sampleSeriesPartialSums, sampleTaylorPartialSums, } from "./series.ts";
+export { type AxesOptions, axesToSvg, type PathOptions, samplesToSvgPath, svgDocument, type XY } from "./svg.ts";
+export { formatTick, niceTicks, tickStep } from "./ticks.ts";
+export { backingStoreSize, fitViewport, panViewport, pinchZoomFactor, toDataX, toDataY, toScreenX, toScreenY, type Viewport, viewportFromAnchor, wheelZoomFactor, zoomViewport, } from "./viewport.ts";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,YAAY,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACjE,OAAO,EACL,KAAK,SAAS,EACd,KAAK,aAAa,EAClB,KAAK,oBAAoB,EACzB,KAAK,oBAAoB,EACzB,KAAK,aAAa,EAClB,aAAa,EACb,iBAAiB,EACjB,mBAAmB,EACnB,KAAK,UAAU,EACf,KAAK,UAAU,EACf,KAAK,iBAAiB,GACvB,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,KAAK,QAAQ,EACb,KAAK,aAAa,EAClB,KAAK,YAAY,EACjB,KAAK,aAAa,EAClB,cAAc,EACd,cAAc,EACd,cAAc,GACf,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,KAAK,MAAM,EACX,KAAK,QAAQ,EACb,KAAK,YAAY,EACjB,UAAU,EACV,KAAK,GAAG,EACR,KAAK,IAAI,EACT,KAAK,WAAW,EAChB,KAAK,mBAAmB,EACxB,uBAAuB,EACvB,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,KAAK,YAAY,EACjB,KAAK,mBAAmB,EACxB,KAAK,SAAS,GACf,MAAM,WAAW,CAAC;AACnB,OAAO,EACL,KAAK,kBAAkB,EACvB,kBAAkB,EAClB,KAAK,MAAM,EACX,KAAK,UAAU,EACf,KAAK,cAAc,EACnB,iBAAiB,EACjB,YAAY,EACZ,SAAS,EACT,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,oBAAoB,EACzB,KAAK,UAAU,EACf,KAAK,KAAK,EACV,KAAK,UAAU,EACf,KAAK,iBAAiB,EACtB,KAAK,oBAAoB,EACzB,KAAK,UAAU,EACf,KAAK,MAAM,EACX,mBAAmB,EACnB,gBAAgB,EAChB,mBAAmB,EACnB,KAAK,UAAU,GAChB,MAAM,UAAU,CAAC;AAClB,OAAO,EACL,KAAK,eAAe,EACpB,KAAK,YAAY,EACjB,KAAK,MAAM,EACX,KAAK,GAAG,EACR,aAAa,EACb,mBAAmB,EACnB,iBAAiB,EACjB,SAAS,EACT,KAAK,KAAK,EACV,KAAK,WAAW,EAChB,MAAM,EACN,oBAAoB,EACpB,KAAK,aAAa,EAClB,KAAK,OAAO,EACZ,cAAc,EACd,aAAa,EACb,QAAQ,EACR,KAAK,MAAM,GACZ,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,eAAe,EACf,cAAc,EACd,KAAK,mBAAmB,EACxB,mBAAmB,EACnB,KAAK,aAAa,EAClB,KAAK,gBAAgB,EACrB,WAAW,EACX,wBAAwB,EACxB,uBAAuB,EACvB,uBAAuB,GACxB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,KAAK,WAAW,EAAE,SAAS,EAAE,KAAK,WAAW,EAAE,gBAAgB,EAAE,WAAW,EAAE,KAAK,EAAE,EAAE,MAAM,UAAU,CAAC;AACjH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,WAAW,EACX,eAAe,EACf,OAAO,EACP,OAAO,EACP,SAAS,EACT,SAAS,EACT,KAAK,QAAQ,EACb,kBAAkB,EAClB,eAAe,EACf,YAAY,GACb,MAAM,eAAe,CAAC"}

package/dist/index.js

@@ -0,0 +1,10 @@
+export { conformalGrid, findZerosAndPoles, sampleComplexRaster, } from "./complex.js";
+export { sampleContours, sampleGradient, sampleImplicit, } from "./field2d.js";
+export { curve3Runs, sampleParametricSurface, sampleSpaceCurve, sampleSurface, sampleVectorField3, } from "./mesh.js";
+export { classifyFixedPoint, integrateAdaptive, integrateRk4, jacobian2, samplePhasePortrait, sampleSlopeField, sampleSolutionCurve, } from "./ode.js";
+export { findCrossings, findDiscontinuities, findIntersections, findRoots, runsOf, SampleCancelledError, sampleAdaptive, sampleUniform, toPoints, } from "./sample.js";
+export { evaluateFourier, evaluateTaylor, fourierCoefficients, partialSums, sampleFourierPartialSums, sampleSeriesPartialSums, sampleTaylorPartialSums, } from "./series.js";
+export { axesToSvg, samplesToSvgPath, svgDocument } from "./svg.js";
+export { formatTick, niceTicks, tickStep } from "./ticks.js";
+export { backingStoreSize, fitViewport, panViewport, pinchZoomFactor, toDataX, toDataY, toScreenX, toScreenY, viewportFromAnchor, wheelZoomFactor, zoomViewport, } from "./viewport.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAML,aAAa,EACb,iBAAiB,EACjB,mBAAmB,GAIpB,MAAM,cAAc,CAAC;AACtB,OAAO,EAKL,cAAc,EACd,cAAc,EACd,cAAc,GACf,MAAM,cAAc,CAAC;AACtB,OAAO,EAIL,UAAU,EAKV,uBAAuB,EACvB,gBAAgB,EAChB,aAAa,EACb,kBAAkB,GAInB,MAAM,WAAW,CAAC;AACnB,OAAO,EAEL,kBAAkB,EAIlB,iBAAiB,EACjB,YAAY,EACZ,SAAS,EAWT,mBAAmB,EACnB,gBAAgB,EAChB,mBAAmB,GAEpB,MAAM,UAAU,CAAC;AAClB,OAAO,EAKL,aAAa,EACb,mBAAmB,EACnB,iBAAiB,EACjB,SAAS,EAGT,MAAM,EACN,oBAAoB,EAGpB,cAAc,EACd,aAAa,EACb,QAAQ,GAET,MAAM,aAAa,CAAC;AACrB,OAAO,EACL,eAAe,EACf,cAAc,EAEd,mBAAmB,EAGnB,WAAW,EACX,wBAAwB,EACxB,uBAAuB,EACvB,uBAAuB,GACxB,MAAM,aAAa,CAAC;AACrB,OAAO,EAAoB,SAAS,EAAoB,gBAAgB,EAAE,WAAW,EAAW,MAAM,UAAU,CAAC;AACjH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAC7D,OAAO,EACL,gBAAgB,EAChB,WAAW,EACX,WAAW,EACX,eAAe,EACf,OAAO,EACP,OAAO,EACP,SAAS,EACT,SAAS,EAET,kBAAkB,EAClB,eAAe,EACf,YAAY,GACb,MAAM,eAAe,CAAC"}

package/dist/mesh.d.ts

@@ -0,0 +1,90 @@
+import { type Budget, type Cancellable, type Progress } from "./budget.ts";
+import type { Domain } from "./sample.ts";
+/**
+ * Triangle mesh as typed arrays, ready for a GPU buffer.
+ *
+ * - `positions` and `normals` hold `vertexCount * 3` floats (x, y, z per vertex).
+ * - `indices` holds triangles (3 per triangle), counter-clockwise seen from the side the normals point to.
+ * - A grid vertex whose position is not finite (or is outside `zRange`) is a hole: its position is `NaN`, its normal
+ *   is `0, 0, 0`, `valid[v]` is 0, and no triangle references it, so a hole never produces a spike.
+ * - `bounds` covers the valid vertices only (`NaN`s if there are none).
+ * - `columns` x `rows` is the vertex grid (vertex `(i, j)` is `j * columns + i`), for callers that want to build wireframes.
+ */
+export interface Mesh {
+    positions: Float32Array;
+    normals: Float32Array;
+    indices: Uint32Array;
+    valid: Uint8Array;
+    vertexCount: number;
+    columns: number;
+    rows: number;
+    bounds: {
+        min: [number, number, number];
+        max: [number, number, number];
+    };
+    progress: Progress;
+}
+export interface MeshOptions extends Budget, Cancellable {
+    /** Vertices along the first parameter (x or u). Default 64. */
+    columns?: number;
+    /** Vertices along the second parameter (y or v). Default 64. */
+    rows?: number;
+    /** Vertices with z outside this range are holes (a pole's huge finite shoulders). `z = f(x, y)` only. */
+    zRange?: {
+        min: number;
+        max: number;
+    };
+}
+export type Fn2 = (x: number, y: number) => number;
+export type ParametricSurfaceFn = (u: number, v: number) => readonly [number, number, number];
+export type CurveFn3 = (t: number) => readonly [number, number, number];
+export type VectorFn3 = (x: number, y: number, z: number) => readonly [number, number, number];
+/**
+ * Sample the surface `z = f(x, y)` on a regular grid. Normals point up (`+z` side). Non-finite values, and
+ * values outside `options.zRange`, become holes. When the budget ends early, `rows` is the number of grid
+ * rows built and `progress` says why.
+ */
+export declare function sampleSurface(f: Fn2, xDomain: Domain, yDomain: Domain, options?: MeshOptions): Mesh;
+/**
+ * Sample a parametric surface `(u, v) -> [x, y, z]`. Normals are `dP/du x dP/dv`, so swap the parameters (or
+ * negate a component) to flip them. Any non-finite coordinate makes the vertex a hole.
+ */
+export declare function sampleParametricSurface(f: ParametricSurfaceFn, uDomain: Domain, vDomain: Domain, options?: MeshOptions): Mesh;
+export interface Curve3 {
+    /** `count * 3` doubles. A gap row is `NaN, NaN, NaN`; gaps are never first, last or adjacent to another gap. */
+    positions: Float64Array;
+    /** The parameter value of each row. */
+    t: Float64Array;
+    count: number;
+    progress: Progress;
+}
+export interface CurveOptions extends Budget, Cancellable {
+    /** Samples. Default 512. */
+    samples?: number;
+    /** Segments longer than this (Euclidean) become gaps, which cuts a curve at a jump. Default: no limit. */
+    maxStep?: number;
+}
+/** Sample a space curve `t -> [x, y, z]`; non-finite points become gaps rather than spikes. */
+export declare function sampleSpaceCurve(f: CurveFn3, tDomain: Domain, options?: CurveOptions): Curve3;
+/** Index ranges `[start, end)` of consecutive data rows in a {@link Curve3}. */
+export declare function curve3Runs(c: Curve3): Array<[number, number]>;
+export interface VectorField3 {
+    /** `count * 3` floats: arrow tails. */
+    origins: Float32Array;
+    /** `count * 3` floats: the vector at each tail. */
+    vectors: Float32Array;
+    magnitudes: Float32Array;
+    maxMagnitude: number;
+    /** Arrows kept: grid points where the field was finite. */
+    count: number;
+    /** Grid points skipped because the field was non-finite there. */
+    skipped: number;
+    progress: Progress;
+}
+export interface VectorField3Options extends Budget, Cancellable {
+    /** Points per axis, `[nx, ny, nz]` or one number for all. Default 8. */
+    grid?: number | [number, number, number];
+}
+/** Sample a 3D vector field on a regular grid of the box `x` by `y` by `z`. `progress.rows` counts z-slabs. */
+export declare function sampleVectorField3(f: VectorFn3, xDomain: Domain, yDomain: Domain, zDomain: Domain, options?: VectorField3Options): VectorField3;
+//# sourceMappingURL=mesh.d.ts.map

package/dist/mesh.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mesh.d.ts","sourceRoot":"","sources":["../src/mesh.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;;;;;;;;;GASG;AACH,MAAM,WAAW,IAAI;IACnB,SAAS,EAAE,YAAY,CAAC;IACxB,OAAO,EAAE,YAAY,CAAC;IACtB,OAAO,EAAE,WAAW,CAAC;IACrB,KAAK,EAAE,UAAU,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE;QAAE,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAAC,GAAG,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;KAAE,CAAC;IACzE,QAAQ,EAAE,QAAQ,CAAC;CACpB;AAED,MAAM,WAAW,WAAY,SAAQ,MAAM,EAAE,WAAW;IACtD,+DAA+D;IAC/D,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,gEAAgE;IAChE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,yGAAyG;IACzG,MAAM,CAAC,EAAE;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;CACvC;AAED,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;AACnD,MAAM,MAAM,mBAAmB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAC9F,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACxE,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAoJ/F;;;;GAIG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAE,WAAgB,GAAG,IAAI,CAEvG;AAED;;;GAGG;AACH,wBAAgB,uBAAuB,CACrC,CAAC,EAAE,mBAAmB,EACtB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,WAAgB,GACxB,IAAI,CAEN;AAED,MAAM,WAAW,MAAM;IACrB,gHAAgH;IAChH,SAAS,EAAE,YAAY,CAAC;IACxB,uCAAuC;IACvC,CAAC,EAAE,YAAY,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,QAAQ,CAAC;CACpB;AAED,MAAM,WAAW,YAAa,SAAQ,MAAM,EAAE,WAAW;IACvD,4BAA4B;IAC5B,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,0GAA0G;IAC1G,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,+FAA+F;AAC/F,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAE,YAAiB,GAAG,MAAM,CA4DjG;AAED,gFAAgF;AAChF,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAW7D;AAED,MAAM,WAAW,YAAY;IAC3B,uCAAuC;IACvC,OAAO,EAAE,YAAY,CAAC;IACtB,mDAAmD;IACnD,OAAO,EAAE,YAAY,CAAC;IACtB,UAAU,EAAE,YAAY,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,2DAA2D;IAC3D,KAAK,EAAE,MAAM,CAAC;IACd,kEAAkE;IAClE,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,QAAQ,CAAC;CACpB;AAED,MAAM,WAAW,mBAAoB,SAAQ,MAAM,EAAE,WAAW;IAC9D,wEAAwE;IACxE,IAAI,CAAC,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;CAC1C;AAED,+GAA+G;AAC/G,wBAAgB,kBAAkB,CAChC,CAAC,EAAE,SAAS,EACZ,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,mBAAwB,GAChC,YAAY,CAiDd"}

package/dist/mesh.js

@@ -0,0 +1,294 @@
+import { assertCount, assertRange, Meter, progress } from "./budget.js";
+const fin = (a, b, c) => Number.isFinite(a) && Number.isFinite(b) && Number.isFinite(c);
+function build(evalAt, uDom, vDom, options, rangeZ, flip) {
+    const columns = options.columns ?? 64;
+    const rows = options.rows ?? 64;
+    assertCount("columns", columns);
+    assertCount("rows", rows);
+    assertRange("u domain", uDom);
+    assertRange("v domain", vDom);
+    const meter = new Meter(options, options);
+    const pos = new Float64Array(columns * rows * 3).fill(Number.NaN);
+    const ok = new Uint8Array(columns * rows);
+    let done = 0;
+    let reason;
+    for (let j = 0; j < rows; j++) {
+        reason = meter.check(columns);
+        if (reason)
+            break;
+        const v = j === rows - 1 ? vDom.max : vDom.min + ((vDom.max - vDom.min) * j) / (rows - 1);
+        for (let i = 0; i < columns; i++) {
+            const u = i === columns - 1 ? uDom.max : uDom.min + ((uDom.max - uDom.min) * i) / (columns - 1);
+            const p = evalAt(u, v);
+            const k = j * columns + i;
+            if (fin(p[0], p[1], p[2]) && !(rangeZ && (p[2] < rangeZ.min || p[2] > rangeZ.max))) {
+                pos[3 * k] = p[0];
+                pos[3 * k + 1] = p[1];
+                pos[3 * k + 2] = p[2];
+                ok[k] = 1;
+            }
+        }
+        meter.spend(columns);
+        done++;
+    }
+    const usedRows = done;
+    const vertexCount = columns * usedRows;
+    const positions = new Float32Array(vertexCount * 3);
+    const normals = new Float32Array(vertexCount * 3);
+    const valid = ok.slice(0, vertexCount);
+    const min = [Infinity, Infinity, Infinity];
+    const max = [-Infinity, -Infinity, -Infinity];
+    for (let k = 0; k < vertexCount; k++) {
+        for (let c = 0; c < 3; c++) {
+            const val = pos[3 * k + c];
+            positions[3 * k + c] = val;
+            if (valid[k]) {
+                if (val < min[c])
+                    min[c] = val;
+                if (val > max[c])
+                    max[c] = val;
+            }
+        }
+    }
+    // normals: cross of central/one-sided differences over valid neighbours
+    const at = (i, j) => 3 * (j * columns + i);
+    const isOk = (i, j) => i >= 0 && i < columns && j >= 0 && j < usedRows && valid[j * columns + i] === 1;
+    for (let j = 0; j < usedRows; j++) {
+        for (let i = 0; i < columns; i++) {
+            if (!isOk(i, j))
+                continue;
+            const iA = isOk(i - 1, j) ? i - 1 : i;
+            const iB = isOk(i + 1, j) ? i + 1 : i;
+            const jA = isOk(i, j - 1) ? j - 1 : j;
+            const jB = isOk(i, j + 1) ? j + 1 : j;
+            const du = [0, 1, 2].map((c) => pos[at(iB, j) + c] - pos[at(iA, j) + c]);
+            const dv = [0, 1, 2].map((c) => pos[at(i, jB) + c] - pos[at(i, jA) + c]);
+            let nx = du[1] * dv[2] - du[2] * dv[1];
+            let ny = du[2] * dv[0] - du[0] * dv[2];
+            let nz = du[0] * dv[1] - du[1] * dv[0];
+            const len = Math.hypot(nx, ny, nz);
+            if (len > 0 && Number.isFinite(len)) {
+                const s = (flip ? -1 : 1) / len;
+                nx *= s;
+                ny *= s;
+                nz *= s;
+                const o = at(i, j);
+                normals[o] = nx;
+                normals[o + 1] = ny;
+                normals[o + 2] = nz;
+            }
+        }
+    }
+    // valid vertices with a degenerate normal (the poles of a sphere parameterisation): borrow from a neighbour
+    for (let j = 0; j < usedRows; j++) {
+        for (let i = 0; i < columns; i++) {
+            const o = at(i, j);
+            if (!isOk(i, j) || normals[o] !== 0 || normals[o + 1] !== 0 || normals[o + 2] !== 0)
+                continue;
+            for (const [di, dj] of [
+                [0, 1],
+                [0, -1],
+                [1, 0],
+                [-1, 0],
+                [0, 2],
+                [0, -2],
+            ]) {
+                if (!isOk(i + di, j + dj))
+                    continue;
+                const q = at(i + di, j + dj);
+                if (normals[q] !== 0 || normals[q + 1] !== 0 || normals[q + 2] !== 0) {
+                    normals[o] = normals[q];
+                    normals[o + 1] = normals[q + 1];
+                    normals[o + 2] = normals[q + 2];
+                    break;
+                }
+            }
+        }
+    }
+    if (!valid.some((x) => x === 1)) {
+        for (let c = 0; c < 3; c++) {
+            min[c] = Number.NaN;
+            max[c] = Number.NaN;
+        }
+    }
+    const tri = [];
+    for (let j = 0; j + 1 < usedRows; j++) {
+        for (let i = 0; i + 1 < columns; i++) {
+            const a = j * columns + i;
+            const b = a + 1;
+            const c = a + columns;
+            const d = c + 1;
+            const [va, vb, vc, vd] = [valid[a], valid[b], valid[c], valid[d]];
+            // counter-clockwise in (u, v): a, b, d and a, d, c
+            if (va && vb && vd)
+                tri.push(a, b, d);
+            if (va && vd && vc)
+                tri.push(a, d, c);
+            // a quad with exactly one hole corner still yields its one good triangle via the complementary split
+            if (!(va && vb && vd) && !(va && vd && vc)) {
+                if (va && vb && vc)
+                    tri.push(a, b, c);
+                else if (vb && vd && vc)
+                    tri.push(b, d, c);
+            }
+        }
+    }
+    return {
+        positions,
+        normals,
+        indices: Uint32Array.from(tri),
+        valid,
+        vertexCount,
+        columns,
+        rows: usedRows,
+        bounds: { min, max },
+        progress: progress(usedRows, rows, reason),
+    };
+}
+/**
+ * Sample the surface `z = f(x, y)` on a regular grid. Normals point up (`+z` side). Non-finite values, and
+ * values outside `options.zRange`, become holes. When the budget ends early, `rows` is the number of grid
+ * rows built and `progress` says why.
+ */
+export function sampleSurface(f, xDomain, yDomain, options = {}) {
+    return build((x, y) => [x, y, f(x, y)], xDomain, yDomain, options, options.zRange, false);
+}
+/**
+ * Sample a parametric surface `(u, v) -> [x, y, z]`. Normals are `dP/du x dP/dv`, so swap the parameters (or
+ * negate a component) to flip them. Any non-finite coordinate makes the vertex a hole.
+ */
+export function sampleParametricSurface(f, uDomain, vDomain, options = {}) {
+    return build(f, uDomain, vDomain, { ...options, zRange: undefined }, undefined, false);
+}
+/** Sample a space curve `t -> [x, y, z]`; non-finite points become gaps rather than spikes. */
+export function sampleSpaceCurve(f, tDomain, options = {}) {
+    const n = options.samples ?? 512;
+    assertCount("samples", n);
+    assertRange("t domain", tDomain);
+    const meter = new Meter(options, options);
+    const rows = [];
+    const ts = [];
+    let done = 0;
+    let reason;
+    const CHUNK = 256;
+    for (let k = 0; k < n; k++) {
+        if (k % CHUNK === 0) {
+            reason = meter.check(Math.min(CHUNK, n - k));
+            if (reason)
+                break;
+        }
+        const t = k === n - 1 ? tDomain.max : tDomain.min + ((tDomain.max - tDomain.min) * k) / (n - 1);
+        const p = f(t);
+        ts.push(t);
+        rows.push(fin(p[0], p[1], p[2]) ? p[0] : Number.NaN, p[1], p[2]);
+        meter.spend(1);
+        done++;
+    }
+    // gap rule: NaN rows, with maxStep cuts, no leading/trailing/adjacent gaps
+    const outP = [];
+    const outT = [];
+    let prev; // index into rows of previous valid row
+    let pendingGap = false;
+    for (let k = 0; k < done; k++) {
+        const x = rows[3 * k];
+        if (Number.isNaN(x)) {
+            pendingGap = outP.length > 0;
+            prev = undefined;
+            continue;
+        }
+        const y = rows[3 * k + 1];
+        const z = rows[3 * k + 2];
+        let gap = pendingGap;
+        if (prev !== undefined && options.maxStep !== undefined) {
+            const d = Math.hypot(x - rows[3 * prev], y - rows[3 * prev + 1], z - rows[3 * prev + 2]);
+            if (d > options.maxStep)
+                gap = true;
+        }
+        if (gap && outP.length > 0) {
+            outP.push(Number.NaN, Number.NaN, Number.NaN);
+            outT.push(Number.NaN);
+        }
+        outP.push(x, y, z);
+        outT.push(ts[k]);
+        prev = k;
+        pendingGap = false;
+    }
+    return {
+        positions: Float64Array.from(outP),
+        t: Float64Array.from(outT),
+        count: outT.length,
+        progress: progress(done, n, reason),
+    };
+}
+/** Index ranges `[start, end)` of consecutive data rows in a {@link Curve3}. */
+export function curve3Runs(c) {
+    const runs = [];
+    let start = -1;
+    for (let k = 0; k < c.count; k++) {
+        if (Number.isNaN(c.positions[3 * k])) {
+            if (start >= 0)
+                runs.push([start, k]);
+            start = -1;
+        }
+        else if (start < 0)
+            start = k;
+    }
+    if (start >= 0)
+        runs.push([start, c.count]);
+    return runs;
+}
+/** Sample a 3D vector field on a regular grid of the box `x` by `y` by `z`. `progress.rows` counts z-slabs. */
+export function sampleVectorField3(f, xDomain, yDomain, zDomain, options = {}) {
+    const g = options.grid ?? 8;
+    const [nx, ny, nz] = typeof g === "number" ? [g, g, g] : g;
+    assertCount("grid", nx);
+    assertCount("grid", ny);
+    assertCount("grid", nz);
+    assertRange("x domain", xDomain);
+    assertRange("y domain", yDomain);
+    assertRange("z domain", zDomain);
+    const meter = new Meter(options, options);
+    const o = [];
+    const vs = [];
+    const mags = [];
+    let skipped = 0;
+    let slabs = 0;
+    let reason;
+    const lerp = (d, k, n) => (k === n - 1 ? d.max : d.min + ((d.max - d.min) * k) / (n - 1));
+    for (let kz = 0; kz < nz; kz++) {
+        reason = meter.check(nx * ny);
+        if (reason)
+            break;
+        for (let jy = 0; jy < ny; jy++) {
+            for (let ix = 0; ix < nx; ix++) {
+                const x = lerp(xDomain, ix, nx);
+                const y = lerp(yDomain, jy, ny);
+                const z = lerp(zDomain, kz, nz);
+                const v = f(x, y, z);
+                if (!fin(v[0], v[1], v[2])) {
+                    skipped++;
+                    continue;
+                }
+                o.push(x, y, z);
+                vs.push(v[0], v[1], v[2]);
+                mags.push(Math.hypot(v[0], v[1], v[2]));
+            }
+        }
+        meter.spend(nx * ny);
+        slabs++;
+    }
+    let maxMagnitude = 0;
+    for (const m of mags)
+        if (m > maxMagnitude)
+            maxMagnitude = m;
+    return {
+        origins: Float32Array.from(o),
+        vectors: Float32Array.from(vs),
+        magnitudes: Float32Array.from(mags),
+        maxMagnitude,
+        count: mags.length,
+        skipped,
+        progress: progress(slabs, nz, reason),
+    };
+}
+//# sourceMappingURL=mesh.js.map