@itwin/core-geometry 5.0.0-dev.6 → 5.0.0-dev.61

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

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

@@ -0,0 +1,233 @@
+import { IndexedPolyfaceVisitor } from "./IndexedPolyfaceVisitor";
+import { IndexedPolyface } from "./Polyface";
+/**
+ * The `IndexedPolyfaceWalker` class supports navigation around facets, across edges, and around vertices in an
+ * [[IndexedPolyface]].
+ * * Compare to the [[IndexedPolyfaceVisitor]] class, which supports the iteration of facets in an `IndexedPolyface`.
+ * * A one-time call to [[buildEdgeMateIndices]] creates and populates the `data.edgeMateIndex` array on the input.
+ *   * This array essentially completes the topology of the `IndexedPolyface` by storing facet adjacency.
+ * * After this setup, caller code can create `IndexedPolyfaceWalker` objects via:
+ *   * `walker = IndexedPolyfaceWalker.createAtFacetIndex(polyface, facetIndex, offsetWithinFacet)`
+ *   * `walker = IndexedPolyfaceWalker.createAtEdgeIndex(polyface, edgeIndex)`
+ *   * `walker = IndexedPolyfaceWalker.createAtVisitor(visitor, offsetWithinFacet)`
+ * * Once you have a walker object, you can traverse the facet, edge, and vertex loops it references. For
+ * example, if `walker.edgeIndex === A`, referring to the right edge of the upper left facet pictured below, then
+ * the following are true:
+ *   * `walker.nextAroundFacet().edgeIndex === B`
+ *   * `walker.previousAroundFacet().edgeIndex === C`
+ *   * `walker.edgeMate().edgeIndex === F`
+ *   * `walker.nextAroundVertex().edgeIndex === E`
+ *   * `walker.previousAroundVertex().edgeIndex === D`
+* ```
+ *      # --------- # --------- #
+ *      |   < < < B | F         |
+ *      |         ^ | v         |
+ *      |         ^ | v         |
+ *      |         ^ | v         |
+ *      | C > > > A | D > > >   |
+ *      # --------- # --------- #
+ *      |   < < < E |           |
+ *      |           |           |
+ *      |           |           |
+ *      |           |           |
+ *      # --------- # --------- #
+ * ```
+* * When facets are viewed so that the face loops stored in the [[PolyfaceData]] `pointIndex` array have
+ * counterclockwise ordering, an edge "from A to B" has facet area to the left and the edge to the right. Likewise,
+ * the edges "out of" locations B, C, E, F, D are directed as depicted above.
+ * * With this conventional counterclockwise ordering of face loops, "next" is counterclockwise, and "previous" is
+ * clockwise:
+ *   * The [[nextAroundFacet]] step is counterclockwise around the facet.
+ *   * The [[previousAroundFacet]] step is clockwise around the facet.
+ *   * The [[nextAroundVertex]] step is counterclockwise around the vertex.
+ *   * 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.
+ * * 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.
+ *   * Invalid walkers are expected during traversals of a mesh with boundary edges, so calling code must be prepared.
+ * Boundary edges have exactly one adjacent facet, so for these edges the `edgeMate` step returns an invalid walker.
+ * In the diagram above, the `edgeMate` of boundary edge B is undefined.
+ *   * Invalid walkers can occur while traversing boundary vertices as well. If an edge lacks an `edgeMate`, then the
+ * `previousAroundVertex` step yields an invalid walker, because `previousAroundVertex` is implemented as `edgeMate`
+ * followed by `nextAroundFacet`. In the diagram above, the `previousAroundVertex` step at boundary edge B yields
+ * undefined walker. Similarly, the `nextAroundVertex` step at edge F yields undefined walker.
+ *   * 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.
+ * * See [[buildEdgeMateIndices]] for further description of the topological relations.
+ * @public
+ */
+export declare class IndexedPolyfaceWalker {
+    /** The polyface being traversed. */
+    private _polyface;
+    /** The current edgeIndex into the polyface. */
+    private _edgeIndex;
+    /** Constructor */
+    private constructor();
+    /**
+     * Return the edge index of this walker.
+     * * This is an index into the polyface's `data.pointIndex` array.
+     * * Can be undefined.
+     */
+    get edgeIndex(): number | undefined;
+    /** Return the polyface of this walker. */
+    get polyface(): IndexedPolyface | undefined;
+    /**
+     * Return true if the walker's edgeIndex is defined.
+     * * This method is the opposite of [[isUndefined]].
+     */
+    get isValid(): boolean;
+    /**
+     * Return true if the walker's edgeIndex is undefined.
+     * * This method is the opposite of [[isValid]].
+     * * This can happen during a walk when the walker `w` reaches an exterior edge, for then
+     * `w.edgeMate(w).isUndefined === true`.
+     * * This can also happen when methods that return a walker receive invalid input.
+     */
+    get isUndefined(): 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).
+     * @param edgeIndex optional indication of where to start the walker within the mesh.
+     * * If the edgeIndex is valid for the input polyface, the new walker is started there.
+     * * If the edgeIndex is undefined or invalid for the input polyface, the walker returns true for [[isUndefined]].
+     */
+    static createAtEdgeIndex(polyface: IndexedPolyface, edgeIndex?: number): IndexedPolyfaceWalker;
+    /**
+     * Create a walker for a given polyface at a specified facet.
+     * * If `facetIndex` or `offsetWithinFacet` is invalid for the input polyface, the walker returns true for
+     * [[isUndefined]].
+     * @param polyface the polyface to reference
+     * @param facetIndex index of the facet to reference
+     * @param offsetWithinFacet optional 0-based offset within the face loop of the facet (default 0). This allows
+     * the caller to start the walker at a particular edge of the facet.
+     */
+    static createAtFacetIndex(polyface: IndexedPolyface, facetIndex: number, offsetWithinFacet?: number): IndexedPolyfaceWalker;
+    /**
+     * Create a walker at the facet specified by a visitor.
+     * @param visitor visitor whose currentReadIndex identifies the facet.
+     * @param offsetWithinFacet optional 0-based offset within the face loop of the facet (default 0). This allows
+     * the caller to start the walker at a particular edge of the facet.
+     */
+    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.
+     */
+    clone(edgeIndex?: number): IndexedPolyfaceWalker | undefined;
+    /**
+     * 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.
+     */
+    loadVisitor(visitor: IndexedPolyfaceVisitor): boolean;
+    /**
+     * Test if two walkers are at different edges in the same polyface.
+     * * If either has undefined edge, return false.
+     * * If they are in different polyfaces, return false.
+     * * If they are the same edge in the same polyface, return false.
+     * * Otherwise return true.
+     */
+    isDifferentEdgeInSamePolyface(other: IndexedPolyfaceWalker): boolean;
+    /**
+     * Test if two walkers are in the same polyface at the same edge.
+     * * If either has undefined edge, return false.
+     * * If they are in different polyfaces, return false.
+     * * If they are the same edge in the same polyface, return true.
+     */
+    isSameEdge(other: IndexedPolyfaceWalker): boolean;
+    /**
+     * Return a walker with given edgeIndex and polyface from the calling instance.
+     * * If `result` is supplied, that walker is filled and returned.
+     * * If `result` is not supplied, a new walker is created.
+     */
+    private createResult;
+    /**
+     * Return a walker (new or reused) at the next edge around the facet.
+     * * "Next" is in the order of indices in the face loop of this facet.
+     * * If the instance has undefined edgeIndex, the result also has undefined edgeIndex.
+     * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker
+     * to the new location and return it.
+     */
+    nextAroundFacet(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker;
+    /**
+     * Return a walker (new or reused) at the previous edge around the facet.
+     * * "Previous" is in the reverse order of indices in the face loop of this facet.
+     * * If the instance has undefined edgeIndex, the result also has undefined edgeIndex.
+     * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker
+     * to the new location and return it.
+     */
+    previousAroundFacet(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker;
+    /**
+     * Return a walker (new or reused) at the edge mate of this walker's edge.
+     * * The returned walker has undefined edgeIndex if:
+     *   * the instance is at a boundary edge, i.e., there is no facet on the other side, or
+     *   * the instance has undefined edgeIndex.
+     * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker
+     * to the new location and return it.
+     */
+    edgeMate(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker;
+    /**
+     * Return a walker (new or reused) at the next outbound edge around the vertex at the base of this walker's edge.
+     * * If the facet is viewed so that its "nextAroundFacet" direction appears counterclockwise, then the "next"
+     * outbound edge is counterclockwise around the base vertex.
+     * * The returned walker has undefined edgeIndex if:
+     *   * the previous edge around the facet is a boundary edge, i.e., there is no facet on the other side, or
+     *   * the instance has undefined edgeIndex.
+     * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker
+     * to the new location and return it.
+     */
+    nextAroundVertex(result?: IndexedPolyfaceWalker): IndexedPolyfaceWalker;
+    /**
+     * Return a walker (new or reused) at the previous outbound edge around the vertex at the base of this walker's edge.
+     * * If the facet is viewed so that its "nextAroundFacet" direction appears counterclockwise, then the "previous"
+     * outbound edge is clockwise around the base vertex.
+     * * The returned walker has undefined edgeIndex if:
+     *   * the instance edge is a boundary edge, i.e., there is no facet on the other side, or
+     *   * the instance has undefined edgeIndex.
+     * @param result optional receiver to modify and return. May be the same as `this` to move the instance walker
+     * to the new location and return it.
+     */
+    previousAroundVertex(result?: IndexedPolyfaceWalker): 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
+     * 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.,
+     * `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.,
+     *     * `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.
+     * * 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:
+     *   * `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.
+     *   * `walkerD = walkerA.previousAroundVertex()` moves around the vertex to the next edge kD.
+     *   * `walkerD1 = walkerC.nextAroundFacet()` also moves to kD.
+     *   * `walkerD.nextAroundVertex()` moves from kD back to kA.
+     */
+    static buildEdgeMateIndices(polyface: IndexedPolyface): void;
+}
+//# sourceMappingURL=IndexedPolyfaceWalker.d.ts.map

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

@@ -0,0 +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;CA8B7D"}