@itwin/core-geometry 5.2.0-dev.8 → 5.2.0

package/lib/esm/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,OAAO,EAAqB,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C;;;;;;;;GAQG;AACH,MAAM,OAAO,qCAAqC;IACzC,aAAa,CAA0B;IACvC,WAAW,CAAa;IAC/B,YACE,UAAuC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;QACxF,IAAI,CAAC,aAAa,GAAG,IAAI,aAAa,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","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\nimport { OrderedComparator, PriorityQueue } from \"@itwin/core-bentley\";\nimport { HalfEdge } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * * Combination of a priority queue of HalfEdges with\n * * Additional \"active\" array to carry edges that have been removed from the queue but are still to be\n *    inspected (possibly many times)\n * * The priority queue default sort is Y-then-X lexical sort.\n * * Caller has direct access to the queue and array.\n * * Methods are added here only to do things that involve both the queue and the array.\n * @internal\n */\nexport class HalfEdgePriorityQueueWithPartnerArray {\n  public priorityQueue: PriorityQueue<HalfEdge>;\n  public activeEdges: HalfEdge[];\n  public constructor(\n    compare: OrderedComparator<HalfEdge> = (a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b)) {\n    this.priorityQueue = new PriorityQueue(compare);\n    this.activeEdges = [];\n  }\n  /** Read a member from the queue and transfer to the active array. */\n  public popQueueToArray(): HalfEdge | undefined {\n    if (this.priorityQueue.isEmpty)\n      return undefined;\n    const x = this.priorityQueue.pop()!;\n    this.activeEdges.push(x);\n    return x;\n  }\n  /** Pop the last entry and put it back as replacement for current entry at index i.\n   * * Effectively remove active member at index i\n   * * The array order is changed.\n   * * constant time.\n   */\n  public popArrayToArrayIndex(i: number) {\n    const n = this.activeEdges.length;\n    if (i < n) {\n      const x = this.activeEdges.pop()!;\n      this.activeEdges[i] = x;\n    }\n  }\n  /**\n   * * Scan the active array.\n   * * remove edges whose top y is below y\n   * * (pack all remaining ones back towards the beginning)\n   */\n  public removeArrayMembersWithY1Below(y: number) {\n    let numKeep = 0;\n    const n = this.activeEdges.length;\n    for (let i = 0; i < n; i++) {\n      const q = this.activeEdges[i];\n      const yB = q.faceSuccessor.y;\n      if (yB >= y) {\n        // copy [i] forward to [target]\n        if (numKeep < i)\n          this.activeEdges[numKeep] = q;\n        numKeep++;\n      } else {\n        // let it go by !!!\n      }\n    }\n    this.activeEdges.length = numKeep;\n  }\n}\n"]}
+{"version":3,"file":"HalfEdgePriorityQueue.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAqB,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C;;;;;;;;GAQG;AACH,MAAM,OAAO,qCAAqC;IACzC,aAAa,CAA0B;IACvC,WAAW,CAAa;IAC/B,YACE,UAAuC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC;QACxF,IAAI,CAAC,aAAa,GAAG,IAAI,aAAa,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","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"]}

package/lib/esm/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,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAA2B,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AACrF,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C;;;GAGG;AACH,MAAM,CAAN,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,KAAtB,sBAAsB,QAejC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,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,aAAa,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD,kDAAkD;IAC3C,MAAM,CAAC,MAAM,CAAC,KAAoB,EAAE,YAAoB,QAAQ,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,YAAY,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,sBAAsB,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,sBAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,OAAO,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,WAAW,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,sBAAsB,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,YAAY,CAAC,QAAQ,CAAC;YACrH,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,OAAO,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,OAAO,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,UAAU,CAAC,sBAAsB,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACjF,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,eAAe,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,YAAY,CAAC,aAAa,CAAC;YAC1H,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,OAAO,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,OAAO,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,OAAO,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,UAAU,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,eAAe,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,YAAY,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,YAAY,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,YAAY,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,kBAAkB,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,YAAY,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,KAAK,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,sBAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,UAAU,GAAG,sBAAsB,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,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC9B,cAAc,CAAC,cAAc,EAAE,CAAC;wBAChC,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,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,iBAAiB,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,iBAAiB,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,iBAAiB,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,iBAAiB,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;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":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Geometry, PolygonLocation } from \"../Geometry\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { SmallSystem } from \"../numerics/SmallSystem\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { MarkedEdgeSet } from \"./HalfEdgeMarkSet\";\nimport { PointSearchContext, RayClassification } from \"./HalfEdgePointInGraphSearch\";\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\nimport { Triangulator } from \"./Triangulation\";\n\n/**\n * Options for setting the z-coordinate of a vertex in the triangulation when a point with the same xy is inserted.\n * @internal\n */\nexport enum InsertedVertexZOptions {\n  /** The point's z-coordinate is ignored, and the existing vertex's z-coordinate is unchanged. */\n  Ignore,\n  /** The point's z-coordinate replaces the existing vertex's z-coordinate. */\n  Replace,\n  /**\n   * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the\n   * point's z-coordinate is larger.\n   */\n  ReplaceIfLarger,\n  /**\n   * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the\n   * point's z-coordinate is smaller.\n   */\n  ReplaceIfSmaller,\n}\n\n/**\n * Context for repeated insertion of new points in a graph.\n * * Initial graph should have clean outer boundary (e.g., as typically marked with `HalfEdgeMask.EXTERIOR` and\n * `HalfEdgeMask.BOUNDARY_EDGE`).\n * * After each insertion, the current \"position\" within the graph is remembered so that each subsequent insertion\n * can reuse that position as start for walking to the new point.\n * @internal\n */\nexport class InsertAndRetriangulateContext {\n  private _graph: HalfEdgeGraph;\n  private _edgeSet: MarkedEdgeSet;\n  private _searcher: HalfEdgePositionDetail;\n  private _tolerance: number;\n\n  private constructor(graph: HalfEdgeGraph, tolerance: number) {\n    this._graph = graph;\n    this._edgeSet = MarkedEdgeSet.create(graph)!;\n    this._searcher = HalfEdgePositionDetail.create();\n    this._tolerance = tolerance;\n  }\n  /** Create a new context referencing the graph. */\n  public static create(graph: HalfEdgeGraph, tolerance: number = Geometry.smallMetricDistance) {\n    return new InsertAndRetriangulateContext(graph, tolerance);\n  }\n  /** Query the (pointer to) the graph in the context. */\n  public get graph(): HalfEdgeGraph {\n    return this._graph;\n  }\n  /**\n   * Walk face from edgeNode. Insert new edges back to start node from all except immediate successor and predecessor.\n   * Insert all new nodes and nodes of the existing face in edgeSet.\n   */\n  private retriangulateFromBaseVertex(centralNode: HalfEdge) {\n    const numNode = centralNode.countEdgesAroundFace();\n    if (numNode < 4 || centralNode.isMaskSet(HalfEdgeMask.EXTERIOR))\n      return;\n    this._edgeSet.addAroundFace(centralNode);\n    const numEdge = numNode - 3;\n    let farNode = centralNode.faceSuccessor;\n    let nearNode = centralNode;\n    for (let i = 0; i < numEdge; i++) {\n      farNode = farNode.faceSuccessor;\n      nearNode = this._graph.createEdgeHalfEdgeHalfEdge(nearNode, 0, farNode, 0);\n      farNode = nearNode.faceSuccessor;\n      this._edgeSet.addToSet(nearNode);\n    }\n  }\n  /** Reset the \"current\" position to unknown state. */\n  public reset() {\n    this._searcher = HalfEdgePositionDetail.create();\n  }\n  /** Return a (reference to!) the current position in the graph. */\n  public get currentPosition() {\n    return this._searcher;\n  }\n  /** Linear search for the nearest graph edge or vertex. */\n  public searchForNearestEdgeOrVertex(xyz: Point3d): HalfEdgePositionDetail {\n    const position = HalfEdgePositionDetail.create();\n    position.setDTag(Number.MAX_VALUE);\n    const xyzC = Point3d.create();\n    let fractionC;\n    let distanceC;\n    for (const nodeA of this._graph.allHalfEdges) {\n      const nodeB = nodeA.faceSuccessor;\n      fractionC = SmallSystem.lineSegment3dXYClosestPointUnbounded(nodeA, nodeB, xyz);\n      if (fractionC !== undefined) {\n        if (fractionC > 1.0) {\n          distanceC = xyz.distanceXY(nodeB);\n          if (distanceC < position.getDTag()!) {\n            position.resetAsVertex(nodeB);\n            position.setDTag(distanceC);\n          }\n        } else if (fractionC < 0.0) {\n          distanceC = xyz.distanceXY(nodeA);\n          if (distanceC < position.getDTag()!) {\n            position.resetAsVertex(nodeA);\n            position.setDTag(distanceC);\n          }\n        } else {\n          nodeA.fractionToPoint3d(fractionC, xyzC);\n\n          distanceC = xyz.distanceXY(xyzC);\n          if (distanceC < position.getDTag()!) {\n            position.resetAtEdgeAndFraction(nodeA, fractionC);\n          }\n        }\n      }\n    }\n    return position;\n  }\n  /** Linear search for the nearest graph vertex. */\n  public searchForNearestVertex(xyz: Point3d): HalfEdgePositionDetail {\n    const position = HalfEdgePositionDetail.create();\n    position.setDTag(Number.MAX_VALUE);\n    let distanceA;\n    for (const nodeA of this._graph.allHalfEdges) {\n      distanceA = xyz.distanceXY(nodeA);\n      if (distanceA < position.getDTag()!) {\n        position.resetAsVertex(nodeA);\n        position.setDTag(distanceA);\n      }\n    }\n    return position;\n  }\n  /**\n   * Reset the \"current\" position to a vertex nearest the target point.\n   * @param xyz target point\n   * @param searchEdgesToo reset to nearest vertex or edge\n  */\n  public resetSearch(xyz: Point3d, searchEdgesToo: boolean): void {\n    if (searchEdgesToo)\n      this._searcher = this.searchForNearestEdgeOrVertex(xyz);\n    else\n      this._searcher = this.searchForNearestVertex(xyz);\n  }\n  /** Reclassify the current interior face hit if it is too close to an edge of the face. */\n  private reclassifyFaceHit(point: Point3d): boolean {\n    if (undefined === this._searcher.node || !this._searcher.isFace || this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR))\n      return false;\n    const pointXY = Point3d.create(point.x, point.y);\n    const face = this._searcher.node.collectAroundFace((node: HalfEdge) => {\n      const xy = Point3d.create(node.x, node.y);\n      (xy as any).node = node; // decorate the point with the node\n      return xy;\n    });\n    const detail = PolygonOps.closestPointOnBoundary(face, pointXY, this._tolerance);\n    assert(detail.code === PolygonLocation.OnPolygonEdgeInterior);\n    if (detail.a > this._tolerance)\n      return false;\n    const edge = face[detail.closestEdgeIndex].node;\n    const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;\n    if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)\n      this._searcher.resetAsVertex(vertex);\n    else\n      this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);\n    return true;\n  }\n  /** Reclassify the current interior edge hit if it is too close to an edge of either adjacent face. */\n  private reclassifyEdgeHit(point: Point3d): boolean {\n    if (undefined === this._searcher.node || !this._searcher.isEdge || this._searcher.node.isMaskSet(HalfEdgeMask.BOUNDARY_EDGE))\n      return false;\n    const pointXY = Point3d.create(point.x, point.y);\n    const superFace: Point3d[] = [];\n    for (let n = this._searcher.node.faceSuccessor; n !== this._searcher.node; n = n.faceSuccessor) {\n      const xy = Point3d.create(n.x, n.y);\n      (xy as any).node = n; // decorate the point with a node of the left face\n      superFace.push(xy);\n    }\n    for (let n = this._searcher.node.vertexPredecessor; n !== this._searcher.node.edgeMate; n = n.faceSuccessor) {\n      const xy = Point3d.create(n.x, n.y);\n      (xy as any).node = n; // decorate the point with a node of the right face\n      superFace.push(xy);\n    }\n    const detail = PolygonOps.closestPointOnBoundary(superFace, pointXY, this._tolerance);\n    if (detail.a > this._tolerance)\n      return false;\n    const edge = (superFace[detail.closestEdgeIndex] as any).node;\n    const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;\n    if (detail.code === PolygonLocation.OnPolygonVertex) // can happen if superFace is non-concave (e.g., a dart)\n      this._searcher.resetAsVertex(vertex);\n    else if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)\n      this._searcher.resetAsVertex(vertex);\n    else\n      this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);\n    return true;\n  }\n  /**\n   * Given a point that was just inserted into the graph at the given node, apply the z-coordinate rule around\n   * the vertex loop.\n   */\n  private updateZAroundVertex(node: HalfEdge, point: Point3d, zOption: InsertedVertexZOptions): void {\n    if (InsertedVertexZOptions.Ignore === zOption)\n      return;\n    if ((InsertedVertexZOptions.ReplaceIfLarger === zOption) && (point.z <= node.z))\n      return;\n    if ((InsertedVertexZOptions.ReplaceIfSmaller === zOption) && (point.z >= node.z))\n      return;\n    // only replace z; preserving xy preserves convexity of the hull\n    node.setXYZAroundVertex(node.x, node.y, point.z);\n  }\n  /**\n   * Insert a new point into the graph and retriangulate.\n   * @param point the coordinates of the node to be inserted.\n   * @param newZWins rule governing when `point.z` should override the z-coordinate of an existing vertex with the\n   * same x and y.\n   * @returns true if and only if the point didn't need to be inserted or was successfully inserted.\n   */\n  public insertAndRetriangulate(point: Point3d, newZWins: InsertedVertexZOptions): boolean {\n    this.moveToPoint(this._searcher, point);\n    if (this._searcher.node === undefined)\n      return false;\n    // Try to avoid skinny triangles. If we iterated, this could get out of control (e.g., inserting point into a fan).\n    // Limiting to one reclassification ensures the hit doesn't move more than tol and reduces skinny triangles\n    // adjacent to the hull.\n    if (!this.reclassifyFaceHit(point))\n      this.reclassifyEdgeHit(point);\n    if (this._searcher.isFace) {\n      // insert point into the graph if it lies in an interior face\n      if (!this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR)) {\n        const newNode = this._graph.createEdgeXYZHalfEdge(point.x, point.y, point.z, 0, this._searcher.node, 0);\n        this.retriangulateFromBaseVertex(newNode);\n        Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\n        this._searcher.resetAsVertex(newNode);\n      }\n    } else if (this._searcher.isEdge) {\n      // insert point into the graph by splitting its containing edge\n      const newA = this._graph.splitEdgeAtFraction(this._searcher.node, this._searcher.edgeFraction!);\n      const newB = newA.vertexPredecessor;\n      this.updateZAroundVertex(newA, point, InsertedVertexZOptions.Replace);  // always replace\n      this.retriangulateFromBaseVertex(newA);\n      this.retriangulateFromBaseVertex(newB);\n      Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\n      this._searcher.resetAsVertex(newA);\n    } else if (this._searcher.isVertex) {\n      // no need to insert point as there's already a vertex there, but maybe update its z-coord\n      this.updateZAroundVertex(this._searcher.node, point, newZWins);\n    }\n    return true;\n  }\n  /**\n   * Advance movingPosition to a face, edge, or vertex position detail that contains `target`.\n   * @param movingPosition input seed for search, updated on return.\n   * @param target point to search for containing topology in the graph.\n   * @param announcer optional callback invoked during search loop; return false to end search.\n   * @returns true if search was successful.\n   */\n  public moveToPoint(\n    movingPosition: HalfEdgePositionDetail,\n    target: Point3d,\n    announcer?: (position: HalfEdgePositionDetail) => boolean,\n  ): boolean {\n    const psc = PointSearchContext.create(this._tolerance);\n    movingPosition.setITag(0);\n    if (movingPosition.isUnclassified) {\n      moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, HalfEdgeMask.NULL_MASK);\n      if (movingPosition.isUnclassified)\n        return false;\n    }\n    let trap = 0;\n    const ray = Ray3d.createXAxis();\n    for (; movingPosition.getITag() === 0 && trap < 2;) {\n      if (announcer !== undefined) {\n        const continueSearch = announcer(movingPosition);\n        if (!continueSearch)\n          break;\n      }\n      if (!psc.setSearchRay(movingPosition, target, ray)) {\n        return false;\n      } else if (movingPosition.isFace) {\n        const lastBefore = HalfEdgePositionDetail.create();\n        const firstAfter = HalfEdgePositionDetail.create();\n        const rc = psc.reAimAroundFace(movingPosition.node!, ray, ray.a!, lastBefore, firstAfter);\n        // reAimAroundFace returns lots of cases in `lastBefore`\n        switch (rc) {\n          case RayClassification.NoHits: {\n            movingPosition.resetAsUnknown();\n            break;\n          }\n          case RayClassification.TargetOnVertex: {\n            movingPosition.setFrom(lastBefore);\n            movingPosition.setITag(1);\n            break;\n          }\n          case RayClassification.TargetOnEdge: {\n            movingPosition.setFrom(lastBefore);\n            movingPosition.setITag(1);\n            break;\n          }\n          case RayClassification.Bracket: {\n            movingPosition.resetAsFace(lastBefore.node, target);\n            movingPosition.setITag(1);\n            break;\n          }\n          case RayClassification.TargetBefore: { // do we ever get here?\n            movingPosition.resetAsFace(movingPosition.node, target);\n            movingPosition.setITag(1);\n            break;\n          }\n          case RayClassification.TargetAfter: {\n            if (movingPosition.node === lastBefore.node\n              && movingPosition.isFace\n              && (lastBefore.isEdge || lastBefore.isVertex)) {\n              trap++;\n            } else {\n              trap = 0;\n            }\n            movingPosition.setFrom(lastBefore);\n            break;\n          }\n        }\n      } else if (movingPosition.isEdge) {\n        psc.reAimFromEdge(movingPosition, ray, ray.a!);\n        if (movingPosition.isUnclassified)\n          break;\n      } else if (movingPosition.isVertex) {\n        psc.reAimFromVertex(movingPosition, ray, ray.a!);\n        if (movingPosition.isUnclassified)\n          break;\n      }\n    }\n    if (movingPosition.isAtXY(target.x, target.y))\n      return true;\n    if (trap > 1) {\n      // ugh! We exited the loop by repeatedly hitting the same node with edge or vertex type in lastBefore.\n      // This happens only when the target point is exterior (heavy triangulation use cases start with a convex\n      // hull and only do interior intersections, so case only happens in contrived unit tests so far\n      // What to mark? Leave it as is, but mark as exterior target\n      if (movingPosition.node !== undefined) {\n        movingPosition.setIsExteriorTarget(true);\n      }\n      return false;\n    }\n    // murky here; should never be hit. Has never been hit in unit tests.\n    return false;\n  }\n}\n/** Set `position` to a random unmasked edge at the specified fraction. */\nfunction moveToAnyUnmaskedEdge(\n  graph: HalfEdgeGraph, position: HalfEdgePositionDetail, edgeFraction: number, skipMask: HalfEdgeMask,\n): boolean {\n  for (const candidate of graph.allHalfEdges) {\n    if (!candidate.isMaskSet(skipMask)) {\n      position.resetAtEdgeAndFraction(candidate, edgeFraction);\n      return true;\n    }\n  }\n  return false;\n}\n"]}
+{"version":3,"file":"InsertAndRetriangulateContext.js","sourceRoot":"","sources":["../../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAA2B,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AACrF,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C;;;GAGG;AACH,MAAM,CAAN,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,KAAtB,sBAAsB,QAejC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,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,aAAa,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD,kDAAkD;IAC3C,MAAM,CAAC,MAAM,CAAC,KAAoB,EAAE,YAAoB,QAAQ,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,YAAY,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,sBAAsB,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,sBAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,OAAO,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,WAAW,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,sBAAsB,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,YAAY,CAAC,QAAQ,CAAC;YACrH,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,OAAO,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,OAAO,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,UAAU,CAAC,sBAAsB,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACjF,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,eAAe,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,YAAY,CAAC,aAAa,CAAC;YAC1H,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,OAAO,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,OAAO,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,OAAO,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,UAAU,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,eAAe,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,YAAY,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,YAAY,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,YAAY,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,kBAAkB,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,YAAY,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,KAAK,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,sBAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,UAAU,GAAG,sBAAsB,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,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC9B,cAAc,CAAC,cAAc,EAAE,CAAC;wBAChC,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,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,iBAAiB,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,iBAAiB,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,iBAAiB,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,iBAAiB,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;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"]}

