@itwin/core-geometry 5.5.0-dev.4 → 5.5.0-dev.5

package/lib/cjs/topology/HalfEdgePositionDetail.js.map

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgePositionDetail.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePositionDetail.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AACvC,mEAAwD;AAIxD,iGAAiG;AACjG,IAAY,YAcX;AAdD,WAAY,YAAY;IACtB,yBAAyB;IACzB,+CAAQ,CAAA;IACR,4DAA4D;IAC5D,mDAAU,CAAA;IACV,0BAA0B;IAC1B,+CAAQ,CAAA;IACR,gDAAgD;IAChD,+CAAQ,CAAA;IACR;;;MAGE;IACF,+DAAgB,CAAA;AAClB,CAAC,EAdW,YAAY,4BAAZ,YAAY,QAcvB;AACD;;;;;GAKG;AACH,MAAa,sBAAsB;IACjC,yBAAyB;IACjB,KAAK,CAAY;IACzB,+BAA+B;IACxB,CAAC,CAAS;IACV,CAAC,CAAS;IACV,CAAC,CAAS;IACjB,2FAA2F;IACnF,aAAa,CAAU;IAC/B,0DAA0D;IAClD,KAAK,CAAe;IAC5B,sBAAsB;IACd,KAAK,CAAU;IACvB,uBAAuB;IACf,KAAK,CAAU;IACvB,+EAA+E;IACvE,iBAAiB,CAAW;IACpC;;;OAGG;IACH,YACE,IAA0B,EAC1B,CAAS,EAAE,CAAS,EAAE,CAAS,EAC/B,IAAkB,EAClB,YAAqB,EACrB,IAAa,EACb,IAAa,EACb,gBAA0B;QAE1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,iBAAiB,GAAG,gBAAgB,CAAC;IAC5C,CAAC;IACD,4CAA4C;IACrC,OAAO,CAAC,KAA6B;QAC1C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC3B,CAAC;IACD,gCAAgC;IACzB,cAAc;QACnB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;IACjC,CAAC;IACD,6BAA6B;IACtB,MAAM,CAAC,MAAM;QAClB,MAAM,MAAM,GAAG,IAAI,sBAAsB,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACM,OAAO,CAAC,KAAa;QAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IACM,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACM,OAAO,CAAC,KAAa;QAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IACM,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD,mHAAmH;IAC5G,MAAM,CAAC,oBAAoB,CAAC,IAAc,EAAE,YAAoB;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC;QACjC,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,OAAO,IAAI,sBAAsB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IACpF,CAAC;IACD;;;;OAIG;IACI,WAAW,CAAC,IAAe,EAAE,GAAY;QAC9C,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,IAAI;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+EAA+E;IACxE,uBAAuB,CAAC,IAAY;QACzC,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,sBAAsB,CAAC,IAAc,EAAE,YAAoB;QAChE,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC;QACjC,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,YAAY,CAAC,IAAc;QACvC,OAAO,IAAI,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IACvF,CAAC;IACD,qCAAqC;IAC9B,aAAa,CAAC,IAAc;QACjC,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;QACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2DAA2D;IACpD,mBAAmB,CAAC,UAA+B;QACxD,IAAI,CAAC,iBAAiB,GAAG,UAAU,CAAC;IACtC,CAAC;IACD,8DAA8D;IACvD,cAAc,CAAC,IAAc;QAClC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,qDAAqD;IACrD,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACH,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,KAAK,CAAC;IAC/E,CAAC;IACD,mEAAmE;IACnE,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;IAC1C,CAAC;IACD,oEAAoE;IACpE,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;IAC1C,CAAC;IACD,iEAAiE;IACjE,IAAW,QAAQ;QACjB,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,MAAM,CAAC;IAC5C,CAAC;IACD,yEAAyE;IACzE,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;IAC1C,CAAC;IACD,iDAAiD;IACjD,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD,wFAAwF;IACjF,UAAU,CAAC,MAAgB;QAChC,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;;;;;MAcE;IACK,MAAM,CAAC,CAAS,EAAE,CAAS;QAChC,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1H,CAAC;CACF;AA5MD,wDA4MC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { XYAndZ } from \"../geometry3d/XYZProps\";\r\nimport { HalfEdge } from \"./Graph\";\r\n\r\n/** Enumeration of categorization of \"where\" a HalfEdgePositionDetail is sitting in the graph. */\r\nexport enum HalfEdgeTopo {\r\n  /** No known position. */\r\n  None = 0,\r\n  /** Sitting at a vertex, reached by a ray in this sector. */\r\n  Vertex = 1,\r\n  /** Sitting on an edge. */\r\n  Edge = 2,\r\n  /** Face point (before hitting barrier edge). */\r\n  Face = 3,\r\n  /**\r\n   * Exterior point (after hitting barrier edge at fraction).\r\n   * Fraction is 0 if exterior point \"in sweep around exterior corner\".\r\n  */\r\n  ExteriorFace = 4\r\n}\r\n/**\r\n * Description of a generalized position within a graph, categorized as:\r\n * * \"at a certain node around a vertex\"\r\n * * \"at a fractional position along an edge\"\r\n * * \"within a face\"\r\n */\r\nexport class HalfEdgePositionDetail {\r\n  /** The relevant node. */\r\n  private _node?: HalfEdge;\r\n  /** The current coordinates. */\r\n  public x: number;\r\n  public y: number;\r\n  public z: number;\r\n  /** Fractional position along edge. Only defined if the topo tag is `HalfEdgeTopo.Edge`. */\r\n  private _edgeFraction?: number;\r\n  /** Enumeration of status vertex, edge, or face status. */\r\n  private _topo: HalfEdgeTopo;\r\n  /** First data tag. */\r\n  private _iTag?: number;\r\n  /** Second data tag. */\r\n  private _dTag?: number;\r\n  /** Special case for point on edge or vertex but target beyond and exterior. */\r\n  private _isExteriorTarget?: boolean;\r\n  /**\r\n   * Constructor.\r\n   * * The point is CAPTURED (static `create` methods normally clone their inputs).\r\n   */\r\n  private constructor(\r\n    node: HalfEdge | undefined,\r\n    x: number, y: number, z: number,\r\n    topo: HalfEdgeTopo,\r\n    edgeFraction?: number,\r\n    iTag?: number,\r\n    dTag?: number,\r\n    isExteriorTarget?: boolean,\r\n  ) {\r\n    this._node = node;\r\n    this.x = x; this.y = y; this.z = z;\r\n    this._topo = topo;\r\n    this._edgeFraction = edgeFraction;\r\n    this._iTag = iTag;\r\n    this._dTag = dTag;\r\n    this._isExteriorTarget = isExteriorTarget;\r\n  }\r\n  /** Copy (clones of) all data from other. */\r\n  public setFrom(other: HalfEdgePositionDetail) {\r\n    this._node = other._node;\r\n    this.x = other.x;\r\n    this.y = other.y;\r\n    this.z = other.z;\r\n    this._topo = other._topo;\r\n    this._edgeFraction = other._edgeFraction;\r\n    this._iTag = other._iTag;\r\n    this._dTag = other._dTag;\r\n  }\r\n  /** Reset to null topo state. */\r\n  public resetAsUnknown() {\r\n    this._node = undefined;\r\n    this._topo = HalfEdgeTopo.None;\r\n  }\r\n  /** Create with null data. */\r\n  public static create(): HalfEdgePositionDetail {\r\n    const detail = new HalfEdgePositionDetail(undefined, 0, 0, 0, HalfEdgeTopo.None);\r\n    return detail;\r\n  }\r\n  public getITag(): number | undefined {\r\n    return this._iTag;\r\n  }\r\n  public setITag(value: number): void {\r\n    this._iTag = value;\r\n  }\r\n  public getDTag(): number | undefined {\r\n    return this._dTag;\r\n  }\r\n  public setDTag(value: number): void {\r\n    this._dTag = value;\r\n  }\r\n  public getTopo(): HalfEdgeTopo {\r\n    return this._topo;\r\n  }\r\n  /** Create with node, fraction along edge, marked as \"HalfEdgeTopo.Edge\".  Compute interpolated xyz on the edge. */\r\n  public static createEdgeAtFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail {\r\n    const node1 = node.faceSuccessor;\r\n    const x = Geometry.interpolate(node.x, edgeFraction, node1.x);\r\n    const y = Geometry.interpolate(node.y, edgeFraction, node1.y);\r\n    const z = Geometry.interpolate(node.z, edgeFraction, node1.z);\r\n    return new HalfEdgePositionDetail(node, x, y, z, HalfEdgeTopo.Edge, edgeFraction);\r\n  }\r\n  /**\r\n   * Reassign contents so this instance becomes a face hit.\r\n   * @param node new node value. If missing, current node is left unchanged.\r\n   * @param xyz new coordinates. if missing, current coordinates are left unchanged.\r\n   */\r\n  public resetAsFace(node?: HalfEdge, xyz?: XYAndZ): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Face;\r\n    if (node)\r\n      this._node = node;\r\n    if (xyz) {\r\n      this.x = xyz.x;\r\n      this.y = xyz.y;\r\n      this.z = xyz.z;\r\n    }\r\n    this._isExteriorTarget = undefined;\r\n    return this;\r\n  }\r\n  /** Reassign contents so this instance has dTag but no node or HalfEdgeTopo. */\r\n  public resetAsUndefinedWithTag(dTag: number): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.None;\r\n    this._dTag = 0;\r\n    this._iTag = 0;\r\n    this._dTag = dTag;\r\n    this._node = undefined;\r\n    this._isExteriorTarget = undefined;\r\n    return this;\r\n  }\r\n  /**\r\n   * Reassign contents so this instance becomes an edge hit.\r\n   * @param node new node value.\r\n   * @param edgeFraction new edge fraction. xyz is recomputed from this edge and its face successor.\r\n   */\r\n  public resetAtEdgeAndFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Edge;\r\n    this._node = node;\r\n    const nodeB = node.faceSuccessor;\r\n    this._edgeFraction = edgeFraction;\r\n    this.x = Geometry.interpolate(node.x, edgeFraction, nodeB.x);\r\n    this.y = Geometry.interpolate(node.y, edgeFraction, nodeB.y);\r\n    this.z = Geometry.interpolate(node.z, edgeFraction, nodeB.z);\r\n    this._isExteriorTarget = undefined;\r\n    return this;\r\n  }\r\n  /**\r\n   * Create at a node.\r\n   * * Take xyz from the node.\r\n   */\r\n  public static createVertex(node: HalfEdge): HalfEdgePositionDetail {\r\n    return new HalfEdgePositionDetail(node, node.x, node.y, node.z, HalfEdgeTopo.Vertex);\r\n  }\r\n  /** Mark as \"HalfEdgeTopo.Vertex\". */\r\n  public resetAsVertex(node: HalfEdge): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Vertex;\r\n    this._node = node;\r\n    this._edgeFraction = 0.0;\r\n    this.setXYZFromNode(node);\r\n    this._isExteriorTarget = undefined;\r\n    return this;\r\n  }\r\n  /** Set the flag for an exterior relationship to target. */\r\n  public setIsExteriorTarget(isExterior: boolean | undefined) {\r\n    this._isExteriorTarget = isExterior;\r\n  }\r\n  /** Copy x,y,z from the node to this instance local values. */\r\n  public setXYZFromNode(node: HalfEdge) {\r\n    this.x = node.x;\r\n    this.y = node.y;\r\n    this.z = node.z;\r\n  }\r\n  /** Return the (possibly undefined) edge fraction. */\r\n  public get edgeFraction(): number | undefined {\r\n    return this._edgeFraction;\r\n  }\r\n  /**\r\n   * Property access for the flag for an exterior relationship to target.\r\n   * * undefined flag is returned as false.\r\n   */\r\n  public get isExteriorTarget(): boolean {\r\n    return this._isExteriorTarget !== undefined ? this._isExteriorTarget : false;\r\n  }\r\n  /** Return true if this detail is marked as being within a face. */\r\n  public get isFace(): boolean {\r\n    return this._topo === HalfEdgeTopo.Face;\r\n  }\r\n  /** Return true if this detail is marked as being within an edge. */\r\n  public get isEdge(): boolean {\r\n    return this._topo === HalfEdgeTopo.Edge;\r\n  }\r\n  /** Return true if this detail is marked as being at a vertex. */\r\n  public get isVertex(): boolean {\r\n    return this._topo === HalfEdgeTopo.Vertex;\r\n  }\r\n  /** Return true if this detail has no vertex, edge, or face qualifier. */\r\n  public get isUnclassified(): boolean {\r\n    return this._topo === HalfEdgeTopo.None;\r\n  }\r\n  /** Return the node reference from this detail */\r\n  public get node(): HalfEdge | undefined {\r\n    return this._node;\r\n  }\r\n  /** Return the (clone of, or optional filled in result) coordinates from this detail. */\r\n  public clonePoint(result?: Point3d): Point3d {\r\n    return Point3d.create(this.x, this.y, this.z, result);\r\n  }\r\n  /*\r\n    // If candidateKey is less than resultKey, replace resultPos and resultKey\r\n    // by the candidate data.\r\n    public updateMinimizer(\r\n      HalfEdgePositionDetail & resultPos, number & resultKey,\r\n  : HalfEdgePositionDetail & candidatePos, candidateKey: number\r\n    ): boolean {\r\n      if (candidateKey < resultKey) {\r\n        resultKey = candidateKey;\r\n        resultPos = candidatePos;\r\n        return true;\r\n      }\r\n      return false;\r\n    }\r\n  */\r\n  public isAtXY(x: number, y: number): boolean {\r\n    return this._topo !== HalfEdgeTopo.None && Geometry.isSameCoordinate(this.x, x) && Geometry.isSameCoordinate(this.y, y);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgePositionDetail.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePositionDetail.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AACvC,mEAAwD;AAIxD,iGAAiG;AACjG,IAAY,YAcX;AAdD,WAAY,YAAY;IACtB,yBAAyB;IACzB,+CAAQ,CAAA;IACR,4DAA4D;IAC5D,mDAAU,CAAA;IACV,0BAA0B;IAC1B,+CAAQ,CAAA;IACR,gDAAgD;IAChD,+CAAQ,CAAA;IACR;;;MAGE;IACF,+DAAgB,CAAA;AAClB,CAAC,EAdW,YAAY,4BAAZ,YAAY,QAcvB;AACD;;;;;;GAMG;AACH,MAAa,sBAAsB;IACjC,yBAAyB;IACjB,KAAK,CAAY;IACzB,+BAA+B;IACxB,CAAC,CAAS;IACV,CAAC,CAAS;IACV,CAAC,CAAS;IACjB,2FAA2F;IACnF,aAAa,CAAU;IAC/B,0DAA0D;IAClD,KAAK,CAAe;IAC5B,sBAAsB;IACd,KAAK,CAAU;IACvB,uBAAuB;IACf,KAAK,CAAU;IACvB,+EAA+E;IACvE,iBAAiB,CAAW;IACpC;;;OAGG;IACH,YACE,IAA0B,EAC1B,CAAS,EAAE,CAAS,EAAE,CAAS,EAC/B,IAAkB,EAClB,YAAqB,EACrB,IAAa,EACb,IAAa,EACb,gBAA0B;QAE1B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,iBAAiB,GAAG,gBAAgB,CAAC;IAC5C,CAAC;IACD,4CAA4C;IACrC,OAAO,CAAC,KAA6B;QAC1C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC3B,CAAC;IACD,gCAAgC;IACzB,cAAc;QACnB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;IACjC,CAAC;IACD,6BAA6B;IACtB,MAAM,CAAC,MAAM;QAClB,MAAM,MAAM,GAAG,IAAI,sBAAsB,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD,IAAW,IAAI,CAAC,KAAa;QAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IACD,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD,IAAW,IAAI,CAAC,KAAa;QAC3B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IACM,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;IAClC,CAAC;IACD,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD,mHAAmH;IAC5G,MAAM,CAAC,oBAAoB,CAAC,IAAc,EAAE,YAAoB;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC;QACjC,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,OAAO,IAAI,sBAAsB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IACpF,CAAC;IACD;;;;OAIG;IACI,WAAW,CAAC,IAAe,EAAE,GAAY;QAC9C,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,IAAI;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,IAAI,GAAG,EAAE,CAAC;YACR,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,+EAA+E;IACxE,uBAAuB,CAAC,IAAY;QACzC,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;OAIG;IACI,sBAAsB,CAAC,IAAc,EAAE,YAAoB;QAChE,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC;QACjC,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,YAAY,CAAC,IAAc;QACvC,OAAO,IAAI,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IACvF,CAAC;IACD,qCAAqC;IAC9B,aAAa,CAAC,IAAc;QACjC,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;QACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2DAA2D;IACpD,mBAAmB,CAAC,UAA+B;QACxD,IAAI,CAAC,iBAAiB,GAAG,UAAU,CAAC;IACtC,CAAC;IACD,8DAA8D;IACvD,cAAc,CAAC,IAAc;QAClC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,qDAAqD;IACrD,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACH,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,iBAAiB,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,KAAK,CAAC;IAC/E,CAAC;IACD,mEAAmE;IAC5D,MAAM;QACX,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;IACtE,CAAC;IACD,oEAAoE;IAC7D,MAAM;QACX,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC;IAC1G,CAAC;IACD,iEAAiE;IAC1D,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,CAAC;IACxE,CAAC;IACD,yEAAyE;IACzE,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC;IAC1C,CAAC;IACD,iDAAiD;IACjD,IAAW,IAAI;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IACD,wFAAwF;IACjF,UAAU,CAAC,MAAgB;QAChC,OAAO,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACxD,CAAC;IACD;;;;;;;;;;;;;;MAcE;IACK,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAClF,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IAC1G,CAAC;CACF;AA/MD,wDA+MC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { XYAndZ } from \"../geometry3d/XYZProps\";\r\nimport { HalfEdge } from \"./Graph\";\r\n\r\n/** Enumeration of categorization of \"where\" a HalfEdgePositionDetail is sitting in the graph. */\r\nexport enum HalfEdgeTopo {\r\n  /** No known position. */\r\n  None = 0,\r\n  /** Sitting at a vertex, reached by a ray in this sector. */\r\n  Vertex = 1,\r\n  /** Sitting on an edge. */\r\n  Edge = 2,\r\n  /** Face point (before hitting barrier edge). */\r\n  Face = 3,\r\n  /**\r\n   * Exterior point (after hitting barrier edge at fraction).\r\n   * Fraction is 0 if exterior point \"in sweep around exterior corner\".\r\n  */\r\n  ExteriorFace = 4\r\n}\r\n/**\r\n * Description of a generalized position within a graph, categorized as:\r\n * * \"at a certain node around a vertex\"\r\n * * \"at a fractional position along an edge\"\r\n * * \"within a face\"\r\n * @internal\r\n */\r\nexport class HalfEdgePositionDetail {\r\n  /** The relevant node. */\r\n  private _node?: HalfEdge;\r\n  /** The current coordinates. */\r\n  public x: number;\r\n  public y: number;\r\n  public z: number;\r\n  /** Fractional position along edge. Only defined if the topo tag is `HalfEdgeTopo.Edge`. */\r\n  private _edgeFraction?: number;\r\n  /** Enumeration of status vertex, edge, or face status. */\r\n  private _topo: HalfEdgeTopo;\r\n  /** First data tag. */\r\n  private _iTag?: number;\r\n  /** Second data tag. */\r\n  private _dTag?: number;\r\n  /** Special case for point on edge or vertex but target beyond and exterior. */\r\n  private _isExteriorTarget?: boolean;\r\n  /**\r\n   * Constructor.\r\n   * * The point is CAPTURED (static `create` methods normally clone their inputs).\r\n   */\r\n  private constructor(\r\n    node: HalfEdge | undefined,\r\n    x: number, y: number, z: number,\r\n    topo: HalfEdgeTopo,\r\n    edgeFraction?: number,\r\n    iTag?: number,\r\n    dTag?: number,\r\n    isExteriorTarget?: boolean,\r\n  ) {\r\n    this._node = node;\r\n    this.x = x; this.y = y; this.z = z;\r\n    this._topo = topo;\r\n    this._edgeFraction = edgeFraction;\r\n    this._iTag = iTag;\r\n    this._dTag = dTag;\r\n    this._isExteriorTarget = isExteriorTarget;\r\n  }\r\n  /** Copy (clones of) all data from other. */\r\n  public setFrom(other: HalfEdgePositionDetail) {\r\n    this._node = other._node;\r\n    this.x = other.x;\r\n    this.y = other.y;\r\n    this.z = other.z;\r\n    this._topo = other._topo;\r\n    this._edgeFraction = other._edgeFraction;\r\n    this._iTag = other._iTag;\r\n    this._dTag = other._dTag;\r\n  }\r\n  /** Reset to null topo state. */\r\n  public resetAsUnknown() {\r\n    this._node = undefined;\r\n    this._topo = HalfEdgeTopo.None;\r\n  }\r\n  /** Create with null data. */\r\n  public static create(): HalfEdgePositionDetail {\r\n    const detail = new HalfEdgePositionDetail(undefined, 0, 0, 0, HalfEdgeTopo.None);\r\n    return detail;\r\n  }\r\n  public get iTag(): number | undefined {\r\n    return this._iTag;\r\n  }\r\n  public set iTag(value: number) {\r\n    this._iTag = value;\r\n  }\r\n  public get dTag(): number | undefined {\r\n    return this._dTag;\r\n  }\r\n  public set dTag(value: number) {\r\n    this._dTag = value;\r\n  }\r\n  public hasDTag(): this is { get dTag(): number } {\r\n    return this._dTag !== undefined;\r\n  }\r\n  public get topo(): HalfEdgeTopo {\r\n    return this._topo;\r\n  }\r\n  /** Create with node, fraction along edge, marked as \"HalfEdgeTopo.Edge\".  Compute interpolated xyz on the edge. */\r\n  public static createEdgeAtFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail {\r\n    const node1 = node.faceSuccessor;\r\n    const x = Geometry.interpolate(node.x, edgeFraction, node1.x);\r\n    const y = Geometry.interpolate(node.y, edgeFraction, node1.y);\r\n    const z = Geometry.interpolate(node.z, edgeFraction, node1.z);\r\n    return new HalfEdgePositionDetail(node, x, y, z, HalfEdgeTopo.Edge, edgeFraction);\r\n  }\r\n  /**\r\n   * Reassign contents so this instance becomes a face hit.\r\n   * @param node new node value. If missing, current node is left unchanged.\r\n   * @param xyz new coordinates. if missing, current coordinates are left unchanged.\r\n   */\r\n  public resetAsFace(node?: HalfEdge, xyz?: XYAndZ): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Face;\r\n    if (node)\r\n      this._node = node;\r\n    if (xyz) {\r\n      this.x = xyz.x;\r\n      this.y = xyz.y;\r\n      this.z = xyz.z;\r\n    }\r\n    this._isExteriorTarget = undefined;\r\n    return this;\r\n  }\r\n  /** Reassign contents so this instance has dTag but no node or HalfEdgeTopo. */\r\n  public resetAsUndefinedWithTag(dTag: number): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.None;\r\n    this._dTag = 0;\r\n    this._iTag = 0;\r\n    this._dTag = dTag;\r\n    this._node = undefined;\r\n    this._isExteriorTarget = undefined;\r\n    return this;\r\n  }\r\n  /**\r\n   * Reassign contents so this instance becomes an edge hit.\r\n   * @param node new node value.\r\n   * @param edgeFraction new edge fraction. xyz is recomputed from this edge and its face successor.\r\n   */\r\n  public resetAtEdgeAndFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Edge;\r\n    this._node = node;\r\n    const nodeB = node.faceSuccessor;\r\n    this._edgeFraction = edgeFraction;\r\n    this.x = Geometry.interpolate(node.x, edgeFraction, nodeB.x);\r\n    this.y = Geometry.interpolate(node.y, edgeFraction, nodeB.y);\r\n    this.z = Geometry.interpolate(node.z, edgeFraction, nodeB.z);\r\n    this._isExteriorTarget = undefined;\r\n    return this;\r\n  }\r\n  /**\r\n   * Create at a node.\r\n   * * Take xyz from the node.\r\n   */\r\n  public static createVertex(node: HalfEdge): HalfEdgePositionDetail {\r\n    return new HalfEdgePositionDetail(node, node.x, node.y, node.z, HalfEdgeTopo.Vertex);\r\n  }\r\n  /** Mark as \"HalfEdgeTopo.Vertex\". */\r\n  public resetAsVertex(node: HalfEdge): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Vertex;\r\n    this._node = node;\r\n    this._edgeFraction = 0.0;\r\n    this.setXYZFromNode(node);\r\n    this._isExteriorTarget = undefined;\r\n    return this;\r\n  }\r\n  /** Set the flag for an exterior relationship to target. */\r\n  public setIsExteriorTarget(isExterior: boolean | undefined) {\r\n    this._isExteriorTarget = isExterior;\r\n  }\r\n  /** Copy x,y,z from the node to this instance local values. */\r\n  public setXYZFromNode(node: HalfEdge) {\r\n    this.x = node.x;\r\n    this.y = node.y;\r\n    this.z = node.z;\r\n  }\r\n  /** Return the (possibly undefined) edge fraction. */\r\n  public get edgeFraction(): number | undefined {\r\n    return this._edgeFraction;\r\n  }\r\n  /**\r\n   * Property access for the flag for an exterior relationship to target.\r\n   * * undefined flag is returned as false.\r\n   */\r\n  public get isExteriorTarget(): boolean {\r\n    return this._isExteriorTarget !== undefined ? this._isExteriorTarget : false;\r\n  }\r\n  /** Return true if this detail is marked as being within a face. */\r\n  public isFace(): this is { get node() : HalfEdge } {\r\n    return this._topo === HalfEdgeTopo.Face && this._node !== undefined;\r\n  }\r\n  /** Return true if this detail is marked as being within an edge. */\r\n  public isEdge(): this is { get node() : HalfEdge, get edgeFraction() : number } {\r\n    return this._topo === HalfEdgeTopo.Edge && this._node !== undefined && this._edgeFraction !== undefined;\r\n  }\r\n  /** Return true if this detail is marked as being at a vertex. */\r\n  public isVertex(): this is { get node() : HalfEdge } {\r\n    return this._topo === HalfEdgeTopo.Vertex && this._node !== undefined;\r\n  }\r\n  /** Return true if this detail has no vertex, edge, or face qualifier. */\r\n  public get isUnclassified(): boolean {\r\n    return this._topo === HalfEdgeTopo.None;\r\n  }\r\n  /** Return the node reference from this detail */\r\n  public get node(): HalfEdge | undefined {\r\n    return this._node;\r\n  }\r\n  /** Return the (clone of, or optional filled in result) coordinates from this detail. */\r\n  public clonePoint(result?: Point3d): Point3d {\r\n    return Point3d.create(this.x, this.y, this.z, result);\r\n  }\r\n  /*\r\n    // If candidateKey is less than resultKey, replace resultPos and resultKey\r\n    // by the candidate data.\r\n    public updateMinimizer(\r\n      HalfEdgePositionDetail & resultPos, number & resultKey,\r\n  : HalfEdgePositionDetail & candidatePos, candidateKey: number\r\n    ): boolean {\r\n      if (candidateKey < resultKey) {\r\n        resultKey = candidateKey;\r\n        resultPos = candidatePos;\r\n        return true;\r\n      }\r\n      return false;\r\n    }\r\n  */\r\n  public isAtXY(x: number, y: number, tolerance: number = Geometry.smallMetricDistance): boolean {\r\n    return this._topo !== HalfEdgeTopo.None && Geometry.isSameCoordinateXY(this.x, this.y, x, y, tolerance);\r\n  }\r\n}\r\n"]}

