@itwin/core-geometry 5.1.0-dev.9 → 5.2.0-dev.1

package/lib/esm/polyface/IndexedPolyfaceVisitor.js

@@ -31,10 +31,10 @@ export class IndexedPolyfaceVisitor extends PolyfaceData {
             this.auxData = polyface.data.auxData.createForVisitor();
         if (polyface.data.edgeMateIndex)
             this.edgeMateIndex = [];
-        this.reset();
         this._numEdges = 0;
         this._nextFacetIndex = 0;
         this._currentFacetIndex = -1;
+        this.reset();
     }
     /** Return the client polyface object. */
     clientPolyface() {
@@ -71,11 +71,14 @@ export class IndexedPolyfaceVisitor extends PolyfaceData {
     moveToReadIndex(facetIndex) {
         if (!this._polyface.isValidFacetIndex(facetIndex))
             return false;
-        this._currentFacetIndex = facetIndex;
+        const numEdges = this._polyface.numEdgeInFacet(facetIndex);
+        if (this._currentFacetIndex !== facetIndex || numEdges + this._numWrap !== this.pointCount) {
+            this._currentFacetIndex = facetIndex;
+            this._numEdges = numEdges;
+            this.resizeAllArrays(this._numEdges + this._numWrap);
+            this.gatherIndexedData(this._polyface.data, this._polyface.facetIndex0(this._currentFacetIndex), this._polyface.facetIndex1(this._currentFacetIndex), this._numWrap);
+        }
         this._nextFacetIndex = facetIndex + 1;
-        this._numEdges = this._polyface.numEdgeInFacet(facetIndex);
-        this.resizeAllArrays(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. */
@@ -85,7 +88,7 @@ export class IndexedPolyfaceVisitor extends PolyfaceData {
         this._nextFacetIndex++;
         return true;
     }
-    /** Reset the iterator to start at the first facet of the polyface. */
+    /** Restart the visitor at the first facet. */
     reset() {
         this.moveToReadIndex(0);
         this._nextFacetIndex = 0; // so immediate moveToNextFacet stays here.
@@ -184,6 +187,10 @@ export class IndexedPolyfaceVisitor extends PolyfaceData {
             this.color.push(Geometry.interpolateColor(other.color[index0], fraction, other.color[index1]));
         // TODO: auxData? taggedNumericData?
     }
+    /** Create a visitor for a subset of the facets visitable by the instance. */
+    createSubsetVisitor(facetIndices, numWrap = 0) {
+        return IndexedPolyfaceSubsetVisitor.createSubsetVisitor(this._polyface, facetIndices, numWrap);
+    }
 }
 /**
  * An `IndexedPolyfaceSubsetVisitor` is an `IndexedPolyfaceVisitor` which only visits a subset of facets in the polyface.
@@ -192,38 +199,38 @@ 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) {
+    _facetIndices;
+    _currentSubsetIndex; // index within _facetIndices
+    _nextSubsetIndex; // index within _facetIndices
+    constructor(polyface, facetIndices, numWrap) {
         super(polyface, numWrap);
-        this._parentFacetIndices = activeFacetIndices.slice();
-        this._currentActiveIndex = -1;
-        this._nextActiveIndex = 0;
+        this._facetIndices = facetIndices.slice();
+        this._currentSubsetIndex = -1;
+        this._nextSubsetIndex = 0;
+        this.reset();
     }
     isValidSubsetIndex(index) {
-        return (undefined !== this._parentFacetIndices) && index >= 0 && index < this._parentFacetIndices.length;
+        return index >= 0 && index < this._facetIndices.length;
     }
     /**
      * Create a visitor for iterating a subset of the facets of `polyface`.
      * @param polyface reference to the client polyface, supplying facets
-     * @param activeFacetIndices array of indices of facets in the client polyface to visit. This array is cloned.
+     * @param facetIndices array of indices of facets in the client polyface to visit. This array is cloned.
      * @param numWrap number of vertices replicated in the visitor arrays to facilitate simpler caller code. Default is zero.
      */
-    static createSubsetVisitor(polyface, activeFacetIndices, numWrap = 0) {
-        return new IndexedPolyfaceSubsetVisitor(polyface, activeFacetIndices, numWrap);
+    static createSubsetVisitor(polyface, facetIndices, numWrap = 0) {
+        return new IndexedPolyfaceSubsetVisitor(polyface, facetIndices, numWrap);
     }
     /**
      * 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 subsetIndex index into the subset array, not to be confused with the client facet index.
      * @return whether the iterator was successfully moved.
      */
-    moveToReadIndex(activeIndex) {
-        if (this.isValidSubsetIndex(activeIndex)) {
-            this._currentActiveIndex = activeIndex;
-            this._nextActiveIndex = activeIndex + 1;
-            return super.moveToReadIndex(this._parentFacetIndices[activeIndex]);
+    moveToReadIndex(subsetIndex) {
+        if (this.isValidSubsetIndex(subsetIndex)) {
+            this._currentSubsetIndex = subsetIndex;
+            this._nextSubsetIndex = subsetIndex + 1;
+            return super.moveToReadIndex(this._facetIndices[subsetIndex]);
         }
         return false;
     }
@@ -232,29 +239,31 @@ export class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {
      * @return whether the iterator was successfully moved.
      */
     moveToNextFacet() {
-        if (this._nextActiveIndex !== this._currentActiveIndex)
-            return this.moveToReadIndex(this._nextActiveIndex);
-        this._nextActiveIndex++;
+        if (this._nextSubsetIndex !== this._currentSubsetIndex)
+            return this.moveToReadIndex(this._nextSubsetIndex);
+        this._nextSubsetIndex++;
         return true;
     }
-    /** Reset the iterator to start at the first active facet in the subset of client polyface facets. */
+    /** Restart the visitor at the first facet. */
     reset() {
-        this.moveToReadIndex(0);
-        this._nextActiveIndex = 0; // so immediate moveToNextFacet stays here.
+        if (this._facetIndices) { // avoid crash during super ctor when we aren't yet initialized
+            this.moveToReadIndex(0);
+            this._nextSubsetIndex = 0; // so immediate moveToNextFacet stays here.
+        }
     }
     /**
-     * Return the parent facet index of the indicated index within the subset of client polyface facets.
-     * @param activeIndex index of the facet within the subset. Default is the active facet.
-     * @return valid client polyface facet index, or `undefined` if invalid input index.
+     * Return the client polyface facet index (aka "readIndex") for the given subset index.
+     * @param subsetIndex index into the subset array. Default is the subset index of the currently visited facet.
+     * @return valid client polyface facet index, or `undefined` if invalid subset index.
      */
-    parentFacetIndex(activeIndex) {
-        if (undefined === activeIndex)
-            activeIndex = this._currentActiveIndex;
-        return this.isValidSubsetIndex(activeIndex) ? this._parentFacetIndices[activeIndex] : undefined;
+    parentFacetIndex(subsetIndex) {
+        if (undefined === subsetIndex)
+            subsetIndex = this._currentSubsetIndex;
+        return this.isValidSubsetIndex(subsetIndex) ? this._facetIndices[subsetIndex] : undefined;
     }
     /** Return the number of facets this visitor is able to visit. */
     getVisitableFacetCount() {
-        return this._parentFacetIndices ? this._parentFacetIndices.length : 0;
+        return this._facetIndices.length;
     }
     /**
      * Create a visitor for those mesh facets with normal in the same half-space as the given vector.

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;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,QAAQ,CAAC,IAAI,CAAC,aAAa;YAC7B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QAC1B,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,6CAA6C;IACtC,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,oCAAoC;IACtC,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,oCAAoC;IACtC,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    if (polyface.data.edgeMateIndex)\n      this.edgeMateIndex = [];\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 the data 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: 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: 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"]}
+{"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,QAAQ,CAAC,IAAI,CAAC,aAAa;YAC7B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,kBAAkB,GAAG,CAAC,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,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,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QAC3D,IAAI,IAAI,CAAC,kBAAkB,KAAK,UAAU,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YAC3F,IAAI,CAAC,kBAAkB,GAAG,UAAU,CAAC;YACrC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;YAC1B,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;YACrD,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;QACJ,CAAC;QACD,IAAI,CAAC,eAAe,GAAG,UAAU,GAAG,CAAC,CAAC;QACtC,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,8CAA8C;IACvC,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,6CAA6C;IACtC,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,oCAAoC;IACtC,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,oCAAoC;IACtC,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;IACD,6EAA6E;IACtE,mBAAmB,CAAC,YAAsB,EAAE,UAAkB,CAAC;QACpE,OAAO,4BAA4B,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;IACjG,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,4BAA6B,SAAQ,sBAAsB;IAC9D,aAAa,CAAW;IACxB,mBAAmB,CAAS,CAAC,6BAA6B;IAC1D,gBAAgB,CAAS,CAAC,6BAA6B;IAE/D,YAAoB,QAAyB,EAAE,YAAsB,EAAE,OAAe;QACpF,KAAK,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1C,IAAI,CAAC,mBAAmB,GAAG,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IACO,kBAAkB,CAAC,KAAa;QACtC,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;IACzD,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,mBAAmB,CAC/B,QAAyB,EAAE,YAAsB,EAAE,UAAkB,CAAC;QAEtE,OAAO,IAAI,4BAA4B,CAAC,QAAQ,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;IAC3E,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,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC;QAChE,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,8CAA8C;IAC9B,KAAK;QACnB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,+DAA+D;YACvF,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC,CAAC,2CAA2C;QACxE,CAAC;IACH,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,aAAa,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5F,CAAC;IACD,iEAAiE;IACjD,sBAAsB;QACpC,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;IACnC,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    if (polyface.data.edgeMateIndex)\n      this.edgeMateIndex = [];\n    this._numEdges = 0;\n    this._nextFacetIndex = 0;\n    this._currentFacetIndex = -1;\n    this.reset();\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    const numEdges = this._polyface.numEdgeInFacet(facetIndex);\n    if (this._currentFacetIndex !== facetIndex || numEdges + this._numWrap !== this.pointCount) {\n      this._currentFacetIndex = facetIndex;\n      this._numEdges = numEdges;\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    }\n    this._nextFacetIndex = facetIndex + 1;\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  /** Restart the visitor at the first facet. */\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 the data 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: 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: 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  /** Create a visitor for a subset of the facets visitable by the instance. */\n  public createSubsetVisitor(facetIndices: number[], numWrap: number = 0): IndexedPolyfaceSubsetVisitor {\n    return IndexedPolyfaceSubsetVisitor.createSubsetVisitor(this._polyface, facetIndices, numWrap);\n  }\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 _facetIndices: number[];\n  private _currentSubsetIndex: number; // index within _facetIndices\n  private _nextSubsetIndex: number; // index within _facetIndices\n\n  private constructor(polyface: IndexedPolyface, facetIndices: number[], numWrap: number) {\n    super(polyface, numWrap);\n    this._facetIndices = facetIndices.slice();\n    this._currentSubsetIndex = -1;\n    this._nextSubsetIndex = 0;\n    this.reset();\n  }\n  private isValidSubsetIndex(index: number): boolean {\n    return index >= 0 && index < this._facetIndices.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 facetIndices 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, facetIndices: number[], numWrap: number = 0,\n  ): IndexedPolyfaceSubsetVisitor {\n    return new IndexedPolyfaceSubsetVisitor(polyface, facetIndices, numWrap);\n  }\n  /**\n   * Advance the iterator to a particular facet in the subset of client polyface facets.\n   * @param subsetIndex index into the subset array, not to be confused with the client facet index.\n   * @return whether the iterator was successfully moved.\n   */\n  public override moveToReadIndex(subsetIndex: number): boolean {\n    if (this.isValidSubsetIndex(subsetIndex)) {\n      this._currentSubsetIndex = subsetIndex;\n      this._nextSubsetIndex = subsetIndex + 1;\n      return super.moveToReadIndex(this._facetIndices[subsetIndex]);\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._nextSubsetIndex !== this._currentSubsetIndex)\n      return this.moveToReadIndex(this._nextSubsetIndex);\n    this._nextSubsetIndex++;\n    return true;\n  }\n  /** Restart the visitor at the first facet. */\n  public override reset(): void {\n    if (this._facetIndices) { // avoid crash during super ctor when we aren't yet initialized\n      this.moveToReadIndex(0);\n      this._nextSubsetIndex = 0; // so immediate moveToNextFacet stays here.\n    }\n  }\n  /**\n   * Return the client polyface facet index (aka \"readIndex\") for the given subset index.\n   * @param subsetIndex index into the subset array. Default is the subset index of the currently visited facet.\n   * @return valid client polyface facet index, or `undefined` if invalid subset index.\n   */\n  public parentFacetIndex(subsetIndex?: number): number | undefined {\n    if (undefined === subsetIndex)\n      subsetIndex = this._currentSubsetIndex;\n    return this.isValidSubsetIndex(subsetIndex) ? this._facetIndices[subsetIndex] : undefined;\n  }\n  /** Return the number of facets this visitor is able to visit. */\n  public override getVisitableFacetCount(): number {\n    return this._facetIndices.length;\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"]}

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

@@ -43,7 +43,7 @@ import { IndexedPolyface } from "./Polyface";
  *   * The [[previousAroundVertex]] step is clockwise around the vertex.
  * * The `nextAroundFacet` steps for a walker and its [[edgeMate]] are in opposite directions along their shared edge,
  * when that edge is interior. Thus the `edgeMate` step can be seen to iterate an "edge loop" of two locations for an
- * interior edges.
+ * interior edge.
  * * Invalid Walkers:
  *   * An invalid walker has undefined [[edgeIndex]]. For these walkers, [[isUndefined]] returns true, and [[isValid]]
  * returns false. Traversal operations on an invalid walker return an invalid walker.
@@ -57,6 +57,7 @@ import { IndexedPolyface } from "./Polyface";
  *   * Invalid walkers can also occur while traversing a non-manifold mesh. Such meshes feature edge(s) with more than
  * two adjacent facets, or with two adjacent facets that have opposite orientations. These meshes are uncommon, and
  * usually indicate a construction problem.
+ *   * Note that a null edge, for which the start and end vertex is the same, does not yield an invalid walker.
  * * See [[buildEdgeMateIndices]] for further description of the topological relations.
  * @public
  */
@@ -74,7 +75,7 @@ export declare class IndexedPolyfaceWalker {
      */
     get edgeIndex(): number | undefined;
     /** Return the polyface of this walker. */
-    get polyface(): IndexedPolyface | undefined;
+    get polyface(): IndexedPolyface;
     /**
      * Return true if the walker's edgeIndex is defined.
      * * This method is the opposite of [[isUndefined]].
@@ -88,6 +89,8 @@ export declare class IndexedPolyfaceWalker {
      * * This can also happen when methods that return a walker receive invalid input.
      */
     get isUndefined(): boolean;
+    /** Whether the walker is at a null edge, i.e. an edge with no length. */
+    get isNull(): boolean;
     /**
      * Create a walker for a given polyface at an optional edge.
      * @param polyface reference to the client polyface. This reference is captured (the polyface is not copied).
@@ -115,12 +118,10 @@ export declare class IndexedPolyfaceWalker {
     static createAtVisitor(visitor: IndexedPolyfaceVisitor, offsetWithinFacet?: number): IndexedPolyfaceWalker;
     /**
      * Create a new IndexedPolyfaceWalker from the instance.
-     * * The returned walker refers to the same polyface.
-     * * If `edgeIndex` is undefined, the returned walker refers to the same edge as the instance.
-     * * If `edgeIndex` is defined and valid, the returned walker refers to this edge.
-     * * If `edgeIndex` is defined but invalid, return undefined.
+     * * The returned walker refers to the same polyface and edge as the instance.
+     * @param result optional receiver to modify and return.
      */
-    clone(edgeIndex?: number): IndexedPolyfaceWalker | undefined;
+    clone(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker;
     /**
      * Load the walker's facet into the given visitor.
      * @returns true if the visitor and walker reference the same polyface and the walker has a valid edge index.
@@ -198,29 +199,35 @@ export declare class IndexedPolyfaceWalker {
      * Build the edgeMate index array into the polyface's [[PolyfaceData]].
      * After this method:
      * * The array `polyface.data.edgeMateIndex` is defined with the same length as the other PolyfaceData index arrays.
-     * * For each interior edge, `polyface.data.edgeIndexToEdgeMateIndex` returns the edgeIndex on the other side of the
+     * * For each interior edge, `polyface.data.edgeIndexToEdgeMateIndex` returns the edge index on the other side of the
      * edge in the adjacent facet.
      * * The conditions for edgeMate matching are:
      *   * Given facetIndex f, let `k0 = polyface.facetIndex0(f)` and `k1 = polyface.facetIndex1(f)`.
-     *   * Every edgeIndex k in the face loop of facet f satisfies `k0 <= k < k1`.
-     *   * The edge with edgeIndex k starts at the point with index `polyface.data.pointIndex[k]`.
-     *   * Let kA be an edgeIndex in this range [k0,k1), and let kB be its in-range successor with cyclic wrap, i.e.,
+     *   * Every edge index k in the face loop of facet f satisfies `k0 <= k < k1`.
+     *   * The edge with edge index k starts at the point with index `polyface.data.pointIndex[k]`.
+     *   * Let kA be an edge index in this range [k0,k1), and let kB be its in-range successor with cyclic wrap, i.e.,
      * `kB === (kA + 1 === k1) ? k0 : kA + 1`.
      *   * Then `polyface.data.pointIndex[kA]` and `polyface.data.pointIndex[kB]` are the indices of the points at the
      * start and end of an edge of that facet.
-     *   * We call kA the _edgeIndex_ for that edge, and kB the _edgeIndex_ for the next edge around the facet.
-     *   * If kA is an interior edge in a 2-manifold mesh with properly oriented facets, then there is an adjacent facet
-     * whose face loop contains edgeIndices kC and kD referencing the same edge vertices in reverse order, i.e.,
+     *   * We call kA the _edge index_ for that edge, and kB the _edge index_ for the next edge around the facet.
+     *   * If kA is a positive-length interior edge in a 2-manifold mesh with properly oriented facets, then there is
+     * an adjacent facet whose face loop contains edge indices kC and kD referencing the same edge vertices in reverse
+     * order, i.e.,
      *     * `polyface.data.pointIndex[kA] === polyface.data.pointIndex[kD]`
      *     * `polyface.data.pointIndex[kB] === polyface.data.pointIndex[kC]`
-     *   * Given this relationship, we say that edgeIndices kA and kC are _edge mates_.
-     *   * A non-interior edge either lies on the boundary of the mesh or is non-manifold (having more than two adjacent
-     * facets, or one with the wrong orientation). These edges have no edge mate.
+     *   * We call the edge indices kA and kC _edge mates_, denoted in the `edgeMateIndex` array by:
+     *     * `polyface.data.edgeMateIndex[kA] === kC`
+     *     * `polyface.data.edgeMateIndex[kC] === kA`
+     *   * If kA is zero-length interior edge, i.e, it has the same start and end point indices, then we call it a _null
+     * edge_, and its edge mate is itself.
+     * * A non-interior edge either lies on the boundary of the mesh, or is non-manifold (having more than 2 adjacent
+     * facets, or 1 with the wrong orientation). These edges have no edge mate, represented as `undefined` in
+     * the `edgeMateIndex` array.
      * * These conditions define a conventional manifold mesh where each edge of a facet has at most one partner edge with
      * opposite orientation in an adjacent facet.
      * * After calling this method, the caller can construct `IndexedPolyfaceWalker` objects to traverse the mesh by
-     * walking across edges, around faces, and around vertices. Let walkerA have edgeIndex value kA. Then with the
-     * aforementioned edgeIndices:
+     * walking across edges, around faces, and around vertices. Let walkerA have edge index value kA. Then with the
+     * aforementioned edge indices:
      *   * `walkerC = walkerA.edgeMate()` moves across the edge to its other end, at kC.
      *   * `walkerB = walkerA.nextAroundFacet()` moves around the facet to the next edge, at kB.
      *   * `walkerB.previousAroundFacet()` moves from kB back to kA.

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

@@ -1 +1 @@
-{"version":3,"file":"IndexedPolyfaceWalker.d.ts","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceWalker.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE7C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2DG;AACH,qBAAa,qBAAqB;IAChC,oCAAoC;IACpC,OAAO,CAAC,SAAS,CAAkB;IACnC,+CAA+C;IAC/C,OAAO,CAAC,UAAU,CAAqB;IACvC,kBAAkB;IAClB,OAAO;IAIP;;;;OAIG;IACH,IAAW,SAAS,IAAI,MAAM,GAAG,SAAS,CAEzC;IAED,0CAA0C;IAC1C,IAAW,QAAQ,IAAI,eAAe,GAAG,SAAS,CAEjD;IACD;;;OAGG;IACH,IAAW,OAAO,IAAI,OAAO,CAE5B;IACD;;;;;;OAMG;IACH,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD;;;;;;OAMG;WACW,iBAAiB,CAAC,QAAQ,EAAE,eAAe,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,qBAAqB;IAKrG;;;;;;;;OAQG;WACW,kBAAkB,CAAC,QAAQ,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,iBAAiB,GAAE,MAAU,GAAG,qBAAqB;IASrI;;;;;OAKG;WACW,eAAe,CAAC,OAAO,EAAE,sBAAsB,EAAE,iBAAiB,GAAE,MAAU,GAAG,qBAAqB;IAIpH;;;;;;OAMG;IACI,KAAK,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,qBAAqB,GAAG,SAAS;IAOnE;;;OAGG;IACI,WAAW,CAAC,OAAO,EAAE,sBAAsB,GAAG,OAAO;IAM5D;;;;;;OAMG;IACI,6BAA6B,CAAC,KAAK,EAAE,qBAAqB,GAAG,OAAO;IAK3E;;;;;OAKG;IACI,UAAU,CAAC,KAAK,EAAE,qBAAqB,GAAG,OAAO;IAIxD;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAOpB;;;;;;OAMG;IACI,eAAe,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAa7E;;;;;;OAMG;IACI,mBAAmB,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAcjF;;;;;;;OAOG;IACI,QAAQ,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAGtE;;;;;;;;;OASG;IACI,gBAAgB,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAI9E;;;;;;;;;OASG;IACI,oBAAoB,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAKlF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAiCG;WACW,oBAAoB,CAAC,QAAQ,EAAE,eAAe,GAAG,IAAI;CA8BpE"}
+{"version":3,"file":"IndexedPolyfaceWalker.d.ts","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceWalker.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAE7C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4DG;AACH,qBAAa,qBAAqB;IAChC,oCAAoC;IACpC,OAAO,CAAC,SAAS,CAAkB;IACnC,+CAA+C;IAC/C,OAAO,CAAC,UAAU,CAAqB;IACvC,kBAAkB;IAClB,OAAO;IAIP;;;;OAIG;IACH,IAAW,SAAS,IAAI,MAAM,GAAG,SAAS,CAEzC;IAED,0CAA0C;IAC1C,IAAW,QAAQ,IAAI,eAAe,CAErC;IACD;;;OAGG;IACH,IAAW,OAAO,IAAI,OAAO,CAE5B;IACD;;;;;;OAMG;IACH,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,yEAAyE;IACzE,IAAW,MAAM,IAAI,OAAO,CAE3B;IACD;;;;;;OAMG;WACW,iBAAiB,CAAC,QAAQ,EAAE,eAAe,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,qBAAqB;IAKrG;;;;;;;;OAQG;WACW,kBAAkB,CAAC,QAAQ,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,EAAE,iBAAiB,GAAE,MAAU,GAAG,qBAAqB;IASrI;;;;;OAKG;WACW,eAAe,CAAC,OAAO,EAAE,sBAAsB,EAAE,iBAAiB,GAAE,MAAU,GAAG,qBAAqB;IAIpH;;;;OAIG;IACI,KAAK,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAQnE;;;OAGG;IACI,WAAW,CAAC,OAAO,EAAE,sBAAsB,GAAG,OAAO;IAM5D;;;;;;OAMG;IACI,6BAA6B,CAAC,KAAK,EAAE,qBAAqB,GAAG,OAAO;IAK3E;;;;;OAKG;IACI,UAAU,CAAC,KAAK,EAAE,qBAAqB,GAAG,OAAO;IAIxD;;;;OAIG;IACH,OAAO,CAAC,YAAY;IAOpB;;;;;;OAMG;IACI,eAAe,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAa7E;;;;;;OAMG;IACI,mBAAmB,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAcjF;;;;;;;OAOG;IACI,QAAQ,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAGtE;;;;;;;;;OASG;IACI,gBAAgB,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAI9E;;;;;;;;;OASG;IACI,oBAAoB,CAAC,MAAM,CAAC,EAAE,qBAAqB,GAAG,qBAAqB;IAKlF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAuCG;WACW,oBAAoB,CAAC,QAAQ,EAAE,eAAe,GAAG,IAAI;CAsCpE"}

package/lib/esm/polyface/IndexedPolyfaceWalker.js

@@ -49,7 +49,7 @@ import { IndexedEdgeMatcher } from "./IndexedEdgeMatcher";
  *   * The [[previousAroundVertex]] step is clockwise around the vertex.
  * * The `nextAroundFacet` steps for a walker and its [[edgeMate]] are in opposite directions along their shared edge,
  * when that edge is interior. Thus the `edgeMate` step can be seen to iterate an "edge loop" of two locations for an
- * interior edges.
+ * interior edge.
  * * Invalid Walkers:
  *   * An invalid walker has undefined [[edgeIndex]]. For these walkers, [[isUndefined]] returns true, and [[isValid]]
  * returns false. Traversal operations on an invalid walker return an invalid walker.
@@ -63,6 +63,7 @@ import { IndexedEdgeMatcher } from "./IndexedEdgeMatcher";
  *   * Invalid walkers can also occur while traversing a non-manifold mesh. Such meshes feature edge(s) with more than
  * two adjacent facets, or with two adjacent facets that have opposite orientations. These meshes are uncommon, and
  * usually indicate a construction problem.
+ *   * Note that a null edge, for which the start and end vertex is the same, does not yield an invalid walker.
  * * See [[buildEdgeMateIndices]] for further description of the topological relations.
  * @public
  */
@@ -105,6 +106,10 @@ export class IndexedPolyfaceWalker {
     get isUndefined() {
         return this._edgeIndex === undefined;
     }
+    /** Whether the walker is at a null edge, i.e. an edge with no length. */
+    get isNull() {
+        return this.isValid && this._polyface.data.edgeIndexToEdgeMateIndex(this._edgeIndex) === this._edgeIndex;
+    }
     /**
      * Create a walker for a given polyface at an optional edge.
      * @param polyface reference to the client polyface. This reference is captured (the polyface is not copied).
@@ -147,17 +152,16 @@ export class IndexedPolyfaceWalker {
     }
     /**
      * Create a new IndexedPolyfaceWalker from the instance.
-     * * The returned walker refers to the same polyface.
-     * * If `edgeIndex` is undefined, the returned walker refers to the same edge as the instance.
-     * * If `edgeIndex` is defined and valid, the returned walker refers to this edge.
-     * * If `edgeIndex` is defined but invalid, return undefined.
+     * * The returned walker refers to the same polyface and edge as the instance.
+     * @param result optional receiver to modify and return.
      */
-    clone(edgeIndex) {
-        if (edgeIndex === undefined)
-            edgeIndex = this._edgeIndex;
-        if (this._polyface.data.isValidEdgeIndex(edgeIndex))
-            return new IndexedPolyfaceWalker(this._polyface, edgeIndex);
-        return undefined;
+    clone(result) {
+        if (result) {
+            result._polyface = this._polyface;
+            result._edgeIndex = this._edgeIndex;
+            return result;
+        }
+        return new IndexedPolyfaceWalker(this._polyface, this._edgeIndex);
     }
     /**
      * Load the walker's facet into the given visitor.
@@ -286,29 +290,35 @@ export class IndexedPolyfaceWalker {
      * Build the edgeMate index array into the polyface's [[PolyfaceData]].
      * After this method:
      * * The array `polyface.data.edgeMateIndex` is defined with the same length as the other PolyfaceData index arrays.
-     * * For each interior edge, `polyface.data.edgeIndexToEdgeMateIndex` returns the edgeIndex on the other side of the
+     * * For each interior edge, `polyface.data.edgeIndexToEdgeMateIndex` returns the edge index on the other side of the
      * edge in the adjacent facet.
      * * The conditions for edgeMate matching are:
      *   * Given facetIndex f, let `k0 = polyface.facetIndex0(f)` and `k1 = polyface.facetIndex1(f)`.
-     *   * Every edgeIndex k in the face loop of facet f satisfies `k0 <= k < k1`.
-     *   * The edge with edgeIndex k starts at the point with index `polyface.data.pointIndex[k]`.
-     *   * Let kA be an edgeIndex in this range [k0,k1), and let kB be its in-range successor with cyclic wrap, i.e.,
+     *   * Every edge index k in the face loop of facet f satisfies `k0 <= k < k1`.
+     *   * The edge with edge index k starts at the point with index `polyface.data.pointIndex[k]`.
+     *   * Let kA be an edge index in this range [k0,k1), and let kB be its in-range successor with cyclic wrap, i.e.,
      * `kB === (kA + 1 === k1) ? k0 : kA + 1`.
      *   * Then `polyface.data.pointIndex[kA]` and `polyface.data.pointIndex[kB]` are the indices of the points at the
      * start and end of an edge of that facet.
-     *   * We call kA the _edgeIndex_ for that edge, and kB the _edgeIndex_ for the next edge around the facet.
-     *   * If kA is an interior edge in a 2-manifold mesh with properly oriented facets, then there is an adjacent facet
-     * whose face loop contains edgeIndices kC and kD referencing the same edge vertices in reverse order, i.e.,
+     *   * We call kA the _edge index_ for that edge, and kB the _edge index_ for the next edge around the facet.
+     *   * If kA is a positive-length interior edge in a 2-manifold mesh with properly oriented facets, then there is
+     * an adjacent facet whose face loop contains edge indices kC and kD referencing the same edge vertices in reverse
+     * order, i.e.,
      *     * `polyface.data.pointIndex[kA] === polyface.data.pointIndex[kD]`
      *     * `polyface.data.pointIndex[kB] === polyface.data.pointIndex[kC]`
-     *   * Given this relationship, we say that edgeIndices kA and kC are _edge mates_.
-     *   * A non-interior edge either lies on the boundary of the mesh or is non-manifold (having more than two adjacent
-     * facets, or one with the wrong orientation). These edges have no edge mate.
+     *   * We call the edge indices kA and kC _edge mates_, denoted in the `edgeMateIndex` array by:
+     *     * `polyface.data.edgeMateIndex[kA] === kC`
+     *     * `polyface.data.edgeMateIndex[kC] === kA`
+     *   * If kA is zero-length interior edge, i.e, it has the same start and end point indices, then we call it a _null
+     * edge_, and its edge mate is itself.
+     * * A non-interior edge either lies on the boundary of the mesh, or is non-manifold (having more than 2 adjacent
+     * facets, or 1 with the wrong orientation). These edges have no edge mate, represented as `undefined` in
+     * the `edgeMateIndex` array.
      * * These conditions define a conventional manifold mesh where each edge of a facet has at most one partner edge with
      * opposite orientation in an adjacent facet.
      * * After calling this method, the caller can construct `IndexedPolyfaceWalker` objects to traverse the mesh by
-     * walking across edges, around faces, and around vertices. Let walkerA have edgeIndex value kA. Then with the
-     * aforementioned edgeIndices:
+     * walking across edges, around faces, and around vertices. Let walkerA have edge index value kA. Then with the
+     * aforementioned edge indices:
      *   * `walkerC = walkerA.edgeMate()` moves across the edge to its other end, at kC.
      *   * `walkerB = walkerA.nextAroundFacet()` moves around the facet to the next edge, at kB.
      *   * `walkerB.previousAroundFacet()` moves from kB back to kA.
@@ -317,31 +327,40 @@ export class IndexedPolyfaceWalker {
      *   * `walkerD.nextAroundVertex()` moves from kD back to kA.
      */
     static buildEdgeMateIndices(polyface) {
+        if (polyface.isEmpty) {
+            polyface.data.edgeMateIndex = undefined;
+            return;
+        }
         const matcher = new IndexedEdgeMatcher();
         const numFacet = polyface.facetCount;
         for (let facetIndex = 0; facetIndex < numFacet; facetIndex++) {
             const kStart = polyface.facetIndex0(facetIndex);
             const kEnd = polyface.facetIndex1(facetIndex);
             let k0 = kEnd - 1;
-            // sneaky: addEdge 3rd arg is edgeIndex k0 instead of facetIndex; it gets carried around during matching
+            // sneaky: addEdge 3rd arg is edge index k0 instead of facetIndex; it gets carried around during matching
             for (let k1 = kStart; k1 < kEnd; k0 = k1, k1++)
                 matcher.addEdge(polyface.data.pointIndex[k0], polyface.data.pointIndex[k1], k0);
         }
         const matchedPairs = [];
-        const singletons = [];
         const nullEdges = [];
-        const allOtherClusters = [];
-        matcher.sortAndCollectClusters(matchedPairs, singletons, nullEdges, allOtherClusters);
+        matcher.sortAndCollectClusters(matchedPairs, undefined, nullEdges, undefined);
         const numIndex = polyface.data.pointIndex.length;
         polyface.data.edgeMateIndex = new Array(numIndex);
         for (let i = 0; i < numIndex; i++)
-            polyface.data.edgeMateIndex[i] = undefined;
+            polyface.data.edgeMateIndex[i] = undefined; // boundary and non-manifold edges have no mate
         for (const pair of matchedPairs) {
             if (Array.isArray(pair) && pair.length === 2) {
-                const k0 = pair[0].facetIndex;
-                const k1 = pair[1].facetIndex;
-                polyface.data.edgeMateIndex[k0] = k1;
-                polyface.data.edgeMateIndex[k1] = k0;
+                const edgeIndex0 = pair[0].facetIndex;
+                const edgeIndex1 = pair[1].facetIndex;
+                polyface.data.edgeMateIndex[edgeIndex0] = edgeIndex1; // paired edges point to each other
+                polyface.data.edgeMateIndex[edgeIndex1] = edgeIndex0;
+            }
+        }
+        for (const nullEdgeOrCluster of nullEdges) {
+            const nullCluster = Array.isArray(nullEdgeOrCluster) ? nullEdgeOrCluster : [nullEdgeOrCluster];
+            for (const nullEdge of nullCluster) {
+                const edgeIndex = nullEdge.facetIndex;
+                polyface.data.edgeMateIndex[edgeIndex] = edgeIndex; // a null edge points to itself
             }
         }
     }