npm - @itwin/core-geometry - Versions diffs - 4.10.0-dev.8 → 4.10.0 - Mend

@itwin/core-geometry 4.10.0-dev.8 → 4.10.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (673) hide show

package/lib/cjs/numerics/SmallSystem.js ADDED Viewed

@@ -0,0 +1,321 @@
+"use strict";
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SmallSystem = void 0;
+/** @packageDocumentation
+ * @module Numerics
+ */
+const Geometry_1 = require("../Geometry");
+const Point2dVector2d_1 = require("../geometry3d/Point2dVector2d");
+const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
+const Polynomials_1 = require("./Polynomials");
+// cspell:word XYUV
+/**
+ * static methods for commonly appearing sets of equations in 2 or 3 variables
+ * @public
+ */
+class SmallSystem {
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection.
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment2dXYTransverseIntersectionUnbounded(a0, a1, b0, b1, result) {
+        const ux = a1.x - a0.x;
+        const uy = a1.y - a0.y;
+        const vx = b1.x - b0.x;
+        const vy = b1.y - b0.y;
+        const cx = b0.x - a0.x;
+        const cy = b0.y - a0.y;
+        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
+        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
+        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
+        if (s !== undefined && t !== undefined) {
+            result.set(s, -t);
+            return true;
+        }
+        result.set(0, 0);
+        return false;
+    }
+    /**
+     * * (ax0,ay0) to (ax0+ux,ay0+uy) are line A.
+     * * (bx0,by0) to (bx0+vx,by0+vy) are lineB.
+     * * Return true if the lines have a simple intersection.
+     * * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegmentXYUVTransverseIntersectionUnbounded(ax0, ay0, ux, uy, bx0, by0, vx, vy, result) {
+        const cx = bx0 - ax0;
+        const cy = by0 - ay0;
+        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
+        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
+        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
+        if (s !== undefined && t !== undefined) {
+            result.set(s, -t);
+            return true;
+        }
+        result.set(0, 0);
+        return false;
+    }
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dXYTransverseIntersectionUnbounded(a0, a1, b0, b1, result) {
+        const ux = a1.x - a0.x;
+        const uy = a1.y - a0.y;
+        const vx = b1.x - b0.x;
+        const vy = b1.y - b0.y;
+        const cx = b0.x - a0.x;
+        const cy = b0.y - a0.y;
+        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
+        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
+        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
+        if (s !== undefined && t !== undefined) {
+            result.set(s, -t);
+            return true;
+        }
+        result.set(0, 0);
+        return false;
+    }
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts of WEIGHTED 4D Points
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param hA0 homogeneous start point of line a
+     * @param hA1 homogeneous end point of line a
+     * @param hB0 homogeneous start point of line b
+     * @param hB1 homogeneous end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dHXYTransverseIntersectionUnbounded(hA0, hA1, hB0, hB1, result) {
+        // Considering only x,y,w parts....
+        // Point Q along B is (in full homogeneous)  `(1-lambda) B0 + lambda 1`
+        // PointQ is colinear with A0,A1 when the determinant det (A0,A1,Q) is zero.  (Each column takes xyw parts)
+        const alpha0 = Geometry_1.Geometry.tripleProduct(hA0.x, hA1.x, hB0.x, hA0.y, hA1.y, hB0.y, hA0.w, hA1.w, hB0.w);
+        const alpha1 = Geometry_1.Geometry.tripleProduct(hA0.x, hA1.x, hB1.x, hA0.y, hA1.y, hB1.y, hA0.w, hA1.w, hB1.w);
+        const fractionB = Geometry_1.Geometry.conditionalDivideFraction(-alpha0, alpha1 - alpha0);
+        if (fractionB !== undefined) {
+            const beta0 = Geometry_1.Geometry.tripleProduct(hB0.x, hB1.x, hA0.x, hB0.y, hB1.y, hA0.y, hB0.w, hB1.w, hA0.w);
+            const beta1 = Geometry_1.Geometry.tripleProduct(hB0.x, hB1.x, hA1.x, hB0.y, hB1.y, hA1.y, hB0.w, hB1.w, hA1.w);
+            const fractionA = Geometry_1.Geometry.conditionalDivideFraction(-beta0, beta1 - beta0);
+            if (fractionA !== undefined)
+                return Point2dVector2d_1.Vector2d.create(fractionA, fractionB, result);
+        }
+        return undefined;
+    }
+    /**
+     * Return the line fraction at which the (homogeneous) line is closest to a space point as viewed in xy only.
+     * @param hA0 homogeneous start point of line a
+     * @param hA1 homogeneous end point of line a
+     * @param spacePoint homogeneous point in space
+     */
+    static lineSegment3dHXYClosestPointUnbounded(hA0, hA1, spacePoint) {
+        // Considering only x,y,w parts....
+        // weighted difference of (A1 w0 - A0 w1) is (cartesian) tangent vector along the line as viewed.
+        // The perpendicular (pure vector) W = (-y,x) flip is the direction of projection
+        // Point Q along A is (in full homogeneous)  `(1-lambda) A0 + lambda 1 A1`
+        // PointQ is colinear with spacePoint and and W when the xyw homogeneous determinant | Q W spacePoint | is zero.
+        const tx = hA1.x * hA0.w - hA0.x * hA1.w;
+        const ty = hA1.y * hA0.w - hA0.y * hA1.w;
+        const det0 = Geometry_1.Geometry.tripleProduct(hA0.x, -ty, spacePoint.x, hA0.y, tx, spacePoint.y, hA0.w, 0, spacePoint.w);
+        const det1 = Geometry_1.Geometry.tripleProduct(hA1.x, -ty, spacePoint.x, hA1.y, tx, spacePoint.y, hA1.w, 0, spacePoint.w);
+        return Geometry_1.Geometry.conditionalDivideFraction(-det0, det1 - det0);
+    }
+    /**
+     * Return the line fraction at which the line is closest to a space point as viewed in xy only.
+     * @param pointA0 start point
+     * @param pointA1 end point
+     * @param spacePoint point in space
+     */
+    static lineSegment3dXYClosestPointUnbounded(pointA0, pointA1, spacePoint) {
+        // Considering only x,y parts....
+        const ux = pointA1.x - pointA0.x;
+        const uy = pointA1.y - pointA0.y;
+        const uu = ux * ux + uy * uy;
+        const vx = spacePoint.x - pointA0.x;
+        const vy = spacePoint.y - pointA0.y;
+        const uv = ux * vx + uy * vy;
+        return Geometry_1.Geometry.conditionalDivideFraction(uv, uu);
+    }
+    /**
+     * Return the line fraction at which the line is closest to a space point
+     * @param pointA0 start point
+     * @param pointA1 end point
+     * @param spacePoint point in space
+     */
+    static lineSegment3dClosestPointUnbounded(pointA0, pointA1, spacePoint) {
+        const ux = pointA1.x - pointA0.x;
+        const uy = pointA1.y - pointA0.y;
+        const uz = pointA1.z - pointA0.z;
+        const uu = ux * ux + uy * uy + uz * uz;
+        const vx = spacePoint.x - pointA0.x;
+        const vy = spacePoint.y - pointA0.y;
+        const vz = spacePoint.z - pointA0.z;
+        const uv = ux * vx + uy * vy + uz * vz;
+        return Geometry_1.Geometry.conditionalDivideFraction(uv, uu);
+    }
+    /**
+     * Return true if lines (a0,a1) to (b0, b1) have closest approach (go by each other) in 3d
+     * Return the fractional (not xy) coordinates in result.x, result.y
+     * @param a0 start point of line a
+     * @param a1  end point of line a
+     * @param b0  start point of line b
+     * @param b1 end point of line b
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static lineSegment3dClosestApproachUnbounded(a0, a1, b0, b1, result) {
+        return this.ray3dXYZUVWClosestApproachUnbounded(a0.x, a0.y, a0.z, a1.x - a0.x, a1.y - a0.y, a1.z - a0.z, b0.x, b0.y, b0.z, b1.x - b0.x, b1.y - b0.y, b1.z - b0.z, result);
+    }
+    /**
+     * Return true if the given rays have closest approach (go by each other) in 3d
+     * Return the fractional (not xy) coordinates as x and y parts of a Point2d.
+     * @param ax x-coordinate of the origin of the first ray
+     * @param ay y-coordinate of the origin of the first ray
+     * @param az z-coordinate of the origin of the first ray
+     * @param au x-coordinate of the direction vector of the first ray
+     * @param av y-coordinate of the direction vector of the first ray
+     * @param aw z-coordinate of the direction vector of the first ray
+     * @param bx x-coordinate of the origin of the second ray
+     * @param by y-coordinate of the origin of the second ray
+     * @param bz z-coordinate of the origin of the second ray
+     * @param bu x-coordinate of the direction vector of the second ray
+     * @param bv y-coordinate of the direction vector of the second ray
+     * @param bw z-coordinate of the direction vector of the second ray
+     * @param result point to receive fractional coordinates of intersection.   result.x is fraction on line a. result.y is fraction on line b.
+     */
+    static ray3dXYZUVWClosestApproachUnbounded(ax, ay, az, au, av, aw, bx, by, bz, bu, bv, bw, result) {
+        const cx = bx - ax;
+        const cy = by - ay;
+        const cz = bz - az;
+        const uu = Geometry_1.Geometry.hypotenuseSquaredXYZ(au, av, aw);
+        const vv = Geometry_1.Geometry.hypotenuseSquaredXYZ(bu, bv, bw);
+        const uv = Geometry_1.Geometry.dotProductXYZXYZ(au, av, aw, bu, bv, bw);
+        const cu = Geometry_1.Geometry.dotProductXYZXYZ(cx, cy, cz, au, av, aw);
+        const cv = Geometry_1.Geometry.dotProductXYZXYZ(cx, cy, cz, bu, bv, bw);
+        return SmallSystem.linearSystem2d(uu, -uv, uv, -vv, cu, cv, result);
+    }
+    /**
+     * Solve the pair of linear equations
+     * * `ux * x + vx * y = cx`
+     * * `uy * x + vy * y = cy`
+     * @param ux xx coefficient
+     * @param vx xy coefficient
+     * @param uy yx coefficient
+     * @param vy yy coefficient
+     * @param cx x right hand side
+     * @param cy y right hand side
+     * @param result (x,y) solution (MUST be preallocated by caller)
+     */
+    static linearSystem2d(ux, vx, // first row of matrix
+    uy, vy, // second row of matrix
+    cx, cy, // right side
+    result) {
+        const uv = Geometry_1.Geometry.crossProductXYXY(ux, uy, vx, vy);
+        const cv = Geometry_1.Geometry.crossProductXYXY(cx, cy, vx, vy);
+        const cu = Geometry_1.Geometry.crossProductXYXY(ux, uy, cx, cy);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(cv, uv);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(cu, uv);
+        if (s !== undefined && t !== undefined) {
+            result.set(s, t);
+            return true;
+        }
+        result.set(0, 0);
+        return false;
+    }
+    /**
+     * Solve a linear system:
+     * * x equation: `axx * u + axy * v + axz * w = cx`
+     * * y equation: `ayx * u + ayy * v + ayz * w = cy`
+     * * z equation: `azx * u + azy * v + azz * w = cz`
+     * @param axx row 0, column 0 coefficient
+     * @param axy row 0, column 1 coefficient
+     * @param axz row 0, column 1 coefficient
+     * @param ayx row 1, column 0 coefficient
+     * @param ayy row 1, column 1 coefficient
+     * @param ayz row 1, column 2 coefficient
+     * @param azx row 2, column 0 coefficient
+     * @param azy row 2, column 1 coefficient
+     * @param azz row 2, column 2 coefficient
+     * @param cx right hand side row 0 coefficient
+     * @param cy right hand side row 1 coefficient
+     * @param cz right hand side row 2 coefficient
+     * @param result optional result.
+     * @returns solution vector (u,v,w) or `undefined` if system is singular.
+     */
+    static linearSystem3d(axx, axy, axz, // first row of matrix
+    ayx, ayy, ayz, // second row of matrix
+    azx, azy, azz, // second row of matrix
+    cx, cy, cz, // right side
+    result) {
+        // determinants of various combinations of columns ...
+        const detXYZ = Geometry_1.Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, axz, ayz, azz);
+        const detCYZ = Geometry_1.Geometry.tripleProduct(cx, cy, cz, axy, ayy, azy, axz, ayz, azz);
+        const detXCZ = Geometry_1.Geometry.tripleProduct(axx, ayx, azx, cx, cy, cz, axz, ayz, azz);
+        const detXYC = Geometry_1.Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, cx, cy, cz);
+        const s = Geometry_1.Geometry.conditionalDivideFraction(detCYZ, detXYZ);
+        const t = Geometry_1.Geometry.conditionalDivideFraction(detXCZ, detXYZ);
+        const u = Geometry_1.Geometry.conditionalDivideFraction(detXYC, detXYZ);
+        if (s !== undefined && t !== undefined && u !== undefined) {
+            return Point3dVector3d_1.Vector3d.create(s, t, u, result);
+        }
+        return undefined;
+    }
+    /**
+     * Compute the intersection of three planes.
+     * @param xyzA point on the first plane
+     * @param normalA normal of the first plane
+     * @param xyzB point on the second plane
+     * @param normalB normal of the second plane
+     * @param xyzC point on the third plane
+     * @param normalC normal of the third plane
+     * @param result optional result
+     * @returns intersection point of the three planes (as a Vector3d), or undefined if at least two planes are parallel.
+     */
+    static intersect3Planes(xyzA, normalA, xyzB, normalB, xyzC, normalC, result) {
+        return this.linearSystem3d(normalA.x, normalA.y, normalA.z, normalB.x, normalB.y, normalB.z, normalC.x, normalC.y, normalC.z, Geometry_1.Geometry.dotProductXYZXYZ(xyzA.x, xyzA.y, xyzA.z, normalA.x, normalA.y, normalA.z), Geometry_1.Geometry.dotProductXYZXYZ(xyzB.x, xyzB.y, xyzB.z, normalB.x, normalB.y, normalB.z), Geometry_1.Geometry.dotProductXYZXYZ(xyzC.x, xyzC.y, xyzC.z, normalC.x, normalC.y, normalC.z), result);
+    }
+    /**
+     * * in rowB, replace `rowB[j] += a * rowB[pivot] * rowA[j] / rowA[pivot]` for `j>pivot`
+     * @param rowA row that does not change
+     * @param pivotIndex index of pivot (divisor) in rowA.
+     * @param rowB row where elimination occurs.
+     */
+    static eliminateFromPivot(rowA, pivotIndex, rowB, a) {
+        const n = rowA.length;
+        let q = Geometry_1.Geometry.conditionalDivideFraction(rowB[pivotIndex], rowA[pivotIndex]);
+        if (q === undefined)
+            return false;
+        q *= a;
+        for (let j = pivotIndex + 1; j < n; j++)
+            rowB[j] += q * rowA[j];
+        return true;
+    }
+    /**
+     * Solve a pair of bilinear equations
+     * * First equation: `a0 + b0 * u + c0 * v + d0 * u * v = 0`
+     * * Second equation: `a1 + b1 * u + c1 * v + d1 * u * v = 0`
+     */
+    static solveBilinearPair(a0, b0, c0, d0, a1, b1, c1, d1) {
+        return Polynomials_1.BilinearPolynomial.solveBilinearPair(a0, b0, c0, d0, a1, b1, c1, d1);
+    }
+}
+exports.SmallSystem = SmallSystem;
+//# sourceMappingURL=SmallSystem.js.map

