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

package/lib/esm/polyface/PolyfaceData.js

@@ -0,0 +1,527 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Polyface
+ */
+import { Geometry } from "../Geometry";
+import { GrowableXYArray } from "../geometry3d/GrowableXYArray";
+import { GrowableXYZArray } from "../geometry3d/GrowableXYZArray";
+import { Point2d } from "../geometry3d/Point2dVector2d";
+import { Point3d, Vector3d } from "../geometry3d/Point3dVector3d";
+import { NumberArray } from "../geometry3d/PointHelpers";
+import { Range3d } from "../geometry3d/Range";
+import { ClusterableArray } from "../numerics/ClusterableArray";
+import { PolyfaceAuxData } from "./AuxData";
+import { TaggedNumericData } from "./TaggedNumericData";
+/**
+ * PolyfaceData carries data arrays for point, normal, param, color and their indices.
+ *
+ * * IndexedPolyface carries a PolyfaceData as a member. (NOT as a base class -- it already has GeometryQuery as base)
+ * * IndexedPolyfaceVisitor uses PolyfaceData as a base class.  In this use there is only a single facet in the polyfaceData.
+ * * PolyfaceData does not know (!!!) what indices range constitute a facet.  That is managed by derived class or carrier class.
+ * @public
+ */
+export class PolyfaceData {
+    /** Constructor for facets.
+     *   * The various params control whether respective arrays are to be allocated.
+     *   * If arrayData is provided, all other params are IGNORED.
+     *   *
+     */
+    constructor(needNormals = false, needParams = false, needColors = false, twoSided = false) {
+        this.face = [];
+        this.point = new GrowableXYZArray();
+        this.pointIndex = [];
+        this.edgeVisible = [];
+        if (needNormals) {
+            this.normal = new GrowableXYZArray();
+            this.normalIndex = [];
+        }
+        if (needParams) {
+            this.param = new GrowableXYArray();
+            this.paramIndex = [];
+        }
+        if (needColors) {
+            this.color = [];
+            this.colorIndex = [];
+        }
+        this._twoSided = twoSided;
+        this._expectedClosure = 0;
+    }
+    /** boolean tag indicating if the facets are viewable from the back */
+    get twoSided() { return this._twoSided; }
+    set twoSided(value) { this._twoSided = value; }
+    /** set the `taggedNumericData` member */
+    setTaggedNumericData(data) {
+        this.taggedNumericData = data;
+    }
+    /** boolean tag indicating if the facets are viewable from the back */
+    get expectedClosure() { return this._expectedClosure; }
+    set expectedClosure(value) { this._expectedClosure = value; }
+    /** Return a depp clone. */
+    clone() {
+        const result = new PolyfaceData();
+        result.point = this.point.clone();
+        result.pointIndex = this.pointIndex.slice();
+        result.edgeVisible = this.edgeVisible.slice();
+        result.face = this.face.slice();
+        result.twoSided = this.twoSided;
+        result.expectedClosure = this.expectedClosure;
+        if (this.normal)
+            result.normal = this.normal.clone();
+        if (this.param)
+            result.param = this.param.clone();
+        if (this.color)
+            result.color = this.color.slice();
+        if (this.normalIndex)
+            result.normalIndex = this.normalIndex.slice();
+        if (this.paramIndex)
+            result.paramIndex = this.paramIndex.slice();
+        if (this.colorIndex)
+            result.colorIndex = this.colorIndex.slice();
+        if (this.auxData)
+            result.auxData = this.auxData.clone();
+        if (this.taggedNumericData) {
+            result.taggedNumericData = this.taggedNumericData.clone();
+        }
+        return result;
+    }
+    /** Test for equal indices and nearly equal coordinates */
+    isAlmostEqual(other) {
+        if (!GrowableXYZArray.isAlmostEqual(this.point, other.point))
+            return false;
+        if (!NumberArray.isExactEqual(this.pointIndex, other.pointIndex))
+            return false;
+        if (!GrowableXYZArray.isAlmostEqual(this.normal, other.normal))
+            return false;
+        if (!NumberArray.isExactEqual(this.normalIndex, other.normalIndex))
+            return false;
+        if (!GrowableXYArray.isAlmostEqual(this.param, other.param))
+            return false;
+        if (!NumberArray.isExactEqual(this.paramIndex, other.paramIndex))
+            return false;
+        if (!NumberArray.isExactEqual(this.color, other.color))
+            return false;
+        if (!NumberArray.isExactEqual(this.colorIndex, other.colorIndex))
+            return false;
+        if (!NumberArray.isExactEqual(this.edgeVisible, other.edgeVisible))
+            return false;
+        if (!PolyfaceAuxData.isAlmostEqual(this.auxData, other.auxData))
+            return false;
+        if (this.twoSided !== other.twoSided)
+            return false;
+        if (this.expectedClosure !== other.expectedClosure)
+            return false;
+        if (!TaggedNumericData.areAlmostEqual(this.taggedNumericData, other.taggedNumericData))
+            return false;
+        return true;
+    }
+    /** Ask if normals are required in this mesh. */
+    get requireNormals() { return undefined !== this.normal; }
+    /** Get the point count */
+    get pointCount() { return this.point.length; }
+    /** Get the normal count */
+    get normalCount() { return this.normal ? this.normal.length : 0; }
+    /** Get the param count */
+    get paramCount() { return this.param ? this.param.length : 0; }
+    /** Get the color count */
+    get colorCount() { return this.color ? this.color.length : 0; }
+    /** Get the index count.  Note that there is one count, and all index arrays (point, normal, param, color) must match */
+    get indexCount() { return this.pointIndex.length; } // ALWAYS INDEXED ... all index vectors must have same length.
+    /** Get the number of faces.
+     * * Note that a "face" is not a facet.
+     * * A "face" is a subset of facets grouped for application purposes.
+     */
+    get faceCount() { return this.face.length; }
+    /** return indexed point. This is a copy of the coordinates, not a reference. */
+    getPoint(i, out) {
+        return this.point.getPoint3dAtCheckedPointIndex(i, out);
+    }
+    /** return indexed normal. This is the COPY to the normal, not a reference. */
+    getNormal(i) { return this.normal ? this.normal.getVector3dAtCheckedVectorIndex(i) : undefined; }
+    /** return indexed param. This is the COPY of the coordinates, not a reference. */
+    getParam(i) { return this.param ? this.param.getPoint2dAtCheckedPointIndex(i) : undefined; }
+    /** return indexed color */
+    getColor(i) { return this.color ? this.color[i] : 0; }
+    /** return indexed visibility */
+    getEdgeVisible(i) { return this.edgeVisible[i]; }
+    /** Copy the contents (not pointer) of point[i] into dest. */
+    copyPointTo(i, dest) { this.point.getPoint3dAtUncheckedPointIndex(i, dest); }
+    /** Copy the contents (not pointer) of normal[i] into dest. */
+    copyNormalTo(i, dest) { if (this.normal)
+        this.normal.getVector3dAtCheckedVectorIndex(i, dest); }
+    /** Copy the contents (not pointer) of param[i] into dest. */
+    copyParamTo(i, dest) { if (this.param)
+        this.param.getPoint2dAtCheckedPointIndex(i, dest); }
+    /** test if normal at a specified index matches uv */
+    isAlmostEqualParamIndexUV(index, u, v) {
+        if (this.param !== undefined && index >= 0 && index < this.param.length)
+            return Geometry.isSameCoordinate(u, this.param.getXAtUncheckedPointIndex(index))
+                && Geometry.isSameCoordinate(v, this.param.getYAtUncheckedPointIndex(index));
+        return false;
+    }
+    /**
+     * * Copy data from other to this.
+     * * This is the essence of transferring coordinates spread throughout a large polyface into a visitor's single facet.
+     * * "other" is the large polyface
+     * * "this" is the visitor
+     * * does NOT copy face data - visitors reference the FacetFaceData array for the whole polyface!!
+     * @param other polyface data being mined.
+     * @param index0 start index in other's index arrays
+     * @param index1 end index (one beyond last data accessed0 in other's index arrays
+     * @param numWrap number of points to replicate as wraparound.
+     */
+    gatherIndexedData(other, index0, index1, numWrap) {
+        const numEdge = index1 - index0;
+        const numTotal = numEdge + numWrap;
+        this.resizeAllDataArrays(numTotal);
+        // copy wrapped points
+        for (let i = 0; i < numEdge; i++)
+            this.point.transferFromGrowableXYZArray(i, other.point, other.pointIndex[index0 + i]);
+        for (let i = 0; i < numWrap; i++)
+            this.point.transferFromGrowableXYZArray(numEdge + i, this.point, i);
+        // copy wrapped pointIndex
+        for (let i = 0; i < numEdge; i++)
+            this.pointIndex[i] = other.pointIndex[index0 + i];
+        for (let i = 0; i < numWrap; i++)
+            this.pointIndex[numEdge + i] = this.pointIndex[i];
+        // copy wrapped edge visibility
+        for (let i = 0; i < numEdge; i++)
+            this.edgeVisible[i] = other.edgeVisible[index0 + i];
+        for (let i = 0; i < numWrap; i++)
+            this.edgeVisible[numEdge + i] = this.edgeVisible[i];
+        if (this.normal && this.normalIndex && other.normal && other.normalIndex) {
+            for (let i = 0; i < numEdge; i++)
+                this.normal.transferFromGrowableXYZArray(i, other.normal, other.normalIndex[index0 + i]);
+            for (let i = 0; i < numWrap; i++)
+                this.normal.transferFromGrowableXYZArray(numEdge + i, this.normal, i);
+            for (let i = 0; i < numEdge; i++)
+                this.normalIndex[i] = other.normalIndex[index0 + i];
+            for (let i = 0; i < numWrap; i++)
+                this.normalIndex[numEdge + i] = this.normalIndex[i];
+        }
+        if (this.param && this.paramIndex && other.param && other.paramIndex) {
+            for (let i = 0; i < numEdge; i++)
+                this.param.transferFromGrowableXYArray(i, other.param, other.paramIndex[index0 + i]);
+            for (let i = 0; i < numWrap; i++)
+                this.param.transferFromGrowableXYArray(numEdge + i, this.param, i);
+            for (let i = 0; i < numEdge; i++)
+                this.paramIndex[i] = other.paramIndex[index0 + i];
+            for (let i = 0; i < numWrap; i++)
+                this.paramIndex[numEdge + i] = this.paramIndex[i];
+        }
+        if (this.color && this.colorIndex && other.color && other.colorIndex) {
+            for (let i = 0; i < numEdge; i++)
+                this.color[i] = other.color[other.colorIndex[index0 + i]];
+            for (let i = 0; i < numWrap; i++)
+                this.color[numEdge + i] = this.color[i];
+            for (let i = 0; i < numEdge; i++)
+                this.colorIndex[i] = other.colorIndex[index0 + i];
+            for (let i = 0; i < numWrap; i++)
+                this.colorIndex[numEdge + i] = this.colorIndex[i];
+        }
+        if (this.auxData && other.auxData && this.auxData.channels.length === other.auxData.channels.length) {
+            for (let iChannel = 0; iChannel < this.auxData.channels.length; iChannel++) {
+                const thisChannel = this.auxData.channels[iChannel];
+                const otherChannel = other.auxData.channels[iChannel];
+                const blockSize = thisChannel.entriesPerValue;
+                if (thisChannel.data.length === otherChannel.data.length) {
+                    for (let iData = 0; iData < thisChannel.data.length; iData++) {
+                        const thisData = thisChannel.data[iData];
+                        const otherData = otherChannel.data[iData];
+                        for (let i = 0; i < numEdge; i++)
+                            thisData.copyValues(otherData, i, other.auxData.indices[index0 + i], blockSize);
+                        for (let i = 0; i < numWrap; i++)
+                            thisData.copyValues(thisData, other.auxData.indices[numEdge + i], i, blockSize);
+                    }
+                }
+            }
+            for (let i = 0; i < numEdge; i++)
+                this.auxData.indices[i] = other.auxData.indices[index0 + i];
+            for (let i = 0; i < numWrap; i++)
+                this.auxData.indices[numEdge + i] = this.auxData.indices[i];
+        }
+    }
+    static trimArray(data, length) { if (data && length < data.length)
+        data.length = length; }
+    /** Trim all index arrays to stated length.
+     * * This is called by PolyfaceBuilder to clean up after an aborted construction sequence.
+     */
+    trimAllIndexArrays(length) {
+        PolyfaceData.trimArray(this.pointIndex, length);
+        PolyfaceData.trimArray(this.paramIndex, length);
+        PolyfaceData.trimArray(this.normalIndex, length);
+        PolyfaceData.trimArray(this.colorIndex, length);
+        PolyfaceData.trimArray(this.edgeVisible, length);
+        if (this.auxData) {
+            PolyfaceData.trimArray(this.auxData.indices, length);
+            for (const channel of this.auxData.channels) {
+                for (const data of channel.data)
+                    PolyfaceData.trimArray(data.values, channel.entriesPerValue * length);
+            }
+        }
+    }
+    /** Resize all data arrays to specified length */
+    resizeAllDataArrays(length) {
+        if (length > this.point.length) {
+            while (this.point.length < length)
+                this.point.push(Point3d.create());
+            while (this.pointIndex.length < length)
+                this.pointIndex.push(-1);
+            while (this.edgeVisible.length < length)
+                this.edgeVisible.push(false);
+            if (this.normal)
+                while (this.normal.length < length)
+                    this.normal.push(Vector3d.create());
+            if (this.param)
+                while (this.param.length < length)
+                    this.param.push(Point2d.create());
+            if (this.color)
+                while (this.color.length < length)
+                    this.color.push(0);
+            if (this.auxData) {
+                for (const channel of this.auxData.channels) {
+                    for (const channelData of channel.data) {
+                        while (channelData.values.length < length * channel.entriesPerValue)
+                            channelData.values.push(0);
+                    }
+                }
+            }
+        }
+        else if (length < this.point.length) {
+            this.point.resize(length);
+            this.edgeVisible.length = length;
+            this.pointIndex.length = length;
+            if (this.normal)
+                this.normal.resize(length);
+            if (this.param)
+                this.param.resize(length);
+            if (this.color)
+                this.color.length = length;
+            if (this.auxData) {
+                for (const channel of this.auxData.channels) {
+                    for (const channelData of channel.data) {
+                        channelData.values.length = length * channel.entriesPerValue;
+                    }
+                }
+            }
+        }
+    }
+    /** Return the range of the point array (optionally transformed) */
+    range(result, transform) {
+        result = result ? result : Range3d.createNull();
+        result.extendArray(this.point, transform);
+        return result;
+    }
+    /** reverse indices facet-by-facet, with the given facetStartIndex array delimiting faces.
+     *
+     * * facetStartIndex[0] == 0 always -- start of facet zero.
+     * * facet k has indices from facetStartIndex[k] <= i < facetStartIndex[k+1]
+     * * hence for "internal" k, facetStartIndex[k] is both the upper limit of facet k-1 and the start of facet k.
+     * *
+     */
+    reverseIndices(facetStartIndex) {
+        if (facetStartIndex && PolyfaceData.isValidFacetStartIndexArray(facetStartIndex)) {
+            PolyfaceData.reverseIndices(facetStartIndex, this.pointIndex, true);
+            if (this.normalIndex !== this.pointIndex)
+                PolyfaceData.reverseIndices(facetStartIndex, this.normalIndex, true);
+            if (this.paramIndex !== this.pointIndex)
+                PolyfaceData.reverseIndices(facetStartIndex, this.paramIndex, true);
+            if (this.colorIndex !== this.pointIndex)
+                PolyfaceData.reverseIndices(facetStartIndex, this.colorIndex, true);
+            PolyfaceData.reverseIndices(facetStartIndex, this.edgeVisible, false);
+        }
+    }
+    /** reverse indices facet-by-facet, with the given facetStartIndex array delimiting faces.
+     *
+     * * facetStartIndex[0] == 0 always -- start of facet zero.
+     * * facet k has indices from facetStartIndex[k] <= i < facetStartIndex[k+1]
+     * * hence for "internal" k, facetStartIndex[k] is both the upper limit of facet k-1 and the start of facet k.
+     * *
+     */
+    reverseIndicesSingleFacet(facetId, facetStartIndex) {
+        PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.pointIndex, true);
+        if (this.normalIndex !== this.pointIndex)
+            PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.normalIndex, true);
+        if (this.paramIndex !== this.pointIndex)
+            PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.paramIndex, true);
+        if (this.colorIndex !== this.pointIndex)
+            PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.colorIndex, true);
+        PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.edgeVisible, false);
+    }
+    /** Scale all the normals by -1 */
+    reverseNormals() {
+        if (this.normal)
+            this.normal.scaleInPlace(-1.0);
+    }
+    /** Apply `transform` to point and normal arrays and to auxData.
+     * * IMPORTANT This base class is just a data carrier.  It does not know if the index order and normal directions have special meaning.
+     * * i.e. caller must separately reverse index order and normal direction if needed.
+     */
+    tryTransformInPlace(transform) {
+        this.point.multiplyTransformInPlace(transform);
+        if (this.normal && !transform.matrix.isIdentity)
+            this.normal.multiplyAndRenormalizeMatrix3dInverseTransposeInPlace(transform.matrix);
+        return undefined === this.auxData || this.auxData.tryTransformInPlace(transform);
+    }
+    /**
+     * * Search for duplication of coordinates within points, normals, and params.
+     * * compress the coordinate arrays.
+     * * revise all indexing for the relocated coordinates
+     */
+    compress() {
+        const packedPoints = ClusterableArray.clusterGrowablePoint3dArray(this.point);
+        this.point = packedPoints.growablePackedPoints;
+        packedPoints.updateIndices(this.pointIndex);
+        //  compressUnusedGrowableXYZArray(this.point, this.pointIndex);
+        if (this.normalIndex && this.normal) {
+            const packedNormals = ClusterableArray.clusterGrowablePoint3dArray(this.normal);
+            this.normal = packedNormals.growablePackedPoints;
+            packedNormals.updateIndices(this.normalIndex);
+        }
+        if (this.paramIndex && this.param) {
+            const packedParams = ClusterableArray.clusterGrowablePoint2dArray(this.param);
+            this.param = packedParams.growablePackedPoints;
+            packedParams.updateIndices(this.paramIndex);
+        }
+    }
+    /**
+     * Test if facetStartIndex is (minimally!) valid:
+     * * length must be nonzero (recall that for "no facets" the facetStartIndexArray still must contain a 0)
+     * * Each entry must be strictly smaller than the one that follows.
+     * @param facetStartIndex array of facetStart data.  facet `i` has indices at `facetsStartIndex[i]` to (one before) `facetStartIndex[i+1]`
+     */
+    static isValidFacetStartIndexArray(facetStartIndex) {
+        // facetStartIndex for empty facets has a single entry "0" -- empty array is not allowed
+        if (facetStartIndex.length === 0)
+            return false;
+        for (let i = 0; i + 1 < facetStartIndex.length; i++)
+            if (facetStartIndex[i] >= facetStartIndex[i + 1])
+                return false;
+        return true;
+    }
+    /** Reverse data in entire facet indexing arrays.
+     * * parameterized over type T so non-number data -- e.g. boolean visibility flags -- can be reversed.
+     */
+    static reverseIndices(facetStartIndex, indices, preserveStart) {
+        if (!indices || indices.length === 0)
+            return true; // empty case
+        if (indices.length > 0) {
+            if (facetStartIndex[facetStartIndex.length - 1] === indices.length) {
+                for (let i = 0; i + 1 < facetStartIndex.length; i++) {
+                    let index0 = facetStartIndex[i];
+                    let index1 = facetStartIndex[i + 1];
+                    if (preserveStart) {
+                        // leave [index0] as is so reversed facet starts at same vertex
+                        while (index1 > index0 + 2) {
+                            index1--;
+                            index0++;
+                            const a = indices[index0];
+                            indices[index0] = indices[index1];
+                            indices[index1] = a;
+                        }
+                    }
+                    else {
+                        // reverse all
+                        while (index1 > index0 + 1) {
+                            index1--;
+                            const a = indices[index0];
+                            indices[index0] = indices[index1];
+                            indices[index1] = a;
+                            index0++;
+                        }
+                    }
+                }
+                return true;
+            }
+        }
+        return false;
+    }
+    /** Reverse data in entire facet indexing arrays.
+     * * parameterized over type T so non-number data -- e.g. boolean visibility flags -- can be reversed.
+     */
+    static reverseIndicesSingleFacet(facetId, facetStartIndex, indices, preserveStart) {
+        if (!indices || indices.length === 0)
+            return true; // empty case
+        if (indices.length > 0) {
+            if (facetStartIndex[facetStartIndex.length - 1] === indices.length
+                && facetId >= 0 && facetId + 1 < facetStartIndex.length) {
+                let index0 = facetStartIndex[facetId];
+                let index1 = facetStartIndex[facetId + 1];
+                if (preserveStart) {
+                    // leave [index0] as is so reversed facet starts at same vertex
+                    while (index1 > index0 + 2) {
+                        index1--;
+                        index0++;
+                        const a = indices[index0];
+                        indices[index0] = indices[index1];
+                        indices[index1] = a;
+                    }
+                }
+                else {
+                    // reverse all
+                    while (index1 > index0 + 1) {
+                        index1--;
+                        const a = indices[index0];
+                        indices[index0] = indices[index1];
+                        indices[index1] = a;
+                        index0++;
+                    }
+                }
+                return true;
+            }
+        }
+        return false;
+    }
+}
+// <ul
+// <li>optional arrays (normal, uv, color) must be indicated at constructor time.
+// <li>all arrays are (independently) indexed.
+// <li>with regret, the point, param, normal, and color arrays are exposed publicly.
+// <li>getX methods are "trusting" -- no bounds check
+// <li>getX methods return references to X.
+// <li> EXCEPT -- for optional arrays, the return 000.
+// <li>copyX methods move data to caller-supplied result..
+// </ul>
+/** Relative tolerance used in tests for planar facets
+ * @internal
+ */
+PolyfaceData.planarityLocalRelTol = 1.0e-13;
+/**
+ * pack out data entries that are unreferenced.
+ * @param data data to pack
+ * @param indices indices into the data.
+
+function compressUnusedGrowableXYZArray(data: GrowableXYZArray, indices: number[]): boolean {
+  // 1 entry per data[i]
+  // pass 0: number of references
+  // pass 1: post-compression index (or -1)
+  const n0 = data.length;
+  const work = new Int32Array(data.length);
+  for (const k of indices) {
+    if (k < 0 || k >= n0)
+      return false;
+    work[k]++;
+  }
+  let n1 = 0;
+  for (let i = 0; i < n0; i++) {
+    if (work[i] === 0)
+      work[i] = -1;
+    else
+      work[i] = n1++;
+  }
+  const numIndex = indices.length;
+  for (let i = 0; i < numIndex; i++) {
+    indices[i] = work[indices[i]];
+  }
+  for (let i = 0; i < n0; i++) {
+    const j = work[i];
+    if (j >= 0)
+      data.moveIndexToIndex(i, j);
+  }
+  data.length = n1;
+  return true;
+}
+*/
+//# sourceMappingURL=PolyfaceData.js.map

