@itwin/core-geometry 5.0.0-dev.113 → 5.0.0-dev.115

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;CAkCpE"}

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.
@@ -323,25 +333,30 @@ export class IndexedPolyfaceWalker {
             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
             }
         }
     }

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

@@ -1 +1 @@
-{"version":3,"file":"IndexedPolyfaceWalker.js","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceWalker.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,kBAAkB,EAAuB,MAAM,sBAAsB,CAAC;AAI/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2DG;AACH,MAAM,OAAO,qBAAqB;IAChC,oCAAoC;IAC5B,SAAS,CAAkB;IACnC,+CAA+C;IACvC,UAAU,CAAqB;IACvC,kBAAkB;IAClB,YAAoB,QAAyB,EAAE,SAA6B;QAC1E,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD;;;;OAIG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,0CAA0C;IAC1C,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD;;;OAGG;IACH,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC;IACvC,CAAC;IACD;;;;;;OAMG;IACH,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC;IACvC,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,QAAyB,EAAE,SAAkB;QAC3E,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;YAC5C,SAAS,GAAG,SAAS,CAAC;QACxB,OAAO,IAAI,qBAAqB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,kBAAkB,CAAC,QAAyB,EAAE,UAAkB,EAAE,oBAA4B,CAAC;QAC3G,IAAI,QAAQ,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,CAAC;YAC3C,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAC5C,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAC5C,IAAI,CAAC,IAAI,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,GAAG,EAAE;gBACvD,OAAO,IAAI,qBAAqB,CAAC,QAAQ,EAAE,EAAE,GAAG,iBAAiB,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,IAAI,qBAAqB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACxD,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,OAA+B,EAAE,oBAA4B,CAAC;QAC1F,MAAM,UAAU,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC9C,OAAO,qBAAqB,CAAC,kBAAkB,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAC;IAC3G,CAAC;IACD;;;;;;OAMG;IACI,KAAK,CAAC,SAAkB;QAC7B,IAAI,SAAS,KAAK,SAAS;YACzB,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAC9B,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;YACjD,OAAO,IAAI,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC9D,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,OAA+B;QAChD,IAAI,OAAO,CAAC,cAAc,EAAE,KAAK,IAAI,CAAC,SAAS;YAC7C,OAAO,KAAK,CAAC;QACf,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzE,OAAO,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAClF,CAAC;IACD;;;;;;OAMG;IACI,6BAA6B,CAAC,KAA4B;QAC/D,IAAI,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,WAAW;YACvC,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,SAAS,CAAC;IACnF,CAAC;IACD;;;;;OAKG;IACI,UAAU,CAAC,KAA4B;QAC5C,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;IACpG,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,MAAyC,EAAE,SAA6B;QAC3F,IAAI,MAAM,KAAK,SAAS;YACtB,OAAO,IAAI,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;QAC9B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,eAAe,CAAC,MAA8B;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAC1B,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QAC3D,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD;;;;;;OAMG;IACI,mBAAmB,CAAC,MAA8B;QACvD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QACxB,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QAC3D,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,EAAE;YACV,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;;YAE/C,CAAC,EAAE,CAAC;QACN,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,MAA8B;QAC5C,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAClG,CAAC;IACD;;;;;;;;;OASG;IACI,gBAAgB,CAAC,MAA8B;QACpD,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QACjD,OAAO,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IACD;;;;;;;;;OASG;IACI,oBAAoB,CAAC,MAA8B;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtC,OAAO,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAiCG;IACI,MAAM,CAAC,oBAAoB,CAAC,QAAyB;QAC1D,MAAM,OAAO,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC;QACrC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,QAAQ,EAAE,UAAU,EAAE,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAChD,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAC9C,IAAI,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC;YAClB,wGAAwG;YACxG,KAAK,IAAI,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE;gBAC5C,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACpF,CAAC;QACD,MAAM,YAAY,GAA0B,EAAE,CAAC;QAC/C,MAAM,UAAU,GAA0B,EAAE,CAAC;QAC7C,MAAM,SAAS,GAA0B,EAAE,CAAC;QAC5C,MAAM,gBAAgB,GAA0B,EAAE,CAAC;QACnD,OAAO,CAAC,sBAAsB,CAAC,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,gBAAgB,CAAC,CAAC;QAEtF,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACjD,QAAQ,CAAC,IAAI,CAAC,aAAa,GAAG,IAAI,KAAK,CAAqB,QAAQ,CAAC,CAAC;QACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;YAC/B,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;QAC7C,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7C,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;gBAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;gBAC9B,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBACrC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Polyface\n */\n\nimport { IndexedEdgeMatcher, SortableEdgeCluster } from \"./IndexedEdgeMatcher\";\nimport { IndexedPolyfaceVisitor } from \"./IndexedPolyfaceVisitor\";\nimport { IndexedPolyface } from \"./Polyface\";\n\n/**\n * The `IndexedPolyfaceWalker` class supports navigation around facets, across edges, and around vertices in an\n * [[IndexedPolyface]].\n * * Compare to the [[IndexedPolyfaceVisitor]] class, which supports the iteration of facets in an `IndexedPolyface`.\n * * A one-time call to [[buildEdgeMateIndices]] creates and populates the `data.edgeMateIndex` array on the input.\n *   * This array essentially completes the topology of the `IndexedPolyface` by storing facet adjacency.\n * * After this setup, caller code can create `IndexedPolyfaceWalker` objects via:\n *   * `walker = IndexedPolyfaceWalker.createAtFacetIndex(polyface, facetIndex, offsetWithinFacet)`\n *   * `walker = IndexedPolyfaceWalker.createAtEdgeIndex(polyface, edgeIndex)`\n *   * `walker = IndexedPolyfaceWalker.createAtVisitor(visitor, offsetWithinFacet)`\n * * Once you have a walker object, you can traverse the facet, edge, and vertex loops it references. For\n * example, if `walker.edgeIndex === A`, referring to the right edge of the upper left facet pictured below, then\n * the following are true:\n *   * `walker.nextAroundFacet().edgeIndex === B`\n *   * `walker.previousAroundFacet().edgeIndex === C`\n *   * `walker.edgeMate().edgeIndex === F`\n *   * `walker.nextAroundVertex().edgeIndex === E`\n *   * `walker.previousAroundVertex().edgeIndex === D`\n* ```\n *      # --------- # --------- #\n *      |   < < < B | F         |\n *      |         ^ | v         |\n *      |         ^ | v         |\n *      |         ^ | v         |\n *      | C > > > A | D > > >   |\n *      # --------- # --------- #\n *      |   < < < E |           |\n *      |           |           |\n *      |           |           |\n *      |           |           |\n *      # --------- # --------- #\n * ```\n* * When facets are viewed so that the face loops stored in the [[PolyfaceData]] `pointIndex` array have\n * counterclockwise ordering, an edge \"from A to B\" has facet area to the left and the edge to the right. Likewise,\n * the edges \"out of\" locations B, C, E, F, D are directed as depicted above.\n * * With this conventional counterclockwise ordering of face loops, \"next\" is counterclockwise, and \"previous\" is\n * clockwise:\n *   * The [[nextAroundFacet]] step is counterclockwise around the facet.\n *   * The [[previousAroundFacet]] step is clockwise around the facet.\n *   * The [[nextAroundVertex]] step is counterclockwise around the vertex.\n *   * The [[previousAroundVertex]] step is clockwise around the vertex.\n * * The `nextAroundFacet` steps for a walker and its [[edgeMate]] are in opposite directions along their shared edge,\n * when that edge is interior. Thus the `edgeMate` step can be seen to iterate an \"edge loop\" of two locations for an\n * interior edges.\n * * Invalid Walkers:\n *   * An invalid walker has undefined [[edgeIndex]]. For these walkers, [[isUndefined]] returns true, and [[isValid]]\n * returns false. Traversal operations on an invalid walker return an invalid walker.\n *   * Invalid walkers are expected during traversals of a mesh with boundary edges, so calling code must be prepared.\n * Boundary edges have exactly one adjacent facet, so for these edges the `edgeMate` step returns an invalid walker.\n * In the diagram above, the `edgeMate` of boundary edge B is undefined.\n *   * Invalid walkers can occur while traversing boundary vertices as well. If an edge lacks an `edgeMate`, then the\n * `previousAroundVertex` step yields an invalid walker, because `previousAroundVertex` is implemented as `edgeMate`\n * followed by `nextAroundFacet`. In the diagram above, the `previousAroundVertex` step at boundary edge B yields\n * undefined walker. Similarly, the `nextAroundVertex` step at edge F yields undefined walker.\n *   * Invalid walkers can also occur while traversing a non-manifold mesh. Such meshes feature edge(s) with more than\n * two adjacent facets, or with two adjacent facets that have opposite orientations. These meshes are uncommon, and\n * usually indicate a construction problem.\n * * See [[buildEdgeMateIndices]] for further description of the topological relations.\n * @public\n */\nexport class IndexedPolyfaceWalker {\n  /** The polyface being traversed. */\n  private _polyface: IndexedPolyface;\n  /** The current edgeIndex into the polyface. */\n  private _edgeIndex: number | undefined;\n  /** Constructor */\n  private constructor(polyface: IndexedPolyface, edgeIndex: number | undefined) {\n    this._polyface = polyface;\n    this._edgeIndex = edgeIndex;\n  }\n  /**\n   * Return the edge index of this walker.\n   * * This is an index into the polyface's `data.pointIndex` array.\n   * * Can be undefined.\n   */\n  public get edgeIndex(): number | undefined {\n    return this._edgeIndex;\n  }\n\n  /** Return the polyface of this walker. */\n  public get polyface(): IndexedPolyface | undefined {\n    return this._polyface;\n  }\n  /**\n   * Return true if the walker's edgeIndex is defined.\n   * * This method is the opposite of [[isUndefined]].\n   */\n  public get isValid(): boolean {\n    return this._edgeIndex !== undefined;\n  }\n  /**\n   * Return true if the walker's edgeIndex is undefined.\n   * * This method is the opposite of [[isValid]].\n   * * This can happen during a walk when the walker `w` reaches an exterior edge, for then\n   * `w.edgeMate(w).isUndefined === true`.\n   * * This can also happen when methods that return a walker receive invalid input.\n   */\n  public get isUndefined(): boolean {\n    return this._edgeIndex === undefined;\n  }\n  /**\n   * Create a walker for a given polyface at an optional edge.\n   * @param polyface reference to the client polyface. This reference is captured (the polyface is not copied).\n   * @param edgeIndex optional indication of where to start the walker within the mesh.\n   * * If the edgeIndex is valid for the input polyface, the new walker is started there.\n   * * If the edgeIndex is undefined or invalid for the input polyface, the walker returns true for [[isUndefined]].\n   */\n  public static createAtEdgeIndex(polyface: IndexedPolyface, edgeIndex?: number): IndexedPolyfaceWalker {\n    if (!polyface.data.isValidEdgeIndex(edgeIndex))\n      edgeIndex = undefined;\n    return new IndexedPolyfaceWalker(polyface, edgeIndex);\n  }\n  /**\n   * Create a walker for a given polyface at a specified facet.\n   * * If `facetIndex` or `offsetWithinFacet` is invalid for the input polyface, the walker returns true for\n   * [[isUndefined]].\n   * @param polyface the polyface to reference\n   * @param facetIndex index of the facet to reference\n   * @param offsetWithinFacet optional 0-based offset within the face loop of the facet (default 0). This allows\n   * the caller to start the walker at a particular edge of the facet.\n   */\n  public static createAtFacetIndex(polyface: IndexedPolyface, facetIndex: number, offsetWithinFacet: number = 0): IndexedPolyfaceWalker {\n    if (polyface.isValidFacetIndex(facetIndex)) {\n      const k0 = polyface.facetIndex0(facetIndex);\n      const k1 = polyface.facetIndex1(facetIndex);\n      if (0 <= offsetWithinFacet && k0 + offsetWithinFacet < k1)\n        return new IndexedPolyfaceWalker(polyface, k0 + offsetWithinFacet);\n    }\n    return new IndexedPolyfaceWalker(polyface, undefined);\n  }\n  /**\n   * Create a walker at the facet specified by a visitor.\n   * @param visitor visitor whose currentReadIndex identifies the facet.\n   * @param offsetWithinFacet optional 0-based offset within the face loop of the facet (default 0). This allows\n   * the caller to start the walker at a particular edge of the facet.\n   */\n  public static createAtVisitor(visitor: IndexedPolyfaceVisitor, offsetWithinFacet: number = 0): IndexedPolyfaceWalker {\n    const facetIndex = visitor.currentReadIndex();\n    return IndexedPolyfaceWalker.createAtFacetIndex(visitor.clientPolyface(), facetIndex, offsetWithinFacet);\n  }\n  /**\n   * Create a new IndexedPolyfaceWalker from the instance.\n   * * The returned walker refers to the same polyface.\n   * * If `edgeIndex` is undefined, the returned walker refers to the same edge as the instance.\n   * * If `edgeIndex` is defined and valid, the returned walker refers to this edge.\n   * * If `edgeIndex` is defined but invalid, return undefined.\n   */\n  public clone(edgeIndex?: number): IndexedPolyfaceWalker | undefined {\n    if (edgeIndex === undefined)\n      edgeIndex = this._edgeIndex;\n    if (this._polyface.data.isValidEdgeIndex(edgeIndex))\n      return new IndexedPolyfaceWalker(this._polyface, edgeIndex);\n    return undefined;\n  }\n  /**\n   * Load the walker's facet into the given visitor.\n   * @returns true if the visitor and walker reference the same polyface and the walker has a valid edge index.\n   */\n  public loadVisitor(visitor: IndexedPolyfaceVisitor): boolean {\n    if (visitor.clientPolyface() !== this._polyface)\n      return false;\n    const facetIndex = this._polyface.edgeIndexToFacetIndex(this._edgeIndex);\n    return (facetIndex !== undefined) ? visitor.moveToReadIndex(facetIndex) : false;\n  }\n  /**\n   * Test if two walkers are at different edges in the same polyface.\n   * * If either has undefined edge, return false.\n   * * If they are in different polyfaces, return false.\n   * * If they are the same edge in the same polyface, return false.\n   * * Otherwise return true.\n   */\n  public isDifferentEdgeInSamePolyface(other: IndexedPolyfaceWalker): boolean {\n    if (this.isUndefined || other.isUndefined)\n      return false;\n    return this._polyface === other._polyface && this._edgeIndex !== other.edgeIndex;\n  }\n  /**\n   * Test if two walkers are in the same polyface at the same edge.\n   * * If either has undefined edge, return false.\n   * * If they are in different polyfaces, return false.\n   * * If they are the same edge in the same polyface, return true.\n   */\n  public isSameEdge(other: IndexedPolyfaceWalker): boolean {\n    return this._polyface === other._polyface && this.isValid && this._edgeIndex === other._edgeIndex;\n  }\n\n  /**\n   * Return a walker with given edgeIndex and polyface from the calling instance.\n   * * If `result` is supplied, that walker is filled and returned.\n   * * If `result` is not supplied, a new walker is created.\n   */\n  private createResult(result: undefined | IndexedPolyfaceWalker, edgeIndex: undefined | number): IndexedPolyfaceWalker {\n    if (result === undefined)\n      return new IndexedPolyfaceWalker(this._polyface, edgeIndex);\n    result._polyface = this._polyface;\n    result._edgeIndex = edgeIndex;\n    return result;\n  }\n  /**\n   * Return a walker (new or reused) at the next edge around the facet.\n   * * \"Next\" is in the order of indices in the face loop of this facet.\n   * * If the instance has undefined edgeIndex, the result also has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public nextAroundFacet(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    const k = this._edgeIndex;\n    if (k === undefined)\n      return this.createResult(result, undefined);\n    const facetIndex = this._polyface.edgeIndexToFacetIndex(k);\n    if (facetIndex === undefined)\n      return this.createResult(result, undefined);\n    const k2 = this._polyface.facetIndex1(facetIndex);\n    const k1 = k + 1;\n    if (k1 < k2)\n      return this.createResult(result, k1);\n    return this.createResult(result, this._polyface.facetIndex0(facetIndex));\n  }\n  /**\n   * Return a walker (new or reused) at the previous edge around the facet.\n   * * \"Previous\" is in the reverse order of indices in the face loop of this facet.\n   * * If the instance has undefined edgeIndex, the result also has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public previousAroundFacet(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    let k = this._edgeIndex;\n    if (k === undefined)\n      return this.createResult(result, undefined);\n    const facetIndex = this._polyface.edgeIndexToFacetIndex(k);\n    if (facetIndex === undefined)\n      return this.createResult(result, undefined);\n    const k0 = this._polyface.facetIndex0(facetIndex);\n    if (k === k0)\n      k = this._polyface.facetIndex1(facetIndex) - 1;\n    else\n      k--;\n    return this.createResult(result, k);\n  }\n  /**\n   * Return a walker (new or reused) at the edge mate of this walker's edge.\n   * * The returned walker has undefined edgeIndex if:\n   *   * the instance is at a boundary edge, i.e., there is no facet on the other side, or\n   *   * the instance has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public edgeMate(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    return this.createResult(result, this._polyface.data.edgeIndexToEdgeMateIndex(this._edgeIndex));\n  }\n  /**\n   * Return a walker (new or reused) at the next outbound edge around the vertex at the base of this walker's edge.\n   * * If the facet is viewed so that its \"nextAroundFacet\" direction appears counterclockwise, then the \"next\"\n   * outbound edge is counterclockwise around the base vertex.\n   * * The returned walker has undefined edgeIndex if:\n   *   * the previous edge around the facet is a boundary edge, i.e., there is no facet on the other side, or\n   *   * the instance has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public nextAroundVertex(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    const result1 = this.previousAroundFacet(result);\n    return result1.edgeMate(result1);\n  }\n  /**\n   * Return a walker (new or reused) at the previous outbound edge around the vertex at the base of this walker's edge.\n   * * If the facet is viewed so that its \"nextAroundFacet\" direction appears counterclockwise, then the \"previous\"\n   * outbound edge is clockwise around the base vertex.\n   * * The returned walker has undefined edgeIndex if:\n   *   * the instance edge is a boundary edge, i.e., there is no facet on the other side, or\n   *   * the instance has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public previousAroundVertex(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    const result1 = this.edgeMate(result);\n    return result1.nextAroundFacet(result1);\n  }\n\n  /**\n   * Build the edgeMate index array into the polyface's [[PolyfaceData]].\n   * After this method:\n   * * The array `polyface.data.edgeMateIndex` is defined with the same length as the other PolyfaceData index arrays.\n   * * For each interior edge, `polyface.data.edgeIndexToEdgeMateIndex` returns the edgeIndex on the other side of the\n   * edge in the adjacent facet.\n   * * The conditions for edgeMate matching are:\n   *   * Given facetIndex f, let `k0 = polyface.facetIndex0(f)` and `k1 = polyface.facetIndex1(f)`.\n   *   * Every edgeIndex k in the face loop of facet f satisfies `k0 <= k < k1`.\n   *   * The edge with edgeIndex k starts at the point with index `polyface.data.pointIndex[k]`.\n   *   * Let kA be an edgeIndex in this range [k0,k1), and let kB be its in-range successor with cyclic wrap, i.e.,\n   * `kB === (kA + 1 === k1) ? k0 : kA + 1`.\n   *   * Then `polyface.data.pointIndex[kA]` and `polyface.data.pointIndex[kB]` are the indices of the points at the\n   * start and end of an edge of that facet.\n   *   * We call kA the _edgeIndex_ for that edge, and kB the _edgeIndex_ for the next edge around the facet.\n   *   * If kA is an interior edge in a 2-manifold mesh with properly oriented facets, then there is an adjacent facet\n   * whose face loop contains edgeIndices kC and kD referencing the same edge vertices in reverse order, i.e.,\n   *     * `polyface.data.pointIndex[kA] === polyface.data.pointIndex[kD]`\n   *     * `polyface.data.pointIndex[kB] === polyface.data.pointIndex[kC]`\n   *   * Given this relationship, we say that edgeIndices kA and kC are _edge mates_.\n   *   * A non-interior edge either lies on the boundary of the mesh or is non-manifold (having more than two adjacent\n   * facets, or one with the wrong orientation). These edges have no edge mate.\n   * * These conditions define a conventional manifold mesh where each edge of a facet has at most one partner edge with\n   * opposite orientation in an adjacent facet.\n   * * After calling this method, the caller can construct `IndexedPolyfaceWalker` objects to traverse the mesh by\n   * walking across edges, around faces, and around vertices. Let walkerA have edgeIndex value kA. Then with the\n   * aforementioned edgeIndices:\n   *   * `walkerC = walkerA.edgeMate()` moves across the edge to its other end, at kC.\n   *   * `walkerB = walkerA.nextAroundFacet()` moves around the facet to the next edge, at kB.\n   *   * `walkerB.previousAroundFacet()` moves from kB back to kA.\n   *   * `walkerD = walkerA.previousAroundVertex()` moves around the vertex to the next edge kD.\n   *   * `walkerD1 = walkerC.nextAroundFacet()` also moves to kD.\n   *   * `walkerD.nextAroundVertex()` moves from kD back to kA.\n   */\n  public static buildEdgeMateIndices(polyface: IndexedPolyface): void {\n    const matcher = new IndexedEdgeMatcher();\n    const numFacet = polyface.facetCount;\n    for (let facetIndex = 0; facetIndex < numFacet; facetIndex++) {\n      const kStart = polyface.facetIndex0(facetIndex);\n      const kEnd = polyface.facetIndex1(facetIndex);\n      let k0 = kEnd - 1;\n      // sneaky: addEdge 3rd arg is edgeIndex k0 instead of facetIndex; it gets carried around during matching\n      for (let k1 = kStart; k1 < kEnd; k0 = k1, k1++)\n        matcher.addEdge(polyface.data.pointIndex[k0], polyface.data.pointIndex[k1], k0);\n    }\n    const matchedPairs: SortableEdgeCluster[] = [];\n    const singletons: SortableEdgeCluster[] = [];\n    const nullEdges: SortableEdgeCluster[] = [];\n    const allOtherClusters: SortableEdgeCluster[] = [];\n    matcher.sortAndCollectClusters(matchedPairs, singletons, nullEdges, allOtherClusters);\n\n    const numIndex = polyface.data.pointIndex.length;\n    polyface.data.edgeMateIndex = new Array<number | undefined>(numIndex);\n    for (let i = 0; i < numIndex; i++)\n      polyface.data.edgeMateIndex[i] = undefined;\n    for (const pair of matchedPairs) {\n      if (Array.isArray(pair) && pair.length === 2) {\n        const k0 = pair[0].facetIndex;\n        const k1 = pair[1].facetIndex;\n        polyface.data.edgeMateIndex[k0] = k1;\n        polyface.data.edgeMateIndex[k1] = k0;\n      }\n    }\n  }\n}\n\n"]}
+{"version":3,"file":"IndexedPolyfaceWalker.js","sourceRoot":"","sources":["../../../src/polyface/IndexedPolyfaceWalker.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,kBAAkB,EAAuB,MAAM,sBAAsB,CAAC;AAI/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4DG;AACH,MAAM,OAAO,qBAAqB;IAChC,oCAAoC;IAC5B,SAAS,CAAkB;IACnC,+CAA+C;IACvC,UAAU,CAAqB;IACvC,kBAAkB;IAClB,YAAoB,QAAyB,EAAE,SAA6B;QAC1E,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD;;;;OAIG;IACH,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,0CAA0C;IAC1C,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD;;;OAGG;IACH,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC;IACvC,CAAC;IACD;;;;;;OAMG;IACH,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC;IACvC,CAAC;IACD,yEAAyE;IACzE,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,IAAI,CAAC,UAAU,CAAC;IAC3G,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,QAAyB,EAAE,SAAkB;QAC3E,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC;YAC5C,SAAS,GAAG,SAAS,CAAC;QACxB,OAAO,IAAI,qBAAqB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,kBAAkB,CAAC,QAAyB,EAAE,UAAkB,EAAE,oBAA4B,CAAC;QAC3G,IAAI,QAAQ,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,CAAC;YAC3C,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAC5C,MAAM,EAAE,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAC5C,IAAI,CAAC,IAAI,iBAAiB,IAAI,EAAE,GAAG,iBAAiB,GAAG,EAAE;gBACvD,OAAO,IAAI,qBAAqB,CAAC,QAAQ,EAAE,EAAE,GAAG,iBAAiB,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,IAAI,qBAAqB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACxD,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,OAA+B,EAAE,oBAA4B,CAAC;QAC1F,MAAM,UAAU,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;QAC9C,OAAO,qBAAqB,CAAC,kBAAkB,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,UAAU,EAAE,iBAAiB,CAAC,CAAC;IAC3G,CAAC;IACD;;;;OAIG;IACI,KAAK,CAAC,MAA8B;QACzC,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;YAClC,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;YACpC,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,IAAI,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IACpE,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,OAA+B;QAChD,IAAI,OAAO,CAAC,cAAc,EAAE,KAAK,IAAI,CAAC,SAAS;YAC7C,OAAO,KAAK,CAAC;QACf,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzE,OAAO,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAClF,CAAC;IACD;;;;;;OAMG;IACI,6BAA6B,CAAC,KAA4B;QAC/D,IAAI,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC,WAAW;YACvC,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,SAAS,CAAC;IACnF,CAAC;IACD;;;;;OAKG;IACI,UAAU,CAAC,KAA4B;QAC5C,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;IACpG,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,MAAyC,EAAE,SAA6B;QAC3F,IAAI,MAAM,KAAK,SAAS;YACtB,OAAO,IAAI,qBAAqB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,MAAM,CAAC,UAAU,GAAG,SAAS,CAAC;QAC9B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,eAAe,CAAC,MAA8B;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QAC1B,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QAC3D,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClD,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,IAAI,EAAE,GAAG,EAAE;YACT,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3E,CAAC;IACD;;;;;;OAMG;IACI,mBAAmB,CAAC,MAA8B;QACvD,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC;QACxB,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QAC3D,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,CAAC,KAAK,EAAE;YACV,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;;YAE/C,CAAC,EAAE,CAAC;QACN,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACtC,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,MAA8B;QAC5C,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAClG,CAAC;IACD;;;;;;;;;OASG;IACI,gBAAgB,CAAC,MAA8B;QACpD,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QACjD,OAAO,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IACD;;;;;;;;;OASG;IACI,oBAAoB,CAAC,MAA8B;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACtC,OAAO,OAAO,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAuCG;IACI,MAAM,CAAC,oBAAoB,CAAC,QAAyB;QAC1D,MAAM,OAAO,GAAG,IAAI,kBAAkB,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC;QACrC,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,QAAQ,EAAE,UAAU,EAAE,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAChD,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;YAC9C,IAAI,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC;YAClB,yGAAyG;YACzG,KAAK,IAAI,EAAE,GAAG,MAAM,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE;gBAC5C,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACpF,CAAC;QACD,MAAM,YAAY,GAA0B,EAAE,CAAC;QAC/C,MAAM,SAAS,GAA0B,EAAE,CAAC;QAC5C,OAAO,CAAC,sBAAsB,CAAC,YAAY,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QAC9E,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACjD,QAAQ,CAAC,IAAI,CAAC,aAAa,GAAG,IAAI,KAAK,CAAqB,QAAQ,CAAC,CAAC;QACtE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;YAC/B,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,+CAA+C;QAC7F,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;gBACtC,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;gBACtC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC,CAAC,mCAAmC;gBACzF,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC;YACvD,CAAC;QACH,CAAC;QACD,KAAK,MAAM,iBAAiB,IAAI,SAAS,EAAE,CAAC;YAC1C,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC;YAC/F,KAAK,MAAM,QAAQ,IAAI,WAAW,EAAE,CAAC;gBACnC,MAAM,SAAS,GAAG,QAAQ,CAAC,UAAU,CAAC;gBACtC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC,+BAA+B;YACrF,CAAC;QACH,CAAC;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Polyface\n */\n\nimport { IndexedEdgeMatcher, SortableEdgeCluster } from \"./IndexedEdgeMatcher\";\nimport { IndexedPolyfaceVisitor } from \"./IndexedPolyfaceVisitor\";\nimport { IndexedPolyface } from \"./Polyface\";\n\n/**\n * The `IndexedPolyfaceWalker` class supports navigation around facets, across edges, and around vertices in an\n * [[IndexedPolyface]].\n * * Compare to the [[IndexedPolyfaceVisitor]] class, which supports the iteration of facets in an `IndexedPolyface`.\n * * A one-time call to [[buildEdgeMateIndices]] creates and populates the `data.edgeMateIndex` array on the input.\n *   * This array essentially completes the topology of the `IndexedPolyface` by storing facet adjacency.\n * * After this setup, caller code can create `IndexedPolyfaceWalker` objects via:\n *   * `walker = IndexedPolyfaceWalker.createAtFacetIndex(polyface, facetIndex, offsetWithinFacet)`\n *   * `walker = IndexedPolyfaceWalker.createAtEdgeIndex(polyface, edgeIndex)`\n *   * `walker = IndexedPolyfaceWalker.createAtVisitor(visitor, offsetWithinFacet)`\n * * Once you have a walker object, you can traverse the facet, edge, and vertex loops it references. For\n * example, if `walker.edgeIndex === A`, referring to the right edge of the upper left facet pictured below, then\n * the following are true:\n *   * `walker.nextAroundFacet().edgeIndex === B`\n *   * `walker.previousAroundFacet().edgeIndex === C`\n *   * `walker.edgeMate().edgeIndex === F`\n *   * `walker.nextAroundVertex().edgeIndex === E`\n *   * `walker.previousAroundVertex().edgeIndex === D`\n* ```\n *      # --------- # --------- #\n *      |   < < < B | F         |\n *      |         ^ | v         |\n *      |         ^ | v         |\n *      |         ^ | v         |\n *      | C > > > A | D > > >   |\n *      # --------- # --------- #\n *      |   < < < E |           |\n *      |           |           |\n *      |           |           |\n *      |           |           |\n *      # --------- # --------- #\n * ```\n* * When facets are viewed so that the face loops stored in the [[PolyfaceData]] `pointIndex` array have\n * counterclockwise ordering, an edge \"from A to B\" has facet area to the left and the edge to the right. Likewise,\n * the edges \"out of\" locations B, C, E, F, D are directed as depicted above.\n * * With this conventional counterclockwise ordering of face loops, \"next\" is counterclockwise, and \"previous\" is\n * clockwise:\n *   * The [[nextAroundFacet]] step is counterclockwise around the facet.\n *   * The [[previousAroundFacet]] step is clockwise around the facet.\n *   * The [[nextAroundVertex]] step is counterclockwise around the vertex.\n *   * The [[previousAroundVertex]] step is clockwise around the vertex.\n * * The `nextAroundFacet` steps for a walker and its [[edgeMate]] are in opposite directions along their shared edge,\n * when that edge is interior. Thus the `edgeMate` step can be seen to iterate an \"edge loop\" of two locations for an\n * interior edge.\n * * Invalid Walkers:\n *   * An invalid walker has undefined [[edgeIndex]]. For these walkers, [[isUndefined]] returns true, and [[isValid]]\n * returns false. Traversal operations on an invalid walker return an invalid walker.\n *   * Invalid walkers are expected during traversals of a mesh with boundary edges, so calling code must be prepared.\n * Boundary edges have exactly one adjacent facet, so for these edges the `edgeMate` step returns an invalid walker.\n * In the diagram above, the `edgeMate` of boundary edge B is undefined.\n *   * Invalid walkers can occur while traversing boundary vertices as well. If an edge lacks an `edgeMate`, then the\n * `previousAroundVertex` step yields an invalid walker, because `previousAroundVertex` is implemented as `edgeMate`\n * followed by `nextAroundFacet`. In the diagram above, the `previousAroundVertex` step at boundary edge B yields\n * undefined walker. Similarly, the `nextAroundVertex` step at edge F yields undefined walker.\n *   * Invalid walkers can also occur while traversing a non-manifold mesh. Such meshes feature edge(s) with more than\n * two adjacent facets, or with two adjacent facets that have opposite orientations. These meshes are uncommon, and\n * usually indicate a construction problem.\n *   * Note that a null edge, for which the start and end vertex is the same, does not yield an invalid walker.\n * * See [[buildEdgeMateIndices]] for further description of the topological relations.\n * @public\n */\nexport class IndexedPolyfaceWalker {\n  /** The polyface being traversed. */\n  private _polyface: IndexedPolyface;\n  /** The current edgeIndex into the polyface. */\n  private _edgeIndex: number | undefined;\n  /** Constructor */\n  private constructor(polyface: IndexedPolyface, edgeIndex: number | undefined) {\n    this._polyface = polyface;\n    this._edgeIndex = edgeIndex;\n  }\n  /**\n   * Return the edge index of this walker.\n   * * This is an index into the polyface's `data.pointIndex` array.\n   * * Can be undefined.\n   */\n  public get edgeIndex(): number | undefined {\n    return this._edgeIndex;\n  }\n\n  /** Return the polyface of this walker. */\n  public get polyface(): IndexedPolyface {\n    return this._polyface;\n  }\n  /**\n   * Return true if the walker's edgeIndex is defined.\n   * * This method is the opposite of [[isUndefined]].\n   */\n  public get isValid(): boolean {\n    return this._edgeIndex !== undefined;\n  }\n  /**\n   * Return true if the walker's edgeIndex is undefined.\n   * * This method is the opposite of [[isValid]].\n   * * This can happen during a walk when the walker `w` reaches an exterior edge, for then\n   * `w.edgeMate(w).isUndefined === true`.\n   * * This can also happen when methods that return a walker receive invalid input.\n   */\n  public get isUndefined(): boolean {\n    return this._edgeIndex === undefined;\n  }\n  /** Whether the walker is at a null edge, i.e. an edge with no length. */\n  public get isNull(): boolean {\n    return this.isValid && this._polyface.data.edgeIndexToEdgeMateIndex(this._edgeIndex) === this._edgeIndex;\n  }\n  /**\n   * Create a walker for a given polyface at an optional edge.\n   * @param polyface reference to the client polyface. This reference is captured (the polyface is not copied).\n   * @param edgeIndex optional indication of where to start the walker within the mesh.\n   * * If the edgeIndex is valid for the input polyface, the new walker is started there.\n   * * If the edgeIndex is undefined or invalid for the input polyface, the walker returns true for [[isUndefined]].\n   */\n  public static createAtEdgeIndex(polyface: IndexedPolyface, edgeIndex?: number): IndexedPolyfaceWalker {\n    if (!polyface.data.isValidEdgeIndex(edgeIndex))\n      edgeIndex = undefined;\n    return new IndexedPolyfaceWalker(polyface, edgeIndex);\n  }\n  /**\n   * Create a walker for a given polyface at a specified facet.\n   * * If `facetIndex` or `offsetWithinFacet` is invalid for the input polyface, the walker returns true for\n   * [[isUndefined]].\n   * @param polyface the polyface to reference\n   * @param facetIndex index of the facet to reference\n   * @param offsetWithinFacet optional 0-based offset within the face loop of the facet (default 0). This allows\n   * the caller to start the walker at a particular edge of the facet.\n   */\n  public static createAtFacetIndex(polyface: IndexedPolyface, facetIndex: number, offsetWithinFacet: number = 0): IndexedPolyfaceWalker {\n    if (polyface.isValidFacetIndex(facetIndex)) {\n      const k0 = polyface.facetIndex0(facetIndex);\n      const k1 = polyface.facetIndex1(facetIndex);\n      if (0 <= offsetWithinFacet && k0 + offsetWithinFacet < k1)\n        return new IndexedPolyfaceWalker(polyface, k0 + offsetWithinFacet);\n    }\n    return new IndexedPolyfaceWalker(polyface, undefined);\n  }\n  /**\n   * Create a walker at the facet specified by a visitor.\n   * @param visitor visitor whose currentReadIndex identifies the facet.\n   * @param offsetWithinFacet optional 0-based offset within the face loop of the facet (default 0). This allows\n   * the caller to start the walker at a particular edge of the facet.\n   */\n  public static createAtVisitor(visitor: IndexedPolyfaceVisitor, offsetWithinFacet: number = 0): IndexedPolyfaceWalker {\n    const facetIndex = visitor.currentReadIndex();\n    return IndexedPolyfaceWalker.createAtFacetIndex(visitor.clientPolyface(), facetIndex, offsetWithinFacet);\n  }\n  /**\n   * Create a new IndexedPolyfaceWalker from the instance.\n   * * The returned walker refers to the same polyface and edge as the instance.\n   * @param result optional receiver to modify and return.\n   */\n  public clone(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    if (result) {\n      result._polyface = this._polyface;\n      result._edgeIndex = this._edgeIndex;\n      return result;\n    }\n    return new IndexedPolyfaceWalker(this._polyface, this._edgeIndex);\n  }\n  /**\n   * Load the walker's facet into the given visitor.\n   * @returns true if the visitor and walker reference the same polyface and the walker has a valid edge index.\n   */\n  public loadVisitor(visitor: IndexedPolyfaceVisitor): boolean {\n    if (visitor.clientPolyface() !== this._polyface)\n      return false;\n    const facetIndex = this._polyface.edgeIndexToFacetIndex(this._edgeIndex);\n    return (facetIndex !== undefined) ? visitor.moveToReadIndex(facetIndex) : false;\n  }\n  /**\n   * Test if two walkers are at different edges in the same polyface.\n   * * If either has undefined edge, return false.\n   * * If they are in different polyfaces, return false.\n   * * If they are the same edge in the same polyface, return false.\n   * * Otherwise return true.\n   */\n  public isDifferentEdgeInSamePolyface(other: IndexedPolyfaceWalker): boolean {\n    if (this.isUndefined || other.isUndefined)\n      return false;\n    return this._polyface === other._polyface && this._edgeIndex !== other.edgeIndex;\n  }\n  /**\n   * Test if two walkers are in the same polyface at the same edge.\n   * * If either has undefined edge, return false.\n   * * If they are in different polyfaces, return false.\n   * * If they are the same edge in the same polyface, return true.\n   */\n  public isSameEdge(other: IndexedPolyfaceWalker): boolean {\n    return this._polyface === other._polyface && this.isValid && this._edgeIndex === other._edgeIndex;\n  }\n\n  /**\n   * Return a walker with given edgeIndex and polyface from the calling instance.\n   * * If `result` is supplied, that walker is filled and returned.\n   * * If `result` is not supplied, a new walker is created.\n   */\n  private createResult(result: undefined | IndexedPolyfaceWalker, edgeIndex: undefined | number): IndexedPolyfaceWalker {\n    if (result === undefined)\n      return new IndexedPolyfaceWalker(this._polyface, edgeIndex);\n    result._polyface = this._polyface;\n    result._edgeIndex = edgeIndex;\n    return result;\n  }\n  /**\n   * Return a walker (new or reused) at the next edge around the facet.\n   * * \"Next\" is in the order of indices in the face loop of this facet.\n   * * If the instance has undefined edgeIndex, the result also has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public nextAroundFacet(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    const k = this._edgeIndex;\n    if (k === undefined)\n      return this.createResult(result, undefined);\n    const facetIndex = this._polyface.edgeIndexToFacetIndex(k);\n    if (facetIndex === undefined)\n      return this.createResult(result, undefined);\n    const k2 = this._polyface.facetIndex1(facetIndex);\n    const k1 = k + 1;\n    if (k1 < k2)\n      return this.createResult(result, k1);\n    return this.createResult(result, this._polyface.facetIndex0(facetIndex));\n  }\n  /**\n   * Return a walker (new or reused) at the previous edge around the facet.\n   * * \"Previous\" is in the reverse order of indices in the face loop of this facet.\n   * * If the instance has undefined edgeIndex, the result also has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public previousAroundFacet(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    let k = this._edgeIndex;\n    if (k === undefined)\n      return this.createResult(result, undefined);\n    const facetIndex = this._polyface.edgeIndexToFacetIndex(k);\n    if (facetIndex === undefined)\n      return this.createResult(result, undefined);\n    const k0 = this._polyface.facetIndex0(facetIndex);\n    if (k === k0)\n      k = this._polyface.facetIndex1(facetIndex) - 1;\n    else\n      k--;\n    return this.createResult(result, k);\n  }\n  /**\n   * Return a walker (new or reused) at the edge mate of this walker's edge.\n   * * The returned walker has undefined edgeIndex if:\n   *   * the instance is at a boundary edge, i.e., there is no facet on the other side, or\n   *   * the instance has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public edgeMate(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    return this.createResult(result, this._polyface.data.edgeIndexToEdgeMateIndex(this._edgeIndex));\n  }\n  /**\n   * Return a walker (new or reused) at the next outbound edge around the vertex at the base of this walker's edge.\n   * * If the facet is viewed so that its \"nextAroundFacet\" direction appears counterclockwise, then the \"next\"\n   * outbound edge is counterclockwise around the base vertex.\n   * * The returned walker has undefined edgeIndex if:\n   *   * the previous edge around the facet is a boundary edge, i.e., there is no facet on the other side, or\n   *   * the instance has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public nextAroundVertex(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    const result1 = this.previousAroundFacet(result);\n    return result1.edgeMate(result1);\n  }\n  /**\n   * Return a walker (new or reused) at the previous outbound edge around the vertex at the base of this walker's edge.\n   * * If the facet is viewed so that its \"nextAroundFacet\" direction appears counterclockwise, then the \"previous\"\n   * outbound edge is clockwise around the base vertex.\n   * * The returned walker has undefined edgeIndex if:\n   *   * the instance edge is a boundary edge, i.e., there is no facet on the other side, or\n   *   * the instance has undefined edgeIndex.\n   * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker\n   * to the new location and return it.\n   */\n  public previousAroundVertex(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker {\n    const result1 = this.edgeMate(result);\n    return result1.nextAroundFacet(result1);\n  }\n\n  /**\n   * Build the edgeMate index array into the polyface's [[PolyfaceData]].\n   * After this method:\n   * * The array `polyface.data.edgeMateIndex` is defined with the same length as the other PolyfaceData index arrays.\n   * * For each interior edge, `polyface.data.edgeIndexToEdgeMateIndex` returns the edge index on the other side of the\n   * edge in the adjacent facet.\n   * * The conditions for edgeMate matching are:\n   *   * Given facetIndex f, let `k0 = polyface.facetIndex0(f)` and `k1 = polyface.facetIndex1(f)`.\n   *   * Every edge index k in the face loop of facet f satisfies `k0 <= k < k1`.\n   *   * The edge with edge index k starts at the point with index `polyface.data.pointIndex[k]`.\n   *   * Let kA be an edge index in this range [k0,k1), and let kB be its in-range successor with cyclic wrap, i.e.,\n   * `kB === (kA + 1 === k1) ? k0 : kA + 1`.\n   *   * Then `polyface.data.pointIndex[kA]` and `polyface.data.pointIndex[kB]` are the indices of the points at the\n   * start and end of an edge of that facet.\n   *   * We call kA the _edge index_ for that edge, and kB the _edge index_ for the next edge around the facet.\n   *   * If kA is a positive-length interior edge in a 2-manifold mesh with properly oriented facets, then there is\n   * an adjacent facet whose face loop contains edge indices kC and kD referencing the same edge vertices in reverse\n   * order, i.e.,\n   *     * `polyface.data.pointIndex[kA] === polyface.data.pointIndex[kD]`\n   *     * `polyface.data.pointIndex[kB] === polyface.data.pointIndex[kC]`\n   *   * We call the edge indices kA and kC _edge mates_, denoted in the `edgeMateIndex` array by:\n   *     * `polyface.data.edgeMateIndex[kA] === kC`\n   *     * `polyface.data.edgeMateIndex[kC] === kA`\n   *   * If kA is zero-length interior edge, i.e, it has the same start and end point indices, then we call it a _null\n   * edge_, and its edge mate is itself.\n   * * A non-interior edge either lies on the boundary of the mesh, or is non-manifold (having more than 2 adjacent\n   * facets, or 1 with the wrong orientation). These edges have no edge mate, represented as `undefined` in\n   * the `edgeMateIndex` array.\n   * * These conditions define a conventional manifold mesh where each edge of a facet has at most one partner edge with\n   * opposite orientation in an adjacent facet.\n   * * After calling this method, the caller can construct `IndexedPolyfaceWalker` objects to traverse the mesh by\n   * walking across edges, around faces, and around vertices. Let walkerA have edge index value kA. Then with the\n   * aforementioned edge indices:\n   *   * `walkerC = walkerA.edgeMate()` moves across the edge to its other end, at kC.\n   *   * `walkerB = walkerA.nextAroundFacet()` moves around the facet to the next edge, at kB.\n   *   * `walkerB.previousAroundFacet()` moves from kB back to kA.\n   *   * `walkerD = walkerA.previousAroundVertex()` moves around the vertex to the next edge kD.\n   *   * `walkerD1 = walkerC.nextAroundFacet()` also moves to kD.\n   *   * `walkerD.nextAroundVertex()` moves from kD back to kA.\n   */\n  public static buildEdgeMateIndices(polyface: IndexedPolyface): void {\n    const matcher = new IndexedEdgeMatcher();\n    const numFacet = polyface.facetCount;\n    for (let facetIndex = 0; facetIndex < numFacet; facetIndex++) {\n      const kStart = polyface.facetIndex0(facetIndex);\n      const kEnd = polyface.facetIndex1(facetIndex);\n      let k0 = kEnd - 1;\n      // sneaky: addEdge 3rd arg is edge index k0 instead of facetIndex; it gets carried around during matching\n      for (let k1 = kStart; k1 < kEnd; k0 = k1, k1++)\n        matcher.addEdge(polyface.data.pointIndex[k0], polyface.data.pointIndex[k1], k0);\n    }\n    const matchedPairs: SortableEdgeCluster[] = [];\n    const nullEdges: SortableEdgeCluster[] = [];\n    matcher.sortAndCollectClusters(matchedPairs, undefined, nullEdges, undefined);\n    const numIndex = polyface.data.pointIndex.length;\n    polyface.data.edgeMateIndex = new Array<number | undefined>(numIndex);\n    for (let i = 0; i < numIndex; i++)\n      polyface.data.edgeMateIndex[i] = undefined; // boundary and non-manifold edges have no mate\n    for (const pair of matchedPairs) {\n      if (Array.isArray(pair) && pair.length === 2) {\n        const edgeIndex0 = pair[0].facetIndex;\n        const edgeIndex1 = pair[1].facetIndex;\n        polyface.data.edgeMateIndex[edgeIndex0] = edgeIndex1; // paired edges point to each other\n        polyface.data.edgeMateIndex[edgeIndex1] = edgeIndex0;\n      }\n    }\n    for (const nullEdgeOrCluster of nullEdges) {\n      const nullCluster = Array.isArray(nullEdgeOrCluster) ? nullEdgeOrCluster : [nullEdgeOrCluster];\n      for (const nullEdge of nullCluster) {\n        const edgeIndex = nullEdge.facetIndex;\n        polyface.data.edgeMateIndex[edgeIndex] = edgeIndex; // a null edge points to itself\n      }\n    }\n  }\n}\n\n"]}

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

