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

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

@@ -0,0 +1 @@
+{"version":3,"file":"IndexedEdgeMatcher.js","sourceRoot":"","sources":["../../../src/polyface/IndexedEdgeMatcher.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,oEAAoE;AACpE,qBAAqB;AACrB,KAAK;AACL;;;;;;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;YAC1B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;SAC9D;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,YAAY,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IACD,+DAA+D;IACvD,0BAA0B,CAAC,MAAc,EAAE,MAAc,EAAE,IAAuC;QACxG,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,GAAG,MAAM,EAAE;YACzC,IAAI,MAAM,KAAK,MAAM,GAAG,CAAC,EAAE;gBACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;aAC/B;iBAAM;gBACL,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;aACpB;SAEF;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,sBAAsB,CAAC,aAAgD,EAAE,UAA6C,EAAE,SAA4C,EAAE,gBAAmD;QAC9N,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;YACxD,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;gBACtH,aAAa,EAAE,CAAC;aACjB;YACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE;gBACjC,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,SAAS,CAAC,CAAC;aAC5E;iBAAM,IAAI,aAAa,KAAK,CAAC,IAAI,YAAY,CAAC,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;gBACpG,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,aAAa,CAAC,CAAC;aAChF;iBAAM,IAAI,aAAa,KAAK,CAAC,EAAE;gBAC9B,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;aACjE;iBAAM;gBACL,IAAI,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,GAAG,aAAa,EAAE,gBAAgB,CAAC,CAAC;aACnF;SACF;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// For boundary sorting, an edge exists as a (packed!) Float64Array.\r\n// Fixed entries are:\r\n// 0:\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(SortableEdge.lessThan);\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 and other) as a single array `allOther`, create `const allOther = []` as an empty array and call\r\n   * `sortAndCollectClusters (undefined, 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 clusters with 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[] | undefined, nullEdges: SortableEdgeCluster[] | undefined, allOtherClusters: SortableEdgeCluster[] | undefined) {\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"]}

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

