@visactor/vutils 1.0.25 → 1.0.26

package/cjs/common/regression-solver.js

@@ -0,0 +1,180 @@
+"use strict";
+
+function regressionPoints(data, x, y) {
+    const points = [];
+    return data.forEach((d => {
+        const a = x(d), b = y(d);
+        // 保留既有 accessor 对缺失观测的排除行为；无穷大不是可拟合观测。
+        null != a && null != b && Number.isFinite(+a) && Number.isFinite(+b) && points.push({
+            x: +a,
+            y: +b
+        });
+    })), points;
+}
+
+function normalizeRegression(value, center, scale) {
+    const delta = value - center;
+    return Number.isFinite(delta) ? delta / scale : value / scale - center / scale;
+}
+
+function regressionBasis(points) {
+    let xMin = 1 / 0, xMax = -1 / 0, yMin = 1 / 0, yMax = -1 / 0;
+    for (const p of points) xMin = Math.min(xMin, p.x), xMax = Math.max(xMax, p.x), 
+    yMin = Math.min(yMin, p.y), yMax = Math.max(yMax, p.y);
+    if (!points.length) return {
+        xCenter: 0,
+        xScale: 1,
+        yCenter: 0,
+        yScale: 1
+    };
+    const xCenter = xMin / 2 + xMax / 2, yCenter = yMin / 2 + yMax / 2;
+    return {
+        xCenter: xCenter,
+        yCenter: yCenter,
+        xScale: Math.max(Math.abs(xMin - xCenter), Math.abs(xMax - xCenter)) || 1,
+        yScale: Math.max(Math.abs(yMin - yCenter), Math.abs(yMax - yCenter)) || 1
+    };
+}
+
+/** 秩不足时对 QR 的小型 R 做单边 Jacobi SVD，获得明确的最小范数解。 */
+function minimumNorm(r, rhs) {
+    const p = rhs.length, a = r.map((row => row.slice())), v = Array.from({
+        length: p
+    }, ((_, i) => Array.from({
+        length: p
+    }, ((_, j) => +(i === j)))));
+    for (let sweep = 0; sweep < 50; sweep++) {
+        let changed = !1;
+        for (let j = 0; j < p - 1; j++) for (let k = j + 1; k < p; k++) {
+            let aa = 0, bb = 0, ab = 0;
+            for (let i = 0; i < p; i++) aa += a[i][j] ** 2, bb += a[i][k] ** 2, ab += a[i][j] * a[i][k];
+            if (Math.abs(ab) <= 8 * Number.EPSILON * Math.sqrt(aa * bb)) continue;
+            changed = !0;
+            const tau = (bb - aa) / (2 * ab), t = (tau >= 0 ? 1 : -1) / (Math.abs(tau) + Math.hypot(1, tau)), c = 1 / Math.hypot(1, t), s = c * t;
+            for (let i = 0; i < p; i++) {
+                const aj = a[i][j], ak = a[i][k], vj = v[i][j], vk = v[i][k];
+                a[i][j] = c * aj - s * ak, a[i][k] = s * aj + c * ak, v[i][j] = c * vj - s * vk, 
+                v[i][k] = s * vj + c * vk;
+            }
+        }
+        if (!changed) break;
+    }
+    const norms = Array.from({
+        length: p
+    }, ((_, j) => Math.hypot(...a.map((row => row[j]))))), tolerance = Math.max(...norms) * Number.EPSILON * p * 64, coef = new Array(p).fill(0);
+    let rank = 0;
+    for (let j = 0; j < p; j++) {
+        if (norms[j] <= tolerance) continue;
+        rank++;
+        let projection = 0;
+        for (let i = 0; i < p; i++) projection += a[i][j] * rhs[i];
+        projection /= norms[j] ** 2;
+        for (let i = 0; i < p; i++) coef[i] += v[i][j] * projection;
+    }
+    return {
+        coef: coef,
+        rank: rank
+    };
+}
+
+function fitRegression(points, degree, basis = regressionBasis(points)) {
+    const p = degree + 1;
+    if (1 === degree) {
+        let mx = 0, my = 0, n = 0;
+        for (const row of points) n++, mx += (normalizeRegression(row.x, basis.xCenter, basis.xScale) - mx) / n, 
+        my += (normalizeRegression(row.y, basis.yCenter, basis.yScale) - my) / n;
+        let sxx = 0, sxy = 0;
+        for (const row of points) {
+            const dx = normalizeRegression(row.x, basis.xCenter, basis.xScale) - mx;
+            sxx += dx * dx, sxy += dx * (normalizeRegression(row.y, basis.yCenter, basis.yScale) - my);
+        }
+        const b = 0 === sxx ? 0 : sxy / sxx;
+        return {
+            coef: 0 === sxx ? [ my / (1 + mx * mx), mx * my / (1 + mx * mx) ] : [ my - b * mx, b ],
+            rank: 0 === n ? 0 : 0 === sxx ? 1 : 2,
+            basis: basis
+        };
+    }
+    const r = Array.from({
+        length: p
+    }, (() => new Array(p).fill(0))), rhs = new Array(p).fill(0), row = new Array(p);
+    for (const point of points) {
+        const z = normalizeRegression(point.x, basis.xCenter, basis.xScale);
+        row[0] = 1;
+        for (let j = 1; j < p; j++) row[j] = row[j - 1] * z;
+        let value = normalizeRegression(point.y, basis.yCenter, basis.yScale);
+        // 增量 Givens QR 仅保留 p×p 的 R，bootstrap 不分配 N×p 矩阵。
+                for (let j = 0; j < p; j++) {
+            const norm = Math.hypot(r[j][j], row[j]);
+            if (0 === norm) continue;
+            const c = r[j][j] / norm, s = row[j] / norm;
+            r[j][j] = norm;
+            for (let k = j + 1; k < p; k++) {
+                const previous = r[j][k];
+                r[j][k] = c * previous + s * row[k], row[k] = -s * previous + c * row[k];
+            }
+            const previous = rhs[j];
+            rhs[j] = c * previous + s * value, value = -s * previous + c * value;
+        }
+    }
+    const tolerance = Math.max(...r.map(((row, i) => Math.abs(row[i])))) * Number.EPSILON * p * 64;
+    if (r.some(((row, i) => Math.abs(row[i]) <= tolerance))) return Object.assign(Object.assign({}, minimumNorm(r, rhs)), {
+        basis: basis
+    });
+    const coef = new Array(p);
+    for (let i = p - 1; i >= 0; i--) {
+        let value = rhs[i];
+        for (let j = i + 1; j < p; j++) value -= r[i][j] * coef[j];
+        coef[i] = value / r[i][i];
+    }
+    return {
+        coef: coef,
+        rank: p,
+        basis: basis
+    };
+}
+
+function regressionPrediction(model, x) {
+    const z = normalizeRegression(x, model.basis.xCenter, model.basis.xScale);
+    let value = 0;
+    for (let j = model.coef.length - 1; j >= 0; j--) value = value * z + model.coef[j];
+    return model.basis.yCenter + model.basis.yScale * value;
+}
+
+/** 保留公开的升幂 coef；预测始终使用稳定基底。 */
+function regressionCoefficients(model) {
+    let coef = [ model.coef[model.coef.length - 1] ];
+    const a = -model.basis.xCenter / model.basis.xScale, b = 1 / model.basis.xScale;
+    for (let j = model.coef.length - 2; j >= 0; j--) {
+        const next = new Array(coef.length + 1).fill(0);
+        coef.forEach(((c, i) => {
+            next[i] += a * c, next[i + 1] += b * c;
+        })), next[0] += model.coef[j], coef = next;
+    }
+    if (coef = coef.map((c => c * model.basis.yScale)), coef[0] += model.basis.yCenter, 
+    coef.some((c => !Number.isFinite(c)))) throw new RangeError("Regression coefficients are not finite");
+    return coef;
+}
+
+function regressionGrid(min, max, count, predict) {
+    if (!Number.isInteger(count) || count <= 0 || !Number.isFinite(min) || !Number.isFinite(max)) return [];
+    const width = max - min, step = 1 === count ? 0 : width / (count - 1);
+    return Array.from({
+        length: count
+    }, ((_, i) => {
+        const t = 1 === count ? 0 : i / (count - 1), x = 0 === i ? min : i === count - 1 ? max : Number.isFinite(width) ? min + i * step : (1 - t) * min + t * max;
+        return {
+            x: x,
+            y: predict(x)
+        };
+    }));
+}
+
+Object.defineProperty(exports, "__esModule", {
+    value: !0
+}), exports.regressionGrid = exports.regressionCoefficients = exports.regressionPrediction = exports.fitRegression = exports.regressionBasis = exports.normalizeRegression = exports.regressionPoints = void 0, 
+exports.regressionPoints = regressionPoints, exports.normalizeRegression = normalizeRegression, 
+exports.regressionBasis = regressionBasis, exports.fitRegression = fitRegression, 
+exports.regressionPrediction = regressionPrediction, exports.regressionCoefficients = regressionCoefficients, 
+exports.regressionGrid = regressionGrid;
+//# sourceMappingURL=regression-solver.js.map

