@visactor/vutils 1.0.24 → 1.0.26

package/es/common/regression-solver.d.ts

@@ -0,0 +1,26 @@
+/** 回归共用的稳定坐标与小型最小二乘求解器；不构造 XᵀX。 */
+export interface RegressionPoint {
+    x: number;
+    y: number;
+}
+export interface RegressionBasis {
+    xCenter: number;
+    xScale: number;
+    yCenter: number;
+    yScale: number;
+}
+export declare function regressionPoints(data: readonly any[], x: (d: any) => number, y: (d: any) => number): RegressionPoint[];
+export declare function normalizeRegression(value: number, center: number, scale: number): number;
+export declare function regressionBasis(points: readonly RegressionPoint[]): RegressionBasis;
+export declare function fitRegression(points: readonly RegressionPoint[], degree: number, basis?: RegressionBasis): {
+    coef: number[];
+    rank: number;
+    basis: RegressionBasis;
+};
+export declare function regressionPrediction(model: ReturnType<typeof fitRegression>, x: number): number;
+/** 保留公开的升幂 coef；预测始终使用稳定基底。 */
+export declare function regressionCoefficients(model: ReturnType<typeof fitRegression>): number[];
+export declare function regressionGrid(min: number, max: number, count: number, predict: (x: number) => number): {
+    x: number;
+    y: number;
+}[];

package/es/common/regression-solver.js

@@ -0,0 +1,168 @@
+export 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;
+}
+
+export function normalizeRegression(value, center, scale) {
+    const delta = value - center;
+    return Number.isFinite(delta) ? delta / scale : value / scale - center / scale;
+}
+
+export 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
+    };
+}
+
+export 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
+    };
+}
+
+export 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；预测始终使用稳定基底。 */ export 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;
+}
+
+export 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)
+        };
+    }));
+}
+//# sourceMappingURL=regression-solver.js.map

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

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/common/regression-solver.ts"],"names":[],"mappings":"AAYA,MAAM,UAAU,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;AAED,MAAM,UAAU,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;AAED,MAAM,UAAU,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;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,MAAM,UAAU,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;AAED,MAAM,UAAU,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;AAED,+BAA+B;AAC/B,MAAM,UAAU,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;AAED,MAAM,UAAU,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","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/es/common/regression-utils.d.ts