package/lib/cjs/numerics/SmallSystem.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"SmallSystem.js","sourceRoot":"","sources":["../../../src/numerics/SmallSystem.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAkE;AAClE,mEAAkE;AAGlE,+CAAmD;AAEnD,mBAAmB;AAEnB;;;GAGG;AACH,MAAa,WAAW;IACtB;;;;;;;;OAQG;IACI,MAAM,CAAC,8CAA8C,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EAC7G,MAAgB;QAChB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,8CAA8C,CAC1D,GAAW,EAAE,GAAW,EAAE,EAAU,EAAE,EAAU,EAChD,GAAW,EAAE,GAAW,EAAE,EAAU,EAAE,EAAU,EAChD,MAAgB;QAEhB,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;QACrB,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;QAErB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,8CAA8C,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EAC7G,MAAgB;QAChB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAEvB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAClB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,+CAA+C,CAAC,GAAY,EAAE,GAAY,EAAE,GAAY,EAAE,GAAY,EAAE,MAAiB;QACrI,mCAAmC;QACnC,uEAAuE;QACvE,2GAA2G;QAC3G,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CACnC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CACnC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,SAAS,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC;QAC/E,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,mBAAQ,CAAC,aAAa,CAClC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,mBAAQ,CAAC,aAAa,CAClC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EACnB,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,SAAS,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;YAC5E,IAAI,SAAS,KAAK,SAAS;gBACzB,OAAO,0BAAQ,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACzD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,qCAAqC,CAAC,GAAY,EAAE,GAAY,EAAE,UAAmB;QACjG,mCAAmC;QACnC,iGAAiG;QACjG,iFAAiF;QACjF,0EAA0E;QAC1E,gHAAgH;QAChH,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,IAAI,GAAG,mBAAQ,CAAC,aAAa,CACjC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,EACxB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,EACvB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,mBAAQ,CAAC,aAAa,CACjC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,EACxB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,EACvB,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC;IAChE,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,oCAAoC,CAAC,OAAc,EAAE,OAAc,EAAE,UAAiB;QAClG,iCAAiC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAC7B,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,kCAAkC,CAAC,OAAgB,EAAE,OAAgB,EAAE,UAAmB;QACtG,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACvC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACvC,OAAO,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACpD,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,EAAW,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW,EACpG,MAAgB;QAChB,OAAO,IAAI,CAAC,mCAAmC,CAC7C,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAChB,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EACrC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAChB,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EACrC,MAAM,CAAC,CAAC;IACZ,CAAC;IACD;;;;;;;;;;;;;;;;OAgBG;IACI,MAAM,CAAC,mCAAmC,CAC/C,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EACtE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EACtE,MAAgB;QAEhB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;QAEnB,MAAM,EAAE,GAAG,mBAAQ,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,OAAO,WAAW,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IACtE,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,cAAc,CAC1B,EAAU,EAAE,EAAU,EAAE,sBAAsB;IAC9C,EAAU,EAAE,EAAU,EAAE,uBAAuB;IAC/C,EAAU,EAAE,EAAU,EAAE,aAAa;IACrC,MAAgB;QAEhB,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;;;;;;;;;;OAmBG;IACI,MAAM,CAAC,cAAc,CAC1B,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,sBAAsB;IAC7D,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,uBAAuB;IAC9D,GAAW,EAAE,GAAW,EAAE,GAAW,EAAE,uBAAuB;IAC9D,EAAU,EAAE,EAAU,EAAE,EAAU,EAAK,aAAa;IACpD,MAAiB;QAEjB,sDAAsD;QACtD,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChF,MAAM,MAAM,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAChF,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YAC1D,OAAO,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAC5B,IAAa,EAAE,OAAiB,EAChC,IAAa,EAAE,OAAiB,EAChC,IAAa,EAAE,OAAiB,EAAE,MAAiB;QACnD,OAAO,IAAI,CAAC,cAAc,CACxB,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAC/B,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAClF,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAClF,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAAC,IAAkB,EAAE,UAAkB,EAAE,IAAkB,EAAE,CAAS;QACpG,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAClC,CAAC,IAAI,CAAC,CAAC;QACP,KAAK,IAAI,CAAC,GAAG,UAAU,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACrC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iBAAiB,CAC7B,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAC9C,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;QAE9C,OAAO,gCAAkB,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;IAC9E,CAAC;CACF;AA3WD,kCA2WC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Numerics\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { Point4d } from \"../geometry4d/Point4d\";\nimport { BilinearPolynomial } from \"./Polynomials\";\n\n// cspell:word XYUV\n\n/**\n * static methods for commonly appearing sets of equations in 2 or 3 variables\n * @public\n */\nexport class SmallSystem {\n /**\n * Return true if lines (a0,a1) to (b0, b1) have a simple intersection.\n * Return the fractional (not xy) coordinates in result.x, result.y\n * @param a0 start point of line a\n * @param a1 end point of line a\n * @param b0 start point of line b\n * @param b1 end point of line b\n * @param result point to receive fractional coordinates of intersection. result.x is fraction on line a. result.y is fraction on line b.\n */\n public static lineSegment2dXYTransverseIntersectionUnbounded(a0: Point2d, a1: Point2d, b0: Point2d, b1: Point2d,\n result: Vector2d): boolean {\n const ux = a1.x - a0.x;\n const uy = a1.y - a0.y;\n\n const vx = b1.x - b0.x;\n const vy = b1.y - b0.y;\n\n const cx = b0.x - a0.x;\n const cy = b0.y - a0.y;\n\n const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n const s = Geometry.conditionalDivideFraction(cv, uv);\n const t = Geometry.conditionalDivideFraction(cu, uv);\n if (s !== undefined && t !== undefined) {\n result.set(s, -t);\n return true;\n }\n result.set(0, 0);\n return false;\n }\n /**\n * * (ax0,ay0) to (ax0+ux,ay0+uy) are line A.\n * * (bx0,by0) to (bx0+vx,by0+vy) are lineB.\n * * Return true if the lines have a simple intersection.\n * * Return the fractional (not xy) coordinates in result.x, result.y\n * @param result point to receive fractional coordinates of intersection. result.x is fraction on line a. result.y is fraction on line b.\n */\n public static lineSegmentXYUVTransverseIntersectionUnbounded(\n ax0: number, ay0: number, ux: number, uy: number,\n bx0: number, by0: number, vx: number, vy: number,\n result: Vector2d): boolean {\n\n const cx = bx0 - ax0;\n const cy = by0 - ay0;\n\n const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n const s = Geometry.conditionalDivideFraction(cv, uv);\n const t = Geometry.conditionalDivideFraction(cu, uv);\n if (s !== undefined && t !== undefined) {\n result.set(s, -t);\n return true;\n }\n result.set(0, 0);\n return false;\n }\n\n /**\n * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts\n * Return the fractional (not xy) coordinates in result.x, result.y\n * @param a0 start point of line a\n * @param a1 end point of line a\n * @param b0 start point of line b\n * @param b1 end point of line b\n * @param result point to receive fractional coordinates of intersection. result.x is fraction on line a. result.y is fraction on line b.\n */\n public static lineSegment3dXYTransverseIntersectionUnbounded(a0: Point3d, a1: Point3d, b0: Point3d, b1: Point3d,\n result: Vector2d): boolean {\n const ux = a1.x - a0.x;\n const uy = a1.y - a0.y;\n\n const vx = b1.x - b0.x;\n const vy = b1.y - b0.y;\n\n const cx = b0.x - a0.x;\n const cy = b0.y - a0.y;\n\n const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n const s = Geometry.conditionalDivideFraction(cv, uv);\n const t = Geometry.conditionalDivideFraction(cu, uv);\n if (s !== undefined && t !== undefined) {\n result.set(s, -t);\n return true;\n }\n result.set(0, 0);\n return false;\n }\n\n /**\n * Return true if lines (a0,a1) to (b0, b1) have a simple intersection using only xy parts of WEIGHTED 4D Points\n * Return the fractional (not xy) coordinates in result.x, result.y\n * @param hA0 homogeneous start point of line a\n * @param hA1 homogeneous end point of line a\n * @param hB0 homogeneous start point of line b\n * @param hB1 homogeneous end point of line b\n * @param result point to receive fractional coordinates of intersection. result.x is fraction on line a. result.y is fraction on line b.\n */\n public static lineSegment3dHXYTransverseIntersectionUnbounded(hA0: Point4d, hA1: Point4d, hB0: Point4d, hB1: Point4d, result?: Vector2d): Vector2d | undefined {\n // Considering only x,y,w parts....\n // Point Q along B is (in full homogeneous) `(1-lambda) B0 + lambda 1`\n // PointQ is colinear with A0,A1 when the determinant det (A0,A1,Q) is zero. (Each column takes xyw parts)\n const alpha0 = Geometry.tripleProduct(\n hA0.x, hA1.x, hB0.x,\n hA0.y, hA1.y, hB0.y,\n hA0.w, hA1.w, hB0.w);\n const alpha1 = Geometry.tripleProduct(\n hA0.x, hA1.x, hB1.x,\n hA0.y, hA1.y, hB1.y,\n hA0.w, hA1.w, hB1.w);\n const fractionB = Geometry.conditionalDivideFraction(-alpha0, alpha1 - alpha0);\n if (fractionB !== undefined) {\n const beta0 = Geometry.tripleProduct(\n hB0.x, hB1.x, hA0.x,\n hB0.y, hB1.y, hA0.y,\n hB0.w, hB1.w, hA0.w);\n const beta1 = Geometry.tripleProduct(\n hB0.x, hB1.x, hA1.x,\n hB0.y, hB1.y, hA1.y,\n hB0.w, hB1.w, hA1.w);\n const fractionA = Geometry.conditionalDivideFraction(-beta0, beta1 - beta0);\n if (fractionA !== undefined)\n return Vector2d.create(fractionA, fractionB, result);\n }\n return undefined;\n }\n\n /**\n * Return the line fraction at which the (homogeneous) line is closest to a space point as viewed in xy only.\n * @param hA0 homogeneous start point of line a\n * @param hA1 homogeneous end point of line a\n * @param spacePoint homogeneous point in space\n */\n public static lineSegment3dHXYClosestPointUnbounded(hA0: Point4d, hA1: Point4d, spacePoint: Point4d): number | undefined {\n // Considering only x,y,w parts....\n // weighted difference of (A1 w0 - A0 w1) is (cartesian) tangent vector along the line as viewed.\n // The perpendicular (pure vector) W = (-y,x) flip is the direction of projection\n // Point Q along A is (in full homogeneous) `(1-lambda) A0 + lambda 1 A1`\n // PointQ is colinear with spacePoint and and W when the xyw homogeneous determinant | Q W spacePoint | is zero.\n const tx = hA1.x * hA0.w - hA0.x * hA1.w;\n const ty = hA1.y * hA0.w - hA0.y * hA1.w;\n const det0 = Geometry.tripleProduct(\n hA0.x, -ty, spacePoint.x,\n hA0.y, tx, spacePoint.y,\n hA0.w, 0, spacePoint.w);\n const det1 = Geometry.tripleProduct(\n hA1.x, -ty, spacePoint.x,\n hA1.y, tx, spacePoint.y,\n hA1.w, 0, spacePoint.w);\n return Geometry.conditionalDivideFraction(-det0, det1 - det0);\n }\n\n /**\n * Return the line fraction at which the line is closest to a space point as viewed in xy only.\n * @param pointA0 start point\n * @param pointA1 end point\n * @param spacePoint point in space\n */\n public static lineSegment3dXYClosestPointUnbounded(pointA0: XAndY, pointA1: XAndY, spacePoint: XAndY): number | undefined {\n // Considering only x,y parts....\n const ux = pointA1.x - pointA0.x;\n const uy = pointA1.y - pointA0.y;\n const uu = ux * ux + uy * uy;\n const vx = spacePoint.x - pointA0.x;\n const vy = spacePoint.y - pointA0.y;\n const uv = ux * vx + uy * vy;\n return Geometry.conditionalDivideFraction(uv, uu);\n }\n\n /**\n * Return the line fraction at which the line is closest to a space point\n * @param pointA0 start point\n * @param pointA1 end point\n * @param spacePoint point in space\n */\n public static lineSegment3dClosestPointUnbounded(pointA0: Point3d, pointA1: Point3d, spacePoint: Point3d): number | undefined {\n const ux = pointA1.x - pointA0.x;\n const uy = pointA1.y - pointA0.y;\n const uz = pointA1.z - pointA0.z;\n const uu = ux * ux + uy * uy + uz * uz;\n const vx = spacePoint.x - pointA0.x;\n const vy = spacePoint.y - pointA0.y;\n const vz = spacePoint.z - pointA0.z;\n const uv = ux * vx + uy * vy + uz * vz;\n return Geometry.conditionalDivideFraction(uv, uu);\n }\n\n /**\n * Return true if lines (a0,a1) to (b0, b1) have closest approach (go by each other) in 3d\n * Return the fractional (not xy) coordinates in result.x, result.y\n * @param a0 start point of line a\n * @param a1 end point of line a\n * @param b0 start point of line b\n * @param b1 end point of line b\n * @param result point to receive fractional coordinates of intersection. result.x is fraction on line a. result.y is fraction on line b.\n */\n public static lineSegment3dClosestApproachUnbounded(a0: Point3d, a1: Point3d, b0: Point3d, b1: Point3d,\n result: Vector2d): boolean {\n return this.ray3dXYZUVWClosestApproachUnbounded(\n a0.x, a0.y, a0.z,\n a1.x - a0.x, a1.y - a0.y, a1.z - a0.z,\n b0.x, b0.y, b0.z,\n b1.x - b0.x, b1.y - b0.y, b1.z - b0.z,\n result);\n }\n /**\n * Return true if the given rays have closest approach (go by each other) in 3d\n * Return the fractional (not xy) coordinates as x and y parts of a Point2d.\n * @param ax x-coordinate of the origin of the first ray\n * @param ay y-coordinate of the origin of the first ray\n * @param az z-coordinate of the origin of the first ray\n * @param au x-coordinate of the direction vector of the first ray\n * @param av y-coordinate of the direction vector of the first ray\n * @param aw z-coordinate of the direction vector of the first ray\n * @param bx x-coordinate of the origin of the second ray\n * @param by y-coordinate of the origin of the second ray\n * @param bz z-coordinate of the origin of the second ray\n * @param bu x-coordinate of the direction vector of the second ray\n * @param bv y-coordinate of the direction vector of the second ray\n * @param bw z-coordinate of the direction vector of the second ray\n * @param result point to receive fractional coordinates of intersection. result.x is fraction on line a. result.y is fraction on line b.\n */\n public static ray3dXYZUVWClosestApproachUnbounded(\n ax: number, ay: number, az: number, au: number, av: number, aw: number,\n bx: number, by: number, bz: number, bu: number, bv: number, bw: number,\n result: Vector2d): boolean {\n\n const cx = bx - ax;\n const cy = by - ay;\n const cz = bz - az;\n\n const uu = Geometry.hypotenuseSquaredXYZ(au, av, aw);\n const vv = Geometry.hypotenuseSquaredXYZ(bu, bv, bw);\n const uv = Geometry.dotProductXYZXYZ(au, av, aw, bu, bv, bw);\n const cu = Geometry.dotProductXYZXYZ(cx, cy, cz, au, av, aw);\n const cv = Geometry.dotProductXYZXYZ(cx, cy, cz, bu, bv, bw);\n return SmallSystem.linearSystem2d(uu, -uv, uv, -vv, cu, cv, result);\n }\n /**\n * Solve the pair of linear equations\n * * `ux * x + vx * y = cx`\n * * `uy * x + vy * y = cy`\n * @param ux xx coefficient\n * @param vx xy coefficient\n * @param uy yx coefficient\n * @param vy yy coefficient\n * @param cx x right hand side\n * @param cy y right hand side\n * @param result (x,y) solution (MUST be preallocated by caller)\n */\n public static linearSystem2d(\n ux: number, vx: number, // first row of matrix\n uy: number, vy: number, // second row of matrix\n cx: number, cy: number, // right side\n result: Vector2d,\n ): boolean {\n const uv = Geometry.crossProductXYXY(ux, uy, vx, vy);\n const cv = Geometry.crossProductXYXY(cx, cy, vx, vy);\n const cu = Geometry.crossProductXYXY(ux, uy, cx, cy);\n const s = Geometry.conditionalDivideFraction(cv, uv);\n const t = Geometry.conditionalDivideFraction(cu, uv);\n if (s !== undefined && t !== undefined) {\n result.set(s, t);\n return true;\n }\n result.set(0, 0);\n return false;\n }\n /**\n * Solve a linear system:\n * * x equation: `axx * u + axy * v + axz * w = cx`\n * * y equation: `ayx * u + ayy * v + ayz * w = cy`\n * * z equation: `azx * u + azy * v + azz * w = cz`\n * @param axx row 0, column 0 coefficient\n * @param axy row 0, column 1 coefficient\n * @param axz row 0, column 1 coefficient\n * @param ayx row 1, column 0 coefficient\n * @param ayy row 1, column 1 coefficient\n * @param ayz row 1, column 2 coefficient\n * @param azx row 2, column 0 coefficient\n * @param azy row 2, column 1 coefficient\n * @param azz row 2, column 2 coefficient\n * @param cx right hand side row 0 coefficient\n * @param cy right hand side row 1 coefficient\n * @param cz right hand side row 2 coefficient\n * @param result optional result.\n * @returns solution vector (u,v,w) or `undefined` if system is singular.\n */\n public static linearSystem3d(\n axx: number, axy: number, axz: number, // first row of matrix\n ayx: number, ayy: number, ayz: number, // second row of matrix\n azx: number, azy: number, azz: number, // second row of matrix\n cx: number, cy: number, cz: number, // right side\n result?: Vector3d,\n ): Vector3d | undefined {\n // determinants of various combinations of columns ...\n const detXYZ = Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, axz, ayz, azz);\n const detCYZ = Geometry.tripleProduct(cx, cy, cz, axy, ayy, azy, axz, ayz, azz);\n const detXCZ = Geometry.tripleProduct(axx, ayx, azx, cx, cy, cz, axz, ayz, azz);\n const detXYC = Geometry.tripleProduct(axx, ayx, azx, axy, ayy, azy, cx, cy, cz);\n const s = Geometry.conditionalDivideFraction(detCYZ, detXYZ);\n const t = Geometry.conditionalDivideFraction(detXCZ, detXYZ);\n const u = Geometry.conditionalDivideFraction(detXYC, detXYZ);\n if (s !== undefined && t !== undefined && u !== undefined) {\n return Vector3d.create(s, t, u, result);\n }\n return undefined;\n }\n /**\n * Compute the intersection of three planes.\n * @param xyzA point on the first plane\n * @param normalA normal of the first plane\n * @param xyzB point on the second plane\n * @param normalB normal of the second plane\n * @param xyzC point on the third plane\n * @param normalC normal of the third plane\n * @param result optional result\n * @returns intersection point of the three planes (as a Vector3d), or undefined if at least two planes are parallel.\n */\n public static intersect3Planes(\n xyzA: Point3d, normalA: Vector3d,\n xyzB: Point3d, normalB: Vector3d,\n xyzC: Point3d, normalC: Vector3d, result?: Vector3d): Vector3d | undefined {\n return this.linearSystem3d(\n normalA.x, normalA.y, normalA.z,\n normalB.x, normalB.y, normalB.z,\n normalC.x, normalC.y, normalC.z,\n Geometry.dotProductXYZXYZ(xyzA.x, xyzA.y, xyzA.z, normalA.x, normalA.y, normalA.z),\n Geometry.dotProductXYZXYZ(xyzB.x, xyzB.y, xyzB.z, normalB.x, normalB.y, normalB.z),\n Geometry.dotProductXYZXYZ(xyzC.x, xyzC.y, xyzC.z, normalC.x, normalC.y, normalC.z), result);\n }\n\n /**\n * * in rowB, replace `rowB[j] += a * rowB[pivot] * rowA[j] / rowA[pivot]` for `j>pivot`\n * @param rowA row that does not change\n * @param pivotIndex index of pivot (divisor) in rowA.\n * @param rowB row where elimination occurs.\n */\n public static eliminateFromPivot(rowA: Float64Array, pivotIndex: number, rowB: Float64Array, a: number): boolean {\n const n = rowA.length;\n let q = Geometry.conditionalDivideFraction(rowB[pivotIndex], rowA[pivotIndex]);\n if (q === undefined) return false;\n q *= a;\n for (let j = pivotIndex + 1; j < n; j++)\n rowB[j] += q * rowA[j];\n return true;\n }\n /**\n * Solve a pair of bilinear equations\n * * First equation: `a0 + b0 * u + c0 * v + d0 * u * v = 0`\n * * Second equation: `a1 + b1 * u + c1 * v + d1 * u * v = 0`\n */\n public static solveBilinearPair(\n a0: number, b0: number, c0: number, d0: number,\n a1: number, b1: number, c1: number, d1: number,\n ): Point2d[] | undefined {\n return BilinearPolynomial.solveBilinearPair(a0, b0, c0, d0, a1, b1, c1, d1);\n }\n}\n"]}