package/lib/esm/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,MAAM,OAAO,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","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n/**\n * Methods to \"grab and drop\" mask bits.\n * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.\n * * Callers borrow and return masks with \"grabMask\" and \"dropMask\".\n * * Callers must exercise grab/drop balance discipline.\n * @internal\n */\nexport class MaskManager {\n  private _freeMasks: number;\n  private _originalFreeMasks: number;\n  private _firstFreeMask: number;\n  /**\n   * Constructor\n   * @param freeMasks caller-defined block of bits that are to be managed.\n   * @param firstFreeMask the first free mask in the freeMasks bits block.\n   */\n  private constructor(freeMasks: number, firstFreeMask: number) {\n    this._freeMasks = freeMasks;\n    this._originalFreeMasks = freeMasks;\n    this._firstFreeMask = firstFreeMask;\n  }\n  /**\n   * Create a MaskManager.\n   * Typical use: MaskManager.create(0xFFFF0000)\n   * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.\n   */\n  public static create(freeMasks: number): MaskManager | undefined {\n    // look for first bit up to bit 31\n    let firstFree = 0;\n    let testBit = 0x01;\n    for (let i = 0; i < 32; i++) {\n      if ((testBit & freeMasks) !== 0) {\n        firstFree = testBit;\n        break;\n      }\n      testBit = (testBit << 1);\n    }\n    if (firstFree === 0)\n      return undefined;\n    return new MaskManager(freeMasks, firstFree);\n  }\n  /** Find a mask bit that is not \"in use\" in order to borrow that mask. */\n  public grabMask(): number {\n    if (this._freeMasks === 0)\n      return 0;\n    let mask = this._firstFreeMask;\n    while (!(mask & this._freeMasks))\n      mask = mask << 1;\n    this._freeMasks &= ~mask;\n    return mask;\n  }\n  /** Return the borrowed mask so it is not \"in use\" anymore. */\n  public dropMask(mask: number) {\n    mask &= this._originalFreeMasks; // prevent \"drop\" of mask that is not in the pool.\n    this._freeMasks |= mask;\n  }\n}\n"]}
+{"version":3,"file":"MaskManager.js","sourceRoot":"","sources":["../../../src/topology/MaskManager.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH;;;;;;GAMG;AACH,MAAM,OAAO,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","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"]}

package/lib/esm/topology/Merging.d.ts

@@ -1,6 +1,6 @@
 import { LineSegment3d } from "../curve/LineSegment3d";
 import { MultiLineStringDataVariant } from "../geometry3d/IndexedXYZCollection";
-import { Range3d } from "../geometry3d/Range";
+import { Range2d, Range3d } from "../geometry3d/Range";
 import { ClusterableArray } from "../numerics/ClusterableArray";
 import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "./Graph";
 export declare class GraphSplitData {
@@ -39,7 +39,10 @@ export declare class HalfEdgeGraphOps {
      * @param targetB target vertex of second vector
      */
     static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number;
-    static graphRange(graph: HalfEdgeGraph): Range3d;
+    /** Compute the range of the graph's vertices. */
+    static graphRange(graph: Readonly<HalfEdgeGraph>): Range3d;
+    /** Compute the xy-range of the graph's vertices. */
+    static graphRangeXY(graph: Readonly<HalfEdgeGraph>): Range2d;
     /** Returns an array of all nodes (both ends) of edges created from segments. */
     static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[];
     /**
@@ -122,7 +125,7 @@ export declare class HalfEdgeGraphMerge {
      * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.
      * * Mask.NULL_FACE is cleared throughout and applied within null faces.
      */
-    static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number): void;
+    static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number, clusterTol?: number): void;
     private static buildVerticalSweepPriorityQueue;
     private static computeIntersectionFractionsOnEdges;
     /**
@@ -130,7 +133,7 @@ export declare class HalfEdgeGraphMerge {
      * * This is a large operation.
      * @param graph
      */
-    static splitIntersectingEdges(graph: HalfEdgeGraph): GraphSplitData;
+    static splitIntersectingEdges(graph: HalfEdgeGraph, distanceTol?: number, fractionTol?: number): GraphSplitData;
     /**
      * Returns a graph structure formed from the given LineSegment array
      *

package/lib/esm/topology/Merging.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Merging.d.ts","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAChF,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAEhE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAOhE,qBAAa,cAAc;IAClB,SAAS,SAAK;IACd,mBAAmB,SAAK;IACxB,QAAQ,SAAK;IACb,SAAS,SAAK;IACd,OAAO,SAAK;IACZ,OAAO,SAAK;;CAGpB;AACD;;GAEG;AACH,qBAAa,0BAA0B;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,iBAAiB,EAAE,MAAM,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;gBACL,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,MAAM;CAMhF;AAED,8EAA8E;AAC9E,MAAM,MAAM,kCAAkC,GAAG,CAAC,IAAI,EAAE,0BAA0B,EAAE,KAAK,GAAG,CAAC;AAC7F;;;GAGG;AACH,qBAAa,gBAAgB;IAE3B,iFAAiF;WACnE,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ;IAgBvD,mIAAmI;WACrH,UAAU,CAAC,KAAK,EAAE,QAAQ;IAQxC;;;;OAIG;WACW,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;WAOnF,UAAU,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAOvD,gFAAgF;WAClE,wBAAwB,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,QAAQ,EAAE;IAwB7H;;;;;OAKG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa;IAMlD;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAmB7C;;;;;;;;OAQG;WACW,qCAAqC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,GAAE,YAAyC,GAAG,MAAM;IAqBzJ;;;;;;;OAOG;WACW,wCAAwC,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,GAAE,YAAyC,GAAG,QAAQ,EAAE,GAAG,SAAS;IAiBxJ;;;;;;;OAOG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,GAAE,YAAyC,GAAG,MAAM;IAWjH;;;;;OAKG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,GAAE,YAAoC,GAAG,OAAO;CAU5G;AAED;;;GAGG;AACH,qBAAa,kBAAkB;WAIf,sBAAsB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;IAYpH,OAAO,CAAC,MAAM,CAAC,mCAAmC,CAAC,CAAqC;IACxF;;OAEG;IACH,WAAkB,kCAAkC,CAAC,IAAI,EAAE,kCAAkC,GAAG,SAAS,EAAsD;IAC/J,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAqB3C,OAAO,CAAC,MAAM,CAAC,yBAAyB;IAqBxC;;;OAGG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IActD,4FAA4F;WAC9E,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAGjD;;;;;;;OAOG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,KAAK,MAAM;IA8H7G,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAW9C,OAAO,CAAC,MAAM,CAAC,mCAAmC;IAkClD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,GAAG,cAAc;IA6C1E;;;;;;;;OAQG;WACW,qBAAqB,CAAC,YAAY,EAAE,aAAa,EAAE,GAAG,aAAa;IASjF;;;;OAIG;WACW,mBAAmB,CAAC,MAAM,EAAE,0BAA0B,EAAE,UAAU,GAAE,OAAc,EAAE,IAAI,GAAE,YAAwC,GAAG,aAAa,GAAG,SAAS;CAiB7K"}
+{"version":3,"file":"Merging.d.ts","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAChF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAEhE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAOhE,qBAAa,cAAc;IAClB,SAAS,SAAK;IACd,mBAAmB,SAAK;IACxB,QAAQ,SAAK;IACb,SAAS,SAAK;IACd,OAAO,SAAK;IACZ,OAAO,SAAK;;CAGpB;AACD;;GAEG;AACH,qBAAa,0BAA0B;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,iBAAiB,EAAE,MAAM,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;gBACL,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,MAAM;CAMhF;AAED,8EAA8E;AAC9E,MAAM,MAAM,kCAAkC,GAAG,CAAC,IAAI,EAAE,0BAA0B,EAAE,KAAK,GAAG,CAAC;AAC7F;;;GAGG;AACH,qBAAa,gBAAgB;IAE3B,iFAAiF;WACnE,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ;IAgBvD,mIAAmI;WACrH,UAAU,CAAC,KAAK,EAAE,QAAQ;IAQxC;;;;OAIG;WACW,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;IAIjG,iDAAiD;WACnC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC,GAAG,OAAO;IAOjE,oDAAoD;WACtC,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC,GAAG,OAAO;IAQnE,gFAAgF;WAClE,wBAAwB,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,QAAQ,EAAE;IAwB7H;;;;;OAKG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa;IAMlD;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAmB7C;;;;;;;;OAQG;WACW,qCAAqC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,GAAE,YAAyC,GAAG,MAAM;IAqBzJ;;;;;;;OAOG;WACW,wCAAwC,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,GAAE,YAAyC,GAAG,QAAQ,EAAE,GAAG,SAAS;IAiBxJ;;;;;;;OAOG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,GAAE,YAAyC,GAAG,MAAM;IAWjH;;;;;OAKG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,GAAE,YAAoC,GAAG,OAAO;CAU5G;AAED;;;GAGG;AACH,qBAAa,kBAAkB;WAIf,sBAAsB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;IAYpH,OAAO,CAAC,MAAM,CAAC,mCAAmC,CAAC,CAAqC;IACxF;;OAEG;IACH,WAAkB,kCAAkC,CAAC,IAAI,EAAE,kCAAkC,GAAG,SAAS,EAAsD;IAC/J,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAqB3C,OAAO,CAAC,MAAM,CAAC,yBAAyB;IAqBxC;;;OAGG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IActD,4FAA4F;WAC9E,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAGjD;;;;;;;OAOG;WACW,sBAAsB,CAClC,KAAK,EAAE,aAAa,EACpB,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,KAAK,MAAM,EAClD,UAAU,GAAE,MAAqC;IA8HnD,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAW9C,OAAO,CAAC,MAAM,CAAC,mCAAmC;IAkClD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,WAAW,GAAE,MAAqC,EAAE,WAAW,GAAE,MAAe,GAAG,cAAc;IA4C5J;;;;;;;;OAQG;WACW,qBAAqB,CAAC,YAAY,EAAE,aAAa,EAAE,GAAG,aAAa;IASjF;;;;OAIG;WACW,mBAAmB,CAAC,MAAM,EAAE,0BAA0B,EAAE,UAAU,GAAE,OAAc,EAAE,IAAI,GAAE,YAAwC,GAAG,aAAa,GAAG,SAAS;CAiB7K"}

package/lib/esm/topology/Merging.js

@@ -9,7 +9,7 @@ import { assert } from "@itwin/core-bentley";
 import { LineSegment3d } from "../curve/LineSegment3d";
 import { Geometry } from "../Geometry";
 import { Angle } from "../geometry3d/Angle";
-import { Range3d } from "../geometry3d/Range";
+import { Range2d, Range3d } from "../geometry3d/Range";
 import { ClusterableArray } from "../numerics/ClusterableArray";
 import { SmallSystem } from "../numerics/SmallSystem";
 import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "./Graph";
@@ -79,8 +79,7 @@ export class HalfEdgeGraphOps {
     static crossProductToTargets(base, targetA, targetB) {
         return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);
     }
-    // ---------------------------------------------------------------------------------------------------------------------
-    // ----------------------------------------------------------------------------------------------------------------------
+    /** Compute the range of the graph's vertices. */
     static graphRange(graph) {
         const range = Range3d.create();
         for (const node of graph.allHalfEdges) {
@@ -88,6 +87,14 @@ export class HalfEdgeGraphOps {
         }
         return range;
     }
+    /** Compute the xy-range of the graph's vertices. */
+    static graphRangeXY(graph) {
+        const range = Range2d.createNull();
+        for (const node of graph.allHalfEdges) {
+            range.extendXY(node.x, node.y);
+        }
+        return range;
+    }
     /** Returns an array of all nodes (both ends) of edges created from segments. */
     static segmentArrayToGraphEdges(segments, returnGraph, mask) {
         const result = [];
@@ -326,7 +333,7 @@ export class HalfEdgeGraphMerge {
      * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.
      * * Mask.NULL_FACE is cleared throughout and applied within null faces.
      */
-    static clusterAndMergeXYTheta(graph, outboundRadiansFunction) {
+    static clusterAndMergeXYTheta(graph, outboundRadiansFunction, clusterTol = Geometry.smallMetricDistance) {
         const allNodes = graph.allHalfEdges;
         const numNodes = allNodes.length;
         graph.clearMask(HalfEdgeMask.NULL_FACE);
@@ -338,7 +345,6 @@ export class HalfEdgeGraphMerge {
             HalfEdge.pinch(nodeA, nodeA.vertexSuccessor); // pull it out of its current vertex loop.
             clusters.addDirect(xA, yA, 0.0, i);
         }
-        const clusterTol = Geometry.smallMetricDistance;
         const order = clusters.clusterIndicesLexical(clusterTol);
         let k0 = 0;
         const numK = order.length;
@@ -499,32 +505,31 @@ export class HalfEdgeGraphMerge {
      * * This is a large operation.
      * @param graph
      */
-    static splitIntersectingEdges(graph) {
+    static splitIntersectingEdges(graph, distanceTol = Geometry.smallMetricDistance, fractionTol = 1.0e-8) {
         const data = new GraphSplitData();
         const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);
         let nodeA0, nodeB1;
-        const smallFraction = 1.0e-8;
+        const smallFraction = fractionTol;
         const largeFraction = 1.0 - smallFraction;
         let i;
         let nodeB0;
-        const distTol = Geometry.smallMetricDistance;
         while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {
             data.numUpEdge++;
             const n0 = sweepHeap.activeEdges.length;
-            sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - distTol);
+            sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - distanceTol);
             data.numPopOut += n0 - sweepHeap.activeEdges.length;
             for (i = 0; i < sweepHeap.activeEdges.length; i++) {
                 nodeB0 = sweepHeap.activeEdges[i];
                 nodeB1 = nodeB0.faceSuccessor;
-                if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y, distTol)) {
+                if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y, distanceTol)) {
                     data.numA0B0++;
                 }
-                else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y, distTol)) {
+                else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y, distanceTol)) {
                     data.numA0B1++;
                 }
                 else {
                     data.numIntersectionTest++;
-                    const fractions = this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, distTol);
+                    const fractions = this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, distanceTol);
                     if (fractions) {
                         const splitAndPush = (node, fraction) => {
                             if (fraction !== undefined && fraction > smallFraction && fraction < largeFraction) {

package/lib/esm/topology/Merging.js.map

@@ -1 +1 @@
-{"version":3,"file":"Merging.js","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,qCAAqC,EAAE,MAAM,yBAAyB,CAAC;AAChF,OAAO,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,mBAAmB;AAEnB,MAAM,OAAO,cAAc;IAClB,SAAS,GAAG,CAAC,CAAC;IACd,mBAAmB,GAAG,CAAC,CAAC;IACxB,QAAQ,GAAG,CAAC,CAAC;IACb,SAAS,GAAG,CAAC,CAAC;IACd,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC,CAAC;IACnB;IACA,CAAC;CACF;AACD;;GAEG;AACH,MAAM,OAAO,0BAA0B;IAC9B,KAAK,CAAS;IACd,iBAAiB,CAAS;IAC1B,IAAI,CAAW;IACf,OAAO,CAAU;IACxB,YAAmB,KAAa,EAAE,GAAW,EAAE,IAAc,EAAE,OAAgB;QAC7E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,GAAG,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAID;;;GAGG;AACH,MAAM,OAAO,gBAAgB;IAE3B,iFAAiF;IAC1E,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QACrD,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mIAAmI;IAC5H,MAAM,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACvC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAc,EAAE,OAAiB,EAAE,OAAiB;QACtF,OAAO,QAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,wHAAwH;IACxH,yHAAyH;IAElH,MAAM,CAAC,UAAU,CAAC,KAAoB;QAC3C,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gFAAgF;IACzE,MAAM,CAAC,wBAAwB,CAAC,QAAyB,EAAE,WAA0B,EAAE,IAAkB;QAC9G,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,kFAAkF;QAClF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAE/B,MAAM,KAAK,GAAG,WAAW,CAAC,gBAAgB,CACxC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,EACV,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,GAAG,CAAC,CAAC,CAAC;YAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC7B,UAAU,IAAI,CAAC,CAAC;YAEhB,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAG,sDAAsD;YACvF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,MAAoB,EAAE,OAAqB,EAAE,gBAAwB,CAAC;QAClI,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,8DAA8D;YACjE,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC;QAC1B,CAAC,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,2DAA2D;YAC9D,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,iBAAiB,CAAC;QAC5B,CAAC,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,OAAO,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB,YAAY,CAAC,aAAa;QAC9I,IAAI,YAAY,CAAC,SAAS,KAAK,IAAI;YACjC,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClE,gFAAgF;oBAChF,MAAM,aAAa,GAAG,QAAQ,CAAC,0BAA0B,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;oBACrH,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;wBAChK,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBAC7B,EAAE,SAAS,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,wCAAwC,CAAC,KAAoB,EAAE,UAAwB,YAAY,CAAC,aAAa;QAC7H,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YACzE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,UAAwB,YAAY,CAAC,aAAa;QACtG,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACzF,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,GAAG,GAAG,KAAK,CAAC,kBAAkB,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9F,MAAM,CAAC,cAAc,KAAK,eAAe,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,QAAsB,YAAY,CAAC,QAAQ;QAC/F,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAChC,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACtB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IAC7B,uEAAuE;IACvE,uDAAuD;IACvD,+EAA+E;IACxE,MAAM,CAAC,sBAAsB,CAAC,QAA0B,EAAE,KAAkB,EAAE,EAAU,EAAE,EAAU;QACzG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gBAChE,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACO,MAAM,CAAC,mCAAmC,CAAsC;IACxF;;OAEG;IACI,MAAM,KAAK,kCAAkC,CAAC,IAAoD,IAAI,IAAI,CAAC,mCAAmC,GAAG,IAAI,CAAC,CAAC,CAAC;IACvJ,MAAM,CAAC,4BAA4B,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACtI,IAAI,IAAI,CAAC,mCAAmC,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAiC,EAAE,CAAC;YAClD,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YACvF,CAAC;YACD,IAAI,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;QACrD,CAAC;IAEH,CAAC;IACD,mCAAmC;IACnC,yCAAyC;IACzC,gDAAgD;IAChD,6DAA6D;IAC7D,mCAAmC;IACnC,iCAAiC;IACzB,MAAM,CAAC,yBAAyB,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACnI,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAElD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;gBACf,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;oBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC;gBACjF,CAAC;gBACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAA6B,EAAE,CAA6B,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;gBAC7H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAAc;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,OAA8B,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,MAAM,GAAG,KAAK,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;gBACjE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;oBAClD,MAAM,GAAG,CAAC,MAAM,CAAC;gBACnB,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,4FAA4F;IACrF,MAAM,CAAC,UAAU,CAAC,IAAc;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC;IACrJ,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB,EAAE,uBAAkD;QAC3G,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,yEAAyE;QACjI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAE,0CAA0C;YACzF,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,UAAU,GAAG,QAAQ,CAAC,mBAAmB,CAAC;QAChD,MAAM,KAAK,GAAG,QAAQ,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACzD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,sFAAsF;gBACtF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACnB,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE,CAAC;YACtC,IAAI,iBAAiB,KAAK,gBAAgB,CAAC,iBAAiB,EAAE,CAAC;gBAC7D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,qBAAqB,GAAG,uBAAuB,CAAC;gBACpD,IAAI,qBAAqB,EAAE,CAAC;oBAC1B,4HAA4H;oBAC5H,MAAM,MAAM,GAAG,KAAK,CAAC,OAA8B,CAAC;oBACpD,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,YAAY,aAAa;wBAC7F,qBAAqB,GAAG,SAAS,CAAC;gBACtC,CAAC;gBACD,IAAI,OAAO,GAAG,qBAAqB,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtH,IAAI,KAAK,CAAC,oCAAoC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/D,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,sBAAsB,GAAe,EAAE,CAAC;QAC9C,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,uDAAuD;QAEvD,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,kFAAkF;gBAClF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,6CAA6C;oBAC7C,+DAA+D;oBAC/D,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;wBACb,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrE,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,MAAM,CAAC;oBACnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,IAAI,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC5C,8DAA8D;4BAC9D,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BACnD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,6FAA6F;wBAC/F,CAAC;6BAAM,CAAC;4BACN,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAE7B,wCAAwC;4BACxC,wDAAwD;4BACxD,6CAA6C;4BAC7C,kDAAkD;4BAClD,8CAA8C;4BAC9C,IAAI,KAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gCAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;oCAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,IAAI,QAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAE,kBAAkB;wCACtE,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;wCAC/B,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;wCACtC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;wCACvC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oCACtC,CAAC;gCACH,CAAC;4BACH,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,+BAA+B,CAAC,KAAoB;QACjE,MAAM,SAAS,GAAG,IAAI,qCAAqC,EAAE,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YAEnC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,MAAM,CAAC,mCAAmC,CAAC,MAAgB,EAAE,MAAgB,EAAE,MAAc,QAAQ,CAAC,mBAAmB;QAC/H,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;QAChE,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;QAChE,IAAI,SAAS,GAAG,WAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAClG,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,qBAAqB,GAAG,CAAC,QAAgB,EAAE,QAAe,EAAE,MAAa,EAAU,EAAE;gBACzF,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,QAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC;oBAChE,OAAO,GAAG,CAAC;gBACb,IAAI,QAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC5D,OAAO,GAAG,CAAC;gBACb,OAAO,QAAQ,CAAC;YAClB,CAAC,CAAC;YACF,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvE,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;gBACjB,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBACvE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACzE,CAAC;YACD,IAAI,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACvF,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,kEAAkE;YAC9F,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1E,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;oBACjB,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,oEAAoE;oBACjG,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC;gBAC3B,CAAC;;oBACC,SAAS,GAAG,SAAS,CAAC,CAAC,gDAAgD;YAC3E,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB;QACvD,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,aAAa,GAAG,MAAM,CAAC;QAC7B,MAAM,aAAa,GAAG,GAAG,GAAG,aAAa,CAAC;QAC1C,IAAI,CAAC,CAAC;QACN,IAAI,MAAM,CAAC;QACX,MAAM,OAAO,GAAG,QAAQ,CAAC,mBAAmB,CAAC;QAC7C,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;YAC9D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,SAAS,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;YAC5D,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;gBAC9B,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;oBACjF,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC;oBACxF,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;oBACpF,IAAI,SAAS,EAAE,CAAC;wBACd,MAAM,YAAY,GAAG,CAAC,IAAc,EAAE,QAAiB,EAAQ,EAAE;4BAC/D,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,aAAa,IAAI,QAAQ,GAAG,aAAa,EAAE,CAAC;gCACnF,MAAM,OAAO,GAAG,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gCAC1D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,mCAAmC;gCAC3E,IAAI,CAAC,QAAQ,EAAE,CAAC;4BAClB,CAAC;wBACH,CAAC,CAAC;wBACF,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBACrC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACtC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBACrC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACtC,0EAA0E;oBAC5E,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qBAAqB,CAAC,YAA6B;QAC/D,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,gBAAgB,CAAC,wBAAwB,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,CAAC,aAAa,CAAC,CAAC;QAC3F,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAkC,EAAE,aAAsB,IAAI,EAAE,OAAqB,YAAY,CAAC,YAAY;QAC9I,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,YAAY,CAAC,iCAAiC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,KAAK,MAAM,IAAI,IAAI,UAAU;YAC3B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\nimport { SmallSystem } from \"../numerics/SmallSystem\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgePriorityQueueWithPartnerArray } from \"./HalfEdgePriorityQueue\";\nimport { RegularizationContext } from \"./RegularizeFace\";\nimport { Triangulator } from \"./Triangulation\";\n\n// cspell:word XYUV\n\nexport class GraphSplitData {\n  public numUpEdge = 0;\n  public numIntersectionTest = 0;\n  public numSplit = 0;\n  public numPopOut = 0;\n  public numA0B0 = 0;\n  public numA0B1 = 0;\n  public constructor() {\n  }\n}\n/**\n * Structure for data used when sorting outbound edges \"around a node\"\n */\nexport class VertexNeighborhoodSortData {\n  public index: number;\n  public radiusOfCurvature: number;\n  public node: HalfEdge;\n  public radians?: number;\n  public constructor(index: number, key: number, node: HalfEdge, radians?: number) {\n    this.index = index;\n    this.radiusOfCurvature = key;\n    this.node = node;\n    this.radians = radians;\n  }\n}\n\n/** Function signature for announcing a vertex neighborhood during sorting. */\nexport type AnnounceVertexNeighborhoodSortData = (data: VertexNeighborhoodSortData[]) => any;\n/**\n * * Assorted methods used in algorithms on HalfEdgeGraph.\n * @internal\n */\nexport class HalfEdgeGraphOps {\n\n  /** Compare function for sorting with primary y compare, secondary  x compare. */\n  public static compareNodesYXUp(a: HalfEdge, b: HalfEdge) {\n    // Check y's\n    // if (!Geometry.isSameCoordinate(a.y, b.y))\n    if (a.y < b.y)\n      return -1;\n    else if (a.y > b.y)\n      return 1;\n    // Check x's\n    // if (!Geometry.isSameCoordinate(a.x, b.x))\n    if (a.x < b.x)\n      return -1;\n    else if (a.x > b.x)\n      return 1;\n    return 0;\n  }\n\n  /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */\n  public static isDownPeak(nodeB: HalfEdge) {\n    const nodeA = nodeB.facePredecessor;\n    const nodeC = nodeB.faceSuccessor;\n    return this.compareNodesYXUp(nodeB, nodeA) < 0\n      && this.compareNodesYXUp(nodeB, nodeC) < 0\n      && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;\n  }\n\n  /** return the cross product of vectors from base to targetA and base to targetB\n   * @param base base vertex of both vectors.\n   * @param targetA target vertex of first vector\n   * @param targetB target vertex of second vector\n   */\n  public static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number {\n    return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);\n  }\n\n  // ---------------------------------------------------------------------------------------------------------------------\n  // ----------------------------------------------------------------------------------------------------------------------\n\n  public static graphRange(graph: HalfEdgeGraph): Range3d {\n    const range = Range3d.create();\n    for (const node of graph.allHalfEdges) {\n      range.extendXYZ(node.x, node.y, node.z);\n    }\n    return range;\n  }\n  /** Returns an array of all nodes (both ends) of edges created from segments. */\n  public static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[] {\n    const result = [];\n    let idxCounter = 0;\n\n    // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}\n    for (const segment of segments) {\n\n      const node0 = returnGraph.createEdgeXYZXYZ(\n        segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z,\n        idxCounter,\n        segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z,\n        idxCounter + 1);\n\n      const node1 = node0.edgeMate;\n      idxCounter += 2;\n\n      node0.setMaskAroundFace(mask);   // Original given coordinates must be part of boundary\n      result.push(node0);\n      result.push(node1);\n    }\n\n    return result;\n  }\n\n  /**\n   * * Visit all nodes in `graph`.\n   * * invoke `pinch(node, vertexPredecessor)`\n   * * this leaves the graph as isolated edges.\n   * @param graph graph to modify\n   */\n  public static isolateAllEdges(graph: HalfEdgeGraph) {\n    for (const nodeA of graph.allHalfEdges) {\n      const nodeB = nodeA.vertexPredecessor;\n      HalfEdge.pinch(nodeA, nodeB);\n    }\n  }\n  /**\n   * Compute convexity of a sector of a super-face.\n   * @param base node whose edge is to be tested for removal\n   * @param ignore edges with this mask (on either side) are ignored for the purposes of computing convexity\n   * @param barrier edges with this mask (on either side) will not be removed\n   * @param signedAreaTol optional signed area tolerance to use in test for parallel vectors\n   * @return whether removing the edge at base would create a convex sector in the super-face\n   */\n  private static isSectorConvexAfterEdgeRemoval(base: HalfEdge, ignore: HalfEdgeMask, barrier: HalfEdgeMask, signedAreaTol: number = 0): boolean {\n    let vs = base;\n    do { // loop ccw around vertex looking for a super-face predecessor\n      if (vs.isMaskSet(barrier) || vs.edgeMate.isMaskSet(barrier))\n        break;\n      vs = vs.vertexSuccessor;\n    } while (vs !== base && vs.isMaskSet(ignore));\n    if (vs === base)\n      return false;\n    let vp = base;\n    do { // loop cw around vertex looking for a super-face successor\n      if (vp.isMaskSet(barrier) || vp.edgeMate.isMaskSet(barrier))\n        break;\n      vp = vp.vertexPredecessor;\n    } while (vp !== base && vp.isMaskSet(ignore));\n    if (vp === base)\n      return false;\n    return HalfEdge.isSectorConvex(vs.edgeMate, base, vp.faceSuccessor, signedAreaTol);\n  }\n  /**\n   * Mask edges between faces if the union of the faces is convex.\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\n   * Best results when input faces are convex.\n   * @param graph graph to examine and mark\n   * @param mark the mask used to mark (both sides of) removable edges\n   * @param barrier edges with this mask (on either side) will not be marked. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\n   * @return number of edges masked (half the number of HalfEdges masked)\n   */\n  public static markRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, mark: HalfEdgeMask, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\n    if (HalfEdgeMask.NULL_MASK === mark)\n      return 0;\n    const visit = graph.grabMask(true);\n    let numMarked = 0;\n    for (const node of graph.allHalfEdges) {\n      if (!node.isMaskSet(visit)) {\n        if (!node.isMaskSet(barrier) && !node.edgeMate.isMaskSet(barrier)) {\n          // tol based on areas of *original* faces on each side of the edge to be removed\n          const signedAreaTol = Geometry.smallMetricDistanceSquared * (node.signedFaceArea() + node.edgeMate.signedFaceArea());\n          if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier, signedAreaTol) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier, signedAreaTol)) {\n            node.setMaskAroundEdge(mark);\n            ++numMarked;\n          }\n        }\n      }\n      node.setMaskAroundEdge(visit);\n    }\n    graph.dropMask(visit);\n    return numMarked;\n  }\n  /**\n   * Collect edges between faces if the union of the faces is convex.\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\n   * Best results when input faces are convex.\n   * @param graph graph to examine\n   * @param barrier edges with this mask (on either side) will not be collected. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\n   * @return one HalfEdge per removable edge\n   */\n  public static collectRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): HalfEdge[] | undefined {\n    const removable: HalfEdge[] = [];\n    const mark = graph.grabMask(true);\n    if (0 < this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier)) {\n      const visited = graph.grabMask(true);\n      for (const node of graph.allHalfEdges) {\n        if (node.isMaskSet(mark) && !node.isMaskSet(visited)) {\n          node.setMaskAroundEdge(visited);\n          removable.push(node);\n        }\n      }\n      graph.dropMask(visited);\n    }\n    graph.dropMask(mark);\n    return removable;\n  }\n\n  /**\n   * Remove edges between faces if the union of the faces is convex.\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\n   * Best results when input faces are convex.\n   * @param graph graph to modify\n   * @param barrier edges with this mask (on either side) will not be removed. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\n   * @return number of edges deleted\n   */\n  public static expandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\n    const mark = graph.grabMask(true);\n    const numRemovedEdges = this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier);\n    if (numRemovedEdges > 0) {\n      const numYankedEdges = 0.5 * graph.yankAndDeleteEdges((node: HalfEdge) => node.getMask(mark));\n      assert(numYankedEdges === numRemovedEdges);\n    }\n    graph.dropMask(mark);\n    return numRemovedEdges;\n  }\n\n  /**\n   * Test desired faces for convexity.\n   * @param graph graph to examine\n   * @param avoid faces with this mask will not be examined. Defaults to HalfEdgeMask.EXTERIOR.\n   * @return whether every face in the graph is convex\n   */\n  public static isEveryFaceConvex(graph: HalfEdgeGraph, avoid: HalfEdgeMask = HalfEdgeMask.EXTERIOR): boolean {\n    const allFaces = graph.collectFaceLoops();\n    for (const node of allFaces) {\n      if (node.isMaskedAroundFace(avoid))\n        continue;\n      if (!node.isFaceConvex())\n        return false;\n    }\n    return true;\n  }\n}\n\n/**\n * Note: this class uses hardcoded micrometer coordinate/cluster tolerance throughout.\n * @internal\n */\nexport class HalfEdgeGraphMerge {\n  // return kC such that all angles k are equal, with kA <= k < kC <= kB.\n  // * Assume: angles k are stored at extra data index 0.\n  // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC\n  public static getCommonThetaEndIndex(clusters: ClusterableArray, order: Uint32Array, kA: number, kB: number): number {\n    let kC = kA + 1;\n    const thetaA = clusters.getExtraData(order[kA], 0);\n    while (kC < kB) {\n      const thetaB = clusters.getExtraData(order[kC], 0);\n      if (!Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\n        return kC;\n      }\n      kC++;\n    }\n    return kC;\n  }\n  private static _announceVertexNeighborhoodFunction?: AnnounceVertexNeighborhoodSortData;\n  /**\n   * public property setter for a function to be called with sorted edge data around a vertex.\n   */\n  public static set announceVertexNeighborhoodFunction(func: AnnounceVertexNeighborhoodSortData | undefined) { this._announceVertexNeighborhoodFunction = func; }\n  private static doAnnounceVertexNeighborhood(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\n    if (this._announceVertexNeighborhoodFunction) {\n      const sortData: VertexNeighborhoodSortData[] = [];\n      // build and share the entire vertex order\n      for (let k = k0; k < k1; k++) {\n        const index = clusters.getExtraData(order[k], 1);\n        const theta = clusters.getExtraData(order[k], 0);\n        const node = allNodes[index];\n        const signedDistance = this.curvatureSortKey(node);\n        sortData.push(new VertexNeighborhoodSortData(order[k], signedDistance, node, theta));\n      }\n      this._announceVertexNeighborhoodFunction(sortData);\n    }\n\n  }\n  // assumptions about cluster array:\n  //   * data order is: x,y,theta,nodeIndex\n  //   * theta and nodeIndex are the \"extra\" data.\n  //   * only want to do anything here when curves are present.\n  //   * k0<=k<k1 are around a vertex\n  //   * These are sorted by theta.\n  private static secondarySortAroundVertex(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\n    const sortData: VertexNeighborhoodSortData[] = [];\n\n    for (let k = k0; k < k1;) {\n      const kB = this.getCommonThetaEndIndex(clusters, order, k, k1);\n      if (k + 1 < kB) {\n        sortData.length = 0;\n        for (let kA = k; kA < kB; kA++) {\n          const index = clusters.getExtraData(order[kA], 1);\n          const node = allNodes[index];\n          const signedDistance = this.curvatureSortKey(node);\n          sortData.push(new VertexNeighborhoodSortData(order[kA], signedDistance, node));\n        }\n        sortData.sort((a: VertexNeighborhoodSortData, b: VertexNeighborhoodSortData) => (a.radiusOfCurvature - b.radiusOfCurvature));\n        for (let i = 0; i < sortData.length; i++) {\n          order[k + i] = sortData[i].index;\n        }\n      }\n      k = kB;\n    }\n  }\n  /** Return the sort key for sorting by curvature.\n   * * This is the signed distance from the curve at the edge start, to center of curvature.\n   * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.\n   */\n  public static curvatureSortKey(node: HalfEdge): number {\n    const cld = node.edgeTag as CurveLocationDetail;\n    if (cld !== undefined) {\n      const fraction = cld.fraction;\n      const curve = cld.curve;\n      if (curve) {\n        let radius = curve.fractionToSignedXYRadiusOfCurvature(fraction);\n        if (node.sortData !== undefined && node.sortData < 0)\n          radius = -radius;\n        return radius;\n      }\n    }\n    return 0.0;\n  }\n  /** Whether the HalfEdge is part of a null face, as marked by [[clusterAndMergeXYTheta]]. */\n  public static isNullFace(node: HalfEdge): boolean {\n    return node.isMaskSet(HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;\n  }\n  /** Simplest merge algorithm:\n   * * collect array of (x,y,theta) at all nodes\n   * * lexical sort of the array.\n   * * twist all vertices together.\n   * * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.\n   * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.\n   * * Mask.NULL_FACE is cleared throughout and applied within null faces.\n   */\n  public static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number) {\n    const allNodes = graph.allHalfEdges;\n    const numNodes = allNodes.length;\n    graph.clearMask(HalfEdgeMask.NULL_FACE);\n    const clusters = new ClusterableArray(2, 2, numNodes);  // data order: x,y,theta,nodeIndex.  But theta is not set in first round.\n    for (let i = 0; i < numNodes; i++) {\n      const nodeA = allNodes[i];\n      const xA = nodeA.x;\n      const yA = nodeA.y;\n      HalfEdge.pinch(nodeA, nodeA.vertexSuccessor);  // pull it out of its current vertex loop.\n      clusters.addDirect(xA, yA, 0.0, i);\n    }\n    const clusterTol = Geometry.smallMetricDistance;\n    const order = clusters.clusterIndicesLexical(clusterTol);\n    let k0 = 0;\n    const numK = order.length;\n    for (let k1 = 0; k1 < numK; k1++) {\n      if (order[k1] === ClusterableArray.clusterTerminator) {\n        // nodes identified in order[k0]..order[k1-1] are at a vertex cluster; equate their xy\n        if (k1 > k0) {\n          const iA = clusters.getExtraData(order[k0], 1);\n          const nodeA0 = allNodes[iA];\n          for (let k = k0 + 1; k < k1; k++) {\n            const iB = clusters.getExtraData(order[k], 1);\n            const nodeB = allNodes[iB];\n            nodeB.x = nodeA0.x;\n            nodeB.y = nodeA0.y;\n          }\n        }\n        k0 = k1 + 1;\n      }\n    }\n    // NOW\n    //  1) There are identical coordinates at all nodes around each vertex loop.\n    //  2) Hence ready do sort (at each vertex) by theta.\n\n    // insert theta as extra data in the sort table . . .\n    for (const clusterTableIndex of order) {\n      if (clusterTableIndex !== ClusterableArray.clusterTerminator) {\n        const nodeA = allNodes[clusterTableIndex];\n        const nodeB = nodeA.faceSuccessor;\n        let getPrecomputedRadians = outboundRadiansFunction;\n        if (getPrecomputedRadians) {\n          // Recompute theta when edge geometry is completely determined by the vertices, which may have been perturbed by clustering.\n          const detail = nodeA.edgeTag as CurveLocationDetail;\n          if (undefined === detail || undefined === detail.curve || detail.curve instanceof LineSegment3d)\n            getPrecomputedRadians = undefined;\n        }\n        let radians = getPrecomputedRadians ? getPrecomputedRadians(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);\n        if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))\n          radians = Math.PI;\n        clusters.setExtraData(clusterTableIndex, 0, radians);\n      }\n    }\n    clusters.sortSubsetsBySingleKey(order, 2);\n    const unmatchedNullFaceNodes: HalfEdge[] = [];\n    k0 = 0;\n    let thetaA, thetaB;\n    // GeometryCoreTestIO.consoleLog(\"START VERTEX LINKS\");\n\n    // now pinch each neighboring pair together\n    for (let k1 = 0; k1 < numK; k1++) {\n      if (order[k1] === ClusterableArray.clusterTerminator) {\n        // nodes identified in order[k0]..order[k1-1] are properly sorted around a vertex.\n        if (k1 > k0) {\n          // const xy = clusters.getPoint2d(order[k0]);\n          // GeometryCoreTestIO.consoleLog({ k0, k1, x: xy.x, y: xy.y });\n          if (k1 > k0 + 1)\n            this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1);\n          this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);\n          const iA = clusters.getExtraData(order[k0], 1);\n          thetaA = clusters.getExtraData(order[k0], 0);\n          const nodeA0 = allNodes[iA];\n          let nodeA = nodeA0;\n          for (let k = k0 + 1; k < k1; k++) {\n            const iB = clusters.getExtraData(order[k], 1);\n            thetaB = clusters.getExtraData(order[k], 0);\n            const nodeB = allNodes[iB];\n            if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {\n              // nope, this edge was flagged and pinched from the other end.\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\n              if (j >= 0) {\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\n                unmatchedNullFaceNodes.pop();\n              }\n              nodeA = nodeB;\n              thetaA = thetaB;\n            } else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeB === node);\n              if (j >= 0) {\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\n                unmatchedNullFaceNodes.pop();\n              }\n              // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.\n            } else {\n              HalfEdge.pinch(nodeA, nodeB);\n\n              // Detect null face using the heuristic:\n              //  * near vertex angles are same (periodic, toleranced)\n              //  * far vertex is clustered (exactly equal)\n              //  * near vertex curvatures are same (toleranced)\n              // Note that near vertex is already clustered.\n              if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\n                const nodeA1 = nodeA.faceSuccessor;\n                const nodeB1 = nodeB.edgeMate;\n                if (nodeA1.isEqualXY(nodeB1)) {\n                  const cA = this.curvatureSortKey(nodeA);\n                  const cB = this.curvatureSortKey(nodeB);\n                  if (Geometry.isSameCoordinate(cA, cB, clusterTol)) {  // rule out banana\n                    HalfEdge.pinch(nodeA1, nodeB1);\n                    nodeA.setMask(HalfEdgeMask.NULL_FACE);\n                    nodeB1.setMask(HalfEdgeMask.NULL_FACE);\n                    unmatchedNullFaceNodes.push(nodeB1);\n                  }\n                }\n              }\n              nodeA = nodeB;\n              thetaA = thetaB;\n            }\n          }\n        }\n        k0 = k1 + 1;\n      }\n    }\n  }\n\n  private static buildVerticalSweepPriorityQueue(graph: HalfEdgeGraph): HalfEdgePriorityQueueWithPartnerArray {\n    const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();\n    for (const p of graph.allHalfEdges) {\n\n      if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {\n        sweepHeap.priorityQueue.push(p);\n      }\n    }\n    return sweepHeap;\n  }\n\n  private static computeIntersectionFractionsOnEdges(nodeA0: HalfEdge, nodeB0: HalfEdge, tol: number = Geometry.smallMetricDistance): { f0: XAndY, f1?: XAndY} | undefined {\n    const nodeA1 = nodeA0.faceSuccessor;\n    const aDir = { x: nodeA1.x - nodeA0.x, y: nodeA1.y - nodeA0.y };\n    const nodeB1 = nodeB0.faceSuccessor;\n    const bDir = { x: nodeB1.x - nodeB0.x, y: nodeB1.y - nodeB0.y };\n    let fractions = SmallSystem.lineSegmentXYUVIntersectionUnbounded(nodeA0, aDir, nodeB0, bDir, tol);\n    if (fractions) {\n      const snapFractionToSegment = (fraction: number, segStart: XAndY, segEnd: XAndY): number => {\n        const x = Geometry.interpolate(segStart.x, fraction, segEnd.x);\n        const y = Geometry.interpolate(segStart.y, fraction, segEnd.y);\n        if (Geometry.isSameCoordinateXY(x, y, segStart.x, segStart.y, tol))\n          return 0.0;\n        if (Geometry.isSameCoordinateXY(x, y, segEnd.x, segEnd.y, tol))\n          return 1.0;\n        return fraction;\n      };\n      fractions.f0.x = snapFractionToSegment(fractions.f0.x, nodeA0, nodeA1);\n      fractions.f0.y = snapFractionToSegment(fractions.f0.y, nodeB0, nodeB1);\n      if (fractions.f1) {\n        fractions.f1.x = snapFractionToSegment(fractions.f1.x, nodeA0, nodeA1);\n        fractions.f1.y = snapFractionToSegment(fractions.f1.y, nodeB0, nodeB1);\n      }\n      if (fractions.f1 && !(Geometry.isIn01(fractions.f1.x) && Geometry.isIn01(fractions.f1.y)))\n        fractions.f1 = undefined; // overlap ends beyond a segment; downgrade to simple intersection\n      if (!(Geometry.isIn01(fractions.f0.x) && Geometry.isIn01(fractions.f0.y))) {\n        if (fractions.f1) {\n          fractions.f0 = fractions.f1; // overlap starts beyond a segment; downgrade to simple intersection\n          fractions.f1 = undefined;\n        } else\n          fractions = undefined; // intersection/overlap is outside both segments\n      }\n    }\n    return fractions;\n  }\n  /**\n   * Split edges at intersections.\n   * * This is a large operation.\n   * @param graph\n   */\n  public static splitIntersectingEdges(graph: HalfEdgeGraph): GraphSplitData {\n    const data = new GraphSplitData();\n    const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);\n    let nodeA0, nodeB1;\n    const smallFraction = 1.0e-8;\n    const largeFraction = 1.0 - smallFraction;\n    let i;\n    let nodeB0;\n    const distTol = Geometry.smallMetricDistance;\n    while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {\n      data.numUpEdge++;\n      const n0 = sweepHeap.activeEdges.length;\n      sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - distTol);\n      data.numPopOut += n0 - sweepHeap.activeEdges.length;\n      for (i = 0; i < sweepHeap.activeEdges.length; i++) {\n        nodeB0 = sweepHeap.activeEdges[i];\n        nodeB1 = nodeB0.faceSuccessor;\n        if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y, distTol)) {\n          data.numA0B0++;\n        } else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y, distTol)) {\n          data.numA0B1++;\n        } else {\n          data.numIntersectionTest++;\n          const fractions = this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, distTol);\n          if (fractions) {\n            const splitAndPush = (node: HalfEdge, fraction?: number): void => {\n              if (fraction !== undefined && fraction > smallFraction && fraction < largeFraction) {\n                const newNode = graph.splitEdgeAtFraction(node, fraction);\n                sweepHeap.priorityQueue.push(newNode);  // will be popped as a nodeA0 later\n                data.numSplit++;\n              }\n            };\n            splitAndPush(nodeA0, fractions.f0.x);\n            splitAndPush(nodeA0, fractions.f1?.x);\n            splitAndPush(nodeB0, fractions.f0.y);\n            splitAndPush(nodeB0, fractions.f1?.y);\n            // existing nodeA0 and its shortened edge remain for further intersections\n          }\n        }\n      }\n      sweepHeap.activeEdges.push(nodeA0);\n    }\n    return data;\n  }\n\n  /**\n   * Returns a graph structure formed from the given LineSegment array\n   *\n   * *  Find all intersections among segments, and split them if necessary\n   * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up\n   *      vertices.\n   * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face\n   *      loops\n   */\n  public static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph {\n    // Structure of an index of the array: { xyTheta: Point3d, node: Node }\n    const graph = new HalfEdgeGraph();\n    HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);\n    this.splitIntersectingEdges(graph);\n    this.clusterAndMergeXYTheta(graph);\n    return graph;\n  }\n\n  /**\n   * * Input is random linestrings, not necessarily loops\n   * * Graph gets full splitEdges, regularize (optional), and triangulate.\n   * @returns graph, or undefined if bad data.\n   */\n  public static formGraphFromChains(chains: MultiLineStringDataVariant, regularize: boolean = true, mask: HalfEdgeMask = HalfEdgeMask.PRIMARY_EDGE): HalfEdgeGraph | undefined {\n    if (chains.length < 1)\n      return undefined;\n    const graph = new HalfEdgeGraph();\n    const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);\n    for (const seed of chainSeeds)\n      seed.setMaskAroundFace(mask);\n\n    this.splitIntersectingEdges(graph);\n    this.clusterAndMergeXYTheta(graph);\n    if (regularize) {\n      const context = new RegularizationContext(graph);\n      context.regularizeGraph(true, true);\n    }\n    return graph;\n  }\n\n}\n"]}
+{"version":3,"file":"Merging.js","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,qCAAqC,EAAE,MAAM,yBAAyB,CAAC;AAChF,OAAO,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,mBAAmB;AAEnB,MAAM,OAAO,cAAc;IAClB,SAAS,GAAG,CAAC,CAAC;IACd,mBAAmB,GAAG,CAAC,CAAC;IACxB,QAAQ,GAAG,CAAC,CAAC;IACb,SAAS,GAAG,CAAC,CAAC;IACd,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC,CAAC;IACnB;IACA,CAAC;CACF;AACD;;GAEG;AACH,MAAM,OAAO,0BAA0B;IAC9B,KAAK,CAAS;IACd,iBAAiB,CAAS;IAC1B,IAAI,CAAW;IACf,OAAO,CAAU;IACxB,YAAmB,KAAa,EAAE,GAAW,EAAE,IAAc,EAAE,OAAgB;QAC7E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,GAAG,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAID;;;GAGG;AACH,MAAM,OAAO,gBAAgB;IAE3B,iFAAiF;IAC1E,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QACrD,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mIAAmI;IAC5H,MAAM,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACvC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAc,EAAE,OAAiB,EAAE,OAAiB;QACtF,OAAO,QAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,iDAAiD;IAC1C,MAAM,CAAC,UAAU,CAAC,KAA8B;QACrD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,YAAY,CAAC,KAA8B;QACvD,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gFAAgF;IACzE,MAAM,CAAC,wBAAwB,CAAC,QAAyB,EAAE,WAA0B,EAAE,IAAkB;QAC9G,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,kFAAkF;QAClF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAE/B,MAAM,KAAK,GAAG,WAAW,CAAC,gBAAgB,CACxC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,EACV,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,GAAG,CAAC,CAAC,CAAC;YAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC7B,UAAU,IAAI,CAAC,CAAC;YAEhB,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAG,sDAAsD;YACvF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,MAAoB,EAAE,OAAqB,EAAE,gBAAwB,CAAC;QAClI,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,8DAA8D;YACjE,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC;QAC1B,CAAC,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,2DAA2D;YAC9D,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,iBAAiB,CAAC;QAC5B,CAAC,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,OAAO,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB,YAAY,CAAC,aAAa;QAC9I,IAAI,YAAY,CAAC,SAAS,KAAK,IAAI;YACjC,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClE,gFAAgF;oBAChF,MAAM,aAAa,GAAG,QAAQ,CAAC,0BAA0B,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;oBACrH,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;wBAChK,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBAC7B,EAAE,SAAS,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,wCAAwC,CAAC,KAAoB,EAAE,UAAwB,YAAY,CAAC,aAAa;QAC7H,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YACzE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,UAAwB,YAAY,CAAC,aAAa;QACtG,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACzF,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,GAAG,GAAG,KAAK,CAAC,kBAAkB,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9F,MAAM,CAAC,cAAc,KAAK,eAAe,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,QAAsB,YAAY,CAAC,QAAQ;QAC/F,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAChC,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACtB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IAC7B,uEAAuE;IACvE,uDAAuD;IACvD,+EAA+E;IACxE,MAAM,CAAC,sBAAsB,CAAC,QAA0B,EAAE,KAAkB,EAAE,EAAU,EAAE,EAAU;QACzG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,KAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gBAChE,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACO,MAAM,CAAC,mCAAmC,CAAsC;IACxF;;OAEG;IACI,MAAM,KAAK,kCAAkC,CAAC,IAAoD,IAAI,IAAI,CAAC,mCAAmC,GAAG,IAAI,CAAC,CAAC,CAAC;IACvJ,MAAM,CAAC,4BAA4B,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACtI,IAAI,IAAI,CAAC,mCAAmC,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAiC,EAAE,CAAC;YAClD,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YACvF,CAAC;YACD,IAAI,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;QACrD,CAAC;IAEH,CAAC;IACD,mCAAmC;IACnC,yCAAyC;IACzC,gDAAgD;IAChD,6DAA6D;IAC7D,mCAAmC;IACnC,iCAAiC;IACzB,MAAM,CAAC,yBAAyB,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACnI,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAElD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;gBACf,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;oBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC;gBACjF,CAAC;gBACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAA6B,EAAE,CAA6B,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;gBAC7H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAAc;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,OAA8B,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,MAAM,GAAG,KAAK,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;gBACjE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;oBAClD,MAAM,GAAG,CAAC,MAAM,CAAC;gBACnB,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,4FAA4F;IACrF,MAAM,CAAC,UAAU,CAAC,IAAc;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC;IACrJ,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAClC,KAAoB,EACpB,uBAAkD,EAClD,aAAqB,QAAQ,CAAC,mBAAmB;QAEjD,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,yEAAyE;QACjI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAE,0CAA0C;YACzF,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACzD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,sFAAsF;gBACtF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACnB,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE,CAAC;YACtC,IAAI,iBAAiB,KAAK,gBAAgB,CAAC,iBAAiB,EAAE,CAAC;gBAC7D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,qBAAqB,GAAG,uBAAuB,CAAC;gBACpD,IAAI,qBAAqB,EAAE,CAAC;oBAC1B,4HAA4H;oBAC5H,MAAM,MAAM,GAAG,KAAK,CAAC,OAA8B,CAAC;oBACpD,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,YAAY,aAAa;wBAC7F,qBAAqB,GAAG,SAAS,CAAC;gBACtC,CAAC;gBACD,IAAI,OAAO,GAAG,qBAAqB,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtH,IAAI,KAAK,CAAC,oCAAoC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/D,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,sBAAsB,GAAe,EAAE,CAAC;QAC9C,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,uDAAuD;QAEvD,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,kFAAkF;gBAClF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,6CAA6C;oBAC7C,+DAA+D;oBAC/D,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;wBACb,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrE,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,MAAM,CAAC;oBACnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,IAAI,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC5C,8DAA8D;4BAC9D,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BACnD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,6FAA6F;wBAC/F,CAAC;6BAAM,CAAC;4BACN,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAE7B,wCAAwC;4BACxC,wDAAwD;4BACxD,6CAA6C;4BAC7C,kDAAkD;4BAClD,8CAA8C;4BAC9C,IAAI,KAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gCAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;oCAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,IAAI,QAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAE,kBAAkB;wCACtE,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;wCAC/B,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;wCACtC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;wCACvC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oCACtC,CAAC;gCACH,CAAC;4BACH,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,+BAA+B,CAAC,KAAoB;QACjE,MAAM,SAAS,GAAG,IAAI,qCAAqC,EAAE,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YAEnC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,MAAM,CAAC,mCAAmC,CAAC,MAAgB,EAAE,MAAgB,EAAE,MAAc,QAAQ,CAAC,mBAAmB;QAC/H,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;QAChE,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;QAChE,IAAI,SAAS,GAAG,WAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAClG,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,qBAAqB,GAAG,CAAC,QAAgB,EAAE,QAAe,EAAE,MAAa,EAAU,EAAE;gBACzF,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,QAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC;oBAChE,OAAO,GAAG,CAAC;gBACb,IAAI,QAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC5D,OAAO,GAAG,CAAC;gBACb,OAAO,QAAQ,CAAC;YAClB,CAAC,CAAC;YACF,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvE,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;gBACjB,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBACvE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACzE,CAAC;YACD,IAAI,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACvF,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,kEAAkE;YAC9F,IAAI,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1E,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;oBACjB,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,oEAAoE;oBACjG,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC;gBAC3B,CAAC;;oBACC,SAAS,GAAG,SAAS,CAAC,CAAC,gDAAgD;YAC3E,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB,EAAE,cAAsB,QAAQ,CAAC,mBAAmB,EAAE,cAAsB,MAAM;QACzI,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,aAAa,GAAG,WAAW,CAAC;QAClC,MAAM,aAAa,GAAG,GAAG,GAAG,aAAa,CAAC;QAC1C,IAAI,CAAC,CAAC;QACN,IAAI,MAAM,CAAC;QACX,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;YAC9D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,SAAS,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;YAChE,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;gBAC9B,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;oBACrF,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;oBAC5F,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBACxF,IAAI,SAAS,EAAE,CAAC;wBACd,MAAM,YAAY,GAAG,CAAC,IAAc,EAAE,QAAiB,EAAQ,EAAE;4BAC/D,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,aAAa,IAAI,QAAQ,GAAG,aAAa,EAAE,CAAC;gCACnF,MAAM,OAAO,GAAG,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gCAC1D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,mCAAmC;gCAC3E,IAAI,CAAC,QAAQ,EAAE,CAAC;4BAClB,CAAC;wBACH,CAAC,CAAC;wBACF,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBACrC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACtC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBACrC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACtC,0EAA0E;oBAC5E,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qBAAqB,CAAC,YAA6B;QAC/D,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,gBAAgB,CAAC,wBAAwB,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,CAAC,aAAa,CAAC,CAAC;QAC3F,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAkC,EAAE,aAAsB,IAAI,EAAE,OAAqB,YAAY,CAAC,YAAY;QAC9I,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,YAAY,CAAC,iCAAiC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,KAAK,MAAM,IAAI,IAAI,UAAU;YAC3B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF","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\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\r\nimport { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\r\nimport { SmallSystem } from \"../numerics/SmallSystem\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { HalfEdgePriorityQueueWithPartnerArray } from \"./HalfEdgePriorityQueue\";\r\nimport { RegularizationContext } from \"./RegularizeFace\";\r\nimport { Triangulator } from \"./Triangulation\";\r\n\r\n// cspell:word XYUV\r\n\r\nexport class GraphSplitData {\r\n  public numUpEdge = 0;\r\n  public numIntersectionTest = 0;\r\n  public numSplit = 0;\r\n  public numPopOut = 0;\r\n  public numA0B0 = 0;\r\n  public numA0B1 = 0;\r\n  public constructor() {\r\n  }\r\n}\r\n/**\r\n * Structure for data used when sorting outbound edges \"around a node\"\r\n */\r\nexport class VertexNeighborhoodSortData {\r\n  public index: number;\r\n  public radiusOfCurvature: number;\r\n  public node: HalfEdge;\r\n  public radians?: number;\r\n  public constructor(index: number, key: number, node: HalfEdge, radians?: number) {\r\n    this.index = index;\r\n    this.radiusOfCurvature = key;\r\n    this.node = node;\r\n    this.radians = radians;\r\n  }\r\n}\r\n\r\n/** Function signature for announcing a vertex neighborhood during sorting. */\r\nexport type AnnounceVertexNeighborhoodSortData = (data: VertexNeighborhoodSortData[]) => any;\r\n/**\r\n * * Assorted methods used in algorithms on HalfEdgeGraph.\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphOps {\r\n\r\n  /** Compare function for sorting with primary y compare, secondary  x compare. */\r\n  public static compareNodesYXUp(a: HalfEdge, b: HalfEdge) {\r\n    // Check y's\r\n    // if (!Geometry.isSameCoordinate(a.y, b.y))\r\n    if (a.y < b.y)\r\n      return -1;\r\n    else if (a.y > b.y)\r\n      return 1;\r\n    // Check x's\r\n    // if (!Geometry.isSameCoordinate(a.x, b.x))\r\n    if (a.x < b.x)\r\n      return -1;\r\n    else if (a.x > b.x)\r\n      return 1;\r\n    return 0;\r\n  }\r\n\r\n  /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */\r\n  public static isDownPeak(nodeB: HalfEdge) {\r\n    const nodeA = nodeB.facePredecessor;\r\n    const nodeC = nodeB.faceSuccessor;\r\n    return this.compareNodesYXUp(nodeB, nodeA) < 0\r\n      && this.compareNodesYXUp(nodeB, nodeC) < 0\r\n      && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;\r\n  }\r\n\r\n  /** return the cross product of vectors from base to targetA and base to targetB\r\n   * @param base base vertex of both vectors.\r\n   * @param targetA target vertex of first vector\r\n   * @param targetB target vertex of second vector\r\n   */\r\n  public static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number {\r\n    return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);\r\n  }\r\n\r\n  /** Compute the range of the graph's vertices. */\r\n  public static graphRange(graph: Readonly<HalfEdgeGraph>): Range3d {\r\n    const range = Range3d.create();\r\n    for (const node of graph.allHalfEdges) {\r\n      range.extendXYZ(node.x, node.y, node.z);\r\n    }\r\n    return range;\r\n  }\r\n  /** Compute the xy-range of the graph's vertices. */\r\n  public static graphRangeXY(graph: Readonly<HalfEdgeGraph>): Range2d {\r\n    const range = Range2d.createNull();\r\n    for (const node of graph.allHalfEdges) {\r\n      range.extendXY(node.x, node.y);\r\n    }\r\n    return range;\r\n  }\r\n\r\n  /** Returns an array of all nodes (both ends) of edges created from segments. */\r\n  public static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[] {\r\n    const result = [];\r\n    let idxCounter = 0;\r\n\r\n    // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}\r\n    for (const segment of segments) {\r\n\r\n      const node0 = returnGraph.createEdgeXYZXYZ(\r\n        segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z,\r\n        idxCounter,\r\n        segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z,\r\n        idxCounter + 1);\r\n\r\n      const node1 = node0.edgeMate;\r\n      idxCounter += 2;\r\n\r\n      node0.setMaskAroundFace(mask);   // Original given coordinates must be part of boundary\r\n      result.push(node0);\r\n      result.push(node1);\r\n    }\r\n\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * Visit all nodes in `graph`.\r\n   * * invoke `pinch(node, vertexPredecessor)`\r\n   * * this leaves the graph as isolated edges.\r\n   * @param graph graph to modify\r\n   */\r\n  public static isolateAllEdges(graph: HalfEdgeGraph) {\r\n    for (const nodeA of graph.allHalfEdges) {\r\n      const nodeB = nodeA.vertexPredecessor;\r\n      HalfEdge.pinch(nodeA, nodeB);\r\n    }\r\n  }\r\n  /**\r\n   * Compute convexity of a sector of a super-face.\r\n   * @param base node whose edge is to be tested for removal\r\n   * @param ignore edges with this mask (on either side) are ignored for the purposes of computing convexity\r\n   * @param barrier edges with this mask (on either side) will not be removed\r\n   * @param signedAreaTol optional signed area tolerance to use in test for parallel vectors\r\n   * @return whether removing the edge at base would create a convex sector in the super-face\r\n   */\r\n  private static isSectorConvexAfterEdgeRemoval(base: HalfEdge, ignore: HalfEdgeMask, barrier: HalfEdgeMask, signedAreaTol: number = 0): boolean {\r\n    let vs = base;\r\n    do { // loop ccw around vertex looking for a super-face predecessor\r\n      if (vs.isMaskSet(barrier) || vs.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vs = vs.vertexSuccessor;\r\n    } while (vs !== base && vs.isMaskSet(ignore));\r\n    if (vs === base)\r\n      return false;\r\n    let vp = base;\r\n    do { // loop cw around vertex looking for a super-face successor\r\n      if (vp.isMaskSet(barrier) || vp.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vp = vp.vertexPredecessor;\r\n    } while (vp !== base && vp.isMaskSet(ignore));\r\n    if (vp === base)\r\n      return false;\r\n    return HalfEdge.isSectorConvex(vs.edgeMate, base, vp.faceSuccessor, signedAreaTol);\r\n  }\r\n  /**\r\n   * Mask edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine and mark\r\n   * @param mark the mask used to mark (both sides of) removable edges\r\n   * @param barrier edges with this mask (on either side) will not be marked. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges masked (half the number of HalfEdges masked)\r\n   */\r\n  public static markRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, mark: HalfEdgeMask, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    if (HalfEdgeMask.NULL_MASK === mark)\r\n      return 0;\r\n    const visit = graph.grabMask(true);\r\n    let numMarked = 0;\r\n    for (const node of graph.allHalfEdges) {\r\n      if (!node.isMaskSet(visit)) {\r\n        if (!node.isMaskSet(barrier) && !node.edgeMate.isMaskSet(barrier)) {\r\n          // tol based on areas of *original* faces on each side of the edge to be removed\r\n          const signedAreaTol = Geometry.smallMetricDistanceSquared * (node.signedFaceArea() + node.edgeMate.signedFaceArea());\r\n          if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier, signedAreaTol) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier, signedAreaTol)) {\r\n            node.setMaskAroundEdge(mark);\r\n            ++numMarked;\r\n          }\r\n        }\r\n      }\r\n      node.setMaskAroundEdge(visit);\r\n    }\r\n    graph.dropMask(visit);\r\n    return numMarked;\r\n  }\r\n  /**\r\n   * Collect edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine\r\n   * @param barrier edges with this mask (on either side) will not be collected. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return one HalfEdge per removable edge\r\n   */\r\n  public static collectRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): HalfEdge[] | undefined {\r\n    const removable: HalfEdge[] = [];\r\n    const mark = graph.grabMask(true);\r\n    if (0 < this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier)) {\r\n      const visited = graph.grabMask(true);\r\n      for (const node of graph.allHalfEdges) {\r\n        if (node.isMaskSet(mark) && !node.isMaskSet(visited)) {\r\n          node.setMaskAroundEdge(visited);\r\n          removable.push(node);\r\n        }\r\n      }\r\n      graph.dropMask(visited);\r\n    }\r\n    graph.dropMask(mark);\r\n    return removable;\r\n  }\r\n\r\n  /**\r\n   * Remove edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to modify\r\n   * @param barrier edges with this mask (on either side) will not be removed. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges deleted\r\n   */\r\n  public static expandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    const mark = graph.grabMask(true);\r\n    const numRemovedEdges = this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier);\r\n    if (numRemovedEdges > 0) {\r\n      const numYankedEdges = 0.5 * graph.yankAndDeleteEdges((node: HalfEdge) => node.getMask(mark));\r\n      assert(numYankedEdges === numRemovedEdges);\r\n    }\r\n    graph.dropMask(mark);\r\n    return numRemovedEdges;\r\n  }\r\n\r\n  /**\r\n   * Test desired faces for convexity.\r\n   * @param graph graph to examine\r\n   * @param avoid faces with this mask will not be examined. Defaults to HalfEdgeMask.EXTERIOR.\r\n   * @return whether every face in the graph is convex\r\n   */\r\n  public static isEveryFaceConvex(graph: HalfEdgeGraph, avoid: HalfEdgeMask = HalfEdgeMask.EXTERIOR): boolean {\r\n    const allFaces = graph.collectFaceLoops();\r\n    for (const node of allFaces) {\r\n      if (node.isMaskedAroundFace(avoid))\r\n        continue;\r\n      if (!node.isFaceConvex())\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n}\r\n\r\n/**\r\n * Note: this class uses hardcoded micrometer coordinate/cluster tolerance throughout.\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphMerge {\r\n  // return kC such that all angles k are equal, with kA <= k < kC <= kB.\r\n  // * Assume: angles k are stored at extra data index 0.\r\n  // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC\r\n  public static getCommonThetaEndIndex(clusters: ClusterableArray, order: Uint32Array, kA: number, kB: number): number {\r\n    let kC = kA + 1;\r\n    const thetaA = clusters.getExtraData(order[kA], 0);\r\n    while (kC < kB) {\r\n      const thetaB = clusters.getExtraData(order[kC], 0);\r\n      if (!Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\r\n        return kC;\r\n      }\r\n      kC++;\r\n    }\r\n    return kC;\r\n  }\r\n  private static _announceVertexNeighborhoodFunction?: AnnounceVertexNeighborhoodSortData;\r\n  /**\r\n   * public property setter for a function to be called with sorted edge data around a vertex.\r\n   */\r\n  public static set announceVertexNeighborhoodFunction(func: AnnounceVertexNeighborhoodSortData | undefined) { this._announceVertexNeighborhoodFunction = func; }\r\n  private static doAnnounceVertexNeighborhood(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    if (this._announceVertexNeighborhoodFunction) {\r\n      const sortData: VertexNeighborhoodSortData[] = [];\r\n      // build and share the entire vertex order\r\n      for (let k = k0; k < k1; k++) {\r\n        const index = clusters.getExtraData(order[k], 1);\r\n        const theta = clusters.getExtraData(order[k], 0);\r\n        const node = allNodes[index];\r\n        const signedDistance = this.curvatureSortKey(node);\r\n        sortData.push(new VertexNeighborhoodSortData(order[k], signedDistance, node, theta));\r\n      }\r\n      this._announceVertexNeighborhoodFunction(sortData);\r\n    }\r\n\r\n  }\r\n  // assumptions about cluster array:\r\n  //   * data order is: x,y,theta,nodeIndex\r\n  //   * theta and nodeIndex are the \"extra\" data.\r\n  //   * only want to do anything here when curves are present.\r\n  //   * k0<=k<k1 are around a vertex\r\n  //   * These are sorted by theta.\r\n  private static secondarySortAroundVertex(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    const sortData: VertexNeighborhoodSortData[] = [];\r\n\r\n    for (let k = k0; k < k1;) {\r\n      const kB = this.getCommonThetaEndIndex(clusters, order, k, k1);\r\n      if (k + 1 < kB) {\r\n        sortData.length = 0;\r\n        for (let kA = k; kA < kB; kA++) {\r\n          const index = clusters.getExtraData(order[kA], 1);\r\n          const node = allNodes[index];\r\n          const signedDistance = this.curvatureSortKey(node);\r\n          sortData.push(new VertexNeighborhoodSortData(order[kA], signedDistance, node));\r\n        }\r\n        sortData.sort((a: VertexNeighborhoodSortData, b: VertexNeighborhoodSortData) => (a.radiusOfCurvature - b.radiusOfCurvature));\r\n        for (let i = 0; i < sortData.length; i++) {\r\n          order[k + i] = sortData[i].index;\r\n        }\r\n      }\r\n      k = kB;\r\n    }\r\n  }\r\n  /** Return the sort key for sorting by curvature.\r\n   * * This is the signed distance from the curve at the edge start, to center of curvature.\r\n   * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.\r\n   */\r\n  public static curvatureSortKey(node: HalfEdge): number {\r\n    const cld = node.edgeTag as CurveLocationDetail;\r\n    if (cld !== undefined) {\r\n      const fraction = cld.fraction;\r\n      const curve = cld.curve;\r\n      if (curve) {\r\n        let radius = curve.fractionToSignedXYRadiusOfCurvature(fraction);\r\n        if (node.sortData !== undefined && node.sortData < 0)\r\n          radius = -radius;\r\n        return radius;\r\n      }\r\n    }\r\n    return 0.0;\r\n  }\r\n  /** Whether the HalfEdge is part of a null face, as marked by [[clusterAndMergeXYTheta]]. */\r\n  public static isNullFace(node: HalfEdge): boolean {\r\n    return node.isMaskSet(HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;\r\n  }\r\n  /** Simplest merge algorithm:\r\n   * * collect array of (x,y,theta) at all nodes\r\n   * * lexical sort of the array.\r\n   * * twist all vertices together.\r\n   * * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.\r\n   * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.\r\n   * * Mask.NULL_FACE is cleared throughout and applied within null faces.\r\n   */\r\n  public static clusterAndMergeXYTheta(\r\n    graph: HalfEdgeGraph,\r\n    outboundRadiansFunction?: (he: HalfEdge) => number,\r\n    clusterTol: number = Geometry.smallMetricDistance,\r\n  ) {\r\n    const allNodes = graph.allHalfEdges;\r\n    const numNodes = allNodes.length;\r\n    graph.clearMask(HalfEdgeMask.NULL_FACE);\r\n    const clusters = new ClusterableArray(2, 2, numNodes);  // data order: x,y,theta,nodeIndex.  But theta is not set in first round.\r\n    for (let i = 0; i < numNodes; i++) {\r\n      const nodeA = allNodes[i];\r\n      const xA = nodeA.x;\r\n      const yA = nodeA.y;\r\n      HalfEdge.pinch(nodeA, nodeA.vertexSuccessor);  // pull it out of its current vertex loop.\r\n      clusters.addDirect(xA, yA, 0.0, i);\r\n    }\r\n    const order = clusters.clusterIndicesLexical(clusterTol);\r\n    let k0 = 0;\r\n    const numK = order.length;\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1-1] are at a vertex cluster; equate their xy\r\n        if (k1 > k0) {\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          const nodeA0 = allNodes[iA];\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            const nodeB = allNodes[iB];\r\n            nodeB.x = nodeA0.x;\r\n            nodeB.y = nodeA0.y;\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n    // NOW\r\n    //  1) There are identical coordinates at all nodes around each vertex loop.\r\n    //  2) Hence ready do sort (at each vertex) by theta.\r\n\r\n    // insert theta as extra data in the sort table . . .\r\n    for (const clusterTableIndex of order) {\r\n      if (clusterTableIndex !== ClusterableArray.clusterTerminator) {\r\n        const nodeA = allNodes[clusterTableIndex];\r\n        const nodeB = nodeA.faceSuccessor;\r\n        let getPrecomputedRadians = outboundRadiansFunction;\r\n        if (getPrecomputedRadians) {\r\n          // Recompute theta when edge geometry is completely determined by the vertices, which may have been perturbed by clustering.\r\n          const detail = nodeA.edgeTag as CurveLocationDetail;\r\n          if (undefined === detail || undefined === detail.curve || detail.curve instanceof LineSegment3d)\r\n            getPrecomputedRadians = undefined;\r\n        }\r\n        let radians = getPrecomputedRadians ? getPrecomputedRadians(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);\r\n        if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))\r\n          radians = Math.PI;\r\n        clusters.setExtraData(clusterTableIndex, 0, radians);\r\n      }\r\n    }\r\n    clusters.sortSubsetsBySingleKey(order, 2);\r\n    const unmatchedNullFaceNodes: HalfEdge[] = [];\r\n    k0 = 0;\r\n    let thetaA, thetaB;\r\n    // GeometryCoreTestIO.consoleLog(\"START VERTEX LINKS\");\r\n\r\n    // now pinch each neighboring pair together\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1-1] are properly sorted around a vertex.\r\n        if (k1 > k0) {\r\n          // const xy = clusters.getPoint2d(order[k0]);\r\n          // GeometryCoreTestIO.consoleLog({ k0, k1, x: xy.x, y: xy.y });\r\n          if (k1 > k0 + 1)\r\n            this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1);\r\n          this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          thetaA = clusters.getExtraData(order[k0], 0);\r\n          const nodeA0 = allNodes[iA];\r\n          let nodeA = nodeA0;\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            thetaB = clusters.getExtraData(order[k], 0);\r\n            const nodeB = allNodes[iB];\r\n            if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              // nope, this edge was flagged and pinched from the other end.\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            } else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeB === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.\r\n            } else {\r\n              HalfEdge.pinch(nodeA, nodeB);\r\n\r\n              // Detect null face using the heuristic:\r\n              //  * near vertex angles are same (periodic, toleranced)\r\n              //  * far vertex is clustered (exactly equal)\r\n              //  * near vertex curvatures are same (toleranced)\r\n              // Note that near vertex is already clustered.\r\n              if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\r\n                const nodeA1 = nodeA.faceSuccessor;\r\n                const nodeB1 = nodeB.edgeMate;\r\n                if (nodeA1.isEqualXY(nodeB1)) {\r\n                  const cA = this.curvatureSortKey(nodeA);\r\n                  const cB = this.curvatureSortKey(nodeB);\r\n                  if (Geometry.isSameCoordinate(cA, cB, clusterTol)) {  // rule out banana\r\n                    HalfEdge.pinch(nodeA1, nodeB1);\r\n                    nodeA.setMask(HalfEdgeMask.NULL_FACE);\r\n                    nodeB1.setMask(HalfEdgeMask.NULL_FACE);\r\n                    unmatchedNullFaceNodes.push(nodeB1);\r\n                  }\r\n                }\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            }\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n  }\r\n\r\n  private static buildVerticalSweepPriorityQueue(graph: HalfEdgeGraph): HalfEdgePriorityQueueWithPartnerArray {\r\n    const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();\r\n    for (const p of graph.allHalfEdges) {\r\n\r\n      if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {\r\n        sweepHeap.priorityQueue.push(p);\r\n      }\r\n    }\r\n    return sweepHeap;\r\n  }\r\n\r\n  private static computeIntersectionFractionsOnEdges(nodeA0: HalfEdge, nodeB0: HalfEdge, tol: number = Geometry.smallMetricDistance): { f0: XAndY, f1?: XAndY} | undefined {\r\n    const nodeA1 = nodeA0.faceSuccessor;\r\n    const aDir = { x: nodeA1.x - nodeA0.x, y: nodeA1.y - nodeA0.y };\r\n    const nodeB1 = nodeB0.faceSuccessor;\r\n    const bDir = { x: nodeB1.x - nodeB0.x, y: nodeB1.y - nodeB0.y };\r\n    let fractions = SmallSystem.lineSegmentXYUVIntersectionUnbounded(nodeA0, aDir, nodeB0, bDir, tol);\r\n    if (fractions) {\r\n      const snapFractionToSegment = (fraction: number, segStart: XAndY, segEnd: XAndY): number => {\r\n        const x = Geometry.interpolate(segStart.x, fraction, segEnd.x);\r\n        const y = Geometry.interpolate(segStart.y, fraction, segEnd.y);\r\n        if (Geometry.isSameCoordinateXY(x, y, segStart.x, segStart.y, tol))\r\n          return 0.0;\r\n        if (Geometry.isSameCoordinateXY(x, y, segEnd.x, segEnd.y, tol))\r\n          return 1.0;\r\n        return fraction;\r\n      };\r\n      fractions.f0.x = snapFractionToSegment(fractions.f0.x, nodeA0, nodeA1);\r\n      fractions.f0.y = snapFractionToSegment(fractions.f0.y, nodeB0, nodeB1);\r\n      if (fractions.f1) {\r\n        fractions.f1.x = snapFractionToSegment(fractions.f1.x, nodeA0, nodeA1);\r\n        fractions.f1.y = snapFractionToSegment(fractions.f1.y, nodeB0, nodeB1);\r\n      }\r\n      if (fractions.f1 && !(Geometry.isIn01(fractions.f1.x) && Geometry.isIn01(fractions.f1.y)))\r\n        fractions.f1 = undefined; // overlap ends beyond a segment; downgrade to simple intersection\r\n      if (!(Geometry.isIn01(fractions.f0.x) && Geometry.isIn01(fractions.f0.y))) {\r\n        if (fractions.f1) {\r\n          fractions.f0 = fractions.f1; // overlap starts beyond a segment; downgrade to simple intersection\r\n          fractions.f1 = undefined;\r\n        } else\r\n          fractions = undefined; // intersection/overlap is outside both segments\r\n      }\r\n    }\r\n    return fractions;\r\n  }\r\n  /**\r\n   * Split edges at intersections.\r\n   * * This is a large operation.\r\n   * @param graph\r\n   */\r\n  public static splitIntersectingEdges(graph: HalfEdgeGraph, distanceTol: number = Geometry.smallMetricDistance, fractionTol: number = 1.0e-8): GraphSplitData {\r\n    const data = new GraphSplitData();\r\n    const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);\r\n    let nodeA0, nodeB1;\r\n    const smallFraction = fractionTol;\r\n    const largeFraction = 1.0 - smallFraction;\r\n    let i;\r\n    let nodeB0;\r\n    while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {\r\n      data.numUpEdge++;\r\n      const n0 = sweepHeap.activeEdges.length;\r\n      sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - distanceTol);\r\n      data.numPopOut += n0 - sweepHeap.activeEdges.length;\r\n      for (i = 0; i < sweepHeap.activeEdges.length; i++) {\r\n        nodeB0 = sweepHeap.activeEdges[i];\r\n        nodeB1 = nodeB0.faceSuccessor;\r\n        if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y, distanceTol)) {\r\n          data.numA0B0++;\r\n        } else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y, distanceTol)) {\r\n          data.numA0B1++;\r\n        } else {\r\n          data.numIntersectionTest++;\r\n          const fractions = this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, distanceTol);\r\n          if (fractions) {\r\n            const splitAndPush = (node: HalfEdge, fraction?: number): void => {\r\n              if (fraction !== undefined && fraction > smallFraction && fraction < largeFraction) {\r\n                const newNode = graph.splitEdgeAtFraction(node, fraction);\r\n                sweepHeap.priorityQueue.push(newNode);  // will be popped as a nodeA0 later\r\n                data.numSplit++;\r\n              }\r\n            };\r\n            splitAndPush(nodeA0, fractions.f0.x);\r\n            splitAndPush(nodeA0, fractions.f1?.x);\r\n            splitAndPush(nodeB0, fractions.f0.y);\r\n            splitAndPush(nodeB0, fractions.f1?.y);\r\n            // existing nodeA0 and its shortened edge remain for further intersections\r\n          }\r\n        }\r\n      }\r\n      sweepHeap.activeEdges.push(nodeA0);\r\n    }\r\n    return data;\r\n  }\r\n\r\n  /**\r\n   * Returns a graph structure formed from the given LineSegment array\r\n   *\r\n   * *  Find all intersections among segments, and split them if necessary\r\n   * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up\r\n   *      vertices.\r\n   * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face\r\n   *      loops\r\n   */\r\n  public static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph {\r\n    // Structure of an index of the array: { xyTheta: Point3d, node: Node }\r\n    const graph = new HalfEdgeGraph();\r\n    HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * * Input is random linestrings, not necessarily loops\r\n   * * Graph gets full splitEdges, regularize (optional), and triangulate.\r\n   * @returns graph, or undefined if bad data.\r\n   */\r\n  public static formGraphFromChains(chains: MultiLineStringDataVariant, regularize: boolean = true, mask: HalfEdgeMask = HalfEdgeMask.PRIMARY_EDGE): HalfEdgeGraph | undefined {\r\n    if (chains.length < 1)\r\n      return undefined;\r\n    const graph = new HalfEdgeGraph();\r\n    const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);\r\n    for (const seed of chainSeeds)\r\n      seed.setMaskAroundFace(mask);\r\n\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n    if (regularize) {\r\n      const context = new RegularizationContext(graph);\r\n      context.regularizeGraph(true, true);\r\n    }\r\n    return graph;\r\n  }\r\n\r\n}\r\n"]}