package/lib/cjs/topology/HalfEdgePriorityQueue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgePriorityQueue.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGnC;;;;;;;;GAQG;AACH,qBAAa,qCAAqC;IACzC,aAAa,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IACvC,WAAW,EAAE,QAAQ,EAAE,CAAC;gBAE7B,OAAO,GAAE,iBAAiB,CAAC,QAAQ,CAAqD;IAI1F,qEAAqE;IAC9D,eAAe,IAAI,QAAQ,GAAG,SAAS;IAO9C;;;;OAIG;IACI,oBAAoB,CAAC,CAAC,EAAE,MAAM;IAOrC;;;;OAIG;IACI,6BAA6B,CAAC,CAAC,EAAE,MAAM;CAiB/C"}
+{"version":3,"file":"HalfEdgePriorityQueue.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAU,iBAAiB,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAC/E,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGnC;;;;;;;;GAQG;AACH,qBAAa,qCAAqC;IACzC,aAAa,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IACvC,WAAW,EAAE,QAAQ,EAAE,CAAC;gBAE7B,OAAO,GAAE,iBAAiB,CAAC,QAAQ,CAAqD;IAI1F,qEAAqE;IAC9D,eAAe,IAAI,QAAQ,GAAG,SAAS;IAQ9C;;;;OAIG;IACI,oBAAoB,CAAC,CAAC,EAAE,MAAM;IAQrC;;;;OAIG;IACI,6BAA6B,CAAC,CAAC,EAAE,MAAM;CAiB/C"}

