@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/numerics/ClusterableArray.js

@@ -0,0 +1,477 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Numerics
+ */
+import { Geometry } from "../Geometry";
+import { GrowableBlockedArray } from "../geometry3d/GrowableBlockedArray";
+import { GrowableXYArray } from "../geometry3d/GrowableXYArray";
+import { GrowableXYZArray } from "../geometry3d/GrowableXYZArray";
+import { Point2d } from "../geometry3d/Point2dVector2d";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+/**
+ * Blocked array with operations to sort and cluster with a tolerance.
+ * * Primary sorting is along an "arbitrary" sort vector.
+ * @internal
+ */
+export class ClusterableArray extends GrowableBlockedArray {
+    /**
+     * @param numCoordinatePerPoint number of coordinates per point
+     * @param  numExtraDataPerPoint of extra data values per point.
+     * @param initialBlockCapacity predicted number of points.  (This does not have to be accurate)
+     */
+    constructor(numCoordinatePerPoint, numExtraDataPerPoint, initialBlockCapacity) {
+        super(1 + numCoordinatePerPoint + numExtraDataPerPoint, initialBlockCapacity);
+        this._numExtraDataPerPoint = numExtraDataPerPoint;
+        this._numCoordinatePerPoint = numCoordinatePerPoint;
+    }
+    /** Return a component of the sort vector. */
+    static sortVectorComponent(index) {
+        let c = 1.0;
+        for (let i = 1; i < index; i++)
+            c *= ClusterableArray._vectorFactor;
+        return c;
+    }
+    /** load a block, placing data[i] at block[i+1] to allow sort coordinate first.
+     * @param data array of numDataPerBlock values.
+     */
+    addBlock(data) {
+        const i0 = this.newBlockIndex() + 1;
+        const n = Math.min(this.numPerBlock - 1, data.length);
+        for (let i = 0; i < n; i++)
+            this._data[i0 + i] = data[i];
+    }
+    /** add a block with directly 2 to 5 listed content parameters.
+     * This assumes numDataPerPoint is sufficient for the parameters provided.
+     */
+    addDirect(x0, x1, x2, x3, x4) {
+        const i0 = this.newBlockIndex();
+        this._data[i0 + 1] = x0;
+        this._data[i0 + 2] = x1;
+        if (x2 !== undefined)
+            this._data[i0 + 3] = x2;
+        if (x3 !== undefined)
+            this._data[i0 + 4] = x3;
+        if (x4 !== undefined)
+            this._data[i0 + 5] = x4;
+    }
+    /** add a block directly from a Point2d with 0 to 3 extras
+     * This assumes numDataPerPoint is sufficient for the parameters provided.
+     */
+    addPoint2d(xy, a, b, c) {
+        const i0 = this.newBlockIndex();
+        this._data[i0 + 1] = xy.x;
+        this._data[i0 + 2] = xy.y;
+        if (a !== undefined)
+            this._data[i0 + 3] = a;
+        if (b !== undefined)
+            this._data[i0 + 4] = b;
+        if (c !== undefined)
+            this._data[i0 + 5] = c;
+    }
+    /** add a block with directly from a Point2d with 0 to 3 extras
+     * This assumes numDataPerPoint is sufficient for the parameters provided.
+     */
+    addPoint3d(xyz, a, b, c) {
+        const i0 = this.newBlockIndex();
+        this._data[i0 + 1] = xyz.x;
+        this._data[i0 + 2] = xyz.y;
+        this._data[i0 + 3] = xyz.z;
+        if (a !== undefined)
+            this._data[i0 + 4] = a;
+        if (b !== undefined)
+            this._data[i0 + 5] = b;
+        if (c !== undefined)
+            this._data[i0 + 6] = c;
+    }
+    /** Get the xy coordinates by point index. */
+    getPoint2d(blockIndex, result) {
+        const i0 = this.blockIndexToDoubleIndex(blockIndex);
+        return Point2d.create(this._data[i0 + 1], this._data[i0 + 2], result);
+    }
+    /** Get the xyZ coordinates by point index. */
+    getPoint3d(blockIndex, result) {
+        const i0 = this.blockIndexToDoubleIndex(blockIndex);
+        return Point3d.create(this._data[i0 + 1], this._data[i0 + 2], this._data[i0 + 3], result);
+    }
+    /** Return a single extra data value */
+    getExtraData(blockIndex, i) {
+        const i0 = this.blockIndexToDoubleIndex(blockIndex);
+        return this._data[i0 + 1 + this._numCoordinatePerPoint + i];
+    }
+    /** Return a single data value */
+    getData(blockIndex, i) {
+        const i0 = this.blockIndexToDoubleIndex(blockIndex);
+        return this._data[i0 + i];
+    }
+    /** Set a single extra data value */
+    setExtraData(blockIndex, i, value) {
+        const i0 = this.blockIndexToDoubleIndex(blockIndex);
+        this._data[i0 + 1 + this._numCoordinatePerPoint + i] = value;
+    }
+    /** Test if `x` is the cluster terminator value. */
+    static isClusterTerminator(x) { return x === ClusterableArray.clusterTerminator; }
+    /** Return an array giving clusters of blocks with similar coordinates.
+     *
+     * * The contents of each block is assumed to be set up so the primary sort coordinate is first.
+     *
+     * ** simple coordinate blocks (x,y) or (x,y,z) would work fine but have occasional performance problems because points with same x would generate big blocks of
+     * candidates for clusters.
+     * ** The usual solution is to u value which is a dot product along some skew direction and have the blocks contain (u,x,y) or (u,x,y,z) for 2d versus 3d.
+     * ** apply setupPrimaryClusterSort to prepare that!!!
+     * * After a simple lexical sort, consecutive blocks that are within tolerance in the 0 component
+     * are inspected.  Within that candidate set, all blocks that are within tolerance for ALL components are clustered.
+     * * In the output cluster array, clusters are terminated a invalid index. Test for the invalid index with GrowableBlockArray.isClusterTerminator (x)
+     */
+    clusterIndicesLexical(clusterTolerance = Geometry.smallMetricDistance) {
+        // install primary sort key
+        this.setupPrimaryClusterSort();
+        // presort by all coordinates ....
+        const firstSort = this.sortIndicesLexical();
+        const clusterIndices = new Uint32Array(2 * firstSort.length); // worst case: no duplicates, each index goes in followed by terminator.
+        let m = 0; // number of cluster indices
+        const n = this.numBlocks; // and this must match firstSort.length !!
+        let clusterStartBlockIndex = 0;
+        let candidateBlockIndex = 0;
+        let barrierU = 0.0;
+        let i = 0;
+        let j = 0;
+        const k0 = 1; // beginning of active column for distance
+        const k1 = 1 + this._numCoordinatePerPoint;
+        for (i = 0; i < n; i++) {
+            clusterStartBlockIndex = firstSort[i];
+            if (!ClusterableArray.isClusterTerminator(clusterStartBlockIndex)) {
+                // unused block, so it becomes a cluster...
+                clusterIndices[m++] = clusterStartBlockIndex;
+                barrierU = this.component(clusterStartBlockIndex, 0) + clusterTolerance;
+                firstSort[i] = ClusterableArray.clusterTerminator;
+                for (j = i + 1; j < n; j++) {
+                    candidateBlockIndex = firstSort[j];
+                    if (candidateBlockIndex === ClusterableArray.clusterTerminator)
+                        continue; // nearby in sort direction but already in a cluster.
+                    if (this.component(candidateBlockIndex, 0) >= barrierU)
+                        break;
+                    if (this.distanceBetweenSubBlocks(clusterStartBlockIndex, candidateBlockIndex, k0, k1) < clusterTolerance) {
+                        clusterIndices[m++] = candidateBlockIndex; // The candidate is in the block
+                        firstSort[j] = ClusterableArray.clusterTerminator; // and it will not be reused as future block base
+                    }
+                }
+                clusterIndices[m++] = ClusterableArray.clusterTerminator;
+            }
+        }
+        // Alas, the clusterIndices array has fluff at the end.  So it has to be copied.
+        return clusterIndices.slice(0, m);
+    }
+    /** setup (overwrite!!) the "0" component with the dot product of numClusterCoordinate later components with a non-axis aligned vector.
+     * This is normally called before clusterIndicesLexical.
+     */
+    setupPrimaryClusterSort() {
+        const nb = this.numBlocks;
+        const nc = this._numCoordinatePerPoint;
+        const vector = new Float64Array(nc);
+        vector[0] = 1.0;
+        for (let c = 1; c < nc; c++)
+            vector[c] = vector[c - 1] * ClusterableArray._vectorFactor;
+        let k = 0;
+        let dot = 0.0;
+        const data = this._data;
+        for (let b = 0; b < nb; b++) {
+            k = this.blockIndexToDoubleIndex(b);
+            dot = 0.0;
+            for (let c = 0; c < nc; c++) {
+                dot += vector[c] * data[k + 1 + c];
+            }
+            data[k] = dot;
+        }
+    }
+    /** Convert the cluster data to an array of tuples with point i in the form
+     * `[i, primarySortCoordinate, [x,y,..], [extraData0, extraData1, ...]]`
+     */
+    toJSON() {
+        const result = [];
+        for (let b = 0; b < this.numBlocks; b++) {
+            let i = this.blockIndexToDoubleIndex(b);
+            const chunk = [b, this._data[i++]];
+            const coordinates = [];
+            for (let c = 0; c < this._numCoordinatePerPoint; c++)
+                coordinates.push(this._data[i++]);
+            chunk.push(coordinates);
+            for (let c = 0; c < this._numExtraDataPerPoint; c++)
+                chunk.push(this._data[i++]);
+            result.push(chunk);
+        }
+        return result;
+    }
+    /**
+     * Return an array of indices from block index to cluster index.
+     * @param clusteredBlocks clusters of block indices followed by separators.
+     */
+    createIndexBlockToClusterIndex(clusteredBlocks) {
+        const numBlocks = this.numBlocks;
+        const blockToCluster = new Uint32Array(numBlocks);
+        blockToCluster.fill(ClusterableArray.clusterTerminator);
+        let numCluster = 0;
+        for (const b of clusteredBlocks) {
+            if (b >= numBlocks) {
+                numCluster++;
+            }
+            else {
+                blockToCluster[b] = numCluster;
+            }
+        }
+        return blockToCluster;
+    }
+    /**
+     * Return an array of indices from block index to index of its cluster's start in the cluster index array.
+     * @param clusteredBlocks clusters of block indices followed by separators.
+     */
+    createIndexBlockToClusterStart(clusteredBlocks) {
+        const n = clusteredBlocks.length;
+        const numBlocks = this.numBlocks;
+        const blockToClusterStart = new Uint32Array(numBlocks);
+        const terminator = ClusterableArray.clusterTerminator;
+        blockToClusterStart.fill(terminator);
+        let clusterStart = 0;
+        for (let i = 0; i < n; i++) {
+            const k = clusteredBlocks[i];
+            if (k > numBlocks) {
+                clusterStart = i + 1;
+            }
+            else {
+                blockToClusterStart[k] = clusterStart;
+            }
+        }
+        return blockToClusterStart;
+    }
+    /** count the clusters in the clusteredBlocks array. */
+    countClusters(clusteredBlocks) {
+        let numClusters = 0;
+        const terminator = ClusterableArray.clusterTerminator;
+        for (const b of clusteredBlocks) {
+            if (b === terminator)
+                numClusters++;
+        }
+        return numClusters;
+    }
+    /** create a reverse index: given a cluster index k, clusterToClusterStart[k] is the place
+     * the cluster's block indices appear in clusterBlocks
+     */
+    createIndexClusterToClusterStart(clusteredBlocks) {
+        let numCluster = this.countClusters(clusteredBlocks);
+        const clusterToClusterStart = new Uint32Array(numCluster);
+        const terminator = ClusterableArray.clusterTerminator;
+        clusterToClusterStart.fill(terminator);
+        const n = clusteredBlocks.length;
+        let clusterStart = 0;
+        for (let i = 0; i < n; i++) {
+            const k = clusteredBlocks[i];
+            if (k === terminator) {
+                clusterStart = i + 1;
+            }
+            else if (i === clusterStart) {
+                clusterToClusterStart[numCluster++] = clusterStart;
+            }
+        }
+        return clusterToClusterStart;
+    }
+    /**
+     * Sort terminator-delimited subsets of an array of indices into the table, using a single extraData index as sort key.
+     * @param blockedIndices [in] indices, organized as blocks of good indices terminated by the clusterTerminator.
+     * @param extraDataIndex index of the extra data key.
+     */
+    sortSubsetsBySingleKey(blockedIndices, dataIndex) {
+        const dataOffset = 1 + dataIndex;
+        let kBegin = 0;
+        let swap;
+        let key0, key1;
+        const numK = blockedIndices.length;
+        for (let kEnd = 0; kEnd < numK; kEnd++) {
+            if (blockedIndices[kEnd] === ClusterableArray.clusterTerminator) {
+                // sort blockedIndices[kBegin ,= k < kEnd].
+                //  (search for minimum remaining, swap  . . )
+                for (let k0 = kBegin; k0 + 1 < kEnd; k0++) {
+                    key0 = this.getWithinBlock(blockedIndices[k0], dataOffset);
+                    for (let k1 = k0 + 1; k1 < kEnd; k1++) {
+                        key1 = this.getWithinBlock(blockedIndices[k1], dataOffset);
+                        if (key1 < key0) {
+                            swap = blockedIndices[k0];
+                            blockedIndices[k0] = blockedIndices[k1];
+                            blockedIndices[k1] = swap;
+                            key0 = key1;
+                        }
+                    }
+                }
+                kBegin = kEnd + 1;
+            }
+        }
+    }
+    /**
+     * Returns packed points with indices mapping old to new.
+     * @param data points to cluster.
+     */
+    static clusterPoint3dArray(data, tolerance = Geometry.smallMetricDistance) {
+        const clusterArray = new ClusterableArray(3, 0, data.length);
+        data.forEach((p) => {
+            clusterArray.addDirect(p.x, p.y, p.z);
+        });
+        const order = clusterArray.clusterIndicesLexical(tolerance);
+        const result = new PackedPointsWithIndex(data.length);
+        let currentClusterIndex = 0;
+        let numThisCluster = 0;
+        order.forEach((k) => {
+            if (ClusterableArray.isClusterTerminator(k)) {
+                currentClusterIndex++;
+                numThisCluster = 0;
+            }
+            else {
+                if (numThisCluster === 0)
+                    result.packedPoints.push(data[k].clone());
+                result.oldToNew[k] = currentClusterIndex;
+                numThisCluster++;
+            }
+        });
+        return result;
+    }
+    /**
+     * Returns packed points with indices mapping old to new.
+     * @param data points to cluster.
+     */
+    static clusterGrowablePoint2dArray(source, tolerance = Geometry.smallMetricDistance) {
+        const clusterArray = new ClusterableArray(2, 0, source.length);
+        const p = Point2d.create();
+        const numSourcePoint = source.length;
+        for (let i = 0; i < numSourcePoint; i++) {
+            source.getPoint2dAtUncheckedPointIndex(i, p);
+            clusterArray.addDirect(p.x, p.y);
+        }
+        const order = clusterArray.clusterIndicesLexical(tolerance);
+        const numPackedPoints = clusterArray.countClusters(order);
+        const result = new PackedPoint2dsWithIndex(source.length, numPackedPoints);
+        let currentClusterIndex = 0;
+        let numThisCluster = 0;
+        order.forEach((k) => {
+            if (ClusterableArray.isClusterTerminator(k)) {
+                currentClusterIndex++;
+                numThisCluster = 0;
+            }
+            else {
+                if (numThisCluster === 0) // This is the first encounter with a new cluster
+                    result.growablePackedPoints.pushFromGrowableXYArray(source, k);
+                result.oldToNew[k] = currentClusterIndex;
+                numThisCluster++;
+            }
+        });
+        return result;
+    }
+    /**
+     * Returns packed points with indices mapping old to new.
+     * @param data points to cluster.
+     */
+    static clusterGrowablePoint3dArray(source, tolerance = Geometry.smallMetricDistance) {
+        const clusterArray = new ClusterableArray(3, 0, source.length);
+        const p = Point3d.create();
+        const numSourcePoint = source.length;
+        for (let i = 0; i < numSourcePoint; i++) {
+            source.getPoint3dAtUncheckedPointIndex(i, p);
+            clusterArray.addDirect(p.x, p.y, p.z);
+        }
+        const order = clusterArray.clusterIndicesLexical(tolerance);
+        const result = new PackedPointsWithIndex(source.length);
+        const numPackedPoints = clusterArray.countClusters(order);
+        result.growablePackedPoints = new GrowableXYZArray(numPackedPoints);
+        let currentClusterIndex = 0;
+        let numThisCluster = 0;
+        order.forEach((k) => {
+            if (ClusterableArray.isClusterTerminator(k)) {
+                currentClusterIndex++;
+                numThisCluster = 0;
+            }
+            else {
+                if (numThisCluster === 0) // This is the first encounter with a new cluster
+                    result.growablePackedPoints.pushFromGrowableXYZArray(source, k);
+                result.oldToNew[k] = currentClusterIndex;
+                numThisCluster++;
+            }
+        });
+        return result;
+    }
+}
+//  (This is pretty strange)
+// The sort vector is (1,c, c*c, ...)
+// Setting c = 1 makes it 1,1,1 which may be useful for visual scans during debug.
+// c with some inobvious digits makes it unlikely that there will be multiple points on a perpendicular to the sort vector.
+ClusterableArray._vectorFactor = 0.8732; // use 1.0 to rig easy tests.
+/** this value is used as cluster terminator in the Uint232rray of indcies. */
+ClusterableArray.clusterTerminator = 0xFFffFFff;
+/**
+ * @internal
+ */
+function updateIndices(indices, oldToNew) {
+    let numErrors = 0;
+    indices.forEach((value, i, data) => {
+        if (value < oldToNew.length) {
+            data[i] = oldToNew[value];
+        }
+        else
+            numErrors++;
+    });
+    return numErrors === 0;
+}
+/**
+ * Data carrier class for
+ * * packedPoints = an array of Point3d
+ * * oldToNew = array of indices from some prior Point3d[] to the packed points.
+ * @internal
+ */
+class PackedPointsWithIndex {
+    /** construct a PackedPoints object with
+     * * empty packedPoints array
+     * * oldToNew indices all initialized to PackedPoints.invalidIndex
+     */
+    constructor(numOldIndexEntry) {
+        this.packedPoints = [];
+        this.oldToNew = new Uint32Array(numOldIndexEntry);
+        for (let i = 0; i < numOldIndexEntry; i++) {
+            this.oldToNew[i] = PackedPointsWithIndex.invalidIndex;
+        }
+    }
+    /**
+     * Use the oldToNew array to update an array of "old" indices.
+     * @param indices array of indices into prepacked array.
+     * @returns true if all input indices were valid for the oldToNew array.
+     */
+    updateIndices(indices) {
+        return updateIndices(indices, this.oldToNew);
+    }
+}
+/** integer value for unknown index. */
+PackedPointsWithIndex.invalidIndex = 0xFFFFffff;
+/**
+ * @internal
+ */
+class PackedPoint2dsWithIndex {
+    /** construct a PackedPoints object with
+     * * empty packedPoints array
+     * * oldToNew indices all initialized to PackedPoints.invalidIndex
+     */
+    constructor(numOldIndexEntry, numPackedPoints) {
+        this.growablePackedPoints = new GrowableXYArray(numPackedPoints);
+        this.oldToNew = new Uint32Array(numOldIndexEntry);
+        for (let i = 0; i < numOldIndexEntry; i++) {
+            this.oldToNew[i] = PackedPoint2dsWithIndex.invalidIndex;
+        }
+    }
+    /**
+     * Use the oldToNew array to update an array of "old" indices.
+     * @param indices array of indices into prepacked array.
+     * @returns true if all input indices were valid for the oldToNew array.
+     */
+    updateIndices(indices) {
+        return updateIndices(indices, this.oldToNew);
+    }
+}
+/** integer value for unknown index. */
+PackedPoint2dsWithIndex.invalidIndex = 0xFFFFffff;
+//# sourceMappingURL=ClusterableArray.js.map