@@ -287,23 +287,35 @@ export declare class IndexedPolyface extends Polyface {
     setNewFaceData(endFacetIndex?: number): boolean;
     /** Second step of double dispatch: call `handler.handleIndexedPolyface(this)`. */
     dispatchToGeometryHandler(handler: GeometryHandler): any;
+    /** If the input accesses an edgeMateIndex array, return it along with the owning IndexedPolyface. */
+    static hasEdgeMateIndex(polyface: Polyface | PolyfaceVisitor): {
+        parent: IndexedPolyface;
+        edgeMateIndex: Array<number | undefined>;
+    } | undefined;
 }
 /**
- * A PolyfaceVisitor manages data while walking through facets.
+ * A PolyfaceVisitor manages data while iterating facets.
  * * The polyface visitor holds data for one facet at a time.
  * * The caller can request the position in the addressed polyfaceData as a "readIndex".
  * * The readIndex values (as numbers) are not assumed to be sequential (i.e., they might be contiguous facet indices
  * or the indexing scheme might have gaps at the whim of the particular PolyfaceVisitor implementation).
+ * * Example usage:
+ * ```
+ * const visitor = myPolyface.createVisitor();
+ * for (visitor.reset(); visitor.moveToNextFacet(); ) {
+ *   // process the current facet
+ * }
+ * ```
  * @public
  */
 export interface PolyfaceVisitor extends PolyfaceData {
     /** Load data for the facet with given index. */
     moveToReadIndex(index: number): boolean;
-    /** Return the readIndex of the currently loaded facet. */
+    /** Return the index of the currently loaded facet. */
     currentReadIndex(): number;
     /** Load data for the next facet. */
     moveToNextFacet(): boolean;
-    /** Reset to initial state for reading all facets sequentially with moveToNextFacet. */
+    /** Restart the visitor at the first facet. */
     reset(): void;
     /** Return the point index of vertex i within the currently loaded facet. */
     clientPointIndex(i: number): number;
@@ -341,5 +353,7 @@ export interface PolyfaceVisitor extends PolyfaceData {
      * * Allows implementers to improve the efficiency of e.g., [[PolyfaceQuery.visitorClientFacetCount]].
      */
     getVisitableFacetCount?(): number;
+    /** Create a visitor for a subset of the facets visitable by the instance. */
+    createSubsetVisitor?(facetIndices: number[], numWrap: number): PolyfaceVisitor;
 }
 //# sourceMappingURL=Polyface.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"Polyface.d.ts","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAKA;;GAEG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,8BAAsB,QAAS,SAAQ,aAAa;IAClD,wCAAwC;IACxC,SAAgB,gBAAgB,cAAc;IAC9C,gCAAgC;IACzB,IAAI,EAAE,YAAY,CAAC;IAC1B,kBAAkB;IAClB,SAAS,aAAa,IAAI,EAAE,YAAY;IAIxC;;;OAGG;aACa,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,eAAe;IAC/D;;OAEG;IACH,IAAW,QAAQ,IAGQ,OAAO,CADjC;IACD,IAAW,QAAQ,CAAC,KAAK,EAAE,OAAO,EAEjC;IACD;;;;OAIG;IACH,IAAW,eAAe,IAAI,MAAM,CAEnC;IACD,IAAW,eAAe,CAAC,KAAK,EAAE,MAAM,EAEvC;IACD;;;;;;;;;;OAUG;WACW,eAAe,CAC3B,OAAO,EAAE,MAAM,EAAE,GAAG,SAAS,EAC7B,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,EACtB,IAAI,EAAE,GAAG,EACT,UAAU,EAAE,MAAM,GACjB,OAAO;IAcV,mDAAmD;IACnD,aAAoB,OAAO,IAAI,OAAO,CAAC;IACvC,iFAAiF;IACjF,IAAW,UAAU,IAAI,MAAM,GAAG,SAAS,CAE1C;CACF;AAED;;;;GAIG;AACH,qBAAa,eAAgB,SAAQ,QAAQ;IAC3C;;;;;;;OAOG;IACH,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;IAChC;;;OAGG;IACH,SAAS,CAAC,gBAAgB,EAAE,MAAM,EAAE,CAAC;IACrC;;;;;OAKG;IACH,SAAS,aAAa,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,eAAe,CAAC,EAAE,MAAM,EAAE;IAc3F,4GAA4G;IACrG,qBAAqB,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS;IAKvE;;;;;OAKG;IACI,mBAAmB,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS;IAOtE,wDAAwD;IACjD,mBAAmB,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAG/C,0DAA0D;IAC1C,aAAa,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAQlD,gFAAgF;IAChF,IAAW,OAAO,IAAI,OAAO,CAE5B;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAMzD,0CAA0C;IACnC,kBAAkB,CAAC,OAAO,EAAE,MAAM;IAGzC,2BAA2B;IACpB,KAAK,IAAI,eAAe;IAG/B;;;OAGG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,eAAe;IAK9D,sDAAsD;IAC/C,cAAc;IAGrB,mDAAmD;IAC5C,cAAc;IAGrB;;;;MAIE;IACK,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAQ3D;;;;;;OAMG;IACI,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,GAAG,SAAS;IAsGtG;;;;;;OAMG;IACH,IAAW,wBAAwB,IAAI,MAAM,CAE5C;IACD;;;;;;OAMG;WACW,MAAM,CAClB,WAAW,GAAE,OAAe,EAC5B,UAAU,GAAE,OAAe,EAC3B,UAAU,GAAE,OAAe,EAC3B,QAAQ,GAAE,OAAc,GACvB,eAAe;IAGlB;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM;IAS5D;;;;;;OAMG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAI3D;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAMvC;;;;;;;OAOG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IAU3F;;;;;;OAMG;IACI,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IAoBtF;;;;;;OAMG;IACI,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5D;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAMtC,mDAAmD;IAC5C,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,OAAc,GAAG,IAAI;IAIlE,0BAA0B;IACnB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAK1C,yBAAyB;IAClB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKzC,yBAAyB;IAClB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKzC;;;;OAIG;IACI,gBAAgB,IAAI,IAAI;IAI/B;;;;;OAKG;IACI,kBAAkB,CAAC,MAAM,GAAE,MAAU,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,OAAO;IAoCzE;;;;;;;OAOG;IACI,cAAc,CAAC,kBAAkB,GAAE,OAAc,GAAG,MAAM,EAAE,GAAG,SAAS;IAmB/E,6CAA6C;IAC7C,IAAoB,UAAU,IAAI,MAAM,CAEvC;IACD,4CAA4C;IAC5C,IAAW,SAAS,IAAI,MAAM,CAE7B;IACD,6CAA6C;IAC7C,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,6CAA6C;IAC7C,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,iDAAiD;IACjD,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,8CAA8C;IAC9C,IAAW,WAAW,IAAI,MAAM,CAE/B;IACD,8CAA8C;IACvC,iBAAiB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAGrD,wDAAwD;IACjD,cAAc,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAKjD;;;;;;;;;;;;;OAaG;IACI,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAG9C;;;OAGG;IACI,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAG9C,2GAA2G;IAC3G,IAAW,UAAU,IAAI,aAAa,CAAC,MAAM,CAAC,CAE7C;IACD,yCAAyC;IAClC,aAAa,CAAC,OAAO,GAAE,MAAU,GAAG,sBAAsB;IAGjE,wEAAwE;IACxD,KAAK,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAGvE,sDAAsD;IAC/C,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAG/D;;;OAGG;IACI,uBAAuB,CAAC,UAAU,EAAE,MAAM,GAAG,aAAa;IAGjE;;;;OAIG;IACI,cAAc,CAAC,aAAa,GAAE,MAAU,GAAG,OAAO;IA0BzD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,eAAgB,SAAQ,YAAY;IACnD,gDAAgD;IAChD,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;IACxC,0DAA0D;IAC1D,gBAAgB,IAAI,MAAM,CAAC;IAC3B,oCAAoC;IACpC,eAAe,IAAI,OAAO,CAAC;IAC3B,uFAAuF;IACvF,KAAK,IAAI,IAAI,CAAC;IACd,4EAA4E;IAC5E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,4EAA4E;IAC5E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,6EAA6E;IAC7E,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACrC,4EAA4E;IAC5E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,+EAA+E;IAC/E,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAClC,kCAAkC;IAClC,cAAc,IAAI,QAAQ,GAAG,SAAS,CAAC;IACvC;;;;;;;;OAQG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,wGAAwG;IACxG,WAAW,IAAI,IAAI,CAAC;IACpB,6FAA6F;IAC7F,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1D;;;OAGG;IACH,wBAAwB,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACzG;;;OAGG;IACH,sBAAsB,CAAC,IAAI,MAAM,CAAC;CACnC"}
+{"version":3,"file":"Polyface.d.ts","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAKA;;GAEG;AAIH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAEvD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAGhE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;GAIG;AACH,8BAAsB,QAAS,SAAQ,aAAa;IAClD,wCAAwC;IACxC,SAAgB,gBAAgB,cAAc;IAC9C,gCAAgC;IACzB,IAAI,EAAE,YAAY,CAAC;IAC1B,kBAAkB;IAClB,SAAS,aAAa,IAAI,EAAE,YAAY;IAIxC;;;OAGG;aACa,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,eAAe;IAC/D;;OAEG;IACH,IAAW,QAAQ,IAGQ,OAAO,CADjC;IACD,IAAW,QAAQ,CAAC,KAAK,EAAE,OAAO,EAEjC;IACD;;;;OAIG;IACH,IAAW,eAAe,IAAI,MAAM,CAEnC;IACD,IAAW,eAAe,CAAC,KAAK,EAAE,MAAM,EAEvC;IACD;;;;;;;;;;OAUG;WACW,eAAe,CAC3B,OAAO,EAAE,MAAM,EAAE,GAAG,SAAS,EAC7B,cAAc,EAAE,MAAM,EACtB,cAAc,EAAE,MAAM,EACtB,IAAI,EAAE,GAAG,EACT,UAAU,EAAE,MAAM,GACjB,OAAO;IAcV,mDAAmD;IACnD,aAAoB,OAAO,IAAI,OAAO,CAAC;IACvC,iFAAiF;IACjF,IAAW,UAAU,IAAI,MAAM,GAAG,SAAS,CAE1C;CACF;AAED;;;;GAIG;AACH,qBAAa,eAAgB,SAAQ,QAAQ;IAC3C;;;;;;;OAOG;IACH,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,CAAC;IAChC;;;OAGG;IACH,SAAS,CAAC,gBAAgB,EAAE,MAAM,EAAE,CAAC;IACrC;;;;;OAKG;IACH,SAAS,aAAa,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,EAAE,eAAe,CAAC,EAAE,MAAM,EAAE;IAc3F,4GAA4G;IACrG,qBAAqB,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,MAAM,GAAG,SAAS;IAKvE;;;;;OAKG;IACI,mBAAmB,CAAC,CAAC,EAAE,MAAM,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS;IAOtE,wDAAwD;IACjD,mBAAmB,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAG/C,0DAA0D;IAC1C,aAAa,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAQlD,gFAAgF;IAChF,IAAW,OAAO,IAAI,OAAO,CAE5B;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAMzD,0CAA0C;IACnC,kBAAkB,CAAC,OAAO,EAAE,MAAM;IAGzC,2BAA2B;IACpB,KAAK,IAAI,eAAe;IAG/B;;;OAGG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,eAAe;IAK9D,sDAAsD;IAC/C,cAAc;IAGrB,mDAAmD;IAC5C,cAAc;IAGrB;;;;MAIE;IACK,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,aAAa,GAAG,SAAS;IAQ3D;;;;;;OAMG;IACI,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,GAAG,SAAS;IAsGtG;;;;;;OAMG;IACH,IAAW,wBAAwB,IAAI,MAAM,CAE5C;IACD;;;;;;OAMG;WACW,MAAM,CAClB,WAAW,GAAE,OAAe,EAC5B,UAAU,GAAE,OAAe,EAC3B,UAAU,GAAE,OAAe,EAC3B,QAAQ,GAAE,OAAc,GACvB,eAAe;IAGlB;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,GAAG,MAAM;IAS5D;;;;;;OAMG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAI3D;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAMvC;;;;;;;OAOG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IAU3F;;;;;;OAMG;IACI,SAAS,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,GAAG,MAAM;IAoBtF;;;;;;OAMG;IACI,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAM5D;;;;OAIG;IACI,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM;IAMtC,mDAAmD;IAC5C,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,OAAc,GAAG,IAAI;IAIlE,0BAA0B;IACnB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAK1C,yBAAyB;IAClB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKzC,yBAAyB;IAClB,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKzC;;;;OAIG;IACI,gBAAgB,IAAI,IAAI;IAI/B;;;;;OAKG;IACI,kBAAkB,CAAC,MAAM,GAAE,MAAU,EAAE,MAAM,CAAC,EAAE,MAAM,EAAE,GAAG,OAAO;IAoCzE;;;;;;;OAOG;IACI,cAAc,CAAC,kBAAkB,GAAE,OAAc,GAAG,MAAM,EAAE,GAAG,SAAS;IAmB/E,6CAA6C;IAC7C,IAAoB,UAAU,IAAI,MAAM,CAEvC;IACD,4CAA4C;IAC5C,IAAW,SAAS,IAAI,MAAM,CAE7B;IACD,6CAA6C;IAC7C,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,6CAA6C;IAC7C,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,iDAAiD;IACjD,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,8CAA8C;IAC9C,IAAW,WAAW,IAAI,MAAM,CAE/B;IACD,8CAA8C;IACvC,iBAAiB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAGrD,wDAAwD;IACjD,cAAc,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAKjD;;;;;;;;;;;;;OAaG;IACI,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAG9C;;;OAGG;IACI,WAAW,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAG9C,2GAA2G;IAC3G,IAAW,UAAU,IAAI,aAAa,CAAC,MAAM,CAAC,CAE7C;IACD,yCAAyC;IAClC,aAAa,CAAC,OAAO,GAAE,MAAU,GAAG,sBAAsB;IAGjE,wEAAwE;IACxD,KAAK,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAGvE,sDAAsD;IAC/C,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,IAAI;IAG/D;;;OAGG;IACI,uBAAuB,CAAC,UAAU,EAAE,MAAM,GAAG,aAAa;IAGjE;;;;OAIG;IACI,cAAc,CAAC,aAAa,GAAE,MAAU,GAAG,OAAO;IA0BzD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;IAG/D,qGAAqG;WACvF,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,GAAG;QAAE,MAAM,EAAE,eAAe,CAAC;QAAC,aAAa,EAAE,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,CAAA;KAAE,GAAG,SAAS;CAcxJ;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,eAAgB,SAAQ,YAAY;IACnD,gDAAgD;IAChD,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC;IACxC,sDAAsD;IACtD,gBAAgB,IAAI,MAAM,CAAC;IAC3B,oCAAoC;IACpC,eAAe,IAAI,OAAO,CAAC;IAC3B,8CAA8C;IAC9C,KAAK,IAAI,IAAI,CAAC;IACd,4EAA4E;IAC5E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,4EAA4E;IAC5E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,6EAA6E;IAC7E,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACrC,4EAA4E;IAC5E,gBAAgB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACpC,+EAA+E;IAC/E,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAClC,kCAAkC;IAClC,cAAc,IAAI,QAAQ,GAAG,SAAS,CAAC;IACvC;;;;;;;;OAQG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,wGAAwG;IACxG,WAAW,IAAI,IAAI,CAAC;IACpB,6FAA6F;IAC7F,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1D;;;OAGG;IACH,wBAAwB,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACzG;;;OAGG;IACH,sBAAsB,CAAC,IAAI,MAAM,CAAC;IAClC,6EAA6E;IAC7E,mBAAmB,CAAC,CAAC,YAAY,EAAE,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,GAAG,eAAe,CAAC;CAChF"}

package/lib/esm/polyface/Polyface.js

@@ -654,5 +654,21 @@ export class IndexedPolyface extends Polyface {
     dispatchToGeometryHandler(handler) {
         return handler.handleIndexedPolyface(this);
     }
+    /** If the input accesses an edgeMateIndex array, return it along with the owning IndexedPolyface. */
+    static hasEdgeMateIndex(polyface) {
+        let parent;
+        if (polyface instanceof Polyface) {
+            if (polyface instanceof IndexedPolyface)
+                parent = polyface;
+        }
+        else if (polyface.clientPolyface() && polyface.clientPolyface() instanceof IndexedPolyface)
+            parent = polyface.clientPolyface();
+        if (parent) {
+            const edgeMateIndex = parent.data.edgeMateIndex;
+            if (edgeMateIndex && edgeMateIndex.length > 0 && edgeMateIndex.length === parent.data.indexCount)
+                return { parent, edgeMateIndex };
+        }
+        return undefined;
+    }
 }
 //# sourceMappingURL=Polyface.js.map