@itwin/core-geometry 5.0.0-dev.9 → 5.0.0-dev.92

package/lib/esm/polyface/IndexedEdgeMatcher.js

@@ -10,30 +10,48 @@
  * * Fixed entry positions are:
  *   * [0] is start vertex index (in CCW order around its facet)
  *   * [1] is end vertex index (in CCW order around its facet)
- *   * [2] is facet index.
+ *   * [2] is facet index (or another number to associate with this edge).
  */
 export class SortableEdge extends Float64Array {
     /** Return the vertex index that appears first in the order stored.  */
-    get vertexIndexA() { return this[0]; }
+    get vertexIndexA() {
+        return this[0];
+    }
     /** Return the vertex index that appears second in the order stored.  */
-    get vertexIndexB() { return this[1]; }
-    /** Return the facet index.  */
-    get facetIndex() { return this[2]; }
-    /** return true if vertexIndexA is less than vertexIndexB */
-    get isLowHigh() { return this[0] < this[1]; }
-    /** Return the vertex index with lower numeric value */
-    get lowVertexIndex() { return this[0] < this[1] ? this[0] : this[1]; }
-    /** Return the vertex index with higher numeric value */
-    get highVertexIndex() { return this[0] > this[1] ? this[0] : this[1]; }
-    /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order */
-    static areDirectedPartners(edgeA, edgeB) { return edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]; }
-    /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order */
+    get vertexIndexB() {
+        return this[1];
+    }
+    /**
+     * Return the facet index.
+     * * This value is carried along during matching. Typically it is a facet index, but it does not have to be.
+     */
+    get facetIndex() {
+        return this[2];
+    }
+    /** return true if vertexIndexA is less than vertexIndexB. */
+    get isLowHigh() {
+        return this[0] < this[1];
+    }
+    /** Return the vertex index with lower numeric value. */
+    get lowVertexIndex() {
+        return this[0] < this[1] ? this[0] : this[1];
+    }
+    /** Return the vertex index with higher numeric value. */
+    get highVertexIndex() {
+        return this[0] > this[1] ? this[0] : this[1];
+    }
+    /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order. */
+    static areDirectedPartners(edgeA, edgeB) {
+        return edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0];
+    }
+    /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order. */
     static areUndirectedPartners(edgeA, edgeB) {
         return (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) || ((edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]));
     }