package/lib/esm/numerics/ClusterableArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ClusterableArray.js","sourceRoot":"","sources":["../../../src/numerics/ClusterableArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD;;;;GAIG;AACH,MAAM,OAAO,gBAAiB,SAAQ,oBAAoB;IAcxD;;;;OAIG;IACH,YAAmB,qBAA6B,EAAE,oBAA4B,EAAE,oBAA4B;QAC1G,KAAK,CAAC,CAAC,GAAG,qBAAqB,GAAG,oBAAoB,EAAE,oBAAoB,CAAC,CAAC;QAC9E,IAAI,CAAC,qBAAqB,GAAG,oBAAoB,CAAC;QAClD,IAAI,CAAC,sBAAsB,GAAG,qBAAqB,CAAC;IACtD,CAAC;IAjBD,6CAA6C;IACtC,MAAM,CAAC,mBAAmB,CAAC,KAAa;QAC7C,IAAI,CAAC,GAAG,GAAG,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,CAAC,IAAI,gBAAgB,CAAC,aAAa,CAAC;QACpE,OAAO,CAAC,CAAC;IACX,CAAC;IAaD;;OAEG;IACa,QAAQ,CAAC,IAAc;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IACD;;OAEG;IACI,SAAS,CAAC,EAAU,EAAE,EAAU,EAAE,EAAW,EAAE,EAAW,EAAE,EAAW;QAC5E,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QACxB,IAAI,EAAE,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QAC9C,IAAI,EAAE,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;QAC9C,IAAI,EAAE,KAAK,SAAS;YAAE,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;IAChD,CAAC;IAED;;OAEG;IACI,UAAU,CAAC,EAAW,EAAE,CAAU,EAAE,CAAU,EAAE,CAAU;QAC/D,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,SAAS;YACjB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,SAAS;YACjB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,SAAS;YACjB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;OAEG;IACI,UAAU,CAAC,GAAY,EAAE,CAAU,EAAE,CAAU,EAAE,CAAU;QAChE,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,SAAS;YACjB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,SAAS;YACjB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,SAAS;YACjB,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IACD,6CAA6C;IACtC,UAAU,CAAC,UAAkB,EAAE,MAAgB;QACpD,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACxE,CAAC;IACD,8CAA8C;IACvC,UAAU,CAAC,UAAkB,EAAE,MAAgB;QACpD,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IAC5F,CAAC;IACD,uCAAuC;IAChC,YAAY,CAAC,UAAkB,EAAE,CAAS;QAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAC,CAAC;IAC9D,CAAC;IACD,iCAAiC;IAC1B,OAAO,CAAC,UAAkB,EAAE,CAAS;QAC1C,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QACpD,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,oCAAoC;IAC7B,YAAY,CAAC,UAAkB,EAAE,CAAS,EAAE,KAAa;QAC9D,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;IAC/D,CAAC;IAID,mDAAmD;IAC5C,MAAM,CAAC,mBAAmB,CAAC,CAAS,IAAa,OAAO,CAAC,KAAK,gBAAgB,CAAC,iBAAiB,CAAC,CAAC,CAAC;IAC1G;;;;;;;;;;;OAWG;IACI,qBAAqB,CAAC,mBAA2B,QAAQ,CAAC,mBAAmB;QAClF,2BAA2B;QAC3B,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,kCAAkC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5C,MAAM,cAAc,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAE,wEAAwE;QACvI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,4BAA4B;QACxC,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,0CAA0C;QACpE,IAAI,sBAAsB,GAAG,CAAC,CAAC;QAC/B,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,IAAI,QAAQ,GAAG,GAAG,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,MAAM,EAAE,GAAG,CAAC,CAAC,CAAG,0CAA0C;QAC1D,MAAM,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,sBAAsB,CAAC;QAC3C,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YACtB,sBAAsB,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,gBAAgB,CAAC,mBAAmB,CAAC,sBAAsB,CAAC,EAAE;gBACjE,2CAA2C;gBAC3C,cAAc,CAAC,CAAC,EAAE,CAAC,GAAG,sBAAsB,CAAC;gBAC7C,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,sBAAsB,EAAE,CAAC,CAAC,GAAG,gBAAgB,CAAC;gBACxE,SAAS,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,iBAAiB,CAAC;gBAClD,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;oBAC1B,mBAAmB,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;oBACnC,IAAI,mBAAmB,KAAK,gBAAgB,CAAC,iBAAiB;wBAAE,SAAS,CAAC,qDAAqD;oBAC/H,IAAI,IAAI,CAAC,SAAS,CAAC,mBAAmB,EAAE,CAAC,CAAC,IAAI,QAAQ;wBAAE,MAAM;oBAC9D,IAAI,IAAI,CAAC,wBAAwB,CAAC,sBAAsB,EAAE,mBAAmB,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,gBAAgB,EAAE;wBACzG,cAAc,CAAC,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAY,gCAAgC;wBACtF,SAAS,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC,iBAAiB,CAAC,CAAE,iDAAiD;qBACtG;iBACF;gBACD,cAAc,CAAC,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,iBAAiB,CAAC;aAC1D;SACF;QACD,gFAAgF;QAChF,OAAO,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,CAAC;IACD;;OAEG;IACI,uBAAuB;QAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,gBAAgB,CAAC,aAAa,CAAC;QACxF,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YAC3B,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YACpC,GAAG,GAAG,GAAG,CAAC;YACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;gBAAE,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;aAAE;YACpE,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;SACf;IACH,CAAC;IACD;;OAEG;IACI,MAAM;QACX,MAAM,MAAM,GAAU,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;YACvC,IAAI,CAAC,GAAG,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,KAAK,GAAU,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,WAAW,GAAG,EAAE,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC,EAAE;gBAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACvF,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC,EAAE;gBACjD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACpB;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,8BAA8B,CAAC,eAA4B;QAChE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,MAAM,cAAc,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;QAClD,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,iBAAiB,CAAC,CAAC;QACxD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;YAC/B,IAAI,CAAC,IAAI,SAAS,EAAE;gBAClB,UAAU,EAAE,CAAC;aACd;iBAAM;gBACL,cAAc,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;aAChC;SACF;QACD,OAAO,cAAc,CAAC;IACxB,CAAC;IACD;;;OAGG;IACI,8BAA8B,CAAC,eAA4B;QAChE,MAAM,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC;QACjC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,MAAM,mBAAmB,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,CAAC;QACvD,MAAM,UAAU,GAAG,gBAAgB,CAAC,iBAAiB,CAAC;QACtD,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,GAAG,SAAS,EAAE;gBACjB,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC;aACtB;iBAAM;gBACL,mBAAmB,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC;aACvC;SACF;QACD,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IACD,uDAAuD;IAChD,aAAa,CAAC,eAA4B;QAC/C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,UAAU,GAAG,gBAAgB,CAAC,iBAAiB,CAAC;QACtD,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE;YAC/B,IAAI,CAAC,KAAK,UAAU;gBAClB,WAAW,EAAE,CAAC;SACjB;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IACD;;OAEG;IACI,gCAAgC,CAAC,eAA4B;QAClE,IAAI,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;QACrD,MAAM,qBAAqB,GAAG,IAAI,WAAW,CAAC,UAAU,CAAC,CAAC;QAC1D,MAAM,UAAU,GAAG,gBAAgB,CAAC,iBAAiB,CAAC;QACtD,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,eAAe,CAAC,MAAM,CAAC;QACjC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;YAC7B,IAAI,CAAC,KAAK,UAAU,EAAE;gBACpB,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC;aACtB;iBAAM,IAAI,CAAC,KAAK,YAAY,EAAE;gBAC7B,qBAAqB,CAAC,UAAU,EAAE,CAAC,GAAG,YAAY,CAAC;aACpD;SACF;QACD,OAAO,qBAAqB,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACI,sBAAsB,CAAC,cAA2B,EAAE,SAAiB;QAC1E,MAAM,UAAU,GAAG,CAAC,GAAG,SAAS,CAAC;QACjC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,EAAE,IAAI,CAAC;QACf,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM,CAAC;QACnC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,EAAE,IAAI,EAAE,EAAE;YACtC,IAAI,cAAc,CAAC,IAAI,CAAC,KAAK,gBAAgB,CAAC,iBAAiB,EAAE;gBAC/D,2CAA2C;gBAC3C,8CAA8C;gBAC9C,KAAK,IAAI,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,CAAC,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;oBACzC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;oBAC3D,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;wBACrC,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;wBAC3D,IAAI,IAAI,GAAG,IAAI,EAAE;4BACf,IAAI,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;4BAC1B,cAAc,CAAC,EAAE,CAAC,GAAG,cAAc,CAAC,EAAE,CAAC,CAAC;4BACxC,cAAc,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;4BAC1B,IAAI,GAAG,IAAI,CAAC;yBACb;qBACF;iBACF;gBACD,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC;aACnB;SACF;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,mBAAmB,CAAC,IAAe,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QAEjG,MAAM,YAAY,GAAG,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC7D,IAAI,CAAC,OAAO,CAAC,CAAC,CAAU,EAAE,EAAE;YAC1B,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QACH,MAAM,KAAK,GAAG,YAAY,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;YAC1B,IAAI,gBAAgB,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE;gBAC3C,mBAAmB,EAAE,CAAC;gBACtB,cAAc,GAAG,CAAC,CAAC;aACpB;iBAAM;gBACL,IAAI,cAAc,KAAK,CAAC;oBACtB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC5C,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC;gBACzC,cAAc,EAAE,CAAC;aAClB;QACH,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,2BAA2B,CAAC,MAAuB,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QACjH,MAAM,YAAY,GAAG,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,MAAM,KAAK,GAAG,YAAY,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAC5D,MAAM,eAAe,GAAG,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAI,uBAAuB,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;QAC3E,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;YAC1B,IAAI,gBAAgB,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE;gBAC3C,mBAAmB,EAAE,CAAC;gBACtB,cAAc,GAAG,CAAC,CAAC;aACpB;iBAAM;gBACL,IAAI,cAAc,KAAK,CAAC,EAAE,iDAAiD;oBACzE,MAAM,CAAC,oBAAoB,CAAC,uBAAuB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACjE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC;gBACzC,cAAc,EAAE,CAAC;aAClB;QACH,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,2BAA2B,CAAC,MAAwB,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QAElH,MAAM,YAAY,GAAG,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,cAAc,GAAG,MAAM,CAAC,MAAM,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7C,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;SACvC;QACD,MAAM,KAAK,GAAG,YAAY,CAAC,qBAAqB,CAAC,SAAS,CAAC,CAAC;QAC5D,MAAM,MAAM,GAAG,IAAI,qBAAqB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxD,MAAM,eAAe,GAAG,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC1D,MAAM,CAAC,oBAAoB,GAAG,IAAI,gBAAgB,CAAC,eAAe,CAAC,CAAC;QACpE,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,KAAK,CAAC,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;YAC1B,IAAI,gBAAgB,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE;gBAC3C,mBAAmB,EAAE,CAAC;gBACtB,cAAc,GAAG,CAAC,CAAC;aACpB;iBAAM;gBACL,IAAI,cAAc,KAAK,CAAC,EAAE,iDAAiD;oBACzE,MAAM,CAAC,oBAAqB,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBACnE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC;gBACzC,cAAc,EAAE,CAAC;aAClB;QACH,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;;AA9XD,4BAA4B;AAC5B,qCAAqC;AACrC,kFAAkF;AAClF,2HAA2H;AACnG,8BAAa,GAAG,MAAM,CAAC,CAAE,6BAA6B;AAiG9E,8EAA8E;AACvD,kCAAiB,GAAG,UAAU,CAAC;AA2RxD;;GAEG;AACH,SAAS,aAAa,CAAC,OAAiB,EAAE,QAAqB;IAC7D,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,OAAO,CAAC,OAAO,CAAC,CAAC,KAAa,EAAE,CAAS,EAAE,IAAc,EAAE,EAAE;QAC3D,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE;YAC3B,IAAI,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;SAC3B;;YAAM,SAAS,EAAE,CAAC;IACrB,CAAC,CAAC,CAAC;IACH,OAAO,SAAS,KAAK,CAAC,CAAC;AACzB,CAAC;AAED;;;;;GAKG;AACH,MAAM,qBAAqB;IAUzB;;;OAGG;IACH,YAAY,gBAAwB;QAClC,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,IAAI,WAAW,CAAC,gBAAgB,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,qBAAqB,CAAC,YAAY,CAAC;SACvD;IACH,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,OAAiB;QACpC,OAAO,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;;AArBD,uCAAuC;AAChB,kCAAY,GAAG,UAAU,CAAC;AAuBnD;;GAEG;AACH,MAAM,uBAAuB;IAQ3B;;;OAGG;IACH,YAAY,gBAAwB,EAAE,eAAuB;QAC3D,IAAI,CAAC,oBAAoB,GAAG,IAAI,eAAe,CAAC,eAAe,CAAC,CAAC;QACjE,IAAI,CAAC,QAAQ,GAAG,IAAI,WAAW,CAAC,gBAAgB,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,uBAAuB,CAAC,YAAY,CAAC;SACzD;IACH,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,OAAiB;QACpC,OAAO,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/C,CAAC;;AArBD,uCAAuC;AAChB,oCAAY,GAAG,UAAU,CAAC","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 { GrowableBlockedArray } from \"../geometry3d/GrowableBlockedArray\";\r\nimport { GrowableXYArray } from \"../geometry3d/GrowableXYArray\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\n\r\n/**\r\n * Blocked array with operations to sort and cluster with a tolerance.\r\n * * Primary sorting is along an \"arbitrary\" sort vector.\r\n * @internal\r\n */\r\nexport class ClusterableArray extends GrowableBlockedArray {\r\n  //  (This is pretty strange)\r\n  // The sort vector is (1,c, c*c, ...)\r\n  // Setting c = 1 makes it 1,1,1 which may be useful for visual scans during debug.\r\n  // c with some inobvious digits makes it unlikely that there will be multiple points on a perpendicular to the sort vector.\r\n  private static readonly _vectorFactor = 0.8732;  // use 1.0 to rig easy tests.\r\n  /** Return a component of the sort vector. */\r\n  public static sortVectorComponent(index: number): number {\r\n    let c = 1.0;\r\n    for (let i = 1; i < index; i++) c *= ClusterableArray._vectorFactor;\r\n    return c;\r\n  }\r\n  private _numCoordinatePerPoint: number;\r\n  private _numExtraDataPerPoint: number;\r\n  /**\r\n   * @param numCoordinatePerPoint number of coordinates per point\r\n   * @param  numExtraDataPerPoint of extra data values per point.\r\n   * @param initialBlockCapacity predicted number of points.  (This does not have to be accurate)\r\n   */\r\n  public constructor(numCoordinatePerPoint: number, numExtraDataPerPoint: number, initialBlockCapacity: number) {\r\n    super(1 + numCoordinatePerPoint + numExtraDataPerPoint, initialBlockCapacity);\r\n    this._numExtraDataPerPoint = numExtraDataPerPoint;\r\n    this._numCoordinatePerPoint = numCoordinatePerPoint;\r\n  }\r\n  /** load a block, placing data[i] at block[i+1] to allow sort coordinate first.\r\n   * @param data array of numDataPerBlock values.\r\n   */\r\n  public override addBlock(data: number[]) {\r\n    const i0 = this.newBlockIndex() + 1;\r\n    const n = Math.min(this.numPerBlock - 1, data.length);\r\n    for (let i = 0; i < n; i++)\r\n      this._data[i0 + i] = data[i];\r\n  }\r\n  /** add a block with directly 2 to 5 listed content parameters.\r\n   * This assumes numDataPerPoint is sufficient for the parameters provided.\r\n   */\r\n  public addDirect(x0: number, x1: number, x2?: number, x3?: number, x4?: number) {\r\n    const i0 = this.newBlockIndex();\r\n    this._data[i0 + 1] = x0;\r\n    this._data[i0 + 2] = x1;\r\n    if (x2 !== undefined) this._data[i0 + 3] = x2;\r\n    if (x3 !== undefined) this._data[i0 + 4] = x3;\r\n    if (x4 !== undefined) this._data[i0 + 5] = x4;\r\n  }\r\n\r\n  /** add a block directly from a Point2d with 0 to 3 extras\r\n   * This assumes numDataPerPoint is sufficient for the parameters provided.\r\n   */\r\n  public addPoint2d(xy: Point2d, a?: number, b?: number, c?: number) {\r\n    const i0 = this.newBlockIndex();\r\n    this._data[i0 + 1] = xy.x;\r\n    this._data[i0 + 2] = xy.y;\r\n    if (a !== undefined)\r\n      this._data[i0 + 3] = a;\r\n    if (b !== undefined)\r\n      this._data[i0 + 4] = b;\r\n    if (c !== undefined)\r\n      this._data[i0 + 5] = c;\r\n  }\r\n\r\n  /** add a block with directly from a Point2d with 0 to 3 extras\r\n   * This assumes numDataPerPoint is sufficient for the parameters provided.\r\n   */\r\n  public addPoint3d(xyz: Point3d, a?: number, b?: number, c?: number) {\r\n    const i0 = this.newBlockIndex();\r\n    this._data[i0 + 1] = xyz.x;\r\n    this._data[i0 + 2] = xyz.y;\r\n    this._data[i0 + 3] = xyz.z;\r\n    if (a !== undefined)\r\n      this._data[i0 + 4] = a;\r\n    if (b !== undefined)\r\n      this._data[i0 + 5] = b;\r\n    if (c !== undefined)\r\n      this._data[i0 + 6] = c;\r\n  }\r\n  /** Get the xy coordinates by point index. */\r\n  public getPoint2d(blockIndex: number, result?: Point2d): Point2d {\r\n    const i0 = this.blockIndexToDoubleIndex(blockIndex);\r\n    return Point2d.create(this._data[i0 + 1], this._data[i0 + 2], result);\r\n  }\r\n  /** Get the xyZ coordinates by point index. */\r\n  public getPoint3d(blockIndex: number, result?: Point3d): Point3d {\r\n    const i0 = this.blockIndexToDoubleIndex(blockIndex);\r\n    return Point3d.create(this._data[i0 + 1], this._data[i0 + 2], this._data[i0 + 3], result);\r\n  }\r\n  /** Return a single extra data value */\r\n  public getExtraData(blockIndex: number, i: number): number {\r\n    const i0 = this.blockIndexToDoubleIndex(blockIndex);\r\n    return this._data[i0 + 1 + this._numCoordinatePerPoint + i];\r\n  }\r\n  /** Return a single data value */\r\n  public getData(blockIndex: number, i: number): number {\r\n    const i0 = this.blockIndexToDoubleIndex(blockIndex);\r\n    return this._data[i0 + i];\r\n  }\r\n\r\n  /** Set a single extra data value */\r\n  public setExtraData(blockIndex: number, i: number, value: number): void {\r\n    const i0 = this.blockIndexToDoubleIndex(blockIndex);\r\n    this._data[i0 + 1 + this._numCoordinatePerPoint + i] = value;\r\n  }\r\n\r\n  /** this value is used as cluster terminator in the Uint232rray of indcies. */\r\n  public static readonly clusterTerminator = 0xFFffFFff;\r\n  /** Test if `x` is the cluster terminator value. */\r\n  public static isClusterTerminator(x: number): boolean { return x === ClusterableArray.clusterTerminator; }\r\n  /** Return an array giving clusters of blocks with similar coordinates.\r\n   *\r\n   * * The contents of each block is assumed to be set up so the primary sort coordinate is first.\r\n   *\r\n   * ** simple coordinate blocks (x,y) or (x,y,z) would work fine but have occasional performance problems because points with same x would generate big blocks of\r\n   * candidates for clusters.\r\n   * ** The usual solution is to u value which is a dot product along some skew direction and have the blocks contain (u,x,y) or (u,x,y,z) for 2d versus 3d.\r\n   * ** apply setupPrimaryClusterSort to prepare that!!!\r\n   * * After a simple lexical sort, consecutive blocks that are within tolerance in the 0 component\r\n   * are inspected.  Within that candidate set, all blocks that are within tolerance for ALL components are clustered.\r\n   * * In the output cluster array, clusters are terminated a invalid index. Test for the invalid index with GrowableBlockArray.isClusterTerminator (x)\r\n   */\r\n  public clusterIndicesLexical(clusterTolerance: number = Geometry.smallMetricDistance): Uint32Array {\r\n    // install primary sort key\r\n    this.setupPrimaryClusterSort();\r\n    // presort by all coordinates ....\r\n    const firstSort = this.sortIndicesLexical();\r\n    const clusterIndices = new Uint32Array(2 * firstSort.length);  // worst case: no duplicates, each index goes in followed by terminator.\r\n    let m = 0;  // number of cluster indices\r\n    const n = this.numBlocks; // and this must match firstSort.length !!\r\n    let clusterStartBlockIndex = 0;\r\n    let candidateBlockIndex = 0;\r\n    let barrierU = 0.0;\r\n    let i = 0;\r\n    let j = 0;\r\n\r\n    const k0 = 1;   // beginning of active column for distance\r\n    const k1 = 1 + this._numCoordinatePerPoint;\r\n    for (i = 0; i < n; i++) {\r\n      clusterStartBlockIndex = firstSort[i];\r\n      if (!ClusterableArray.isClusterTerminator(clusterStartBlockIndex)) {\r\n        // unused block, so it becomes a cluster...\r\n        clusterIndices[m++] = clusterStartBlockIndex;\r\n        barrierU = this.component(clusterStartBlockIndex, 0) + clusterTolerance;\r\n        firstSort[i] = ClusterableArray.clusterTerminator;\r\n        for (j = i + 1; j < n; j++) {\r\n          candidateBlockIndex = firstSort[j];\r\n          if (candidateBlockIndex === ClusterableArray.clusterTerminator) continue; // nearby in sort direction but already in a cluster.\r\n          if (this.component(candidateBlockIndex, 0) >= barrierU) break;\r\n          if (this.distanceBetweenSubBlocks(clusterStartBlockIndex, candidateBlockIndex, k0, k1) < clusterTolerance) {\r\n            clusterIndices[m++] = candidateBlockIndex;            // The candidate is in the block\r\n            firstSort[j] = ClusterableArray.clusterTerminator;  // and it will not be reused as future block base\r\n          }\r\n        }\r\n        clusterIndices[m++] = ClusterableArray.clusterTerminator;\r\n      }\r\n    }\r\n    // Alas, the clusterIndices array has fluff at the end.  So it has to be copied.\r\n    return clusterIndices.slice(0, m);\r\n  }\r\n  /** setup (overwrite!!) the \"0\" component with the dot product of numClusterCoordinate later components with a non-axis aligned vector.\r\n   * This is normally called before clusterIndicesLexical.\r\n   */\r\n  public setupPrimaryClusterSort() {\r\n    const nb = this.numBlocks;\r\n    const nc = this._numCoordinatePerPoint;\r\n    const vector = new Float64Array(nc);\r\n    vector[0] = 1.0;\r\n    for (let c = 1; c < nc; c++) vector[c] = vector[c - 1] * ClusterableArray._vectorFactor;\r\n    let k = 0;\r\n    let dot = 0.0;\r\n    const data = this._data;\r\n    for (let b = 0; b < nb; b++) {\r\n      k = this.blockIndexToDoubleIndex(b);\r\n      dot = 0.0;\r\n      for (let c = 0; c < nc; c++) { dot += vector[c] * data[k + 1 + c]; }\r\n      data[k] = dot;\r\n    }\r\n  }\r\n  /** Convert the cluster data to an array of tuples with point i in the form\r\n   * `[i, primarySortCoordinate, [x,y,..], [extraData0, extraData1, ...]]`\r\n   */\r\n  public toJSON(): any[] {\r\n    const result: any[] = [];\r\n    for (let b = 0; b < this.numBlocks; b++) {\r\n      let i = this.blockIndexToDoubleIndex(b);\r\n      const chunk: any[] = [b, this._data[i++]];\r\n      const coordinates = [];\r\n      for (let c = 0; c < this._numCoordinatePerPoint; c++)coordinates.push(this._data[i++]);\r\n      chunk.push(coordinates);\r\n      for (let c = 0; c < this._numExtraDataPerPoint; c++)\r\n        chunk.push(this._data[i++]);\r\n      result.push(chunk);\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Return an array of indices from block index to cluster index.\r\n   * @param clusteredBlocks clusters of block indices followed by separators.\r\n   */\r\n  public createIndexBlockToClusterIndex(clusteredBlocks: Uint32Array): Uint32Array {\r\n    const numBlocks = this.numBlocks;\r\n    const blockToCluster = new Uint32Array(numBlocks);\r\n    blockToCluster.fill(ClusterableArray.clusterTerminator);\r\n    let numCluster = 0;\r\n    for (const b of clusteredBlocks) {\r\n      if (b >= numBlocks) {\r\n        numCluster++;\r\n      } else {\r\n        blockToCluster[b] = numCluster;\r\n      }\r\n    }\r\n    return blockToCluster;\r\n  }\r\n  /**\r\n   * Return an array of indices from block index to index of its cluster's start in the cluster index array.\r\n   * @param clusteredBlocks clusters of block indices followed by separators.\r\n   */\r\n  public createIndexBlockToClusterStart(clusteredBlocks: Uint32Array): Uint32Array {\r\n    const n = clusteredBlocks.length;\r\n    const numBlocks = this.numBlocks;\r\n    const blockToClusterStart = new Uint32Array(numBlocks);\r\n    const terminator = ClusterableArray.clusterTerminator;\r\n    blockToClusterStart.fill(terminator);\r\n    let clusterStart = 0;\r\n    for (let i = 0; i < n; i++) {\r\n      const k = clusteredBlocks[i];\r\n      if (k > numBlocks) {\r\n        clusterStart = i + 1;\r\n      } else {\r\n        blockToClusterStart[k] = clusterStart;\r\n      }\r\n    }\r\n    return blockToClusterStart;\r\n  }\r\n  /** count the clusters in the clusteredBlocks array. */\r\n  public countClusters(clusteredBlocks: Uint32Array): number {\r\n    let numClusters = 0;\r\n    const terminator = ClusterableArray.clusterTerminator;\r\n    for (const b of clusteredBlocks) {\r\n      if (b === terminator)\r\n        numClusters++;\r\n    }\r\n    return numClusters;\r\n  }\r\n  /** create a reverse index: given a cluster index k, clusterToClusterStart[k] is the place\r\n   * the cluster's block indices appear in clusterBlocks\r\n   */\r\n  public createIndexClusterToClusterStart(clusteredBlocks: Uint32Array): Uint32Array {\r\n    let numCluster = this.countClusters(clusteredBlocks);\r\n    const clusterToClusterStart = new Uint32Array(numCluster);\r\n    const terminator = ClusterableArray.clusterTerminator;\r\n    clusterToClusterStart.fill(terminator);\r\n    const n = clusteredBlocks.length;\r\n    let clusterStart = 0;\r\n    for (let i = 0; i < n; i++) {\r\n      const k = clusteredBlocks[i];\r\n      if (k === terminator) {\r\n        clusterStart = i + 1;\r\n      } else if (i === clusterStart) {\r\n        clusterToClusterStart[numCluster++] = clusterStart;\r\n      }\r\n    }\r\n    return clusterToClusterStart;\r\n  }\r\n\r\n  /**\r\n   * Sort terminator-delimited subsets of an array of indices into the table, using a single extraData index as sort key.\r\n   * @param blockedIndices [in] indices, organized as blocks of good indices terminated by the clusterTerminator.\r\n   * @param extraDataIndex index of the extra data key.\r\n   */\r\n  public sortSubsetsBySingleKey(blockedIndices: Uint32Array, dataIndex: number) {\r\n    const dataOffset = 1 + dataIndex;\r\n    let kBegin = 0;\r\n    let swap;\r\n    let key0, key1;\r\n    const numK = blockedIndices.length;\r\n    for (let kEnd = 0; kEnd < numK; kEnd++) {\r\n      if (blockedIndices[kEnd] === ClusterableArray.clusterTerminator) {\r\n        // sort blockedIndices[kBegin ,= k < kEnd].\r\n        //  (search for minimum remaining, swap  . . )\r\n        for (let k0 = kBegin; k0 + 1 < kEnd; k0++) {\r\n          key0 = this.getWithinBlock(blockedIndices[k0], dataOffset);\r\n          for (let k1 = k0 + 1; k1 < kEnd; k1++) {\r\n            key1 = this.getWithinBlock(blockedIndices[k1], dataOffset);\r\n            if (key1 < key0) {\r\n              swap = blockedIndices[k0];\r\n              blockedIndices[k0] = blockedIndices[k1];\r\n              blockedIndices[k1] = swap;\r\n              key0 = key1;\r\n            }\r\n          }\r\n        }\r\n        kBegin = kEnd + 1;\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Returns packed points with indices mapping old to new.\r\n   * @param data points to cluster.\r\n   */\r\n  public static clusterPoint3dArray(data: Point3d[], tolerance: number = Geometry.smallMetricDistance):\r\n    PackedPointsWithIndex {\r\n    const clusterArray = new ClusterableArray(3, 0, data.length);\r\n    data.forEach((p: Point3d) => {\r\n      clusterArray.addDirect(p.x, p.y, p.z);\r\n    });\r\n    const order = clusterArray.clusterIndicesLexical(tolerance);\r\n    const result = new PackedPointsWithIndex(data.length);\r\n    let currentClusterIndex = 0;\r\n    let numThisCluster = 0;\r\n    order.forEach((k: number) => {\r\n      if (ClusterableArray.isClusterTerminator(k)) {\r\n        currentClusterIndex++;\r\n        numThisCluster = 0;\r\n      } else {\r\n        if (numThisCluster === 0)\r\n          result.packedPoints.push(data[k].clone());\r\n        result.oldToNew[k] = currentClusterIndex;\r\n        numThisCluster++;\r\n      }\r\n    });\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Returns packed points with indices mapping old to new.\r\n   * @param data points to cluster.\r\n   */\r\n  public static clusterGrowablePoint2dArray(source: GrowableXYArray, tolerance: number = Geometry.smallMetricDistance): PackedPoint2dsWithIndex {\r\n    const clusterArray = new ClusterableArray(2, 0, source.length);\r\n    const p = Point2d.create();\r\n    const numSourcePoint = source.length;\r\n    for (let i = 0; i < numSourcePoint; i++) {\r\n      source.getPoint2dAtUncheckedPointIndex(i, p);\r\n      clusterArray.addDirect(p.x, p.y);\r\n    }\r\n    const order = clusterArray.clusterIndicesLexical(tolerance);\r\n    const numPackedPoints = clusterArray.countClusters(order);\r\n    const result = new PackedPoint2dsWithIndex(source.length, numPackedPoints);\r\n    let currentClusterIndex = 0;\r\n    let numThisCluster = 0;\r\n    order.forEach((k: number) => {\r\n      if (ClusterableArray.isClusterTerminator(k)) {\r\n        currentClusterIndex++;\r\n        numThisCluster = 0;\r\n      } else {\r\n        if (numThisCluster === 0) // This is the first encounter with a new cluster\r\n          result.growablePackedPoints.pushFromGrowableXYArray(source, k);\r\n        result.oldToNew[k] = currentClusterIndex;\r\n        numThisCluster++;\r\n      }\r\n    });\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * Returns packed points with indices mapping old to new.\r\n   * @param data points to cluster.\r\n   */\r\n  public static clusterGrowablePoint3dArray(source: GrowableXYZArray, tolerance: number = Geometry.smallMetricDistance):\r\n    PackedPointsWithIndex {\r\n    const clusterArray = new ClusterableArray(3, 0, source.length);\r\n    const p = Point3d.create();\r\n    const numSourcePoint = source.length;\r\n    for (let i = 0; i < numSourcePoint; i++) {\r\n      source.getPoint3dAtUncheckedPointIndex(i, p);\r\n      clusterArray.addDirect(p.x, p.y, p.z);\r\n    }\r\n    const order = clusterArray.clusterIndicesLexical(tolerance);\r\n    const result = new PackedPointsWithIndex(source.length);\r\n    const numPackedPoints = clusterArray.countClusters(order);\r\n    result.growablePackedPoints = new GrowableXYZArray(numPackedPoints);\r\n    let currentClusterIndex = 0;\r\n    let numThisCluster = 0;\r\n    order.forEach((k: number) => {\r\n      if (ClusterableArray.isClusterTerminator(k)) {\r\n        currentClusterIndex++;\r\n        numThisCluster = 0;\r\n      } else {\r\n        if (numThisCluster === 0) // This is the first encounter with a new cluster\r\n          result.growablePackedPoints!.pushFromGrowableXYZArray(source, k);\r\n        result.oldToNew[k] = currentClusterIndex;\r\n        numThisCluster++;\r\n      }\r\n    });\r\n    return result;\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nfunction updateIndices(indices: number[], oldToNew: Uint32Array): boolean {\r\n  let numErrors = 0;\r\n  indices.forEach((value: number, i: number, data: number[]) => {\r\n    if (value < oldToNew.length) {\r\n      data[i] = oldToNew[value];\r\n    } else numErrors++;\r\n  });\r\n  return numErrors === 0;\r\n}\r\n\r\n/**\r\n * Data carrier class for\r\n * * packedPoints = an array of Point3d\r\n * * oldToNew = array of indices from some prior Point3d[] to the packed points.\r\n * @internal\r\n */\r\nclass PackedPointsWithIndex {\r\n  /** Array of Point3d */\r\n  public packedPoints: Point3d[];\r\n  /** array of coordinates packed in GrowableXYZArray  */\r\n  public growablePackedPoints: GrowableXYZArray | undefined;\r\n  /** mapping from old point index to new point index. */\r\n  public oldToNew: Uint32Array;\r\n  /** integer value for unknown index. */\r\n  public static readonly invalidIndex = 0xFFFFffff;\r\n\r\n  /** construct a PackedPoints object with\r\n   * * empty packedPoints array\r\n   * * oldToNew indices all initialized to PackedPoints.invalidIndex\r\n   */\r\n  constructor(numOldIndexEntry: number) {\r\n    this.packedPoints = [];\r\n    this.oldToNew = new Uint32Array(numOldIndexEntry);\r\n    for (let i = 0; i < numOldIndexEntry; i++) {\r\n      this.oldToNew[i] = PackedPointsWithIndex.invalidIndex;\r\n    }\r\n  }\r\n  /**\r\n   * Use the oldToNew array to update an array of \"old\" indices.\r\n   * @param indices array of indices into prepacked array.\r\n   * @returns true if all input indices were valid for the oldToNew array.\r\n   */\r\n  public updateIndices(indices: number[]): boolean {\r\n    return updateIndices(indices, this.oldToNew);\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nclass PackedPoint2dsWithIndex {\r\n  /** array of coordinates packed in GrowableXYArray  */\r\n  public growablePackedPoints: GrowableXYArray;\r\n  /** mapping from old point index to new point index. */\r\n  public oldToNew: Uint32Array;\r\n  /** integer value for unknown index. */\r\n  public static readonly invalidIndex = 0xFFFFffff;\r\n\r\n  /** construct a PackedPoints object with\r\n   * * empty packedPoints array\r\n   * * oldToNew indices all initialized to PackedPoints.invalidIndex\r\n   */\r\n  constructor(numOldIndexEntry: number, numPackedPoints: number) {\r\n    this.growablePackedPoints = new GrowableXYArray(numPackedPoints);\r\n    this.oldToNew = new Uint32Array(numOldIndexEntry);\r\n    for (let i = 0; i < numOldIndexEntry; i++) {\r\n      this.oldToNew[i] = PackedPoint2dsWithIndex.invalidIndex;\r\n    }\r\n  }\r\n  /**\r\n   * Use the oldToNew array to update an array of \"old\" indices.\r\n   * @param indices array of indices into prepacked array.\r\n   * @returns true if all input indices were valid for the oldToNew array.\r\n   */\r\n  public updateIndices(indices: number[]): boolean {\r\n    return updateIndices(indices, this.oldToNew);\r\n  }\r\n}\r\n"]}