package/lib/cjs/numerics/TriDiagonalSystem.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"TriDiagonalSystem.js","sourceRoot":"","sources":["../../../src/numerics/TriDiagonalSystem.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAwD;AAExD,kGAAkG;AAClG,IAAK,SAIJ;AAJD,WAAK,SAAS;IACZ,mDAAS,CAAA;IACT,iDAAQ,CAAA;IACR,yDAAY,CAAA;AACd,CAAC,EAJI,SAAS,KAAT,SAAS,QAIb;AACD;;;GAGG;AACH,MAAa,iBAAiB;IAe5B,YAAY,CAAS;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,0DAA0D;IACnD,KAAK;QACV,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACpF,CAAC;IACH,CAAC;IACD,0CAA0C;IACnC,MAAM,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QAClE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QACpE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;IAC7B,CAAC;IACD,gDAAgD;IACzC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,mDAAmD;IAC5C,MAAM,CAAC,GAAW,EAAE,EAAU;QACnC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IACD,iDAAiD;IAC1C,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,8CAA8C;IACvC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,6CAA6C;IACtC,KAAK;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IACD,0CAA0C;IACnC,UAAU;QACf,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAE/C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChH,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACjF,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0CAA0C;IACnC,gBAAgB,CAAC,MAAiB,EAAE,MAAiB;QAC1D,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;YAClC,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAE9B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAElD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,CAAC;YACD,yBAAO,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhE,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,yBAAO,CAAC,gBAAgB,CACtB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EACxD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;YACD,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACtG,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0EAA0E;IACnE,QAAQ;QACb,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,mEAAmE;IAC5D,MAAM;QACX,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,YAAY,CAAC;QAEzC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAI,mBAAmB;QACzD,4BAA4B;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,KAAK,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,4DAA4D;IACrD,uBAAuB;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,+BAA+B;QAC/B,iFAAiF;QACjF,4DAA4D;QAC5D,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChF,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sGAAsG;IAC/F,kCAAkC,CAAC,OAAkB,EAAE,OAAkB;QAC9E,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YACpB,OAAO,KAAK,CAAC;QAEf,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,6BAA6B;QAC7B,iFAAiF;QACjF,4DAA4D;QAC5D,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAEnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+BAA+B;IACxB,IAAI;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,8DAA8D;IACvD,OAAO;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8DAA8D;IACvD,iBAAiB,CAAC,IAAe;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1F,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhSD,8CAgSC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n /\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\n\r\n// Enumerated type lies outside of TriDiagonalSystem, as TSLint prevented declaration within class\r\nenum DataState {\r\n RawMatrix,\r\n FactorOK,\r\n FactorFailed,\r\n}\r\n/\r\n Linear system operations on a matrix with data only on the diagonal and its immediate left and right neighbors\r\n * @internal\r\n /\r\nexport class TriDiagonalSystem {\r\n\r\n // Lower diagonal, indexed by rows\r\n private _aLeft: Float64Array;\r\n // Upper diagonal, indexed by rows\r\n private _aRight: Float64Array;\r\n // Main diagonal, indexed by rows\r\n private _aDiag: Float64Array;\r\n // Right side vector\r\n private _b: Float64Array;\r\n // Solution vector\r\n private _x: Float64Array;\r\n\r\n private _dataState!: DataState;\r\n\r\n constructor(n: number) {\r\n this._aLeft = new Float64Array(n);\r\n this._aDiag = new Float64Array(n);\r\n this._aRight = new Float64Array(n);\r\n this._b = new Float64Array(n);\r\n this._x = new Float64Array(n);\r\n this.reset();\r\n }\r\n\r\n /* Reset to RawMatrix state with all coefficients zero /\r\n public reset() {\r\n this._dataState = DataState.RawMatrix;\r\n const n = this._aDiag.length;\r\n for (let i = 0; i < n; i++) {\r\n this._aLeft[i] = this._aRight[i] = this._aDiag[i] = this._b[i] = this._x[i] = 0.0;\r\n }\r\n }\r\n /* Install data in a row of the matrix /\r\n public setRow(row: number, left: number, diag: number, right: number) {\r\n this._aLeft[row] = left;\r\n this._aDiag[row] = diag;\r\n this._aRight[row] = right;\r\n }\r\n /* Add to row of matrix /\r\n public addToRow(row: number, left: number, diag: number, right: number) {\r\n this._aLeft[row] += left;\r\n this._aDiag[row] += diag;\r\n this._aRight[row] += right;\r\n }\r\n /* Install data in the right side (B) vector /\r\n public setB(row: number, bb: number) {\r\n this._b[row] = bb;\r\n }\r\n /* Add to an entry in the right side (B) vector /\r\n public addToB(row: number, bb: number) {\r\n this._b[row] += bb;\r\n }\r\n /* Access data from the right side (B) vector /\r\n public getB(row: number): number {\r\n return this._b[row];\r\n }\r\n /* Install data in the solution (X) vector /\r\n public setX(row: number, xx: number) {\r\n this._x[row] = xx;\r\n }\r\n /* Access data from the solution (X) vector /\r\n public getX(row: number): number {\r\n return this._x[row];\r\n }\r\n /* Get method for matrix and vector order /\r\n public order(): number {\r\n return this._aDiag.length;\r\n }\r\n /* Compute product of AX and save as B /\r\n public multiplyAX(): boolean {\r\n if (this._dataState === DataState.FactorFailed) {\r\n return false;\r\n } else if (this._dataState === DataState.FactorOK) {\r\n const n = this._aDiag.length;\r\n const nm1 = n - 1;\r\n for (let i = 0; i < nm1; i++) {\r\n this._b[i] = this._aDiag[i] this._x[i] + this._aRight[i] * this._x[i + 1];\r\n }\r\n this._b[nm1] = this._aDiag[nm1] * this._x[nm1];\r\n\r\n for (let i = nm1; i > 0; i--) {\r\n this._b[i] += this._aLeft[i] * this._b[i - 1];\r\n }\r\n\r\n return true;\r\n } else {\r\n const n = this._aDiag.length;\r\n const nm1 = n - 1;\r\n this._b[0] = this._aDiag[0] * this._x[0] + this._aRight[0] * this._x[1];\r\n let i;\r\n for (i = 1; i < nm1; i++) {\r\n this._b[i] = this._aLeft[i] * this._x[i - 1] + this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];\r\n }\r\n this._b[nm1] = this._aLeft[nm1] * this._x[n - 2] + this._aDiag[i] * this._x[nm1];\r\n return true;\r\n }\r\n }\r\n\r\n /** Compute product of AX and save as B /\r\n public multiplyAXPoints(pointX: Point3d[], pointB: Point3d[]): boolean {\r\n pointB.length = 0;\r\n while (pointB.length < pointX.length)\r\n pointB.push(Point3d.create());\r\n pointB.length = pointX.length;\r\n\r\n if (this._dataState === DataState.FactorFailed) {\r\n return false;\r\n } else if (this._dataState === DataState.FactorOK) {\r\n\r\n const n = this._aDiag.length;\r\n const nm1 = n - 1;\r\n for (let i = 0; i < nm1; i++) {\r\n Point3d.createAdd2Scaled(pointX[i], this._aDiag[i], pointX[i + 1], this._aRight[i], pointB[i]);\r\n }\r\n Point3d.createScale(pointX[nm1], this._aDiag[nm1], pointB[nm1]);\r\n\r\n for (let i = nm1; i > 0; i--) {\r\n pointB[i].plusScaled(pointB[i - 1], this._aLeft[i], pointB[i]);\r\n }\r\n\r\n return true;\r\n } else {\r\n const n = this._aDiag.length;\r\n const nm1 = n - 1;\r\n Point3d.createAdd2Scaled(pointX[0], this._aDiag[0], pointX[1], this._aRight[0], pointB[0]);\r\n let i;\r\n for (i = 1; i < nm1; i++) {\r\n Point3d.createAdd3Scaled(\r\n pointX[i - 1], this._aLeft[i], pointX[i], this._aDiag[i],\r\n pointX[i + 1], this._aRight[i],\r\n pointB[i]);\r\n }\r\n Point3d.createAdd2Scaled(pointX[n - 2], this._aLeft[nm1], pointX[nm1], this._aDiag[nm1], pointB[nm1]);\r\n return true;\r\n }\r\n }\r\n\r\n /* Multiply the stored factors together to return to plain matrix form /\r\n public defactor(): boolean {\r\n if (this._dataState === DataState.RawMatrix) {\r\n return true;\r\n }\r\n if (this._dataState === DataState.FactorFailed) {\r\n return false;\r\n }\r\n const n = this._aDiag.length;\r\n const nm1 = n - 1;\r\n\r\n for (let i = nm1; i > 0; i--) {\r\n this._aDiag[i] += this._aLeft[i] this._aRight[i - 1];\r\n this._aLeft[i] = this._aDiag[i - 1];\r\n }\r\n this._dataState = DataState.RawMatrix;\r\n return true;\r\n }\r\n /* Factor the tridiagonal matrix to LU parts. b, x, not altered /\r\n public factor(): boolean {\r\n if (this._dataState === DataState.FactorOK) {\r\n return true;\r\n }\r\n if (this._dataState !== DataState.RawMatrix) {\r\n return false;\r\n }\r\n this._dataState = DataState.FactorFailed;\r\n\r\n const n1 = this._aDiag.length - 1; // Last pivot index\r\n // Eliminate in subdiagonal.\r\n for (let i = 0; i < n1; i++) {\r\n const r = Geometry.conditionalDivideFraction(this._aLeft[i + 1], this._aDiag[i]);\r\n if (r === undefined)\r\n return false;\r\n this._aLeft[i + 1] = r;\r\n this._aDiag[i + 1] -= r this._aRight[i];\r\n }\r\n this._dataState = DataState.FactorOK;\r\n return true;\r\n }\r\n /** Solve AX=B. A is left in factored state. B unchanged. /\r\n public factorAndBackSubstitute(): boolean {\r\n const n = this._aDiag.length;\r\n const n1 = n - 1;\r\n if (!this.factor())\r\n return false;\r\n\r\n // Apply L inverse to B, same sequence as was done to A:\r\n for (let i = 0; i < n; i++) {\r\n this._x[i] = this._b[i];\r\n }\r\n for (let i = 1; i < n; i++) {\r\n this._x[i] -= this._aLeft[i] this._x[i - 1];\r\n }\r\n\r\n // Print (\"LU L Inverse B B\");\r\n // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\r\n // All diagonals are known to be nonzero. Really. Really???\r\n this._x[n1] /= this._aDiag[n1];\r\n\r\n for (let i = n1 - 1; i >= 0; i--) {\r\n this._x[i] = (this._x[i] - this._aRight[i] * this._x[i + 1]) / this._aDiag[i];\r\n }\r\n\r\n return true;\r\n }\r\n /** Solve AX=B. A is left in factored state. B unchanged. vectorB and vectorX may be the same array /\r\n public factorAndBackSubstitutePointArrays(vectorB: Point3d[], vectorX: Point3d[]): boolean {\r\n const n = this._aDiag.length;\r\n if (vectorB.length < n)\r\n return false;\r\n\r\n while (vectorX.length < n)\r\n vectorX.push(Point3d.create(0, 0, 0));\r\n vectorX.length = n;\r\n const n1 = n - 1;\r\n if (!this.factor())\r\n return false;\r\n\r\n // Apply L inverse to B, same sequence as was done to A:\r\n if (vectorB !== vectorX) {\r\n for (let i = 0; i < n; i++) {\r\n vectorX[i].setFrom(vectorB[i]);\r\n }\r\n }\r\n\r\n let a: number;\r\n let b: number;\r\n for (let i = 1; i < n; i++) {\r\n a = this._aLeft[i];\r\n vectorX[i].x -= a vectorX[i - 1].x;\r\n vectorX[i].y -= a * vectorX[i - 1].y;\r\n vectorX[i].z -= a * vectorX[i - 1].z;\r\n }\r\n\r\n // Print (\"LU L inverse B\");\r\n // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\r\n // All diagonals are known to be nonzero. Really. Really???\r\n b = 1.0 / this._aDiag[n1];\r\n vectorX[n1].x = b;\r\n vectorX[n1].y = b;\r\n vectorX[n1].z = b;\r\n\r\n for (let i = n1 - 1; i >= 0; i--) {\r\n a = this._aRight[i];\r\n b = 1.0 / this._aDiag[i];\r\n vectorX[i].x = (vectorX[i].x - a vectorX[i + 1].x) * b;\r\n vectorX[i].y = (vectorX[i].y - a * vectorX[i + 1].y) * b;\r\n vectorX[i].z = (vectorX[i].z - a * vectorX[i + 1].z) * b;\r\n }\r\n\r\n return true;\r\n }\r\n /** Allocate a complete copy /\r\n public copy(): TriDiagonalSystem {\r\n const n = this._aDiag.length;\r\n const B = new TriDiagonalSystem(n);\r\n for (let i = 0; i < n; i++) {\r\n B._aLeft[i] = this._aLeft[i];\r\n B._aDiag[i] = this._aDiag[i];\r\n B._aRight[i] = this._aRight[i];\r\n B._x[i] = this._x[i];\r\n B._b[i] = this._b[i];\r\n }\r\n B._dataState = this._dataState;\r\n return B;\r\n }\r\n\r\n /* return an array form that may be useful for display ... /\r\n public flatten(): any {\r\n const n = this._aDiag.length;\r\n const data = [];\r\n\r\n for (let i = 0; i < n; i++) {\r\n data.push(\r\n [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], this._b[i]]);\r\n }\r\n return data;\r\n }\r\n\r\n /* return an array form that may be useful for display ... */\r\n public flattenWithPoints(xyzB: Point3d[]): any {\r\n const n = this._aDiag.length;\r\n const data = [];\r\n\r\n for (let i = 0; i < n; i++) {\r\n data.push(\r\n [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], xyzB[i].toJSON()]);\r\n }\r\n return data;\r\n }\r\n}\r\n"]}
1	+ {"version":3,"file":"TriDiagonalSystem.js","sourceRoot":"","sources":["../../../src/numerics/TriDiagonalSystem.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAwD;AAExD,kGAAkG;AAClG,IAAK,SAIJ;AAJD,WAAK,SAAS;IACZ,mDAAS,CAAA;IACT,iDAAQ,CAAA;IACR,yDAAY,CAAA;AACd,CAAC,EAJI,SAAS,KAAT,SAAS,QAIb;AACD;;;GAGG;AACH,MAAa,iBAAiB;IAe5B,YAAY,CAAS;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,0DAA0D;IACnD,KAAK;QACV,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACpF,CAAC;IACH,CAAC;IACD,0CAA0C;IACnC,MAAM,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QAClE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IACD,2BAA2B;IACpB,QAAQ,CAAC,GAAW,EAAE,IAAY,EAAE,IAAY,EAAE,KAAa;QACpE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC;IAC7B,CAAC;IACD,gDAAgD;IACzC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,mDAAmD;IAC5C,MAAM,CAAC,GAAW,EAAE,EAAU;QACnC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IACD,iDAAiD;IAC1C,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,8CAA8C;IACvC,IAAI,CAAC,GAAW,EAAE,EAAU;QACjC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,+CAA+C;IACxC,IAAI,CAAC,GAAW;QACrB,OAAO,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IACD,6CAA6C;IACtC,KAAK;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IACD,0CAA0C;IACnC,UAAU;QACf,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAClD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YAE/C,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACxE,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChH,CAAC;YACD,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACjF,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0CAA0C;IACnC,gBAAgB,CAAC,MAAiB,EAAE,MAAiB;QAC1D,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,OAAO,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;YAClC,MAAM,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAE9B,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAElD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,CAAC;YACD,yBAAO,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAEhE,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,CAAC,CAAC;YACN,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzB,yBAAO,CAAC,gBAAgB,CACtB,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EACxD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAC9B,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;YACD,yBAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YACtG,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,0EAA0E;IACnE,QAAQ;QACb,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,YAAY,EAAE,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC;QACtC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,mEAAmE;IAC5D,MAAM;QACX,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,SAAS,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,YAAY,CAAC;QAEzC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAI,mBAAmB;QACzD,4BAA4B;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACjF,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,KAAK,CAAC;YACf,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,QAAQ,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,4DAA4D;IACrD,uBAAuB;QAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,+BAA+B;QAC/B,iFAAiF;QACjF,4DAA4D;QAC5D,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAE/B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChF,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sGAAsG;IAC/F,kCAAkC,CAAC,OAAkB,EAAE,OAAkB;QAC9E,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YACpB,OAAO,KAAK,CAAC;QAEf,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;YACvB,OAAO,CAAC,IAAI,CAAC,yBAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;QAEf,wDAAwD;QACxD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,IAAI,CAAS,CAAC;QACd,IAAI,CAAS,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;QAED,6BAA6B;QAC7B,iFAAiF;QACjF,4DAA4D;QAC5D,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAEnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACzD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+BAA+B;IACxB,IAAI;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,CAAC,GAAG,IAAI,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QACD,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC;IAED,8DAA8D;IACvD,OAAO;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8DAA8D;IACvD,iBAAiB,CAAC,IAAe;QACtC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CACP,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1F,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhSD,8CAgSC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n\n/** @packageDocumentation\n * @module Numerics\n /\n\nimport { Geometry } from \"../Geometry\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\n\n// Enumerated type lies outside of TriDiagonalSystem, as TSLint prevented declaration within class\nenum DataState {\n RawMatrix,\n FactorOK,\n FactorFailed,\n}\n/\n Linear system operations on a matrix with data only on the diagonal and its immediate left and right neighbors\n * @internal\n /\nexport class TriDiagonalSystem {\n\n // Lower diagonal, indexed by rows\n private _aLeft: Float64Array;\n // Upper diagonal, indexed by rows\n private _aRight: Float64Array;\n // Main diagonal, indexed by rows\n private _aDiag: Float64Array;\n // Right side vector\n private _b: Float64Array;\n // Solution vector\n private _x: Float64Array;\n\n private _dataState!: DataState;\n\n constructor(n: number) {\n this._aLeft = new Float64Array(n);\n this._aDiag = new Float64Array(n);\n this._aRight = new Float64Array(n);\n this._b = new Float64Array(n);\n this._x = new Float64Array(n);\n this.reset();\n }\n\n /* Reset to RawMatrix state with all coefficients zero /\n public reset() {\n this._dataState = DataState.RawMatrix;\n const n = this._aDiag.length;\n for (let i = 0; i < n; i++) {\n this._aLeft[i] = this._aRight[i] = this._aDiag[i] = this._b[i] = this._x[i] = 0.0;\n }\n }\n /* Install data in a row of the matrix /\n public setRow(row: number, left: number, diag: number, right: number) {\n this._aLeft[row] = left;\n this._aDiag[row] = diag;\n this._aRight[row] = right;\n }\n /* Add to row of matrix /\n public addToRow(row: number, left: number, diag: number, right: number) {\n this._aLeft[row] += left;\n this._aDiag[row] += diag;\n this._aRight[row] += right;\n }\n /* Install data in the right side (B) vector /\n public setB(row: number, bb: number) {\n this._b[row] = bb;\n }\n /* Add to an entry in the right side (B) vector /\n public addToB(row: number, bb: number) {\n this._b[row] += bb;\n }\n /* Access data from the right side (B) vector /\n public getB(row: number): number {\n return this._b[row];\n }\n /* Install data in the solution (X) vector /\n public setX(row: number, xx: number) {\n this._x[row] = xx;\n }\n /* Access data from the solution (X) vector /\n public getX(row: number): number {\n return this._x[row];\n }\n /* Get method for matrix and vector order /\n public order(): number {\n return this._aDiag.length;\n }\n /* Compute product of AX and save as B /\n public multiplyAX(): boolean {\n if (this._dataState === DataState.FactorFailed) {\n return false;\n } else if (this._dataState === DataState.FactorOK) {\n const n = this._aDiag.length;\n const nm1 = n - 1;\n for (let i = 0; i < nm1; i++) {\n this._b[i] = this._aDiag[i] this._x[i] + this._aRight[i] * this._x[i + 1];\n }\n this._b[nm1] = this._aDiag[nm1] * this._x[nm1];\n\n for (let i = nm1; i > 0; i--) {\n this._b[i] += this._aLeft[i] * this._b[i - 1];\n }\n\n return true;\n } else {\n const n = this._aDiag.length;\n const nm1 = n - 1;\n this._b[0] = this._aDiag[0] * this._x[0] + this._aRight[0] * this._x[1];\n let i;\n for (i = 1; i < nm1; i++) {\n this._b[i] = this._aLeft[i] * this._x[i - 1] + this._aDiag[i] * this._x[i] + this._aRight[i] * this._x[i + 1];\n }\n this._b[nm1] = this._aLeft[nm1] * this._x[n - 2] + this._aDiag[i] * this._x[nm1];\n return true;\n }\n }\n\n /** Compute product of AX and save as B /\n public multiplyAXPoints(pointX: Point3d[], pointB: Point3d[]): boolean {\n pointB.length = 0;\n while (pointB.length < pointX.length)\n pointB.push(Point3d.create());\n pointB.length = pointX.length;\n\n if (this._dataState === DataState.FactorFailed) {\n return false;\n } else if (this._dataState === DataState.FactorOK) {\n\n const n = this._aDiag.length;\n const nm1 = n - 1;\n for (let i = 0; i < nm1; i++) {\n Point3d.createAdd2Scaled(pointX[i], this._aDiag[i], pointX[i + 1], this._aRight[i], pointB[i]);\n }\n Point3d.createScale(pointX[nm1], this._aDiag[nm1], pointB[nm1]);\n\n for (let i = nm1; i > 0; i--) {\n pointB[i].plusScaled(pointB[i - 1], this._aLeft[i], pointB[i]);\n }\n\n return true;\n } else {\n const n = this._aDiag.length;\n const nm1 = n - 1;\n Point3d.createAdd2Scaled(pointX[0], this._aDiag[0], pointX[1], this._aRight[0], pointB[0]);\n let i;\n for (i = 1; i < nm1; i++) {\n Point3d.createAdd3Scaled(\n pointX[i - 1], this._aLeft[i], pointX[i], this._aDiag[i],\n pointX[i + 1], this._aRight[i],\n pointB[i]);\n }\n Point3d.createAdd2Scaled(pointX[n - 2], this._aLeft[nm1], pointX[nm1], this._aDiag[nm1], pointB[nm1]);\n return true;\n }\n }\n\n /* Multiply the stored factors together to return to plain matrix form /\n public defactor(): boolean {\n if (this._dataState === DataState.RawMatrix) {\n return true;\n }\n if (this._dataState === DataState.FactorFailed) {\n return false;\n }\n const n = this._aDiag.length;\n const nm1 = n - 1;\n\n for (let i = nm1; i > 0; i--) {\n this._aDiag[i] += this._aLeft[i] this._aRight[i - 1];\n this._aLeft[i] = this._aDiag[i - 1];\n }\n this._dataState = DataState.RawMatrix;\n return true;\n }\n /* Factor the tridiagonal matrix to LU parts. b, x, not altered /\n public factor(): boolean {\n if (this._dataState === DataState.FactorOK) {\n return true;\n }\n if (this._dataState !== DataState.RawMatrix) {\n return false;\n }\n this._dataState = DataState.FactorFailed;\n\n const n1 = this._aDiag.length - 1; // Last pivot index\n // Eliminate in subdiagonal.\n for (let i = 0; i < n1; i++) {\n const r = Geometry.conditionalDivideFraction(this._aLeft[i + 1], this._aDiag[i]);\n if (r === undefined)\n return false;\n this._aLeft[i + 1] = r;\n this._aDiag[i + 1] -= r this._aRight[i];\n }\n this._dataState = DataState.FactorOK;\n return true;\n }\n /** Solve AX=B. A is left in factored state. B unchanged. /\n public factorAndBackSubstitute(): boolean {\n const n = this._aDiag.length;\n const n1 = n - 1;\n if (!this.factor())\n return false;\n\n // Apply L inverse to B, same sequence as was done to A:\n for (let i = 0; i < n; i++) {\n this._x[i] = this._b[i];\n }\n for (let i = 1; i < n; i++) {\n this._x[i] -= this._aLeft[i] this._x[i - 1];\n }\n\n // Print (\"LU L Inverse B B\");\n // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\n // All diagonals are known to be nonzero. Really. Really???\n this._x[n1] /= this._aDiag[n1];\n\n for (let i = n1 - 1; i >= 0; i--) {\n this._x[i] = (this._x[i] - this._aRight[i] * this._x[i + 1]) / this._aDiag[i];\n }\n\n return true;\n }\n /** Solve AX=B. A is left in factored state. B unchanged. vectorB and vectorX may be the same array /\n public factorAndBackSubstitutePointArrays(vectorB: Point3d[], vectorX: Point3d[]): boolean {\n const n = this._aDiag.length;\n if (vectorB.length < n)\n return false;\n\n while (vectorX.length < n)\n vectorX.push(Point3d.create(0, 0, 0));\n vectorX.length = n;\n const n1 = n - 1;\n if (!this.factor())\n return false;\n\n // Apply L inverse to B, same sequence as was done to A:\n if (vectorB !== vectorX) {\n for (let i = 0; i < n; i++) {\n vectorX[i].setFrom(vectorB[i]);\n }\n }\n\n let a: number;\n let b: number;\n for (let i = 1; i < n; i++) {\n a = this._aLeft[i];\n vectorX[i].x -= a vectorX[i - 1].x;\n vectorX[i].y -= a * vectorX[i - 1].y;\n vectorX[i].z -= a * vectorX[i - 1].z;\n }\n\n // Print (\"LU L inverse B\");\n // overwrite X with solution of U * X = L inverse B, where RHS is already in X...\n // All diagonals are known to be nonzero. Really. Really???\n b = 1.0 / this._aDiag[n1];\n vectorX[n1].x = b;\n vectorX[n1].y = b;\n vectorX[n1].z = b;\n\n for (let i = n1 - 1; i >= 0; i--) {\n a = this._aRight[i];\n b = 1.0 / this._aDiag[i];\n vectorX[i].x = (vectorX[i].x - a vectorX[i + 1].x) * b;\n vectorX[i].y = (vectorX[i].y - a * vectorX[i + 1].y) * b;\n vectorX[i].z = (vectorX[i].z - a * vectorX[i + 1].z) * b;\n }\n\n return true;\n }\n /** Allocate a complete copy /\n public copy(): TriDiagonalSystem {\n const n = this._aDiag.length;\n const B = new TriDiagonalSystem(n);\n for (let i = 0; i < n; i++) {\n B._aLeft[i] = this._aLeft[i];\n B._aDiag[i] = this._aDiag[i];\n B._aRight[i] = this._aRight[i];\n B._x[i] = this._x[i];\n B._b[i] = this._b[i];\n }\n B._dataState = this._dataState;\n return B;\n }\n\n /* return an array form that may be useful for display ... /\n public flatten(): any {\n const n = this._aDiag.length;\n const data = [];\n\n for (let i = 0; i < n; i++) {\n data.push(\n [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], this._b[i]]);\n }\n return data;\n }\n\n /* return an array form that may be useful for display ... */\n public flattenWithPoints(xyzB: Point3d[]): any {\n const n = this._aDiag.length;\n const data = [];\n\n for (let i = 0; i < n; i++) {\n data.push(\n [i, [this._aLeft[i], this._aDiag[i], this._aRight[i]], this._x[i], xyzB[i].toJSON()]);\n }\n return data;\n }\n}\n"]}