-    /** Return numeric relationship of edgeA and edgeB:
-     * * 1 if they share start and end in the same order
-     * * -1 if they share start and end in reversed order
+    /**
+     * Return numeric relationship of edgeA and edgeB:
+     * * 1 if they share start and end in the same order.
+     * * -1 if they share start and end in reversed order.
      * * 0 otherwise.
      */
     static relativeOrientation(edgeA, edgeB) {
@@ -43,10 +61,12 @@ export class SortableEdge extends Float64Array {
             return -1;
         return 0;
     }
-    get isNullEdge() { return this[0] === this[1]; }
+    get isNullEdge() {
+        return this[0] === this[1];
+    }
     /**
-     * lexical comparison of two edges.
-     * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort
+     * Lexical comparison of two edges.
+     * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort.
      * * If the edges have 0 or 1 shared vertex indices, the one with lowest low comes first.
      * @param edgeA first edge
      * @param edgeB second edge
@@ -74,7 +94,9 @@ export class SortableEdge extends Float64Array {
         this[1] = vertexB;
         this[2] = facetIndex;
     }
-    toJSON() { return [this[0], this[1], this[2]]; }
+    toJSON() {
+        return [this[0], this[1], this[2]];
+    }
     static clusterToJSON(data) {
         if (data instanceof SortableEdge)
             return data.toJSON();
@@ -90,18 +112,20 @@ export class SortableEdge extends Float64Array {
     }
 }
 /**
- * An IndexedEdgeMatcher carries an array (`edges`) of edges start & end indices for sorting and subsequent analyses (such as testing for closed mesh)
+ * An IndexedEdgeMatcher carries an array of edge start & end indices for sorting and subsequent analyses
+ * (such as testing for closed mesh).
  */
 export class IndexedEdgeMatcher {
+    edges;
     constructor() {
         this.edges = [];
     }
     /**
-     * push a new edge.
-     * @returns the edge (as emplaced at the back of the sortableEdge array)
+     * Push a new edge.
      * @param vertexA start vertex
      * @param vertexB end vertex
-     * @param facetIndex facet index
+     * @param facetIndex value to carry along during matching
+     * @returns the edge pushed onto the `edges` array
      */
     addEdge(vertexA, vertexB, facetIndex) {
         const edge = new SortableEdge(vertexA, vertexB, facetIndex);
@@ -109,9 +133,10 @@ export class IndexedEdgeMatcher {
         return edge;
     }
     /**
-     * Push edges all around a facet, returning to vertexArray[0]
+     * Push edges all around a facet, returning to vertexArray[0].
      * @param vertexArray array of vertex indices around facet
-     * @param facetIndex
+     * @param facetIndex value to carry along during matching
+     * @param closeLoop true to add an edge from last to first vertex.
      */
     addPath(vertexArray, facetIndex, closeLoop = true) {
         if (vertexArray.length === 0)
@@ -142,16 +167,20 @@ export class IndexedEdgeMatcher {
         }
     }
     /**
-     * sort the edges, and look for three categories of paired edges:
+     * Sort the edges, and look for three categories of paired edges:
      * * caller must allocate all result arrays of interest.
      * * Any combination of the result arrays may be `undefined`, indicating that category is to be ignored.
-     * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are merged into the target.
-     * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array `allOther`, create `const allOther = []` as an empty array and call
+     * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are
+     * merged into the target.
+     * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array
+     * `allOther`, create `const allOther = []` as an empty array and call
      * `sortAndCollectClusters (undefined, allOther, allOther, allOther);`
-     * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior edges adjacent to two facets in opposing directions.
+     * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior
+     * edges adjacent to two facets in opposing directions.
      * @param singletons optional array to receive edges that are simple boundary edges.
      * @param nullEdges optional array to receive arrays of null edges (same start and end vertex)
-     * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense but not a simple directed pair.
+     * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense
+     * but not a simple directed pair.
      */
     sortAndCollectClusters(manifoldPairs, singletons, nullEdges, allOtherClusters) {
         this.sort();
@@ -168,7 +197,8 @@ export class IndexedEdgeMatcher {
         for (let index0 = 0; index0 < n; index0 += clusterLength) {
             const baseEdge = this.edges[index0];
             clusterLength = 1;
-            for (let index1 = index0 + 1; index1 < n && SortableEdge.areUndirectedPartners(baseEdge, this.edges[index1]); index1++) {
+            for (let index1 = index0 + 1; index1 < n &&
+                SortableEdge.areUndirectedPartners(baseEdge, this.edges[index1]); index1++) {
                 clusterLength++;
             }
             if (this.edges[index0].isNullEdge) {

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

@@ -1 +1 @@
-{"version":3,"file":"IndexedEdgeMatcher.js","sourceRoot":"","sources":["../../../src/polyface/IndexedEdgeMatcher.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH;;;;;;GAMG;AACH,MAAM,OAAO,YAAa,SAAQ,YAAY;IAC5C,uEAAuE;IACvE,IAAW,YAAY,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,wEAAwE;IACxE,IAAW,YAAY,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,+BAA+B;IAC/B,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,4DAA4D;IAC5D,IAAW,SAAS,KAAc,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,uDAAuD;IACvD,IAAW,cAAc,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrF,wDAAwD;IACxD,IAAW,eAAe,KAAa,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,gGAAgG;IACzF,MAAM,CAAC,mBAAmB,CAAC,KAAmB,EAAE,KAAmB,IAAa,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/I,6GAA6G;IACtG,MAAM,CAAC,qBAAqB,CAAC,KAAmB,EAAE,KAAmB;QAC1E,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChH,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,KAAmB,EAAE,KAAmB;QACxE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QAC7D,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAC9D,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAW,UAAU,KAAc,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE;;;;;;OAMG;IACI,MAAM,CAAC,QAAQ,CAAC,KAAmB,EAAE,KAAmB;QAC7D,+CAA+C;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,IAAI,IAAI,GAAG,IAAI;YACb,OAAO,CAAC,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,IAAI;YACb,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,IAAI,KAAK,GAAG,KAAK;YACf,OAAO,CAAC,CAAC,CAAC;QACZ,IAAI,KAAK,GAAG,KAAK;YACf,OAAO,CAAC,CAAC;QACX,yDAAyD;QACzD,OAAO,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;IACjD,CAAC;IACD,YAAmB,OAAe,EAAE,OAAe,EAAE,UAAkB;QACrE,KAAK,CAAC,CAAC,CAAC,CAAC;QACT,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACvB,CAAC;IACM,MAAM,KAAU,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,CAAC,aAAa,CAAC,IAAyB;QACnD,IAAI,IAAI,YAAY,YAAY;YAC9B,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;QAEvB,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACtD,CAAC;IACM,MAAM,CAAC,kBAAkB,CAAC,IAA2B;QAC1D,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,OAAO,IAAI,IAAI;YACxB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;QACnD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAGD;;GAEG;AACH,MAAM,OAAO,kBAAkB;IAG7B;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IACD;;;;;;OAMG;IACI,OAAO,CAAC,OAAe,EAAE,OAAe,EAAE,UAAkB;QACjE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,OAAO,CAAC,WAAqB,EAAE,UAAkB,EAAE,YAAqB,IAAI;QACjF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACrC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,SAAS;YACX,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC7D,CAAC;IACD,iCAAiC;IAC1B,IAAI;QACT,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IACzE,CAAC;IACD,+DAA+D;IACvD,0BAA0B,CAAC,MAAc,EAAE,MAAc,EAAE,IAAuC;QACxG,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,EAAE,CAAC;YAC1C,IAAI,MAAM,KAAK,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GAAG,EAAE,CAAC;gBACnB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;oBAClC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,CAAC;QAEH,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,sBAAsB,CAAC,aAAgD,EAAE,UAAkC,EAAE,SAAiC,EAAE,gBAAwC;QAC7L,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,aAAa;YAAE,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5C,IAAI,UAAU;YAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,IAAI,SAAS;YAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACpC,IAAI,gBAAgB;YAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5B,IAAI,aAAa,CAAC;QAClB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,aAAa,EAAE,CAAC;YACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACpC,aAAa,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;gBACvH,aAAa,EAAE,CAAC;YAClB,CAAC;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,CAAC;gBAClC,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,SAAS,CAAC,CAAC;YAC7E,CAAC;iBAAM,IAAI,aAAa,KAAK,CAAC,IAAI,YAAY,CAAC,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,aAAa,CAAC,CAAC;YACjF,CAAC;iBAAM,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;YAClE,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,gBAAgB,CAAC,CAAC;YACpF,CAAC;QACH,CAAC;IACH,CAAC;CACF","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\n/**\r\n * * For boundary sorting, an edge is a (packed!) Float64Array.\r\n * * Fixed entry positions are:\r\n *   * [0] is start vertex index (in CCW order around its facet)\r\n *   * [1] is end vertex index (in CCW order around its facet)\r\n *   * [2] is facet index.\r\n */\r\nexport class SortableEdge extends Float64Array {\r\n  /** Return the vertex index that appears first in the order stored.  */\r\n  public get vertexIndexA(): number { return this[0]; }\r\n  /** Return the vertex index that appears second in the order stored.  */\r\n  public get vertexIndexB(): number { return this[1]; }\r\n  /** Return the facet index.  */\r\n  public get facetIndex(): number { return this[2]; }\r\n  /** return true if vertexIndexA is less than vertexIndexB */\r\n  public get isLowHigh(): boolean { return this[0] < this[1]; }\r\n  /** Return the vertex index with lower numeric value */\r\n  public get lowVertexIndex(): number { return this[0] < this[1] ? this[0] : this[1]; }\r\n  /** Return the vertex index with higher numeric value */\r\n  public get highVertexIndex(): number { return this[0] > this[1] ? this[0] : this[1]; }\r\n  /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order */\r\n  public static areDirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean { return edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]; }\r\n  /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order */\r\n  public static areUndirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean {\r\n    return (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) || ((edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]));\r\n  }\r\n  /** Return numeric relationship of edgeA and edgeB:\r\n   * * 1 if they share start and end in the same order\r\n   * * -1 if they share start and end in reversed order\r\n   * * 0 otherwise.\r\n   */\r\n  public static relativeOrientation(edgeA: SortableEdge, edgeB: SortableEdge): number {\r\n    if (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) return 1;\r\n    if (edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]) return -1;\r\n    return 0;\r\n  }\r\n\r\n  public get isNullEdge(): boolean { return this[0] === this[1]; }\r\n  /**\r\n   * lexical comparison of two edges.\r\n   * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort\r\n   * * If the edges have 0 or 1 shared vertex indices, the one with lowest low comes first.\r\n   * @param edgeA first edge\r\n   * @param edgeB second edge\r\n   */\r\n  public static lessThan(edgeA: SortableEdge, edgeB: SortableEdge): number {\r\n    // primary compare is based on indirect indices\r\n    const lowA = edgeA.lowVertexIndex;\r\n    const lowB = edgeB.lowVertexIndex;\r\n    if (lowA < lowB)\r\n      return -1;\r\n    if (lowB < lowA)\r\n      return 1;\r\n    const highA = edgeA.highVertexIndex;\r\n    const highB = edgeB.highVertexIndex;\r\n    if (highA < highB)\r\n      return -1;\r\n    if (highB < highA)\r\n      return 1;\r\n    // undirected indices match ... use directed vertexIndexA\r\n    return edgeA.vertexIndexA - edgeB.vertexIndexA;\r\n  }\r\n  public constructor(vertexA: number, vertexB: number, facetIndex: number) {\r\n    super(3);\r\n    this[0] = vertexA;\r\n    this[1] = vertexB;\r\n    this[2] = facetIndex;\r\n  }\r\n  public toJSON(): any { return [this[0], this[1], this[2]]; }\r\n  public static clusterToJSON(data: SortableEdgeCluster): any {\r\n    if (data instanceof SortableEdge)\r\n      return data.toJSON();\r\n\r\n    const result = [];\r\n    for (const edge of data) result.push(edge.toJSON());\r\n  }\r\n  public static clusterArrayToJSON(data: SortableEdgeCluster[]) {\r\n    const result = [];\r\n    for (const cluster of data)\r\n      result.push(SortableEdge.clusterToJSON(cluster));\r\n    return result;\r\n  }\r\n}\r\n\r\nexport type SortableEdgeCluster = SortableEdge | SortableEdge[];\r\n/**\r\n * An IndexedEdgeMatcher carries an array (`edges`) of edges start & end indices for sorting and subsequent analyses (such as testing for closed mesh)\r\n */\r\nexport class IndexedEdgeMatcher {\r\n  public edges: SortableEdge[];\r\n\r\n  constructor() {\r\n    this.edges = [];\r\n  }\r\n  /**\r\n   * push a new edge.\r\n   * @returns the edge (as emplaced at the back of the sortableEdge array)\r\n   * @param vertexA start vertex\r\n   * @param vertexB end vertex\r\n   * @param facetIndex facet index\r\n   */\r\n  public addEdge(vertexA: number, vertexB: number, facetIndex: number): SortableEdge {\r\n    const edge = new SortableEdge(vertexA, vertexB, facetIndex);\r\n    this.edges.push(edge);\r\n    return edge;\r\n  }\r\n  /**\r\n   * Push edges all around a facet, returning to vertexArray[0]\r\n   * @param vertexArray array of vertex indices around facet\r\n   * @param facetIndex\r\n   */\r\n  public addPath(vertexArray: number[], facetIndex: number, closeLoop: boolean = true) {\r\n    if (vertexArray.length === 0) return;\r\n    const m = vertexArray.length - 1;\r\n    for (let i = 0; i < m; i++) {\r\n      this.addEdge(vertexArray[i], vertexArray[i + 1], facetIndex);\r\n    }\r\n    if (closeLoop)\r\n      this.addEdge(vertexArray[m], vertexArray[0], facetIndex);\r\n  }\r\n  /** Sort the edge index array. */\r\n  public sort() {\r\n    this.edges.sort((edgeA, edgeB) => SortableEdge.lessThan(edgeA, edgeB));\r\n  }\r\n  /** Create a single or compound SortableEdgeCluster in dest. */\r\n  private collectSortableEdgeCluster(index0: number, index1: number, dest: SortableEdgeCluster[] | undefined) {\r\n    if (dest !== undefined && index1 > index0) {\r\n      if (index1 === index0 + 1) {\r\n        dest.push(this.edges[index0]);\r\n      } else {\r\n        const cluster = [];\r\n        for (let i = index0; i < index1; i++)\r\n          cluster.push(this.edges[i]);\r\n        dest.push(cluster);\r\n      }\r\n\r\n    }\r\n  }\r\n  /**\r\n   * sort the edges, and look for three categories of paired edges:\r\n   * * caller must allocate all result arrays of interest.\r\n   * * Any combination of the result arrays may be `undefined`, indicating that category is to be ignored.\r\n   * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are merged into the target.\r\n   * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array `allOther`, create `const allOther = []` as an empty array and call\r\n   * `sortAndCollectClusters (undefined, allOther, allOther, allOther);`\r\n   * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior edges adjacent to two facets in opposing directions.\r\n   * @param singletons optional array to receive edges that are simple boundary edges.\r\n   * @param nullEdges optional array to receive arrays of null edges (same start and end vertex)\r\n   * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense but not a simple directed pair.\r\n   */\r\n  public sortAndCollectClusters(manifoldPairs: SortableEdgeCluster[] | undefined, singletons?: SortableEdgeCluster[], nullEdges?: SortableEdgeCluster[], allOtherClusters?: SortableEdgeCluster[]) {\r\n    this.sort();\r\n    if (manifoldPairs) manifoldPairs.length = 0;\r\n    if (singletons) singletons.length = 0;\r\n    if (nullEdges) nullEdges.length = 0;\r\n    if (allOtherClusters) allOtherClusters.length = 0;\r\n    const n = this.edges.length;\r\n    let clusterLength;\r\n    for (let index0 = 0; index0 < n; index0 += clusterLength) {\r\n      const baseEdge = this.edges[index0];\r\n      clusterLength = 1;\r\n      for (let index1 = index0 + 1; index1 < n && SortableEdge.areUndirectedPartners(baseEdge, this.edges[index1]); index1++) {\r\n        clusterLength++;\r\n      }\r\n      if (this.edges[index0].isNullEdge) {\r\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, nullEdges);\r\n      } else if (clusterLength === 2 && SortableEdge.areDirectedPartners(baseEdge, this.edges[index0 + 1])) {\r\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, manifoldPairs);\r\n      } else if (clusterLength === 1) {\r\n        this.collectSortableEdgeCluster(index0, index0 + 1, singletons);\r\n      } else {\r\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, allOtherClusters);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"IndexedEdgeMatcher.js","sourceRoot":"","sources":["../../../src/polyface/IndexedEdgeMatcher.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH;;;;;;GAMG;AACH,MAAM,OAAO,YAAa,SAAQ,YAAY;IAC5C,uEAAuE;IACvE,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,wEAAwE;IACxE,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD;;;OAGG;IACH,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACjB,CAAC;IACD,6DAA6D;IAC7D,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,wDAAwD;IACxD,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,yDAAyD;IACzD,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,iGAAiG;IAC1F,MAAM,CAAC,mBAAmB,CAAC,KAAmB,EAAE,KAAmB;QACxE,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,8GAA8G;IACvG,MAAM,CAAC,qBAAqB,CAAC,KAAmB,EAAE,KAAmB;QAC1E,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,mBAAmB,CAAC,KAAmB,EAAE,KAAmB;QACxE,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;QAC7D,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAC9D,OAAO,CAAC,CAAC;IACX,CAAC;IAED,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,QAAQ,CAAC,KAAmB,EAAE,KAAmB;QAC7D,+CAA+C;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,MAAM,IAAI,GAAG,KAAK,CAAC,cAAc,CAAC;QAClC,IAAI,IAAI,GAAG,IAAI;YACb,OAAO,CAAC,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,IAAI;YACb,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,IAAI,KAAK,GAAG,KAAK;YACf,OAAO,CAAC,CAAC,CAAC;QACZ,IAAI,KAAK,GAAG,KAAK;YACf,OAAO,CAAC,CAAC;QACX,yDAAyD;QACzD,OAAO,KAAK,CAAC,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC;IACjD,CAAC;IACD,YAAmB,OAAe,EAAE,OAAe,EAAE,UAAkB;QACrE,KAAK,CAAC,CAAC,CAAC,CAAC;QACT,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;QAClB,IAAI,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACvB,CAAC;IACM,MAAM;QACX,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,CAAC;IACM,MAAM,CAAC,aAAa,CAAC,IAAyB;QACnD,IAAI,IAAI,YAAY,YAAY;YAC9B,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACtD,CAAC;IACM,MAAM,CAAC,kBAAkB,CAAC,IAA2B;QAC1D,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,MAAM,OAAO,IAAI,IAAI;YACxB,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC;QACnD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IACtB,KAAK,CAAiB;IAE7B;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IACD;;;;;;OAMG;IACI,OAAO,CAAC,OAAe,EAAE,OAAe,EAAE,UAAkB;QACjE,MAAM,IAAI,GAAG,IAAI,YAAY,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QAC5D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;OAKG;IACI,OAAO,CAAC,WAAqB,EAAE,UAAkB,EAAE,YAAqB,IAAI;QACjF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACrC,MAAM,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,SAAS;YACX,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC7D,CAAC;IACD,iCAAiC;IAC1B,IAAI;QACT,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;IACzE,CAAC;IACD,+DAA+D;IACvD,0BAA0B,CAAC,MAAc,EAAE,MAAc,EAAE,IAAuC;QACxG,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,EAAE,CAAC;YAC1C,IAAI,MAAM,KAAK,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YAChC,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GAAG,EAAE,CAAC;gBACnB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;oBAClC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,sBAAsB,CAC3B,aAAgD,EAChD,UAAkC,EAClC,SAAiC,EACjC,gBAAwC;QAExC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,aAAa;YAAE,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5C,IAAI,UAAU;YAAE,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACtC,IAAI,SAAS;YAAE,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QACpC,IAAI,gBAAgB;YAAE,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC5B,IAAI,aAAa,CAAC;QAClB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,IAAI,aAAa,EAAE,CAAC;YACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACpC,aAAa,GAAG,CAAC,CAAC;YAClB,KAAK,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC;gBACtC,YAAY,CAAC,qBAAqB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC;gBAC7E,aAAa,EAAE,CAAC;YAClB,CAAC;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,CAAC;gBAClC,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,SAAS,CAAC,CAAC;YAC7E,CAAC;iBAAM,IAAI,aAAa,KAAK,CAAC,IAAI,YAAY,CAAC,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,aAAa,CAAC,CAAC;YACjF,CAAC;iBAAM,IAAI,aAAa,KAAK,CAAC,EAAE,CAAC;gBAC/B,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;YAClE,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,gBAAgB,CAAC,CAAC;YACpF,CAAC;QACH,CAAC;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Polyface\n */\n\n/**\n * * For boundary sorting, an edge is a (packed!) Float64Array.\n * * Fixed entry positions are:\n *   * [0] is start vertex index (in CCW order around its facet)\n *   * [1] is end vertex index (in CCW order around its facet)\n *   * [2] is facet index (or another number to associate with this edge).\n */\nexport class SortableEdge extends Float64Array {\n  /** Return the vertex index that appears first in the order stored.  */\n  public get vertexIndexA(): number {\n    return this[0];\n  }\n  /** Return the vertex index that appears second in the order stored.  */\n  public get vertexIndexB(): number {\n    return this[1];\n  }\n  /**\n   * Return the facet index.\n   * * This value is carried along during matching. Typically it is a facet index, but it does not have to be.\n   */\n  public get facetIndex(): number {\n    return this[2];\n  }\n  /** return true if vertexIndexA is less than vertexIndexB. */\n  public get isLowHigh(): boolean {\n    return this[0] < this[1];\n  }\n  /** Return the vertex index with lower numeric value. */\n  public get lowVertexIndex(): number {\n    return this[0] < this[1] ? this[0] : this[1];\n  }\n  /** Return the vertex index with higher numeric value. */\n  public get highVertexIndex(): number {\n    return this[0] > this[1] ? this[0] : this[1];\n  }\n  /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order. */\n  public static areDirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean {\n    return edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0];\n  }\n  /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order. */\n  public static areUndirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean {\n    return (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) || ((edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]));\n  }\n  /**\n   * Return numeric relationship of edgeA and edgeB:\n   * * 1 if they share start and end in the same order.\n   * * -1 if they share start and end in reversed order.\n   * * 0 otherwise.\n   */\n  public static relativeOrientation(edgeA: SortableEdge, edgeB: SortableEdge): number {\n    if (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) return 1;\n    if (edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]) return -1;\n    return 0;\n  }\n\n  public get isNullEdge(): boolean {\n    return this[0] === this[1];\n  }\n  /**\n   * Lexical comparison of two edges.\n   * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort.\n   * * If the edges have 0 or 1 shared vertex indices, the one with lowest low comes first.\n   * @param edgeA first edge\n   * @param edgeB second edge\n   */\n  public static lessThan(edgeA: SortableEdge, edgeB: SortableEdge): number {\n    // primary compare is based on indirect indices\n    const lowA = edgeA.lowVertexIndex;\n    const lowB = edgeB.lowVertexIndex;\n    if (lowA < lowB)\n      return -1;\n    if (lowB < lowA)\n      return 1;\n    const highA = edgeA.highVertexIndex;\n    const highB = edgeB.highVertexIndex;\n    if (highA < highB)\n      return -1;\n    if (highB < highA)\n      return 1;\n    // undirected indices match ... use directed vertexIndexA\n    return edgeA.vertexIndexA - edgeB.vertexIndexA;\n  }\n  public constructor(vertexA: number, vertexB: number, facetIndex: number) {\n    super(3);\n    this[0] = vertexA;\n    this[1] = vertexB;\n    this[2] = facetIndex;\n  }\n  public toJSON(): any {\n    return [this[0], this[1], this[2]];\n  }\n  public static clusterToJSON(data: SortableEdgeCluster): any {\n    if (data instanceof SortableEdge)\n      return data.toJSON();\n    const result = [];\n    for (const edge of data) result.push(edge.toJSON());\n  }\n  public static clusterArrayToJSON(data: SortableEdgeCluster[]) {\n    const result = [];\n    for (const cluster of data)\n      result.push(SortableEdge.clusterToJSON(cluster));\n    return result;\n  }\n}\nexport type SortableEdgeCluster = SortableEdge | SortableEdge[];\n/**\n * An IndexedEdgeMatcher carries an array of edge start & end indices for sorting and subsequent analyses\n * (such as testing for closed mesh).\n */\nexport class IndexedEdgeMatcher {\n  public edges: SortableEdge[];\n\n  constructor() {\n    this.edges = [];\n  }\n  /**\n   * Push a new edge.\n   * @param vertexA start vertex\n   * @param vertexB end vertex\n   * @param facetIndex value to carry along during matching\n   * @returns the edge pushed onto the `edges` array\n   */\n  public addEdge(vertexA: number, vertexB: number, facetIndex: number): SortableEdge {\n    const edge = new SortableEdge(vertexA, vertexB, facetIndex);\n    this.edges.push(edge);\n    return edge;\n  }\n  /**\n   * Push edges all around a facet, returning to vertexArray[0].\n   * @param vertexArray array of vertex indices around facet\n   * @param facetIndex value to carry along during matching\n   * @param closeLoop true to add an edge from last to first vertex.\n   */\n  public addPath(vertexArray: number[], facetIndex: number, closeLoop: boolean = true) {\n    if (vertexArray.length === 0) return;\n    const m = vertexArray.length - 1;\n    for (let i = 0; i < m; i++) {\n      this.addEdge(vertexArray[i], vertexArray[i + 1], facetIndex);\n    }\n    if (closeLoop)\n      this.addEdge(vertexArray[m], vertexArray[0], facetIndex);\n  }\n  /** Sort the edge index array. */\n  public sort() {\n    this.edges.sort((edgeA, edgeB) => SortableEdge.lessThan(edgeA, edgeB));\n  }\n  /** Create a single or compound SortableEdgeCluster in dest. */\n  private collectSortableEdgeCluster(index0: number, index1: number, dest: SortableEdgeCluster[] | undefined) {\n    if (dest !== undefined && index1 > index0) {\n      if (index1 === index0 + 1) {\n        dest.push(this.edges[index0]);\n      } else {\n        const cluster = [];\n        for (let i = index0; i < index1; i++)\n          cluster.push(this.edges[i]);\n        dest.push(cluster);\n      }\n    }\n  }\n  /**\n   * Sort the edges, and look for three categories of paired edges:\n   * * caller must allocate all result arrays of interest.\n   * * Any combination of the result arrays may be `undefined`, indicating that category is to be ignored.\n   * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are\n   * merged into the target.\n   * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array\n   * `allOther`, create `const allOther = []` as an empty array and call\n   * `sortAndCollectClusters (undefined, allOther, allOther, allOther);`\n   * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior\n   * edges adjacent to two facets in opposing directions.\n   * @param singletons optional array to receive edges that are simple boundary edges.\n   * @param nullEdges optional array to receive arrays of null edges (same start and end vertex)\n   * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense\n   * but not a simple directed pair.\n   */\n  public sortAndCollectClusters(\n    manifoldPairs: SortableEdgeCluster[] | undefined,\n    singletons?: SortableEdgeCluster[],\n    nullEdges?: SortableEdgeCluster[],\n    allOtherClusters?: SortableEdgeCluster[],\n  ): void {\n    this.sort();\n    if (manifoldPairs) manifoldPairs.length = 0;\n    if (singletons) singletons.length = 0;\n    if (nullEdges) nullEdges.length = 0;\n    if (allOtherClusters) allOtherClusters.length = 0;\n    const n = this.edges.length;\n    let clusterLength;\n    for (let index0 = 0; index0 < n; index0 += clusterLength) {\n      const baseEdge = this.edges[index0];\n      clusterLength = 1;\n      for (let index1 = index0 + 1; index1 < n &&\n        SortableEdge.areUndirectedPartners(baseEdge, this.edges[index1]); index1++) {\n        clusterLength++;\n      }\n      if (this.edges[index0].isNullEdge) {\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, nullEdges);\n      } else if (clusterLength === 2 && SortableEdge.areDirectedPartners(baseEdge, this.edges[index0 + 1])) {\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, manifoldPairs);\n      } else if (clusterLength === 1) {\n        this.collectSortableEdgeCluster(index0, index0 + 1, singletons);\n      } else {\n        this.collectSortableEdgeCluster(index0, index0 + clusterLength, allOtherClusters);\n      }\n    }\n  }\n}\n"]}

package/lib/esm/polyface/IndexedPolyfaceVisitor.d.ts

@@ -52,7 +52,7 @@ export declare class IndexedPolyfaceVisitor extends PolyfaceData implements Poly
      * Returns the normalized parameter as a point. Returns `undefined` on failure.
      */
     tryGetNormalizedParameter(index: number, result?: Point2d): Point2d | undefined;
-    /** Return the index (in the client polyface) of the current facet. */
+    /** Return the facetIndex of the currently referenced facet in the client polyface. */
     currentReadIndex(): number;
     /** Return the point index of vertex `i` within the currently loaded facet. */
     clientPointIndex(i: number): number;
@@ -95,7 +95,8 @@ export declare class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor
     static createSubsetVisitor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap?: number): IndexedPolyfaceSubsetVisitor;
     /**
      * Advance the iterator to a particular facet in the subset of client polyface facets.
-     * @param activeIndex the index of the facet within the subset, not to be confused with the index of the facet within the client polyface.
+     * @param activeIndex the index of the facet within the subset, not to be confused with the index of the facet within
+     * the client polyface.
      * @return whether the iterator was successfully moved.
      */
     moveToReadIndex(activeIndex: number): boolean;

package/lib/esm/polyface/IndexedPolyfaceVisitor.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"IndexedPolyfaceVisitor.d.ts","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceVisitor.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAEzD,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,qBAAa,sBAAuB,SAAQ,YAAa,YAAW,eAAe;IACjF,OAAO,CAAC,kBAAkB,CAAS;IACnC,OAAO,CAAC,eAAe,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAkB;IAEnC,SAAS,aAAa,QAAQ,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM;IAYhE,yCAAyC;IAClC,cAAc,IAAI,eAAe;IAGxC,iEAAiE;IAC1D,sBAAsB,IAAI,MAAM;IAGvC;;;;;;;;OAQG;IACI,UAAU,CAAC,OAAO,EAAE,MAAM;IAGjC;;;OAGG;IACH,IAAW,iBAAiB,IAAI,MAAM,CAErC;IACD,+DAA+D;WACjD,MAAM,CAAC,QAAQ,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,GAAG,sBAAsB;IAGxF,yEAAyE;IAClE,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAenD,yEAAyE;IAClE,eAAe,IAAI,OAAO;IAMjC,sEAAsE;IAC/D,KAAK,IAAI,IAAI;IAIpB;;;OAGG;IACI,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAcpF;;;OAGG;IACI,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IActF,sEAAsE;IAC/D,gBAAgB,IAAI,MAAM;IAGjC,8EAA8E;IACvE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAG1C,8EAA8E;IACvE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAG1C,+EAA+E;IACxE,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAG3C,8EAA8E;IACvE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAG1C,iFAAiF;IAC1E,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAGxC,wCAAwC;IACjC,WAAW,IAAI,IAAI;IAW1B,iGAAiG;IAC1F,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAWhE;;;OAGG;IACI,wBAAwB,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAchH;AACD;;;;;GAKG;AACH,qBAAa,4BAA6B,SAAQ,sBAAsB;IACtE,OAAO,CAAC,mBAAmB,CAAC,CAAW;IACvC,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,gBAAgB,CAAS;IAEjC,OAAO;IAMP,OAAO,CAAC,kBAAkB;IAG1B;;;;;OAKG;WACW,mBAAmB,CAAC,QAAQ,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,EAAE,EAAE,OAAO,GAAE,MAAU,GAAG,4BAA4B;IAG7I;;;;OAIG;IACa,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAQ7D;;;OAGG;IACa,eAAe,IAAI,OAAO;IAM1C,qGAAqG;IACrF,KAAK,IAAI,IAAI;IAI7B;;;;OAIG;IACI,gBAAgB,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAKjE,iEAAiE;IACjD,sBAAsB,IAAI,MAAM;IAGhD;;;;;;;;;;;;MAYE;WACY,sBAAsB,CAAC,IAAI,EAAE,eAAe,GAAG,sBAAsB,EAAE,aAAa,GAAE,QAA2B,EAAE,SAAS,GAAE,KAAgC,EAAE,OAAO,GAAE,MAAU,GAAG,4BAA4B;CAiBjO"}
+{"version":3,"file":"IndexedPolyfaceVisitor.d.ts","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceVisitor.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAEzD,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,qBAAa,sBAAuB,SAAQ,YAAa,YAAW,eAAe;IACjF,OAAO,CAAC,kBAAkB,CAAS;IACnC,OAAO,CAAC,eAAe,CAAS;IAChC,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAkB;IAEnC,SAAS,aAAa,QAAQ,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM;IAYhE,yCAAyC;IAClC,cAAc,IAAI,eAAe;IAGxC,iEAAiE;IAC1D,sBAAsB,IAAI,MAAM;IAGvC;;;;;;;;OAQG;IACI,UAAU,CAAC,OAAO,EAAE,MAAM;IAGjC;;;OAGG;IACH,IAAW,iBAAiB,IAAI,MAAM,CAErC;IACD,+DAA+D;WACjD,MAAM,CAAC,QAAQ,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,GAAG,sBAAsB;IAGxF,yEAAyE;IAClE,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAenD,yEAAyE;IAClE,eAAe,IAAI,OAAO;IAMjC,sEAAsE;IAC/D,KAAK,IAAI,IAAI;IAIpB;;;OAGG;IACI,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAcpF;;;OAGG;IACI,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IActF,sFAAsF;IAC/E,gBAAgB,IAAI,MAAM;IAGjC,8EAA8E;IACvE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAG1C,8EAA8E;IACvE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAG1C,+EAA+E;IACxE,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAG3C,8EAA8E;IACvE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAG1C,iFAAiF;IAC1E,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAGxC,wCAAwC;IACjC,WAAW,IAAI,IAAI;IAW1B,iGAAiG;IAC1F,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAWhE;;;OAGG;IACI,wBAAwB,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAchH;AACD;;;;;GAKG;AACH,qBAAa,4BAA6B,SAAQ,sBAAsB;IACtE,OAAO,CAAC,mBAAmB,CAAC,CAAW;IACvC,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,gBAAgB,CAAS;IAEjC,OAAO;IAMP,OAAO,CAAC,kBAAkB;IAG1B;;;;;OAKG;WACW,mBAAmB,CAC/B,QAAQ,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,EAAE,EAAE,OAAO,GAAE,MAAU,GAC3E,4BAA4B;IAG/B;;;;;OAKG;IACa,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAQ7D;;;OAGG;IACa,eAAe,IAAI,OAAO;IAM1C,qGAAqG;IACrF,KAAK,IAAI,IAAI;IAI7B;;;;OAIG;IACI,gBAAgB,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAKjE,iEAAiE;IACjD,sBAAsB,IAAI,MAAM;IAGhD;;;;;;;;;;;;MAYE;WACY,sBAAsB,CAClC,IAAI,EAAE,eAAe,GAAG,sBAAsB,EAC9C,aAAa,GAAE,QAA2B,EAC1C,SAAS,GAAE,KAAgC,EAC3C,OAAO,GAAE,MAAU,GAClB,4BAA4B;CAiBhC"}

package/lib/esm/polyface/IndexedPolyfaceVisitor.js

@@ -17,6 +17,11 @@ import { PolyfaceData } from "./PolyfaceData";
  * @public
  */
 export class IndexedPolyfaceVisitor extends PolyfaceData {
+    _currentFacetIndex;
+    _nextFacetIndex;
+    _numWrap;
+    _numEdges;
+    _polyface;
     // to be called from static factory method that validates the polyface
     constructor(polyface, numWrap) {
         super(polyface.data.normalCount > 0, polyface.data.paramCount > 0, polyface.data.colorCount > 0, polyface.twoSided);
@@ -111,7 +116,7 @@ export class IndexedPolyfaceVisitor extends PolyfaceData {
             return undefined;
         return faceData.convertParamXYToNormalized(this.param.getXAtUncheckedPointIndex(index), this.param.getYAtUncheckedPointIndex(index), result);
     }
-    /** Return the index (in the client polyface) of the current facet. */
+    /** Return the facetIndex of the currently referenced facet in the client polyface. */
     currentReadIndex() {
         return this._currentFacetIndex;
     }
@@ -185,6 +190,9 @@ export class IndexedPolyfaceVisitor extends PolyfaceData {
  * @public
  */
 export class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {
+    _parentFacetIndices; // only undefined during super constructor!
+    _currentActiveIndex; // index within _parentFacetIndices, or -1 after construction
+    _nextActiveIndex; // index within _parentFacetIndices
     constructor(polyface, activeFacetIndices, numWrap) {
         super(polyface, numWrap);
         this._parentFacetIndices = activeFacetIndices.slice();
@@ -205,7 +213,8 @@ export class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {
     }
     /**
      * Advance the iterator to a particular facet in the subset of client polyface facets.
-     * @param activeIndex the index of the facet within the subset, not to be confused with the index of the facet within the client polyface.
+     * @param activeIndex the index of the facet within the subset, not to be confused with the index of the facet within
+     * the client polyface.
      * @return whether the iterator was successfully moved.
      */
     moveToReadIndex(activeIndex) {

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

@@ -1 +1 @@
-{"version":3,"file":"IndexedPolyfaceVisitor.js","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceVisitor.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAmB,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,YAAY;IAMtD,sEAAsE;IACtE,YAAsB,QAAyB,EAAE,OAAe;QAC9D,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACpH,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO;YACvB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC1D,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;IAE/B,CAAC;IACD,yCAAyC;IAClC,cAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,iEAAiE;IAC1D,sBAAsB;QAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;IACnC,CAAC;IACD;;;;;;;;OAQG;IACI,UAAU,CAAC,OAAe;QAC/B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IACD;;;OAGG;IACH,IAAW,iBAAiB;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,+DAA+D;IACxD,MAAM,CAAC,MAAM,CAAC,QAAyB,EAAE,OAAe;QAC7D,OAAO,IAAI,sBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,yEAAyE;IAClE,eAAe,CAAC,UAAkB;QACvC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC,UAAU,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,kBAAkB,GAAG,UAAU,CAAC;QACrC,IAAI,CAAC,eAAe,GAAG,UAAU,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrD,IAAI,CAAC,iBAAiB,CACpB,IAAI,CAAC,SAAS,CAAC,IAAI,EACnB,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EACnD,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EACnD,IAAI,CAAC,QAAQ,CACd,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yEAAyE;IAClE,eAAe;QACpB,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,kBAAkB;YAClD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACpD,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sEAAsE;IAC/D,KAAK;QACV,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,2CAA2C;IACvE,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,KAAa,EAAE,MAAgB;QAC5D,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YAC9C,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,OAAO,QAAQ,CAAC,wBAAwB,CACtC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAC3C,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAC3C,MAAM,CACP,CAAC;IACJ,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,KAAa,EAAE,MAAgB;QAC9D,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YAC9C,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,OAAO,QAAQ,CAAC,0BAA0B,CACxC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAC3C,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAC3C,MAAM,CACP,CAAC;IACJ,CAAC;IACD,sEAAsE;IAC/D,gBAAgB;QACrB,OAAO,IAAI,CAAC,kBAAkB,CAAC;IACjC,CAAC;IACD,8EAA8E;IACvE,gBAAgB,CAAC,CAAS;QAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,8EAA8E;IACvE,gBAAgB,CAAC,CAAS;QAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,+EAA+E;IACxE,iBAAiB,CAAC,CAAS;QAChC,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,8EAA8E;IACvE,gBAAgB,CAAC,CAAS;QAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,iFAAiF;IAC1E,cAAc,CAAC,CAAS;QAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,wCAAwC;IACjC,WAAW;QAChB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,6CAA6C;IAC/C,CAAC;IACD,iGAAiG;IAC1F,YAAY,CAAC,KAAsB,EAAE,KAAa;QACvD,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAChD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzD,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM;YAC5D,IAAI,CAAC,MAAM,CAAC,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5D,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACtC,6CAA6C;IAC/C,CAAC;IACD;;;OAGG;IACI,wBAAwB,CAAC,KAAsB,EAAE,MAAc,EAAE,QAAgB,EAAE,MAAc;QACtG,IAAI,MAAM,GAAG,MAAM;YACjB,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,GAAG,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvE,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvF,MAAM,aAAa,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACjH,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,oEAAoE;QAC1G,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzF,IAAI,CAAC,KAAK,CAAC,mCAAmC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxF,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM;YAC7F,IAAI,CAAC,MAAM,CAAC,oCAAoC,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC3F,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjG,oCAAoC;IACtC,CAAC;CACF;AACD;;;;;GAKG;AACH,MAAM,OAAO,4BAA6B,SAAQ,sBAAsB;IAKtE,YAAoB,QAAyB,EAAE,kBAA4B,EAAE,OAAe;QAC1F,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC;QACtD,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IACO,kBAAkB,CAAC,KAAa;QACtC,OAAO,CAAC,SAAS,KAAK,IAAI,CAAC,mBAAmB,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC;IAC3G,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,mBAAmB,CAAC,QAAyB,EAAE,kBAA4B,EAAE,UAAkB,CAAC;QAC5G,OAAO,IAAI,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,OAAO,CAAC,CAAC;IACjF,CAAC;IACD;;;;OAIG;IACa,eAAe,CAAC,WAAmB;QACjD,IAAI,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,mBAAmB,GAAG,WAAW,CAAC;YACvC,IAAI,CAAC,gBAAgB,GAAG,WAAW,GAAG,CAAC,CAAC;YACxC,OAAO,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,mBAAoB,CAAC,WAAW,CAAC,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACa,eAAe;QAC7B,IAAI,IAAI,CAAC,gBAAgB,KAAK,IAAI,CAAC,mBAAmB;YACpD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACrD,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qGAAqG;IACrF,KAAK;QACnB,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,2CAA2C;IACxE,CAAC;IACD;;;;OAIG;IACI,gBAAgB,CAAC,WAAoB;QAC1C,IAAI,SAAS,KAAK,WAAW;YAC3B,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACzC,OAAO,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAoB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACnG,CAAC;IACD,iEAAiE;IACjD,sBAAsB;QACpC,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IACD;;;;;;;;;;;;MAYE;IACK,MAAM,CAAC,sBAAsB,CAAC,IAA8C,EAAE,gBAA0B,QAAQ,CAAC,KAAK,EAAE,EAAE,YAAmB,KAAK,CAAC,gBAAgB,EAAE,EAAE,UAAkB,CAAC;QAC/L,IAAI,IAAI,YAAY,eAAe;YACjC,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,aAAa,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9F,MAAM,OAAO,GAAG,IAAI,CAAC;QACrB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC1C,KAAK,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,eAAe,EAAE,GAAI,CAAC;YAClD,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC;gBACpD,SAAS,CAAC,mBAAmB;YAC/B,IAAI,WAAW,CAAC,UAAU,CAAC,aAAa,CAAC,GAAG,GAAG;gBAC7C,SAAS,CAAC,uCAAuC;YACnD,IAAI,WAAW,CAAC,sBAAsB,CAAC,aAAa,CAAC,CAAC,0BAA0B,CAAC,SAAS,CAAC;gBACzF,SAAS,CAAC,oBAAoB;YAChC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,4BAA4B,CAAC,mBAAmB,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACrG,CAAC;CACF","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 { Angle } from \"../geometry3d/Angle\";\r\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\r\nimport { IndexedPolyface, PolyfaceVisitor } from \"./Polyface\";\r\nimport { PolyfaceData } from \"./PolyfaceData\";\r\n\r\n/**\r\n * An `IndexedPolyfaceVisitor` is an iterator-like object that \"visits\" facets of a mesh.\r\n * * The visitor extends `PolyfaceData`, so it can at any time hold all the data of a single facet.\r\n * @public\r\n */\r\nexport class IndexedPolyfaceVisitor extends PolyfaceData implements PolyfaceVisitor {\r\n  private _currentFacetIndex: number;\r\n  private _nextFacetIndex: number;\r\n  private _numWrap: number;\r\n  private _numEdges: number;\r\n  private _polyface: IndexedPolyface;\r\n  // to be called from static factory method that validates the polyface\r\n  protected constructor(polyface: IndexedPolyface, numWrap: number) {\r\n    super(polyface.data.normalCount > 0, polyface.data.paramCount > 0, polyface.data.colorCount > 0, polyface.twoSided);\r\n    this._polyface = polyface;\r\n    this._numWrap = numWrap;\r\n    if (polyface.data.auxData)\r\n      this.auxData = polyface.data.auxData.createForVisitor();\r\n    this.reset();\r\n    this._numEdges = 0;\r\n    this._nextFacetIndex = 0;\r\n    this._currentFacetIndex = -1;\r\n\r\n  }\r\n  /** Return the client polyface object. */\r\n  public clientPolyface(): IndexedPolyface {\r\n    return this._polyface;\r\n  }\r\n  /** Return the number of facets this visitor is able to visit. */\r\n  public getVisitableFacetCount(): number {\r\n    return this._polyface.facetCount;\r\n  }\r\n  /**\r\n   * Set the number of vertices replicated in visitor arrays (both data and index arrays).\r\n   * * 0,1,2 are the most common as numWrap.\r\n   * * Example: suppose `[6,7,8]` is the pointIndex array representing a triangle. First edge would be `6,7`. Second\r\n   * edge is `7,8`. Third edge is `8,6`. To access `6` for the third edge, we have to go back to the start of array.\r\n   * Therefore, it is useful to store `6` at the end of pointIndex array, i.e., `[6,7,8,6]` meaning `numWrap = 1`.\r\n   * Continuing this example, `numWrap = 2` (i.e., `[6,7,8,6,7]`) is useful when each vertex visit requires the next\r\n   * two points, e.g., to form two adjacent vectors for a cross product.\r\n   */\r\n  public setNumWrap(numWrap: number) {\r\n    this._numWrap = numWrap;\r\n  }\r\n  /**\r\n   * Return the number of edges in the current facet.\r\n   * * If `numWrap > 0` for this visitor, the number of edges is smaller than the number of points.\r\n   */\r\n  public get numEdgesThisFacet(): number {\r\n    return this._numEdges;\r\n  }\r\n  /** Create a visitor for iterating the facets of `polyface`. */\r\n  public static create(polyface: IndexedPolyface, numWrap: number): IndexedPolyfaceVisitor {\r\n    return new IndexedPolyfaceVisitor(polyface, numWrap);\r\n  }\r\n  /** Advance the iterator to a particular facet in the client polyface. */\r\n  public moveToReadIndex(facetIndex: number): boolean {\r\n    if (!this._polyface.isValidFacetIndex(facetIndex))\r\n      return false;\r\n    this._currentFacetIndex = facetIndex;\r\n    this._nextFacetIndex = facetIndex + 1;\r\n    this._numEdges = this._polyface.numEdgeInFacet(facetIndex);\r\n    this.resizeAllArrays(this._numEdges + this._numWrap);\r\n    this.gatherIndexedData(\r\n      this._polyface.data,\r\n      this._polyface.facetIndex0(this._currentFacetIndex),\r\n      this._polyface.facetIndex1(this._currentFacetIndex),\r\n      this._numWrap,\r\n    );\r\n    return true;\r\n  }\r\n  /** Advance the iterator to a the 'next' facet in the client polyface. */\r\n  public moveToNextFacet(): boolean {\r\n    if (this._nextFacetIndex !== this._currentFacetIndex)\r\n      return this.moveToReadIndex(this._nextFacetIndex);\r\n    this._nextFacetIndex++;\r\n    return true;\r\n  }\r\n  /** Reset the iterator to start at the first facet of the polyface. */\r\n  public reset(): void {\r\n    this.moveToReadIndex(0);\r\n    this._nextFacetIndex = 0; // so immediate moveToNextFacet stays here.\r\n  }\r\n  /**\r\n   * Attempts to extract the distance parameter for the given vertex `index` on the current facet.\r\n   * Returns the distance parameter as a point. Returns `undefined` on failure.\r\n   */\r\n  public tryGetDistanceParameter(index: number, result?: Point2d): Point2d | undefined {\r\n    if (index < 0 || index >= this.numEdgesThisFacet)\r\n      return undefined;\r\n    if (this.param === undefined || this._polyface.data.face.length === 0)\r\n      return undefined;\r\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\r\n    if (!faceData)\r\n      return undefined;\r\n    return faceData.convertParamXYToDistance(\r\n      this.param.getXAtUncheckedPointIndex(index),\r\n      this.param.getYAtUncheckedPointIndex(index),\r\n      result,\r\n    );\r\n  }\r\n  /**\r\n   * Attempts to extract the normalized parameter (0,1) for the given vertex `index` on the current facet.\r\n   * Returns the normalized parameter as a point. Returns `undefined` on failure.\r\n   */\r\n  public tryGetNormalizedParameter(index: number, result?: Point2d): Point2d | undefined {\r\n    if (index < 0 || index >= this.numEdgesThisFacet)\r\n      return undefined;\r\n    if (this.param === undefined || this._polyface.data.face.length === 0)\r\n      return undefined;\r\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\r\n    if (!faceData)\r\n      return undefined;\r\n    return faceData.convertParamXYToNormalized(\r\n      this.param.getXAtUncheckedPointIndex(index),\r\n      this.param.getYAtUncheckedPointIndex(index),\r\n      result,\r\n    );\r\n  }\r\n  /** Return the index (in the client polyface) of the current facet. */\r\n  public currentReadIndex(): number {\r\n    return this._currentFacetIndex;\r\n  }\r\n  /** Return the point index of vertex `i` within the currently loaded facet. */\r\n  public clientPointIndex(i: number): number {\r\n    return this.pointIndex[i];\r\n  }\r\n  /** Return the param index of vertex `i` within the currently loaded facet. */\r\n  public clientParamIndex(i: number): number {\r\n    return this.paramIndex ? this.paramIndex[i] : -1;\r\n  }\r\n  /** Return the normal index of vertex `i` within the currently loaded facet. */\r\n  public clientNormalIndex(i: number): number {\r\n    return this.normalIndex ? this.normalIndex[i] : -1;\r\n  }\r\n  /** Return the color index of vertex `i` within the currently loaded facet. */\r\n  public clientColorIndex(i: number): number {\r\n    return this.colorIndex ? this.colorIndex[i] : -1;\r\n  }\r\n  /** Return the aux data index of vertex `i` within the currently loaded facet. */\r\n  public clientAuxIndex(i: number): number {\r\n    return this.auxData ? this.auxData.indices[i] : -1;\r\n  }\r\n  /** Clear the contents of all arrays. */\r\n  public clearArrays(): void {\r\n    this.point.length = 0;\r\n    this.edgeVisible.length = 0;\r\n    if (this.param !== undefined)\r\n      this.param.length = 0;\r\n    if (this.normal !== undefined)\r\n      this.normal.length = 0;\r\n    if (this.color !== undefined)\r\n      this.color.length = 0;\r\n    // TODO: indices? auxData? taggedNumericData?\r\n  }\r\n  /** Transfer data from a specified `index` of the `other` visitor as new data in this visitor. */\r\n  public pushDataFrom(other: PolyfaceVisitor, index: number): void {\r\n    this.point.pushFromGrowableXYZArray(other.point, index);\r\n    this.edgeVisible.push(other.edgeVisible[index]);\r\n    if (this.param && other.param && index < other.param.length)\r\n      this.param.pushFromGrowableXYArray(other.param, index);\r\n    if (this.normal && other.normal && index < other.normal.length)\r\n      this.normal.pushFromGrowableXYZArray(other.normal, index);\r\n    if (this.color && other.color && index < other.color.length)\r\n      this.color.push(other.color[index]);\r\n    // TODO: indices? auxData? taggedNumericData?\r\n  }\r\n  /**\r\n   * Transfer interpolated data from the other visitor.\r\n   * * All data values are interpolated at `fraction` between `other` values at `index0` and `index1`.\r\n   */\r\n  public pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void {\r\n    if (index0 > index1)\r\n      this.pushInterpolatedDataFrom(other, index1, 1.0 - fraction, index0);\r\n    this.point.pushInterpolatedFromGrowableXYZArray(other.point, index0, fraction, index1);\r\n    const newVisibility = (((index0 + 1) % other.edgeVisible.length) === index1) ? other.edgeVisible[index0] : false;\r\n    this.edgeVisible.push(newVisibility); // interpolation along an edge preserves visibility of original edge\r\n    if (this.param && other.param && index0 < other.param.length && index1 < other.param.length)\r\n      this.param.pushInterpolatedFromGrowableXYArray(other.param, index0, fraction, index1);\r\n    if (this.normal && other.normal && index0 < other.normal.length && index1 < other.normal.length)\r\n      this.normal.pushInterpolatedFromGrowableXYZArray(other.normal, index0, fraction, index1);\r\n    if (this.color && other.color && index0 < other.color.length && index1 < other.color.length)\r\n      this.color.push(Geometry.interpolateColor(other.color[index0], fraction, other.color[index1]));\r\n    // TODO: auxData? taggedNumericData?\r\n  }\r\n}\r\n/**\r\n * An `IndexedPolyfaceSubsetVisitor` is an `IndexedPolyfaceVisitor` which only visits a subset of facets in the polyface.\r\n * * The subset is defined by an array of facet indices provided when this visitor is created.\r\n * * Input indices (e.g., for `moveToReadIndex`) are understood to be indices into the subset array.\r\n * @public\r\n */\r\nexport class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {\r\n  private _parentFacetIndices?: number[]; // only undefined during super constructor!\r\n  private _currentActiveIndex: number;    // index within _parentFacetIndices, or -1 after construction\r\n  private _nextActiveIndex: number;       // index within _parentFacetIndices\r\n\r\n  private constructor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number) {\r\n    super(polyface, numWrap);\r\n    this._parentFacetIndices = activeFacetIndices.slice();\r\n    this._currentActiveIndex = -1;\r\n    this._nextActiveIndex = 0;\r\n  }\r\n  private isValidSubsetIndex(index: number): boolean {\r\n    return (undefined !== this._parentFacetIndices) && index >= 0 && index < this._parentFacetIndices.length;\r\n  }\r\n  /**\r\n   * Create a visitor for iterating a subset of the facets of `polyface`.\r\n   * @param polyface reference to the client polyface, supplying facets\r\n   * @param activeFacetIndices array of indices of facets in the client polyface to visit. This array is cloned.\r\n   * @param numWrap number of vertices replicated in the visitor arrays to facilitate simpler caller code. Default is zero.\r\n   */\r\n  public static createSubsetVisitor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number = 0): IndexedPolyfaceSubsetVisitor {\r\n    return new IndexedPolyfaceSubsetVisitor(polyface, activeFacetIndices, numWrap);\r\n  }\r\n  /**\r\n   * Advance the iterator to a particular facet in the subset of client polyface facets.\r\n   * @param activeIndex the index of the facet within the subset, not to be confused with the index of the facet within the client polyface.\r\n   * @return whether the iterator was successfully moved.\r\n   */\r\n  public override moveToReadIndex(activeIndex: number): boolean {\r\n    if (this.isValidSubsetIndex(activeIndex)) {\r\n      this._currentActiveIndex = activeIndex;\r\n      this._nextActiveIndex = activeIndex + 1;\r\n      return super.moveToReadIndex(this._parentFacetIndices![activeIndex]);\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Advance the iterator to the next facet in the subset of client polyface facets.\r\n   * @return whether the iterator was successfully moved.\r\n   */\r\n  public override moveToNextFacet(): boolean {\r\n    if (this._nextActiveIndex !== this._currentActiveIndex)\r\n      return this.moveToReadIndex(this._nextActiveIndex);\r\n    this._nextActiveIndex++;\r\n    return true;\r\n  }\r\n  /** Reset the iterator to start at the first active facet in the subset of client polyface facets. */\r\n  public override reset(): void {\r\n    this.moveToReadIndex(0);\r\n    this._nextActiveIndex = 0; // so immediate moveToNextFacet stays here.\r\n  }\r\n  /**\r\n   * Return the parent facet index of the indicated index within the subset of client polyface facets.\r\n   * @param activeIndex index of the facet within the subset. Default is the active facet.\r\n   * @return valid client polyface facet index, or `undefined` if invalid input index.\r\n   */\r\n  public parentFacetIndex(activeIndex?: number): number | undefined {\r\n    if (undefined === activeIndex)\r\n      activeIndex = this._currentActiveIndex;\r\n    return this.isValidSubsetIndex(activeIndex) ? this._parentFacetIndices![activeIndex] : undefined;\r\n  }\r\n  /** Return the number of facets this visitor is able to visit. */\r\n  public override getVisitableFacetCount(): number {\r\n    return this._parentFacetIndices ? this._parentFacetIndices.length : 0;\r\n  }\r\n  /**\r\n   * Create a visitor for those mesh facets with normal in the same half-space as the given vector.\r\n   * * For example, to visit the top facets of a tiled terrain mesh but skip the \"skirt\" facets, pass\r\n   * `compareVector = Vector3d.unitZ()` and a suitable `sideAngle` tolerance. Note that this will also\r\n   * filter out *interior* facets that are nearly vertical, not just the \"skirt\" facets on the boundary.\r\n   * @param mesh the mesh from which to select facets\r\n   * @param compareVector vector to which to compare facet normals. The visitor will visit only those facets\r\n   * with normals in the same half-space as this vector. Default is 001.\r\n   * @param sideAngle optional angular tolerance to filter the facets near the border between half-spaces.\r\n   * The visitor will *not* visit facets whose normals are nearly perpendicular to `compareVector`.\r\n   * Default is [[Geometry.smallAngleRadians]].\r\n   * @param numWrap optional number of entries replicated in visitor arrays. Default is 0.\r\n  */\r\n  public static createNormalComparison(mesh: IndexedPolyface | IndexedPolyfaceVisitor, compareVector: Vector3d = Vector3d.unitZ(), sideAngle: Angle = Angle.createSmallAngle(), numWrap: number = 0): IndexedPolyfaceSubsetVisitor {\r\n    if (mesh instanceof IndexedPolyface)\r\n      return this.createNormalComparison(mesh.createVisitor(), compareVector, sideAngle, numWrap);\r\n    const visitor = mesh;\r\n    const facets: number[] = [];\r\n    const facetNormal = Vector3d.createZero();\r\n    for (visitor.reset(); visitor.moveToNextFacet(); ) {\r\n      if (!PolygonOps.unitNormal(visitor.point, facetNormal))\r\n        continue; // degenerate facet\r\n      if (facetNormal.dotProduct(compareVector) < 0.0)\r\n        continue; // ignore facet facing other half-space\r\n      if (facetNormal.angleFromPerpendicular(compareVector).isMagnitudeLessThanOrEqual(sideAngle))\r\n        continue; // ignore side facet\r\n      facets.push(visitor.currentReadIndex());\r\n    }\r\n    return IndexedPolyfaceSubsetVisitor.createSubsetVisitor(visitor.clientPolyface(), facets, numWrap);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"IndexedPolyfaceVisitor.js","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceVisitor.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAmB,MAAM,YAAY,CAAC;AAC9D,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,YAAY;IAC9C,kBAAkB,CAAS;IAC3B,eAAe,CAAS;IACxB,QAAQ,CAAS;IACjB,SAAS,CAAS;IAClB,SAAS,CAAkB;IACnC,sEAAsE;IACtE,YAAsB,QAAyB,EAAE,OAAe;QAC9D,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACpH,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO;YACvB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC1D,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;IAE/B,CAAC;IACD,yCAAyC;IAClC,cAAc;QACnB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,iEAAiE;IAC1D,sBAAsB;QAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC;IACnC,CAAC;IACD;;;;;;;;OAQG;IACI,UAAU,CAAC,OAAe;QAC/B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IACD;;;OAGG;IACH,IAAW,iBAAiB;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,+DAA+D;IACxD,MAAM,CAAC,MAAM,CAAC,QAAyB,EAAE,OAAe;QAC7D,OAAO,IAAI,sBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,yEAAyE;IAClE,eAAe,CAAC,UAAkB;QACvC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC,UAAU,CAAC;YAC/C,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,kBAAkB,GAAG,UAAU,CAAC;QACrC,IAAI,CAAC,eAAe,GAAG,UAAU,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrD,IAAI,CAAC,iBAAiB,CACpB,IAAI,CAAC,SAAS,CAAC,IAAI,EACnB,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EACnD,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EACnD,IAAI,CAAC,QAAQ,CACd,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yEAAyE;IAClE,eAAe;QACpB,IAAI,IAAI,CAAC,eAAe,KAAK,IAAI,CAAC,kBAAkB;YAClD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACpD,IAAI,CAAC,eAAe,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sEAAsE;IAC/D,KAAK;QACV,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,2CAA2C;IACvE,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,KAAa,EAAE,MAAgB;QAC5D,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YAC9C,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,OAAO,QAAQ,CAAC,wBAAwB,CACtC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAC3C,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAC3C,MAAM,CACP,CAAC;IACJ,CAAC;IACD;;;OAGG;IACI,yBAAyB,CAAC,KAAa,EAAE,MAAgB;QAC9D,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YAC9C,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QACxE,IAAI,CAAC,QAAQ;YACX,OAAO,SAAS,CAAC;QACnB,OAAO,QAAQ,CAAC,0BAA0B,CACxC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAC3C,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAC3C,MAAM,CACP,CAAC;IACJ,CAAC;IACD,sFAAsF;IAC/E,gBAAgB;QACrB,OAAO,IAAI,CAAC,kBAAkB,CAAC;IACjC,CAAC;IACD,8EAA8E;IACvE,gBAAgB,CAAC,CAAS;QAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,8EAA8E;IACvE,gBAAgB,CAAC,CAAS;QAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,+EAA+E;IACxE,iBAAiB,CAAC,CAAS;QAChC,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,8EAA8E;IACvE,gBAAgB,CAAC,CAAS;QAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,iFAAiF;IAC1E,cAAc,CAAC,CAAS;QAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,wCAAwC;IACjC,WAAW;QAChB,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,6CAA6C;IAC/C,CAAC;IACD,iGAAiG;IAC1F,YAAY,CAAC,KAAsB,EAAE,KAAa;QACvD,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;QAChD,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzD,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM;YAC5D,IAAI,CAAC,MAAM,CAAC,wBAAwB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5D,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACtC,6CAA6C;IAC/C,CAAC;IACD;;;OAGG;IACI,wBAAwB,CAAC,KAAsB,EAAE,MAAc,EAAE,QAAgB,EAAE,MAAc;QACtG,IAAI,MAAM,GAAG,MAAM;YACjB,IAAI,CAAC,wBAAwB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,GAAG,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvE,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvF,MAAM,aAAa,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACjH,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,oEAAoE;QAC1G,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzF,IAAI,CAAC,KAAK,CAAC,mCAAmC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACxF,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM;YAC7F,IAAI,CAAC,MAAM,CAAC,oCAAoC,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC3F,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM;YACzF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjG,oCAAoC;IACtC,CAAC;CACF;AACD;;;;;GAKG;AACH,MAAM,OAAO,4BAA6B,SAAQ,sBAAsB;IAC9D,mBAAmB,CAAY,CAAC,2CAA2C;IAC3E,mBAAmB,CAAS,CAAI,6DAA6D;IAC7F,gBAAgB,CAAS,CAAO,mCAAmC;IAE3E,YAAoB,QAAyB,EAAE,kBAA4B,EAAE,OAAe;QAC1F,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC;QACtD,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IACO,kBAAkB,CAAC,KAAa;QACtC,OAAO,CAAC,SAAS,KAAK,IAAI,CAAC,mBAAmB,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC;IAC3G,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,mBAAmB,CAC/B,QAAyB,EAAE,kBAA4B,EAAE,UAAkB,CAAC;QAE5E,OAAO,IAAI,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,OAAO,CAAC,CAAC;IACjF,CAAC;IACD;;;;;OAKG;IACa,eAAe,CAAC,WAAmB;QACjD,IAAI,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,mBAAmB,GAAG,WAAW,CAAC;YACvC,IAAI,CAAC,gBAAgB,GAAG,WAAW,GAAG,CAAC,CAAC;YACxC,OAAO,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,mBAAoB,CAAC,WAAW,CAAC,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACa,eAAe;QAC7B,IAAI,IAAI,CAAC,gBAAgB,KAAK,IAAI,CAAC,mBAAmB;YACpD,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACrD,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qGAAqG;IACrF,KAAK;QACnB,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,2CAA2C;IACxE,CAAC;IACD;;;;OAIG;IACI,gBAAgB,CAAC,WAAoB;QAC1C,IAAI,SAAS,KAAK,WAAW;YAC3B,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACzC,OAAO,IAAI,CAAC,kBAAkB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAoB,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACnG,CAAC;IACD,iEAAiE;IACjD,sBAAsB;QACpC,OAAO,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IACD;;;;;;;;;;;;MAYE;IACK,MAAM,CAAC,sBAAsB,CAClC,IAA8C,EAC9C,gBAA0B,QAAQ,CAAC,KAAK,EAAE,EAC1C,YAAmB,KAAK,CAAC,gBAAgB,EAAE,EAC3C,UAAkB,CAAC;QAEnB,IAAI,IAAI,YAAY,eAAe;YACjC,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,aAAa,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC9F,MAAM,OAAO,GAAG,IAAI,CAAC;QACrB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,WAAW,GAAG,QAAQ,CAAC,UAAU,EAAE,CAAC;QAC1C,KAAK,OAAO,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC;YACjD,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC;gBACpD,SAAS,CAAC,mBAAmB;YAC/B,IAAI,WAAW,CAAC,UAAU,CAAC,aAAa,CAAC,GAAG,GAAG;gBAC7C,SAAS,CAAC,uCAAuC;YACnD,IAAI,WAAW,CAAC,sBAAsB,CAAC,aAAa,CAAC,CAAC,0BAA0B,CAAC,SAAS,CAAC;gBACzF,SAAS,CAAC,oBAAoB;YAChC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,4BAA4B,CAAC,mBAAmB,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IACrG,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Polyface\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\nimport { Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { IndexedPolyface, PolyfaceVisitor } from \"./Polyface\";\nimport { PolyfaceData } from \"./PolyfaceData\";\n\n/**\n * An `IndexedPolyfaceVisitor` is an iterator-like object that \"visits\" facets of a mesh.\n * * The visitor extends `PolyfaceData`, so it can at any time hold all the data of a single facet.\n * @public\n */\nexport class IndexedPolyfaceVisitor extends PolyfaceData implements PolyfaceVisitor {\n  private _currentFacetIndex: number;\n  private _nextFacetIndex: number;\n  private _numWrap: number;\n  private _numEdges: number;\n  private _polyface: IndexedPolyface;\n  // to be called from static factory method that validates the polyface\n  protected constructor(polyface: IndexedPolyface, numWrap: number) {\n    super(polyface.data.normalCount > 0, polyface.data.paramCount > 0, polyface.data.colorCount > 0, polyface.twoSided);\n    this._polyface = polyface;\n    this._numWrap = numWrap;\n    if (polyface.data.auxData)\n      this.auxData = polyface.data.auxData.createForVisitor();\n    this.reset();\n    this._numEdges = 0;\n    this._nextFacetIndex = 0;\n    this._currentFacetIndex = -1;\n\n  }\n  /** Return the client polyface object. */\n  public clientPolyface(): IndexedPolyface {\n    return this._polyface;\n  }\n  /** Return the number of facets this visitor is able to visit. */\n  public getVisitableFacetCount(): number {\n    return this._polyface.facetCount;\n  }\n  /**\n   * Set the number of vertices replicated in visitor arrays (both data and index arrays).\n   * * 0,1,2 are the most common as numWrap.\n   * * Example: suppose `[6,7,8]` is the pointIndex array representing a triangle. First edge would be `6,7`. Second\n   * edge is `7,8`. Third edge is `8,6`. To access `6` for the third edge, we have to go back to the start of array.\n   * Therefore, it is useful to store `6` at the end of pointIndex array, i.e., `[6,7,8,6]` meaning `numWrap = 1`.\n   * Continuing this example, `numWrap = 2` (i.e., `[6,7,8,6,7]`) is useful when each vertex visit requires the next\n   * two points, e.g., to form two adjacent vectors for a cross product.\n   */\n  public setNumWrap(numWrap: number) {\n    this._numWrap = numWrap;\n  }\n  /**\n   * Return the number of edges in the current facet.\n   * * If `numWrap > 0` for this visitor, the number of edges is smaller than the number of points.\n   */\n  public get numEdgesThisFacet(): number {\n    return this._numEdges;\n  }\n  /** Create a visitor for iterating the facets of `polyface`. */\n  public static create(polyface: IndexedPolyface, numWrap: number): IndexedPolyfaceVisitor {\n    return new IndexedPolyfaceVisitor(polyface, numWrap);\n  }\n  /** Advance the iterator to a particular facet in the client polyface. */\n  public moveToReadIndex(facetIndex: number): boolean {\n    if (!this._polyface.isValidFacetIndex(facetIndex))\n      return false;\n    this._currentFacetIndex = facetIndex;\n    this._nextFacetIndex = facetIndex + 1;\n    this._numEdges = this._polyface.numEdgeInFacet(facetIndex);\n    this.resizeAllArrays(this._numEdges + this._numWrap);\n    this.gatherIndexedData(\n      this._polyface.data,\n      this._polyface.facetIndex0(this._currentFacetIndex),\n      this._polyface.facetIndex1(this._currentFacetIndex),\n      this._numWrap,\n    );\n    return true;\n  }\n  /** Advance the iterator to a the 'next' facet in the client polyface. */\n  public moveToNextFacet(): boolean {\n    if (this._nextFacetIndex !== this._currentFacetIndex)\n      return this.moveToReadIndex(this._nextFacetIndex);\n    this._nextFacetIndex++;\n    return true;\n  }\n  /** Reset the iterator to start at the first facet of the polyface. */\n  public reset(): void {\n    this.moveToReadIndex(0);\n    this._nextFacetIndex = 0; // so immediate moveToNextFacet stays here.\n  }\n  /**\n   * Attempts to extract the distance parameter for the given vertex `index` on the current facet.\n   * Returns the distance parameter as a point. Returns `undefined` on failure.\n   */\n  public tryGetDistanceParameter(index: number, result?: Point2d): Point2d | undefined {\n    if (index < 0 || index >= this.numEdgesThisFacet)\n      return undefined;\n    if (this.param === undefined || this._polyface.data.face.length === 0)\n      return undefined;\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\n    if (!faceData)\n      return undefined;\n    return faceData.convertParamXYToDistance(\n      this.param.getXAtUncheckedPointIndex(index),\n      this.param.getYAtUncheckedPointIndex(index),\n      result,\n    );\n  }\n  /**\n   * Attempts to extract the normalized parameter (0,1) for the given vertex `index` on the current facet.\n   * Returns the normalized parameter as a point. Returns `undefined` on failure.\n   */\n  public tryGetNormalizedParameter(index: number, result?: Point2d): Point2d | undefined {\n    if (index < 0 || index >= this.numEdgesThisFacet)\n      return undefined;\n    if (this.param === undefined || this._polyface.data.face.length === 0)\n      return undefined;\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\n    if (!faceData)\n      return undefined;\n    return faceData.convertParamXYToNormalized(\n      this.param.getXAtUncheckedPointIndex(index),\n      this.param.getYAtUncheckedPointIndex(index),\n      result,\n    );\n  }\n  /** Return the facetIndex of the currently referenced facet in the client polyface. */\n  public currentReadIndex(): number {\n    return this._currentFacetIndex;\n  }\n  /** Return the point index of vertex `i` within the currently loaded facet. */\n  public clientPointIndex(i: number): number {\n    return this.pointIndex[i];\n  }\n  /** Return the param index of vertex `i` within the currently loaded facet. */\n  public clientParamIndex(i: number): number {\n    return this.paramIndex ? this.paramIndex[i] : -1;\n  }\n  /** Return the normal index of vertex `i` within the currently loaded facet. */\n  public clientNormalIndex(i: number): number {\n    return this.normalIndex ? this.normalIndex[i] : -1;\n  }\n  /** Return the color index of vertex `i` within the currently loaded facet. */\n  public clientColorIndex(i: number): number {\n    return this.colorIndex ? this.colorIndex[i] : -1;\n  }\n  /** Return the aux data index of vertex `i` within the currently loaded facet. */\n  public clientAuxIndex(i: number): number {\n    return this.auxData ? this.auxData.indices[i] : -1;\n  }\n  /** Clear the contents of all arrays. */\n  public clearArrays(): void {\n    this.point.length = 0;\n    this.edgeVisible.length = 0;\n    if (this.param !== undefined)\n      this.param.length = 0;\n    if (this.normal !== undefined)\n      this.normal.length = 0;\n    if (this.color !== undefined)\n      this.color.length = 0;\n    // TODO: indices? auxData? taggedNumericData?\n  }\n  /** Transfer data from a specified `index` of the `other` visitor as new data in this visitor. */\n  public pushDataFrom(other: PolyfaceVisitor, index: number): void {\n    this.point.pushFromGrowableXYZArray(other.point, index);\n    this.edgeVisible.push(other.edgeVisible[index]);\n    if (this.param && other.param && index < other.param.length)\n      this.param.pushFromGrowableXYArray(other.param, index);\n    if (this.normal && other.normal && index < other.normal.length)\n      this.normal.pushFromGrowableXYZArray(other.normal, index);\n    if (this.color && other.color && index < other.color.length)\n      this.color.push(other.color[index]);\n    // TODO: indices? auxData? taggedNumericData?\n  }\n  /**\n   * Transfer interpolated data from the other visitor.\n   * * All data values are interpolated at `fraction` between `other` values at `index0` and `index1`.\n   */\n  public pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void {\n    if (index0 > index1)\n      this.pushInterpolatedDataFrom(other, index1, 1.0 - fraction, index0);\n    this.point.pushInterpolatedFromGrowableXYZArray(other.point, index0, fraction, index1);\n    const newVisibility = (((index0 + 1) % other.edgeVisible.length) === index1) ? other.edgeVisible[index0] : false;\n    this.edgeVisible.push(newVisibility); // interpolation along an edge preserves visibility of original edge\n    if (this.param && other.param && index0 < other.param.length && index1 < other.param.length)\n      this.param.pushInterpolatedFromGrowableXYArray(other.param, index0, fraction, index1);\n    if (this.normal && other.normal && index0 < other.normal.length && index1 < other.normal.length)\n      this.normal.pushInterpolatedFromGrowableXYZArray(other.normal, index0, fraction, index1);\n    if (this.color && other.color && index0 < other.color.length && index1 < other.color.length)\n      this.color.push(Geometry.interpolateColor(other.color[index0], fraction, other.color[index1]));\n    // TODO: auxData? taggedNumericData?\n  }\n}\n/**\n * An `IndexedPolyfaceSubsetVisitor` is an `IndexedPolyfaceVisitor` which only visits a subset of facets in the polyface.\n * * The subset is defined by an array of facet indices provided when this visitor is created.\n * * Input indices (e.g., for `moveToReadIndex`) are understood to be indices into the subset array.\n * @public\n */\nexport class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {\n  private _parentFacetIndices?: number[]; // only undefined during super constructor!\n  private _currentActiveIndex: number;    // index within _parentFacetIndices, or -1 after construction\n  private _nextActiveIndex: number;       // index within _parentFacetIndices\n\n  private constructor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number) {\n    super(polyface, numWrap);\n    this._parentFacetIndices = activeFacetIndices.slice();\n    this._currentActiveIndex = -1;\n    this._nextActiveIndex = 0;\n  }\n  private isValidSubsetIndex(index: number): boolean {\n    return (undefined !== this._parentFacetIndices) && index >= 0 && index < this._parentFacetIndices.length;\n  }\n  /**\n   * Create a visitor for iterating a subset of the facets of `polyface`.\n   * @param polyface reference to the client polyface, supplying facets\n   * @param activeFacetIndices array of indices of facets in the client polyface to visit. This array is cloned.\n   * @param numWrap number of vertices replicated in the visitor arrays to facilitate simpler caller code. Default is zero.\n   */\n  public static createSubsetVisitor(\n    polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number = 0,\n  ): IndexedPolyfaceSubsetVisitor {\n    return new IndexedPolyfaceSubsetVisitor(polyface, activeFacetIndices, numWrap);\n  }\n  /**\n   * Advance the iterator to a particular facet in the subset of client polyface facets.\n   * @param activeIndex the index of the facet within the subset, not to be confused with the index of the facet within\n   * the client polyface.\n   * @return whether the iterator was successfully moved.\n   */\n  public override moveToReadIndex(activeIndex: number): boolean {\n    if (this.isValidSubsetIndex(activeIndex)) {\n      this._currentActiveIndex = activeIndex;\n      this._nextActiveIndex = activeIndex + 1;\n      return super.moveToReadIndex(this._parentFacetIndices![activeIndex]);\n    }\n    return false;\n  }\n  /**\n   * Advance the iterator to the next facet in the subset of client polyface facets.\n   * @return whether the iterator was successfully moved.\n   */\n  public override moveToNextFacet(): boolean {\n    if (this._nextActiveIndex !== this._currentActiveIndex)\n      return this.moveToReadIndex(this._nextActiveIndex);\n    this._nextActiveIndex++;\n    return true;\n  }\n  /** Reset the iterator to start at the first active facet in the subset of client polyface facets. */\n  public override reset(): void {\n    this.moveToReadIndex(0);\n    this._nextActiveIndex = 0; // so immediate moveToNextFacet stays here.\n  }\n  /**\n   * Return the parent facet index of the indicated index within the subset of client polyface facets.\n   * @param activeIndex index of the facet within the subset. Default is the active facet.\n   * @return valid client polyface facet index, or `undefined` if invalid input index.\n   */\n  public parentFacetIndex(activeIndex?: number): number | undefined {\n    if (undefined === activeIndex)\n      activeIndex = this._currentActiveIndex;\n    return this.isValidSubsetIndex(activeIndex) ? this._parentFacetIndices![activeIndex] : undefined;\n  }\n  /** Return the number of facets this visitor is able to visit. */\n  public override getVisitableFacetCount(): number {\n    return this._parentFacetIndices ? this._parentFacetIndices.length : 0;\n  }\n  /**\n   * Create a visitor for those mesh facets with normal in the same half-space as the given vector.\n   * * For example, to visit the top facets of a tiled terrain mesh but skip the \"skirt\" facets, pass\n   * `compareVector = Vector3d.unitZ()` and a suitable `sideAngle` tolerance. Note that this will also\n   * filter out *interior* facets that are nearly vertical, not just the \"skirt\" facets on the boundary.\n   * @param mesh the mesh from which to select facets\n   * @param compareVector vector to which to compare facet normals. The visitor will visit only those facets\n   * with normals in the same half-space as this vector. Default is 001.\n   * @param sideAngle optional angular tolerance to filter the facets near the border between half-spaces.\n   * The visitor will *not* visit facets whose normals are nearly perpendicular to `compareVector`.\n   * Default is [[Geometry.smallAngleRadians]].\n   * @param numWrap optional number of entries replicated in visitor arrays. Default is 0.\n  */\n  public static createNormalComparison(\n    mesh: IndexedPolyface | IndexedPolyfaceVisitor,\n    compareVector: Vector3d = Vector3d.unitZ(),\n    sideAngle: Angle = Angle.createSmallAngle(),\n    numWrap: number = 0,\n  ): IndexedPolyfaceSubsetVisitor {\n    if (mesh instanceof IndexedPolyface)\n      return this.createNormalComparison(mesh.createVisitor(), compareVector, sideAngle, numWrap);\n    const visitor = mesh;\n    const facets: number[] = [];\n    const facetNormal = Vector3d.createZero();\n    for (visitor.reset(); visitor.moveToNextFacet();) {\n      if (!PolygonOps.unitNormal(visitor.point, facetNormal))\n        continue; // degenerate facet\n      if (facetNormal.dotProduct(compareVector) < 0.0)\n        continue; // ignore facet facing other half-space\n      if (facetNormal.angleFromPerpendicular(compareVector).isMagnitudeLessThanOrEqual(sideAngle))\n        continue; // ignore side facet\n      facets.push(visitor.currentReadIndex());\n    }\n    return IndexedPolyfaceSubsetVisitor.createSubsetVisitor(visitor.clientPolyface(), facets, numWrap);\n  }\n}\n"]}