package/lib/esm/numerics/Complex.d.ts

@@ -0,0 +1,63 @@
+/** @packageDocumentation
+ * @module Numerics
+ */
+import { BeJSONFunctions } from "../Geometry";
+import { Angle } from "../geometry3d/Angle";
+/**
+ * OPerations on a "complex number" class with real part `x` and complex part `y`
+ * @internal
+ */
+export declare class Complex implements BeJSONFunctions {
+    private _x;
+    /** Real part */
+    get x(): number;
+    set x(value: number);
+    private _y;
+    /** Imaginary part */
+    get y(): number;
+    set y(value: number);
+    constructor(x?: number, y?: number);
+    /** set x and y parts from args. */
+    set(x?: number, y?: number): void;
+    /** set `this.x` and `this.y` from `other.x` and `other.y` */
+    setFrom(other: Complex): void;
+    /** clone the complex x,y */
+    clone(): Complex;
+    /** test for near equality using coordinate tolerances */
+    isAlmostEqual(other: Complex): boolean;
+    /** Create a new Complex instance from given x and y. */
+    static create(x?: number, y?: number, result?: Complex): Complex;
+    /** Return the complex sum `this+other` */
+    plus(other: Complex, result?: Complex): Complex;
+    /** Return the complex difference  `this-other` */
+    minus(other: Complex, result?: Complex): Complex;
+    /** Return the complex product  `this * other` */
+    times(other: Complex, result?: Complex): Complex;
+    /** Return the complex product `this * x+i*y`. That is, the second Complex value exists via the args without being formally created as an instance. */
+    timesXY(x: number, y: number, result?: Complex): Complex;
+    /** Return the mangitude of the complex number */
+    magnitude(): number;
+    /** Return the angle from x axis to the vector (x,y) */
+    angle(): Angle;
+    /** Return the xy plane distance between this and other */
+    distance(other: Complex): number;
+    /** Return the squared xy plane distance between this and other. */
+    magnitudeSquared(): number;
+    /** Return the complex division `this / other` */
+    divide(other: Complex, result?: Complex): Complex | undefined;
+    /** Return the complex square root of this. */
+    sqrt(result?: Complex): Complex;
+    /** set the complex x,y from a json object of the form like
+     * * x,y key value pairs:   `{x:1,y:2}`
+     * * array of numbers:  `[1,2]`
+     */
+    setFromJSON(json?: any): void;
+    /** Create a `Complex` instance from a json object. */
+    static fromJSON(json?: any): Complex;
+    /**
+     * Convert an Complex to a JSON object.
+     * @return {*} [x,y]
+     */
+    toJSON(): any;
+}
+//# sourceMappingURL=Complex.d.ts.map