package/lib/esm/polyface/PolyfaceData.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PolyfaceData.js","sourceRoot":"","sources":["../../../src/polyface/PolyfaceData.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,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,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD;;;;;;;GAOG;AACH,MAAM,OAAO,YAAY;IAqDvB;;;;OAIG;IACH,YAAmB,cAAuB,KAAK,EAAE,aAAsB,KAAK,EAAE,aAAsB,KAAK,EAAE,WAAoB,KAAK;QAClI,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QAC5C,IAAI,WAAW,EAAE;YAAE,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;YAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;SAAE;QACjF,IAAI,UAAU,EAAE;YAAE,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;YAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;SAAE;QAC7E,IAAI,UAAU,EAAE;YAAE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;SAAE;QAC1D,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IA1BD,sEAAsE;IACtE,IAAW,QAAQ,KAAc,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACzD,IAAW,QAAQ,CAAC,KAAc,IAAI,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC;IAE/D,yCAAyC;IAClC,oBAAoB,CAAC,IAAmC;QAC7D,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;IAChC,CAAC;IAED,sEAAsE;IACtE,IAAW,eAAe,KAAa,OAAO,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACtE,IAAW,eAAe,CAAC,KAAa,IAAI,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC,CAAC,CAAC;IAgB5E,2BAA2B;IACpB,KAAK;QACV,MAAM,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAClC,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAClC,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAC5C,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QAC9C,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAChC,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAChC,MAAM,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,CAAC;QAC9C,IAAI,IAAI,CAAC,MAAM;YACb,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACtC,IAAI,IAAI,CAAC,KAAK;YACZ,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,KAAK;YACZ,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAEpC,IAAI,IAAI,CAAC,WAAW;YAClB,MAAM,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QAChD,IAAI,IAAI,CAAC,UAAU;YACjB,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,UAAU;YACjB,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QAC9C,IAAI,IAAI,CAAC,OAAO;YACd,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACxC,IAAI,IAAI,CAAC,iBAAiB,EAAC;YACzB,MAAM,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC;SAC3D;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0DAA0D;IACnD,aAAa,CAAC,KAAmB;QACtC,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;YAC1D,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;YAC9D,OAAO,KAAK,CAAC;QAEf,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;YAAE,OAAO,KAAK,CAAC;QAC7E,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;YAAE,OAAO,KAAK,CAAC;QAEjF,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC1E,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;YAAE,OAAO,KAAK,CAAC;QAE/E,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACrE,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;YAAE,OAAO,KAAK,CAAC;QAE/E,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;YAAE,OAAO,KAAK,CAAC;QACjF,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC;YAAE,OAAO,KAAK,CAAC;QAE9E,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ;YAClC,OAAO,KAAK,CAAC;QAEf,IAAI,IAAI,CAAC,eAAe,KAAK,KAAK,CAAC,eAAe;YAChD,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,iBAAiB,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB,CAAC;YACpF,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD,gDAAgD;IAChD,IAAW,cAAc,KAAc,OAAO,SAAS,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1E,0BAA0B;IAC1B,IAAW,UAAU,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACrD,2BAA2B;IAC3B,IAAW,WAAW,KAAK,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,0BAA0B;IAC1B,IAAW,UAAU,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,0BAA0B;IAC1B,IAAW,UAAU,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,wHAAwH;IACxH,IAAW,UAAU,KAAK,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAE,8DAA8D;IAC1H;;;OAGG;IACH,IAAW,SAAS,KAAK,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAEnD,gFAAgF;IACzE,QAAQ,CAAC,CAAS,EAAE,GAAa;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAC1D,CAAC;IACD,8EAA8E;IACvE,SAAS,CAAC,CAAS,IAA0B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IACtI,kFAAkF;IAC3E,QAAQ,CAAC,CAAS,IAAyB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;IAChI,2BAA2B;IACpB,QAAQ,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,gCAAgC;IACzB,cAAc,CAAC,CAAS,IAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,6DAA6D;IACtD,WAAW,CAAC,CAAS,EAAE,IAAa,IAAU,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3G,8DAA8D;IACvD,YAAY,CAAC,CAAS,EAAE,IAAc,IAAU,IAAI,IAAI,CAAC,MAAM;QAAE,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/H,6DAA6D;IACtD,WAAW,CAAC,CAAS,EAAE,IAAa,IAAU,IAAI,IAAI,CAAC,KAAK;QAAE,IAAI,CAAC,KAAK,CAAC,6BAA6B,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACzH,qDAAqD;IAC9C,yBAAyB,CAAC,KAAa,EAAE,CAAS,EAAE,CAAS;QAClE,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;YACrE,OAAO,QAAQ,CAAC,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC;mBAC3E,QAAQ,CAAC,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,CAAC,CAAC;QACjF,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACI,iBAAiB,CAAC,KAAmB,EAAE,MAAc,EAAE,MAAc,EAAE,OAAe;QAC3F,MAAM,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;QAChC,MAAM,QAAQ,GAAG,OAAO,GAAG,OAAO,CAAC;QACnC,IAAI,CAAC,mBAAmB,CAAC,QAAQ,CAAC,CAAC;QACnC,sBAAsB;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,KAAK,CAAC,4BAA4B,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QACxF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,KAAK,CAAC,4BAA4B,CAAC,OAAO,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEtE,0BAA0B;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,UAAU,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACpD,+BAA+B;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;YAC9B,IAAI,CAAC,WAAW,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAEtD,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,WAAW,EAAE;YACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,MAAM,CAAC,4BAA4B,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3F,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,MAAM,CAAC,4BAA4B,CAAC,OAAO,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAExE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,WAAW,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SACvD;QAED,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,UAAU,EAAE;YACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YACvF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,KAAK,CAAC,2BAA2B,CAAC,OAAO,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAErE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,UAAU,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACrD;QAED,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,UAAU,EAAE;YACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,UAAU,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;SACrD;QACD,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,KAAK,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE;YACnG,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE;gBAC1E,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;gBACpD,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;gBACtD,MAAM,SAAS,GAAG,WAAW,CAAC,eAAe,CAAC;gBAC9C,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,KAAK,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE;oBACxD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;wBAC5D,MAAM,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBACzC,MAAM,SAAS,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;wBAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;4BAC9B,QAAQ,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;wBAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;4BAC9B,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;qBACnF;iBACF;aACF;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SAC/D;IACH,CAAC;IACO,MAAM,CAAC,SAAS,CAAC,IAAuB,EAAE,MAAc,IAAI,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;QAAE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;IAC7H;;OAEG;IACI,kBAAkB,CAAC,MAAc;QACtC,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAChD,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAChD,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QACjD,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAChD,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,OAAO,EAAE;YAChB,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACrD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;gBAC3C,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,IAAI;oBAC7B,YAAY,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,eAAe,GAAG,MAAM,CAAC,CAAC;aACzE;SACF;IACH,CAAC;IACD,iDAAiD;IAC1C,mBAAmB,CAAC,MAAc;QACvC,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM;gBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YACrE,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,MAAM;gBAAE,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,MAAM;gBAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtE,IAAI,IAAI,CAAC,MAAM;gBACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM;oBAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;YAC1E,IAAI,IAAI,CAAC,KAAK;gBACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM;oBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;YACvE,IAAI,IAAI,CAAC,KAAK;gBACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM;oBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACxD,IAAI,IAAI,CAAC,OAAO,EAAE;gBAChB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;oBAC3C,KAAK,MAAM,WAAW,IAAI,OAAO,CAAC,IAAI,EAAE;wBACtC,OAAO,WAAW,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,eAAe;4BAAE,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;qBACjG;iBACF;aACF;SACF;aAAM,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YACrC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC1B,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,MAAM,CAAC;YACjC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC;YAChC,IAAI,IAAI,CAAC,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5C,IAAI,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC1C,IAAI,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC;YAC3C,IAAI,IAAI,CAAC,OAAO,EAAE;gBAChB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE;oBAC3C,KAAK,MAAM,WAAW,IAAI,OAAO,CAAC,IAAI,EAAE;wBACtC,WAAW,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;qBAC9D;iBACF;aACF;SACF;IACH,CAAC;IACD,mEAAmE;IAC5D,KAAK,CAAC,MAAgB,EAAE,SAAqB;QAClD,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;QAChD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAC1C,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,cAAc,CAAC,eAA0B;QAC9C,IAAI,eAAe,IAAI,YAAY,CAAC,2BAA2B,CAAC,eAAe,CAAC,EAAE;YAChF,YAAY,CAAC,cAAc,CAAC,eAAe,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YACpE,IAAI,IAAI,CAAC,WAAW,KAAK,IAAI,CAAC,UAAU;gBACtC,YAAY,CAAC,cAAc,CAAC,eAAe,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;YACvE,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU;gBACrC,YAAY,CAAC,cAAc,CAAC,eAAe,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YACtE,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU;gBACrC,YAAY,CAAC,cAAc,CAAC,eAAe,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YACtE,YAAY,CAAC,cAAc,CAAC,eAAe,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;SACvE;IACH,CAAC;IACD;;;;;;OAMG;IACI,yBAAyB,CAAC,OAAe,EAAE,eAAyB;QACzE,YAAY,CAAC,yBAAyB,CAAC,OAAO,EAAE,eAAe,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACxF,IAAI,IAAI,CAAC,WAAW,KAAK,IAAI,CAAC,UAAU;YACtC,YAAY,CAAC,yBAAyB,CAAC,OAAO,EAAE,eAAe,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QAC3F,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU;YACrC,YAAY,CAAC,yBAAyB,CAAC,OAAO,EAAE,eAAe,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC1F,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,UAAU;YACrC,YAAY,CAAC,yBAAyB,CAAC,OAAO,EAAE,eAAe,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC1F,YAAY,CAAC,yBAAyB,CAAC,OAAO,EAAE,eAAe,EAAE,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IAC5F,CAAC;IAED,kCAAkC;IAC3B,cAAc;QACnB,IAAI,IAAI,CAAC,MAAM;YACb,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,SAAS,CAAC,CAAC;QAE/C,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,UAAU;YAC7C,IAAI,CAAC,MAAM,CAAC,qDAAqD,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAEtF,OAAO,SAAS,KAAK,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;IACnF,CAAC;IACD;;;;OAIG;IACI,QAAQ;QACb,MAAM,YAAY,GAAG,gBAAgB,CAAC,2BAA2B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9E,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,oBAAqB,CAAC;QAChD,YAAY,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC5C,gEAAgE;QAEhE,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,MAAM,EAAE;YACnC,MAAM,aAAa,GAAG,gBAAgB,CAAC,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAChF,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC,oBAAqB,CAAC;YAClD,aAAa,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC/C;QAED,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,KAAK,EAAE;YACjC,MAAM,YAAY,GAAG,gBAAgB,CAAC,2BAA2B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9E,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,oBAAoB,CAAC;YAC/C,YAAY,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SAC7C;IACH,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CAAC,eAAyB;QACjE,wFAAwF;QACxF,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAC9B,OAAO,KAAK,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE;YACjD,IAAI,eAAe,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC9C,OAAO,KAAK,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,cAAc,CAAI,eAAyB,EAAE,OAAwB,EAAE,aAAsB;QACzG,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAClC,OAAO,IAAI,CAAC,CAAE,aAAa;QAC7B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;YACtB,IAAI,eAAe,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,OAAO,CAAC,MAAM,EAAE;gBAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;oBACnD,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;oBAChC,IAAI,MAAM,GAAG,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACpC,IAAI,aAAa,EAAE;wBACjB,+DAA+D;wBAC/D,OAAO,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE;4BAC1B,MAAM,EAAE,CAAC;4BAAC,MAAM,EAAE,CAAC;4BACnB,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;4BAC1B,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;4BAClC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;yBACrB;qBACF;yBAAM;wBACL,cAAc;wBACd,OAAO,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE;4BAC1B,MAAM,EAAE,CAAC;4BACT,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;4BAC1B,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;4BAClC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;4BACpB,MAAM,EAAE,CAAC;yBACV;qBACF;iBACF;gBACD,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,yBAAyB,CAAI,OAAe,EAAE,eAAyB,EAAE,OAAwB,EAAE,aAAsB;QACrI,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAClC,OAAO,IAAI,CAAC,CAAE,aAAa;QAC7B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;YACtB,IAAI,eAAe,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,OAAO,CAAC,MAAM;mBAC7D,OAAO,IAAI,CAAC,IAAI,OAAO,GAAG,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE;gBACzD,IAAI,MAAM,GAAG,eAAe,CAAC,OAAO,CAAC,CAAC;gBACtC,IAAI,MAAM,GAAG,eAAe,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;gBAC1C,IAAI,aAAa,EAAE;oBACjB,+DAA+D;oBAC/D,OAAO,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE;wBAC1B,MAAM,EAAE,CAAC;wBAAC,MAAM,EAAE,CAAC;wBACnB,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;wBAC1B,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;wBAClC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;qBACrB;iBACF;qBAAM;oBACL,cAAc;oBACd,OAAO,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE;wBAC1B,MAAM,EAAE,CAAC;wBACT,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;wBAC1B,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;wBAClC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;wBACpB,MAAM,EAAE,CAAC;qBACV;iBACF;gBACD,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;;AA7dD,MAAM;AACN,iFAAiF;AACjF,8CAA8C;AAC9C,oFAAoF;AACpF,qDAAqD;AACrD,2CAA2C;AAC3C,sDAAsD;AACtD,0DAA0D;AAC1D,QAAQ;AACR;;GAEG;AACoB,iCAAoB,GAAG,OAAO,CAAC;AAodxD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;EAmCE","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 Polyface\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableXYArray } from \"../geometry3d/GrowableXYArray\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { NumberArray } from \"../geometry3d/PointHelpers\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\r\nimport { PolyfaceAuxData } from \"./AuxData\";\r\nimport { FacetFaceData } from \"./FacetFaceData\";\r\nimport { TaggedNumericData } from \"./TaggedNumericData\";\r\n\r\n/**\r\n * PolyfaceData carries data arrays for point, normal, param, color and their indices.\r\n *\r\n * * IndexedPolyface carries a PolyfaceData as a member. (NOT as a base class -- it already has GeometryQuery as base)\r\n * * IndexedPolyfaceVisitor uses PolyfaceData as a base class.  In this use there is only a single facet in the polyfaceData.\r\n * * PolyfaceData does not know (!!!) what indices range constitute a facet.  That is managed by derived class or carrier class.\r\n * @public\r\n */\r\nexport class PolyfaceData {\r\n  // <ul\r\n  // <li>optional arrays (normal, uv, color) must be indicated at constructor time.\r\n  // <li>all arrays are (independently) indexed.\r\n  // <li>with regret, the point, param, normal, and color arrays are exposed publicly.\r\n  // <li>getX methods are \"trusting\" -- no bounds check\r\n  // <li>getX methods return references to X.\r\n  // <li> EXCEPT -- for optional arrays, the return 000.\r\n  // <li>copyX methods move data to caller-supplied result..\r\n  // </ul>\r\n  /** Relative tolerance used in tests for planar facets\r\n   * @internal\r\n   */\r\n  public static readonly planarityLocalRelTol = 1.0e-13;\r\n  /** Coordinate data for points in the facets, packed as numbers in a contiguous array. */\r\n  public point: GrowableXYZArray;\r\n  /** Indices of points at facet vertices. */\r\n  public pointIndex: number[];\r\n  /** booleans indicating visibility of corresponding edges */\r\n  public edgeVisible: boolean[];\r\n  /** Coordinates of normal vectors, packed as numbers in a contiguous array */\r\n  public normal: GrowableXYZArray | undefined;\r\n  /** indices of normals at facet vertices. */\r\n  public normalIndex: number[] | undefined;\r\n  /** Coordinates of uv parameters, packed as numbers in a contiguous array. */\r\n  public param?: GrowableXYArray;\r\n  /** Indics of params at facet vertices. */\r\n  public paramIndex: number[] | undefined;\r\n  /** Color values.  These are carried around as simple numbers, but are probably\r\n   * required (by display systems) map exactly to 32 bit integers.\r\n   */\r\n  public color: number[] | undefined;\r\n  /** Indices of colors at facet vertices. */\r\n  public colorIndex: number[] | undefined;\r\n  /** Face data will remain empty until a face is specified. */\r\n  public face: FacetFaceData[];\r\n  /** Auxiliary data */\r\n  public auxData: PolyfaceAuxData | undefined;\r\n  /** Tagged geometry data */\r\n  public taggedNumericData: TaggedNumericData | undefined;\r\n  private _twoSided: boolean;\r\n  /** boolean tag indicating if the facets are viewable from the back */\r\n  public get twoSided(): boolean { return this._twoSided; }\r\n  public set twoSided(value: boolean) { this._twoSided = value; }\r\n\r\n  /** set the `taggedNumericData` member */\r\n  public setTaggedNumericData(data: TaggedNumericData | undefined) {\r\n    this.taggedNumericData = data;\r\n  }\r\n  private _expectedClosure: number;\r\n  /** boolean tag indicating if the facets are viewable from the back */\r\n  public get expectedClosure(): number { return this._expectedClosure; }\r\n  public set expectedClosure(value: number) { this._expectedClosure = value; }\r\n  /** Constructor for facets.\r\n   *   * The various params control whether respective arrays are to be allocated.\r\n   *   * If arrayData is provided, all other params are IGNORED.\r\n   *   *\r\n   */\r\n  public constructor(needNormals: boolean = false, needParams: boolean = false, needColors: boolean = false, twoSided: boolean = false) {\r\n    this.face = [];\r\n    this.point = new GrowableXYZArray();\r\n    this.pointIndex = []; this.edgeVisible = [];\r\n    if (needNormals) { this.normal = new GrowableXYZArray(); this.normalIndex = []; }\r\n    if (needParams) { this.param = new GrowableXYArray(); this.paramIndex = []; }\r\n    if (needColors) { this.color = []; this.colorIndex = []; }\r\n    this._twoSided = twoSided;\r\n    this._expectedClosure = 0;\r\n  }\r\n  /** Return a depp clone. */\r\n  public clone(): PolyfaceData {\r\n    const result = new PolyfaceData();\r\n    result.point = this.point.clone();\r\n    result.pointIndex = this.pointIndex.slice();\r\n    result.edgeVisible = this.edgeVisible.slice();\r\n    result.face = this.face.slice();\r\n    result.twoSided = this.twoSided;\r\n    result.expectedClosure = this.expectedClosure;\r\n    if (this.normal)\r\n      result.normal = this.normal.clone();\r\n    if (this.param)\r\n      result.param = this.param.clone();\r\n    if (this.color)\r\n      result.color = this.color.slice();\r\n\r\n    if (this.normalIndex)\r\n      result.normalIndex = this.normalIndex.slice();\r\n    if (this.paramIndex)\r\n      result.paramIndex = this.paramIndex.slice();\r\n    if (this.colorIndex)\r\n      result.colorIndex = this.colorIndex.slice();\r\n    if (this.auxData)\r\n      result.auxData = this.auxData.clone();\r\n    if (this.taggedNumericData){\r\n      result.taggedNumericData = this.taggedNumericData.clone();\r\n    }\r\n    return result;\r\n  }\r\n  /** Test for equal indices and nearly equal coordinates */\r\n  public isAlmostEqual(other: PolyfaceData): boolean {\r\n    if (!GrowableXYZArray.isAlmostEqual(this.point, other.point))\r\n      return false;\r\n    if (!NumberArray.isExactEqual(this.pointIndex, other.pointIndex))\r\n      return false;\r\n\r\n    if (!GrowableXYZArray.isAlmostEqual(this.normal, other.normal)) return false;\r\n    if (!NumberArray.isExactEqual(this.normalIndex, other.normalIndex)) return false;\r\n\r\n    if (!GrowableXYArray.isAlmostEqual(this.param, other.param)) return false;\r\n    if (!NumberArray.isExactEqual(this.paramIndex, other.paramIndex)) return false;\r\n\r\n    if (!NumberArray.isExactEqual(this.color, other.color)) return false;\r\n    if (!NumberArray.isExactEqual(this.colorIndex, other.colorIndex)) return false;\r\n\r\n    if (!NumberArray.isExactEqual(this.edgeVisible, other.edgeVisible)) return false;\r\n    if (!PolyfaceAuxData.isAlmostEqual(this.auxData, other.auxData)) return false;\r\n\r\n    if (this.twoSided !== other.twoSided)\r\n      return false;\r\n\r\n    if (this.expectedClosure !== other.expectedClosure)\r\n      return false;\r\n    if (!TaggedNumericData.areAlmostEqual(this.taggedNumericData, other.taggedNumericData))\r\n      return false;\r\n    return true;\r\n  }\r\n  /** Ask if normals are required in this mesh. */\r\n  public get requireNormals(): boolean { return undefined !== this.normal; }\r\n  /** Get the point count */\r\n  public get pointCount() { return this.point.length; }\r\n  /** Get the normal count */\r\n  public get normalCount() { return this.normal ? this.normal.length : 0; }\r\n  /** Get the param count */\r\n  public get paramCount() { return this.param ? this.param.length : 0; }\r\n  /** Get the color count */\r\n  public get colorCount() { return this.color ? this.color.length : 0; }\r\n  /** Get the index count.  Note that there is one count, and all index arrays (point, normal, param, color) must match */\r\n  public get indexCount() { return this.pointIndex.length; }  // ALWAYS INDEXED ... all index vectors must have same length.\r\n  /** Get the number of faces.\r\n   * * Note that a \"face\" is not a facet.\r\n   * * A \"face\" is a subset of facets grouped for application purposes.\r\n   */\r\n  public get faceCount() { return this.face.length; }\r\n\r\n  /** return indexed point. This is a copy of the coordinates, not a reference. */\r\n  public getPoint(i: number, out?: Point3d): Point3d | undefined {\r\n    return this.point.getPoint3dAtCheckedPointIndex(i, out);\r\n  }\r\n  /** return indexed normal. This is the COPY to the normal, not a reference. */\r\n  public getNormal(i: number): Vector3d | undefined { return this.normal ? this.normal.getVector3dAtCheckedVectorIndex(i) : undefined; }\r\n  /** return indexed param. This is the COPY of the coordinates, not a reference. */\r\n  public getParam(i: number): Point2d | undefined { return this.param ? this.param.getPoint2dAtCheckedPointIndex(i) : undefined; }\r\n  /** return indexed color */\r\n  public getColor(i: number): number { return this.color ? this.color[i] : 0; }\r\n  /** return indexed visibility */\r\n  public getEdgeVisible(i: number): boolean { return this.edgeVisible[i]; }\r\n  /** Copy the contents (not pointer) of point[i] into dest. */\r\n  public copyPointTo(i: number, dest: Point3d): void { this.point.getPoint3dAtUncheckedPointIndex(i, dest); }\r\n  /** Copy the contents (not pointer) of normal[i] into dest. */\r\n  public copyNormalTo(i: number, dest: Vector3d): void { if (this.normal) this.normal.getVector3dAtCheckedVectorIndex(i, dest); }\r\n  /** Copy the contents (not pointer) of param[i] into dest. */\r\n  public copyParamTo(i: number, dest: Point2d): void { if (this.param) this.param.getPoint2dAtCheckedPointIndex(i, dest); }\r\n  /** test if normal at a specified index matches uv */\r\n  public isAlmostEqualParamIndexUV(index: number, u: number, v: number): boolean {\r\n    if (this.param !== undefined && index >= 0 && index < this.param.length)\r\n      return Geometry.isSameCoordinate(u, this.param.getXAtUncheckedPointIndex(index))\r\n        && Geometry.isSameCoordinate(v, this.param.getYAtUncheckedPointIndex(index));\r\n    return false;\r\n  }\r\n  /**\r\n   * * Copy data from other to this.\r\n   * * This is the essence of transferring coordinates spread throughout a large polyface into a visitor's single facet.\r\n   * * \"other\" is the large polyface\r\n   * * \"this\" is the visitor\r\n   * * does NOT copy face data - visitors reference the FacetFaceData array for the whole polyface!!\r\n   * @param other polyface data being mined.\r\n   * @param index0 start index in other's index arrays\r\n   * @param index1 end index (one beyond last data accessed0 in other's index arrays\r\n   * @param numWrap number of points to replicate as wraparound.\r\n   */\r\n  public gatherIndexedData(other: PolyfaceData, index0: number, index1: number, numWrap: number) {\r\n    const numEdge = index1 - index0;\r\n    const numTotal = numEdge + numWrap;\r\n    this.resizeAllDataArrays(numTotal);\r\n    // copy wrapped points\r\n    for (let i = 0; i < numEdge; i++)\r\n      this.point.transferFromGrowableXYZArray(i, other.point, other.pointIndex[index0 + i]);\r\n    for (let i = 0; i < numWrap; i++)\r\n      this.point.transferFromGrowableXYZArray(numEdge + i, this.point, i);\r\n\r\n    // copy wrapped pointIndex\r\n    for (let i = 0; i < numEdge; i++)\r\n      this.pointIndex[i] = other.pointIndex[index0 + i];\r\n    for (let i = 0; i < numWrap; i++)\r\n      this.pointIndex[numEdge + i] = this.pointIndex[i];\r\n    // copy wrapped edge visibility\r\n    for (let i = 0; i < numEdge; i++)\r\n      this.edgeVisible[i] = other.edgeVisible[index0 + i];\r\n    for (let i = 0; i < numWrap; i++)\r\n      this.edgeVisible[numEdge + i] = this.edgeVisible[i];\r\n\r\n    if (this.normal && this.normalIndex && other.normal && other.normalIndex) {\r\n      for (let i = 0; i < numEdge; i++)\r\n        this.normal.transferFromGrowableXYZArray(i, other.normal, other.normalIndex[index0 + i]);\r\n      for (let i = 0; i < numWrap; i++)\r\n        this.normal.transferFromGrowableXYZArray(numEdge + i, this.normal, i);\r\n\r\n      for (let i = 0; i < numEdge; i++)\r\n        this.normalIndex[i] = other.normalIndex[index0 + i];\r\n      for (let i = 0; i < numWrap; i++)\r\n        this.normalIndex[numEdge + i] = this.normalIndex[i];\r\n    }\r\n\r\n    if (this.param && this.paramIndex && other.param && other.paramIndex) {\r\n      for (let i = 0; i < numEdge; i++)\r\n        this.param.transferFromGrowableXYArray(i, other.param, other.paramIndex[index0 + i]);\r\n      for (let i = 0; i < numWrap; i++)\r\n        this.param.transferFromGrowableXYArray(numEdge + i, this.param, i);\r\n\r\n      for (let i = 0; i < numEdge; i++)\r\n        this.paramIndex[i] = other.paramIndex[index0 + i];\r\n      for (let i = 0; i < numWrap; i++)\r\n        this.paramIndex[numEdge + i] = this.paramIndex[i];\r\n    }\r\n\r\n    if (this.color && this.colorIndex && other.color && other.colorIndex) {\r\n      for (let i = 0; i < numEdge; i++)\r\n        this.color[i] = other.color[other.colorIndex[index0 + i]];\r\n      for (let i = 0; i < numWrap; i++)\r\n        this.color[numEdge + i] = this.color[i];\r\n\r\n      for (let i = 0; i < numEdge; i++)\r\n        this.colorIndex[i] = other.colorIndex[index0 + i];\r\n      for (let i = 0; i < numWrap; i++)\r\n        this.colorIndex[numEdge + i] = this.colorIndex[i];\r\n    }\r\n    if (this.auxData && other.auxData && this.auxData.channels.length === other.auxData.channels.length) {\r\n      for (let iChannel = 0; iChannel < this.auxData.channels.length; iChannel++) {\r\n        const thisChannel = this.auxData.channels[iChannel];\r\n        const otherChannel = other.auxData.channels[iChannel];\r\n        const blockSize = thisChannel.entriesPerValue;\r\n        if (thisChannel.data.length === otherChannel.data.length) {\r\n          for (let iData = 0; iData < thisChannel.data.length; iData++) {\r\n            const thisData = thisChannel.data[iData];\r\n            const otherData = otherChannel.data[iData];\r\n            for (let i = 0; i < numEdge; i++)\r\n              thisData.copyValues(otherData, i, other.auxData.indices[index0 + i], blockSize);\r\n            for (let i = 0; i < numWrap; i++)\r\n              thisData.copyValues(thisData, other.auxData.indices[numEdge + i], i, blockSize);\r\n          }\r\n        }\r\n      }\r\n      for (let i = 0; i < numEdge; i++)\r\n        this.auxData.indices[i] = other.auxData.indices[index0 + i];\r\n      for (let i = 0; i < numWrap; i++)\r\n        this.auxData.indices[numEdge + i] = this.auxData.indices[i];\r\n    }\r\n  }\r\n  private static trimArray(data: any[] | undefined, length: number) { if (data && length < data.length) data.length = length; }\r\n  /** Trim all index arrays to stated length.\r\n   * * This is called by PolyfaceBuilder to clean up after an aborted construction sequence.\r\n   */\r\n  public trimAllIndexArrays(length: number): void {\r\n    PolyfaceData.trimArray(this.pointIndex, length);\r\n    PolyfaceData.trimArray(this.paramIndex, length);\r\n    PolyfaceData.trimArray(this.normalIndex, length);\r\n    PolyfaceData.trimArray(this.colorIndex, length);\r\n    PolyfaceData.trimArray(this.edgeVisible, length);\r\n    if (this.auxData) {\r\n      PolyfaceData.trimArray(this.auxData.indices, length);\r\n      for (const channel of this.auxData.channels) {\r\n        for (const data of channel.data)\r\n          PolyfaceData.trimArray(data.values, channel.entriesPerValue * length);\r\n      }\r\n    }\r\n  }\r\n  /** Resize all data arrays to specified length */\r\n  public resizeAllDataArrays(length: number): void {\r\n    if (length > this.point.length) {\r\n      while (this.point.length < length) this.point.push(Point3d.create());\r\n      while (this.pointIndex.length < length) this.pointIndex.push(-1);\r\n      while (this.edgeVisible.length < length) this.edgeVisible.push(false);\r\n      if (this.normal)\r\n        while (this.normal.length < length) this.normal.push(Vector3d.create());\r\n      if (this.param)\r\n        while (this.param.length < length) this.param.push(Point2d.create());\r\n      if (this.color)\r\n        while (this.color.length < length) this.color.push(0);\r\n      if (this.auxData) {\r\n        for (const channel of this.auxData.channels) {\r\n          for (const channelData of channel.data) {\r\n            while (channelData.values.length < length * channel.entriesPerValue) channelData.values.push(0);\r\n          }\r\n        }\r\n      }\r\n    } else if (length < this.point.length) {\r\n      this.point.resize(length);\r\n      this.edgeVisible.length = length;\r\n      this.pointIndex.length = length;\r\n      if (this.normal) this.normal.resize(length);\r\n      if (this.param) this.param.resize(length);\r\n      if (this.color) this.color.length = length;\r\n      if (this.auxData) {\r\n        for (const channel of this.auxData.channels) {\r\n          for (const channelData of channel.data) {\r\n            channelData.values.length = length * channel.entriesPerValue;\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Return the range of the point array (optionally transformed) */\r\n  public range(result?: Range3d, transform?: Transform): Range3d {\r\n    result = result ? result : Range3d.createNull();\r\n    result.extendArray(this.point, transform);\r\n    return result;\r\n  }\r\n  /** reverse indices facet-by-facet, with the given facetStartIndex array delimiting faces.\r\n   *\r\n   * * facetStartIndex[0] == 0 always -- start of facet zero.\r\n   * * facet k has indices from facetStartIndex[k] <= i < facetStartIndex[k+1]\r\n   * * hence for \"internal\" k, facetStartIndex[k] is both the upper limit of facet k-1 and the start of facet k.\r\n   * *\r\n   */\r\n  public reverseIndices(facetStartIndex?: number[]) {\r\n    if (facetStartIndex && PolyfaceData.isValidFacetStartIndexArray(facetStartIndex)) {\r\n      PolyfaceData.reverseIndices(facetStartIndex, this.pointIndex, true);\r\n      if (this.normalIndex !== this.pointIndex)\r\n        PolyfaceData.reverseIndices(facetStartIndex, this.normalIndex, true);\r\n      if (this.paramIndex !== this.pointIndex)\r\n        PolyfaceData.reverseIndices(facetStartIndex, this.paramIndex, true);\r\n      if (this.colorIndex !== this.pointIndex)\r\n        PolyfaceData.reverseIndices(facetStartIndex, this.colorIndex, true);\r\n      PolyfaceData.reverseIndices(facetStartIndex, this.edgeVisible, false);\r\n    }\r\n  }\r\n  /** reverse indices facet-by-facet, with the given facetStartIndex array delimiting faces.\r\n   *\r\n   * * facetStartIndex[0] == 0 always -- start of facet zero.\r\n   * * facet k has indices from facetStartIndex[k] <= i < facetStartIndex[k+1]\r\n   * * hence for \"internal\" k, facetStartIndex[k] is both the upper limit of facet k-1 and the start of facet k.\r\n   * *\r\n   */\r\n  public reverseIndicesSingleFacet(facetId: number, facetStartIndex: number[]) {\r\n    PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.pointIndex, true);\r\n    if (this.normalIndex !== this.pointIndex)\r\n      PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.normalIndex, true);\r\n    if (this.paramIndex !== this.pointIndex)\r\n      PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.paramIndex, true);\r\n    if (this.colorIndex !== this.pointIndex)\r\n      PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.colorIndex, true);\r\n    PolyfaceData.reverseIndicesSingleFacet(facetId, facetStartIndex, this.edgeVisible, false);\r\n  }\r\n\r\n  /** Scale all the normals by -1 */\r\n  public reverseNormals() {\r\n    if (this.normal)\r\n      this.normal.scaleInPlace(-1.0);\r\n  }\r\n  /** Apply `transform` to point and normal arrays and to auxData.\r\n   * * IMPORTANT This base class is just a data carrier.  It does not know if the index order and normal directions have special meaning.\r\n   * * i.e. caller must separately reverse index order and normal direction if needed.\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    this.point.multiplyTransformInPlace(transform);\r\n\r\n    if (this.normal && !transform.matrix.isIdentity)\r\n      this.normal.multiplyAndRenormalizeMatrix3dInverseTransposeInPlace(transform.matrix);\r\n\r\n    return undefined === this.auxData || this.auxData.tryTransformInPlace(transform);\r\n  }\r\n  /**\r\n   * * Search for duplication of coordinates within points, normals, and params.\r\n   * * compress the coordinate arrays.\r\n   * * revise all indexing for the relocated coordinates\r\n   */\r\n  public compress() {\r\n    const packedPoints = ClusterableArray.clusterGrowablePoint3dArray(this.point);\r\n    this.point = packedPoints.growablePackedPoints!;\r\n    packedPoints.updateIndices(this.pointIndex);\r\n    //  compressUnusedGrowableXYZArray(this.point, this.pointIndex);\r\n\r\n    if (this.normalIndex && this.normal) {\r\n      const packedNormals = ClusterableArray.clusterGrowablePoint3dArray(this.normal);\r\n      this.normal = packedNormals.growablePackedPoints!;\r\n      packedNormals.updateIndices(this.normalIndex);\r\n    }\r\n\r\n    if (this.paramIndex && this.param) {\r\n      const packedParams = ClusterableArray.clusterGrowablePoint2dArray(this.param);\r\n      this.param = packedParams.growablePackedPoints;\r\n      packedParams.updateIndices(this.paramIndex);\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Test if facetStartIndex is (minimally!) valid:\r\n   * * length must be nonzero (recall that for \"no facets\" the facetStartIndexArray still must contain a 0)\r\n   * * Each entry must be strictly smaller than the one that follows.\r\n   * @param facetStartIndex array of facetStart data.  facet `i` has indices at `facetsStartIndex[i]` to (one before) `facetStartIndex[i+1]`\r\n   */\r\n  public static isValidFacetStartIndexArray(facetStartIndex: number[]): boolean {\r\n    // facetStartIndex for empty facets has a single entry \"0\" -- empty array is not allowed\r\n    if (facetStartIndex.length === 0)\r\n      return false;\r\n    for (let i = 0; i + 1 < facetStartIndex.length; i++)\r\n      if (facetStartIndex[i] >= facetStartIndex[i + 1])\r\n        return false;\r\n    return true;\r\n  }\r\n  /** Reverse data in entire facet indexing arrays.\r\n   * * parameterized over type T so non-number data -- e.g. boolean visibility flags -- can be reversed.\r\n   */\r\n  public static reverseIndices<T>(facetStartIndex: number[], indices: T[] | undefined, preserveStart: boolean): boolean {\r\n    if (!indices || indices.length === 0)\r\n      return true;  // empty case\r\n    if (indices.length > 0) {\r\n      if (facetStartIndex[facetStartIndex.length - 1] === indices.length) {\r\n        for (let i = 0; i + 1 < facetStartIndex.length; i++) {\r\n          let index0 = facetStartIndex[i];\r\n          let index1 = facetStartIndex[i + 1];\r\n          if (preserveStart) {\r\n            // leave [index0] as is so reversed facet starts at same vertex\r\n            while (index1 > index0 + 2) {\r\n              index1--; index0++;\r\n              const a = indices[index0];\r\n              indices[index0] = indices[index1];\r\n              indices[index1] = a;\r\n            }\r\n          } else {\r\n            // reverse all\r\n            while (index1 > index0 + 1) {\r\n              index1--;\r\n              const a = indices[index0];\r\n              indices[index0] = indices[index1];\r\n              indices[index1] = a;\r\n              index0++;\r\n            }\r\n          }\r\n        }\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n\r\n  /** Reverse data in entire facet indexing arrays.\r\n   * * parameterized over type T so non-number data -- e.g. boolean visibility flags -- can be reversed.\r\n   */\r\n  public static reverseIndicesSingleFacet<T>(facetId: number, facetStartIndex: number[], indices: T[] | undefined, preserveStart: boolean): boolean {\r\n    if (!indices || indices.length === 0)\r\n      return true;  // empty case\r\n    if (indices.length > 0) {\r\n      if (facetStartIndex[facetStartIndex.length - 1] === indices.length\r\n        && facetId >= 0 && facetId + 1 < facetStartIndex.length) {\r\n        let index0 = facetStartIndex[facetId];\r\n        let index1 = facetStartIndex[facetId + 1];\r\n        if (preserveStart) {\r\n          // leave [index0] as is so reversed facet starts at same vertex\r\n          while (index1 > index0 + 2) {\r\n            index1--; index0++;\r\n            const a = indices[index0];\r\n            indices[index0] = indices[index1];\r\n            indices[index1] = a;\r\n          }\r\n        } else {\r\n          // reverse all\r\n          while (index1 > index0 + 1) {\r\n            index1--;\r\n            const a = indices[index0];\r\n            indices[index0] = indices[index1];\r\n            indices[index1] = a;\r\n            index0++;\r\n          }\r\n        }\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n}\r\n\r\n/**\r\n * pack out data entries that are unreferenced.\r\n * @param data data to pack\r\n * @param indices indices into the data.\r\n\r\nfunction compressUnusedGrowableXYZArray(data: GrowableXYZArray, indices: number[]): boolean {\r\n  // 1 entry per data[i]\r\n  // pass 0: number of references\r\n  // pass 1: post-compression index (or -1)\r\n  const n0 = data.length;\r\n  const work = new Int32Array(data.length);\r\n  for (const k of indices) {\r\n    if (k < 0 || k >= n0)\r\n      return false;\r\n    work[k]++;\r\n  }\r\n  let n1 = 0;\r\n  for (let i = 0; i < n0; i++) {\r\n    if (work[i] === 0)\r\n      work[i] = -1;\r\n    else\r\n      work[i] = n1++;\r\n  }\r\n  const numIndex = indices.length;\r\n  for (let i = 0; i < numIndex; i++) {\r\n    indices[i] = work[indices[i]];\r\n  }\r\n  for (let i = 0; i < n0; i++) {\r\n    const j = work[i];\r\n    if (j >= 0)\r\n      data.moveIndexToIndex(i, j);\r\n  }\r\n  data.length = n1;\r\n  return true;\r\n}\r\n*/\r\n"]}