@@ -1,4 +1,9 @@
-export declare function invNorm(p: number): number;
+import { normalQuantile as invNorm } from './normalQuantile';
+export { invNorm };
+/** Compute a two-sided normal critical value without subtracting a small tail probability from one. */
+export declare function confidenceCriticalValue(alpha: number): number;
+/** A zero standard error gives a degenerate interval even when the critical value is infinite. */
+export declare function confidenceHalfWidth(z: number, standardError: number): number;
 export interface LinearCIComponents {
     min: number;
     max: number;
@@ -7,7 +12,14 @@ export interface LinearCIComponents {
     SSE: number;
     Sxx: number;
 }
+/**
+ * Compute basic components used for linear regression confidence / prediction intervals.
+ * - scans data to compute min/max of x, n, mean X, SSE and Sxx (sum (xi - X)^2).
+ */
 export declare function computeLinearCIComponents(data: any[], x: (d: any) => number, y: (d: any) => number, predict: (x: number) => number): LinearCIComponents;
+/**
+ * Compute standard errors for mean and prediction at px using components.
+ */
 export declare function stdErrorsAt(px: number, comps: LinearCIComponents): {
     seMean: number;
     sePred: number;

package/es/common/regression-utils.js

@@ -1,15 +1,22 @@
 import isNil from "./isNil";
 
-export function invNorm(p) {
-    if (p <= 0 || p >= 1) return 0;
-    const c1 = -.00778489400243029, c2 = -.322396458041136, c3 = -2.40075827716184, c4 = -2.54973253934373, c5 = 4.37466414146497, c6 = 2.93816398269878, d1 = .00778469570904146, d2 = .32246712907004, d3 = 2.445134137143, d4 = 3.75440866190742;
-    let q, r;
-    return p < .02425 ? (q = Math.sqrt(-2 * Math.log(p)), (((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) / ((((d1 * q + d2) * q + d3) * q + d4) * q + 1)) : p <= .97575 ? (q = p - .5, 
-    r = q * q, (((((-39.6968302866538 * r + 220.946098424521) * r - 275.928510446969) * r + 138.357751867269) * r - 30.6647980661472) * r + 2.50662827745924) * q / (((((-54.4760987982241 * r + 161.585836858041) * r - 155.698979859887) * r + 66.8013118877197) * r - 13.2806815528857) * r + 1)) : (q = Math.sqrt(-2 * Math.log(1 - p)), 
-    -(((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) / ((((d1 * q + d2) * q + d3) * q + d4) * q + 1));
+import { normalQuantile as invNorm } from "./normalQuantile";
+
+export { invNorm };
+
+/** Compute a two-sided normal critical value without subtracting a small tail probability from one. */ export function confidenceCriticalValue(alpha) {
+    return !Number.isFinite(alpha) || alpha < 0 || alpha > 1 ? NaN : -invNorm(alpha / 2);
+}
+
+/** A zero standard error gives a degenerate interval even when the critical value is infinite. */ export function confidenceHalfWidth(z, standardError) {
+    return Number.isNaN(z) ? NaN : 0 === standardError ? 0 : z * standardError;
 }
 
-export function computeLinearCIComponents(data, x, y, predict) {
+/**
+ * Compute basic components used for linear regression confidence / prediction intervals.
+ * - scans data to compute min/max of x, n, mean X, SSE and Sxx (sum (xi - X)^2).
+ */ export function computeLinearCIComponents(data, x, y, predict) {
+    // simple local scanner to avoid circular imports
     let min = 1 / 0, max = -1 / 0, n = 0, sumX = 0;
     for (let i = 0; i < data.length; i++) {
         const d = data[i];
@@ -47,7 +54,9 @@ export function computeLinearCIComponents(data, x, y, predict) {
     };
 }
 
-export function stdErrorsAt(px, comps) {
+/**
+ * Compute standard errors for mean and prediction at px using components.
+ */ export function stdErrorsAt(px, comps) {
     const {n: n, X: X, Sxx: Sxx, SSE: SSE} = comps, s2 = n > 2 ? SSE / (n - 2) : 0;
     return {
         seMean: Sxx > 0 ? Math.sqrt(s2 * (1 / n + (px - X) * (px - X) / Sxx)) : Math.sqrt(s2 / n),

package/es/common/regression-utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/regression-utils.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,SAAS,CAAC;AAM5B,MAAM,UAAU,OAAO,CAAC,CAAS;IAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QACpB,OAAO,CAAC,CAAC;KACV;IAED,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAE5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAE7B,MAAM,EAAE,GAAG,CAAC,mBAAmB,CAAC;IAChC,MAAM,EAAE,GAAG,CAAC,iBAAiB,CAAC;IAC9B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,CAAC,gBAAgB,CAAC;IAC7B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAE5B,MAAM,EAAE,GAAG,mBAAmB,CAAC;IAC/B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAC5B,MAAM,EAAE,GAAG,cAAc,CAAC;IAC1B,MAAM,EAAE,GAAG,gBAAgB,CAAC;IAE5B,MAAM,IAAI,GAAG,OAAO,CAAC;IACrB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC;IAEvB,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IAEd,IAAI,CAAC,GAAG,IAAI,EAAE;QACZ,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;KAClH;IAED,IAAI,CAAC,IAAI,KAAK,EAAE;QACd,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC;QACZ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CACL,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;YAC/D,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CACzD,CAAC;KACH;IAED,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACtH,CAAC;AAeD,MAAM,UAAU,yBAAyB,CACvC,IAAW,EACX,CAAqB,EACrB,CAAqB,EACrB,OAA8B;IAG9B,IAAI,GAAG,GAAG,QAAQ,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;IACpB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;YACpE,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,GAAG,GAAG,EAAE,CAAC;aACV;YACD,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,GAAG,GAAG,EAAE,CAAC;aACV;YACD,CAAC,EAAE,CAAC;YACJ,IAAI,IAAI,EAAE,CAAC;SACZ;KACF;IAED,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;KAC9C;IAED,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;YACpE,MAAM,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YAC3B,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACb,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC;SAClB;KACF;IAED,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACtC,CAAC;AAKD,MAAM,UAAU,WAAW,CAAC,EAAU,EAAE,KAAyB;IAC/D,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IACjC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACnG,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC5B,CAAC;AAED,eAAe;IACb,OAAO;IACP,yBAAyB;IACzB,WAAW;CACZ,CAAC","file":"regression-utils.js","sourcesContent":["import isNil from './isNil';\n\n/**\n * Approximate inverse normal CDF (probit) using Acklam's algorithm.\n * Returns z such that P(Z <= z) = p for standard normal Z.\n */\nexport function invNorm(p: number) {\n  if (p <= 0 || p >= 1) {\n    return 0;\n  }\n\n  const a1 = -39.6968302866538;\n  const a2 = 220.946098424521;\n  const a3 = -275.928510446969;\n  const a4 = 138.357751867269;\n  const a5 = -30.6647980661472;\n  const a6 = 2.50662827745924;\n\n  const b1 = -54.4760987982241;\n  const b2 = 161.585836858041;\n  const b3 = -155.698979859887;\n  const b4 = 66.8013118877197;\n  const b5 = -13.2806815528857;\n\n  const c1 = -0.00778489400243029;\n  const c2 = -0.322396458041136;\n  const c3 = -2.40075827716184;\n  const c4 = -2.54973253934373;\n  const c5 = 4.37466414146497;\n  const c6 = 2.93816398269878;\n\n  const d1 = 0.00778469570904146;\n  const d2 = 0.32246712907004;\n  const d3 = 2.445134137143;\n  const d4 = 3.75440866190742;\n\n  const pLow = 0.02425;\n  const pHigh = 1 - pLow;\n\n  let q: number;\n  let r: number;\n\n  if (p < pLow) {\n    q = Math.sqrt(-2 * Math.log(p));\n    return (((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) / ((((d1 * q + d2) * q + d3) * q + d4) * q + 1);\n  }\n\n  if (p <= pHigh) {\n    q = p - 0.5;\n    r = q * q;\n    return (\n      ((((((a1 * r + a2) * r + a3) * r + a4) * r + a5) * r + a6) * q) /\n      (((((b1 * r + b2) * r + b3) * r + b4) * r + b5) * r + 1)\n    );\n  }\n\n  q = Math.sqrt(-2 * Math.log(1 - p));\n  return -((((((c1 * q + c2) * q + c3) * q + c4) * q + c5) * q + c6) / ((((d1 * q + d2) * q + d3) * q + d4) * q + 1));\n}\n\nexport interface LinearCIComponents {\n  min: number;\n  max: number;\n  n: number;\n  X: number; // mean of x\n  SSE: number;\n  Sxx: number;\n}\n\n/**\n * Compute basic components used for linear regression confidence / prediction intervals.\n * - scans data to compute min/max of x, n, mean X, SSE and Sxx (sum (xi - X)^2).\n */\nexport function computeLinearCIComponents(\n  data: any[],\n  x: (d: any) => number,\n  y: (d: any) => number,\n  predict: (x: number) => number\n): LinearCIComponents {\n  // simple local scanner to avoid circular imports\n  let min = Infinity;\n  let max = -Infinity;\n  let n = 0;\n  let sumX = 0;\n\n  for (let i = 0; i < data.length; i++) {\n    const d = data[i];\n    let dx = x(d);\n    let dy = y(d);\n    if (!isNil(dx) && (dx = +dx) >= dx && !isNil(dy) && (dy = +dy) >= dy) {\n      if (dx < min) {\n        min = dx;\n      }\n      if (dx > max) {\n        max = dx;\n      }\n      n++;\n      sumX += dx;\n    }\n  }\n\n  if (n === 0) {\n    return { min, max, n, X: 0, SSE: 0, Sxx: 0 };\n  }\n\n  const X = sumX / n;\n  let SSE = 0;\n  let Sxx = 0;\n  for (let i = 0; i < data.length; i++) {\n    const d = data[i];\n    let dx = x(d);\n    let dy = y(d);\n    if (!isNil(dx) && (dx = +dx) >= dx && !isNil(dy) && (dy = +dy) >= dy) {\n      const r = dy - predict(dx);\n      SSE += r * r;\n      const dxc = dx - X;\n      Sxx += dxc * dxc;\n    }\n  }\n\n  return { min, max, n, X, SSE, Sxx };\n}\n\n/**\n * Compute standard errors for mean and prediction at px using components.\n */\nexport function stdErrorsAt(px: number, comps: LinearCIComponents) {\n  const { n, X, Sxx, SSE } = comps;\n  const s2 = n > 2 ? SSE / (n - 2) : 0;\n  const seMean = Sxx > 0 ? Math.sqrt(s2 * (1 / n + ((px - X) * (px - X)) / Sxx)) : Math.sqrt(s2 / n);\n  const sePred = Math.sqrt(s2 * (1 + 1 / n + (Sxx > 0 ? ((px - X) * (px - X)) / Sxx : 0)));\n  return { seMean, sePred };\n}\n\nexport default {\n  invNorm,\n  computeLinearCIComponents,\n  stdErrorsAt\n};\n"]}
+{"version":3,"sources":["../src/common/regression-utils.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,EAAE,cAAc,IAAI,OAAO,EAAE,MAAM,kBAAkB,CAAC;AAC7D,OAAO,EAAE,OAAO,EAAE,CAAC;AAEnB,uGAAuG;AACvG,MAAM,UAAU,uBAAuB,CAAC,KAAa;IACnD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE;QACrD,OAAO,GAAG,CAAC;KACZ;IACD,OAAO,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,aAAqB;IAClE,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;QACnB,OAAO,GAAG,CAAC;KACZ;IACD,OAAO,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC;AACrD,CAAC;AAWD;;;GAGG;AACH,MAAM,UAAU,yBAAyB,CACvC,IAAW,EACX,CAAqB,EACrB,CAAqB,EACrB,OAA8B;IAE9B,iDAAiD;IACjD,IAAI,GAAG,GAAG,QAAQ,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC;IACpB,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,IAAI,GAAG,CAAC,CAAC;IAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;YACpE,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,GAAG,GAAG,EAAE,CAAC;aACV;YACD,IAAI,EAAE,GAAG,GAAG,EAAE;gBACZ,GAAG,GAAG,EAAE,CAAC;aACV;YACD,CAAC,EAAE,CAAC;YACJ,IAAI,IAAI,EAAE,CAAC;SACZ;KACF;IAED,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC;KAC9C;IAED,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE;YACpE,MAAM,CAAC,GAAG,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;YAC3B,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;YACb,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;YACnB,GAAG,IAAI,GAAG,GAAG,GAAG,CAAC;SAClB;KACF;IAED,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AACtC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,EAAU,EAAE,KAAyB;IAC/D,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IACjC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACnG,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAC5B,CAAC;AAED,eAAe;IACb,OAAO;IACP,yBAAyB;IACzB,WAAW;CACZ,CAAC","file":"regression-utils.js","sourcesContent":["import isNil from './isNil';\nimport { normalQuantile as invNorm } from './normalQuantile';\nexport { invNorm };\n\n/** Compute a two-sided normal critical value without subtracting a small tail probability from one. */\nexport function confidenceCriticalValue(alpha: number): number {\n  if (!Number.isFinite(alpha) || alpha < 0 || alpha > 1) {\n    return NaN;\n  }\n  return -invNorm(alpha / 2);\n}\n\n/** A zero standard error gives a degenerate interval even when the critical value is infinite. */\nexport function confidenceHalfWidth(z: number, standardError: number): number {\n  if (Number.isNaN(z)) {\n    return NaN;\n  }\n  return standardError === 0 ? 0 : z * standardError;\n}\n\nexport interface LinearCIComponents {\n  min: number;\n  max: number;\n  n: number;\n  X: number; // mean of x\n  SSE: number;\n  Sxx: number;\n}\n\n/**\n * Compute basic components used for linear regression confidence / prediction intervals.\n * - scans data to compute min/max of x, n, mean X, SSE and Sxx (sum (xi - X)^2).\n */\nexport function computeLinearCIComponents(\n  data: any[],\n  x: (d: any) => number,\n  y: (d: any) => number,\n  predict: (x: number) => number\n): LinearCIComponents {\n  // simple local scanner to avoid circular imports\n  let min = Infinity;\n  let max = -Infinity;\n  let n = 0;\n  let sumX = 0;\n\n  for (let i = 0; i < data.length; i++) {\n    const d = data[i];\n    let dx = x(d);\n    let dy = y(d);\n    if (!isNil(dx) && (dx = +dx) >= dx && !isNil(dy) && (dy = +dy) >= dy) {\n      if (dx < min) {\n        min = dx;\n      }\n      if (dx > max) {\n        max = dx;\n      }\n      n++;\n      sumX += dx;\n    }\n  }\n\n  if (n === 0) {\n    return { min, max, n, X: 0, SSE: 0, Sxx: 0 };\n  }\n\n  const X = sumX / n;\n  let SSE = 0;\n  let Sxx = 0;\n  for (let i = 0; i < data.length; i++) {\n    const d = data[i];\n    let dx = x(d);\n    let dy = y(d);\n    if (!isNil(dx) && (dx = +dx) >= dx && !isNil(dy) && (dy = +dy) >= dy) {\n      const r = dy - predict(dx);\n      SSE += r * r;\n      const dxc = dx - X;\n      Sxx += dxc * dxc;\n    }\n  }\n\n  return { min, max, n, X, SSE, Sxx };\n}\n\n/**\n * Compute standard errors for mean and prediction at px using components.\n */\nexport function stdErrorsAt(px: number, comps: LinearCIComponents) {\n  const { n, X, Sxx, SSE } = comps;\n  const s2 = n > 2 ? SSE / (n - 2) : 0;\n  const seMean = Sxx > 0 ? Math.sqrt(s2 * (1 / n + ((px - X) * (px - X)) / Sxx)) : Math.sqrt(s2 / n);\n  const sePred = Math.sqrt(s2 * (1 + 1 / n + (Sxx > 0 ? ((px - X) * (px - X)) / Sxx : 0)));\n  return { seMean, sePred };\n}\n\nexport default {\n  invNorm,\n  computeLinearCIComponents,\n  stdErrorsAt\n};\n"]}

package/es/common/throttle.js

@@ -1,3 +1,6 @@
+/**
+ * @see https://github.com/lodash/lodash/blob/master/throttle.js
+ */
 import debounce from "./debounce";
 
 import isObject from "./isObject";

package/es/common/throttle.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/throttle.ts"],"names":[],"mappings":"AAGA,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,QAAQ,MAAM,YAAY,CAAC;AAElC,SAAS,QAAQ,CACf,IAAyB,EACzB,IAAY,EACZ,OAAmD;IAEnD,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,QAAQ,GAAG,IAAI,CAAC;IAEpB,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;QAC9B,MAAM,IAAI,SAAS,CAAC,qBAAqB,CAAC,CAAC;KAC5C;IACD,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE;QACrB,OAAO,GAAG,SAAS,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAC7D,QAAQ,GAAG,UAAU,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;KAClE;IACD,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE;QAC1B,OAAO;QACP,QAAQ;QACR,OAAO,EAAE,IAAI;KACd,CAAC,CAAC;AACL,CAAC;AAED,eAAe,QAAQ,CAAC","file":"throttle.js","sourcesContent":["/**\n * @see https://github.com/lodash/lodash/blob/master/throttle.js\n */\nimport debounce from './debounce';\nimport isObject from './isObject';\n\nfunction throttle<T, S>(\n  func: (...args: T[]) => S,\n  wait: number,\n  options?: { leading?: boolean; trailing?: boolean }\n): (...args: T[]) => S {\n  let leading = true;\n  let trailing = true;\n\n  if (typeof func !== 'function') {\n    throw new TypeError('Expected a function');\n  }\n  if (isObject(options)) {\n    leading = 'leading' in options ? !!options.leading : leading;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n  return debounce(func, wait, {\n    leading,\n    trailing,\n    maxWait: wait\n  });\n}\n\nexport default throttle;\n"]}
+{"version":3,"sources":["../src/common/throttle.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,QAAQ,MAAM,YAAY,CAAC;AAClC,OAAO,QAAQ,MAAM,YAAY,CAAC;AAElC,SAAS,QAAQ,CACf,IAAyB,EACzB,IAAY,EACZ,OAAmD;IAEnD,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,IAAI,QAAQ,GAAG,IAAI,CAAC;IAEpB,IAAI,OAAO,IAAI,KAAK,UAAU,EAAE;QAC9B,MAAM,IAAI,SAAS,CAAC,qBAAqB,CAAC,CAAC;KAC5C;IACD,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE;QACrB,OAAO,GAAG,SAAS,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAC7D,QAAQ,GAAG,UAAU,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;KAClE;IACD,OAAO,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE;QAC1B,OAAO;QACP,QAAQ;QACR,OAAO,EAAE,IAAI;KACd,CAAC,CAAC;AACL,CAAC;AAED,eAAe,QAAQ,CAAC","file":"throttle.js","sourcesContent":["/**\n * @see https://github.com/lodash/lodash/blob/master/throttle.js\n */\nimport debounce from './debounce';\nimport isObject from './isObject';\n\nfunction throttle<T, S>(\n  func: (...args: T[]) => S,\n  wait: number,\n  options?: { leading?: boolean; trailing?: boolean }\n): (...args: T[]) => S {\n  let leading = true;\n  let trailing = true;\n\n  if (typeof func !== 'function') {\n    throw new TypeError('Expected a function');\n  }\n  if (isObject(options)) {\n    leading = 'leading' in options ? !!options.leading : leading;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n  return debounce(func, wait, {\n    leading,\n    trailing,\n    maxWait: wait\n  });\n}\n\nexport default throttle;\n"]}

package/es/common/toDate.js

@@ -2,15 +2,35 @@ import isNil from "./isNil";
 
 import isString from "./isString";
 
+// eslint-disable-next-line no-useless-escape
 const TIME_REG = /^(?:(\d{4})(?:[-\/](\d{1,2})(?:[-\/](\d{1,2})(?:[T ](\d{1,2})(?::(\d{1,2})(?::(\d{1,2})(?:[.,](\d+))?)?)?(Z|[\+\-]\d\d:?\d\d)?)?)?)?)?$/;
 
+ // eslint-disable-line
 export function toDate(val) {
     if (val instanceof Date) return val;
     if (isString(val)) {
+        // Different browsers parse date in different way, so we parse it manually.
+        // Some other issues:
+        // new Date('1970-01-01') is UTC,
+        // new Date('1970/01/01') and new Date('1970-1-01') is local.
+        // See issue #3623
         const match = TIME_REG.exec(val);
-        if (!match) return new Date(NaN);
-        if (!match[8]) return new Date(+match[1], +(match[2] || 1) - 1, +match[3] || 1, +match[4] || 0, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0);
-        let hour = +match[4] || 0;
+        if (!match) 
+        // return Invalid Date.
+        return new Date(NaN);
+        // Use local time when no timezone offset specifed.
+                if (!match[8]) 
+        // match[n] can only be string or undefined.
+        // But take care of '12' + 1 => '121'.
+        return new Date(+match[1], +(match[2] || 1) - 1, +match[3] || 1, +match[4] || 0, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0);
+        // Timezoneoffset of Javascript Date has considered DST (Daylight Saving Time,
+        // https://tc39.github.io/ecma262/#sec-daylight-saving-time-adjustment).
+        // For example, system timezone is set as "Time Zone: America/Toronto",
+        // then these code will get different result:
+        // `new Date(1478411999999).getTimezoneOffset();  // get 240`
+        // `new Date(1478412000000).getTimezoneOffset();  // get 300`
+        // So we should not use `new Date`, but use `Date.UTC`.
+                let hour = +match[4] || 0;
         return "Z" !== match[8].toUpperCase() && (hour -= +match[8].slice(0, 3)), new Date(Date.UTC(+match[1], +(match[2] || 1) - 1, +match[3] || 1, hour, +(match[5] || 0), +match[6] || 0, match[7] ? +match[7].substring(0, 3) : 0));
     }
     return isNil(val) ? new Date(NaN) : new Date(Math.round(val));

package/es/common/toDate.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/toDate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAKlC,MAAM,QAAQ,GACZ,yIAAyI,CAAC;AAE5I,MAAM,UAAU,MAAM,CAAC,GAAiB;IACtC,IAAI,GAAG,YAAY,IAAI,EAAE;QACvB,OAAO,GAAG,CAAC;KACZ;SAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE;QAMxB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEjC,IAAI,CAAC,KAAK,EAAE;YAEV,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;SACtB;QAGD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAGb,OAAO,IAAI,IAAI,CACb,CAAC,KAAK,CAAC,CAAC,CAAC,EACT,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EACpB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAChB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzC,CAAC;SACH;QASD,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,GAAG,EAAE;YAClC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC/B;QACD,OAAO,IAAI,IAAI,CACb,IAAI,CAAC,GAAG,CACN,CAAC,KAAK,CAAC,CAAC,CAAC,EACT,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EACpB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,IAAI,EACJ,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAChB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzC,CACF,CAAC;KACH;SAAM,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE;QACrB,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;KACtB;IAED,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAa,CAAC,CAAC,CAAC;AAC7C,CAAC","file":"toDate.js","sourcesContent":["import isNil from './isNil';\nimport isString from './isString';\n\nexport type DateLikeType = number | string | Date;\n\n// eslint-disable-next-line no-useless-escape\nconst TIME_REG =\n  /^(?:(\\d{4})(?:[-\\/](\\d{1,2})(?:[-\\/](\\d{1,2})(?:[T ](\\d{1,2})(?::(\\d{1,2})(?::(\\d{1,2})(?:[.,](\\d+))?)?)?(Z|[\\+\\-]\\d\\d:?\\d\\d)?)?)?)?)?$/; // eslint-disable-line\n\nexport function toDate(val: DateLikeType): Date {\n  if (val instanceof Date) {\n    return val;\n  } else if (isString(val)) {\n    // Different browsers parse date in different way, so we parse it manually.\n    // Some other issues:\n    // new Date('1970-01-01') is UTC,\n    // new Date('1970/01/01') and new Date('1970-1-01') is local.\n    // See issue #3623\n    const match = TIME_REG.exec(val);\n\n    if (!match) {\n      // return Invalid Date.\n      return new Date(NaN);\n    }\n\n    // Use local time when no timezone offset specifed.\n    if (!match[8]) {\n      // match[n] can only be string or undefined.\n      // But take care of '12' + 1 => '121'.\n      return new Date(\n        +match[1],\n        +(match[2] || 1) - 1,\n        +match[3] || 1,\n        +match[4] || 0,\n        +(match[5] || 0),\n        +match[6] || 0,\n        match[7] ? +match[7].substring(0, 3) : 0\n      );\n    }\n    // Timezoneoffset of Javascript Date has considered DST (Daylight Saving Time,\n    // https://tc39.github.io/ecma262/#sec-daylight-saving-time-adjustment).\n    // For example, system timezone is set as \"Time Zone: America/Toronto\",\n    // then these code will get different result:\n    // `new Date(1478411999999).getTimezoneOffset();  // get 240`\n    // `new Date(1478412000000).getTimezoneOffset();  // get 300`\n    // So we should not use `new Date`, but use `Date.UTC`.\n\n    let hour = +match[4] || 0;\n    if (match[8].toUpperCase() !== 'Z') {\n      hour -= +match[8].slice(0, 3);\n    }\n    return new Date(\n      Date.UTC(\n        +match[1],\n        +(match[2] || 1) - 1,\n        +match[3] || 1,\n        hour,\n        +(match[5] || 0),\n        +match[6] || 0,\n        match[7] ? +match[7].substring(0, 3) : 0\n      )\n    );\n  } else if (isNil(val)) {\n    return new Date(NaN);\n  }\n\n  return new Date(Math.round(val as number));\n}\n"]}
+{"version":3,"sources":["../src/common/toDate.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,SAAS,CAAC;AAC5B,OAAO,QAAQ,MAAM,YAAY,CAAC;AAIlC,6CAA6C;AAC7C,MAAM,QAAQ,GACZ,yIAAyI,CAAC,CAAC,sBAAsB;AAEnK,MAAM,UAAU,MAAM,CAAC,GAAiB;IACtC,IAAI,GAAG,YAAY,IAAI,EAAE;QACvB,OAAO,GAAG,CAAC;KACZ;SAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE;QACxB,2EAA2E;QAC3E,qBAAqB;QACrB,iCAAiC;QACjC,6DAA6D;QAC7D,kBAAkB;QAClB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAEjC,IAAI,CAAC,KAAK,EAAE;YACV,uBAAuB;YACvB,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;SACtB;QAED,mDAAmD;QACnD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YACb,4CAA4C;YAC5C,sCAAsC;YACtC,OAAO,IAAI,IAAI,CACb,CAAC,KAAK,CAAC,CAAC,CAAC,EACT,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EACpB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAChB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzC,CAAC;SACH;QACD,8EAA8E;QAC9E,wEAAwE;QACxE,uEAAuE;QACvE,6CAA6C;QAC7C,6DAA6D;QAC7D,6DAA6D;QAC7D,uDAAuD;QAEvD,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,KAAK,GAAG,EAAE;YAClC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC/B;QACD,OAAO,IAAI,IAAI,CACb,IAAI,CAAC,GAAG,CACN,CAAC,KAAK,CAAC,CAAC,CAAC,EACT,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EACpB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,IAAI,EACJ,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAChB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EACd,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACzC,CACF,CAAC;KACH;SAAM,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE;QACrB,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;KACtB;IAED,OAAO,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAa,CAAC,CAAC,CAAC;AAC7C,CAAC","file":"toDate.js","sourcesContent":["import isNil from './isNil';\nimport isString from './isString';\n\nexport type DateLikeType = number | string | Date;\n\n// eslint-disable-next-line no-useless-escape\nconst TIME_REG =\n  /^(?:(\\d{4})(?:[-\\/](\\d{1,2})(?:[-\\/](\\d{1,2})(?:[T ](\\d{1,2})(?::(\\d{1,2})(?::(\\d{1,2})(?:[.,](\\d+))?)?)?(Z|[\\+\\-]\\d\\d:?\\d\\d)?)?)?)?)?$/; // eslint-disable-line\n\nexport function toDate(val: DateLikeType): Date {\n  if (val instanceof Date) {\n    return val;\n  } else if (isString(val)) {\n    // Different browsers parse date in different way, so we parse it manually.\n    // Some other issues:\n    // new Date('1970-01-01') is UTC,\n    // new Date('1970/01/01') and new Date('1970-1-01') is local.\n    // See issue #3623\n    const match = TIME_REG.exec(val);\n\n    if (!match) {\n      // return Invalid Date.\n      return new Date(NaN);\n    }\n\n    // Use local time when no timezone offset specifed.\n    if (!match[8]) {\n      // match[n] can only be string or undefined.\n      // But take care of '12' + 1 => '121'.\n      return new Date(\n        +match[1],\n        +(match[2] || 1) - 1,\n        +match[3] || 1,\n        +match[4] || 0,\n        +(match[5] || 0),\n        +match[6] || 0,\n        match[7] ? +match[7].substring(0, 3) : 0\n      );\n    }\n    // Timezoneoffset of Javascript Date has considered DST (Daylight Saving Time,\n    // https://tc39.github.io/ecma262/#sec-daylight-saving-time-adjustment).\n    // For example, system timezone is set as \"Time Zone: America/Toronto\",\n    // then these code will get different result:\n    // `new Date(1478411999999).getTimezoneOffset();  // get 240`\n    // `new Date(1478412000000).getTimezoneOffset();  // get 300`\n    // So we should not use `new Date`, but use `Date.UTC`.\n\n    let hour = +match[4] || 0;\n    if (match[8].toUpperCase() !== 'Z') {\n      hour -= +match[8].slice(0, 3);\n    }\n    return new Date(\n      Date.UTC(\n        +match[1],\n        +(match[2] || 1) - 1,\n        +match[3] || 1,\n        hour,\n        +(match[5] || 0),\n        +match[6] || 0,\n        match[7] ? +match[7].substring(0, 3) : 0\n      )\n    );\n  } else if (isNil(val)) {\n    return new Date(NaN);\n  }\n\n  return new Date(Math.round(val as number));\n}\n"]}

package/es/common/uuid.d.ts

@@ -1,2 +1,9 @@
+/**
+ * 生成uuid字符串.
+ * 参考https://github.com/yangjunning/issues/issues/56
+ * @param len
+ * @param radix
+ * @returns
+ */
 declare const uuid: (len: number, radix: number) => string;
 export default uuid;

package/es/common/uuid.js

@@ -1,8 +1,22 @@
+// TODO: 性能不是很好，需要优化，后续升级到最新版本的 canvas 之后就可以删除了
+/**
+ * 生成uuid字符串.
+ * 参考https://github.com/yangjunning/issues/issues/56
+ * @param len
+ * @param radix
+ * @returns
+ */
 const uuid = (len, radix) => {
     const chars = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz".split(""), uuid = [];
     let i;
-    if (radix = radix || chars.length, len) for (i = 0; i < len; i++) uuid[i] = chars[0 | Math.random() * radix]; else {
+    if (radix = radix || chars.length, len) 
+    // Compact form
+    for (i = 0; i < len; i++) uuid[i] = chars[0 | Math.random() * radix]; else {
+        // rfc4122, version 4 form
         let r;
+        // rfc4122 requires these characters
+                // Fill in random data.  At i==19 set the high bits of clock sequence as
+        // per rfc4122, sec. 4.1.5
         for (uuid[8] = uuid[13] = uuid[18] = uuid[23] = "-", uuid[14] = "4", i = 0; i < 36; i++) uuid[i] || (r = 0 | 16 * Math.random(), 
         uuid[i] = chars[19 === i ? 3 & r | 8 : r]);
     }

package/es/common/uuid.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/common/uuid.ts"],"names":[],"mappings":"AAQA,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,KAAa,EAAU,EAAE;IAClD,MAAM,KAAK,GAAG,gEAAgE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACzF,MAAM,IAAI,GAAG,EAAE,CAAC;IAChB,IAAI,CAAC,CAAC;IACN,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;IAE9B,IAAI,GAAG,EAAE;QAEP,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YACxB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;SAC9C;KACF;SAAM;QAEL,IAAI,CAAC,CAAC;QAGN,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QAC/C,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QAIf,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;gBACZ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC7B,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACjD;SACF;KACF;IAED,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACvB,CAAC,CAAC;AAEF,eAAe,IAAI,CAAC","file":"uuid.js","sourcesContent":["// TODO: 性能不是很好，需要优化，后续升级到最新版本的 canvas 之后就可以删除了\n/**\n * 生成uuid字符串.\n * 参考https://github.com/yangjunning/issues/issues/56\n * @param len\n * @param radix\n * @returns\n */\nconst uuid = (len: number, radix: number): string => {\n  const chars = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'.split('');\n  const uuid = [];\n  let i;\n  radix = radix || chars.length;\n\n  if (len) {\n    // Compact form\n    for (i = 0; i < len; i++) {\n      uuid[i] = chars[0 | (Math.random() * radix)];\n    }\n  } else {\n    // rfc4122, version 4 form\n    let r;\n\n    // rfc4122 requires these characters\n    uuid[8] = uuid[13] = uuid[18] = uuid[23] = '-';\n    uuid[14] = '4';\n\n    // Fill in random data.  At i==19 set the high bits of clock sequence as\n    // per rfc4122, sec. 4.1.5\n    for (i = 0; i < 36; i++) {\n      if (!uuid[i]) {\n        r = 0 | (Math.random() * 16);\n        uuid[i] = chars[i === 19 ? (r & 0x3) | 0x8 : r];\n      }\n    }\n  }\n\n  return uuid.join('');\n};\n\nexport default uuid;\n"]}
+{"version":3,"sources":["../src/common/uuid.ts"],"names":[],"mappings":"AAAA,+CAA+C;AAC/C;;;;;;GAMG;AACH,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,KAAa,EAAU,EAAE;IAClD,MAAM,KAAK,GAAG,gEAAgE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACzF,MAAM,IAAI,GAAG,EAAE,CAAC;IAChB,IAAI,CAAC,CAAC;IACN,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;IAE9B,IAAI,GAAG,EAAE;QACP,eAAe;QACf,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YACxB,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;SAC9C;KACF;SAAM;QACL,0BAA0B;QAC1B,IAAI,CAAC,CAAC;QAEN,oCAAoC;QACpC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QAC/C,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC;QAEf,wEAAwE;QACxE,0BAA0B;QAC1B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;gBACZ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;gBAC7B,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACjD;SACF;KACF;IAED,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACvB,CAAC,CAAC;AAEF,eAAe,IAAI,CAAC","file":"uuid.js","sourcesContent":["// TODO: 性能不是很好，需要优化，后续升级到最新版本的 canvas 之后就可以删除了\n/**\n * 生成uuid字符串.\n * 参考https://github.com/yangjunning/issues/issues/56\n * @param len\n * @param radix\n * @returns\n */\nconst uuid = (len: number, radix: number): string => {\n  const chars = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz'.split('');\n  const uuid = [];\n  let i;\n  radix = radix || chars.length;\n\n  if (len) {\n    // Compact form\n    for (i = 0; i < len; i++) {\n      uuid[i] = chars[0 | (Math.random() * radix)];\n    }\n  } else {\n    // rfc4122, version 4 form\n    let r;\n\n    // rfc4122 requires these characters\n    uuid[8] = uuid[13] = uuid[18] = uuid[23] = '-';\n    uuid[14] = '4';\n\n    // Fill in random data.  At i==19 set the high bits of clock sequence as\n    // per rfc4122, sec. 4.1.5\n    for (i = 0; i < 36; i++) {\n      if (!uuid[i]) {\n        r = 0 | (Math.random() * 16);\n        uuid[i] = chars[i === 19 ? (r & 0x3) | 0x8 : r];\n      }\n    }\n  }\n\n  return uuid.join('');\n};\n\nexport default uuid;\n"]}

package/es/data-structure/bounds.d.ts

@@ -20,11 +20,42 @@ export interface IBounds {
     translate: (dx: number, dy: number) => IBounds;
     rotate: (angle: number, x: number, y: number) => IBounds;
     scale: (sx: number, sy: number, x: number, y: number) => IBounds;
+    /**
+     * 并集
+     * @param b
+     * @returns
+     */
     union: (b: IBoundsLike) => IBounds;
+    /**
+     * 交集
+     * @param b
+     * @returns
+     */
     intersect: (b: IBoundsLike) => IBounds;
+    /**
+     * 是否包含b
+     * @param b
+     * @returns
+     */
     encloses: (b: IBoundsLike) => boolean;
+    /**
+     * 是否共边
+     * @param b
+     * @returns
+     */
     alignsWith: (b: IBoundsLike) => boolean;
+    /**
+     * 是否相交
+     * @param b
+     * @returns
+     */
     intersects: (b: IBoundsLike) => boolean;
+    /**
+     * 是否包含
+     * @param x
+     * @param y
+     * @returns
+     */
     contains: (x: number, y: number) => boolean;
     containsPoint: (p: IPointLike) => boolean;
     width: () => number;
@@ -40,7 +71,46 @@ export interface IOBBBounds extends IBounds {
     getRotatedCorners: () => IPointLike[];
 }
 export declare function transformBoundsWithMatrix(out: IBounds, bounds: IBounds, matrix: IMatrix): IBounds;
+/**
+ * 依据graphic的属性对bounds进行变换
+ * @param bounds
+ * @param x
+ * @param y
+ * @param scaleX
+ * @param scaleY
+ * @param angle
+ * @param rotateCenter
+ */
 export declare function transformBounds(bounds: IBounds, x: number, y: number, scaleX: number, scaleY: number, angle: number, rotateCenter?: [number, number]): void;
+/**
+Copyright (c) 2015-2021, University of Washington Interactive Data Lab
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+3. Neither the name of the copyright holder nor the names of its contributors
+  may be used to endorse or promote products derived from this software
+  without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
 export declare class Bounds implements IBounds {
     x1: number;
     y1: number;
@@ -59,11 +129,42 @@ export declare class Bounds implements IBounds {
     translate(dx?: number, dy?: number): Bounds;
     rotate(angle?: number, x?: number, y?: number): Bounds;
     scale(sx?: number, sy?: number, x?: number, y?: number): Bounds;
+    /**
+     * 并集
+     * @param b
+     * @returns
+     */
     union(b: IBoundsLike): Bounds;
+    /**
+     * 交集
+     * @param b
+     * @returns
+     */
     intersect(b: IBoundsLike): Bounds;
+    /**
+     * 是否包含b
+     * @param b
+     * @returns
+     */
     encloses(b: IBoundsLike): boolean;
+    /**
+     * 是否共边
+     * @param b
+     * @returns
+     */
     alignsWith(b: IBoundsLike): boolean;
+    /**
+     * 是否相交
+     * @param b
+     * @returns
+     */
     intersects(b: IBoundsLike): boolean;
+    /**
+     * 是否包含
+     * @param x
+     * @param y
+     * @returns
+     */
     contains(x?: number, y?: number): boolean;
     containsPoint(p: IPointLike): boolean;
     width(): number;