@@ -0,0 +1,109 @@
+/** @packageDocumentation
+ * @module Polyface
+ */
+import { Point2d } from "../geometry3d/Point2dVector2d";
+import { PolyfaceData } from "./PolyfaceData";
+import { IndexedPolyface, Polyface, PolyfaceVisitor } from "./Polyface";
+/**
+ * An `IndexedPolyfaceVisitor` is an iterator-like object that "visits" facets of a mesh.
+ * * The visitor extends a `PolyfaceData ` class, so it can at any time hold all the data of a single facet.
+ * @public
+ */
+export declare class IndexedPolyfaceVisitor extends PolyfaceData implements PolyfaceVisitor {
+    private _currentFacetIndex;
+    private _nextFacetIndex;
+    private _numWrap;
+    private _numEdges;
+    private _polyface;
+    protected constructor(facets: IndexedPolyface, numWrap: number);
+    /** Return the client polyface object. */
+    clientPolyface(): Polyface;
+    /** Set the number of vertices duplicated (e.g. 1 for start and end) in arrays in the visitor. */
+    setNumWrap(numWrap: number): void;
+    /** Return the number of edges in the current facet.
+     * * Not that if this visitor has `numWrap` greater than zero, the number of edges is smaller than the number of points.
+     */
+    get numEdgesThisFacet(): number;
+    /** Create a visitor for iterating the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays
+     * Typical wrap counts are:
+     * * 0 -- leave the point arrays with "missing final edge"
+     * * 1 -- add point 0 as closure point
+     * * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.
+     */
+    static create(polyface: IndexedPolyface, numWrap: number): IndexedPolyfaceVisitor;
+    /** Advance the iterator to a particular facet in the client polyface */
+    moveToReadIndex(facetIndex: number): boolean;
+    /** Advance the iterator to a the 'next' facet in the client polyface */
+    moveToNextFacet(): boolean;
+    /** Reset the iterator to start at the first facet of the polyface. */
+    reset(): void;
+    /**
+     * Attempts to extract the distance parameter for the given vertex index on the current facet
+     * Returns the distance parameter as a point. Returns undefined on failure.
+     */
+    tryGetDistanceParameter(index: number, result?: Point2d): Point2d | undefined;
+    /**
+     * Attempts to extract the normalized parameter (0,1) for the given vertex index on the current facet.
+     * 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 */
+    currentReadIndex(): number;
+    /** Return the point index of vertex i within the currently loaded facet */
+    clientPointIndex(i: number): number;
+    /** Return the param index of vertex i within the currently loaded facet */
+    clientParamIndex(i: number): number;
+    /** Return the normal index of vertex i within the currently loaded facet */
+    clientNormalIndex(i: number): number;
+    /** Return the color index of vertex i within the currently loaded facet */
+    clientColorIndex(i: number): number;
+    /** Return the aux data index of vertex i within the currently loaded facet */
+    clientAuxIndex(i: number): number;
+    /** clear the contents of all arrays.  Use this along with transferDataFrom methods to build up new facets */
+    clearArrays(): void;
+    /** transfer data from a specified index of the other visitor as new data in this visitor. */
+    pushDataFrom(other: PolyfaceVisitor, index: number): void;
+    /** transfer interpolated data from the other visitor.
+     * * all data values are interpolated at `fraction` between `other` values at index0 and index1.
+     */
+    pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void;
+}
+/**
+ * Interpolate each byte of color0 and color1 as integers.
+ * @param color0 32 bit color (e.g. rgb+transparency)
+ * @param fraction fractional position.  This is clamped to 0..1 to prevent byte values outside their 0..255 range.
+ * @param color1
+ * @param shiftBits
+ * @internal
+ */
+export declare function interpolateColor(color0: number, fraction: number, color1: number): number;
+/**
+ * An `IndexedPolyfaceSubsetVisitor` is an IndexedPolyfaceVisitor which only visits a subset of facets in the polyface.
+ * * The subset is defined by an array of facet indices provided when this visitor is created.
+ * * Within the subset visitor, "facetIndex" is understood as index within the subset array:
+ *   * moveToNextFacet moves only within the subset
+ *   * moveToReadIndex(i) moves underlying visitor's parentFacetIndex(i)
+ * @public
+ */
+export declare class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {
+    private _parentFacetIndices;
+    private _nextActiveIndex;
+    private constructor();
+    /** Create a visitor for iterating a subset of the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays
+     * * Typical wrap counts are:
+     *   * 0 -- leave the point arrays with "missing final edge"
+     *   * 1 -- add point 0 as closure point
+     *   * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.
+     * * The activeFacetIndices array indicates all facets to be visited.
+     */
+    static createSubsetVisitor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number): IndexedPolyfaceSubsetVisitor;
+    /** Advance the iterator to a particular facet in the client polyface */
+    moveToReadIndex(activeIndex: number): boolean;
+    /** Advance the iterator to a the 'next' facet in the client polyface */
+    moveToNextFacet(): boolean;
+    /** Reset the iterator to start at the first facet of the polyface. */
+    reset(): void;
+    /** return the parent facet index of the indicated index within the active facets */
+    parentFacetIndex(activeIndex: number): number | undefined;
+}
+//# sourceMappingURL=IndexedPolyfaceVisitor.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"IndexedPolyfaceVisitor.d.ts","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceVisitor.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAGxE;;;;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,MAAM,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM;IAa9D,yCAAyC;IAClC,cAAc,IAAI,QAAQ;IACjC,iGAAiG;IAC1F,UAAU,CAAC,OAAO,EAAE,MAAM;IAEjC;;OAEG;IACH,IAAW,iBAAiB,IAAI,MAAM,CAA2B;IACjE;;;;;OAKG;WACW,MAAM,CAAC,QAAQ,EAAE,eAAe,EAAE,OAAO,EAAE,MAAM,GAAG,sBAAsB;IAGxF,wEAAwE;IACjE,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAUnD,wEAAwE;IACjE,eAAe,IAAI,OAAO;IAOjC,sEAAsE;IAC/D,KAAK,IAAI,IAAI;IAKpB;;;OAGG;IACI,uBAAuB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAapF;;;OAGG;IACI,yBAAyB,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS;IAYtF,qEAAqE;IAC9D,gBAAgB,IAAI,MAAM;IACjC,2EAA2E;IACpE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAC1C,2EAA2E;IACpE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAC1C,4EAA4E;IACrE,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAC3C,2EAA2E;IACpE,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAC1C,8EAA8E;IACvE,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAExC,6GAA6G;IACtG,WAAW,IAAI,IAAI;IAU1B,6FAA6F;IACtF,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAShE;;OAEG;IACI,wBAAwB,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAUhH;AAoBD;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,UAgBhF;AAED;;;;;;;GAOG;AACH,qBAAa,4BAA6B,SAAQ,sBAAsB;IACtE,OAAO,CAAC,mBAAmB,CAAW;IAEtC,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO;IAKP;;;;;;OAMG;WACW,mBAAmB,CAAC,QAAQ,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,4BAA4B;IAGzI,wEAAwE;IACxD,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAO7D,wEAAwE;IACxD,eAAe,IAAI,OAAO;IAU1C,sEAAsE;IACtD,KAAK,IAAI,IAAI;IAG7B,oFAAoF;IAC7E,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;CAMjE"}