package/lib/esm/numerics/Complex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Complex.d.ts","sourceRoot":"","sources":["../../../src/numerics/Complex.ts"],"names":[],"mappings":"AAIA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAY,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C;;;GAGG;AACH,qBAAa,OAAQ,YAAW,eAAe;IAC7C,OAAO,CAAC,EAAE,CAAS;IACnB,gBAAgB;IAChB,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,IAAW,CAAC,CAAC,KAAK,EAAE,MAAM,EAAsB;IAEhD,OAAO,CAAC,EAAE,CAAS;IACnB,qBAAqB;IACrB,IAAW,CAAC,IAAI,MAAM,CAAoB;IAC1C,IAAW,CAAC,CAAC,KAAK,EAAE,MAAM,EAAsB;gBAE7B,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU;IAC/C,mCAAmC;IAC5B,GAAG,CAAC,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,GAAG,IAAI;IAC9C,6DAA6D;IACtD,OAAO,CAAC,KAAK,EAAE,OAAO;IAC7B,4BAA4B;IACrB,KAAK,IAAI,OAAO;IACvB,yDAAyD;IAClD,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAC7C,wDAAwD;WAC1C,MAAM,CAAC,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAQ7E,0CAA0C;IACnC,IAAI,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IACtD,kDAAkD;IAC3C,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IACvD,iDAAiD;IAC1C,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAMvD,sJAAsJ;IAC/I,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAM/D,iDAAiD;IAC1C,SAAS,IAAI,MAAM;IAC1B,uDAAuD;IAChD,KAAK,IAAI,KAAK;IACrB,0DAA0D;IACnD,QAAQ,CAAC,KAAK,EAAE,OAAO;IAG9B,mEAAmE;IAC5D,gBAAgB,IAAI,MAAM;IACjC,iDAAiD;IAC1C,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAUpE,8CAA8C;IACvC,IAAI,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAuBtC;;;OAGG;IACI,WAAW,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,IAAI;IASpC,sDAAsD;WACxC,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,OAAO;IAE3C;;;OAGG;IACI,MAAM,IAAI,GAAG;CAErB"}