package/lib/cjs/numerics/UnionFind.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"UnionFind.js","sourceRoot":"","sources":["../../../src/numerics/UnionFind.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;;;;;;;;;GAUG;AACH,MAAa,gBAAgB;IAE3B,8DAA8D;IAC9D,YAAmB,UAAkB,CAAC;QACpC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,mCAAmC;IACnC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,qDAAqD;IAC9C,YAAY,CAAC,KAAa;QAC/B,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IACxD,CAAC;IACD,8CAA8C;IACvC,OAAO;QACZ,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,SAAS,KAAK,YAAY,EAAE,CAAC;YAClC,YAAY,GAAG,SAAS,CAAC;YACzB,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,SAAS,GAAG,YAAY,CAAC;QAC/B,wCAAwC;QACxC,YAAY,GAAG,KAAK,CAAC;QACrB,OAAO,YAAY,KAAK,SAAS,EAAE,CAAC;YAClC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;YAC5C,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;YAC5C,YAAY,GAAG,SAAS,CAAC;QAC3B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS;QACtC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAChD,OAAO,CAAC,CAAC;QACX,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU,KAAK,UAAU;YAC3B,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC;QAC7C,4BAA4B;QAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD;;OAEG;IACI,SAAS,CAAC,KAAa;QAC5B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IACD,+DAA+D;IACxD,UAAU;QACf,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,OAAO,EAAE,CAAC;QACd,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,+DAA+D;IACxD,oBAAoB;QACzB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvC,OAAO,EAAE,CAAC;QACd,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;OAEG;IACI,kBAAkB;QACvB,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAtGD,4CAsGC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n/*\r\n Implement the classic UnionFind algorithm, viz https://en.wikipedia.org/wiki/Disjoint-set_data_structure\r\n * * Each of the entities being merged exists as an entry in an array.\r\n * * The index in the array is the (only!) identification of the entity.\r\n * * The array entry is the index of a parent in the merge process.\r\n * * New entries are created as singletons pointing to themselves.\r\n * * Merge (i,j) merges the collections containing entries (i) and (j) into a single collection.\r\n * * The merge process updates the indices \"above\" (i) and (j)\r\n * * The whole process is extraordinarily efficient regardless of the order that the (i,j) merges are announced.\r\n * @internal\r\n /\r\nexport class UnionFindContext {\r\n private _parentArray: number[];\r\n /* Create a set initialized with numLeaf singleton subsets /\r\n public constructor(numLeaf: number = 0) {\r\n this._parentArray = [];\r\n for (let i = 0; i < numLeaf; i++)\r\n this._parentArray.push(i);\r\n }\r\n /* Return the number of leaves. /\r\n public get length(): number { return this._parentArray.length; }\r\n /* test if index is within the valid index range. /\r\n public isValidIndex(index: number): boolean {\r\n return 0 <= index && index < this._parentArray.length;\r\n }\r\n /* Return the index of a new singleton set /\r\n public addLeaf(): number {\r\n const index = this._parentArray.length;\r\n this._parentArray.push(index);\r\n return index;\r\n }\r\n /\r\n * follow links to parent\r\n * * after finding the parent, repeat the search and reset parents along the way.\r\n * * If index is invalid, return index unchanged.\r\n * @param index start of search\r\n /\r\n public findRoot(index: number): number {\r\n if (!this.isValidIndex(index))\r\n return index;\r\n let currentIndex = index;\r\n let nextIndex = this._parentArray[index];\r\n while (nextIndex !== currentIndex) {\r\n currentIndex = nextIndex;\r\n nextIndex = this._parentArray[currentIndex];\r\n }\r\n const rootIndex = currentIndex;\r\n // sweep up again and shorten the paths.\r\n currentIndex = index;\r\n while (currentIndex !== rootIndex) {\r\n nextIndex = this._parentArray[currentIndex];\r\n this._parentArray[currentIndex] = rootIndex;\r\n currentIndex = nextIndex;\r\n }\r\n return rootIndex;\r\n }\r\n\r\n /* Merge the subsets containing index (i) and (j)\r\n * * Look up the root of each.\r\n * * Fix up the path to the root so it points to the root.\r\n * * Return the root index of the merged set.\r\n * * If either index is invalid return index i with no changes.\r\n /\r\n public mergeSubsets(i: number, j: number): number {\r\n if (!this.isValidIndex(i) \|\| !this.isValidIndex(j))\r\n return i;\r\n const rootIndexI = this.findRoot(i);\r\n const rootIndexJ = this.findRoot(j);\r\n if (rootIndexI !== rootIndexJ)\r\n this._parentArray[rootIndexI] = rootIndexJ;\r\n // cleanup a little more ...\r\n return this.findRoot(i);\r\n }\r\n /* Return the immediate parent of index (i), with no fixups\r\n * * If index is invalid, return it.\r\n /\r\n public askParent(index: number): number {\r\n if (!this.isValidIndex(index))\r\n return index;\r\n return this._parentArray[index];\r\n }\r\n /* Return the number of entries which are their own parent. /\r\n public countRoots(): number {\r\n let numRoot = 0;\r\n const numLeaf = this._parentArray.length;\r\n for (let i = 0; i < numLeaf; i++)\r\n if (this._parentArray[i] === i)\r\n numRoot++;\r\n return numRoot;\r\n }\r\n /* Return the number of entries whose parent is not a root. /\r\n public countNonTrivialPaths(): number {\r\n let numLong = 0;\r\n const numLeaf = this._parentArray.length;\r\n for (let i = 0; i < numLeaf; i++) {\r\n const j = this._parentArray[i];\r\n if (j !== i && this._parentArray[j] !== j)\r\n numLong++;\r\n }\r\n return numLong;\r\n }\r\n /* Return an array of all root indices.\r\n * * This array is sorted.\r\n */\r\n public collectRootIndices(): number[] {\r\n const roots = [];\r\n const numLeaf = this._parentArray.length;\r\n for (let i = 0; i < numLeaf; i++) {\r\n if (this._parentArray[i] === i)\r\n roots.push(i);\r\n }\r\n return roots;\r\n }\r\n}\r\n"]}
1	+ {"version":3,"file":"UnionFind.js","sourceRoot":"","sources":["../../../src/numerics/UnionFind.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F;;;;;;;;;;GAUG;AACH,MAAa,gBAAgB;IAE3B,8DAA8D;IAC9D,YAAmB,UAAkB,CAAC;QACpC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IACD,mCAAmC;IACnC,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,qDAAqD;IAC9C,YAAY,CAAC,KAAa;QAC/B,OAAO,CAAC,IAAI,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IACxD,CAAC;IACD,8CAA8C;IACvC,OAAO;QACZ,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACzC,OAAO,SAAS,KAAK,YAAY,EAAE,CAAC;YAClC,YAAY,GAAG,SAAS,CAAC;YACzB,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;QAC9C,CAAC;QACD,MAAM,SAAS,GAAG,YAAY,CAAC;QAC/B,wCAAwC;QACxC,YAAY,GAAG,KAAK,CAAC;QACrB,OAAO,YAAY,KAAK,SAAS,EAAE,CAAC;YAClC,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,CAAC;YAC5C,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,GAAG,SAAS,CAAC;YAC5C,YAAY,GAAG,SAAS,CAAC;QAC3B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS;QACtC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;YAChD,OAAO,CAAC,CAAC;QACX,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,UAAU,KAAK,UAAU;YAC3B,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC;QAC7C,4BAA4B;QAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD;;OAEG;IACI,SAAS,CAAC,KAAa;QAC5B,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAC3B,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC;IACD,+DAA+D;IACxD,UAAU;QACf,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,OAAO,EAAE,CAAC;QACd,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,+DAA+D;IACxD,oBAAoB;QACzB,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvC,OAAO,EAAE,CAAC;QACd,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;OAEG;IACI,kBAAkB;QACvB,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAtGD,4CAsGC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n/*\n Implement the classic UnionFind algorithm, viz https://en.wikipedia.org/wiki/Disjoint-set_data_structure\n * * Each of the entities being merged exists as an entry in an array.\n * * The index in the array is the (only!) identification of the entity.\n * * The array entry is the index of a parent in the merge process.\n * * New entries are created as singletons pointing to themselves.\n * * Merge (i,j) merges the collections containing entries (i) and (j) into a single collection.\n * * The merge process updates the indices \"above\" (i) and (j)\n * * The whole process is extraordinarily efficient regardless of the order that the (i,j) merges are announced.\n * @internal\n /\nexport class UnionFindContext {\n private _parentArray: number[];\n /* Create a set initialized with numLeaf singleton subsets /\n public constructor(numLeaf: number = 0) {\n this._parentArray = [];\n for (let i = 0; i < numLeaf; i++)\n this._parentArray.push(i);\n }\n /* Return the number of leaves. /\n public get length(): number { return this._parentArray.length; }\n /* test if index is within the valid index range. /\n public isValidIndex(index: number): boolean {\n return 0 <= index && index < this._parentArray.length;\n }\n /* Return the index of a new singleton set /\n public addLeaf(): number {\n const index = this._parentArray.length;\n this._parentArray.push(index);\n return index;\n }\n /\n * follow links to parent\n * * after finding the parent, repeat the search and reset parents along the way.\n * * If index is invalid, return index unchanged.\n * @param index start of search\n /\n public findRoot(index: number): number {\n if (!this.isValidIndex(index))\n return index;\n let currentIndex = index;\n let nextIndex = this._parentArray[index];\n while (nextIndex !== currentIndex) {\n currentIndex = nextIndex;\n nextIndex = this._parentArray[currentIndex];\n }\n const rootIndex = currentIndex;\n // sweep up again and shorten the paths.\n currentIndex = index;\n while (currentIndex !== rootIndex) {\n nextIndex = this._parentArray[currentIndex];\n this._parentArray[currentIndex] = rootIndex;\n currentIndex = nextIndex;\n }\n return rootIndex;\n }\n\n /* Merge the subsets containing index (i) and (j)\n * * Look up the root of each.\n * * Fix up the path to the root so it points to the root.\n * * Return the root index of the merged set.\n * * If either index is invalid return index i with no changes.\n /\n public mergeSubsets(i: number, j: number): number {\n if (!this.isValidIndex(i) \|\| !this.isValidIndex(j))\n return i;\n const rootIndexI = this.findRoot(i);\n const rootIndexJ = this.findRoot(j);\n if (rootIndexI !== rootIndexJ)\n this._parentArray[rootIndexI] = rootIndexJ;\n // cleanup a little more ...\n return this.findRoot(i);\n }\n /* Return the immediate parent of index (i), with no fixups\n * * If index is invalid, return it.\n /\n public askParent(index: number): number {\n if (!this.isValidIndex(index))\n return index;\n return this._parentArray[index];\n }\n /* Return the number of entries which are their own parent. /\n public countRoots(): number {\n let numRoot = 0;\n const numLeaf = this._parentArray.length;\n for (let i = 0; i < numLeaf; i++)\n if (this._parentArray[i] === i)\n numRoot++;\n return numRoot;\n }\n /* Return the number of entries whose parent is not a root. /\n public countNonTrivialPaths(): number {\n let numLong = 0;\n const numLeaf = this._parentArray.length;\n for (let i = 0; i < numLeaf; i++) {\n const j = this._parentArray[i];\n if (j !== i && this._parentArray[j] !== j)\n numLong++;\n }\n return numLong;\n }\n /* Return an array of all root indices.\n * * This array is sorted.\n */\n public collectRootIndices(): number[] {\n const roots = [];\n const numLeaf = this._parentArray.length;\n for (let i = 0; i < numLeaf; i++) {\n if (this._parentArray[i] === i)\n roots.push(i);\n }\n return roots;\n }\n}\n"]}