package/lib/cjs/topology/HalfEdgePriorityQueue.js

@@ -31,6 +31,7 @@ class HalfEdgePriorityQueueWithPartnerArray {
         if (this.priorityQueue.isEmpty)
             return undefined;
         const x = this.priorityQueue.pop();
+        (0, core_bentley_1.assert)(x !== undefined, "expect defined because we just checked queue length");
         this.activeEdges.push(x);
         return x;
     }
@@ -41,8 +42,9 @@ class HalfEdgePriorityQueueWithPartnerArray {
      */
     popArrayToArrayIndex(i) {
         const n = this.activeEdges.length;
-        if (i < n) {
+        if (0 <= i && i < n - 1 && n > 0) { // index must not point to last entry, which is about to disappear
             const x = this.activeEdges.pop();
+            (0, core_bentley_1.assert)(x !== undefined, "expect defined because we just checked array length");
             this.activeEdges[i] = x;
         }
     }

package/lib/cjs/topology/HalfEdgePriorityQueue.js.map

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgePriorityQueue.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,sDAAuE;AAEvE,uCAA6C;AAE7C;;;;;;;;GAQG;AACH,MAAa,qCAAqC;IACzC,aAAa,CAA0B;IACvC,WAAW,CAAa;IAC/B,YACE,UAAuC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;QACxF,IAAI,CAAC,aAAa,GAAG,IAAI,4BAAa,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IACD,qEAAqE;IAC9D,eAAe;QACpB,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO;YAC5B,OAAO,SAAS,CAAC;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAG,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;OAIG;IACI,oBAAoB,CAAC,CAAS;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAG,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,CAAS;QAC5C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YAC7B,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACZ,+BAA+B;gBAC/B,IAAI,OAAO,GAAG,CAAC;oBACb,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAChC,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,CAAC;gBACN,mBAAmB;YACrB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,OAAO,CAAC;IACpC,CAAC;CACF;AAlDD,sFAkDC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\nimport { OrderedComparator, PriorityQueue } from \"@itwin/core-bentley\";\r\nimport { HalfEdge } from \"./Graph\";\r\nimport { HalfEdgeGraphOps } from \"./Merging\";\r\n\r\n/**\r\n * * Combination of a priority queue of HalfEdges with\r\n * * Additional \"active\" array to carry edges that have been removed from the queue but are still to be\r\n *    inspected (possibly many times)\r\n * * The priority queue default sort is Y-then-X lexical sort.\r\n * * Caller has direct access to the queue and array.\r\n * * Methods are added here only to do things that involve both the queue and the array.\r\n * @internal\r\n */\r\nexport class HalfEdgePriorityQueueWithPartnerArray {\r\n  public priorityQueue: PriorityQueue<HalfEdge>;\r\n  public activeEdges: HalfEdge[];\r\n  public constructor(\r\n    compare: OrderedComparator<HalfEdge> = (a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b)) {\r\n    this.priorityQueue = new PriorityQueue(compare);\r\n    this.activeEdges = [];\r\n  }\r\n  /** Read a member from the queue and transfer to the active array. */\r\n  public popQueueToArray(): HalfEdge | undefined {\r\n    if (this.priorityQueue.isEmpty)\r\n      return undefined;\r\n    const x = this.priorityQueue.pop()!;\r\n    this.activeEdges.push(x);\r\n    return x;\r\n  }\r\n  /** Pop the last entry and put it back as replacement for current entry at index i.\r\n   * * Effectively remove active member at index i\r\n   * * The array order is changed.\r\n   * * constant time.\r\n   */\r\n  public popArrayToArrayIndex(i: number) {\r\n    const n = this.activeEdges.length;\r\n    if (i < n) {\r\n      const x = this.activeEdges.pop()!;\r\n      this.activeEdges[i] = x;\r\n    }\r\n  }\r\n  /**\r\n   * * Scan the active array.\r\n   * * remove edges whose top y is below y\r\n   * * (pack all remaining ones back towards the beginning)\r\n   */\r\n  public removeArrayMembersWithY1Below(y: number) {\r\n    let numKeep = 0;\r\n    const n = this.activeEdges.length;\r\n    for (let i = 0; i < n; i++) {\r\n      const q = this.activeEdges[i];\r\n      const yB = q.faceSuccessor.y;\r\n      if (yB >= y) {\r\n        // copy [i] forward to [target]\r\n        if (numKeep < i)\r\n          this.activeEdges[numKeep] = q;\r\n        numKeep++;\r\n      } else {\r\n        // let it go by !!!\r\n      }\r\n    }\r\n    this.activeEdges.length = numKeep;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgePriorityQueue.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,sDAA+E;AAE/E,uCAA6C;AAE7C;;;;;;;;GAQG;AACH,MAAa,qCAAqC;IACzC,aAAa,CAA0B;IACvC,WAAW,CAAa;IAC/B,YACE,UAAuC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;QACxF,IAAI,CAAC,aAAa,GAAG,IAAI,4BAAa,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IACD,qEAAqE;IAC9D,eAAe;QACpB,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO;YAC5B,OAAO,SAAS,CAAC;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC;QACnC,IAAA,qBAAM,EAAC,CAAC,KAAK,SAAS,EAAE,qDAAqD,CAAC,CAAC;QAC/E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;OAIG;IACI,oBAAoB,CAAC,CAAS;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,kEAAkE;YACpG,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,CAAC;YACjC,IAAA,qBAAM,EAAC,CAAC,KAAK,SAAS,EAAE,qDAAqD,CAAC,CAAC;YAC/E,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,CAAS;QAC5C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YAC7B,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACZ,+BAA+B;gBAC/B,IAAI,OAAO,GAAG,CAAC;oBACb,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAChC,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,CAAC;gBACN,mBAAmB;YACrB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,OAAO,CAAC;IACpC,CAAC;CACF;AApDD,sFAoDC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\nimport { assert, OrderedComparator, PriorityQueue } from \"@itwin/core-bentley\";\r\nimport { HalfEdge } from \"./Graph\";\r\nimport { HalfEdgeGraphOps } from \"./Merging\";\r\n\r\n/**\r\n * * Combination of a priority queue of HalfEdges with\r\n * * Additional \"active\" array to carry edges that have been removed from the queue but are still to be\r\n *    inspected (possibly many times)\r\n * * The priority queue default sort is Y-then-X lexical sort.\r\n * * Caller has direct access to the queue and array.\r\n * * Methods are added here only to do things that involve both the queue and the array.\r\n * @internal\r\n */\r\nexport class HalfEdgePriorityQueueWithPartnerArray {\r\n  public priorityQueue: PriorityQueue<HalfEdge>;\r\n  public activeEdges: HalfEdge[];\r\n  public constructor(\r\n    compare: OrderedComparator<HalfEdge> = (a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b)) {\r\n    this.priorityQueue = new PriorityQueue(compare);\r\n    this.activeEdges = [];\r\n  }\r\n  /** Read a member from the queue and transfer to the active array. */\r\n  public popQueueToArray(): HalfEdge | undefined {\r\n    if (this.priorityQueue.isEmpty)\r\n      return undefined;\r\n    const x = this.priorityQueue.pop();\r\n    assert(x !== undefined, \"expect defined because we just checked queue length\");\r\n    this.activeEdges.push(x);\r\n    return x;\r\n  }\r\n  /** Pop the last entry and put it back as replacement for current entry at index i.\r\n   * * Effectively remove active member at index i\r\n   * * The array order is changed.\r\n   * * constant time.\r\n   */\r\n  public popArrayToArrayIndex(i: number) {\r\n    const n = this.activeEdges.length;\r\n    if (0 <= i && i < n - 1 && n > 0) { // index must not point to last entry, which is about to disappear\r\n      const x = this.activeEdges.pop();\r\n      assert(x !== undefined, \"expect defined because we just checked array length\");\r\n      this.activeEdges[i] = x;\r\n    }\r\n  }\r\n  /**\r\n   * * Scan the active array.\r\n   * * remove edges whose top y is below y\r\n   * * (pack all remaining ones back towards the beginning)\r\n   */\r\n  public removeArrayMembersWithY1Below(y: number) {\r\n    let numKeep = 0;\r\n    const n = this.activeEdges.length;\r\n    for (let i = 0; i < n; i++) {\r\n      const q = this.activeEdges[i];\r\n      const yB = q.faceSuccessor.y;\r\n      if (yB >= y) {\r\n        // copy [i] forward to [target]\r\n        if (numKeep < i)\r\n          this.activeEdges[numKeep] = q;\r\n        numKeep++;\r\n      } else {\r\n        // let it go by !!!\r\n      }\r\n    }\r\n    this.activeEdges.length = numKeep;\r\n  }\r\n}\r\n"]}

package/lib/cjs/topology/InsertAndRetriangulateContext.d.ts

