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

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,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;YACrB,QAAQ,CAAC,IAAI,CAAC,aAAa,GAAG,SAAS,CAAC;YACxC,OAAO;QACT,CAAC;QACD,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    if (polyface.isEmpty) {\n      polyface.data.edgeMateIndex = undefined;\n      return;\n    }\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

@@ -210,7 +210,7 @@ export declare class IndexedPolyface extends Polyface {
     addColorIndex(index: number): void;
     /**
      * Clean up the open facet.
-     * @deprecated in 4.x to remove nebulous "open facet" concept from the API. Call [[PolyfaceData.trimAllIndexArrays]]
+     * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. To remove nebulous "open facet" concept from the API. Call [[PolyfaceData.trimAllIndexArrays]]
      * instead.
      */
     cleanupOpenFacet(): void;
@@ -276,7 +276,7 @@ export declare class IndexedPolyface extends Polyface {
     extendRange(range: Range3d, transform?: Transform): void;
     /**
      * Given the index of a facet, return the data pertaining to the face it is a part of.
-     * @deprecated in 4.x. Use [[IndexedPolyface.tryGetFaceData]], which verifies the index is in range.
+     * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. Use [[IndexedPolyface.tryGetFaceData]], which verifies the index is in range.
      */
     getFaceDataByFacetIndex(facetIndex: number): FacetFaceData;
     /**
@@ -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

@@ -464,7 +464,7 @@ export class IndexedPolyface extends Polyface {
     }
     /**
      * Clean up the open facet.
-     * @deprecated in 4.x to remove nebulous "open facet" concept from the API. Call [[PolyfaceData.trimAllIndexArrays]]
+     * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. To remove nebulous "open facet" concept from the API. Call [[PolyfaceData.trimAllIndexArrays]]
      * instead.
      */
     cleanupOpenFacet() {
@@ -614,7 +614,7 @@ export class IndexedPolyface extends Polyface {
     }
     /**
      * Given the index of a facet, return the data pertaining to the face it is a part of.
-     * @deprecated in 4.x. Use [[IndexedPolyface.tryGetFaceData]], which verifies the index is in range.
+     * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. Use [[IndexedPolyface.tryGetFaceData]], which verifies the index is in range.
      */
     getFaceDataByFacetIndex(facetIndex) {
         return this.data.face[this._facetToFaceData[facetIndex]];
@@ -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

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

@@ -1 +1 @@
-{"version":3,"file":"Polyface.js","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,2BAA2B;AAE3B,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,OAAO,EAAW,MAAM,qBAAqB,CAAC;AAEvD,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,MAAM,OAAgB,QAAS,SAAQ,aAAa;IAClD,wCAAwC;IACxB,gBAAgB,GAAG,UAAU,CAAC;IAC9C,gCAAgC;IACzB,IAAI,CAAe;IAC1B,kBAAkB;IAClB,YAAsB,IAAkB;QACtC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAMD;;OAEG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC5B,CAAC;IACD,IAAW,QAAQ,CAAC,KAAc;QAChC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IAC7B,CAAC;IACD;;;;OAIG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC;IACnC,CAAC;IACD,IAAW,eAAe,CAAC,KAAa;QACtC,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC;IACpC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,OAA6B,EAC7B,cAAsB,EACtB,cAAsB,EACtB,IAAS,EACT,UAAkB;QAElB,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,IAAI,CAAC;QACd,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,OAAO,CAAC,MAAM;YACxD,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,IAAI,cAAc,IAAI,cAAc,GAAG,OAAO,CAAC,MAAM;YACrE,OAAO,KAAK,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,cAAc,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE;YAClD,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,UAAU;gBAC5C,OAAO,KAAK,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,iFAAiF;IACjF,IAAW,UAAU;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAC3C;;;;;;;OAOG;IACO,WAAW,CAAW;IAChC;;;OAGG;IACO,gBAAgB,CAAW;IACrC;;;;;OAKG;IACH,YAAsB,IAAkB,EAAE,UAAqB,EAAE,eAA0B;QACzF,KAAK,CAAC,IAAI,CAAC,CAAC;QACZ,IAAI,UAAU;YACZ,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;aAChD,CAAC;YACJ,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,eAAe;YACjB,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;;YAE7D,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;IAC/B,CAAC;IAED,4GAA4G;IACrG,qBAAqB,CAAC,CAAqB;QAChD,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,WAAW,CAAC,+BAA+B,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,CAAqB;QAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,wDAAwD;IACjD,mBAAmB,CAAC,KAAU;QACnC,OAAO,KAAK,YAAY,eAAe,CAAC;IAC1C,CAAC;IACD,0DAA0D;IAC1C,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;gBACxC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;gBAC7D,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,gBAAgB,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gFAAgF;IAChF,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;IACzE,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC;YACpC,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0CAA0C;IACnC,kBAAkB,CAAC,OAAe;QACvC,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACjE,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,sDAAsD;IAC/C,cAAc;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7C,CAAC;IACD,mDAAmD;IAC5C,cAAc;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;IAC7B,CAAC;IACD;;;;MAIE;IACK,cAAc,CAAC,CAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM;YAC5C,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACrD,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IACD;;;;;;OAMG;IACI,kBAAkB,CAAC,MAAuB,EAAE,QAAiB,EAAE,SAAgC;QACpG,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;QAC1C,mDAAmD;QACnD,2FAA2F;QAC3F,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAChD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1D,IAAI,SAAS,EAAE,CAAC;gBACd,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;;gBACC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrC,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,oEAAoE;oBAChG,IAAI,CAAC,aAAa,CAChB,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CACjD,CAAC;gBACJ,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,IAAI,CAAC,aAAa,CAChB,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAC3B,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,iCAAiC;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7G,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,0DAA0D;gBACpG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;QACD,mCAAmC;QACnC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAChH,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAE,CAAC;gBAC5E,IAAI,SAAS;oBACX,SAAS,CAAC,cAAc,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;gBACvD,IAAI,QAAQ;oBACV,YAAY,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YAC/B,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,0DAA0D;gBACpG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,cAAc,CAAC,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,cAAc,CAAC,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;QACH,CAAC;QACD,iCAAiC;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7G,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAChD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK;gBACzC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,yDAAyD;gBACnG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;QACD,sCAAsC;QACtC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YACjD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACpC,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACtC,CAAC;YACD,KAAK,MAAM,cAAc,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBACrD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,GAAG,cAAc,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACH,IAAW,wBAAwB;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACnE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,CAClB,cAAuB,KAAK,EAC5B,aAAsB,KAAK,EAC3B,aAAsB,KAAK,EAC3B,WAAoB,IAAI;QAExB,OAAO,IAAI,eAAe,CAAC,IAAI,YAAY,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAc,EAAE,UAAmB;QACjD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACzE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;gBACpE,OAAO,UAAU,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAc;QAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;OAOG;IACI,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,WAAoB,EAAE,WAAoB;QAChF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC1C,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,WAAW,CAAC;QACrB,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,WAAW,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACI,SAAS,CAAC,MAAgB,EAAE,WAAoB,EAAE,WAAoB;QAC3E,8DAA8D;QAC9D,MAAM,iBAAiB,GAAG,CAAC,CAAS,EAAE,EAAE;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC,oBAAoB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACnE,OAAO,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAC5E,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,WAAW,KAAK,SAAS,IAAI,iBAAiB,CAAC,WAAW,CAAC;gBAC7D,OAAO,WAAW,CAAC;YACrB,IAAI,WAAW,KAAK,SAAS,IAAI,iBAAiB,CAAC,WAAW,CAAC;gBAC7D,OAAO,WAAW,CAAC;YACrB,8CAA8C;YAC9C,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9C,IAAI,iBAAiB,CAAC,SAAS,CAAC;oBAC9B,OAAO,SAAS,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IACD;;;;;;OAMG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACnB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,mDAAmD;IAC5C,aAAa,CAAC,KAAa,EAAE,UAAmB,IAAI;QACzD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;IACD,0BAA0B;IACnB,cAAc,CAAC,KAAa;QACjC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW;YACxB,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IACD,yBAAyB;IAClB,aAAa,CAAC,KAAa;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;YACvB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,yBAAyB;IAClB,aAAa,CAAC,KAAa;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;YACvB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;;;OAIG;IACI,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,SAAiB,CAAC,EAAE,MAAiB;QAC7D,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACpD,MAAM,QAAQ,GAAG,MAAM,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,eAAe,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YACxC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,eAAe,EAAE,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;YACtC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,eAAe;YAC3E,QAAQ,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QACjE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,eAAe;YACzE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,eAAe;YACzE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,eAAe;YAClD,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;QAClE,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7I,QAAQ,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;QACpD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,eAAe;gBACpD,QAAQ,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;iBAC9D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAqB,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAClH,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;QAChD,CAAC;QACH,OAAO,CAAC,KAAK,QAAQ,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,qBAA8B,IAAI;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9C,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAC5C,sFAAsF;QACtF,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,IAAI,kBAAkB,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,IAAI,OAAO,GAAG,OAAO,GAAG,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;YACzD,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAC3C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;gBACtC,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,yCAAyC;QACzE,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6CAA6C;IAC7C,IAAoB,UAAU;QAC5B,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,4CAA4C;IAC5C,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;IAC7B,CAAC;IACD,6CAA6C;IAC7C,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,6CAA6C;IAC7C,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,iDAAiD;IACjD,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,8CAA8C;IAC9C,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;IAC/B,CAAC;IACD,8CAA8C;IACvC,iBAAiB,CAAC,UAAkB;QACzC,OAAO,UAAU,IAAI,CAAC,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACzD,CAAC;IACD,wDAAwD;IACjD,cAAc,CAAC,UAAkB;QACtC,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;YACpC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACzE,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,WAAW,CAAC,UAAkB;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;IACtC,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,UAAkB;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,2GAA2G;IAC3G,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IACD,yCAAyC;IAClC,aAAa,CAAC,UAAkB,CAAC;QACtC,OAAO,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,wEAAwE;IACxD,KAAK,CAAC,SAAqB,EAAE,MAAgB;QAC3D,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC;IACD,sDAAsD;IAC/C,WAAW,CAAC,KAAc,EAAE,SAAqB;QACtD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACpC,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,UAAkB;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,gBAAwB,CAAC;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;QAChD,IAAI,UAAU,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM;YACvC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,KAAK,aAAa,EAAE,yDAAyD;YAChF,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,mDAAmD;QAC9F,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,0CAA0C;YACpF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,gFAAgF;QAChF,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;QACnD,MAAM,aAAa,GAAY,QAAQ,CAAC,UAAU,CAAC,MAAM,IAAI,YAAY,CAAC;QAC1E,GAAG,CAAC;YACF,IAAI,aAAa,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;gBAC9C,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACnD,CAAC,QAAQ,OAAO,CAAC,eAAe,EAAE,IAAI,OAAO,CAAC,gBAAgB,EAAE,GAAG,aAAa,EAAE;QAClF,IAAI,YAAY,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM;YACxF,QAAQ,CAAC,oCAAoC,CAAC,IAAI,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;QACjF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE;YAC/D,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Polyface\n */\n\n// cspell:word internaldocs\n\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { Geometry } from \"../Geometry\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { GrowableXYArray } from \"../geometry3d/GrowableXYArray\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { NumberArray } from \"../geometry3d/PointHelpers\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { FacetFaceData } from \"./FacetFaceData\";\nimport { IndexedPolyfaceVisitor } from \"./IndexedPolyfaceVisitor\";\nimport { PolyfaceData } from \"./PolyfaceData\";\n\n/**\n * A Polyface is an abstract mesh structure (of unspecified implementation) that provides a PolyfaceVisitor\n * to iterate over its facets.\n * @public\n */\nexport abstract class Polyface extends GeometryQuery {\n  /** String name for schema properties */\n  public readonly geometryCategory = \"polyface\";\n  /** Underlying polyface data. */\n  public data: PolyfaceData;\n  /** Constructor */\n  protected constructor(data: PolyfaceData) {\n    super();\n    this.data = data;\n  }\n  /**\n   * Create and return a visitor for this concrete polyface.\n   * @param numWrap the number of vertices to replicate in visitor arrays.\n   */\n  public abstract createVisitor(numWrap: number): PolyfaceVisitor;\n  /**\n   * The [[PolyfaceData.twoSided]] flag.\n   */\n  public get twoSided() {\n    return this.data.twoSided;\n  }\n  public set twoSided(value: boolean) {\n    this.data.twoSided = value;\n  }\n  /**\n   * Flag indicating if the mesh closure is unknown (0), open sheet (1), closed solid (2).\n   * * A boundary edge of a mesh is defined as an edge with only one connected facet.\n   * * Closed solid is a mesh with no boundary edge. Open sheet is a mesh that has boundary edge(s).\n   */\n  public get expectedClosure(): number {\n    return this.data.expectedClosure;\n  }\n  public set expectedClosure(value: number) {\n    this.data.expectedClosure = value;\n  }\n  /**\n   * Check validity of indices into a data array.\n   * * It is valid to have both indices and data undefined.\n   * * It is NOT valid for just one to be defined.\n   * * Index values at indices[indexPositionA <= i < indexPositionB] must be valid indices to the data array.\n   * @param indices array of indices.\n   * @param indexPositionA first index to test.\n   * @param indexPositionB one past final index to test.\n   * @param data data array.\n   * @param dataLength length of data array.\n   */\n  public static areIndicesValid(\n    indices: number[] | undefined,\n    indexPositionA: number,\n    indexPositionB: number,\n    data: any,\n    dataLength: number,\n  ): boolean {\n    if (indices === undefined && data === undefined)\n      return true;\n    if (indices === undefined || data === undefined)\n      return false;\n    if (indexPositionA < 0 || indexPositionA >= indices.length)\n      return false;\n    if (indexPositionB <= indexPositionA || indexPositionB > indices.length)\n      return false;\n    for (let i = indexPositionA; i < indexPositionB; i++)\n      if (indices[i] < 0 || indices[i] >= dataLength)\n        return false;\n    return true;\n  }\n  /** Returns true if this polyface has no facets. */\n  public abstract get isEmpty(): boolean;\n  /** Returns the number of facets of this polyface. Subclasses should override. */\n  public get facetCount(): number | undefined {\n    return undefined;\n  }\n}\n\n/**\n * An `IndexedPolyface` is a set of facets which can have normal, param, and color arrays with independent point,\n * normal, param, and color indices.\n * @public\n */\nexport class IndexedPolyface extends Polyface { // more info can be found at geometry/internaldocs/Polyface.md\n  /**\n   * Start indices of all facets of the polyface.\n   * * Each element is an index to the `this.data.pointIndex` array entry for a specific facet.\n   * * The facet count is `_facetStart.length - 1`.\n   * * The face loop for the i_th facet consists of the entries in `this.data.pointIndex` at indices `_facetStart[i]`\n   * up to (but not including) `_facetStart[i + 1]`.\n   * * Note the array is initialized with one entry (value 0).\n   */\n  protected _facetStart: number[];\n  /**\n   * Index to the `this.data.face` array entry for a specific facet.\n   * * `_facetToFaceData` has one entry per facet.\n   */\n  protected _facetToFaceData: number[];\n  /**\n   * Constructor for a new polyface.\n   * @param data PolyfaceData arrays to capture.\n   * @param facetStart optional array of facet start indices (e.g. known during clone)\n   * @param facetToFacetData optional array of face identifiers (e.g. known during clone)\n   */\n  protected constructor(data: PolyfaceData, facetStart?: number[], facetToFaceData?: number[]) {\n    super(data);\n    if (facetStart)\n      this._facetStart = facetStart.slice(); // deep copy\n    else {\n      this._facetStart = [];\n      this._facetStart.push(0);\n    }\n    if (facetToFaceData)\n      this._facetToFaceData = facetToFaceData.slice(); // deep copy\n    else\n      this._facetToFaceData = [];\n  }\n\n  /** Given an edgeIndex (index into `data.pointIndex`), return the index of the facet containing the edge. */\n  public edgeIndexToFacetIndex(k: number | undefined): number | undefined {\n    if (k === undefined)\n      return undefined;\n    return NumberArray.searchStrictlyIncreasingNumbers(this._facetStart, k);\n  }\n  /**\n   * Given an edgeIndex (index into `data.pointIndex`), return the range of the edgeIndices of the containing facet.\n   * * If an edge with edgeIndex `k` is found in the facet with facetIndex `f`, then the returned range `r` satisfies\n   * `r.low = this.facetIndex0(f) <= k < this.facetIndex1(f) = r.high` and can be used to iterate the facet's face\n   * loop. See [[facetIndex0]].\n   */\n  public edgeIndexToFaceLoop(k: number | undefined): Range1d | undefined {\n    const q = this.edgeIndexToFacetIndex(k);\n    if (q !== undefined)\n      return Range1d.createXX(this.facetIndex0(q), this.facetIndex1(q));\n    return undefined;\n  }\n\n  /** Test if other is an instance of `IndexedPolyface` */\n  public isSameGeometryClass(other: any): boolean {\n    return other instanceof IndexedPolyface;\n  }\n  /** Tests for equivalence between two IndexedPolyfaces. */\n  public override isAlmostEqual(other: any): boolean {\n    if (other instanceof IndexedPolyface) {\n      return this.data.isAlmostEqual(other.data) &&\n        NumberArray.isExactEqual(this._facetStart, other._facetStart) &&\n        NumberArray.isExactEqual(this._facetToFaceData, other._facetToFaceData);\n    }\n    return false;\n  }\n  /** Returns true if either the point array or the point index array is empty. */\n  public get isEmpty(): boolean {\n    return this.data.pointCount === 0 || this.data.pointIndex.length === 0;\n  }\n  /**\n   * Transform the mesh.\n   * * If `transform` is a mirror, also reverse the index order around each facet.\n   * * Note that this method always returns true. If transforming the normals fails (due to singular matrix or zero\n   * normal), the original normal(s) are left unchanged.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    this.data.tryTransformInPlace(transform);\n    if (transform.matrix.determinant() < 0)\n      this.reverseIndices();\n    return true;\n  }\n  /** Reverse indices for a single facet. */\n  public reverseSingleFacet(facetId: number) {\n    this.data.reverseIndicesSingleFacet(facetId, this._facetStart);\n  }\n  /** Return a deep clone. */\n  public clone(): IndexedPolyface {\n    return new IndexedPolyface(this.data.clone(), this._facetStart.slice(), this._facetToFaceData.slice());\n  }\n  /**\n   * Return a deep clone with transformed points and normals.\n   * @see [[IndexedPolyface.tryTransformInPlace]] for details of how transform is done.\n   */\n  public cloneTransformed(transform: Transform): IndexedPolyface { // we know tryTransformInPlace succeeds.\n    const result = this.clone();\n    result.tryTransformInPlace(transform);\n    return result;\n  }\n  /** Reverse the order of indices around all facets. */\n  public reverseIndices() {\n    this.data.reverseIndices(this._facetStart);\n  }\n  /** Reverse the direction of all normal vectors. */\n  public reverseNormals() {\n    this.data.reverseNormals();\n  }\n  /**\n   * Return face data using a facet index.\n   * * Returns `undefined` if none found.\n   * * This is the REFERENCE to the FacetFaceData not a copy.\n  */\n  public tryGetFaceData(i: number): FacetFaceData | undefined {\n    if (i < 0 || i >= this._facetToFaceData.length)\n      return undefined;\n    const faceIndex = this._facetToFaceData[i];\n    if (faceIndex < 0 || faceIndex >= this.data.face.length)\n      return undefined;\n    return this.data.face[faceIndex];\n  }\n  /**\n   * Add facets from `source` to `this` polyface.\n   * * Optionally reverse facet indices as per `PolyfaceData.reverseIndicesSingleFacet()` with `preserveStart = false` and\n   * invert source normals.\n   * * Optionally apply a `transform` to points and normals.\n   * * Will only copy param, normal, color, and face data if we are already tracking them AND/OR the source contains them.\n   */\n  public addIndexedPolyface(source: IndexedPolyface, reversed: boolean, transform: Transform | undefined) {\n    const numSourceFacets = source.facetCount;\n    // add point, point index, and edge visibility data\n    // note that there is no need to build an intermediate index map since all points are added\n    const startOfNewPoints = this.data.point.length;\n    const xyz = Point3d.create();\n    for (let i = 0; i < source.data.point.length; i++) {\n      source.data.point.getPoint3dAtUncheckedPointIndex(i, xyz);\n      if (transform) {\n        transform.multiplyPoint3d(xyz, xyz);\n        this.addPoint(xyz);\n      } else\n        this.addPoint(xyz);\n    }\n    for (let i = 0; i < numSourceFacets; i++) {\n      const i0 = source._facetStart[i];\n      const i1 = source._facetStart[i + 1];\n      if (reversed) {\n        for (let j = i1; j-- > i0;) { // visibility is transferred from far vertex, e.g., -abc-d => dc-b-a\n          this.addPointIndex(\n            startOfNewPoints + source.data.pointIndex[j],\n            source.data.edgeVisible[j > i0 ? j - 1 : i1 - 1],\n          );\n        }\n      } else {\n        for (let j = i0; j < i1; j++) {\n          this.addPointIndex(\n            startOfNewPoints + source.data.pointIndex[j],\n            source.data.edgeVisible[j],\n          );\n        }\n      }\n      this.terminateFacet(false);\n    }\n    // add param and param index data\n    if (undefined !== this.data.param && undefined !== source.data.param && undefined !== source.data.paramIndex) {\n      const startOfNewParams = this.data.param.length;\n      this.data.param.pushFromGrowableXYArray(source.data.param);\n      for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match normals\n        const i0 = source._facetStart[i];\n        const i1 = source._facetStart[i + 1];\n        if (reversed) {\n          for (let j = i1; j-- > i0;)\n            this.addParamIndex(startOfNewParams + source.data.paramIndex[j]);\n        } else {\n          for (let j = i0; j < i1; j++)\n            this.addParamIndex(startOfNewParams + source.data.paramIndex[j]);\n        }\n      }\n    }\n    // add normal and normal index data\n    if (undefined !== this.data.normal && undefined !== source.data.normal && undefined !== source.data.normalIndex) {\n      const startOfNewNormals = this.data.normal.length;\n      for (let i = 0; i < source.data.normal.length; i++) {\n        const sourceNormal = source.data.normal.getVector3dAtCheckedVectorIndex(i)!;\n        if (transform)\n          transform.multiplyVector(sourceNormal, sourceNormal);\n        if (reversed)\n          sourceNormal.scaleInPlace(-1.0);\n        this.addNormal(sourceNormal);\n      }\n      for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match normals\n        const i0 = source._facetStart[i];\n        const i1 = source._facetStart[i + 1];\n        if (reversed) {\n          for (let j = i1; j-- > i0;)\n            this.addNormalIndex(startOfNewNormals + source.data.normalIndex[j]);\n        } else {\n          for (let j = i0; j < i1; j++)\n            this.addNormalIndex(startOfNewNormals + source.data.normalIndex[j]);\n        }\n      }\n    }\n    // add color and color index data\n    if (undefined !== this.data.color && undefined !== source.data.color && undefined !== source.data.colorIndex) {\n      const startOfNewColors = this.data.color.length;\n      for (const sourceColor of source.data.color)\n        this.addColor(sourceColor);\n      for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match colors\n        const i0 = source._facetStart[i];\n        const i1 = source._facetStart[i + 1];\n        if (reversed) {\n          for (let j = i1; j-- > i0;)\n            this.addColorIndex(startOfNewColors + source.data.colorIndex[j]);\n        } else {\n          for (let j = i0; j < i1; j++)\n            this.addColorIndex(startOfNewColors + source.data.colorIndex[j]);\n        }\n      }\n    }\n    // add face and facetToFace index data\n    if (source.data.face.length !== 0) {\n      const startOfNewFaceData = this.data.face.length;\n      for (const face of source.data.face) {\n        const sourceFaceData = face.clone();\n        this.data.face.push(sourceFaceData);\n      }\n      for (const facetToFaceIdx of source._facetToFaceData) {\n        this._facetToFaceData.push(startOfNewFaceData + facetToFaceIdx);\n      }\n    }\n  }\n  /**\n   * Return the total number of indices in zero-terminated style, which includes\n   * * all the indices in the packed zero-based table.\n   * * one additional index for the zero-terminator of each facet.\n   * @note Note that all index arrays (pointIndex, normalIndex, paramIndex, colorIndex) have the same counts, so there\n   * is not a separate query for each of them.\n   */\n  public get zeroTerminatedIndexCount(): number {\n    return this.data.pointIndex.length + this._facetStart.length - 1;\n  }\n  /**\n   * Create an empty facet set with coordinate and index data to be supplied later.\n   * @param needNormals `true` to allocate empty normal data and index arrays; `false` (default) to leave undefined.\n   * @param needParams `true` to allocate empty uv parameter data and index arrays; `false` (default) to leave undefined.\n   * @param needColors `true` to allocate empty color data and index arrays; `false` (default) to leave undefined.\n   * @param twoSided `true` (default) if the facets are to be considered viewable from the back; `false` if they are amenable to backface culling.\n   */\n  public static create(\n    needNormals: boolean = false,\n    needParams: boolean = false,\n    needColors: boolean = false,\n    twoSided: boolean = true,\n  ): IndexedPolyface {\n    return new IndexedPolyface(new PolyfaceData(needNormals, needParams, needColors, twoSided));\n  }\n  /**\n   * Add (a clone of) a point to point array.\n   * @param point the point.\n   * @param priorIndex (optional) index of prior point to check for possible duplicate value.\n   * @returns the zero-based index of the added or duplicate point.\n   */\n  public addPoint(point: Point3d, priorIndex?: number): number {\n    if (priorIndex !== undefined) {\n      const distance = this.data.point.distanceIndexToPoint(priorIndex, point);\n      if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\n        return priorIndex;\n    }\n    this.data.point.pushXYZ(point.x, point.y, point.z);\n    return this.data.point.length - 1;\n  }\n  /**\n   * Add a point to point array.\n   * @param x the x coordinate of point.\n   * @param y the y coordinate of point.\n   * @param z the z coordinate of point.\n   * @returns the zero-based index of the added point.\n   */\n  public addPointXYZ(x: number, y: number, z: number): number {\n    this.data.point.pushXYZ(x, y, z);\n    return this.data.point.length - 1;\n  }\n  /**\n   * Add (a clone of) a uv parameter to the parameter array.\n   * @param param the parameter.\n   * @returns zero-based index of the added param.\n   */\n  public addParam(param: Point2d): number {\n    if (!this.data.param)\n      this.data.param = new GrowableXYArray();\n    this.data.param.push(param);\n    return this.data.param.length - 1;\n  }\n  /**\n   * Add a uv parameter to the parameter array.\n   * @param u the u part of parameter.\n   * @param v the v part of parameter.\n   * @param priorIndexA first index to check for possible duplicate value.\n   * @param priorIndexB second index to check for possible duplicate value.\n   * @returns zero-based index of the added or duplicate parameter.\n   */\n  public addParamUV(u: number, v: number, priorIndexA?: number, priorIndexB?: number): number {\n    if (!this.data.param)\n      this.data.param = new GrowableXYArray();\n    if (priorIndexA !== undefined && this.data.isAlmostEqualParamIndexUV(priorIndexA, u, v))\n      return priorIndexA;\n    if (priorIndexB !== undefined && this.data.isAlmostEqualParamIndexUV(priorIndexB, u, v))\n      return priorIndexB;\n    this.data.param.pushXY(u, v);\n    return this.data.param.length - 1;\n  }\n  /**\n   * Add (a clone of) a normal vector to the normal array.\n   * @param normal the normal vector.\n   * @param priorIndexA first index to check for possible duplicate value.\n   * @param priorIndexB second index to check for possible duplicate value.\n   * @returns zero-based index of the added or duplicate normal.\n   */\n  public addNormal(normal: Vector3d, priorIndexA?: number, priorIndexB?: number): number {\n    // check if `normal` is duplicate of `dataNormal` at index `i`\n    const normalIsDuplicate = (i: number) => {\n      const distance = this.data.normal!.distanceIndexToPoint(i, normal);\n      return distance !== undefined && Geometry.isSmallMetricDistance(distance);\n    };\n    if (this.data.normal !== undefined) {\n      if (priorIndexA !== undefined && normalIsDuplicate(priorIndexA))\n        return priorIndexA;\n      if (priorIndexB !== undefined && normalIsDuplicate(priorIndexB))\n        return priorIndexB;\n      // check the tail index for possible duplicate\n      if (priorIndexA !== undefined || priorIndexB !== undefined) {\n        const tailIndex = this.data.normal.length - 1;\n        if (normalIsDuplicate(tailIndex))\n          return tailIndex;\n      }\n    }\n    return this.addNormalXYZ(normal.x, normal.y, normal.z);\n  }\n  /**\n   * Add a normal vector to the normal array.\n   * @param x the x coordinate of normal.\n   * @param y the y coordinate of normal.\n   * @param z the z coordinate of normal.\n   * @returns zero-based index of the added normal vector.\n   */\n  public addNormalXYZ(x: number, y: number, z: number): number {\n    if (!this.data.normal)\n      this.data.normal = new GrowableXYZArray();\n    this.data.normal.pushXYZ(x, y, z);\n    return this.data.normal.length - 1;\n  }\n  /**\n   * Add a color to the color array\n   * @param color the color.\n   * @returns zero-based index of the added color.\n   */\n  public addColor(color: number): number {\n    if (!this.data.color)\n      this.data.color = [];\n    this.data.color.push(color);\n    return this.data.color.length - 1;\n  }\n  /** Add a point index with edge visibility flag. */\n  public addPointIndex(index: number, visible: boolean = true): void {\n    this.data.pointIndex.push(index);\n    this.data.edgeVisible.push(visible);\n  }\n  /** Add a normal index. */\n  public addNormalIndex(index: number): void {\n    if (!this.data.normalIndex)\n      this.data.normalIndex = [];\n    this.data.normalIndex.push(index);\n  }\n  /** Add a param index. */\n  public addParamIndex(index: number): void {\n    if (!this.data.paramIndex)\n      this.data.paramIndex = [];\n    this.data.paramIndex.push(index);\n  }\n  /** Add a color index. */\n  public addColorIndex(index: number): void {\n    if (!this.data.colorIndex)\n      this.data.colorIndex = [];\n    this.data.colorIndex.push(index);\n  }\n  /**\n   * Clean up the open facet.\n   * @deprecated in 4.x to remove nebulous \"open facet\" concept from the API. Call [[PolyfaceData.trimAllIndexArrays]]\n   * instead.\n   */\n  public cleanupOpenFacet(): void {\n    this.data.trimAllIndexArrays(this.data.pointIndex.length);\n  }\n\n  /**\n   * Validate (the tail of) the active index arrays: point, normal, param, color.\n   * @param index0 optional offset into the index arrays at which to start validating indices. Default 0.\n   * @param errors optional array appended with error message(s) if invalid indices are encountered\n   * @return whether the indices are valid\n   */\n  public validateAllIndices(index0: number = 0, errors?: string[]): boolean {\n    const numPointIndices = this.data.pointIndex.length;\n    const messages = errors ?? [];\n    if (0 === numPointIndices) {\n      messages.push(\"empty pointIndex array\");\n      return false;\n    }\n    if (index0 < 0 || index0 >= numPointIndices) {\n      messages.push(\"invalid input offset\");\n      return false;\n    }\n    if (this.data.normalIndex && this.data.normalIndex.length !== numPointIndices)\n      messages.push(\"normalIndex count must match pointIndex count\");\n    if (this.data.paramIndex && this.data.paramIndex.length !== numPointIndices)\n      messages.push(\"paramIndex count must equal pointIndex count\");\n    if (this.data.colorIndex && this.data.colorIndex.length !== numPointIndices)\n      messages.push(\"colorIndex count must equal pointIndex count\");\n    if (this.data.edgeVisible.length !== numPointIndices)\n      messages.push(\"visibleIndex count must equal pointIndex count\");\n    if (!Polyface.areIndicesValid(this.data.pointIndex, index0, numPointIndices, this.data.point, this.data.point ? this.data.point.length : 0))\n      messages.push(\"invalid point index encountered\");\n    if (!Polyface.areIndicesValid(this.data.normalIndex, index0, numPointIndices, this.data.normal, this.data.normal ? this.data.normal.length : 0))\n      messages.push(\"invalid normal index encountered\");\n    if (!Polyface.areIndicesValid(this.data.paramIndex, index0, numPointIndices, this.data.param, this.data.param ? this.data.param.length : 0))\n      messages.push(\"invalid param index encountered\");\n    if (!Polyface.areIndicesValid(this.data.colorIndex, index0, numPointIndices, this.data.color, this.data.color ? this.data.color.length : 0))\n      messages.push(\"invalid color index encountered\");\n    if (this.data.edgeMateIndex) {\n      if (this.data.edgeMateIndex.length !== numPointIndices)\n        messages.push(\"edgeMateIndex count must equal pointIndex count\");\n      else if (!this.data.edgeMateIndex.every((i: number | undefined) => i === undefined || this.data.isValidEdgeIndex(i)))\n        messages.push(\"invalid edgeMate encountered\");\n      }\n    return 0 === messages.length;\n  }\n\n  /**\n   * Announce the end of construction of a facet.\n   * * Optionally check for:\n   *   * Same number of indices among all active index arrays -- point, normal, param, color\n   *   * All indices for the latest facet are within bounds of the respective data arrays.\n   * * In error cases, all index arrays are trimmed back to the size when previous facet was terminated.\n   * * A return value of `undefined` is normal. Otherwise, a string array of error messages is returned.\n   */\n  public terminateFacet(validateAllIndices: boolean = true): string[] | undefined {\n    const numFacets = this._facetStart.length - 1;\n    // number of indices in accepted facets\n    const lengthA = this._facetStart[numFacets];\n    // number of indices in all facets (accepted facet plus the last facet to be accepted)\n    const lengthB = this.data.pointIndex.length;\n    if (validateAllIndices) {\n      const messages: string[] = [];\n      if (lengthB < lengthA + 2)\n        messages.push(\"Less than 3 indices in the last facet\");\n      this.validateAllIndices(lengthA, messages);\n      if (messages.length > 0) {\n        this.data.trimAllIndexArrays(lengthA);\n        return messages;\n      }\n    }\n    this._facetStart.push(lengthB); // append start index of the future facet\n    return undefined;\n  }\n  /** Number of facets (read-only property). */\n  public override get facetCount(): number {\n    return this._facetStart.length - 1;\n  }\n  /** Number of faces (read-only property). */\n  public get faceCount(): number {\n    return this.data.faceCount;\n  }\n  /** Number of points (read-only property). */\n  public get pointCount(): number {\n    return this.data.pointCount;\n  }\n  /** Number of colors (read-only property). */\n  public get colorCount(): number {\n    return this.data.colorCount;\n  }\n  /** Number of parameters (read-only property). */\n  public get paramCount(): number {\n    return this.data.paramCount;\n  }\n  /** Number of normals (read-only property). */\n  public get normalCount(): number {\n    return this.data.normalCount;\n  }\n  /** Test if `index` is a valid facet index. */\n  public isValidFacetIndex(facetIndex: number): boolean {\n    return facetIndex >= 0 && facetIndex < this.facetCount;\n  }\n  /** Return the number of edges in a particular facet. */\n  public numEdgeInFacet(facetIndex: number): number {\n    if (this.isValidFacetIndex(facetIndex))\n      return this._facetStart[facetIndex + 1] - this._facetStart[facetIndex];\n    return 0;\n  }\n  /**\n   * Given a valid facet index, return the index at which its face loop starts in the index arrays.\n   * * A \"face loop\" is a contiguous block of indices into the parallel polyface index arrays.\n   * * Each of these indices represents an edge of a facet, thus it is sometimes called an \"edgeIndex\".\n   * * Together with [[facetIndex1]], this method can be used to iterate the face loop of the facet\n   * with index `iFacet` as follows:\n   * ````\n   * for (let iEdge = this.facetIndex0(iFacet); iEdge < this.facetIndex1(iFacet); iEdge++) {\n   *   const iPoint = this.data.pointIndex[iEdge];\n   *   const p = this.data.point[iPoint];\n   *   // ... process the edge of this facet starting at point p\n   * }\n   * ````\n   */\n  public facetIndex0(facetIndex: number): number {\n    return this._facetStart[facetIndex];\n  }\n  /**\n   * Given a valid facet index, return one past the index at which its face loop ends in the index arrays.\n   * * For details, see [[facetIndex0]].\n   */\n  public facetIndex1(facetIndex: number): number {\n    return this._facetStart[facetIndex + 1];\n  }\n  /** Return a readonly reference to the facetStart array accessed by [[facetIndex0]] and [[facetIndex1]]. */\n  public get facetStart(): ReadonlyArray<number> {\n    return this._facetStart;\n  }\n  /** create a visitor for this polyface */\n  public createVisitor(numWrap: number = 0): IndexedPolyfaceVisitor {\n    return IndexedPolyfaceVisitor.create(this, numWrap);\n  }\n  /** Return the range of (optionally transformed) points in this mesh. */\n  public override range(transform?: Transform, result?: Range3d): Range3d {\n    return this.data.range(result, transform);\n  }\n  /** Extend `range` with coordinates from this mesh. */\n  public extendRange(range: Range3d, transform?: Transform): void {\n    this.data.range(range, transform);\n  }\n  /**\n   * Given the index of a facet, return the data pertaining to the face it is a part of.\n   * @deprecated in 4.x. Use [[IndexedPolyface.tryGetFaceData]], which verifies the index is in range.\n   */\n  public getFaceDataByFacetIndex(facetIndex: number): FacetFaceData {\n    return this.data.face[this._facetToFaceData[facetIndex]];\n  }\n  /**\n   * Set new FacetFaceData.\n   * * All terminated facets since the last face declaration will be mapped to a single new FacetFaceData object using\n   * facetToFaceData[]. FacetFaceData holds the 2D range of the face. Returns `true` if successful, `false` otherwise.\n   */\n  public setNewFaceData(endFacetIndex: number = 0): boolean {\n    const facetStart = this._facetToFaceData.length;\n    if (facetStart >= this._facetStart.length)\n      return false;\n    if (0 === endFacetIndex) // the default for endFacetIndex is really the last facet\n      endFacetIndex = this._facetStart.length; // last facet index corresponds to the future facet\n    const faceData = FacetFaceData.createNull();\n    const visitor = IndexedPolyfaceVisitor.create(this, 0);\n    if (!visitor.moveToReadIndex(facetStart)) { // move visitor to first facet of new face\n      return false;\n    }\n    // if parameter range is provided (by the polyface planeSet clipper) then use it\n    const paramDefined = this.data.param !== undefined;\n    const setParamRange: boolean = faceData.paramRange.isNull && paramDefined;\n    do {\n      if (setParamRange && visitor.param !== undefined)\n        visitor.param.extendRange(faceData.paramRange);\n    } while (visitor.moveToNextFacet() && visitor.currentReadIndex() < endFacetIndex);\n    if (paramDefined && !(this.data.param!.length === 0) && faceData.paramDistanceRange.isNull)\n      faceData.setParamDistanceRangeFromNewFaceData(this, facetStart, endFacetIndex);\n    this.data.face.push(faceData);\n    const faceDataIndex = this.data.face.length - 1;\n    for (let i = this._facetToFaceData.length; i < endFacetIndex; i++)\n      this._facetToFaceData.push(0 === this._facetStart[i] ? 0 : faceDataIndex);\n    return true;\n  }\n  /** Second step of double dispatch: call `handler.handleIndexedPolyface(this)`. */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleIndexedPolyface(this);\n  }\n}\n\n/**\n * A PolyfaceVisitor manages data while walking through facets.\n * * The polyface visitor holds data for one facet at a time.\n * * The caller can request the position in the addressed polyfaceData as a \"readIndex\".\n * * The readIndex values (as numbers) are not assumed to be sequential (i.e., they might be contiguous facet indices\n * or the indexing scheme might have gaps at the whim of the particular PolyfaceVisitor implementation).\n * @public\n */\nexport interface PolyfaceVisitor extends PolyfaceData {\n  /** Load data for the facet with given index. */\n  moveToReadIndex(index: number): boolean;\n  /** Return the readIndex of the currently loaded facet. */\n  currentReadIndex(): number;\n  /** Load data for the next facet. */\n  moveToNextFacet(): boolean;\n  /** Reset to initial state for reading all facets sequentially with moveToNextFacet. */\n  reset(): void;\n  /** Return the point index of vertex i within the currently loaded facet. */\n  clientPointIndex(i: number): number;\n  /** Return the param index of vertex i within the currently loaded facet. */\n  clientParamIndex(i: number): number;\n  /** Return the normal index of vertex i within the currently loaded facet. */\n  clientNormalIndex(i: number): number;\n  /** Return the color index of vertex i within the currently loaded facet. */\n  clientColorIndex(i: number): number;\n  /** Return the aux data index of vertex i within the currently loaded facet. */\n  clientAuxIndex(i: number): number;\n  /** Return the client polyface. */\n  clientPolyface(): Polyface | undefined;\n  /**\n   * Set the number of vertices replicated in visitor arrays (both data and index arrays).\n   * * 0,1,2 are the most common values.\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\n   * the next two points, e.g., to form two adjacent vectors for a cross product.\n   */\n  setNumWrap(numWrap: number): void;\n  /** Clear the contents of the data arrays. Use this along with `pushDataFrom` to build up new facets. */\n  clearArrays(): void;\n  /** Transfer data from a specified index of the other visitor as new data in this visitor. */\n  pushDataFrom(other: PolyfaceVisitor, index: number): void;\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  pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void;\n  /**\n   * Return the number of facets this visitor is able to visit.\n   * * Allows implementers to improve the efficiency of e.g., [[PolyfaceQuery.visitorClientFacetCount]].\n   */\n  getVisitableFacetCount?(): number;\n}\n"]}
+{"version":3,"file":"Polyface.js","sourceRoot":"","sources":["../../../src/polyface/Polyface.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,2BAA2B;AAE3B,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAElE,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AACzD,OAAO,EAAE,OAAO,EAAW,MAAM,qBAAqB,CAAC;AAEvD,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,MAAM,OAAgB,QAAS,SAAQ,aAAa;IAClD,wCAAwC;IACxB,gBAAgB,GAAG,UAAU,CAAC;IAC9C,gCAAgC;IACzB,IAAI,CAAe;IAC1B,kBAAkB;IAClB,YAAsB,IAAkB;QACtC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAMD;;OAEG;IACH,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC;IAC5B,CAAC;IACD,IAAW,QAAQ,CAAC,KAAc;QAChC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IAC7B,CAAC;IACD;;;;OAIG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC;IACnC,CAAC;IACD,IAAW,eAAe,CAAC,KAAa;QACtC,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC;IACpC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,OAA6B,EAC7B,cAAsB,EACtB,cAAsB,EACtB,IAAS,EACT,UAAkB;QAElB,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,IAAI,CAAC;QACd,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;YAC7C,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,OAAO,CAAC,MAAM;YACxD,OAAO,KAAK,CAAC;QACf,IAAI,cAAc,IAAI,cAAc,IAAI,cAAc,GAAG,OAAO,CAAC,MAAM;YACrE,OAAO,KAAK,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,cAAc,EAAE,CAAC,GAAG,cAAc,EAAE,CAAC,EAAE;YAClD,IAAI,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,IAAI,UAAU;gBAC5C,OAAO,KAAK,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAGD,iFAAiF;IACjF,IAAW,UAAU;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAC3C;;;;;;;OAOG;IACO,WAAW,CAAW;IAChC;;;OAGG;IACO,gBAAgB,CAAW;IACrC;;;;;OAKG;IACH,YAAsB,IAAkB,EAAE,UAAqB,EAAE,eAA0B;QACzF,KAAK,CAAC,IAAI,CAAC,CAAC;QACZ,IAAI,UAAU;YACZ,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;aAChD,CAAC;YACJ,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;YACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,eAAe;YACjB,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,YAAY;;YAE7D,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC;IAC/B,CAAC;IAED,4GAA4G;IACrG,qBAAqB,CAAC,CAAqB;QAChD,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,WAAW,CAAC,+BAA+B,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,CAAqB;QAC9C,MAAM,CAAC,GAAG,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,SAAS;YACjB,OAAO,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,wDAAwD;IACjD,mBAAmB,CAAC,KAAU;QACnC,OAAO,KAAK,YAAY,eAAe,CAAC;IAC1C,CAAC;IACD,0DAA0D;IAC1C,aAAa,CAAC,KAAU;QACtC,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;gBACxC,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC;gBAC7D,WAAW,CAAC,YAAY,CAAC,IAAI,CAAC,gBAAgB,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gFAAgF;IAChF,IAAW,OAAO;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;IACzE,CAAC;IACD;;;;;OAKG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACzC,IAAI,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,CAAC;YACpC,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0CAA0C;IACnC,kBAAkB,CAAC,OAAe;QACvC,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACjE,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC;IACzG,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,sDAAsD;IAC/C,cAAc;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7C,CAAC;IACD,mDAAmD;IAC5C,cAAc;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;IAC7B,CAAC;IACD;;;;MAIE;IACK,cAAc,CAAC,CAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM;YAC5C,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACrD,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IACD;;;;;;OAMG;IACI,kBAAkB,CAAC,MAAuB,EAAE,QAAiB,EAAE,SAAgC;QACpG,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC;QAC1C,mDAAmD;QACnD,2FAA2F;QAC3F,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAChD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC1D,IAAI,SAAS,EAAE,CAAC;gBACd,SAAS,CAAC,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACrB,CAAC;;gBACC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACvB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrC,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,oEAAoE;oBAChG,IAAI,CAAC,aAAa,CAChB,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CACjD,CAAC;gBACJ,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,IAAI,CAAC,aAAa,CAChB,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAC5C,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAC3B,CAAC;gBACJ,CAAC;YACH,CAAC;YACD,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QACD,iCAAiC;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7G,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,0DAA0D;gBACpG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;QACD,mCAAmC;QACnC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;YAChH,MAAM,iBAAiB,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACnD,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,+BAA+B,CAAC,CAAC,CAAE,CAAC;gBAC5E,IAAI,SAAS;oBACX,SAAS,CAAC,cAAc,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;gBACvD,IAAI,QAAQ;oBACV,YAAY,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YAC/B,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,0DAA0D;gBACpG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,cAAc,CAAC,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,cAAc,CAAC,iBAAiB,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;QACH,CAAC;QACD,iCAAiC;QACjC,IAAI,SAAS,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,SAAS,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YAC7G,MAAM,gBAAgB,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;YAChD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK;gBACzC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,yDAAyD;gBACnG,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACjC,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE;wBACvB,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE;wBAC1B,IAAI,CAAC,aAAa,CAAC,gBAAgB,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;QACD,sCAAsC;QACtC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,MAAM,kBAAkB,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;YACjD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACpC,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YACtC,CAAC;YACD,KAAK,MAAM,cAAc,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBACrD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,GAAG,cAAc,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACH,IAAW,wBAAwB;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACnE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,CAClB,cAAuB,KAAK,EAC5B,aAAsB,KAAK,EAC3B,aAAsB,KAAK,EAC3B,WAAoB,IAAI;QAExB,OAAO,IAAI,eAAe,CAAC,IAAI,YAAY,CAAC,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAc,EAAE,UAAmB;QACjD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACzE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC;gBACpE,OAAO,UAAU,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAc;QAC5B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;OAOG;IACI,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,WAAoB,EAAE,WAAoB;QAChF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,eAAe,EAAE,CAAC;QAC1C,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,WAAW,CAAC;QACrB,IAAI,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,yBAAyB,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC,CAAC;YACrF,OAAO,WAAW,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACI,SAAS,CAAC,MAAgB,EAAE,WAAoB,EAAE,WAAoB;QAC3E,8DAA8D;QAC9D,MAAM,iBAAiB,GAAG,CAAC,CAAS,EAAE,EAAE;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAO,CAAC,oBAAoB,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YACnE,OAAO,QAAQ,KAAK,SAAS,IAAI,QAAQ,CAAC,qBAAqB,CAAC,QAAQ,CAAC,CAAC;QAC5E,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,WAAW,KAAK,SAAS,IAAI,iBAAiB,CAAC,WAAW,CAAC;gBAC7D,OAAO,WAAW,CAAC;YACrB,IAAI,WAAW,KAAK,SAAS,IAAI,iBAAiB,CAAC,WAAW,CAAC;gBAC7D,OAAO,WAAW,CAAC;YACrB,8CAA8C;YAC9C,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;gBAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;gBAC9C,IAAI,iBAAiB,CAAC,SAAS,CAAC;oBAC9B,OAAO,SAAS,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IACD;;;;;;OAMG;IACI,YAAY,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;YACnB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,QAAQ,CAAC,KAAa;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;YAClB,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,mDAAmD;IAC5C,aAAa,CAAC,KAAa,EAAE,UAAmB,IAAI;QACzD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtC,CAAC;IACD,0BAA0B;IACnB,cAAc,CAAC,KAAa;QACjC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW;YACxB,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IACD,yBAAyB;IAClB,aAAa,CAAC,KAAa;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;YACvB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,yBAAyB;IAClB,aAAa,CAAC,KAAa;QAChC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU;YACvB,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD;;;;OAIG;IACI,gBAAgB;QACrB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC;IAED;;;;;OAKG;IACI,kBAAkB,CAAC,SAAiB,CAAC,EAAE,MAAiB;QAC7D,MAAM,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QACpD,MAAM,QAAQ,GAAG,MAAM,IAAI,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,eAAe,EAAE,CAAC;YAC1B,QAAQ,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YACxC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,eAAe,EAAE,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;YACtC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,eAAe;YAC3E,QAAQ,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QACjE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,eAAe;YACzE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,eAAe;YACzE,QAAQ,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;QAChE,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,eAAe;YAClD,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;QAClE,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7I,QAAQ,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;QACpD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzI,QAAQ,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,eAAe;gBACpD,QAAQ,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;iBAC9D,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAqB,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBAClH,QAAQ,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,CAAC,KAAK,QAAQ,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED;;;;;;;OAOG;IACI,cAAc,CAAC,qBAA8B,IAAI;QACtD,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC9C,uCAAuC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;QAC5C,sFAAsF;QACtF,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAC5C,IAAI,kBAAkB,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,IAAI,OAAO,GAAG,OAAO,GAAG,CAAC;gBACvB,QAAQ,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;YACzD,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YAC3C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;gBACtC,OAAO,QAAQ,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,yCAAyC;QACzE,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6CAA6C;IAC7C,IAAoB,UAAU;QAC5B,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC,CAAC;IACD,4CAA4C;IAC5C,IAAW,SAAS;QAClB,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;IAC7B,CAAC;IACD,6CAA6C;IAC7C,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,6CAA6C;IAC7C,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,iDAAiD;IACjD,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC;IAC9B,CAAC;IACD,8CAA8C;IAC9C,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;IAC/B,CAAC;IACD,8CAA8C;IACvC,iBAAiB,CAAC,UAAkB;QACzC,OAAO,UAAU,IAAI,CAAC,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACzD,CAAC;IACD,wDAAwD;IACjD,cAAc,CAAC,UAAkB;QACtC,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;YACpC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;QACzE,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;;;;;;;;;;OAaG;IACI,WAAW,CAAC,UAAkB;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;IACtC,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,UAAkB;QACnC,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,2GAA2G;IAC3G,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IACD,yCAAyC;IAClC,aAAa,CAAC,UAAkB,CAAC;QACtC,OAAO,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,wEAAwE;IACxD,KAAK,CAAC,SAAqB,EAAE,MAAgB;QAC3D,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC;IACD,sDAAsD;IAC/C,WAAW,CAAC,KAAc,EAAE,SAAqB;QACtD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACpC,CAAC;IACD;;;OAGG;IACI,uBAAuB,CAAC,UAAkB;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC;IAC3D,CAAC;IACD;;;;OAIG;IACI,cAAc,CAAC,gBAAwB,CAAC;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;QAChD,IAAI,UAAU,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM;YACvC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,KAAK,aAAa,EAAE,yDAAyD;YAChF,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,mDAAmD;QAC9F,MAAM,QAAQ,GAAG,aAAa,CAAC,UAAU,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,sBAAsB,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACvD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,0CAA0C;YACpF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,gFAAgF;QAChF,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;QACnD,MAAM,aAAa,GAAY,QAAQ,CAAC,UAAU,CAAC,MAAM,IAAI,YAAY,CAAC;QAC1E,GAAG,CAAC;YACF,IAAI,aAAa,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS;gBAC9C,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACnD,CAAC,QAAQ,OAAO,CAAC,eAAe,EAAE,IAAI,OAAO,CAAC,gBAAgB,EAAE,GAAG,aAAa,EAAE;QAClF,IAAI,YAAY,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM;YACxF,QAAQ,CAAC,oCAAoC,CAAC,IAAI,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;QACjF,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9B,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE;YAC/D,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kFAAkF;IAC3E,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,qGAAqG;IAC9F,MAAM,CAAC,gBAAgB,CAAC,QAAoC;QACjE,IAAI,MAAmC,CAAC;QACxC,IAAI,QAAQ,YAAY,QAAQ,EAAE,CAAC;YACjC,IAAI,QAAQ,YAAY,eAAe;gBACrC,MAAM,GAAG,QAAQ,CAAC;QACtB,CAAC;aAAM,IAAI,QAAQ,CAAC,cAAc,EAAE,IAAI,QAAQ,CAAC,cAAc,EAAE,YAAY,eAAe;YAC1F,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAqB,CAAC;QACxD,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC;YAChD,IAAI,aAAa,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,UAAU;gBAC9F,OAAO,EAAE,MAAM,EAAE,aAAa,EAAE,CAAC;QACrC,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Polyface\n */\n\n// cspell:word internaldocs\n\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { Geometry } from \"../Geometry\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { GrowableXYArray } from \"../geometry3d/GrowableXYArray\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point2d } from \"../geometry3d/Point2dVector2d\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { NumberArray } from \"../geometry3d/PointHelpers\";\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { FacetFaceData } from \"./FacetFaceData\";\nimport { IndexedPolyfaceVisitor } from \"./IndexedPolyfaceVisitor\";\nimport { PolyfaceData } from \"./PolyfaceData\";\n\n/**\n * A Polyface is an abstract mesh structure (of unspecified implementation) that provides a PolyfaceVisitor\n * to iterate over its facets.\n * @public\n */\nexport abstract class Polyface extends GeometryQuery {\n  /** String name for schema properties */\n  public readonly geometryCategory = \"polyface\";\n  /** Underlying polyface data. */\n  public data: PolyfaceData;\n  /** Constructor */\n  protected constructor(data: PolyfaceData) {\n    super();\n    this.data = data;\n  }\n  /**\n   * Create and return a visitor for this concrete polyface.\n   * @param numWrap the number of vertices to replicate in visitor arrays.\n   */\n  public abstract createVisitor(numWrap: number): PolyfaceVisitor;\n  /**\n   * The [[PolyfaceData.twoSided]] flag.\n   */\n  public get twoSided() {\n    return this.data.twoSided;\n  }\n  public set twoSided(value: boolean) {\n    this.data.twoSided = value;\n  }\n  /**\n   * Flag indicating if the mesh closure is unknown (0), open sheet (1), closed solid (2).\n   * * A boundary edge of a mesh is defined as an edge with only one connected facet.\n   * * Closed solid is a mesh with no boundary edge. Open sheet is a mesh that has boundary edge(s).\n   */\n  public get expectedClosure(): number {\n    return this.data.expectedClosure;\n  }\n  public set expectedClosure(value: number) {\n    this.data.expectedClosure = value;\n  }\n  /**\n   * Check validity of indices into a data array.\n   * * It is valid to have both indices and data undefined.\n   * * It is NOT valid for just one to be defined.\n   * * Index values at indices[indexPositionA <= i < indexPositionB] must be valid indices to the data array.\n   * @param indices array of indices.\n   * @param indexPositionA first index to test.\n   * @param indexPositionB one past final index to test.\n   * @param data data array.\n   * @param dataLength length of data array.\n   */\n  public static areIndicesValid(\n    indices: number[] | undefined,\n    indexPositionA: number,\n    indexPositionB: number,\n    data: any,\n    dataLength: number,\n  ): boolean {\n    if (indices === undefined && data === undefined)\n      return true;\n    if (indices === undefined || data === undefined)\n      return false;\n    if (indexPositionA < 0 || indexPositionA >= indices.length)\n      return false;\n    if (indexPositionB <= indexPositionA || indexPositionB > indices.length)\n      return false;\n    for (let i = indexPositionA; i < indexPositionB; i++)\n      if (indices[i] < 0 || indices[i] >= dataLength)\n        return false;\n    return true;\n  }\n  /** Returns true if this polyface has no facets. */\n  public abstract get isEmpty(): boolean;\n  /** Returns the number of facets of this polyface. Subclasses should override. */\n  public get facetCount(): number | undefined {\n    return undefined;\n  }\n}\n\n/**\n * An `IndexedPolyface` is a set of facets which can have normal, param, and color arrays with independent point,\n * normal, param, and color indices.\n * @public\n */\nexport class IndexedPolyface extends Polyface { // more info can be found at geometry/internaldocs/Polyface.md\n  /**\n   * Start indices of all facets of the polyface.\n   * * Each element is an index to the `this.data.pointIndex` array entry for a specific facet.\n   * * The facet count is `_facetStart.length - 1`.\n   * * The face loop for the i_th facet consists of the entries in `this.data.pointIndex` at indices `_facetStart[i]`\n   * up to (but not including) `_facetStart[i + 1]`.\n   * * Note the array is initialized with one entry (value 0).\n   */\n  protected _facetStart: number[];\n  /**\n   * Index to the `this.data.face` array entry for a specific facet.\n   * * `_facetToFaceData` has one entry per facet.\n   */\n  protected _facetToFaceData: number[];\n  /**\n   * Constructor for a new polyface.\n   * @param data PolyfaceData arrays to capture.\n   * @param facetStart optional array of facet start indices (e.g. known during clone)\n   * @param facetToFacetData optional array of face identifiers (e.g. known during clone)\n   */\n  protected constructor(data: PolyfaceData, facetStart?: number[], facetToFaceData?: number[]) {\n    super(data);\n    if (facetStart)\n      this._facetStart = facetStart.slice(); // deep copy\n    else {\n      this._facetStart = [];\n      this._facetStart.push(0);\n    }\n    if (facetToFaceData)\n      this._facetToFaceData = facetToFaceData.slice(); // deep copy\n    else\n      this._facetToFaceData = [];\n  }\n\n  /** Given an edgeIndex (index into `data.pointIndex`), return the index of the facet containing the edge. */\n  public edgeIndexToFacetIndex(k: number | undefined): number | undefined {\n    if (k === undefined)\n      return undefined;\n    return NumberArray.searchStrictlyIncreasingNumbers(this._facetStart, k);\n  }\n  /**\n   * Given an edgeIndex (index into `data.pointIndex`), return the range of the edgeIndices of the containing facet.\n   * * If an edge with edgeIndex `k` is found in the facet with facetIndex `f`, then the returned range `r` satisfies\n   * `r.low = this.facetIndex0(f) <= k < this.facetIndex1(f) = r.high` and can be used to iterate the facet's face\n   * loop. See [[facetIndex0]].\n   */\n  public edgeIndexToFaceLoop(k: number | undefined): Range1d | undefined {\n    const q = this.edgeIndexToFacetIndex(k);\n    if (q !== undefined)\n      return Range1d.createXX(this.facetIndex0(q), this.facetIndex1(q));\n    return undefined;\n  }\n\n  /** Test if other is an instance of `IndexedPolyface` */\n  public isSameGeometryClass(other: any): boolean {\n    return other instanceof IndexedPolyface;\n  }\n  /** Tests for equivalence between two IndexedPolyfaces. */\n  public override isAlmostEqual(other: any): boolean {\n    if (other instanceof IndexedPolyface) {\n      return this.data.isAlmostEqual(other.data) &&\n        NumberArray.isExactEqual(this._facetStart, other._facetStart) &&\n        NumberArray.isExactEqual(this._facetToFaceData, other._facetToFaceData);\n    }\n    return false;\n  }\n  /** Returns true if either the point array or the point index array is empty. */\n  public get isEmpty(): boolean {\n    return this.data.pointCount === 0 || this.data.pointIndex.length === 0;\n  }\n  /**\n   * Transform the mesh.\n   * * If `transform` is a mirror, also reverse the index order around each facet.\n   * * Note that this method always returns true. If transforming the normals fails (due to singular matrix or zero\n   * normal), the original normal(s) are left unchanged.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    this.data.tryTransformInPlace(transform);\n    if (transform.matrix.determinant() < 0)\n      this.reverseIndices();\n    return true;\n  }\n  /** Reverse indices for a single facet. */\n  public reverseSingleFacet(facetId: number) {\n    this.data.reverseIndicesSingleFacet(facetId, this._facetStart);\n  }\n  /** Return a deep clone. */\n  public clone(): IndexedPolyface {\n    return new IndexedPolyface(this.data.clone(), this._facetStart.slice(), this._facetToFaceData.slice());\n  }\n  /**\n   * Return a deep clone with transformed points and normals.\n   * @see [[IndexedPolyface.tryTransformInPlace]] for details of how transform is done.\n   */\n  public cloneTransformed(transform: Transform): IndexedPolyface { // we know tryTransformInPlace succeeds.\n    const result = this.clone();\n    result.tryTransformInPlace(transform);\n    return result;\n  }\n  /** Reverse the order of indices around all facets. */\n  public reverseIndices() {\n    this.data.reverseIndices(this._facetStart);\n  }\n  /** Reverse the direction of all normal vectors. */\n  public reverseNormals() {\n    this.data.reverseNormals();\n  }\n  /**\n   * Return face data using a facet index.\n   * * Returns `undefined` if none found.\n   * * This is the REFERENCE to the FacetFaceData not a copy.\n  */\n  public tryGetFaceData(i: number): FacetFaceData | undefined {\n    if (i < 0 || i >= this._facetToFaceData.length)\n      return undefined;\n    const faceIndex = this._facetToFaceData[i];\n    if (faceIndex < 0 || faceIndex >= this.data.face.length)\n      return undefined;\n    return this.data.face[faceIndex];\n  }\n  /**\n   * Add facets from `source` to `this` polyface.\n   * * Optionally reverse facet indices as per `PolyfaceData.reverseIndicesSingleFacet()` with `preserveStart = false` and\n   * invert source normals.\n   * * Optionally apply a `transform` to points and normals.\n   * * Will only copy param, normal, color, and face data if we are already tracking them AND/OR the source contains them.\n   */\n  public addIndexedPolyface(source: IndexedPolyface, reversed: boolean, transform: Transform | undefined) {\n    const numSourceFacets = source.facetCount;\n    // add point, point index, and edge visibility data\n    // note that there is no need to build an intermediate index map since all points are added\n    const startOfNewPoints = this.data.point.length;\n    const xyz = Point3d.create();\n    for (let i = 0; i < source.data.point.length; i++) {\n      source.data.point.getPoint3dAtUncheckedPointIndex(i, xyz);\n      if (transform) {\n        transform.multiplyPoint3d(xyz, xyz);\n        this.addPoint(xyz);\n      } else\n        this.addPoint(xyz);\n    }\n    for (let i = 0; i < numSourceFacets; i++) {\n      const i0 = source._facetStart[i];\n      const i1 = source._facetStart[i + 1];\n      if (reversed) {\n        for (let j = i1; j-- > i0;) { // visibility is transferred from far vertex, e.g., -abc-d => dc-b-a\n          this.addPointIndex(\n            startOfNewPoints + source.data.pointIndex[j],\n            source.data.edgeVisible[j > i0 ? j - 1 : i1 - 1],\n          );\n        }\n      } else {\n        for (let j = i0; j < i1; j++) {\n          this.addPointIndex(\n            startOfNewPoints + source.data.pointIndex[j],\n            source.data.edgeVisible[j],\n          );\n        }\n      }\n      this.terminateFacet(false);\n    }\n    // add param and param index data\n    if (undefined !== this.data.param && undefined !== source.data.param && undefined !== source.data.paramIndex) {\n      const startOfNewParams = this.data.param.length;\n      this.data.param.pushFromGrowableXYArray(source.data.param);\n      for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match normals\n        const i0 = source._facetStart[i];\n        const i1 = source._facetStart[i + 1];\n        if (reversed) {\n          for (let j = i1; j-- > i0;)\n            this.addParamIndex(startOfNewParams + source.data.paramIndex[j]);\n        } else {\n          for (let j = i0; j < i1; j++)\n            this.addParamIndex(startOfNewParams + source.data.paramIndex[j]);\n        }\n      }\n    }\n    // add normal and normal index data\n    if (undefined !== this.data.normal && undefined !== source.data.normal && undefined !== source.data.normalIndex) {\n      const startOfNewNormals = this.data.normal.length;\n      for (let i = 0; i < source.data.normal.length; i++) {\n        const sourceNormal = source.data.normal.getVector3dAtCheckedVectorIndex(i)!;\n        if (transform)\n          transform.multiplyVector(sourceNormal, sourceNormal);\n        if (reversed)\n          sourceNormal.scaleInPlace(-1.0);\n        this.addNormal(sourceNormal);\n      }\n      for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match normals\n        const i0 = source._facetStart[i];\n        const i1 = source._facetStart[i + 1];\n        if (reversed) {\n          for (let j = i1; j-- > i0;)\n            this.addNormalIndex(startOfNewNormals + source.data.normalIndex[j]);\n        } else {\n          for (let j = i0; j < i1; j++)\n            this.addNormalIndex(startOfNewNormals + source.data.normalIndex[j]);\n        }\n      }\n    }\n    // add color and color index data\n    if (undefined !== this.data.color && undefined !== source.data.color && undefined !== source.data.colorIndex) {\n      const startOfNewColors = this.data.color.length;\n      for (const sourceColor of source.data.color)\n        this.addColor(sourceColor);\n      for (let i = 0; i < numSourceFacets; i++) { // expect facet start and ends for points to match colors\n        const i0 = source._facetStart[i];\n        const i1 = source._facetStart[i + 1];\n        if (reversed) {\n          for (let j = i1; j-- > i0;)\n            this.addColorIndex(startOfNewColors + source.data.colorIndex[j]);\n        } else {\n          for (let j = i0; j < i1; j++)\n            this.addColorIndex(startOfNewColors + source.data.colorIndex[j]);\n        }\n      }\n    }\n    // add face and facetToFace index data\n    if (source.data.face.length !== 0) {\n      const startOfNewFaceData = this.data.face.length;\n      for (const face of source.data.face) {\n        const sourceFaceData = face.clone();\n        this.data.face.push(sourceFaceData);\n      }\n      for (const facetToFaceIdx of source._facetToFaceData) {\n        this._facetToFaceData.push(startOfNewFaceData + facetToFaceIdx);\n      }\n    }\n  }\n  /**\n   * Return the total number of indices in zero-terminated style, which includes\n   * * all the indices in the packed zero-based table.\n   * * one additional index for the zero-terminator of each facet.\n   * @note Note that all index arrays (pointIndex, normalIndex, paramIndex, colorIndex) have the same counts, so there\n   * is not a separate query for each of them.\n   */\n  public get zeroTerminatedIndexCount(): number {\n    return this.data.pointIndex.length + this._facetStart.length - 1;\n  }\n  /**\n   * Create an empty facet set with coordinate and index data to be supplied later.\n   * @param needNormals `true` to allocate empty normal data and index arrays; `false` (default) to leave undefined.\n   * @param needParams `true` to allocate empty uv parameter data and index arrays; `false` (default) to leave undefined.\n   * @param needColors `true` to allocate empty color data and index arrays; `false` (default) to leave undefined.\n   * @param twoSided `true` (default) if the facets are to be considered viewable from the back; `false` if they are amenable to backface culling.\n   */\n  public static create(\n    needNormals: boolean = false,\n    needParams: boolean = false,\n    needColors: boolean = false,\n    twoSided: boolean = true,\n  ): IndexedPolyface {\n    return new IndexedPolyface(new PolyfaceData(needNormals, needParams, needColors, twoSided));\n  }\n  /**\n   * Add (a clone of) a point to point array.\n   * @param point the point.\n   * @param priorIndex (optional) index of prior point to check for possible duplicate value.\n   * @returns the zero-based index of the added or duplicate point.\n   */\n  public addPoint(point: Point3d, priorIndex?: number): number {\n    if (priorIndex !== undefined) {\n      const distance = this.data.point.distanceIndexToPoint(priorIndex, point);\n      if (distance !== undefined && Geometry.isSmallMetricDistance(distance))\n        return priorIndex;\n    }\n    this.data.point.pushXYZ(point.x, point.y, point.z);\n    return this.data.point.length - 1;\n  }\n  /**\n   * Add a point to point array.\n   * @param x the x coordinate of point.\n   * @param y the y coordinate of point.\n   * @param z the z coordinate of point.\n   * @returns the zero-based index of the added point.\n   */\n  public addPointXYZ(x: number, y: number, z: number): number {\n    this.data.point.pushXYZ(x, y, z);\n    return this.data.point.length - 1;\n  }\n  /**\n   * Add (a clone of) a uv parameter to the parameter array.\n   * @param param the parameter.\n   * @returns zero-based index of the added param.\n   */\n  public addParam(param: Point2d): number {\n    if (!this.data.param)\n      this.data.param = new GrowableXYArray();\n    this.data.param.push(param);\n    return this.data.param.length - 1;\n  }\n  /**\n   * Add a uv parameter to the parameter array.\n   * @param u the u part of parameter.\n   * @param v the v part of parameter.\n   * @param priorIndexA first index to check for possible duplicate value.\n   * @param priorIndexB second index to check for possible duplicate value.\n   * @returns zero-based index of the added or duplicate parameter.\n   */\n  public addParamUV(u: number, v: number, priorIndexA?: number, priorIndexB?: number): number {\n    if (!this.data.param)\n      this.data.param = new GrowableXYArray();\n    if (priorIndexA !== undefined && this.data.isAlmostEqualParamIndexUV(priorIndexA, u, v))\n      return priorIndexA;\n    if (priorIndexB !== undefined && this.data.isAlmostEqualParamIndexUV(priorIndexB, u, v))\n      return priorIndexB;\n    this.data.param.pushXY(u, v);\n    return this.data.param.length - 1;\n  }\n  /**\n   * Add (a clone of) a normal vector to the normal array.\n   * @param normal the normal vector.\n   * @param priorIndexA first index to check for possible duplicate value.\n   * @param priorIndexB second index to check for possible duplicate value.\n   * @returns zero-based index of the added or duplicate normal.\n   */\n  public addNormal(normal: Vector3d, priorIndexA?: number, priorIndexB?: number): number {\n    // check if `normal` is duplicate of `dataNormal` at index `i`\n    const normalIsDuplicate = (i: number) => {\n      const distance = this.data.normal!.distanceIndexToPoint(i, normal);\n      return distance !== undefined && Geometry.isSmallMetricDistance(distance);\n    };\n    if (this.data.normal !== undefined) {\n      if (priorIndexA !== undefined && normalIsDuplicate(priorIndexA))\n        return priorIndexA;\n      if (priorIndexB !== undefined && normalIsDuplicate(priorIndexB))\n        return priorIndexB;\n      // check the tail index for possible duplicate\n      if (priorIndexA !== undefined || priorIndexB !== undefined) {\n        const tailIndex = this.data.normal.length - 1;\n        if (normalIsDuplicate(tailIndex))\n          return tailIndex;\n      }\n    }\n    return this.addNormalXYZ(normal.x, normal.y, normal.z);\n  }\n  /**\n   * Add a normal vector to the normal array.\n   * @param x the x coordinate of normal.\n   * @param y the y coordinate of normal.\n   * @param z the z coordinate of normal.\n   * @returns zero-based index of the added normal vector.\n   */\n  public addNormalXYZ(x: number, y: number, z: number): number {\n    if (!this.data.normal)\n      this.data.normal = new GrowableXYZArray();\n    this.data.normal.pushXYZ(x, y, z);\n    return this.data.normal.length - 1;\n  }\n  /**\n   * Add a color to the color array\n   * @param color the color.\n   * @returns zero-based index of the added color.\n   */\n  public addColor(color: number): number {\n    if (!this.data.color)\n      this.data.color = [];\n    this.data.color.push(color);\n    return this.data.color.length - 1;\n  }\n  /** Add a point index with edge visibility flag. */\n  public addPointIndex(index: number, visible: boolean = true): void {\n    this.data.pointIndex.push(index);\n    this.data.edgeVisible.push(visible);\n  }\n  /** Add a normal index. */\n  public addNormalIndex(index: number): void {\n    if (!this.data.normalIndex)\n      this.data.normalIndex = [];\n    this.data.normalIndex.push(index);\n  }\n  /** Add a param index. */\n  public addParamIndex(index: number): void {\n    if (!this.data.paramIndex)\n      this.data.paramIndex = [];\n    this.data.paramIndex.push(index);\n  }\n  /** Add a color index. */\n  public addColorIndex(index: number): void {\n    if (!this.data.colorIndex)\n      this.data.colorIndex = [];\n    this.data.colorIndex.push(index);\n  }\n  /**\n   * Clean up the open facet.\n   * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. To remove nebulous \"open facet\" concept from the API. Call [[PolyfaceData.trimAllIndexArrays]]\n   * instead.\n   */\n  public cleanupOpenFacet(): void {\n    this.data.trimAllIndexArrays(this.data.pointIndex.length);\n  }\n\n  /**\n   * Validate (the tail of) the active index arrays: point, normal, param, color.\n   * @param index0 optional offset into the index arrays at which to start validating indices. Default 0.\n   * @param errors optional array appended with error message(s) if invalid indices are encountered\n   * @return whether the indices are valid\n   */\n  public validateAllIndices(index0: number = 0, errors?: string[]): boolean {\n    const numPointIndices = this.data.pointIndex.length;\n    const messages = errors ?? [];\n    if (0 === numPointIndices) {\n      messages.push(\"empty pointIndex array\");\n      return false;\n    }\n    if (index0 < 0 || index0 >= numPointIndices) {\n      messages.push(\"invalid input offset\");\n      return false;\n    }\n    if (this.data.normalIndex && this.data.normalIndex.length !== numPointIndices)\n      messages.push(\"normalIndex count must match pointIndex count\");\n    if (this.data.paramIndex && this.data.paramIndex.length !== numPointIndices)\n      messages.push(\"paramIndex count must equal pointIndex count\");\n    if (this.data.colorIndex && this.data.colorIndex.length !== numPointIndices)\n      messages.push(\"colorIndex count must equal pointIndex count\");\n    if (this.data.edgeVisible.length !== numPointIndices)\n      messages.push(\"visibleIndex count must equal pointIndex count\");\n    if (!Polyface.areIndicesValid(this.data.pointIndex, index0, numPointIndices, this.data.point, this.data.point ? this.data.point.length : 0))\n      messages.push(\"invalid point index encountered\");\n    if (!Polyface.areIndicesValid(this.data.normalIndex, index0, numPointIndices, this.data.normal, this.data.normal ? this.data.normal.length : 0))\n      messages.push(\"invalid normal index encountered\");\n    if (!Polyface.areIndicesValid(this.data.paramIndex, index0, numPointIndices, this.data.param, this.data.param ? this.data.param.length : 0))\n      messages.push(\"invalid param index encountered\");\n    if (!Polyface.areIndicesValid(this.data.colorIndex, index0, numPointIndices, this.data.color, this.data.color ? this.data.color.length : 0))\n      messages.push(\"invalid color index encountered\");\n    if (this.data.edgeMateIndex) {\n      if (this.data.edgeMateIndex.length !== numPointIndices)\n        messages.push(\"edgeMateIndex count must equal pointIndex count\");\n      else if (!this.data.edgeMateIndex.every((i: number | undefined) => i === undefined || this.data.isValidEdgeIndex(i)))\n        messages.push(\"invalid edgeMate encountered\");\n    }\n    return 0 === messages.length;\n  }\n\n  /**\n   * Announce the end of construction of a facet.\n   * * Optionally check for:\n   *   * Same number of indices among all active index arrays -- point, normal, param, color\n   *   * All indices for the latest facet are within bounds of the respective data arrays.\n   * * In error cases, all index arrays are trimmed back to the size when previous facet was terminated.\n   * * A return value of `undefined` is normal. Otherwise, a string array of error messages is returned.\n   */\n  public terminateFacet(validateAllIndices: boolean = true): string[] | undefined {\n    const numFacets = this._facetStart.length - 1;\n    // number of indices in accepted facets\n    const lengthA = this._facetStart[numFacets];\n    // number of indices in all facets (accepted facet plus the last facet to be accepted)\n    const lengthB = this.data.pointIndex.length;\n    if (validateAllIndices) {\n      const messages: string[] = [];\n      if (lengthB < lengthA + 2)\n        messages.push(\"Less than 3 indices in the last facet\");\n      this.validateAllIndices(lengthA, messages);\n      if (messages.length > 0) {\n        this.data.trimAllIndexArrays(lengthA);\n        return messages;\n      }\n    }\n    this._facetStart.push(lengthB); // append start index of the future facet\n    return undefined;\n  }\n  /** Number of facets (read-only property). */\n  public override get facetCount(): number {\n    return this._facetStart.length - 1;\n  }\n  /** Number of faces (read-only property). */\n  public get faceCount(): number {\n    return this.data.faceCount;\n  }\n  /** Number of points (read-only property). */\n  public get pointCount(): number {\n    return this.data.pointCount;\n  }\n  /** Number of colors (read-only property). */\n  public get colorCount(): number {\n    return this.data.colorCount;\n  }\n  /** Number of parameters (read-only property). */\n  public get paramCount(): number {\n    return this.data.paramCount;\n  }\n  /** Number of normals (read-only property). */\n  public get normalCount(): number {\n    return this.data.normalCount;\n  }\n  /** Test if `index` is a valid facet index. */\n  public isValidFacetIndex(facetIndex: number): boolean {\n    return facetIndex >= 0 && facetIndex < this.facetCount;\n  }\n  /** Return the number of edges in a particular facet. */\n  public numEdgeInFacet(facetIndex: number): number {\n    if (this.isValidFacetIndex(facetIndex))\n      return this._facetStart[facetIndex + 1] - this._facetStart[facetIndex];\n    return 0;\n  }\n  /**\n   * Given a valid facet index, return the index at which its face loop starts in the index arrays.\n   * * A \"face loop\" is a contiguous block of indices into the parallel polyface index arrays.\n   * * Each of these indices represents an edge of a facet, thus it is sometimes called an \"edgeIndex\".\n   * * Together with [[facetIndex1]], this method can be used to iterate the face loop of the facet\n   * with index `iFacet` as follows:\n   * ````\n   * for (let iEdge = this.facetIndex0(iFacet); iEdge < this.facetIndex1(iFacet); iEdge++) {\n   *   const iPoint = this.data.pointIndex[iEdge];\n   *   const p = this.data.point[iPoint];\n   *   // ... process the edge of this facet starting at point p\n   * }\n   * ````\n   */\n  public facetIndex0(facetIndex: number): number {\n    return this._facetStart[facetIndex];\n  }\n  /**\n   * Given a valid facet index, return one past the index at which its face loop ends in the index arrays.\n   * * For details, see [[facetIndex0]].\n   */\n  public facetIndex1(facetIndex: number): number {\n    return this._facetStart[facetIndex + 1];\n  }\n  /** Return a readonly reference to the facetStart array accessed by [[facetIndex0]] and [[facetIndex1]]. */\n  public get facetStart(): ReadonlyArray<number> {\n    return this._facetStart;\n  }\n  /** create a visitor for this polyface */\n  public createVisitor(numWrap: number = 0): IndexedPolyfaceVisitor {\n    return IndexedPolyfaceVisitor.create(this, numWrap);\n  }\n  /** Return the range of (optionally transformed) points in this mesh. */\n  public override range(transform?: Transform, result?: Range3d): Range3d {\n    return this.data.range(result, transform);\n  }\n  /** Extend `range` with coordinates from this mesh. */\n  public extendRange(range: Range3d, transform?: Transform): void {\n    this.data.range(range, transform);\n  }\n  /**\n   * Given the index of a facet, return the data pertaining to the face it is a part of.\n   * @deprecated in 4.5.0 - will not be removed until after 2026-06-13. Use [[IndexedPolyface.tryGetFaceData]], which verifies the index is in range.\n   */\n  public getFaceDataByFacetIndex(facetIndex: number): FacetFaceData {\n    return this.data.face[this._facetToFaceData[facetIndex]];\n  }\n  /**\n   * Set new FacetFaceData.\n   * * All terminated facets since the last face declaration will be mapped to a single new FacetFaceData object using\n   * facetToFaceData[]. FacetFaceData holds the 2D range of the face. Returns `true` if successful, `false` otherwise.\n   */\n  public setNewFaceData(endFacetIndex: number = 0): boolean {\n    const facetStart = this._facetToFaceData.length;\n    if (facetStart >= this._facetStart.length)\n      return false;\n    if (0 === endFacetIndex) // the default for endFacetIndex is really the last facet\n      endFacetIndex = this._facetStart.length; // last facet index corresponds to the future facet\n    const faceData = FacetFaceData.createNull();\n    const visitor = IndexedPolyfaceVisitor.create(this, 0);\n    if (!visitor.moveToReadIndex(facetStart)) { // move visitor to first facet of new face\n      return false;\n    }\n    // if parameter range is provided (by the polyface planeSet clipper) then use it\n    const paramDefined = this.data.param !== undefined;\n    const setParamRange: boolean = faceData.paramRange.isNull && paramDefined;\n    do {\n      if (setParamRange && visitor.param !== undefined)\n        visitor.param.extendRange(faceData.paramRange);\n    } while (visitor.moveToNextFacet() && visitor.currentReadIndex() < endFacetIndex);\n    if (paramDefined && !(this.data.param!.length === 0) && faceData.paramDistanceRange.isNull)\n      faceData.setParamDistanceRangeFromNewFaceData(this, facetStart, endFacetIndex);\n    this.data.face.push(faceData);\n    const faceDataIndex = this.data.face.length - 1;\n    for (let i = this._facetToFaceData.length; i < endFacetIndex; i++)\n      this._facetToFaceData.push(0 === this._facetStart[i] ? 0 : faceDataIndex);\n    return true;\n  }\n  /** Second step of double dispatch: call `handler.handleIndexedPolyface(this)`. */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleIndexedPolyface(this);\n  }\n  /** If the input accesses an edgeMateIndex array, return it along with the owning IndexedPolyface. */\n  public static hasEdgeMateIndex(polyface: Polyface | PolyfaceVisitor): { parent: IndexedPolyface, edgeMateIndex: Array<number | undefined> } | undefined {\n    let parent: IndexedPolyface | undefined;\n    if (polyface instanceof Polyface) {\n      if (polyface instanceof IndexedPolyface)\n        parent = polyface;\n    } else if (polyface.clientPolyface() && polyface.clientPolyface() instanceof IndexedPolyface)\n      parent = polyface.clientPolyface() as IndexedPolyface;\n    if (parent) {\n      const edgeMateIndex = parent.data.edgeMateIndex;\n      if (edgeMateIndex && edgeMateIndex.length > 0 && edgeMateIndex.length === parent.data.indexCount)\n        return { parent, edgeMateIndex };\n    }\n    return undefined;\n  }\n}\n\n/**\n * A PolyfaceVisitor manages data while iterating facets.\n * * The polyface visitor holds data for one facet at a time.\n * * The caller can request the position in the addressed polyfaceData as a \"readIndex\".\n * * The readIndex values (as numbers) are not assumed to be sequential (i.e., they might be contiguous facet indices\n * or the indexing scheme might have gaps at the whim of the particular PolyfaceVisitor implementation).\n * * Example usage:\n * ```\n * const visitor = myPolyface.createVisitor();\n * for (visitor.reset(); visitor.moveToNextFacet(); ) {\n *   // process the current facet\n * }\n * ```\n * @public\n */\nexport interface PolyfaceVisitor extends PolyfaceData {\n  /** Load data for the facet with given index. */\n  moveToReadIndex(index: number): boolean;\n  /** Return the index of the currently loaded facet. */\n  currentReadIndex(): number;\n  /** Load data for the next facet. */\n  moveToNextFacet(): boolean;\n  /** Restart the visitor at the first facet. */\n  reset(): void;\n  /** Return the point index of vertex i within the currently loaded facet. */\n  clientPointIndex(i: number): number;\n  /** Return the param index of vertex i within the currently loaded facet. */\n  clientParamIndex(i: number): number;\n  /** Return the normal index of vertex i within the currently loaded facet. */\n  clientNormalIndex(i: number): number;\n  /** Return the color index of vertex i within the currently loaded facet. */\n  clientColorIndex(i: number): number;\n  /** Return the aux data index of vertex i within the currently loaded facet. */\n  clientAuxIndex(i: number): number;\n  /** Return the client polyface. */\n  clientPolyface(): Polyface | undefined;\n  /**\n   * Set the number of vertices replicated in visitor arrays (both data and index arrays).\n   * * 0,1,2 are the most common values.\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\n   * the next two points, e.g., to form two adjacent vectors for a cross product.\n   */\n  setNumWrap(numWrap: number): void;\n  /** Clear the contents of the data arrays. Use this along with `pushDataFrom` to build up new facets. */\n  clearArrays(): void;\n  /** Transfer data from a specified index of the other visitor as new data in this visitor. */\n  pushDataFrom(other: PolyfaceVisitor, index: number): void;\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  pushInterpolatedDataFrom(other: PolyfaceVisitor, index0: number, fraction: number, index1: number): void;\n  /**\n   * Return the number of facets this visitor is able to visit.\n   * * Allows implementers to improve the efficiency of e.g., [[PolyfaceQuery.visitorClientFacetCount]].\n   */\n  getVisitableFacetCount?(): number;\n  /** Create a visitor for a subset of the facets visitable by the instance. */\n  createSubsetVisitor?(facetIndices: number[], numWrap: number): PolyfaceVisitor;\n}\n"]}

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

@@ -278,7 +278,7 @@ export declare class PolyfaceBuilder extends NullGeometryHandler {
      * Apply stroke counts to curve primitives.
      * * Recursively visit all children of data.
      * * At each primitive, invoke `computeStrokeCountForOptions` method with options from the builder.
-     * @deprecated in 4.x. This method does nothing and is unneeded.
+     * @deprecated in 4.8.0 - will not be removed until after 2026-06-13. This method does nothing and is unneeded.
      */
     applyStrokeCountsToCurvePrimitives(data: AnyCurve | GeometryQuery): void;
     private addBetweenStrokeSetsWithRuledNormals;

package/lib/esm/polyface/PolyfaceBuilder.js

@@ -1066,7 +1066,7 @@ export class PolyfaceBuilder extends NullGeometryHandler {
     /** Construct facets for a rotational sweep. */
     addRotationalSweep(surface) {
         const contour = surface.getSweepContourRef();
-        const section0 = StrokeCountSection.createForParityRegionOrChain(contour.getCurves(), this._options);
+        const section0 = StrokeCountSection.create(contour.getCurves(), this._options);
         const baseStrokes = section0.getStrokes();
         // ensure sweep is positive for buildRotationalNormalsInLineStrings
         const axis = surface.cloneAxisRay();
@@ -1110,7 +1110,7 @@ export class PolyfaceBuilder extends NullGeometryHandler {
      * Apply stroke counts to curve primitives.
      * * Recursively visit all children of data.
      * * At each primitive, invoke `computeStrokeCountForOptions` method with options from the builder.
-     * @deprecated in 4.x. This method does nothing and is unneeded.
+     * @deprecated in 4.8.0 - will not be removed until after 2026-06-13. This method does nothing and is unneeded.
      */
     applyStrokeCountsToCurvePrimitives(data) {
         const options = this._options;
@@ -1216,7 +1216,7 @@ export class PolyfaceBuilder extends NullGeometryHandler {
     /** Add facets from the linear sweep. */
     addLinearSweep(surface) {
         const contour = surface.getCurvesRef();
-        const section0 = StrokeCountSection.createForParityRegionOrChain(contour, this._options);
+        const section0 = StrokeCountSection.create(contour, this._options);
         const stroke0 = section0.getStrokes();
         const sweepVector = surface.cloneSweepVector();
         const sweepTransform = Transform.createTranslation(sweepVector);
@@ -1238,7 +1238,7 @@ export class PolyfaceBuilder extends NullGeometryHandler {
         let stroke1;
         const sectionMaps = [];
         for (const contour of contours)
-            sectionMaps.push(StrokeCountSection.createForParityRegionOrChain(contour.curves, this._options));
+            sectionMaps.push(StrokeCountSection.create(contour.curves, this._options));
         if (StrokeCountSection.enforceStrokeCountCompatibility(sectionMaps)) {
             StrokeCountSection.enforceCompatibleDistanceSums(sectionMaps);
             for (let i = 0; i < contours.length; i++) {
@@ -1854,9 +1854,9 @@ export class PolyfaceBuilder extends NullGeometryHandler {
         let indexA = -1;
         let indexB = -1;
         for (let i = this._polyface.facetIndex0(edge.facetIndex); i < this._polyface.facetIndex1(edge.facetIndex); ++i) {
-            if (edge.vertexIndexA === this._polyface.data.pointIndex[i])
+            if (edge.startVertex === this._polyface.data.pointIndex[i])
                 indexA = i;
-            else if (edge.vertexIndexB === this._polyface.data.pointIndex[i])
+            else if (edge.endVertex === this._polyface.data.pointIndex[i])
                 indexB = i;
         }
         return (indexA < 0 || indexB < 0) ? undefined : { edgeIndexA: indexA, edgeIndexB: indexB };