package/lib/cjs/numerics/UsageSums.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"UsageSums.js","sourceRoot":"","sources":["../../../src/numerics/UsageSums.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F,0CAAuC;AACvC,+CAA8C;AAE9C;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAa,SAAS;IAYpB;;;;OAIG;IACH,YAAmB,SAAiB,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACD,wCAAwC;IACxC,IAAW,KAAK,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD;;OAEG;IACH,IAAW,IAAI,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtF;;OAEG;IACH,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7F,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAE7D;;;OAGG;IACH,IAAW,iBAAiB;QAC1B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,OAAO,GAAG,CAAC;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACxF,CAAC;IACD;;OAEG;IACI,SAAS;QACd,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD;;OAEG;IACH,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACpD;;;;OAIG;IACI,SAAS,CAAC,MAAc;QAC7B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,MAAc;QACtC,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QACpC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,kEAAkE;QAClE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;QACjF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QAC9C,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACrD,CAAC;IACD,gCAAgC;IACzB,UAAU,CAAC,CAAS;QACzB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QACrB,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,gCAAgC;IACzB,eAAe,CAAC,MAAgB;QACrC,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,sDAAsD;IAC/C,KAAK,CAAC,MAAkB;QAC7B,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1B,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2BAA2B;IACpB,aAAa,CAAC,KAAgB;QACnC,OAAO,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;eACvD,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;eACvD,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;eACzD,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;eAC5B,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;CACF;AA7GD,8BA6GC","sourcesContent":["/---------------------------------------------------------------------------------------------\r\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n--------------------------------------------------------------------------------------------/\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Range1d } from \"../geometry3d/Range\";\r\n\r\n/*\r\n Accumulator for computing average and standard deviations.\r\n * * Usual usage pattern:\r\n * * create with `sums = new UsageSums ()`\r\n * * announce data values with any combination of\r\n * * `sums.accumulate (x: number)`\r\n * * `sums.accumulateArray (data: numberArray)`\r\n * * query properties at any time:\r\n * * `sums.mean`\r\n * * `sums.count`\r\n * * `sums.meanSquare`\r\n * * `sums.standardDeviation`\r\n * * `sums.minMax`\r\n * * Optional `origin`\r\n * * if `origin` is nonzero:\r\n * * when a value `x` is announced to the `accumulate(x)` method, the value used for sums is `(x-origin)`\r\n * * All queries (mean, minMax, meanSquare, standardDeviation) return values relative to the origin.\r\n * * The origin can be reset in two different ways:\r\n * * `setOrigin(a)` sets the saved origin value to `a`, but leaves sums unchanged.\r\n * * This affects subsequence how sums are changed by `announce(x)`\r\n * * `shiftOriginAndSums` sets the origin (like `sums.setOrigin (a))` and also corrects all sums and minMax so they appear that the new origin had been in effect during all prior `accumulate(x)` calls.\r\n * @internal\r\n /\r\nexport class UsageSums {\r\n /* number of values accumulated. /\r\n private _count: number;\r\n /* Sum of values sent to `accumulate` (with origin subtracted away) /\r\n private _sumX: number;\r\n private _sumXX: number;\r\n private _minMax: Range1d;\r\n /* working origin.\r\n * * All other values -- sum0, sum1, sum2, min,max -- are \"from this origin\"\r\n /\r\n private _origin: number;\r\n\r\n /* Constructor:\r\n * * All sums 0\r\n * * min and max set to extreme values.\r\n * * origin assigned.\r\n /\r\n public constructor(origin: number = 0) {\r\n this._minMax = Range1d.createNull();\r\n this._count = this._sumX = this._sumXX = 0;\r\n this._origin = origin;\r\n }\r\n /* Return the number of samples seen /\r\n public get count(): number { return this._count; }\r\n /* return the mean of all samples.\r\n * * Return 0 if no samples\r\n /\r\n public get mean(): number { return this._count > 0 ? this._sumX / this._count : 0.0; }\r\n /* Return the mean of squared samples.\r\n * * Return 0 if no samples.\r\n /\r\n public get meanSquare(): number { return this._count > 0 ? this._sumXX / this._count : 0.0; }\r\n public get minMax(): Range1d { return this._minMax.clone(); }\r\n\r\n /\r\n Return the \"biased standard deviation\" (https://en.wikipedia.org/wiki/Standard_deviation)\r\n * * This is zero if count is zero.\r\n /\r\n public get standardDeviation(): number {\r\n if (this._count < 1)\r\n return 0.0;\r\n const xBar = this.mean;\r\n const sumXX = this._sumXX;\r\n const sumX = this._sumX;\r\n return Math.sqrt((sumXX - 2 xBar * sumX + this._count * xBar * xBar) / this._count);\r\n }\r\n /** Reinitialize all sums.\r\n * * origin is unchanged\r\n /\r\n public clearSums() {\r\n this._count = this._sumX = this._sumXX = 0;\r\n this._minMax.setNull();\r\n }\r\n /\r\n return the origin being used in the `accumulate(x)` method.\r\n /\r\n public get origin(): number { return this._origin; }\r\n /\r\n Reset the origin.\r\n * * Former sums are unchanged !!\r\n * @param origin new origin\r\n /\r\n public setOrigin(origin: number) {\r\n this._origin = origin;\r\n }\r\n /\r\n * reset the origin\r\n * * adjust all sums to what they would be if the new origin had been in effect.\r\n /\r\n public shiftOriginAndSums(origin: number) {\r\n const delta = origin - this._origin;\r\n this._origin = origin;\r\n // adjust sumXX first to get old sumX value before it is modified.\r\n this._sumXX = this._sumXX - 2 delta * this._sumX + this._count * delta * delta;\r\n this._sumX = this._sumX - this._count * delta;\r\n this._minMax.cloneTranslated(-delta, this._minMax);\r\n }\r\n /** Accumulate a single value /\r\n public accumulate(x: number) {\r\n x = x - this._origin;\r\n this._count += 1;\r\n this._sumX += x;\r\n this._sumXX += x x;\r\n this._minMax.extendX(x);\r\n }\r\n /** Accumulate a single value /\r\n public accumulateArray(xArray: number[]) {\r\n for (const x of xArray)\r\n this.accumulate(x);\r\n }\r\n /* Clone all content (origin, count, sums, minMax) /\r\n public clone(result?: UsageSums): UsageSums {\r\n if (!result)\r\n result = new UsageSums();\r\n this._minMax.clone(result._minMax);\r\n result._count = this._count;\r\n result._origin = this._origin;\r\n result._sumX = this._sumX;\r\n result._sumXX = this._sumXX;\r\n return result;\r\n }\r\n /* Compare all content. */\r\n public isAlmostEqual(other: UsageSums): boolean {\r\n return Geometry.isAlmostEqualNumber(this._sumX, other._sumX)\r\n && Geometry.isAlmostEqualNumber(this._sumXX, other._sumXX)\r\n && Geometry.isAlmostEqualNumber(this._origin, other._origin)\r\n && this._count === other._count\r\n && this._minMax.isAlmostEqual(other._minMax);\r\n }\r\n}\r\n"]}
1	+ {"version":3,"file":"UsageSums.js","sourceRoot":"","sources":["../../../src/numerics/UsageSums.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F,0CAAuC;AACvC,+CAA8C;AAE9C;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAa,SAAS;IAYpB;;;;OAIG;IACH,YAAmB,SAAiB,CAAC;QACnC,IAAI,CAAC,OAAO,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACD,wCAAwC;IACxC,IAAW,KAAK,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD;;OAEG;IACH,IAAW,IAAI,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtF;;OAEG;IACH,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7F,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAE7D;;;OAGG;IACH,IAAW,iBAAiB;QAC1B,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,OAAO,GAAG,CAAC;QACb,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IACxF,CAAC;IACD;;OAEG;IACI,SAAS;QACd,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD;;OAEG;IACH,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACpD;;;;OAIG;IACI,SAAS,CAAC,MAAc;QAC7B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IACD;;;OAGG;IACI,kBAAkB,CAAC,MAAc;QACtC,MAAM,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QACpC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,kEAAkE;QAClE,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,GAAG,KAAK,CAAC;QACjF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QAC9C,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACrD,CAAC;IACD,gCAAgC;IACzB,UAAU,CAAC,CAAS;QACzB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC;QACrB,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;QAChB,IAAI,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,gCAAgC;IACzB,eAAe,CAAC,MAAgB;QACrC,KAAK,MAAM,CAAC,IAAI,MAAM;YACpB,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,sDAAsD;IAC/C,KAAK,CAAC,MAAkB;QAC7B,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1B,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2BAA2B;IACpB,aAAa,CAAC,KAAgB;QACnC,OAAO,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;eACvD,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;eACvD,mBAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;eACzD,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;eAC5B,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACjD,CAAC;CACF;AA7GD,8BA6GC","sourcesContent":["/---------------------------------------------------------------------------------------------\n Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n--------------------------------------------------------------------------------------------/\n\nimport { Geometry } from \"../Geometry\";\nimport { Range1d } from \"../geometry3d/Range\";\n\n/*\n Accumulator for computing average and standard deviations.\n * * Usual usage pattern:\n * * create with `sums = new UsageSums ()`\n * * announce data values with any combination of\n * * `sums.accumulate (x: number)`\n * * `sums.accumulateArray (data: numberArray)`\n * * query properties at any time:\n * * `sums.mean`\n * * `sums.count`\n * * `sums.meanSquare`\n * * `sums.standardDeviation`\n * * `sums.minMax`\n * * Optional `origin`\n * * if `origin` is nonzero:\n * * when a value `x` is announced to the `accumulate(x)` method, the value used for sums is `(x-origin)`\n * * All queries (mean, minMax, meanSquare, standardDeviation) return values relative to the origin.\n * * The origin can be reset in two different ways:\n * * `setOrigin(a)` sets the saved origin value to `a`, but leaves sums unchanged.\n * * This affects subsequence how sums are changed by `announce(x)`\n * * `shiftOriginAndSums` sets the origin (like `sums.setOrigin (a))` and also corrects all sums and minMax so they appear that the new origin had been in effect during all prior `accumulate(x)` calls.\n * @internal\n /\nexport class UsageSums {\n /* number of values accumulated. /\n private _count: number;\n /* Sum of values sent to `accumulate` (with origin subtracted away) /\n private _sumX: number;\n private _sumXX: number;\n private _minMax: Range1d;\n /* working origin.\n * * All other values -- sum0, sum1, sum2, min,max -- are \"from this origin\"\n /\n private _origin: number;\n\n /* Constructor:\n * * All sums 0\n * * min and max set to extreme values.\n * * origin assigned.\n /\n public constructor(origin: number = 0) {\n this._minMax = Range1d.createNull();\n this._count = this._sumX = this._sumXX = 0;\n this._origin = origin;\n }\n /* Return the number of samples seen /\n public get count(): number { return this._count; }\n /* return the mean of all samples.\n * * Return 0 if no samples\n /\n public get mean(): number { return this._count > 0 ? this._sumX / this._count : 0.0; }\n /* Return the mean of squared samples.\n * * Return 0 if no samples.\n /\n public get meanSquare(): number { return this._count > 0 ? this._sumXX / this._count : 0.0; }\n public get minMax(): Range1d { return this._minMax.clone(); }\n\n /\n Return the \"biased standard deviation\" (https://en.wikipedia.org/wiki/Standard_deviation)\n * * This is zero if count is zero.\n /\n public get standardDeviation(): number {\n if (this._count < 1)\n return 0.0;\n const xBar = this.mean;\n const sumXX = this._sumXX;\n const sumX = this._sumX;\n return Math.sqrt((sumXX - 2 xBar * sumX + this._count * xBar * xBar) / this._count);\n }\n /** Reinitialize all sums.\n * * origin is unchanged\n /\n public clearSums() {\n this._count = this._sumX = this._sumXX = 0;\n this._minMax.setNull();\n }\n /\n return the origin being used in the `accumulate(x)` method.\n /\n public get origin(): number { return this._origin; }\n /\n Reset the origin.\n * * Former sums are unchanged !!\n * @param origin new origin\n /\n public setOrigin(origin: number) {\n this._origin = origin;\n }\n /\n * reset the origin\n * * adjust all sums to what they would be if the new origin had been in effect.\n /\n public shiftOriginAndSums(origin: number) {\n const delta = origin - this._origin;\n this._origin = origin;\n // adjust sumXX first to get old sumX value before it is modified.\n this._sumXX = this._sumXX - 2 delta * this._sumX + this._count * delta * delta;\n this._sumX = this._sumX - this._count * delta;\n this._minMax.cloneTranslated(-delta, this._minMax);\n }\n /** Accumulate a single value /\n public accumulate(x: number) {\n x = x - this._origin;\n this._count += 1;\n this._sumX += x;\n this._sumXX += x x;\n this._minMax.extendX(x);\n }\n /** Accumulate a single value /\n public accumulateArray(xArray: number[]) {\n for (const x of xArray)\n this.accumulate(x);\n }\n /* Clone all content (origin, count, sums, minMax) /\n public clone(result?: UsageSums): UsageSums {\n if (!result)\n result = new UsageSums();\n this._minMax.clone(result._minMax);\n result._count = this._count;\n result._origin = this._origin;\n result._sumX = this._sumX;\n result._sumXX = this._sumXX;\n return result;\n }\n /* Compare all content. */\n public isAlmostEqual(other: UsageSums): boolean {\n return Geometry.isAlmostEqualNumber(this._sumX, other._sumX)\n && Geometry.isAlmostEqualNumber(this._sumXX, other._sumXX)\n && Geometry.isAlmostEqualNumber(this._origin, other._origin)\n && this._count === other._count\n && this._minMax.isAlmostEqual(other._minMax);\n }\n}\n"]}

package/lib/cjs/polyface/AuxData.d.ts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"AuxData.d.ts","sourceRoot":"","sources":["../../../src/polyface/AuxData.ts"],"names":[],"mappings":"AAKA;;GAEG;~~AAIH~~,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAKpD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEvD;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B;;OAEG;IACH,MAAM,IAAI;IACV;;OAEG;IACH,QAAQ,IAAI;IACZ;;OAEG;IACH,MAAM,IAAI;IACV;;OAEG;IACH,MAAM,IAAI;CACX;AAED;;EAEE;AACF,qBAAa,cAAc;IACzB,qCAAqC;IAC9B,KAAK,EAAE,MAAM,CAAC;IACrB,mJAAmJ;IAC5I,MAAM,EAAE,MAAM,EAAE,CAAC;IAExB,mEAAmE;gBACvD,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY;IAS1D,sIAAsI;IAC/H,UAAU,CAAC,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAKxG,yBAAyB;IAClB,KAAK,IAAI,cAAc;IAI9B;;OAEG;IACI,aAAa,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO;CAInE;AAED;;EAEE;AACF,qBAAa,UAAU;IACrB,kGAAkG;IAC3F,IAAI,EAAE,cAAc,EAAE,CAAC;IAC9B,+CAA+C;IACxC,QAAQ,EAAE,kBAAkB,CAAC;IACpC,oJAAoJ;IAC7I,IAAI,CAAC,EAAE,MAAM,CAAC;IACrB,sBAAsB;IACf,SAAS,CAAC,EAAE,MAAM,CAAC;IAE1B,wCAAwC;gBACrB,IAAI,EAAE,cAAc,EAAE,EAAE,QAAQ,EAAE,kBAAkB,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM;IAO1G,0BAA0B;IACnB,KAAK,IAAI,UAAU;IAM1B,yCAAyC;IAClC,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO;IAc9D,8CAA8C;WAChC,QAAQ,CAAC,QAAQ,EAAE,kBAAkB,GAAG,OAAO;IAI7D,mEAAmE;IACnE,IAAW,QAAQ,IAAI,OAAO,CAE7B;IAED,iFAAiF;WACnE,eAAe,CAAC,QAAQ,EAAE,kBAAkB,GAAG,MAAM;IAInE,oFAAoF;IACpF,IAAW,eAAe,IAAI,MAAM,CAEnC;IAED,sIAAsI;IACtI,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED,gGAAgG;IAChG,IAAW,WAAW,IAAI,OAAO,GAAG,SAAS,CAS5C;IAED;;;;OAIG;IACI,wBAAwB,CAAC,KAAK,SAAI,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;CAatE;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,eAAe;IAC1B,qFAAqF;IAC9E,QAAQ,EAAE,UAAU,EAAE,CAAC;IAC9B,4FAA4F;IACrF,OAAO,EAAE,MAAM,EAAE,CAAC;IAEzB,wCAAwC;gBACrB,QAAQ,EAAE,UAAU,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE;IAK5D,0BAA0B;IACnB,KAAK,IAAI,eAAe;IAK/B;;OAEG;IACI,aAAa,CAAC,KAAK,EAAE,eAAe,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO;IAWzE,sIAAsI;WACxH,aAAa,CAAC,IAAI,EAAE,eAAe,GAAG,SAAS,EAAE,KAAK,EAAE,eAAe,GAAG,SAAS,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO;IAQzH,kEAAkE;IAC3D,gBAAgB,IAAI,eAAe;IAc1C;;;;OAIG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;CAmC1D"}
1	+ {"version":3,"file":"AuxData.d.ts","sourceRoot":"","sources":["../../../src/polyface/AuxData.ts"],"names":[],"mappings":"AAKA;;GAEG;AAGH,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAKpD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEvD;;;GAGG;AACH,oBAAY,kBAAkB;IAC5B;;OAEG;IACH,MAAM,IAAI;IACV;;OAEG;IACH,QAAQ,IAAI;IACZ;;OAEG;IACH,MAAM,IAAI;IACV;;OAEG;IACH,MAAM,IAAI;CACX;AAED;;EAEE;AACF,qBAAa,cAAc;IACzB,qCAAqC;IAC9B,KAAK,EAAE,MAAM,CAAC;IACrB,mJAAmJ;IAC5I,MAAM,EAAE,MAAM,EAAE,CAAC;IAExB,mEAAmE;gBACvD,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,YAAY;IAS1D,sIAAsI;IAC/H,UAAU,CAAC,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAKxG,yBAAyB;IAClB,KAAK,IAAI,cAAc;IAI9B;;OAEG;IACI,aAAa,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO;CAInE;AAED;;EAEE;AACF,qBAAa,UAAU;IACrB,kGAAkG;IAC3F,IAAI,EAAE,cAAc,EAAE,CAAC;IAC9B,+CAA+C;IACxC,QAAQ,EAAE,kBAAkB,CAAC;IACpC,oJAAoJ;IAC7I,IAAI,CAAC,EAAE,MAAM,CAAC;IACrB,sBAAsB;IACf,SAAS,CAAC,EAAE,MAAM,CAAC;IAE1B,wCAAwC;gBACrB,IAAI,EAAE,cAAc,EAAE,EAAE,QAAQ,EAAE,kBAAkB,EAAE,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM;IAO1G,0BAA0B;IACnB,KAAK,IAAI,UAAU;IAM1B,yCAAyC;IAClC,aAAa,CAAC,KAAK,EAAE,UAAU,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO;IAc9D,8CAA8C;WAChC,QAAQ,CAAC,QAAQ,EAAE,kBAAkB,GAAG,OAAO;IAI7D,mEAAmE;IACnE,IAAW,QAAQ,IAAI,OAAO,CAE7B;IAED,iFAAiF;WACnE,eAAe,CAAC,QAAQ,EAAE,kBAAkB,GAAG,MAAM;IAInE,oFAAoF;IACpF,IAAW,eAAe,IAAI,MAAM,CAEnC;IAED,sIAAsI;IACtI,IAAW,UAAU,IAAI,MAAM,CAE9B;IAED,gGAAgG;IAChG,IAAW,WAAW,IAAI,OAAO,GAAG,SAAS,CAS5C;IAED;;;;OAIG;IACI,wBAAwB,CAAC,KAAK,SAAI,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;CAatE;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,eAAe;IAC1B,qFAAqF;IAC9E,QAAQ,EAAE,UAAU,EAAE,CAAC;IAC9B,4FAA4F;IACrF,OAAO,EAAE,MAAM,EAAE,CAAC;IAEzB,wCAAwC;gBACrB,QAAQ,EAAE,UAAU,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE;IAK5D,0BAA0B;IACnB,KAAK,IAAI,eAAe;IAK/B;;OAEG;IACI,aAAa,CAAC,KAAK,EAAE,eAAe,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO;IAWzE,sIAAsI;WACxH,aAAa,CAAC,IAAI,EAAE,eAAe,GAAG,SAAS,EAAE,KAAK,EAAE,eAAe,GAAG,SAAS,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,OAAO;IAQzH,kEAAkE;IAC3D,gBAAgB,IAAI,eAAe;IAc1C;;;;OAIG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;CAmC1D"}