@@ -37,9 +37,13 @@ export declare class InsertAndRetriangulateContext {
     private _edgeSet;
     private _searcher;
     private _tolerance;
+    /** Constructor. NOTE: graph is assumed to have a free mask available. */
     private constructor();
-    /** Create a new context referencing the graph. */
-    static create(graph: HalfEdgeGraph, tolerance?: number): InsertAndRetriangulateContext;
+    /**
+     * Create a new context referencing the graph.
+     * @return `undefined` if graph has no free mask available
+    */
+    static create(graph: HalfEdgeGraph, tolerance?: number): InsertAndRetriangulateContext | undefined;
     /** Query the (pointer to) the graph in the context. */
     get graph(): HalfEdgeGraph;
     /**

package/lib/cjs/topology/InsertAndRetriangulateContext.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"InsertAndRetriangulateContext.d.ts","sourceRoot":"","sources":["../../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAIxD,OAAO,EAAY,aAAa,EAAgB,MAAM,SAAS,CAAC;AAGhE,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAGlE;;;GAGG;AACH,oBAAY,sBAAsB;IAChC,gGAAgG;IAChG,MAAM,IAAA;IACN,4EAA4E;IAC5E,OAAO,IAAA;IACP;;;OAGG;IACH,eAAe,IAAA;IACf;;;OAGG;IACH,gBAAgB,IAAA;CACjB;AAED;;;;;;;GAOG;AACH,qBAAa,6BAA6B;IACxC,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,QAAQ,CAAgB;IAChC,OAAO,CAAC,SAAS,CAAyB;IAC1C,OAAO,CAAC,UAAU,CAAS;IAE3B,OAAO;IAMP,kDAAkD;WACpC,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,SAAS,GAAE,MAAqC;IAG3F,uDAAuD;IACvD,IAAW,KAAK,IAAI,aAAa,CAEhC;IACD;;;OAGG;IACH,OAAO,CAAC,2BAA2B;IAenC,qDAAqD;IAC9C,KAAK;IAGZ,kEAAkE;IAClE,IAAW,eAAe,2BAEzB;IACD,0DAA0D;IACnD,4BAA4B,CAAC,GAAG,EAAE,OAAO,GAAG,sBAAsB;IAkCzE,kDAAkD;IAC3C,sBAAsB,CAAC,GAAG,EAAE,OAAO,GAAG,sBAAsB;IAanE;;;;MAIE;IACK,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,GAAG,IAAI;IAM/D,0FAA0F;IAC1F,OAAO,CAAC,iBAAiB;IAqBzB,sGAAsG;IACtG,OAAO,CAAC,iBAAiB;IA4BzB;;;OAGG;IACH,OAAO,CAAC,mBAAmB;IAU3B;;;;;;OAMG;IACI,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,sBAAsB,GAAG,OAAO;IAgCxF;;;;;;OAMG;IACI,WAAW,CAChB,cAAc,EAAE,sBAAsB,EACtC,MAAM,EAAE,OAAO,EACf,SAAS,CAAC,EAAE,CAAC,QAAQ,EAAE,sBAAsB,KAAK,OAAO,GACxD,OAAO;CAqFX"}
+{"version":3,"file":"InsertAndRetriangulateContext.d.ts","sourceRoot":"","sources":["../../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAIxD,OAAO,EAAY,aAAa,EAAgB,MAAM,SAAS,CAAC;AAGhE,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAGlE;;;GAGG;AACH,oBAAY,sBAAsB;IAChC,gGAAgG;IAChG,MAAM,IAAA;IACN,4EAA4E;IAC5E,OAAO,IAAA;IACP;;;OAGG;IACH,eAAe,IAAA;IACf;;;OAGG;IACH,gBAAgB,IAAA;CACjB;AAED;;;;;;;GAOG;AACH,qBAAa,6BAA6B;IACxC,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,QAAQ,CAAgB;IAChC,OAAO,CAAC,SAAS,CAAyB;IAC1C,OAAO,CAAC,UAAU,CAAS;IAE3B,yEAAyE;IACzE,OAAO;IAQP;;;MAGE;WACY,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,SAAS,GAAE,MAAqC,GAAG,6BAA6B,GAAG,SAAS;IAGvI,uDAAuD;IACvD,IAAW,KAAK,IAAI,aAAa,CAEhC;IACD;;;OAGG;IACH,OAAO,CAAC,2BAA2B;IAenC,qDAAqD;IAC9C,KAAK;IAGZ,kEAAkE;IAClE,IAAW,eAAe,2BAEzB;IACD,0DAA0D;IACnD,4BAA4B,CAAC,GAAG,EAAE,OAAO,GAAG,sBAAsB;IAiCzE,kDAAkD;IAC3C,sBAAsB,CAAC,GAAG,EAAE,OAAO,GAAG,sBAAsB;IAanE;;;;MAIE;IACK,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,GAAG,IAAI;IAM/D,0FAA0F;IAC1F,OAAO,CAAC,iBAAiB;IAqBzB,sGAAsG;IACtG,OAAO,CAAC,iBAAiB;IA4BzB;;;OAGG;IACH,OAAO,CAAC,mBAAmB;IAU3B;;;;;;OAMG;IACI,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,sBAAsB,GAAG,OAAO;IAgCxF;;;;;;OAMG;IACI,WAAW,CAChB,cAAc,EAAE,sBAAsB,EACtC,MAAM,EAAE,OAAO,EACf,SAAS,CAAC,EAAE,CAAC,QAAQ,EAAE,sBAAsB,KAAK,OAAO,GACxD,OAAO;CAsFX"}

package/lib/cjs/topology/InsertAndRetriangulateContext.js

@@ -53,15 +53,21 @@ class InsertAndRetriangulateContext {
     _edgeSet;
     _searcher;
     _tolerance;
+    /** Constructor. NOTE: graph is assumed to have a free mask available. */
     constructor(graph, tolerance) {
         this._graph = graph;
-        this._edgeSet = HalfEdgeMarkSet_1.MarkedEdgeSet.create(graph);
+        const edgeSet = HalfEdgeMarkSet_1.MarkedEdgeSet.create(graph);
+        (0, core_bentley_1.assert)(edgeSet !== undefined, "expect defined; the only caller ensures graph has free mask");
+        this._edgeSet = edgeSet;
         this._searcher = HalfEdgePositionDetail_1.HalfEdgePositionDetail.create();
         this._tolerance = tolerance;
     }
-    /** Create a new context referencing the graph. */
+    /**
+     * Create a new context referencing the graph.
+     * @return `undefined` if graph has no free mask available
+    */
     static create(graph, tolerance = Geometry_1.Geometry.smallMetricDistance) {
-        return new InsertAndRetriangulateContext(graph, tolerance);
+        return graph.hasFreeMask ? new InsertAndRetriangulateContext(graph, tolerance) : undefined;
     }
     /** Query the (pointer to) the graph in the context. */
     get graph() {
@@ -97,7 +103,7 @@ class InsertAndRetriangulateContext {
     /** Linear search for the nearest graph edge or vertex. */
     searchForNearestEdgeOrVertex(xyz) {
         const position = HalfEdgePositionDetail_1.HalfEdgePositionDetail.create();
-        position.setDTag(Number.MAX_VALUE);
+        position.dTag = Number.MAX_VALUE;
         const xyzC = Point3dVector3d_1.Point3d.create();
         let fractionC;
         let distanceC;
@@ -107,22 +113,22 @@ class InsertAndRetriangulateContext {
             if (fractionC !== undefined) {
                 if (fractionC > 1.0) {
                     distanceC = xyz.distanceXY(nodeB);
-                    if (distanceC < position.getDTag()) {
+                    if (distanceC < position.dTag) {
                         position.resetAsVertex(nodeB);
-                        position.setDTag(distanceC);
+                        position.dTag = distanceC;
                     }
                 }
                 else if (fractionC < 0.0) {
                     distanceC = xyz.distanceXY(nodeA);
-                    if (distanceC < position.getDTag()) {
+                    if (distanceC < position.dTag) {
                         position.resetAsVertex(nodeA);
-                        position.setDTag(distanceC);
+                        position.dTag = distanceC;
                     }
                 }
                 else {
                     nodeA.fractionToPoint3d(fractionC, xyzC);
                     distanceC = xyz.distanceXY(xyzC);
-                    if (distanceC < position.getDTag()) {
+                    if (distanceC < position.dTag) {
                         position.resetAtEdgeAndFraction(nodeA, fractionC);
                     }
                 }
@@ -133,13 +139,13 @@ class InsertAndRetriangulateContext {
     /** Linear search for the nearest graph vertex. */
     searchForNearestVertex(xyz) {
         const position = HalfEdgePositionDetail_1.HalfEdgePositionDetail.create();
-        position.setDTag(Number.MAX_VALUE);
+        position.dTag = Number.MAX_VALUE;
         let distanceA;
         for (const nodeA of this._graph.allHalfEdges) {
             distanceA = xyz.distanceXY(nodeA);
-            if (distanceA < position.getDTag()) {
+            if (distanceA < position.dTag) {
                 position.resetAsVertex(nodeA);
-                position.setDTag(distanceA);
+                position.dTag = distanceA;
             }
         }
         return position;
@@ -157,7 +163,7 @@ class InsertAndRetriangulateContext {
     }
     /** Reclassify the current interior face hit if it is too close to an edge of the face. */
     reclassifyFaceHit(point) {
-        if (undefined === this._searcher.node || !this._searcher.isFace || this._searcher.node.isMaskSet(Graph_1.HalfEdgeMask.EXTERIOR))
+        if (undefined === this._searcher.node || !this._searcher.isFace() || this._searcher.node.isMaskSet(Graph_1.HalfEdgeMask.EXTERIOR))
             return false;
         const pointXY = Point3dVector3d_1.Point3d.create(point.x, point.y);
         const face = this._searcher.node.collectAroundFace((node) => {
@@ -179,7 +185,7 @@ class InsertAndRetriangulateContext {
     }
     /** Reclassify the current interior edge hit if it is too close to an edge of either adjacent face. */
     reclassifyEdgeHit(point) {
-        if (undefined === this._searcher.node || !this._searcher.isEdge || this._searcher.node.isMaskSet(Graph_1.HalfEdgeMask.BOUNDARY_EDGE))
+        if (undefined === this._searcher.node || !this._searcher.isEdge() || this._searcher.node.isMaskSet(Graph_1.HalfEdgeMask.BOUNDARY_EDGE))
             return false;
         const pointXY = Point3dVector3d_1.Point3d.create(point.x, point.y);
         const superFace = [];
@@ -236,7 +242,7 @@ class InsertAndRetriangulateContext {
         // adjacent to the hull.
         if (!this.reclassifyFaceHit(point))
             this.reclassifyEdgeHit(point);
-        if (this._searcher.isFace) {
+        if (this._searcher.isFace()) {
             // insert point into the graph if it lies in an interior face
             if (!this._searcher.node.isMaskSet(Graph_1.HalfEdgeMask.EXTERIOR)) {
                 const newNode = this._graph.createEdgeXYZHalfEdge(point.x, point.y, point.z, 0, this._searcher.node, 0);
@@ -245,7 +251,7 @@ class InsertAndRetriangulateContext {
                 this._searcher.resetAsVertex(newNode);
             }
         }
-        else if (this._searcher.isEdge) {
+        else if (this._searcher.isEdge()) {
             // insert point into the graph by splitting its containing edge
             const newA = this._graph.splitEdgeAtFraction(this._searcher.node, this._searcher.edgeFraction);
             const newB = newA.vertexPredecessor;
@@ -255,7 +261,7 @@ class InsertAndRetriangulateContext {
             Triangulation_1.Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);
             this._searcher.resetAsVertex(newA);
         }
-        else if (this._searcher.isVertex) {
+        else if (this._searcher.isVertex()) {
             // no need to insert point as there's already a vertex there, but maybe update its z-coord
             this.updateZAroundVertex(this._searcher.node, point, newZWins);
         }
@@ -270,7 +276,7 @@ class InsertAndRetriangulateContext {
      */
     moveToPoint(movingPosition, target, announcer) {
         const psc = HalfEdgePointInGraphSearch_1.PointSearchContext.create(this._tolerance);
-        movingPosition.setITag(0);
+        movingPosition.iTag = 0;
         if (movingPosition.isUnclassified) {
             moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, Graph_1.HalfEdgeMask.NULL_MASK);
             if (movingPosition.isUnclassified)
@@ -278,16 +284,16 @@ class InsertAndRetriangulateContext {
         }
         let trap = 0;
         const ray = Ray3d_1.Ray3d.createXAxis();
-        for (; movingPosition.getITag() === 0 && trap < 2;) {
+        for (; movingPosition.iTag === 0 && trap < 2;) {
             if (announcer !== undefined) {
                 const continueSearch = announcer(movingPosition);
                 if (!continueSearch)
                     break;
             }
-            if (!psc.setSearchRay(movingPosition, target, ray)) {
+            if (!psc.setSearchRay(movingPosition, target, ray))
                 return false;
-            }
-            else if (movingPosition.isFace) {
+            (0, core_bentley_1.assert)(ray.a !== undefined, "expect defined by successful return of setSearchRay");
+            if (movingPosition.isFace()) {
                 const lastBefore = HalfEdgePositionDetail_1.HalfEdgePositionDetail.create();
                 const firstAfter = HalfEdgePositionDetail_1.HalfEdgePositionDetail.create();
                 const rc = psc.reAimAroundFace(movingPosition.node, ray, ray.a, lastBefore, firstAfter);
@@ -299,28 +305,28 @@ class InsertAndRetriangulateContext {
                     }
                     case HalfEdgePointInGraphSearch_1.RayClassification.TargetOnVertex: {
                         movingPosition.setFrom(lastBefore);
-                        movingPosition.setITag(1);
+                        movingPosition.iTag = 1;
                         break;
                     }
                     case HalfEdgePointInGraphSearch_1.RayClassification.TargetOnEdge: {
                         movingPosition.setFrom(lastBefore);
-                        movingPosition.setITag(1);
+                        movingPosition.iTag = 1;
                         break;
                     }
                     case HalfEdgePointInGraphSearch_1.RayClassification.Bracket: {
                         movingPosition.resetAsFace(lastBefore.node, target);
-                        movingPosition.setITag(1);
+                        movingPosition.iTag = 1;
                         break;
                     }
                     case HalfEdgePointInGraphSearch_1.RayClassification.TargetBefore: { // do we ever get here?
                         movingPosition.resetAsFace(movingPosition.node, target);
-                        movingPosition.setITag(1);
+                        movingPosition.iTag = 1;
                         break;
                     }
                     case HalfEdgePointInGraphSearch_1.RayClassification.TargetAfter: {
                         if (movingPosition.node === lastBefore.node
-                            && movingPosition.isFace
-                            && (lastBefore.isEdge || lastBefore.isVertex)) {
+                            && movingPosition.isFace()
+                            && (lastBefore.isEdge() || lastBefore.isVertex())) {
                             trap++;
                         }
                         else {
@@ -331,30 +337,30 @@ class InsertAndRetriangulateContext {
                     }
                 }
             }
-            else if (movingPosition.isEdge) {
+            else if (movingPosition.isEdge()) {
                 psc.reAimFromEdge(movingPosition, ray, ray.a);
                 if (movingPosition.isUnclassified)
                     break;
             }
-            else if (movingPosition.isVertex) {
+            else if (movingPosition.isVertex()) {
                 psc.reAimFromVertex(movingPosition, ray, ray.a);
                 if (movingPosition.isUnclassified)
                     break;
             }
         }
-        if (movingPosition.isAtXY(target.x, target.y))
+        if (movingPosition.isAtXY(target.x, target.y, this._tolerance))
             return true;
         if (trap > 1) {
-            // ugh! We exited the loop by repeatedly hitting the same node with edge or vertex type in lastBefore.
+            // Ugh! We exited the loop by repeatedly hitting the same node with edge or vertex type in lastBefore.
             // This happens only when the target point is exterior (heavy triangulation use cases start with a convex
-            // hull and only do interior intersections, so case only happens in contrived unit tests so far
-            // What to mark? Leave it as is, but mark as exterior target
+            // hull and only do interior intersections, so this case only happens in contrived unit tests so far).
+            // What to mark? Leave it as is, but mark as exterior target.
             if (movingPosition.node !== undefined) {
                 movingPosition.setIsExteriorTarget(true);
             }
             return false;
         }
-        // murky here; should never be hit. Has never been hit in unit tests.
+        (0, core_bentley_1.assert)(trap > 1, "Murky. Should never get here. Has never been hit in unit tests.");
         return false;
     }
 }

package/lib/cjs/topology/InsertAndRetriangulateContext.js.map

@@ -1 +1 @@
-{"version":3,"file":"InsertAndRetriangulateContext.js","sourceRoot":"","sources":["../../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,0CAAwD;AACxD,mEAAwD;AACxD,yDAAsD;AACtD,+CAA4C;AAC5C,yDAAsD;AACtD,mCAAgE;AAChE,uDAAkD;AAClD,6EAAqF;AACrF,qEAAkE;AAClE,mDAA+C;AAE/C;;;GAGG;AACH,IAAY,sBAeX;AAfD,WAAY,sBAAsB;IAChC,gGAAgG;IAChG,uEAAM,CAAA;IACN,4EAA4E;IAC5E,yEAAO,CAAA;IACP;;;OAGG;IACH,yFAAe,CAAA;IACf;;;OAGG;IACH,2FAAgB,CAAA;AAClB,CAAC,EAfW,sBAAsB,sCAAtB,sBAAsB,QAejC;AAED;;;;;;;GAOG;AACH,MAAa,6BAA6B;IAChC,MAAM,CAAgB;IACtB,QAAQ,CAAgB;IACxB,SAAS,CAAyB;IAClC,UAAU,CAAS;IAE3B,YAAoB,KAAoB,EAAE,SAAiB;QACzD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,+BAAa,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD,kDAAkD;IAC3C,MAAM,CAAC,MAAM,CAAC,KAAoB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACzF,OAAO,IAAI,6BAA6B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC7D,CAAC;IACD,uDAAuD;IACvD,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;OAGG;IACK,2BAA2B,CAAC,WAAqB;QACvD,MAAM,OAAO,GAAG,WAAW,CAAC,oBAAoB,EAAE,CAAC;QACnD,IAAI,OAAO,GAAG,CAAC,IAAI,WAAW,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC;YAC7D,OAAO;QACT,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC;QAC5B,IAAI,OAAO,GAAG,WAAW,CAAC,aAAa,CAAC;QACxC,IAAI,QAAQ,GAAG,WAAW,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,OAAO,GAAG,OAAO,CAAC,aAAa,CAAC;YAChC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,0BAA0B,CAAC,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YAC3E,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,qDAAqD;IAC9C,KAAK;QACV,IAAI,CAAC,SAAS,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC;IACD,kEAAkE;IAClE,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,0DAA0D;IACnD,4BAA4B,CAAC,GAAY;QAC9C,MAAM,QAAQ,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,SAAS,CAAC;QACd,IAAI,SAAS,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,SAAS,GAAG,yBAAW,CAAC,oCAAoC,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBACpB,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;wBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;qBAAM,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBAC3B,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;wBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;oBAEzC,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACjC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;wBACpC,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,kDAAkD;IAC3C,sBAAsB,CAAC,GAAY;QACxC,MAAM,QAAQ,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,SAAS,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;gBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;MAIE;IACK,WAAW,CAAC,GAAY,EAAE,cAAuB;QACtD,IAAI,cAAc;YAChB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;;YAExD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IACD,0FAA0F;IAClF,iBAAiB,CAAC,KAAc;QACtC,IAAI,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC;YACrH,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,yBAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YACpE,MAAM,EAAE,GAAG,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,EAAU,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,mCAAmC;YAC5D,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,uBAAU,CAAC,sBAAsB,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACjF,IAAA,qBAAM,EAAC,MAAM,CAAC,IAAI,KAAK,0BAAe,CAAC,qBAAqB,CAAC,CAAC;QAC9D,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC;QAChD,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QAC3E,IAAI,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;YAC7E,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;;YAErC,IAAI,CAAC,SAAS,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sGAAsG;IAC9F,iBAAiB,CAAC,KAAc;QACtC,IAAI,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,aAAa,CAAC;YAC1H,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,yBAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC;YAC/F,MAAM,EAAE,GAAG,yBAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,EAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,kDAAkD;YACxE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC;YAC5G,MAAM,EAAE,GAAG,yBAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,EAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,mDAAmD;YACzE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,MAAM,GAAG,uBAAU,CAAC,sBAAsB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACtF,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,IAAI,GAAI,SAAS,CAAC,MAAM,CAAC,gBAAgB,CAAS,CAAC,IAAI,CAAC;QAC9D,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QAC3E,IAAI,MAAM,CAAC,IAAI,KAAK,0BAAe,CAAC,eAAe,EAAE,wDAAwD;YAC3G,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aAClC,IAAI,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;YAClF,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;;YAErC,IAAI,CAAC,SAAS,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACK,mBAAmB,CAAC,IAAc,EAAE,KAAc,EAAE,OAA+B;QACzF,IAAI,sBAAsB,CAAC,MAAM,KAAK,OAAO;YAC3C,OAAO;QACT,IAAI,CAAC,sBAAsB,CAAC,eAAe,KAAK,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAC7E,OAAO;QACT,IAAI,CAAC,sBAAsB,CAAC,gBAAgB,KAAK,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAC9E,OAAO;QACT,gEAAgE;QAChE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD;;;;;;OAMG;IACI,sBAAsB,CAAC,KAAc,EAAE,QAAgC;QAC5E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACxC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,SAAS;YACnC,OAAO,KAAK,CAAC;QACf,mHAAmH;QACnH,2GAA2G;QAC3G,wBAAwB;QACxB,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC;YAChC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YAC1B,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBACxG,IAAI,CAAC,2BAA2B,CAAC,OAAO,CAAC,CAAC;gBAC1C,4BAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YACjC,+DAA+D;YAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,YAAa,CAAC,CAAC;YAChG,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC;YACpC,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAE,iBAAiB;YACzF,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;YACvC,4BAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC;YACnC,0FAA0F;YAC1F,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAChB,cAAsC,EACtC,MAAe,EACf,SAAyD;QAEzD,MAAM,GAAG,GAAG,+CAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,cAAc,CAAC,cAAc,EAAE,CAAC;YAClC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,oBAAY,CAAC,SAAS,CAAC,CAAC;YAC/E,IAAI,cAAc,CAAC,cAAc;gBAC/B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,MAAM,GAAG,GAAG,aAAK,CAAC,WAAW,EAAE,CAAC;QAChC,OAAO,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC;YACnD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,cAAc,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;gBACjD,IAAI,CAAC,cAAc;oBACjB,MAAM;YACV,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnD,OAAO,KAAK,CAAC;YACf,CAAC;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;gBACjC,MAAM,UAAU,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,UAAU,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,EAAE,GAAG,GAAG,CAAC,eAAe,CAAC,cAAc,CAAC,IAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;gBAC1F,wDAAwD;gBACxD,QAAQ,EAAE,EAAE,CAAC;oBACX,KAAK,8CAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC9B,cAAc,CAAC,cAAc,EAAE,CAAC;wBAChC,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,cAAc,CAAC,CAAC,CAAC;wBACtC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,YAAY,CAAC,CAAC,CAAC;wBACpC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;wBAC/B,cAAc,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;wBACpD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,uBAAuB;wBAC5D,cAAc,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;wBACxD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,WAAW,CAAC,CAAC,CAAC;wBACnC,IAAI,cAAc,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI;+BACtC,cAAc,CAAC,MAAM;+BACrB,CAAC,UAAU,CAAC,MAAM,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;4BAChD,IAAI,EAAE,CAAC;wBACT,CAAC;6BAAM,CAAC;4BACN,IAAI,GAAG,CAAC,CAAC;wBACX,CAAC;wBACD,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;gBACjC,GAAG,CAAC,aAAa,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBAC/C,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;YACV,CAAC;iBAAM,IAAI,cAAc,CAAC,QAAQ,EAAE,CAAC;gBACnC,GAAG,CAAC,eAAe,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBACjD,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;YACV,CAAC;QACH,CAAC;QACD,IAAI,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,sGAAsG;YACtG,yGAAyG;YACzG,+FAA+F;YAC/F,4DAA4D;YAC5D,IAAI,cAAc,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACtC,cAAc,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAC3C,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,qEAAqE;QACrE,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAnTD,sEAmTC;AACD,0EAA0E;AAC1E,SAAS,qBAAqB,CAC5B,KAAoB,EAAE,QAAgC,EAAE,YAAoB,EAAE,QAAsB;IAEpG,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YACnC,QAAQ,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry, PolygonLocation } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { SmallSystem } from \"../numerics/SmallSystem\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { MarkedEdgeSet } from \"./HalfEdgeMarkSet\";\r\nimport { PointSearchContext, RayClassification } from \"./HalfEdgePointInGraphSearch\";\r\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\r\nimport { Triangulator } from \"./Triangulation\";\r\n\r\n/**\r\n * Options for setting the z-coordinate of a vertex in the triangulation when a point with the same xy is inserted.\r\n * @internal\r\n */\r\nexport enum InsertedVertexZOptions {\r\n  /** The point's z-coordinate is ignored, and the existing vertex's z-coordinate is unchanged. */\r\n  Ignore,\r\n  /** The point's z-coordinate replaces the existing vertex's z-coordinate. */\r\n  Replace,\r\n  /**\r\n   * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the\r\n   * point's z-coordinate is larger.\r\n   */\r\n  ReplaceIfLarger,\r\n  /**\r\n   * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the\r\n   * point's z-coordinate is smaller.\r\n   */\r\n  ReplaceIfSmaller,\r\n}\r\n\r\n/**\r\n * Context for repeated insertion of new points in a graph.\r\n * * Initial graph should have clean outer boundary (e.g., as typically marked with `HalfEdgeMask.EXTERIOR` and\r\n * `HalfEdgeMask.BOUNDARY_EDGE`).\r\n * * After each insertion, the current \"position\" within the graph is remembered so that each subsequent insertion\r\n * can reuse that position as start for walking to the new point.\r\n * @internal\r\n */\r\nexport class InsertAndRetriangulateContext {\r\n  private _graph: HalfEdgeGraph;\r\n  private _edgeSet: MarkedEdgeSet;\r\n  private _searcher: HalfEdgePositionDetail;\r\n  private _tolerance: number;\r\n\r\n  private constructor(graph: HalfEdgeGraph, tolerance: number) {\r\n    this._graph = graph;\r\n    this._edgeSet = MarkedEdgeSet.create(graph)!;\r\n    this._searcher = HalfEdgePositionDetail.create();\r\n    this._tolerance = tolerance;\r\n  }\r\n  /** Create a new context referencing the graph. */\r\n  public static create(graph: HalfEdgeGraph, tolerance: number = Geometry.smallMetricDistance) {\r\n    return new InsertAndRetriangulateContext(graph, tolerance);\r\n  }\r\n  /** Query the (pointer to) the graph in the context. */\r\n  public get graph(): HalfEdgeGraph {\r\n    return this._graph;\r\n  }\r\n  /**\r\n   * Walk face from edgeNode. Insert new edges back to start node from all except immediate successor and predecessor.\r\n   * Insert all new nodes and nodes of the existing face in edgeSet.\r\n   */\r\n  private retriangulateFromBaseVertex(centralNode: HalfEdge) {\r\n    const numNode = centralNode.countEdgesAroundFace();\r\n    if (numNode < 4 || centralNode.isMaskSet(HalfEdgeMask.EXTERIOR))\r\n      return;\r\n    this._edgeSet.addAroundFace(centralNode);\r\n    const numEdge = numNode - 3;\r\n    let farNode = centralNode.faceSuccessor;\r\n    let nearNode = centralNode;\r\n    for (let i = 0; i < numEdge; i++) {\r\n      farNode = farNode.faceSuccessor;\r\n      nearNode = this._graph.createEdgeHalfEdgeHalfEdge(nearNode, 0, farNode, 0);\r\n      farNode = nearNode.faceSuccessor;\r\n      this._edgeSet.addToSet(nearNode);\r\n    }\r\n  }\r\n  /** Reset the \"current\" position to unknown state. */\r\n  public reset() {\r\n    this._searcher = HalfEdgePositionDetail.create();\r\n  }\r\n  /** Return a (reference to!) the current position in the graph. */\r\n  public get currentPosition() {\r\n    return this._searcher;\r\n  }\r\n  /** Linear search for the nearest graph edge or vertex. */\r\n  public searchForNearestEdgeOrVertex(xyz: Point3d): HalfEdgePositionDetail {\r\n    const position = HalfEdgePositionDetail.create();\r\n    position.setDTag(Number.MAX_VALUE);\r\n    const xyzC = Point3d.create();\r\n    let fractionC;\r\n    let distanceC;\r\n    for (const nodeA of this._graph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      fractionC = SmallSystem.lineSegment3dXYClosestPointUnbounded(nodeA, nodeB, xyz);\r\n      if (fractionC !== undefined) {\r\n        if (fractionC > 1.0) {\r\n          distanceC = xyz.distanceXY(nodeB);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAsVertex(nodeB);\r\n            position.setDTag(distanceC);\r\n          }\r\n        } else if (fractionC < 0.0) {\r\n          distanceC = xyz.distanceXY(nodeA);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAsVertex(nodeA);\r\n            position.setDTag(distanceC);\r\n          }\r\n        } else {\r\n          nodeA.fractionToPoint3d(fractionC, xyzC);\r\n\r\n          distanceC = xyz.distanceXY(xyzC);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAtEdgeAndFraction(nodeA, fractionC);\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return position;\r\n  }\r\n  /** Linear search for the nearest graph vertex. */\r\n  public searchForNearestVertex(xyz: Point3d): HalfEdgePositionDetail {\r\n    const position = HalfEdgePositionDetail.create();\r\n    position.setDTag(Number.MAX_VALUE);\r\n    let distanceA;\r\n    for (const nodeA of this._graph.allHalfEdges) {\r\n      distanceA = xyz.distanceXY(nodeA);\r\n      if (distanceA < position.getDTag()!) {\r\n        position.resetAsVertex(nodeA);\r\n        position.setDTag(distanceA);\r\n      }\r\n    }\r\n    return position;\r\n  }\r\n  /**\r\n   * Reset the \"current\" position to a vertex nearest the target point.\r\n   * @param xyz target point\r\n   * @param searchEdgesToo reset to nearest vertex or edge\r\n  */\r\n  public resetSearch(xyz: Point3d, searchEdgesToo: boolean): void {\r\n    if (searchEdgesToo)\r\n      this._searcher = this.searchForNearestEdgeOrVertex(xyz);\r\n    else\r\n      this._searcher = this.searchForNearestVertex(xyz);\r\n  }\r\n  /** Reclassify the current interior face hit if it is too close to an edge of the face. */\r\n  private reclassifyFaceHit(point: Point3d): boolean {\r\n    if (undefined === this._searcher.node || !this._searcher.isFace || this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR))\r\n      return false;\r\n    const pointXY = Point3d.create(point.x, point.y);\r\n    const face = this._searcher.node.collectAroundFace((node: HalfEdge) => {\r\n      const xy = Point3d.create(node.x, node.y);\r\n      (xy as any).node = node; // decorate the point with the node\r\n      return xy;\r\n    });\r\n    const detail = PolygonOps.closestPointOnBoundary(face, pointXY, this._tolerance);\r\n    assert(detail.code === PolygonLocation.OnPolygonEdgeInterior);\r\n    if (detail.a > this._tolerance)\r\n      return false;\r\n    const edge = face[detail.closestEdgeIndex].node;\r\n    const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;\r\n    if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)\r\n      this._searcher.resetAsVertex(vertex);\r\n    else\r\n      this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);\r\n    return true;\r\n  }\r\n  /** Reclassify the current interior edge hit if it is too close to an edge of either adjacent face. */\r\n  private reclassifyEdgeHit(point: Point3d): boolean {\r\n    if (undefined === this._searcher.node || !this._searcher.isEdge || this._searcher.node.isMaskSet(HalfEdgeMask.BOUNDARY_EDGE))\r\n      return false;\r\n    const pointXY = Point3d.create(point.x, point.y);\r\n    const superFace: Point3d[] = [];\r\n    for (let n = this._searcher.node.faceSuccessor; n !== this._searcher.node; n = n.faceSuccessor) {\r\n      const xy = Point3d.create(n.x, n.y);\r\n      (xy as any).node = n; // decorate the point with a node of the left face\r\n      superFace.push(xy);\r\n    }\r\n    for (let n = this._searcher.node.vertexPredecessor; n !== this._searcher.node.edgeMate; n = n.faceSuccessor) {\r\n      const xy = Point3d.create(n.x, n.y);\r\n      (xy as any).node = n; // decorate the point with a node of the right face\r\n      superFace.push(xy);\r\n    }\r\n    const detail = PolygonOps.closestPointOnBoundary(superFace, pointXY, this._tolerance);\r\n    if (detail.a > this._tolerance)\r\n      return false;\r\n    const edge = (superFace[detail.closestEdgeIndex] as any).node;\r\n    const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;\r\n    if (detail.code === PolygonLocation.OnPolygonVertex) // can happen if superFace is non-concave (e.g., a dart)\r\n      this._searcher.resetAsVertex(vertex);\r\n    else if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)\r\n      this._searcher.resetAsVertex(vertex);\r\n    else\r\n      this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);\r\n    return true;\r\n  }\r\n  /**\r\n   * Given a point that was just inserted into the graph at the given node, apply the z-coordinate rule around\r\n   * the vertex loop.\r\n   */\r\n  private updateZAroundVertex(node: HalfEdge, point: Point3d, zOption: InsertedVertexZOptions): void {\r\n    if (InsertedVertexZOptions.Ignore === zOption)\r\n      return;\r\n    if ((InsertedVertexZOptions.ReplaceIfLarger === zOption) && (point.z <= node.z))\r\n      return;\r\n    if ((InsertedVertexZOptions.ReplaceIfSmaller === zOption) && (point.z >= node.z))\r\n      return;\r\n    // only replace z; preserving xy preserves convexity of the hull\r\n    node.setXYZAroundVertex(node.x, node.y, point.z);\r\n  }\r\n  /**\r\n   * Insert a new point into the graph and retriangulate.\r\n   * @param point the coordinates of the node to be inserted.\r\n   * @param newZWins rule governing when `point.z` should override the z-coordinate of an existing vertex with the\r\n   * same x and y.\r\n   * @returns true if and only if the point didn't need to be inserted or was successfully inserted.\r\n   */\r\n  public insertAndRetriangulate(point: Point3d, newZWins: InsertedVertexZOptions): boolean {\r\n    this.moveToPoint(this._searcher, point);\r\n    if (this._searcher.node === undefined)\r\n      return false;\r\n    // Try to avoid skinny triangles. If we iterated, this could get out of control (e.g., inserting point into a fan).\r\n    // Limiting to one reclassification ensures the hit doesn't move more than tol and reduces skinny triangles\r\n    // adjacent to the hull.\r\n    if (!this.reclassifyFaceHit(point))\r\n      this.reclassifyEdgeHit(point);\r\n    if (this._searcher.isFace) {\r\n      // insert point into the graph if it lies in an interior face\r\n      if (!this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR)) {\r\n        const newNode = this._graph.createEdgeXYZHalfEdge(point.x, point.y, point.z, 0, this._searcher.node, 0);\r\n        this.retriangulateFromBaseVertex(newNode);\r\n        Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\r\n        this._searcher.resetAsVertex(newNode);\r\n      }\r\n    } else if (this._searcher.isEdge) {\r\n      // insert point into the graph by splitting its containing edge\r\n      const newA = this._graph.splitEdgeAtFraction(this._searcher.node, this._searcher.edgeFraction!);\r\n      const newB = newA.vertexPredecessor;\r\n      this.updateZAroundVertex(newA, point, InsertedVertexZOptions.Replace);  // always replace\r\n      this.retriangulateFromBaseVertex(newA);\r\n      this.retriangulateFromBaseVertex(newB);\r\n      Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\r\n      this._searcher.resetAsVertex(newA);\r\n    } else if (this._searcher.isVertex) {\r\n      // no need to insert point as there's already a vertex there, but maybe update its z-coord\r\n      this.updateZAroundVertex(this._searcher.node, point, newZWins);\r\n    }\r\n    return true;\r\n  }\r\n  /**\r\n   * Advance movingPosition to a face, edge, or vertex position detail that contains `target`.\r\n   * @param movingPosition input seed for search, updated on return.\r\n   * @param target point to search for containing topology in the graph.\r\n   * @param announcer optional callback invoked during search loop; return false to end search.\r\n   * @returns true if search was successful.\r\n   */\r\n  public moveToPoint(\r\n    movingPosition: HalfEdgePositionDetail,\r\n    target: Point3d,\r\n    announcer?: (position: HalfEdgePositionDetail) => boolean,\r\n  ): boolean {\r\n    const psc = PointSearchContext.create(this._tolerance);\r\n    movingPosition.setITag(0);\r\n    if (movingPosition.isUnclassified) {\r\n      moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, HalfEdgeMask.NULL_MASK);\r\n      if (movingPosition.isUnclassified)\r\n        return false;\r\n    }\r\n    let trap = 0;\r\n    const ray = Ray3d.createXAxis();\r\n    for (; movingPosition.getITag() === 0 && trap < 2;) {\r\n      if (announcer !== undefined) {\r\n        const continueSearch = announcer(movingPosition);\r\n        if (!continueSearch)\r\n          break;\r\n      }\r\n      if (!psc.setSearchRay(movingPosition, target, ray)) {\r\n        return false;\r\n      } else if (movingPosition.isFace) {\r\n        const lastBefore = HalfEdgePositionDetail.create();\r\n        const firstAfter = HalfEdgePositionDetail.create();\r\n        const rc = psc.reAimAroundFace(movingPosition.node!, ray, ray.a!, lastBefore, firstAfter);\r\n        // reAimAroundFace returns lots of cases in `lastBefore`\r\n        switch (rc) {\r\n          case RayClassification.NoHits: {\r\n            movingPosition.resetAsUnknown();\r\n            break;\r\n          }\r\n          case RayClassification.TargetOnVertex: {\r\n            movingPosition.setFrom(lastBefore);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.TargetOnEdge: {\r\n            movingPosition.setFrom(lastBefore);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.Bracket: {\r\n            movingPosition.resetAsFace(lastBefore.node, target);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.TargetBefore: { // do we ever get here?\r\n            movingPosition.resetAsFace(movingPosition.node, target);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.TargetAfter: {\r\n            if (movingPosition.node === lastBefore.node\r\n              && movingPosition.isFace\r\n              && (lastBefore.isEdge || lastBefore.isVertex)) {\r\n              trap++;\r\n            } else {\r\n              trap = 0;\r\n            }\r\n            movingPosition.setFrom(lastBefore);\r\n            break;\r\n          }\r\n        }\r\n      } else if (movingPosition.isEdge) {\r\n        psc.reAimFromEdge(movingPosition, ray, ray.a!);\r\n        if (movingPosition.isUnclassified)\r\n          break;\r\n      } else if (movingPosition.isVertex) {\r\n        psc.reAimFromVertex(movingPosition, ray, ray.a!);\r\n        if (movingPosition.isUnclassified)\r\n          break;\r\n      }\r\n    }\r\n    if (movingPosition.isAtXY(target.x, target.y))\r\n      return true;\r\n    if (trap > 1) {\r\n      // ugh! We exited the loop by repeatedly hitting the same node with edge or vertex type in lastBefore.\r\n      // This happens only when the target point is exterior (heavy triangulation use cases start with a convex\r\n      // hull and only do interior intersections, so case only happens in contrived unit tests so far\r\n      // What to mark? Leave it as is, but mark as exterior target\r\n      if (movingPosition.node !== undefined) {\r\n        movingPosition.setIsExteriorTarget(true);\r\n      }\r\n      return false;\r\n    }\r\n    // murky here; should never be hit. Has never been hit in unit tests.\r\n    return false;\r\n  }\r\n}\r\n/** Set `position` to a random unmasked edge at the specified fraction. */\r\nfunction moveToAnyUnmaskedEdge(\r\n  graph: HalfEdgeGraph, position: HalfEdgePositionDetail, edgeFraction: number, skipMask: HalfEdgeMask,\r\n): boolean {\r\n  for (const candidate of graph.allHalfEdges) {\r\n    if (!candidate.isMaskSet(skipMask)) {\r\n      position.resetAtEdgeAndFraction(candidate, edgeFraction);\r\n      return true;\r\n    }\r\n  }\r\n  return false;\r\n}\r\n"]}
+{"version":3,"file":"InsertAndRetriangulateContext.js","sourceRoot":"","sources":["../../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,0CAAwD;AACxD,mEAAwD;AACxD,yDAAsD;AACtD,+CAA4C;AAC5C,yDAAsD;AACtD,mCAAgE;AAChE,uDAAkD;AAClD,6EAAqF;AACrF,qEAAkE;AAClE,mDAA+C;AAE/C;;;GAGG;AACH,IAAY,sBAeX;AAfD,WAAY,sBAAsB;IAChC,gGAAgG;IAChG,uEAAM,CAAA;IACN,4EAA4E;IAC5E,yEAAO,CAAA;IACP;;;OAGG;IACH,yFAAe,CAAA;IACf;;;OAGG;IACH,2FAAgB,CAAA;AAClB,CAAC,EAfW,sBAAsB,sCAAtB,sBAAsB,QAejC;AAED;;;;;;;GAOG;AACH,MAAa,6BAA6B;IAChC,MAAM,CAAgB;IACtB,QAAQ,CAAgB;IACxB,SAAS,CAAyB;IAClC,UAAU,CAAS;IAE3B,yEAAyE;IACzE,YAAoB,KAAoB,EAAE,SAAiB;QACzD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,MAAM,OAAO,GAAG,+BAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,qBAAM,EAAC,OAAO,KAAK,SAAS,EAAE,6DAA6D,CAAC,CAAC;QAC7F,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,SAAS,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD;;;MAGE;IACK,MAAM,CAAC,MAAM,CAAC,KAAoB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACzF,OAAO,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,6BAA6B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7F,CAAC;IACD,uDAAuD;IACvD,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;OAGG;IACK,2BAA2B,CAAC,WAAqB;QACvD,MAAM,OAAO,GAAG,WAAW,CAAC,oBAAoB,EAAE,CAAC;QACnD,IAAI,OAAO,GAAG,CAAC,IAAI,WAAW,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC;YAC7D,OAAO;QACT,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC;QAC5B,IAAI,OAAO,GAAG,WAAW,CAAC,aAAa,CAAC;QACxC,IAAI,QAAQ,GAAG,WAAW,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,OAAO,GAAG,OAAO,CAAC,aAAa,CAAC;YAChC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,0BAA0B,CAAC,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YAC3E,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,qDAAqD;IAC9C,KAAK;QACV,IAAI,CAAC,SAAS,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC;IACD,kEAAkE;IAClE,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,0DAA0D;IACnD,4BAA4B,CAAC,GAAY;QAC9C,MAAM,QAAQ,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QACjC,MAAM,IAAI,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,SAAS,CAAC;QACd,IAAI,SAAS,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,SAAS,GAAG,yBAAW,CAAC,oCAAoC,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBACpB,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;wBAC9B,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC;oBAC5B,CAAC;gBACH,CAAC;qBAAM,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBAC3B,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;wBAC9B,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC;oBAC5B,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,KAAK,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;oBACzC,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACjC,IAAI,SAAS,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;wBAC9B,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,kDAAkD;IAC3C,sBAAsB,CAAC,GAAY;QACxC,MAAM,QAAQ,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,IAAI,GAAG,MAAM,CAAC,SAAS,CAAC;QACjC,IAAI,SAAS,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;gBAC9B,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAC9B,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;MAIE;IACK,WAAW,CAAC,GAAY,EAAE,cAAuB;QACtD,IAAI,cAAc;YAChB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;;YAExD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IACD,0FAA0F;IAClF,iBAAiB,CAAC,KAAc;QACtC,IAAI,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC;YACvH,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,yBAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YACpE,MAAM,EAAE,GAAG,yBAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,EAAU,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,mCAAmC;YAC5D,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,uBAAU,CAAC,sBAAsB,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACjF,IAAA,qBAAM,EAAC,MAAM,CAAC,IAAI,KAAK,0BAAe,CAAC,qBAAqB,CAAC,CAAC;QAC9D,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC;QAChD,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QAC3E,IAAI,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;YAC7E,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;;YAErC,IAAI,CAAC,SAAS,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sGAAsG;IAC9F,iBAAiB,CAAC,KAAc;QACtC,IAAI,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,aAAa,CAAC;YAC5H,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,yBAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC;YAC/F,MAAM,EAAE,GAAG,yBAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,EAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,kDAAkD;YACxE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC;YAC5G,MAAM,EAAE,GAAG,yBAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,EAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,mDAAmD;YACzE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,MAAM,GAAG,uBAAU,CAAC,sBAAsB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACtF,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,IAAI,GAAI,SAAS,CAAC,MAAM,CAAC,gBAAgB,CAAS,CAAC,IAAI,CAAC;QAC9D,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QAC3E,IAAI,MAAM,CAAC,IAAI,KAAK,0BAAe,CAAC,eAAe,EAAE,wDAAwD;YAC3G,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aAClC,IAAI,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;YAClF,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;;YAErC,IAAI,CAAC,SAAS,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACK,mBAAmB,CAAC,IAAc,EAAE,KAAc,EAAE,OAA+B;QACzF,IAAI,sBAAsB,CAAC,MAAM,KAAK,OAAO;YAC3C,OAAO;QACT,IAAI,CAAC,sBAAsB,CAAC,eAAe,KAAK,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAC7E,OAAO;QACT,IAAI,CAAC,sBAAsB,CAAC,gBAAgB,KAAK,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAC9E,OAAO;QACT,gEAAgE;QAChE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD;;;;;;OAMG;IACI,sBAAsB,CAAC,KAAc,EAAE,QAAgC;QAC5E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACxC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,SAAS;YACnC,OAAO,KAAK,CAAC;QACf,mHAAmH;QACnH,2GAA2G;QAC3G,wBAAwB;QACxB,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC;YAChC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5B,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBACxG,IAAI,CAAC,2BAA2B,CAAC,OAAO,CAAC,CAAC;gBAC1C,4BAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACnC,+DAA+D;YAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YAC/F,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC;YACpC,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAE,iBAAiB;YACzF,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;YACvC,4BAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC;YACrC,0FAA0F;YAC1F,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAChB,cAAsC,EACtC,MAAe,EACf,SAAyD;QAEzD,MAAM,GAAG,GAAG,+CAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvD,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;QACxB,IAAI,cAAc,CAAC,cAAc,EAAE,CAAC;YAClC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,oBAAY,CAAC,SAAS,CAAC,CAAC;YAC/E,IAAI,cAAc,CAAC,cAAc;gBAC/B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,MAAM,GAAG,GAAG,aAAK,CAAC,WAAW,EAAE,CAAC;QAChC,OAAO,cAAc,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC;YAC9C,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,cAAc,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;gBACjD,IAAI,CAAC,cAAc;oBACjB,MAAM;YACV,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,EAAE,MAAM,EAAE,GAAG,CAAC;gBAChD,OAAO,KAAK,CAAC;YACf,IAAA,qBAAM,EAAC,GAAG,CAAC,CAAC,KAAK,SAAS,EAAE,qDAAqD,CAAC,CAAC;YACnF,IAAI,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC5B,MAAM,UAAU,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,UAAU,GAAG,+CAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,EAAE,GAAG,GAAG,CAAC,eAAe,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;gBACxF,wDAAwD;gBACxD,QAAQ,EAAE,EAAE,CAAC;oBACX,KAAK,8CAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC9B,cAAc,CAAC,cAAc,EAAE,CAAC;wBAChC,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,cAAc,CAAC,CAAC,CAAC;wBACtC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;wBACxB,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,YAAY,CAAC,CAAC,CAAC;wBACpC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;wBACxB,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;wBAC/B,cAAc,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;wBACpD,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;wBACxB,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,uBAAuB;wBAC5D,cAAc,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;wBACxD,cAAc,CAAC,IAAI,GAAG,CAAC,CAAC;wBACxB,MAAM;oBACR,CAAC;oBACD,KAAK,8CAAiB,CAAC,WAAW,CAAC,CAAC,CAAC;wBACnC,IAAI,cAAc,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI;+BACtC,cAAc,CAAC,MAAM,EAAE;+BACvB,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC;4BACpD,IAAI,EAAE,CAAC;wBACT,CAAC;6BAAM,CAAC;4BACN,IAAI,GAAG,CAAC,CAAC;wBACX,CAAC;wBACD,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE,EAAE,CAAC;gBACnC,GAAG,CAAC,aAAa,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC9C,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;YACV,CAAC;iBAAM,IAAI,cAAc,CAAC,QAAQ,EAAE,EAAE,CAAC;gBACrC,GAAG,CAAC,eAAe,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChD,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;YACV,CAAC;QACH,CAAC;QACD,IAAI,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC;YAC5D,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,sGAAsG;YACtG,yGAAyG;YACzG,sGAAsG;YACtG,6DAA6D;YAC7D,IAAI,cAAc,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACtC,cAAc,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAC3C,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAA,qBAAM,EAAC,IAAI,GAAG,CAAC,EAAE,iEAAiE,CAAC,CAAC;QACpF,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAzTD,sEAyTC;AACD,0EAA0E;AAC1E,SAAS,qBAAqB,CAC5B,KAAoB,EAAE,QAAgC,EAAE,YAAoB,EAAE,QAAsB;IAEpG,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YACnC,QAAQ,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry, PolygonLocation } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { SmallSystem } from \"../numerics/SmallSystem\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { MarkedEdgeSet } from \"./HalfEdgeMarkSet\";\r\nimport { PointSearchContext, RayClassification } from \"./HalfEdgePointInGraphSearch\";\r\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\r\nimport { Triangulator } from \"./Triangulation\";\r\n\r\n/**\r\n * Options for setting the z-coordinate of a vertex in the triangulation when a point with the same xy is inserted.\r\n * @internal\r\n */\r\nexport enum InsertedVertexZOptions {\r\n  /** The point's z-coordinate is ignored, and the existing vertex's z-coordinate is unchanged. */\r\n  Ignore,\r\n  /** The point's z-coordinate replaces the existing vertex's z-coordinate. */\r\n  Replace,\r\n  /**\r\n   * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the\r\n   * point's z-coordinate is larger.\r\n   */\r\n  ReplaceIfLarger,\r\n  /**\r\n   * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the\r\n   * point's z-coordinate is smaller.\r\n   */\r\n  ReplaceIfSmaller,\r\n}\r\n\r\n/**\r\n * Context for repeated insertion of new points in a graph.\r\n * * Initial graph should have clean outer boundary (e.g., as typically marked with `HalfEdgeMask.EXTERIOR` and\r\n * `HalfEdgeMask.BOUNDARY_EDGE`).\r\n * * After each insertion, the current \"position\" within the graph is remembered so that each subsequent insertion\r\n * can reuse that position as start for walking to the new point.\r\n * @internal\r\n */\r\nexport class InsertAndRetriangulateContext {\r\n  private _graph: HalfEdgeGraph;\r\n  private _edgeSet: MarkedEdgeSet;\r\n  private _searcher: HalfEdgePositionDetail;\r\n  private _tolerance: number;\r\n\r\n  /** Constructor. NOTE: graph is assumed to have a free mask available. */\r\n  private constructor(graph: HalfEdgeGraph, tolerance: number) {\r\n    this._graph = graph;\r\n    const edgeSet = MarkedEdgeSet.create(graph);\r\n    assert(edgeSet !== undefined, \"expect defined; the only caller ensures graph has free mask\");\r\n    this._edgeSet = edgeSet;\r\n    this._searcher = HalfEdgePositionDetail.create();\r\n    this._tolerance = tolerance;\r\n  }\r\n  /**\r\n   * Create a new context referencing the graph.\r\n   * @return `undefined` if graph has no free mask available\r\n  */\r\n  public static create(graph: HalfEdgeGraph, tolerance: number = Geometry.smallMetricDistance): InsertAndRetriangulateContext | undefined {\r\n    return graph.hasFreeMask ? new InsertAndRetriangulateContext(graph, tolerance) : undefined;\r\n  }\r\n  /** Query the (pointer to) the graph in the context. */\r\n  public get graph(): HalfEdgeGraph {\r\n    return this._graph;\r\n  }\r\n  /**\r\n   * Walk face from edgeNode. Insert new edges back to start node from all except immediate successor and predecessor.\r\n   * Insert all new nodes and nodes of the existing face in edgeSet.\r\n   */\r\n  private retriangulateFromBaseVertex(centralNode: HalfEdge) {\r\n    const numNode = centralNode.countEdgesAroundFace();\r\n    if (numNode < 4 || centralNode.isMaskSet(HalfEdgeMask.EXTERIOR))\r\n      return;\r\n    this._edgeSet.addAroundFace(centralNode);\r\n    const numEdge = numNode - 3;\r\n    let farNode = centralNode.faceSuccessor;\r\n    let nearNode = centralNode;\r\n    for (let i = 0; i < numEdge; i++) {\r\n      farNode = farNode.faceSuccessor;\r\n      nearNode = this._graph.createEdgeHalfEdgeHalfEdge(nearNode, 0, farNode, 0);\r\n      farNode = nearNode.faceSuccessor;\r\n      this._edgeSet.addToSet(nearNode);\r\n    }\r\n  }\r\n  /** Reset the \"current\" position to unknown state. */\r\n  public reset() {\r\n    this._searcher = HalfEdgePositionDetail.create();\r\n  }\r\n  /** Return a (reference to!) the current position in the graph. */\r\n  public get currentPosition() {\r\n    return this._searcher;\r\n  }\r\n  /** Linear search for the nearest graph edge or vertex. */\r\n  public searchForNearestEdgeOrVertex(xyz: Point3d): HalfEdgePositionDetail {\r\n    const position = HalfEdgePositionDetail.create();\r\n    position.dTag = Number.MAX_VALUE;\r\n    const xyzC = Point3d.create();\r\n    let fractionC;\r\n    let distanceC;\r\n    for (const nodeA of this._graph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      fractionC = SmallSystem.lineSegment3dXYClosestPointUnbounded(nodeA, nodeB, xyz);\r\n      if (fractionC !== undefined) {\r\n        if (fractionC > 1.0) {\r\n          distanceC = xyz.distanceXY(nodeB);\r\n          if (distanceC < position.dTag) {\r\n            position.resetAsVertex(nodeB);\r\n            position.dTag = distanceC;\r\n          }\r\n        } else if (fractionC < 0.0) {\r\n          distanceC = xyz.distanceXY(nodeA);\r\n          if (distanceC < position.dTag) {\r\n            position.resetAsVertex(nodeA);\r\n            position.dTag = distanceC;\r\n          }\r\n        } else {\r\n          nodeA.fractionToPoint3d(fractionC, xyzC);\r\n          distanceC = xyz.distanceXY(xyzC);\r\n          if (distanceC < position.dTag) {\r\n            position.resetAtEdgeAndFraction(nodeA, fractionC);\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return position;\r\n  }\r\n  /** Linear search for the nearest graph vertex. */\r\n  public searchForNearestVertex(xyz: Point3d): HalfEdgePositionDetail {\r\n    const position = HalfEdgePositionDetail.create();\r\n    position.dTag = Number.MAX_VALUE;\r\n    let distanceA;\r\n    for (const nodeA of this._graph.allHalfEdges) {\r\n      distanceA = xyz.distanceXY(nodeA);\r\n      if (distanceA < position.dTag) {\r\n        position.resetAsVertex(nodeA);\r\n        position.dTag = distanceA;\r\n      }\r\n    }\r\n    return position;\r\n  }\r\n  /**\r\n   * Reset the \"current\" position to a vertex nearest the target point.\r\n   * @param xyz target point\r\n   * @param searchEdgesToo reset to nearest vertex or edge\r\n  */\r\n  public resetSearch(xyz: Point3d, searchEdgesToo: boolean): void {\r\n    if (searchEdgesToo)\r\n      this._searcher = this.searchForNearestEdgeOrVertex(xyz);\r\n    else\r\n      this._searcher = this.searchForNearestVertex(xyz);\r\n  }\r\n  /** Reclassify the current interior face hit if it is too close to an edge of the face. */\r\n  private reclassifyFaceHit(point: Point3d): boolean {\r\n    if (undefined === this._searcher.node || !this._searcher.isFace() || this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR))\r\n      return false;\r\n    const pointXY = Point3d.create(point.x, point.y);\r\n    const face = this._searcher.node.collectAroundFace((node: HalfEdge) => {\r\n      const xy = Point3d.create(node.x, node.y);\r\n      (xy as any).node = node; // decorate the point with the node\r\n      return xy;\r\n    });\r\n    const detail = PolygonOps.closestPointOnBoundary(face, pointXY, this._tolerance);\r\n    assert(detail.code === PolygonLocation.OnPolygonEdgeInterior);\r\n    if (detail.a > this._tolerance)\r\n      return false;\r\n    const edge = face[detail.closestEdgeIndex].node;\r\n    const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;\r\n    if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)\r\n      this._searcher.resetAsVertex(vertex);\r\n    else\r\n      this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);\r\n    return true;\r\n  }\r\n  /** Reclassify the current interior edge hit if it is too close to an edge of either adjacent face. */\r\n  private reclassifyEdgeHit(point: Point3d): boolean {\r\n    if (undefined === this._searcher.node || !this._searcher.isEdge() || this._searcher.node.isMaskSet(HalfEdgeMask.BOUNDARY_EDGE))\r\n      return false;\r\n    const pointXY = Point3d.create(point.x, point.y);\r\n    const superFace: Point3d[] = [];\r\n    for (let n = this._searcher.node.faceSuccessor; n !== this._searcher.node; n = n.faceSuccessor) {\r\n      const xy = Point3d.create(n.x, n.y);\r\n      (xy as any).node = n; // decorate the point with a node of the left face\r\n      superFace.push(xy);\r\n    }\r\n    for (let n = this._searcher.node.vertexPredecessor; n !== this._searcher.node.edgeMate; n = n.faceSuccessor) {\r\n      const xy = Point3d.create(n.x, n.y);\r\n      (xy as any).node = n; // decorate the point with a node of the right face\r\n      superFace.push(xy);\r\n    }\r\n    const detail = PolygonOps.closestPointOnBoundary(superFace, pointXY, this._tolerance);\r\n    if (detail.a > this._tolerance)\r\n      return false;\r\n    const edge = (superFace[detail.closestEdgeIndex] as any).node;\r\n    const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;\r\n    if (detail.code === PolygonLocation.OnPolygonVertex) // can happen if superFace is non-concave (e.g., a dart)\r\n      this._searcher.resetAsVertex(vertex);\r\n    else if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)\r\n      this._searcher.resetAsVertex(vertex);\r\n    else\r\n      this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);\r\n    return true;\r\n  }\r\n  /**\r\n   * Given a point that was just inserted into the graph at the given node, apply the z-coordinate rule around\r\n   * the vertex loop.\r\n   */\r\n  private updateZAroundVertex(node: HalfEdge, point: Point3d, zOption: InsertedVertexZOptions): void {\r\n    if (InsertedVertexZOptions.Ignore === zOption)\r\n      return;\r\n    if ((InsertedVertexZOptions.ReplaceIfLarger === zOption) && (point.z <= node.z))\r\n      return;\r\n    if ((InsertedVertexZOptions.ReplaceIfSmaller === zOption) && (point.z >= node.z))\r\n      return;\r\n    // only replace z; preserving xy preserves convexity of the hull\r\n    node.setXYZAroundVertex(node.x, node.y, point.z);\r\n  }\r\n  /**\r\n   * Insert a new point into the graph and retriangulate.\r\n   * @param point the coordinates of the node to be inserted.\r\n   * @param newZWins rule governing when `point.z` should override the z-coordinate of an existing vertex with the\r\n   * same x and y.\r\n   * @returns true if and only if the point didn't need to be inserted or was successfully inserted.\r\n   */\r\n  public insertAndRetriangulate(point: Point3d, newZWins: InsertedVertexZOptions): boolean {\r\n    this.moveToPoint(this._searcher, point);\r\n    if (this._searcher.node === undefined)\r\n      return false;\r\n    // Try to avoid skinny triangles. If we iterated, this could get out of control (e.g., inserting point into a fan).\r\n    // Limiting to one reclassification ensures the hit doesn't move more than tol and reduces skinny triangles\r\n    // adjacent to the hull.\r\n    if (!this.reclassifyFaceHit(point))\r\n      this.reclassifyEdgeHit(point);\r\n    if (this._searcher.isFace()) {\r\n      // insert point into the graph if it lies in an interior face\r\n      if (!this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR)) {\r\n        const newNode = this._graph.createEdgeXYZHalfEdge(point.x, point.y, point.z, 0, this._searcher.node, 0);\r\n        this.retriangulateFromBaseVertex(newNode);\r\n        Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\r\n        this._searcher.resetAsVertex(newNode);\r\n      }\r\n    } else if (this._searcher.isEdge()) {\r\n      // insert point into the graph by splitting its containing edge\r\n      const newA = this._graph.splitEdgeAtFraction(this._searcher.node, this._searcher.edgeFraction);\r\n      const newB = newA.vertexPredecessor;\r\n      this.updateZAroundVertex(newA, point, InsertedVertexZOptions.Replace);  // always replace\r\n      this.retriangulateFromBaseVertex(newA);\r\n      this.retriangulateFromBaseVertex(newB);\r\n      Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\r\n      this._searcher.resetAsVertex(newA);\r\n    } else if (this._searcher.isVertex()) {\r\n      // no need to insert point as there's already a vertex there, but maybe update its z-coord\r\n      this.updateZAroundVertex(this._searcher.node, point, newZWins);\r\n    }\r\n    return true;\r\n  }\r\n  /**\r\n   * Advance movingPosition to a face, edge, or vertex position detail that contains `target`.\r\n   * @param movingPosition input seed for search, updated on return.\r\n   * @param target point to search for containing topology in the graph.\r\n   * @param announcer optional callback invoked during search loop; return false to end search.\r\n   * @returns true if search was successful.\r\n   */\r\n  public moveToPoint(\r\n    movingPosition: HalfEdgePositionDetail,\r\n    target: Point3d,\r\n    announcer?: (position: HalfEdgePositionDetail) => boolean,\r\n  ): boolean {\r\n    const psc = PointSearchContext.create(this._tolerance);\r\n    movingPosition.iTag = 0;\r\n    if (movingPosition.isUnclassified) {\r\n      moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, HalfEdgeMask.NULL_MASK);\r\n      if (movingPosition.isUnclassified)\r\n        return false;\r\n    }\r\n    let trap = 0;\r\n    const ray = Ray3d.createXAxis();\r\n    for (; movingPosition.iTag === 0 && trap < 2;) {\r\n      if (announcer !== undefined) {\r\n        const continueSearch = announcer(movingPosition);\r\n        if (!continueSearch)\r\n          break;\r\n      }\r\n      if (!psc.setSearchRay(movingPosition, target, ray))\r\n        return false;\r\n      assert(ray.a !== undefined, \"expect defined by successful return of setSearchRay\");\r\n      if (movingPosition.isFace()) {\r\n        const lastBefore = HalfEdgePositionDetail.create();\r\n        const firstAfter = HalfEdgePositionDetail.create();\r\n        const rc = psc.reAimAroundFace(movingPosition.node, ray, ray.a, lastBefore, firstAfter);\r\n        // reAimAroundFace returns lots of cases in `lastBefore`\r\n        switch (rc) {\r\n          case RayClassification.NoHits: {\r\n            movingPosition.resetAsUnknown();\r\n            break;\r\n          }\r\n          case RayClassification.TargetOnVertex: {\r\n            movingPosition.setFrom(lastBefore);\r\n            movingPosition.iTag = 1;\r\n            break;\r\n          }\r\n          case RayClassification.TargetOnEdge: {\r\n            movingPosition.setFrom(lastBefore);\r\n            movingPosition.iTag = 1;\r\n            break;\r\n          }\r\n          case RayClassification.Bracket: {\r\n            movingPosition.resetAsFace(lastBefore.node, target);\r\n            movingPosition.iTag = 1;\r\n            break;\r\n          }\r\n          case RayClassification.TargetBefore: { // do we ever get here?\r\n            movingPosition.resetAsFace(movingPosition.node, target);\r\n            movingPosition.iTag = 1;\r\n            break;\r\n          }\r\n          case RayClassification.TargetAfter: {\r\n            if (movingPosition.node === lastBefore.node\r\n              && movingPosition.isFace()\r\n              && (lastBefore.isEdge() || lastBefore.isVertex())) {\r\n              trap++;\r\n            } else {\r\n              trap = 0;\r\n            }\r\n            movingPosition.setFrom(lastBefore);\r\n            break;\r\n          }\r\n        }\r\n      } else if (movingPosition.isEdge()) {\r\n        psc.reAimFromEdge(movingPosition, ray, ray.a);\r\n        if (movingPosition.isUnclassified)\r\n          break;\r\n      } else if (movingPosition.isVertex()) {\r\n        psc.reAimFromVertex(movingPosition, ray, ray.a);\r\n        if (movingPosition.isUnclassified)\r\n          break;\r\n      }\r\n    }\r\n    if (movingPosition.isAtXY(target.x, target.y, this._tolerance))\r\n      return true;\r\n    if (trap > 1) {\r\n      // Ugh! We exited the loop by repeatedly hitting the same node with edge or vertex type in lastBefore.\r\n      // This happens only when the target point is exterior (heavy triangulation use cases start with a convex\r\n      // hull and only do interior intersections, so this case only happens in contrived unit tests so far).\r\n      // What to mark? Leave it as is, but mark as exterior target.\r\n      if (movingPosition.node !== undefined) {\r\n        movingPosition.setIsExteriorTarget(true);\r\n      }\r\n      return false;\r\n    }\r\n    assert(trap > 1, \"Murky. Should never get here. Has never been hit in unit tests.\");\r\n    return false;\r\n  }\r\n}\r\n/** Set `position` to a random unmasked edge at the specified fraction. */\r\nfunction moveToAnyUnmaskedEdge(\r\n  graph: HalfEdgeGraph, position: HalfEdgePositionDetail, edgeFraction: number, skipMask: HalfEdgeMask,\r\n): boolean {\r\n  for (const candidate of graph.allHalfEdges) {\r\n    if (!candidate.isMaskSet(skipMask)) {\r\n      position.resetAtEdgeAndFraction(candidate, edgeFraction);\r\n      return true;\r\n    }\r\n  }\r\n  return false;\r\n}\r\n"]}

package/lib/cjs/topology/MaskManager.d.ts

@@ -2,7 +2,7 @@
  * @module Topology
  */
 /**
- * Methods to "grab and drop" mask bits.
+ * Methods to "grab and drop" mask bits from a 32-bit field.
  * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.
  * * Callers borrow and return masks with "grabMask" and "dropMask".
  * * Callers must exercise grab/drop balance discipline.
@@ -20,13 +20,17 @@ export declare class MaskManager {
     private constructor();
     /**
      * Create a MaskManager.
-     * Typical use: MaskManager.create(0xFFFF0000)
-     * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.
+     * Typical use: MaskManager.create(0xFFF00000)
+     * * This makes bits 20 through 31 available to be borrowed, with lower bits reserved for fixed usage.
+     * @param freeMasks mask with bits set to be available for grab/drop.
+     * @returns undefined if `freeMasks` has none of the bits [0,31] set.
      */
     static create(freeMasks: number): MaskManager | undefined;
     /** Find a mask bit that is not "in use" in order to borrow that mask. */
     grabMask(): number;
     /** Return the borrowed mask so it is not "in use" anymore. */
     dropMask(mask: number): void;
+    /** Whether there is a mask bit still available to grab. */
+    get hasFreeMask(): boolean;
 }
 //# sourceMappingURL=MaskManager.d.ts.map

package/lib/cjs/topology/MaskManager.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MaskManager.d.ts","sourceRoot":"","sources":["../../../src/topology/MaskManager.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH;;;;;;GAMG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,kBAAkB,CAAS;IACnC,OAAO,CAAC,cAAc,CAAS;IAC/B;;;;OAIG;IACH,OAAO;IAKP;;;;OAIG;WACW,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAehE,yEAAyE;IAClE,QAAQ,IAAI,MAAM;IASzB,8DAA8D;IACvD,QAAQ,CAAC,IAAI,EAAE,MAAM;CAI7B"}
+{"version":3,"file":"MaskManager.d.ts","sourceRoot":"","sources":["../../../src/topology/MaskManager.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH;;;;;;GAMG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,kBAAkB,CAAS;IACnC,OAAO,CAAC,cAAc,CAAS;IAC/B;;;;OAIG;IACH,OAAO;IAKP;;;;;;OAMG;WACW,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAehE,yEAAyE;IAClE,QAAQ,IAAI,MAAM;IASzB,8DAA8D;IACvD,QAAQ,CAAC,IAAI,EAAE,MAAM;IAI5B,2DAA2D;IAC3D,IAAW,WAAW,IAAI,OAAO,CAEhC;CACF"}

package/lib/cjs/topology/MaskManager.js

@@ -9,7 +9,7 @@ exports.MaskManager = void 0;
  * @module Topology
  */
 /**
- * Methods to "grab and drop" mask bits.
+ * Methods to "grab and drop" mask bits from a 32-bit field.
  * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.
  * * Callers borrow and return masks with "grabMask" and "dropMask".
  * * Callers must exercise grab/drop balance discipline.
@@ -31,8 +31,10 @@ class MaskManager {
     }
     /**
      * Create a MaskManager.
-     * Typical use: MaskManager.create(0xFFFF0000)
-     * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.
+     * Typical use: MaskManager.create(0xFFF00000)
+     * * This makes bits 20 through 31 available to be borrowed, with lower bits reserved for fixed usage.
+     * @param freeMasks mask with bits set to be available for grab/drop.
+     * @returns undefined if `freeMasks` has none of the bits [0,31] set.
      */
     static create(freeMasks) {
         // look for first bit up to bit 31
@@ -51,7 +53,7 @@ class MaskManager {
     }
     /** Find a mask bit that is not "in use" in order to borrow that mask. */
     grabMask() {
-        if (this._freeMasks === 0)
+        if (!this.hasFreeMask)
             return 0;
         let mask = this._firstFreeMask;
         while (!(mask & this._freeMasks))
@@ -64,6 +66,10 @@ class MaskManager {
         mask &= this._originalFreeMasks; // prevent "drop" of mask that is not in the pool.
         this._freeMasks |= mask;
     }
+    /** Whether there is a mask bit still available to grab. */
+    get hasFreeMask() {
+        return this._freeMasks !== 0;
+    }
 }
 exports.MaskManager = MaskManager;
 //# sourceMappingURL=MaskManager.js.map

package/lib/cjs/topology/MaskManager.js.map

@@ -1 +1 @@
-{"version":3,"file":"MaskManager.js","sourceRoot":"","sources":["../../../src/topology/MaskManager.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH;;;;;;GAMG;AACH,MAAa,WAAW;IACd,UAAU,CAAS;IACnB,kBAAkB,CAAS;IAC3B,cAAc,CAAS;IAC/B;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,aAAqB;QAC1D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,kBAAkB,GAAG,SAAS,CAAC;QACpC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,SAAiB;QACpC,kCAAkC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChC,SAAS,GAAG,OAAO,CAAC;gBACpB,MAAM;YACR,CAAC;YACD,OAAO,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IACD,yEAAyE;IAClE,QAAQ;QACb,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,OAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YAC9B,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,QAAQ,CAAC,IAAY;QAC1B,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,kDAAkD;QACnF,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC1B,CAAC;CACF;AAjDD,kCAiDC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n/**\r\n * Methods to \"grab and drop\" mask bits.\r\n * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.\r\n * * Callers borrow and return masks with \"grabMask\" and \"dropMask\".\r\n * * Callers must exercise grab/drop balance discipline.\r\n * @internal\r\n */\r\nexport class MaskManager {\r\n  private _freeMasks: number;\r\n  private _originalFreeMasks: number;\r\n  private _firstFreeMask: number;\r\n  /**\r\n   * Constructor\r\n   * @param freeMasks caller-defined block of bits that are to be managed.\r\n   * @param firstFreeMask the first free mask in the freeMasks bits block.\r\n   */\r\n  private constructor(freeMasks: number, firstFreeMask: number) {\r\n    this._freeMasks = freeMasks;\r\n    this._originalFreeMasks = freeMasks;\r\n    this._firstFreeMask = firstFreeMask;\r\n  }\r\n  /**\r\n   * Create a MaskManager.\r\n   * Typical use: MaskManager.create(0xFFFF0000)\r\n   * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.\r\n   */\r\n  public static create(freeMasks: number): MaskManager | undefined {\r\n    // look for first bit up to bit 31\r\n    let firstFree = 0;\r\n    let testBit = 0x01;\r\n    for (let i = 0; i < 32; i++) {\r\n      if ((testBit & freeMasks) !== 0) {\r\n        firstFree = testBit;\r\n        break;\r\n      }\r\n      testBit = (testBit << 1);\r\n    }\r\n    if (firstFree === 0)\r\n      return undefined;\r\n    return new MaskManager(freeMasks, firstFree);\r\n  }\r\n  /** Find a mask bit that is not \"in use\" in order to borrow that mask. */\r\n  public grabMask(): number {\r\n    if (this._freeMasks === 0)\r\n      return 0;\r\n    let mask = this._firstFreeMask;\r\n    while (!(mask & this._freeMasks))\r\n      mask = mask << 1;\r\n    this._freeMasks &= ~mask;\r\n    return mask;\r\n  }\r\n  /** Return the borrowed mask so it is not \"in use\" anymore. */\r\n  public dropMask(mask: number) {\r\n    mask &= this._originalFreeMasks; // prevent \"drop\" of mask that is not in the pool.\r\n    this._freeMasks |= mask;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"MaskManager.js","sourceRoot":"","sources":["../../../src/topology/MaskManager.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH;;;;;;GAMG;AACH,MAAa,WAAW;IACd,UAAU,CAAS;IACnB,kBAAkB,CAAS;IAC3B,cAAc,CAAS;IAC/B;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,aAAqB;QAC1D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,kBAAkB,GAAG,SAAS,CAAC;QACpC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,CAAC,SAAiB;QACpC,kCAAkC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChC,SAAS,GAAG,OAAO,CAAC;gBACpB,MAAM;YACR,CAAC;YACD,OAAO,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IACD,yEAAyE;IAClE,QAAQ;QACb,IAAI,CAAC,IAAI,CAAC,WAAW;YACnB,OAAO,CAAC,CAAC;QACX,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,OAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YAC9B,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,QAAQ,CAAC,IAAY;QAC1B,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,kDAAkD;QACnF,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC1B,CAAC;IACD,2DAA2D;IAC3D,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,UAAU,KAAK,CAAC,CAAC;IAC/B,CAAC;CACF;AAvDD,kCAuDC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n/**\r\n * Methods to \"grab and drop\" mask bits from a 32-bit field.\r\n * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.\r\n * * Callers borrow and return masks with \"grabMask\" and \"dropMask\".\r\n * * Callers must exercise grab/drop balance discipline.\r\n * @internal\r\n */\r\nexport class MaskManager {\r\n  private _freeMasks: number;\r\n  private _originalFreeMasks: number;\r\n  private _firstFreeMask: number;\r\n  /**\r\n   * Constructor\r\n   * @param freeMasks caller-defined block of bits that are to be managed.\r\n   * @param firstFreeMask the first free mask in the freeMasks bits block.\r\n   */\r\n  private constructor(freeMasks: number, firstFreeMask: number) {\r\n    this._freeMasks = freeMasks;\r\n    this._originalFreeMasks = freeMasks;\r\n    this._firstFreeMask = firstFreeMask;\r\n  }\r\n  /**\r\n   * Create a MaskManager.\r\n   * Typical use: MaskManager.create(0xFFF00000)\r\n   * * This makes bits 20 through 31 available to be borrowed, with lower bits reserved for fixed usage.\r\n   * @param freeMasks mask with bits set to be available for grab/drop.\r\n   * @returns undefined if `freeMasks` has none of the bits [0,31] set.\r\n   */\r\n  public static create(freeMasks: number): MaskManager | undefined {\r\n    // look for first bit up to bit 31\r\n    let firstFree = 0;\r\n    let testBit = 0x01;\r\n    for (let i = 0; i < 32; i++) {\r\n      if ((testBit & freeMasks) !== 0) {\r\n        firstFree = testBit;\r\n        break;\r\n      }\r\n      testBit = (testBit << 1);\r\n    }\r\n    if (firstFree === 0)\r\n      return undefined;\r\n    return new MaskManager(freeMasks, firstFree);\r\n  }\r\n  /** Find a mask bit that is not \"in use\" in order to borrow that mask. */\r\n  public grabMask(): number {\r\n    if (!this.hasFreeMask)\r\n      return 0;\r\n    let mask = this._firstFreeMask;\r\n    while (!(mask & this._freeMasks))\r\n      mask = mask << 1;\r\n    this._freeMasks &= ~mask;\r\n    return mask;\r\n  }\r\n  /** Return the borrowed mask so it is not \"in use\" anymore. */\r\n  public dropMask(mask: number) {\r\n    mask &= this._originalFreeMasks; // prevent \"drop\" of mask that is not in the pool.\r\n    this._freeMasks |= mask;\r\n  }\r\n  /** Whether there is a mask bit still available to grab. */\r\n  public get hasFreeMask(): boolean {\r\n    return this._freeMasks !== 0;\r\n  }\r\n}\r\n"]}