package/cjs/common/regression-solver.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/regression-solver.ts"],"names":[],"mappings":";;;AAYA,SAAgB,gBAAgB,CAAC,IAAoB,EAAE,CAAqB,EAAE,CAAqB;IACjG,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;QACf,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,uCAAuC;QACvC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;YACxE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;SAC/B;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AAXD,4CAWC;AAED,SAAgB,mBAAmB,CAAC,KAAa,EAAE,MAAc,EAAE,KAAa;IAC9E,MAAM,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC;IAC7B,OAAO,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,GAAG,MAAM,GAAG,KAAK,CAAC;AACjF,CAAC;AAHD,kDAGC;AAED,SAAgB,eAAe,CAAC,MAAkC;IAChE,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE;QACtB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;KAC5B;IACD,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;QAClB,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;KACzD;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACpC,OAAO;QACL,OAAO;QACP,OAAO;QACP,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC;QACzE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC;KAC1E,CAAC;AACJ,CAAC;AAtBD,0CAsBC;AAED,gDAAgD;AAChD,SAAS,WAAW,CAAC,CAAa,EAAE,GAAa;IAC/C,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;IACpC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,EAAE,EAAE,KAAK,EAAE,EAAE;QACvC,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC9B,IAAI,EAAE,GAAG,CAAC,CAAC;gBACX,IAAI,EAAE,GAAG,CAAC,CAAC;gBACX,IAAI,EAAE,GAAG,CAAC,CAAC;gBACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACnB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACnB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACzB;gBACD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE;oBAC3D,SAAS;iBACV;gBACD,OAAO,GAAG,IAAI,CAAC;gBACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;gBACjC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;gBACrE,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACnB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;oBAC1B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;oBAC1B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;oBAC1B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;iBAC3B;aACF;SACF;QACD,IAAI,CAAC,OAAO,EAAE;YACZ,MAAM;SACP;KACF;IACD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC,OAAO,GAAG,CAAC,GAAG,EAAE,CAAC;IAC/D,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,SAAS,EAAE;YACzB,SAAS;SACV;QACD,IAAI,EAAE,CAAC;QACP,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;SAChC;QACD,UAAU,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;SACjC;KACF;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC;AAED,SAAgB,aAAa,CAAC,MAAkC,EAAE,MAAc,EAAE,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC;IAC/G,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IACrB,IAAI,MAAM,KAAK,CAAC,EAAE;QAChB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE;YACxB,CAAC,EAAE,CAAC;YACJ,EAAE,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YACzE,EAAE,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;SAC1E;QACD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE;YACxB,MAAM,EAAE,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;YACxE,GAAG,IAAI,EAAE,GAAG,EAAE,CAAC;YACf,GAAG,IAAI,EAAE,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC;SAC5E;QACD,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;QACpC,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5F,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;KAC/D;IACD,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC1B,MAAM,CAAC,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACpE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;SACzB;QACD,IAAI,KAAK,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QACtE,iDAAiD;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,IAAI,KAAK,CAAC,EAAE;gBACd,SAAS;aACV;YACD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACzB,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACxB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC9B,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;aACrC;YACD,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC;YAClC,KAAK,GAAG,CAAC,CAAC,GAAG,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC;SACnC;KACF;IACD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,OAAO,GAAG,CAAC,GAAG,EAAE,CAAC;IAC7F,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,EAAE;QACrD,uCAAY,WAAW,CAAC,CAAC,EAAE,GAAG,CAAC,KAAE,KAAK,IAAG;KAC1C;IACD,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC/B,IAAI,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC9B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;SAC5B;QACD,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;KAC3B;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC;AAClC,CAAC;AAhED,sCAgEC;AAED,SAAgB,oBAAoB,CAAC,KAAuC,EAAE,CAAS;IACrF,MAAM,CAAC,GAAG,mBAAmB,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC/C,KAAK,GAAG,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACnC;IACD,OAAO,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC;AAC1D,CAAC;AAPD,oDAOC;AAED,+BAA+B;AAC/B,SAAgB,sBAAsB,CAAC,KAAuC;IAC5E,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;IACpD,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;QAC/C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxD,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACpB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,GAAG,IAAI,CAAC;KACb;IACD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC;IAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;QACvC,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;KAChE;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAnBD,wDAmBC;AAED,SAAgB,cAAc,CAAC,GAAW,EAAE,GAAW,EAAE,KAAa,EAAE,OAA8B;IACpG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;QAC5F,OAAO,EAAE,CAAC;KACX;IACD,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC;IACxB,MAAM,IAAI,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACnD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC5C,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QACpH,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9B,CAAC,CAAC,CAAC;AACL,CAAC;AAXD,wCAWC","file":"regression-solver.js","sourcesContent":["/** 回归共用的稳定坐标与小型最小二乘求解器；不构造 XᵀX。 */\nexport interface RegressionPoint {\n  x: number;\n  y: number;\n}\nexport interface RegressionBasis {\n  xCenter: number;\n  xScale: number;\n  yCenter: number;\n  yScale: number;\n}\n\nexport function regressionPoints(data: readonly any[], x: (d: any) => number, y: (d: any) => number) {\n  const points: RegressionPoint[] = [];\n  data.forEach(d => {\n    const a = x(d);\n    const b = y(d);\n    // 保留既有 accessor 对缺失观测的排除行为；无穷大不是可拟合观测。\n    if (a != null && b != null && Number.isFinite(+a) && Number.isFinite(+b)) {\n      points.push({ x: +a, y: +b });\n    }\n  });\n  return points;\n}\n\nexport function normalizeRegression(value: number, center: number, scale: number) {\n  const delta = value - center;\n  return Number.isFinite(delta) ? delta / scale : value / scale - center / scale;\n}\n\nexport function regressionBasis(points: readonly RegressionPoint[]): RegressionBasis {\n  let xMin = Infinity;\n  let xMax = -Infinity;\n  let yMin = Infinity;\n  let yMax = -Infinity;\n  for (const p of points) {\n    xMin = Math.min(xMin, p.x);\n    xMax = Math.max(xMax, p.x);\n    yMin = Math.min(yMin, p.y);\n    yMax = Math.max(yMax, p.y);\n  }\n  if (!points.length) {\n    return { xCenter: 0, xScale: 1, yCenter: 0, yScale: 1 };\n  }\n  const xCenter = xMin / 2 + xMax / 2;\n  const yCenter = yMin / 2 + yMax / 2;\n  return {\n    xCenter,\n    yCenter,\n    xScale: Math.max(Math.abs(xMin - xCenter), Math.abs(xMax - xCenter)) || 1,\n    yScale: Math.max(Math.abs(yMin - yCenter), Math.abs(yMax - yCenter)) || 1\n  };\n}\n\n/** 秩不足时对 QR 的小型 R 做单边 Jacobi SVD，获得明确的最小范数解。 */\nfunction minimumNorm(r: number[][], rhs: number[]) {\n  const p = rhs.length;\n  const a = r.map(row => row.slice());\n  const v = Array.from({ length: p }, (_, i) => Array.from({ length: p }, (_, j) => +(i === j)));\n  for (let sweep = 0; sweep < 50; sweep++) {\n    let changed = false;\n    for (let j = 0; j < p - 1; j++) {\n      for (let k = j + 1; k < p; k++) {\n        let aa = 0;\n        let bb = 0;\n        let ab = 0;\n        for (let i = 0; i < p; i++) {\n          aa += a[i][j] ** 2;\n          bb += a[i][k] ** 2;\n          ab += a[i][j] * a[i][k];\n        }\n        if (Math.abs(ab) <= Number.EPSILON * 8 * Math.sqrt(aa * bb)) {\n          continue;\n        }\n        changed = true;\n        const tau = (bb - aa) / (2 * ab);\n        const t = (tau >= 0 ? 1 : -1) / (Math.abs(tau) + Math.hypot(1, tau));\n        const c = 1 / Math.hypot(1, t);\n        const s = c * t;\n        for (let i = 0; i < p; i++) {\n          const aj = a[i][j];\n          const ak = a[i][k];\n          const vj = v[i][j];\n          const vk = v[i][k];\n          a[i][j] = c * aj - s * ak;\n          a[i][k] = s * aj + c * ak;\n          v[i][j] = c * vj - s * vk;\n          v[i][k] = s * vj + c * vk;\n        }\n      }\n    }\n    if (!changed) {\n      break;\n    }\n  }\n  const norms = Array.from({ length: p }, (_, j) => Math.hypot(...a.map(row => row[j])));\n  const tolerance = Math.max(...norms) * Number.EPSILON * p * 64;\n  const coef = new Array<number>(p).fill(0);\n  let rank = 0;\n  for (let j = 0; j < p; j++) {\n    if (norms[j] <= tolerance) {\n      continue;\n    }\n    rank++;\n    let projection = 0;\n    for (let i = 0; i < p; i++) {\n      projection += a[i][j] * rhs[i];\n    }\n    projection /= norms[j] ** 2;\n    for (let i = 0; i < p; i++) {\n      coef[i] += v[i][j] * projection;\n    }\n  }\n  return { coef, rank };\n}\n\nexport function fitRegression(points: readonly RegressionPoint[], degree: number, basis = regressionBasis(points)) {\n  const p = degree + 1;\n  if (degree === 1) {\n    let mx = 0;\n    let my = 0;\n    let n = 0;\n    for (const row of points) {\n      n++;\n      mx += (normalizeRegression(row.x, basis.xCenter, basis.xScale) - mx) / n;\n      my += (normalizeRegression(row.y, basis.yCenter, basis.yScale) - my) / n;\n    }\n    let sxx = 0;\n    let sxy = 0;\n    for (const row of points) {\n      const dx = normalizeRegression(row.x, basis.xCenter, basis.xScale) - mx;\n      sxx += dx * dx;\n      sxy += dx * (normalizeRegression(row.y, basis.yCenter, basis.yScale) - my);\n    }\n    const b = sxx === 0 ? 0 : sxy / sxx;\n    const coef = sxx === 0 ? [my / (1 + mx * mx), (mx * my) / (1 + mx * mx)] : [my - b * mx, b];\n    return { coef, rank: n === 0 ? 0 : sxx === 0 ? 1 : 2, basis };\n  }\n  const r = Array.from({ length: p }, () => new Array<number>(p).fill(0));\n  const rhs = new Array<number>(p).fill(0);\n  const row = new Array<number>(p);\n  for (const point of points) {\n    const z = normalizeRegression(point.x, basis.xCenter, basis.xScale);\n    row[0] = 1;\n    for (let j = 1; j < p; j++) {\n      row[j] = row[j - 1] * z;\n    }\n    let value = normalizeRegression(point.y, basis.yCenter, basis.yScale);\n    // 增量 Givens QR 仅保留 p×p 的 R，bootstrap 不分配 N×p 矩阵。\n    for (let j = 0; j < p; j++) {\n      const norm = Math.hypot(r[j][j], row[j]);\n      if (norm === 0) {\n        continue;\n      }\n      const c = r[j][j] / norm;\n      const s = row[j] / norm;\n      r[j][j] = norm;\n      for (let k = j + 1; k < p; k++) {\n        const previous = r[j][k];\n        r[j][k] = c * previous + s * row[k];\n        row[k] = -s * previous + c * row[k];\n      }\n      const previous = rhs[j];\n      rhs[j] = c * previous + s * value;\n      value = -s * previous + c * value;\n    }\n  }\n  const tolerance = Math.max(...r.map((row, i) => Math.abs(row[i]))) * Number.EPSILON * p * 64;\n  if (r.some((row, i) => Math.abs(row[i]) <= tolerance)) {\n    return { ...minimumNorm(r, rhs), basis };\n  }\n  const coef = new Array<number>(p);\n  for (let i = p - 1; i >= 0; i--) {\n    let value = rhs[i];\n    for (let j = i + 1; j < p; j++) {\n      value -= r[i][j] * coef[j];\n    }\n    coef[i] = value / r[i][i];\n  }\n  return { coef, rank: p, basis };\n}\n\nexport function regressionPrediction(model: ReturnType<typeof fitRegression>, x: number) {\n  const z = normalizeRegression(x, model.basis.xCenter, model.basis.xScale);\n  let value = 0;\n  for (let j = model.coef.length - 1; j >= 0; j--) {\n    value = value * z + model.coef[j];\n  }\n  return model.basis.yCenter + model.basis.yScale * value;\n}\n\n/** 保留公开的升幂 coef；预测始终使用稳定基底。 */\nexport function regressionCoefficients(model: ReturnType<typeof fitRegression>) {\n  let coef = [model.coef[model.coef.length - 1]];\n  const a = -model.basis.xCenter / model.basis.xScale;\n  const b = 1 / model.basis.xScale;\n  for (let j = model.coef.length - 2; j >= 0; j--) {\n    const next = new Array<number>(coef.length + 1).fill(0);\n    coef.forEach((c, i) => {\n      next[i] += a * c;\n      next[i + 1] += b * c;\n    });\n    next[0] += model.coef[j];\n    coef = next;\n  }\n  coef = coef.map(c => c * model.basis.yScale);\n  coef[0] += model.basis.yCenter;\n  if (coef.some(c => !Number.isFinite(c))) {\n    throw new RangeError('Regression coefficients are not finite');\n  }\n  return coef;\n}\n\nexport function regressionGrid(min: number, max: number, count: number, predict: (x: number) => number) {\n  if (!Number.isInteger(count) || count <= 0 || !Number.isFinite(min) || !Number.isFinite(max)) {\n    return [];\n  }\n  const width = max - min;\n  const step = count === 1 ? 0 : width / (count - 1);\n  return Array.from({ length: count }, (_, i) => {\n    const t = count === 1 ? 0 : i / (count - 1);\n    const x = i === 0 ? min : i === count - 1 ? max : Number.isFinite(width) ? min + i * step : (1 - t) * min + t * max;\n    return { x, y: predict(x) };\n  });\n}\n"]}

package/cjs/data-structure/bounds.js

@@ -236,4 +236,4 @@ class OBBBounds extends Bounds {
 }
 
 exports.OBBBounds = OBBBounds;
-//# sourceMappingURL=bounds.js.map
+//# sourceMappingURL=bounds.js.map

package/cjs/data-structure/hashTable.js

@@ -120,5 +120,4 @@ class HashTable {
     }
 }
 
-exports.HashTable = HashTable;
-//# sourceMappingURL=hashTable.js.map
+exports.HashTable = HashTable;

package/cjs/data-structure/index.js

@@ -23,4 +23,4 @@ __exportStar(require("./hashTable"), exports),
 // Point
 __exportStar(require("./point"), exports), __exportStar(require("./bounds"), exports), 
 __exportStar(require("./matrix"), exports);
-//# sourceMappingURL=index.js.map
+//# sourceMappingURL=index.js.map

package/cjs/data-structure/matrix.js

@@ -158,4 +158,4 @@ function normalTransform(out, origin, x, y, scaleX, scaleY, angle, rotateCenter)
 }
 
 exports.Matrix = Matrix, exports.normalTransform = normalTransform;
-//# sourceMappingURL=matrix.js.map
+//# sourceMappingURL=matrix.js.map

package/cjs/data-structure/point.js

@@ -82,4 +82,4 @@ class PolarPoint {
 }
 
 exports.PolarPoint = PolarPoint;
-//# sourceMappingURL=point.js.map
+//# sourceMappingURL=point.js.map