package/lib/esm/polyface/IndexedPolyfaceVisitor.js

@@ -0,0 +1,237 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { PolyfaceData } from "./PolyfaceData";
+import { Geometry } from "../Geometry";
+/* eslint-disable @itwin/prefer-get */
+/**
+ * An `IndexedPolyfaceVisitor` is an iterator-like object that "visits" facets of a mesh.
+ * * The visitor extends a `PolyfaceData ` class, so it can at any time hold all the data of a single facet.
+ * @public
+ */
+export class IndexedPolyfaceVisitor extends PolyfaceData {
+    // to be called from static factory method that validates the polyface ...
+    constructor(facets, numWrap) {
+        super(facets.data.normalCount > 0, facets.data.paramCount > 0, facets.data.colorCount > 0, facets.twoSided);
+        this._polyface = facets;
+        this._numWrap = numWrap;
+        if (facets.data.auxData)
+            this.auxData = facets.data.auxData.createForVisitor();
+        this.reset();
+        this._numEdges = 0;
+        this._nextFacetIndex = 0;
+        this._currentFacetIndex = -1;
+    }
+    /** Return the client polyface object. */
+    clientPolyface() { return this._polyface; }
+    /** Set the number of vertices duplicated (e.g. 1 for start and end) in arrays in the visitor. */
+    setNumWrap(numWrap) { this._numWrap = numWrap; }
+    /** Return the number of edges in the current facet.
+     * * Not that if this visitor has `numWrap` greater than zero, the number of edges is smaller than the number of points.
+     */
+    get numEdgesThisFacet() { return this._numEdges; }
+    /** Create a visitor for iterating the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays
+     * Typical wrap counts are:
+     * * 0 -- leave the point arrays with "missing final edge"
+     * * 1 -- add point 0 as closure point
+     * * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.
+     */
+    static create(polyface, numWrap) {
+        return new IndexedPolyfaceVisitor(polyface, numWrap);
+    }
+    /** Advance the iterator to a particular facet in the client polyface */
+    moveToReadIndex(facetIndex) {
+        if (!this._polyface.isValidFacetIndex(facetIndex))
+            return false;
+        this._currentFacetIndex = facetIndex;
+        this._nextFacetIndex = facetIndex + 1;
+        this._numEdges = this._polyface.numEdgeInFacet(facetIndex);
+        this.resizeAllDataArrays(this._numEdges + this._numWrap);
+        this.gatherIndexedData(this._polyface.data, this._polyface.facetIndex0(this._currentFacetIndex), this._polyface.facetIndex1(this._currentFacetIndex), this._numWrap);
+        return true;
+    }
+    /** Advance the iterator to a the 'next' facet in the client polyface */
+    moveToNextFacet() {
+        if (this._nextFacetIndex !== this._currentFacetIndex)
+            return this.moveToReadIndex(this._nextFacetIndex);
+        this._nextFacetIndex++;
+        return true;
+    }
+    /** Reset the iterator to start at the first facet of the polyface. */
+    reset() {
+        this.moveToReadIndex(0);
+        this._nextFacetIndex = 0; // so immediate moveToNextFacet stays here.
+    }
+    /**
+     * Attempts to extract the distance parameter for the given vertex index on the current facet
+     * Returns the distance parameter as a point. Returns undefined on failure.
+     */
+    tryGetDistanceParameter(index, result) {
+        if (index >= this.numEdgesThisFacet)
+            return undefined;
+        if (this.param === undefined || this._polyface.data.face.length === 0)
+            return undefined;
+        const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);
+        if (!faceData)
+            return undefined;
+        return faceData.convertParamXYToDistance(this.param.getXAtUncheckedPointIndex(index), this.param.getYAtUncheckedPointIndex(index), result);
+    }
+    /**
+     * Attempts to extract the normalized parameter (0,1) for the given vertex index on the current facet.
+     * Returns the normalized parameter as a point. Returns undefined on failure.
+     */
+    tryGetNormalizedParameter(index, result) {
+        if (index >= this.numEdgesThisFacet)
+            return undefined;
+        if (this.param === undefined || this._polyface.data.face.length === 0)
+            return undefined;
+        const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);
+        if (!faceData)
+            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 */
+    currentReadIndex() { return this._currentFacetIndex; }
+    /** Return the point index of vertex i within the currently loaded facet */
+    clientPointIndex(i) { return this.pointIndex[i]; }
+    /** Return the param index of vertex i within the currently loaded facet */
+    clientParamIndex(i) { return this.paramIndex ? this.paramIndex[i] : -1; }
+    /** Return the normal index of vertex i within the currently loaded facet */
+    clientNormalIndex(i) { return this.normalIndex ? this.normalIndex[i] : -1; }
+    /** Return the color index of vertex i within the currently loaded facet */
+    clientColorIndex(i) { return this.colorIndex ? this.colorIndex[i] : -1; }
+    /** Return the aux data index of vertex i within the currently loaded facet */
+    clientAuxIndex(i) { return this.auxData ? this.auxData.indices[i] : -1; }
+    /** clear the contents of all arrays.  Use this along with transferDataFrom methods to build up new facets */
+    clearArrays() {
+        if (this.point !== undefined)
+            this.point.length = 0;
+        if (this.param !== undefined)
+            this.param.length = 0;
+        if (this.normal !== undefined)
+            this.normal.length = 0;
+        if (this.color !== undefined)
+            this.color.length = 0;
+    }
+    /** transfer data from a specified index of the other visitor as new data in this visitor. */
+    pushDataFrom(other, index) {
+        this.point.pushFromGrowableXYZArray(other.point, index);
+        if (this.color && other.color && index < other.color.length)
+            this.color.push(other.color[index]);
+        if (this.param && other.param && index < other.param.length)
+            this.param.pushFromGrowableXYArray(other.param, index);
+        if (this.normal && other.normal && index < other.normal.length)
+            this.normal.pushFromGrowableXYZArray(other.normal, index);
+    }
+    /** transfer interpolated data from the other visitor.
+     * * all data values are interpolated at `fraction` between `other` values at index0 and index1.
+     */
+    pushInterpolatedDataFrom(other, index0, fraction, index1) {
+        this.point.pushInterpolatedFromGrowableXYZArray(other.point, index0, fraction, index1);
+        if (this.color && other.color && index0 < other.color.length && index1 < other.color.length)
+            this.color.push(interpolateColor(other.color[index0], fraction, other.color[index1]));
+        if (this.param && other.param && index0 < other.param.length && index1 < other.param.length)
+            this.param.pushInterpolatedFromGrowableXYArray(other.param, index0, fraction, index1);
+        if (this.normal && other.normal && index0 < other.normal.length && index1 < other.normal.length)
+            this.normal.pushInterpolatedFromGrowableXYZArray(other.normal, index0, fraction, index1);
+    }
+}
+/**
+ * * shift to right by shiftBits.
+ * * mask off the low 8 bits
+ * * interpolate the number
+ * * truncate to floor
+ * * shift left
+ * * Hence all numbers in and out of the floating point are 0..255.
+ * @param color0
+ * @param fraction
+ * @param color1
+ * @param shiftBits
+ */
+function interpolateByte(color0, fraction, color1, shiftBits) {
+    color0 = (color0 >>> shiftBits) & 0xFF;
+    color1 = (color1 >>> shiftBits) & 0xFF;
+    const color = Math.floor(color0 + fraction * (color1 - color0)) & 0xFF;
+    return color << shiftBits;
+}
+/**
+ * Interpolate each byte of color0 and color1 as integers.
+ * @param color0 32 bit color (e.g. rgb+transparency)
+ * @param fraction fractional position.  This is clamped to 0..1 to prevent byte values outside their 0..255 range.
+ * @param color1
+ * @param shiftBits
+ * @internal
+ */
+export function interpolateColor(color0, fraction, color1) {
+    // don't allow fractions outside the individual byte ranges.
+    fraction = Geometry.clamp(fraction, 0, 1);
+    // interpolate each byte in place ....
+    /*
+    const byte0 = interpolateLowByte(color0 & 0xFF, fraction, color1 & 0xFF);
+    const byte1 = interpolateLowByte((color0 & 0xFF00) >>> 8, fraction, (color1 & 0xFF00) >>> 8) << 8;
+    const byte2 = interpolateLowByte((color0 & 0xFF0000) >>> 16, fraction, (color1 & 0xFF0000) >>> 16) << 16;
+    const byte3 = interpolateLowByte((color0 & 0xFF000000) >>> 24, fraction, (color1 & 0xFF000000) >>> 24) << 24;
+    */
+    const byte0 = interpolateByte(color0, fraction, color1, 0);
+    const byte1 = interpolateByte(color0, fraction, color1, 8);
+    const byte2 = interpolateByte(color0, fraction, color1, 16);
+    const byte3 = interpolateByte(color0, fraction, color1, 24);
+    return (byte0 | byte1 | byte2 | byte3);
+}
+/**
+ * An `IndexedPolyfaceSubsetVisitor` is an IndexedPolyfaceVisitor which only visits a subset of facets in the polyface.
+ * * The subset is defined by an array of facet indices provided when this visitor is created.
+ * * Within the subset visitor, "facetIndex" is understood as index within the subset array:
+ *   * moveToNextFacet moves only within the subset
+ *   * moveToReadIndex(i) moves underlying visitor's parentFacetIndex(i)
+ * @public
+ */
+export class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {
+    constructor(polyface, activeFacetIndices, numWrap) {
+        super(polyface, numWrap);
+        this._parentFacetIndices = activeFacetIndices.slice();
+        this._nextActiveIndex = 0;
+    }
+    /** Create a visitor for iterating a subset of the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays
+     * * Typical wrap counts are:
+     *   * 0 -- leave the point arrays with "missing final edge"
+     *   * 1 -- add point 0 as closure point
+     *   * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.
+     * * The activeFacetIndices array indicates all facets to be visited.
+     */
+    static createSubsetVisitor(polyface, activeFacetIndices, numWrap) {
+        return new IndexedPolyfaceSubsetVisitor(polyface, activeFacetIndices.slice(), numWrap);
+    }
+    /** Advance the iterator to a particular facet in the client polyface */
+    moveToReadIndex(activeIndex) {
+        if (activeIndex >= 0 && activeIndex <= this._parentFacetIndices.length) {
+            this._nextActiveIndex = activeIndex;
+            return super.moveToReadIndex(this._parentFacetIndices[activeIndex++]);
+        }
+        return false;
+    }
+    /** Advance the iterator to a the 'next' facet in the client polyface */
+    moveToNextFacet() {
+        if (this._nextActiveIndex < this._parentFacetIndices.length) {
+            const result = this.moveToReadIndex(this._nextActiveIndex);
+            if (result) {
+                this._nextActiveIndex++;
+                return true;
+            }
+        }
+        return false;
+    }
+    /** Reset the iterator to start at the first facet of the polyface. */
+    reset() {
+        this._nextActiveIndex = 0;
+    }
+    /** return the parent facet index of the indicated index within the active facets */
+    parentFacetIndex(activeIndex) {
+        if (activeIndex >= 0 && activeIndex <= this._nextActiveIndex) {
+            return this._parentFacetIndices[activeIndex];
+        }
+        return undefined;
+    }
+}
+//# sourceMappingURL=IndexedPolyfaceVisitor.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"IndexedPolyfaceVisitor.js","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceVisitor.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAM/F,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,sCAAsC;AACtC;;;;GAIG;AACH,MAAM,OAAO,sBAAuB,SAAQ,YAAY;IAMtD,0EAA0E;IAC1E,YAAsB,MAAuB,EAAE,OAAe;QAC5D,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC5G,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO;YACrB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAExD,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,KAAe,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5D,iGAAiG;IAC1F,UAAU,CAAC,OAAe,IAAI,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC,CAAC;IAE/D;;OAEG;IACH,IAAW,iBAAiB,KAAa,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,QAAyB,EAAE,OAAe;QAC7D,OAAO,IAAI,sBAAsB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IACvD,CAAC;IACD,wEAAwE;IACjE,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,mBAAmB,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrK,OAAO,IAAI,CAAC;IACd,CAAC;IACD,wEAAwE;IACjE,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;IAED,sEAAsE;IAC/D,KAAK;QACV,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC,2CAA2C;IACvE,CAAC;IAED;;;OAGG;IACI,uBAAuB,CAAC,KAAa,EAAE,MAAgB;QAC5D,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YACjC,OAAO,SAAS,CAAC;QAEnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QAEnB,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,CAAC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7I,CAAC;IAED;;;OAGG;IACI,yBAAyB,CAAC,KAAa,EAAE,MAAgB;QAC9D,IAAI,KAAK,IAAI,IAAI,CAAC,iBAAiB;YACjC,OAAO,SAAS,CAAC;QAEnB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YACnE,OAAO,SAAS,CAAC;QAEnB,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,CAAC,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,yBAAyB,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IAC/I,CAAC;IACD,qEAAqE;IAC9D,gBAAgB,KAAa,OAAO,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;IACrE,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,4EAA4E;IACrE,iBAAiB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnG,2EAA2E;IACpE,gBAAgB,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChG,8EAA8E;IACvE,cAAc,CAAC,CAAS,IAAY,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhG,6GAA6G;IACtG,WAAW;QAChB,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAC1B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,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;IAC1B,CAAC;IACD,6FAA6F;IACtF,YAAY,CAAC,KAAsB,EAAE,KAAa;QACvD,IAAI,CAAC,KAAK,CAAC,wBAAwB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACxD,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,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;IAC9D,CAAC;IACD;;OAEG;IACI,wBAAwB,CAAC,KAAsB,EAAE,MAAc,EAAE,QAAgB,EAAE,MAAc;QACtG,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QACvF,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,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxF,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;IAC7F,CAAC;CAEF;AACD;;;;;;;;;;;GAWG;AACH,SAAS,eAAe,CAAC,MAAc,EAAE,QAAgB,EAAE,MAAc,EAAE,SAAiB;IAC1F,MAAM,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC;IACvC,MAAM,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,GAAG,IAAI,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,GAAG,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC;IACvE,OAAO,KAAK,IAAI,SAAS,CAAC;AAC5B,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,MAAc,EAAE,QAAgB,EAAE,MAAc;IAC/E,4DAA4D;IAC5D,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,sCAAsC;IACtC;;;;;MAKE;IACF,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC;IAE5D,OAAO,CAAC,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC;AACzC,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,4BAA6B,SAAQ,sBAAsB;IAItE,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,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,mBAAmB,CAAC,QAAyB,EAAE,kBAA4B,EAAE,OAAe;QACxG,OAAO,IAAI,4BAA4B,CAAC,QAAQ,EAAE,kBAAkB,CAAC,KAAK,EAAE,EAAE,OAAO,CAAC,CAAC;IACzF,CAAC;IACD,wEAAwE;IACxD,eAAe,CAAC,WAAmB;QACjD,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,IAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE;YACtE,IAAI,CAAC,gBAAgB,GAAG,WAAW,CAAC;YACpC,OAAO,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,mBAAmB,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;SACvE;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,eAAe;QAC7B,IAAI,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE;YAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAC3D,IAAI,MAAM,EAAE;gBACV,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACxB,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,sEAAsE;IACtD,KAAK;QACnB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,oFAAoF;IAC7E,gBAAgB,CAAC,WAAmB;QACzC,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,IAAI,IAAI,CAAC,gBAAgB,EAAE;YAC5D,OAAO,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,CAAC;SAC9C;QACD,OAAO,SAAS,CAAC;IACnB,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\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { PolyfaceData } from \"./PolyfaceData\";\r\nimport { IndexedPolyface, Polyface, PolyfaceVisitor } from \"./Polyface\";\r\nimport { Geometry } from \"../Geometry\";\r\n/* eslint-disable @itwin/prefer-get */\r\n/**\r\n * An `IndexedPolyfaceVisitor` is an iterator-like object that \"visits\" facets of a mesh.\r\n * * The visitor extends a `PolyfaceData ` class, 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(facets: IndexedPolyface, numWrap: number) {\r\n    super(facets.data.normalCount > 0, facets.data.paramCount > 0, facets.data.colorCount > 0, facets.twoSided);\r\n    this._polyface = facets;\r\n    this._numWrap = numWrap;\r\n    if (facets.data.auxData)\r\n      this.auxData = facets.data.auxData.createForVisitor();\r\n\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(): Polyface { return this._polyface; }\r\n  /** Set the number of vertices duplicated (e.g. 1 for start and end) in arrays in the visitor. */\r\n  public setNumWrap(numWrap: number) { this._numWrap = numWrap; }\r\n\r\n  /** Return the number of edges in the current facet.\r\n   * * Not that if this visitor has `numWrap` greater than zero, the number of edges is smaller than the number of points.\r\n   */\r\n  public get numEdgesThisFacet(): number { return this._numEdges; }\r\n  /** Create a visitor for iterating the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays\r\n   * Typical wrap counts are:\r\n   * * 0 -- leave the point arrays with \"missing final edge\"\r\n   * * 1 -- add point 0 as closure point\r\n   * * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.\r\n   */\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.resizeAllDataArrays(this._numEdges + this._numWrap);\r\n    this.gatherIndexedData(this._polyface.data, this._polyface.facetIndex0(this._currentFacetIndex), this._polyface.facetIndex1(this._currentFacetIndex), this._numWrap);\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\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  /**\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 >= this.numEdgesThisFacet)\r\n      return undefined;\r\n\r\n    if (this.param === undefined || this._polyface.data.face.length === 0)\r\n      return undefined;\r\n\r\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\r\n    if (!faceData)\r\n      return undefined;\r\n    return faceData.convertParamXYToDistance(this.param.getXAtUncheckedPointIndex(index), this.param.getYAtUncheckedPointIndex(index), 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 >= this.numEdgesThisFacet)\r\n      return undefined;\r\n\r\n    if (this.param === undefined || this._polyface.data.face.length === 0)\r\n      return undefined;\r\n\r\n    const faceData = this._polyface.tryGetFaceData(this._currentFacetIndex);\r\n    if (!faceData)\r\n      return undefined;\r\n    return faceData.convertParamXYToNormalized(this.param.getXAtUncheckedPointIndex(index), this.param.getYAtUncheckedPointIndex(index), result);\r\n  }\r\n  /** Return the index (in the client polyface) of the current facet */\r\n  public currentReadIndex(): number { return this._currentFacetIndex; }\r\n  /** Return the point index of vertex i within the currently loaded facet */\r\n  public clientPointIndex(i: number): number { return this.pointIndex[i]; }\r\n  /** Return the param index of vertex i within the currently loaded facet */\r\n  public clientParamIndex(i: number): number { return this.paramIndex ? this.paramIndex[i] : -1; }\r\n  /** Return the normal index of vertex i within the currently loaded facet */\r\n  public clientNormalIndex(i: number): number { return this.normalIndex ? this.normalIndex[i] : -1; }\r\n  /** Return the color index of vertex i within the currently loaded facet */\r\n  public clientColorIndex(i: number): number { return this.colorIndex ? this.colorIndex[i] : -1; }\r\n  /** Return the aux data index of vertex i within the currently loaded facet */\r\n  public clientAuxIndex(i: number): number { return this.auxData ? this.auxData.indices[i] : -1; }\r\n\r\n  /** clear the contents of all arrays.  Use this along with transferDataFrom methods to build up new facets */\r\n  public clearArrays(): void {\r\n    if (this.point !== undefined)\r\n      this.point.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  }\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    if (this.color && other.color && index < other.color.length)\r\n      this.color.push(other.color[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  }\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    this.point.pushInterpolatedFromGrowableXYZArray(other.point, index0, fraction, index1);\r\n    if (this.color && other.color && index0 < other.color.length && index1 < other.color.length)\r\n      this.color.push(interpolateColor(other.color[index0], fraction, other.color[index1]));\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  }\r\n\r\n}\r\n/**\r\n * * shift to right by shiftBits.\r\n * * mask off the low 8 bits\r\n * * interpolate the number\r\n * * truncate to floor\r\n * * shift left\r\n * * Hence all numbers in and out of the floating point are 0..255.\r\n * @param color0\r\n * @param fraction\r\n * @param color1\r\n * @param shiftBits\r\n */\r\nfunction interpolateByte(color0: number, fraction: number, color1: number, shiftBits: number): number {\r\n  color0 = (color0 >>> shiftBits) & 0xFF;\r\n  color1 = (color1 >>> shiftBits) & 0xFF;\r\n  const color = Math.floor(color0 + fraction * (color1 - color0)) & 0xFF;\r\n  return color << shiftBits;\r\n}\r\n\r\n/**\r\n * Interpolate each byte of color0 and color1 as integers.\r\n * @param color0 32 bit color (e.g. rgb+transparency)\r\n * @param fraction fractional position.  This is clamped to 0..1 to prevent byte values outside their 0..255 range.\r\n * @param color1\r\n * @param shiftBits\r\n * @internal\r\n */\r\nexport function interpolateColor(color0: number, fraction: number, color1: number) {\r\n  // don't allow fractions outside the individual byte ranges.\r\n  fraction = Geometry.clamp(fraction, 0, 1);\r\n  // interpolate each byte in place ....\r\n  /*\r\n  const byte0 = interpolateLowByte(color0 & 0xFF, fraction, color1 & 0xFF);\r\n  const byte1 = interpolateLowByte((color0 & 0xFF00) >>> 8, fraction, (color1 & 0xFF00) >>> 8) << 8;\r\n  const byte2 = interpolateLowByte((color0 & 0xFF0000) >>> 16, fraction, (color1 & 0xFF0000) >>> 16) << 16;\r\n  const byte3 = interpolateLowByte((color0 & 0xFF000000) >>> 24, fraction, (color1 & 0xFF000000) >>> 24) << 24;\r\n  */\r\n  const byte0 = interpolateByte(color0, fraction, color1, 0);\r\n  const byte1 = interpolateByte(color0, fraction, color1, 8);\r\n  const byte2 = interpolateByte(color0, fraction, color1, 16);\r\n  const byte3 = interpolateByte(color0, fraction, color1, 24);\r\n\r\n  return (byte0 | byte1 | byte2 | byte3);\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 * * Within the subset visitor, \"facetIndex\" is understood as index within the subset array:\r\n *   * moveToNextFacet moves only within the subset\r\n *   * moveToReadIndex(i) moves underlying visitor's parentFacetIndex(i)\r\n * @public\r\n */\r\nexport class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {\r\n  private _parentFacetIndices: number[];\r\n  // index WITHIN THE _activeFacetIndices array.\r\n  private _nextActiveIndex: number;\r\n  private constructor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number) {\r\n    super(polyface, numWrap);\r\n    this._parentFacetIndices = activeFacetIndices.slice();\r\n    this._nextActiveIndex = 0;\r\n  }\r\n  /** Create a visitor for iterating a subset of the facets of `polyface`, with indicated number of points to be added to each facet to produce closed point arrays\r\n   * * Typical wrap counts are:\r\n   *   * 0 -- leave the point arrays with \"missing final edge\"\r\n   *   * 1 -- add point 0 as closure point\r\n   *   * 2 -- add points 0 and 1 as closure and wrap point.  This is useful when vertex visit requires two adjacent vectors, e.g. for cross products.\r\n   * * The activeFacetIndices array indicates all facets to be visited.\r\n   */\r\n  public static createSubsetVisitor(polyface: IndexedPolyface, activeFacetIndices: number[], numWrap: number): IndexedPolyfaceSubsetVisitor {\r\n    return new IndexedPolyfaceSubsetVisitor(polyface, activeFacetIndices.slice(), numWrap);\r\n  }\r\n  /** Advance the iterator to a particular facet in the client polyface */\r\n  public override moveToReadIndex(activeIndex: number): boolean {\r\n    if (activeIndex >= 0 && activeIndex <= this._parentFacetIndices.length) {\r\n      this._nextActiveIndex = activeIndex;\r\n      return super.moveToReadIndex(this._parentFacetIndices[activeIndex++]);\r\n    }\r\n    return false;\r\n  }\r\n  /** Advance the iterator to a the 'next' facet in the client polyface */\r\n  public override moveToNextFacet(): boolean {\r\n    if (this._nextActiveIndex < this._parentFacetIndices.length) {\r\n      const result = this.moveToReadIndex(this._nextActiveIndex);\r\n      if (result) {\r\n        this._nextActiveIndex++;\r\n        return true;\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** Reset the iterator to start at the first facet of the polyface. */\r\n  public override reset(): void {\r\n    this._nextActiveIndex = 0;\r\n  }\r\n  /** return the parent facet index of the indicated index within the active facets */\r\n  public parentFacetIndex(activeIndex: number): number | undefined {\r\n    if (activeIndex >= 0 && activeIndex <= this._nextActiveIndex) {\r\n      return this._parentFacetIndices[activeIndex];\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n"]}