@itwin/core-geometry 4.1.0-dev.7 → 4.1.0-dev.70

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

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSearch.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAY,aAAa,EAAE,YAAY,EAAmD,MAAM,SAAS,CAAC;AACjH,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAQhE;GACG;AACH,MAAM,OAAO,kBAAkB;IAG7B;;;;OAIG;IACH,YAAmB,IAAkB,EAAE,cAAuB,IAAI;QAChE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD,yEAAyE;IAClE,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC;IAChE,CAAC;CAEF;AACD,oCAAoC;AACpC,MAAM,OAAO,mBAAmB;IAE9B;;;OAGG;IACK,MAAM,CAAC,yBAAyB,CAAC,QAAkB,EAAE,IAAY,EAAE,YAAwB,EAAE,eAA2B;QAC9H,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,QAAQ,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,uBAAmD,EAAE,gBAAuC;QAC5H,MAAM,OAAO,GAAG,mBAAmB,CAAC,sBAAsB,CAAC,uBAAuB,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC7G,OAAO,OAAO,CAAC,mBAAmB,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,cAAc,CAAC,IAAc,IAAY,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACtF;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAkC,EAAE,kBAA2B,KAAK,EACvG,eAAqC,mBAAmB,CAAC,cAAc;QACvE,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAW,eAAe,CAAC,CAAC;QAChE,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,aAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACjC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAkC,EAAE,iCAA0C,IAAI,EAAE,4BAA4B,GAAG,CAAC;QAClJ,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,aAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC7C,IAAI,QAAQ,IAAI,CAAC,EAAE;gBACjB,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;gBACnC,IAAI,IAAI,GAAG,CAAC,EAAE;oBACZ,IAAI,QAAQ,GAAG,CAAC,EAAE;wBAChB,qBAAqB,EAAE,CAAC;wBACxB,IAAI,qBAAqB,GAAG,4BAA4B;4BACtD,OAAO,KAAK,CAAC;qBAChB;iBACF;qBAAM;oBACL,WAAW,EAAE,CAAC;oBACd,IAAI,WAAW,GAAG,CAAC,EAAE;wBACnB,IAAI,CAAC,8BAA8B;4BACjC,OAAO,KAAK,CAAC;qBAChB;iBACF;aACF;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,mBAAmB,CAAC,QAAkB,EAAE,SAAuB,EAAE,gBAAgD,EAAE,UAAwB;QACxJ,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,QAAQ;QAEzD,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,gFAAgF;QAChF,mBAAmB,CAAC,yBAAyB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,8BAA8B;QAChH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC;YACxB,IAAI,CAAC,IAAI;gBACP,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;gBAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACnD,QAAQ,GAAG,CAAC,QAAQ,CAAC;gBACvB,mBAAmB,CAAC,yBAAyB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;aACpG;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,MAAqB,EAAE,IAAkB,EAAE,KAAiB;QACxG,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,gBAAgB,EAAE;SACtB;aAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;YAC3C,uCAAuC;SACxC;aAAM;YACL,qEAAqE;YACrE,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE;gBAC5B,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBAC5B,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;iBACpC;qBAAM;oBACL,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;iBAClC;aACF;SACF;IACH,CAAC;IACD,0GAA0G;IAClG,MAAM,CAAC,8BAA8B,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB;QAC9G,IAAI,IAAI,KAAK,YAAY,CAAC,SAAS;YACjC,OAAO;QACT,KAAK,MAAM,gBAAgB,IAAI,UAAU;YACvC,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACtF,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iDAAiD,CAAC,KAAoB,EAAE,gBAAgD,EAAE,aAA2B,YAAY,CAAC,SAAS;QACvL,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,YAAY,EAAE;YACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE;gBAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBAC5G,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aAC3B;SACF;QACD,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClF,OAAO,UAAU,CAAC;IACpB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,QAAkB,EAAE,CAAS,EAAE,CAAS;QACtE,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,yFAAyF;QACzF,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC;QACnC,QAAS,KAAK,GAAG,KAAK,EAAE;YACtB,IAAI,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC1D,MAAM;YACR,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,uCAAuC;gBACvC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B;QAED,sFAAsF;QACtF,kDAAkD;QAClD,IAAI,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC;QAC/B,SAAU;YACR,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE;gBACpC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,IAAI,IAAI,KAAK,KAAK;gBAChB,MAAM;YACR,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC;SAC3B;QACD,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IAClC,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,IAAc,EAAE,SAAuB,EAAE,cAAyC,EAClI,YAAuD;QACvD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;YACvD,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC;YACtC,IAAI,qBAAqB,GAAG,UAAU,CAAC;YACvC,SAAU;gBACR,IAAI,qBAAqB,CAAC,OAAO,CAAC,SAAS,CAAC;oBAC1C,OAAO;gBACT,IAAI,cAAc,CAAC,qBAAqB,CAAC,EAAE;oBACzC,IAAI,GAAG,qBAAqB,CAAC;oBAC7B,MAAM;iBACP;gBACD,qBAAqB,GAAG,qBAAqB,CAAC,iBAAiB,CAAC;gBAChE,IAAI,qBAAqB,KAAK,UAAU;oBACtC,MAAM;aACT;SACF;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,KAAoB,EAAE,YAA0B;QAChG,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,CAAC,IAAc,EAAW,EAAE;YACjD,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACvF,CAAC,CAAC;QACF,MAAM,sBAAsB,GAAG,CAAC,IAAc,EAAE,OAAe,EAAE,EAAE;YACjE,IAAI,OAAO,KAAK,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,sBAAsB,CAAC,CAAC;SACnG;QACD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,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\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, HalfEdgeToBooleanFunction, NodeToNumberFunction } from \"./Graph\";\r\nimport { SignedDataSummary } from \"./SignedDataSummary\";\r\nimport { XYParitySearchContext } from \"./XYParitySearchContext\";\r\n\r\n/**\r\n * Interface for an object that executes boolean tests on edges.\r\n */\r\nexport interface HalfEdgeTestObject {\r\n  testEdge(h: HalfEdge): boolean;\r\n}\r\n/**\r\n */\r\nexport class HalfEdgeMaskTester {\r\n  private _targetMask: HalfEdgeMask;\r\n  private _targetValue: boolean;\r\n  /**\r\n   *\r\n   * @param mask mask to test in `testEdge` function\r\n   * @param targetValue value to match for true return\r\n   */\r\n  public constructor(mask: HalfEdgeMask, targetValue: boolean = true) {\r\n    this._targetMask = mask;\r\n    this._targetValue = targetValue;\r\n  }\r\n  /** Return true if the value of the targetMask matches the targetValue */\r\n  public testEdge(edge: HalfEdge): boolean {\r\n    return edge.isMaskSet(this._targetMask) === this._targetValue;\r\n  }\r\n\r\n}\r\n// Search services for HalfEdgeGraph\r\nexport class HalfEdgeGraphSearch {\r\n\r\n  /**\r\n   * * for each node of face, set the mask push to allNodesStack\r\n   * * push the faceSeed on onePerFaceStack[]\r\n   */\r\n  private static pushAndMaskAllNodesInFace(faceSeed: HalfEdge, mask: number, allNodeStack: HalfEdge[], onePerFaceStack: HalfEdge[]) {\r\n    onePerFaceStack.push(faceSeed);\r\n    faceSeed.collectAroundFace((node: HalfEdge) => {\r\n      node.setMask(mask);\r\n      allNodeStack.push(node);\r\n    });\r\n  }\r\n\r\n  /**\r\n   * Search an array of faceSeed nodes for the face with the most negative area.\r\n   * @param oneCandidateNodePerFace array containing one node from each face to be considered.\r\n   * @returns node on the minimum area face, or undefined if no such face (e.g., all faces have zero area).\r\n   */\r\n  public static findMinimumAreaFace(oneCandidateNodePerFace: HalfEdgeGraph | HalfEdge[], faceAreaFunction?: NodeToNumberFunction): HalfEdge | undefined {\r\n    const summary = HalfEdgeGraphSearch.collectFaceAreaSummary(oneCandidateNodePerFace, false, faceAreaFunction);\r\n    return summary.largestNegativeItem;\r\n  }\r\n\r\n  /**\r\n   * static method for face area computation -- useful as function parameter in collect FaceAreaSummary.\r\n   * * This simply calls `node.signedFaceArea ()`\r\n   * @param node instance for signedFaceArea call.\r\n   */\r\n  public static signedFaceArea(node: HalfEdge): number { return node.signedFaceArea(); }\r\n  /**\r\n   *\r\n   * Return a summary structure data about face (or other numeric quantity if the caller's areaFunction returns other value)\r\n   * * The default areaFunction computes area of polygonal face.\r\n   * * Callers with curved edge graphs must supply their own area function.\r\n   * @param source graph or array of nodes to examine\r\n   * @param collectAllNodes flag to pass to the SignedDataSummary constructor to control collection of nodes.\r\n   * @param areaFunction function to all to obtain area (or other numeric value)\r\n   */\r\n  public static collectFaceAreaSummary(source: HalfEdgeGraph | HalfEdge[], collectAllNodes: boolean = false,\r\n    areaFunction: NodeToNumberFunction = HalfEdgeGraphSearch.signedFaceArea): SignedDataSummary<HalfEdge> {\r\n    const result = new SignedDataSummary<HalfEdge>(collectAllNodes);\r\n    let allFaces: HalfEdge[];\r\n\r\n    if (source instanceof HalfEdgeGraph)\r\n      allFaces = source.collectFaceLoops();\r\n    else\r\n      allFaces = source;\r\n\r\n    for (const node of allFaces) {\r\n      const area = areaFunction(node);\r\n      result.announceItem(node, area);\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * Test if the graph is triangulated.\r\n   * * Return false if:\r\n   *   * Positive area face with more than 3 edges\r\n   *   * more than 1 negative area face with `allowMultipleNegativeAreaFaces` false\r\n   * * 2-edge faces are ignored.\r\n   */\r\n  public static isTriangulatedCCW(source: HalfEdgeGraph | HalfEdge[], allowMultipleNegativeAreaFaces: boolean = true, numPositiveExceptionsAllowed = 0): boolean {\r\n    let allFaces: HalfEdge[];\r\n\r\n    if (source instanceof HalfEdgeGraph)\r\n      allFaces = source.collectFaceLoops();\r\n    else\r\n      allFaces = source;\r\n    let numNegative = 0;\r\n    let numPositiveExceptions = 0;\r\n    for (const node of allFaces) {\r\n      const numEdges = node.countEdgesAroundFace();\r\n      if (numEdges >= 3) {\r\n        const area = node.signedFaceArea();\r\n        if (area > 0) {\r\n          if (numEdges > 3) {\r\n            numPositiveExceptions++;\r\n            if (numPositiveExceptions > numPositiveExceptionsAllowed)\r\n              return false;\r\n          }\r\n        } else {\r\n          numNegative++;\r\n          if (numNegative > 1) {\r\n            if (!allowMultipleNegativeAreaFaces)\r\n              return false;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Search to all accessible faces from given seed.\r\n   * * The returned array contains one representative node in each face of the connected component.\r\n   * * If (nonnull) parity mask is given, on return:\r\n   *    * It is entirely set or entirely clear around each face\r\n   *    * It is entirely set on all faces that are an even number of face-to-face steps away from the seed.\r\n   *    * It is entirely clear on all faces that are an odd number of face-to-face steps away from the seed.\r\n   * @param seedEdge first edge to search.\r\n   * @param visitMask mask applied to all faces as visited.\r\n   * @param parityMask mask to apply (a) to first face, (b) to faces with alternating parity during the search.\r\n   */\r\n  private static parityFloodFromSeed(seedEdge: HalfEdge, visitMask: HalfEdgeMask, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask): HalfEdge[] {\r\n    const faces: HalfEdge[] = [];\r\n    if (seedEdge.isMaskSet(visitMask)) return faces; // empty\r\n\r\n    const allMasks = parityMask | visitMask;\r\n    const stack: HalfEdge[] = [];\r\n    // arbitrarily call the seed face exterior ... others will alternate as visited.\r\n    HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(seedEdge, allMasks, stack, faces);  // Start with exterior as mask\r\n    while (stack.length > 0) {\r\n      const p = stack.pop()!;\r\n      const mate = p.edgeMate;\r\n      if (!mate)\r\n        continue;\r\n      if (!mate.isMaskSet(visitMask)) {\r\n        let newState = p.isMaskSet(parityMask);\r\n        if (!parityEdgeTester || parityEdgeTester.testEdge(p))\r\n          newState = !newState;\r\n        HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(mate, newState ? allMasks : visitMask, stack, faces);\r\n      }\r\n    }\r\n    return faces;\r\n  }\r\n  /**\r\n   * * Search the given faces for the one with the minimum area.\r\n   * * If the mask in that face is OFF, toggle it on (all half edges of) all the faces.\r\n   * * In a properly merged planar subdivision there should be only one true negative area face per component.\r\n   * @param graph parent graph\r\n   * @param parityMask mask which was previously set with alternating parity, but with an arbitrary start face.\r\n   * @param faces array of faces to search.\r\n   */\r\n  private static correctParityInSingleComponent(_graph: HalfEdgeGraph, mask: HalfEdgeMask, faces: HalfEdge[]) {\r\n    const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(faces);\r\n    if (!exteriorHalfEdge) {\r\n    } else if (exteriorHalfEdge.isMaskSet(mask)) {\r\n      // all should be well .. nothing to do.\r\n    } else {\r\n      // TOGGLE around the face (assuming all are consistent with the seed)\r\n      for (const faceSeed of faces) {\r\n        if (faceSeed.isMaskSet(mask)) {\r\n          faceSeed.clearMaskAroundFace(mask);\r\n        } else {\r\n          faceSeed.setMaskAroundFace(mask);\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Apply correctParityInSingleComponent to each array in components. (Quick exit if mask in NULL_MASK) */\r\n  private static correctParityInComponentArrays(graph: HalfEdgeGraph, mask: HalfEdgeMask, components: HalfEdge[][]) {\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return;\r\n    for (const facesInComponent of components)\r\n      HalfEdgeGraphSearch.correctParityInSingleComponent(graph, mask, facesInComponent);\r\n  }\r\n  /**\r\n   * Collect arrays gathering faces by connected component.\r\n   * @param graph graph to inspect\r\n   * @param parityEdgeTester (optional) function to test if an edge is a parity change (e.g., a boundary edge).\r\n   * @param parityMask (optional, along with parityEdgeTester) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.\r\n   */\r\n  public static collectConnectedComponentsWithExteriorParityMasks(graph: HalfEdgeGraph, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask = HalfEdgeMask.NULL_MASK): HalfEdge[][] {\r\n    const components = [];\r\n    const visitMask = HalfEdgeMask.VISITED;\r\n    const allMasks = parityMask | visitMask;\r\n    graph.clearMask(allMasks);\r\n    for (const faceSeed of graph.allHalfEdges) {\r\n      if (!faceSeed.isMaskSet(HalfEdgeMask.VISITED)) {\r\n        const newFaces = HalfEdgeGraphSearch.parityFloodFromSeed(faceSeed, visitMask, parityEdgeTester, parityMask);\r\n        components.push(newFaces);\r\n      }\r\n    }\r\n    HalfEdgeGraphSearch.correctParityInComponentArrays(graph, parityMask, components);\r\n    return components;\r\n  }\r\n  /**\r\n   * Test if (x,y) is inside (1), on an edge (0) or outside (-1) a face.\r\n   * @param seedNode any node on the face loop\r\n   * @param x x coordinate of test point.\r\n   * @param y y coordinate of test point.\r\n   */\r\n  public static pointInOrOnFaceXY(seedNode: HalfEdge, x: number, y: number): number | undefined {\r\n    const context = new XYParitySearchContext(x, y);\r\n    // walk around looking for an accepted node to start the search (seedNode is usually ok!)\r\n    let nodeA = seedNode;\r\n    let nodeB = seedNode.faceSuccessor;\r\n    for (; ; nodeA = nodeB) {\r\n      if (context.tryStartEdge(nodeA.x, nodeA.y, nodeB.x, nodeB.y))\r\n        break;\r\n      if (nodeB === seedNode) {\r\n        // umm.. the face is all on the x axis?\r\n        return context.classifyCounts();\r\n      }\r\n      nodeB = nodeA.faceSuccessor;\r\n    }\r\n\r\n    // nodeB is the real start node for search ... emit ends of each edge around the face,\r\n    //   stopping after emitting nodeB as an edge end.\r\n    let node = nodeB.faceSuccessor;\r\n    for (; ;) {\r\n      if (!context.advance(node.x, node.y)) {\r\n        return context.classifyCounts();\r\n      }\r\n      if (node === nodeB)\r\n        break;\r\n      node = node.faceSuccessor;\r\n    }\r\n    return context.classifyCounts();\r\n  }\r\n  /**\r\n   * Announce nodes that are \"extended face boundary\" by conditions (usually mask of node and mate) in test functions.\r\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\r\n   *   * \"Around the vertex\" from nodeA means\r\n   *      * First look at nodeA.faceSuccessor;\r\n   *      * Then look at vertexPredecessor around that vertex loop.\r\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\r\n   * * The counter of the announceEdge function is zero for the first edge, then increases with each edge.\r\n   * @param seed start node.\r\n   * @param isBoundaryEdge\r\n   * @param announceEdge\r\n   */\r\n  public static collectExtendedBoundaryLoopFromSeed(seed: HalfEdge, visitMask: HalfEdgeMask, isBoundaryEdge: HalfEdgeToBooleanFunction,\r\n    announceEdge: (edge: HalfEdge, counter: number) => void) {\r\n    let counter = 0;\r\n    while (!seed.getMask(visitMask) && isBoundaryEdge(seed)) {\r\n      announceEdge(seed, counter++);\r\n      seed.setMask(visitMask);\r\n      const vertexBase = seed.faceSuccessor;\r\n      let candidateAroundVertex = vertexBase;\r\n      for (; ;) {\r\n        if (candidateAroundVertex.getMask(visitMask))\r\n          return;\r\n        if (isBoundaryEdge(candidateAroundVertex)) {\r\n          seed = candidateAroundVertex;\r\n          break;\r\n        }\r\n        candidateAroundVertex = candidateAroundVertex.vertexPredecessor;\r\n        if (candidateAroundVertex === vertexBase)\r\n          break;\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Collect arrays of nodes \"around the boundary\" of a graph with extraneous (non-boundary) edges.\r\n   * * The \"boundary\" is nodes that do NOT have the exterior mask, but whose mates DO have the exterior mask.\r\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\r\n   *   * \"Around the vertex\" from nodeA means\r\n   *      * First look at nodeA.faceSuccessor;\r\n   *      * Then look at vertexPredecessor around that vertex loop.\r\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\r\n   * @param seed start node.\r\n   * @param isBoundaryNode\r\n   * @param announceNode\r\n   */\r\n  public static collectExtendedBoundaryLoopsInGraph(graph: HalfEdgeGraph, exteriorMask: HalfEdgeMask): HalfEdge[][] {\r\n    const loops: HalfEdge[][] = [];\r\n    const visitMask = graph.grabMask(true);\r\n    const isBoundaryEdge = (edge: HalfEdge): boolean => {\r\n      return edge.getMask(exteriorMask) === 0 && edge.edgeMate.getMask(exteriorMask) !== 0;\r\n    };\r\n    const announceEdgeInBoundary = (edge: HalfEdge, counter: number) => {\r\n      if (counter === 0)\r\n        loops.push([]);\r\n      loops[loops.length - 1].push(edge);\r\n    };\r\n    for (const seed of graph.allHalfEdges) {\r\n      this.collectExtendedBoundaryLoopFromSeed(seed, visitMask, isBoundaryEdge, announceEdgeInBoundary);\r\n    }\r\n    graph.dropMask(visitMask);\r\n    return loops;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgeGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSearch.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAY,aAAa,EAAE,YAAY,EAAmD,MAAM,SAAS,CAAC;AACjH,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAQhE;GACG;AACH,MAAM,OAAO,kBAAkB;IAG7B;;;;OAIG;IACH,YAAmB,IAAkB,EAAE,cAAuB,IAAI;QAChE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD,yEAAyE;IAClE,QAAQ,CAAC,IAAc;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC;IAChE,CAAC;CAEF;AACD,oCAAoC;AACpC,MAAM,OAAO,mBAAmB;IAE9B;;;OAGG;IACK,MAAM,CAAC,yBAAyB,CAAC,QAAkB,EAAE,IAAY,EAAE,YAAwB,EAAE,eAA2B;QAC9H,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,QAAQ,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACnB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,uBAAmD,EAAE,gBAAuC;QAC5H,MAAM,OAAO,GAAG,mBAAmB,CAAC,sBAAsB,CAAC,uBAAuB,EAAE,KAAK,EAAE,gBAAgB,CAAC,CAAC;QAC7G,OAAO,OAAO,CAAC,mBAAmB,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,cAAc,CAAC,IAAc,IAAY,OAAO,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACtF;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAkC,EAAE,kBAA2B,KAAK,EACvG,eAAqC,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC;QACvF,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAW,eAAe,CAAC,CAAC;QAChE,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,aAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACjC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAkC,EAAE,iCAA0C,IAAI,EAAE,4BAA4B,GAAG,CAAC;QAClJ,IAAI,QAAoB,CAAC;QAEzB,IAAI,MAAM,YAAY,aAAa;YACjC,QAAQ,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;;YAErC,QAAQ,GAAG,MAAM,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,qBAAqB,GAAG,CAAC,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC7C,IAAI,QAAQ,IAAI,CAAC,EAAE;gBACjB,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;gBACnC,IAAI,IAAI,GAAG,CAAC,EAAE;oBACZ,IAAI,QAAQ,GAAG,CAAC,EAAE;wBAChB,qBAAqB,EAAE,CAAC;wBACxB,IAAI,qBAAqB,GAAG,4BAA4B;4BACtD,OAAO,KAAK,CAAC;qBAChB;iBACF;qBAAM;oBACL,WAAW,EAAE,CAAC;oBACd,IAAI,WAAW,GAAG,CAAC,EAAE;wBACnB,IAAI,CAAC,8BAA8B;4BACjC,OAAO,KAAK,CAAC;qBAChB;iBACF;aACF;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,mBAAmB,CAAC,QAAkB,EAAE,SAAuB,EAAE,gBAAgD,EAAE,UAAwB;QACxJ,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,QAAQ;QAEzD,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,gFAAgF;QAChF,mBAAmB,CAAC,yBAAyB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAE,8BAA8B;QAChH,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACvB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC;YACxB,IAAI,CAAC,IAAI;gBACP,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE;gBAC9B,IAAI,QAAQ,GAAG,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;gBACvC,IAAI,CAAC,gBAAgB,IAAI,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACnD,QAAQ,GAAG,CAAC,QAAQ,CAAC;gBACvB,mBAAmB,CAAC,yBAAyB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;aACpG;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,MAAqB,EAAE,IAAkB,EAAE,KAAiB;QACxG,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACxE,IAAI,CAAC,gBAAgB,EAAE;SACtB;aAAM,IAAI,gBAAgB,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;YAC3C,uCAAuC;SACxC;aAAM;YACL,qEAAqE;YACrE,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE;gBAC5B,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBAC5B,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;iBACpC;qBAAM;oBACL,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;iBAClC;aACF;SACF;IACH,CAAC;IACD,0GAA0G;IAClG,MAAM,CAAC,8BAA8B,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB;QAC9G,IAAI,IAAI,KAAK,YAAY,CAAC,SAAS;YACjC,OAAO;QACT,KAAK,MAAM,gBAAgB,IAAI,UAAU;YACvC,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACtF,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iDAAiD,CAAC,KAAoB,EAAE,gBAAgD,EAAE,aAA2B,YAAY,CAAC,SAAS;QACvL,MAAM,UAAU,GAAG,EAAE,CAAC;QACtB,MAAM,SAAS,GAAG,YAAY,CAAC,OAAO,CAAC;QACvC,MAAM,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;QACxC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,YAAY,EAAE;YACzC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,EAAE;gBAC7C,MAAM,QAAQ,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,QAAQ,EAAE,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;gBAC5G,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;aAC3B;SACF;QACD,mBAAmB,CAAC,8BAA8B,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClF,OAAO,UAAU,CAAC;IACpB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,QAAkB,EAAE,CAAS,EAAE,CAAS;QACtE,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,yFAAyF;QACzF,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,GAAG,QAAQ,CAAC,aAAa,CAAC;QACnC,QAAS,KAAK,GAAG,KAAK,EAAE;YACtB,IAAI,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;gBAC1D,MAAM;YACR,IAAI,KAAK,KAAK,QAAQ,EAAE;gBACtB,uCAAuC;gBACvC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B;QAED,sFAAsF;QACtF,kDAAkD;QAClD,IAAI,IAAI,GAAG,KAAK,CAAC,aAAa,CAAC;QAC/B,SAAU;YACR,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE;gBACpC,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;aACjC;YACD,IAAI,IAAI,KAAK,KAAK;gBAChB,MAAM;YACR,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC;SAC3B;QACD,OAAO,OAAO,CAAC,cAAc,EAAE,CAAC;IAClC,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,IAAc,EAAE,SAAuB,EAAE,cAAyC,EAClI,YAAuD;QACvD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;YACvD,YAAY,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxB,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC;YACtC,IAAI,qBAAqB,GAAG,UAAU,CAAC;YACvC,SAAU;gBACR,IAAI,qBAAqB,CAAC,OAAO,CAAC,SAAS,CAAC;oBAC1C,OAAO;gBACT,IAAI,cAAc,CAAC,qBAAqB,CAAC,EAAE;oBACzC,IAAI,GAAG,qBAAqB,CAAC;oBAC7B,MAAM;iBACP;gBACD,qBAAqB,GAAG,qBAAqB,CAAC,iBAAiB,CAAC;gBAChE,IAAI,qBAAqB,KAAK,UAAU;oBACtC,MAAM;aACT;SACF;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,mCAAmC,CAAC,KAAoB,EAAE,YAA0B;QAChG,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,cAAc,GAAG,CAAC,IAAc,EAAW,EAAE;YACjD,OAAO,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QACvF,CAAC,CAAC;QACF,MAAM,sBAAsB,GAAG,CAAC,IAAc,EAAE,OAAe,EAAE,EAAE;YACjE,IAAI,OAAO,KAAK,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,SAAS,EAAE,cAAc,EAAE,sBAAsB,CAAC,CAAC;SACnG;QACD,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,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\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, HalfEdgeToBooleanFunction, NodeToNumberFunction } from \"./Graph\";\r\nimport { SignedDataSummary } from \"./SignedDataSummary\";\r\nimport { XYParitySearchContext } from \"./XYParitySearchContext\";\r\n\r\n/**\r\n * Interface for an object that executes boolean tests on edges.\r\n */\r\nexport interface HalfEdgeTestObject {\r\n  testEdge(h: HalfEdge): boolean;\r\n}\r\n/**\r\n */\r\nexport class HalfEdgeMaskTester {\r\n  private _targetMask: HalfEdgeMask;\r\n  private _targetValue: boolean;\r\n  /**\r\n   *\r\n   * @param mask mask to test in `testEdge` function\r\n   * @param targetValue value to match for true return\r\n   */\r\n  public constructor(mask: HalfEdgeMask, targetValue: boolean = true) {\r\n    this._targetMask = mask;\r\n    this._targetValue = targetValue;\r\n  }\r\n  /** Return true if the value of the targetMask matches the targetValue */\r\n  public testEdge(edge: HalfEdge): boolean {\r\n    return edge.isMaskSet(this._targetMask) === this._targetValue;\r\n  }\r\n\r\n}\r\n// Search services for HalfEdgeGraph\r\nexport class HalfEdgeGraphSearch {\r\n\r\n  /**\r\n   * * for each node of face, set the mask push to allNodesStack\r\n   * * push the faceSeed on onePerFaceStack[]\r\n   */\r\n  private static pushAndMaskAllNodesInFace(faceSeed: HalfEdge, mask: number, allNodeStack: HalfEdge[], onePerFaceStack: HalfEdge[]) {\r\n    onePerFaceStack.push(faceSeed);\r\n    faceSeed.collectAroundFace((node: HalfEdge) => {\r\n      node.setMask(mask);\r\n      allNodeStack.push(node);\r\n    });\r\n  }\r\n\r\n  /**\r\n   * Search an array of faceSeed nodes for the face with the most negative area.\r\n   * @param oneCandidateNodePerFace array containing one node from each face to be considered.\r\n   * @returns node on the minimum area face, or undefined if no such face (e.g., all faces have zero area).\r\n   */\r\n  public static findMinimumAreaFace(oneCandidateNodePerFace: HalfEdgeGraph | HalfEdge[], faceAreaFunction?: NodeToNumberFunction): HalfEdge | undefined {\r\n    const summary = HalfEdgeGraphSearch.collectFaceAreaSummary(oneCandidateNodePerFace, false, faceAreaFunction);\r\n    return summary.largestNegativeItem;\r\n  }\r\n\r\n  /**\r\n   * static method for face area computation -- useful as function parameter in collect FaceAreaSummary.\r\n   * * This simply calls `node.signedFaceArea ()`\r\n   * @param node instance for signedFaceArea call.\r\n   */\r\n  public static signedFaceArea(node: HalfEdge): number { return node.signedFaceArea(); }\r\n  /**\r\n   *\r\n   * Return a summary structure data about face (or other numeric quantity if the caller's areaFunction returns other value)\r\n   * * The default areaFunction computes area of polygonal face.\r\n   * * Callers with curved edge graphs must supply their own area function.\r\n   * @param source graph or array of nodes to examine\r\n   * @param collectAllNodes flag to pass to the SignedDataSummary constructor to control collection of nodes.\r\n   * @param areaFunction function to all to obtain area (or other numeric value)\r\n   */\r\n  public static collectFaceAreaSummary(source: HalfEdgeGraph | HalfEdge[], collectAllNodes: boolean = false,\r\n    areaFunction: NodeToNumberFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node)): SignedDataSummary<HalfEdge> {\r\n    const result = new SignedDataSummary<HalfEdge>(collectAllNodes);\r\n    let allFaces: HalfEdge[];\r\n\r\n    if (source instanceof HalfEdgeGraph)\r\n      allFaces = source.collectFaceLoops();\r\n    else\r\n      allFaces = source;\r\n\r\n    for (const node of allFaces) {\r\n      const area = areaFunction(node);\r\n      result.announceItem(node, area);\r\n    }\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * Test if the graph is triangulated.\r\n   * * Return false if:\r\n   *   * Positive area face with more than 3 edges\r\n   *   * more than 1 negative area face with `allowMultipleNegativeAreaFaces` false\r\n   * * 2-edge faces are ignored.\r\n   */\r\n  public static isTriangulatedCCW(source: HalfEdgeGraph | HalfEdge[], allowMultipleNegativeAreaFaces: boolean = true, numPositiveExceptionsAllowed = 0): boolean {\r\n    let allFaces: HalfEdge[];\r\n\r\n    if (source instanceof HalfEdgeGraph)\r\n      allFaces = source.collectFaceLoops();\r\n    else\r\n      allFaces = source;\r\n    let numNegative = 0;\r\n    let numPositiveExceptions = 0;\r\n    for (const node of allFaces) {\r\n      const numEdges = node.countEdgesAroundFace();\r\n      if (numEdges >= 3) {\r\n        const area = node.signedFaceArea();\r\n        if (area > 0) {\r\n          if (numEdges > 3) {\r\n            numPositiveExceptions++;\r\n            if (numPositiveExceptions > numPositiveExceptionsAllowed)\r\n              return false;\r\n          }\r\n        } else {\r\n          numNegative++;\r\n          if (numNegative > 1) {\r\n            if (!allowMultipleNegativeAreaFaces)\r\n              return false;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Search to all accessible faces from given seed.\r\n   * * The returned array contains one representative node in each face of the connected component.\r\n   * * If (nonnull) parity mask is given, on return:\r\n   *    * It is entirely set or entirely clear around each face\r\n   *    * It is entirely set on all faces that are an even number of face-to-face steps away from the seed.\r\n   *    * It is entirely clear on all faces that are an odd number of face-to-face steps away from the seed.\r\n   * @param seedEdge first edge to search.\r\n   * @param visitMask mask applied to all faces as visited.\r\n   * @param parityMask mask to apply (a) to first face, (b) to faces with alternating parity during the search.\r\n   */\r\n  private static parityFloodFromSeed(seedEdge: HalfEdge, visitMask: HalfEdgeMask, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask): HalfEdge[] {\r\n    const faces: HalfEdge[] = [];\r\n    if (seedEdge.isMaskSet(visitMask)) return faces; // empty\r\n\r\n    const allMasks = parityMask | visitMask;\r\n    const stack: HalfEdge[] = [];\r\n    // arbitrarily call the seed face exterior ... others will alternate as visited.\r\n    HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(seedEdge, allMasks, stack, faces);  // Start with exterior as mask\r\n    while (stack.length > 0) {\r\n      const p = stack.pop()!;\r\n      const mate = p.edgeMate;\r\n      if (!mate)\r\n        continue;\r\n      if (!mate.isMaskSet(visitMask)) {\r\n        let newState = p.isMaskSet(parityMask);\r\n        if (!parityEdgeTester || parityEdgeTester.testEdge(p))\r\n          newState = !newState;\r\n        HalfEdgeGraphSearch.pushAndMaskAllNodesInFace(mate, newState ? allMasks : visitMask, stack, faces);\r\n      }\r\n    }\r\n    return faces;\r\n  }\r\n  /**\r\n   * * Search the given faces for the one with the minimum area.\r\n   * * If the mask in that face is OFF, toggle it on (all half edges of) all the faces.\r\n   * * In a properly merged planar subdivision there should be only one true negative area face per component.\r\n   * @param graph parent graph\r\n   * @param parityMask mask which was previously set with alternating parity, but with an arbitrary start face.\r\n   * @param faces array of faces to search.\r\n   */\r\n  private static correctParityInSingleComponent(_graph: HalfEdgeGraph, mask: HalfEdgeMask, faces: HalfEdge[]) {\r\n    const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(faces);\r\n    if (!exteriorHalfEdge) {\r\n    } else if (exteriorHalfEdge.isMaskSet(mask)) {\r\n      // all should be well .. nothing to do.\r\n    } else {\r\n      // TOGGLE around the face (assuming all are consistent with the seed)\r\n      for (const faceSeed of faces) {\r\n        if (faceSeed.isMaskSet(mask)) {\r\n          faceSeed.clearMaskAroundFace(mask);\r\n        } else {\r\n          faceSeed.setMaskAroundFace(mask);\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Apply correctParityInSingleComponent to each array in components. (Quick exit if mask in NULL_MASK) */\r\n  private static correctParityInComponentArrays(graph: HalfEdgeGraph, mask: HalfEdgeMask, components: HalfEdge[][]) {\r\n    if (mask === HalfEdgeMask.NULL_MASK)\r\n      return;\r\n    for (const facesInComponent of components)\r\n      HalfEdgeGraphSearch.correctParityInSingleComponent(graph, mask, facesInComponent);\r\n  }\r\n  /**\r\n   * Collect arrays gathering faces by connected component.\r\n   * @param graph graph to inspect\r\n   * @param parityEdgeTester (optional) function to test if an edge is a parity change (e.g., a boundary edge).\r\n   * @param parityMask (optional, along with parityEdgeTester) mask to apply indicating parity.  If this is Mask.NULL_MASK, there is no record of parity.\r\n   */\r\n  public static collectConnectedComponentsWithExteriorParityMasks(graph: HalfEdgeGraph, parityEdgeTester: HalfEdgeTestObject | undefined, parityMask: HalfEdgeMask = HalfEdgeMask.NULL_MASK): HalfEdge[][] {\r\n    const components = [];\r\n    const visitMask = HalfEdgeMask.VISITED;\r\n    const allMasks = parityMask | visitMask;\r\n    graph.clearMask(allMasks);\r\n    for (const faceSeed of graph.allHalfEdges) {\r\n      if (!faceSeed.isMaskSet(HalfEdgeMask.VISITED)) {\r\n        const newFaces = HalfEdgeGraphSearch.parityFloodFromSeed(faceSeed, visitMask, parityEdgeTester, parityMask);\r\n        components.push(newFaces);\r\n      }\r\n    }\r\n    HalfEdgeGraphSearch.correctParityInComponentArrays(graph, parityMask, components);\r\n    return components;\r\n  }\r\n  /**\r\n   * Test if (x,y) is inside (1), on an edge (0) or outside (-1) a face.\r\n   * @param seedNode any node on the face loop\r\n   * @param x x coordinate of test point.\r\n   * @param y y coordinate of test point.\r\n   */\r\n  public static pointInOrOnFaceXY(seedNode: HalfEdge, x: number, y: number): number | undefined {\r\n    const context = new XYParitySearchContext(x, y);\r\n    // walk around looking for an accepted node to start the search (seedNode is usually ok!)\r\n    let nodeA = seedNode;\r\n    let nodeB = seedNode.faceSuccessor;\r\n    for (; ; nodeA = nodeB) {\r\n      if (context.tryStartEdge(nodeA.x, nodeA.y, nodeB.x, nodeB.y))\r\n        break;\r\n      if (nodeB === seedNode) {\r\n        // umm.. the face is all on the x axis?\r\n        return context.classifyCounts();\r\n      }\r\n      nodeB = nodeA.faceSuccessor;\r\n    }\r\n\r\n    // nodeB is the real start node for search ... emit ends of each edge around the face,\r\n    //   stopping after emitting nodeB as an edge end.\r\n    let node = nodeB.faceSuccessor;\r\n    for (; ;) {\r\n      if (!context.advance(node.x, node.y)) {\r\n        return context.classifyCounts();\r\n      }\r\n      if (node === nodeB)\r\n        break;\r\n      node = node.faceSuccessor;\r\n    }\r\n    return context.classifyCounts();\r\n  }\r\n  /**\r\n   * Announce nodes that are \"extended face boundary\" by conditions (usually mask of node and mate) in test functions.\r\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\r\n   *   * \"Around the vertex\" from nodeA means\r\n   *      * First look at nodeA.faceSuccessor;\r\n   *      * Then look at vertexPredecessor around that vertex loop.\r\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\r\n   * * The counter of the announceEdge function is zero for the first edge, then increases with each edge.\r\n   * @param seed start node.\r\n   * @param isBoundaryEdge\r\n   * @param announceEdge\r\n   */\r\n  public static collectExtendedBoundaryLoopFromSeed(seed: HalfEdge, visitMask: HalfEdgeMask, isBoundaryEdge: HalfEdgeToBooleanFunction,\r\n    announceEdge: (edge: HalfEdge, counter: number) => void) {\r\n    let counter = 0;\r\n    while (!seed.getMask(visitMask) && isBoundaryEdge(seed)) {\r\n      announceEdge(seed, counter++);\r\n      seed.setMask(visitMask);\r\n      const vertexBase = seed.faceSuccessor;\r\n      let candidateAroundVertex = vertexBase;\r\n      for (; ;) {\r\n        if (candidateAroundVertex.getMask(visitMask))\r\n          return;\r\n        if (isBoundaryEdge(candidateAroundVertex)) {\r\n          seed = candidateAroundVertex;\r\n          break;\r\n        }\r\n        candidateAroundVertex = candidateAroundVertex.vertexPredecessor;\r\n        if (candidateAroundVertex === vertexBase)\r\n          break;\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Collect arrays of nodes \"around the boundary\" of a graph with extraneous (non-boundary) edges.\r\n   * * The \"boundary\" is nodes that do NOT have the exterior mask, but whose mates DO have the exterior mask.\r\n   * * After each node, the next candidate in reached by looking \"around the head vertex loop\" for the next boundary.\r\n   *   * \"Around the vertex\" from nodeA means\r\n   *      * First look at nodeA.faceSuccessor;\r\n   *      * Then look at vertexPredecessor around that vertex loop.\r\n   * * Each accepted node is passed to announceNode, and marked with the visit mask.\r\n   * @param seed start node.\r\n   * @param isBoundaryNode\r\n   * @param announceNode\r\n   */\r\n  public static collectExtendedBoundaryLoopsInGraph(graph: HalfEdgeGraph, exteriorMask: HalfEdgeMask): HalfEdge[][] {\r\n    const loops: HalfEdge[][] = [];\r\n    const visitMask = graph.grabMask(true);\r\n    const isBoundaryEdge = (edge: HalfEdge): boolean => {\r\n      return edge.getMask(exteriorMask) === 0 && edge.edgeMate.getMask(exteriorMask) !== 0;\r\n    };\r\n    const announceEdgeInBoundary = (edge: HalfEdge, counter: number) => {\r\n      if (counter === 0)\r\n        loops.push([]);\r\n      loops[loops.length - 1].push(edge);\r\n    };\r\n    for (const seed of graph.allHalfEdges) {\r\n      this.collectExtendedBoundaryLoopFromSeed(seed, visitMask, isBoundaryEdge, announceEdgeInBoundary);\r\n    }\r\n    graph.dropMask(visitMask);\r\n    return loops;\r\n  }\r\n}\r\n"]}

package/lib/esm/topology/HalfEdgeGraphSpineContext.js

@@ -208,7 +208,7 @@ class HalfEdgeGraphSpineContext {
             if (b > minA)
                 candidates.push(new NodeSortKey(node, b));
         }
-        candidates.sort(NodeSortKey.compareForSort);
+        candidates.sort((dataA, dataB) => NodeSortKey.compareForSort(dataA, dataB));
         let key;
         while (undefined !== (key = candidates.pop())) {
             const pA = key.node;

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

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgeGraphSpineContext.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSpineContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAChF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,iBAAiB;AACjB,+BAA+B;AAC/B,iCAAiC;AACjC,qCAAqC;AAErC,SAAS,aAAa,CAAC,CAAS;IAC9B,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACxB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvC,OAAO,MAAM,CAAC;AAChB,CAAC;AACD,SAAS,cAAc,CAAC,CAAS;IAC/B,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACxB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxC,OAAO,MAAM,CAAC;AAChB,CAAC;AACD,8EAA8E;AAC9E,MAAM,WAAW;IAGf,IAAW,IAAI,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAExC,YAAmB,IAAc,EAAE,CAAS;QAC1C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;IACd,CAAC;IACM,MAAM,CAAC,cAAc,CAAC,KAAkB,EAAE,KAAkB,IAAY,OAAO,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;CAC7G;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAa,yBAAyB;IAMpC,IAAW,KAAK,KAAK,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC/C;;;OAGG;IACH;QACE,IAAI,CAAC,WAAW,GAAG,IAAI,aAAa,EAAE,CAAC;QACvC,iEAAiE;QACjE,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;QACjD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC9C,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,CAAC;IAClC,CAAC;IAED,kEAAkE;IAC1D,OAAO,CAAC,MAAmB,EAAE,IAAa,EAAE,IAAa;QAC/D,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxB,CAAC;IAEO,aAAa,CAAC,YAAsB,EAC1C,KAAiB,EACjB,MAAiB;QACjB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;QAC3C,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACjB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC;eAChD,YAAY,CAAC,oBAAoB,EAAE,KAAK,CAAC;eACzC,YAAY,CAAC,oBAAoB,EAAE,KAAK,CAAC,EAAE;YAC9C,MAAM,KAAK,GAAG,YAAY,CAAC,aAAa,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,YAAY,CAAC,aAAa,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACxB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iCAAiC;IACjC,oEAAoE;IACpE,gCAAgC;IACxB,eAAe,CAAC,aAAuB;QAE7C,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE;YACpD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAE1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAErD,MAAM,YAAY,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,YAAY,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC;YACrB,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC;YACrB,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YAExE,MAAM,KAAK,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACpD,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACnD,OAAO,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;SACpC;QAED,OAAO,MAAM,CAAC,iBAAiB,CAAC;IAClC,CAAC;IAED,uCAAuC;IACvC,4FAA4F;IACpF,2BAA2B,CAAC,IAAe;QAEjD,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAK,0BAA0B;QAC/D,MAAM,iBAAiB,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAG,sEAAsE;QACpH,mBAAmB;QACnB,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7B;QACD,QAAQ,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAEjC,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAI,iBAAiB;YACjF,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;SACnC;QAED,mDAAmD;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;SAChE;QAED,iBAAiB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QAEhC,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACzC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,IAAI,QAAQ,CAAC;QACb,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,iEAAiE;YACjE,QAAQ,GAAG,MAAM,CAAC,iBAAiB,CAAC;YACpC,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAClC,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,cAAc,CAAC,CAAC,OAAO,CAAC;gBAC1E,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ;oBACrB,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;aACvB;YACD,IAAI,QAAQ,GAAG,SAAS,EAAE;gBACxB,SAAS,GAAG,QAAQ,CAAC;gBACrB,SAAS,GAAG,CAAC,CAAC;aACf;SACF;QACD,OAAO,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAEO,OAAO,CAAC,EAAY;QAE1B,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC;QACvB,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC/B,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC/B,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAEO,sBAAsB,CAAC,IAAY;QAEzC,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YAChD,MAAM,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,CAAC,GAAG,IAAI;gBACV,UAAU,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;SAC7C;QAED,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,CAAC;QAE5C,IAAI,GAAG,CAAC;QACR,OAAO,SAAS,KAAK,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE;YAC7C,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC;YACpB,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC;YACvB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;mBACzB,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAC/B,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACjB,WAAW,EAAE,CAAC;aACf;SACF;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,gEAAgE;IACxD,OAAO,CAAC,IAAa,EAAE,IAAa,EAAE,IAAa,EAAE,IAAa,EAAE,QAAgB;QAE1F,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;QACtD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;QACtD,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC;IACxE,CAAC;IAED,iDAAiD;IACjD,gDAAgD;IAChD,uCAAuC;IACvC,0DAA0D;IAC1D,0CAA0C;IAC1C,oCAAoC;IAC5B,6BAA6B,CAAC,eAAuB,EAAE,mBAA2B;QAExF,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YAC9C,MAAM,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;YAC5B,MAAM,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;YAC5B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC;mBACjC,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAG,4BAA4B;mBACtE,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAG,4BAA4B;mBACtE,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC;mBACtC,EAAE,CAAC,aAAa,KAAK,EAAE,EAC1B;gBACA,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,gBAAgB,GAAG,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;gBACtE,uDAAuD;gBACvD,IAAI,gBAAgB,GAAG,mBAAmB,EAAE,EAAE,wCAAwC;oBACpF,MAAM,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;oBACzC,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;oBAC1C,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG,EAAE;wBACzC,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;wBACvC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,CAAC,EAAE;4BACzD,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;4BACvD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;4BACtE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;4BACnB,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;4BAC9C,MAAM,EAAE,CAAC;yBACV;qBACF;iBACF;aACF;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,mBAAmB,CACzB,KAAe,EACf,MAAmB,EACnB,gBAAyB;IACzB,oEAAoE;IACpE,aAAsB;IACtB,iFAAiF;IACjF,oBAA6B;QAE7B,IAAI,KAAK,CAAC,oBAAoB,EAAE,KAAK,CAAC;YACpC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC5B,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,WAAW,GAAc,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YACpE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC;gBAC9C,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;;gBAE7B,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;YAC/B,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;YAC/B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7B;QACD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;SAC/B;QAED,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,WAAW,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,EAAE;YAC1C,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;gBAC1C,IAAI,gBAAgB;oBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;SAC5D;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;gBAC1C,IAAI,aAAa;oBACf,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;SACjD;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;gBACrC,2CAA2C;gBAC3C,IAAI,gBAAgB;oBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACxE;iBAAM;gBACL,yFAAyF;gBACzF,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAChC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,oBAAoB,CAAC;2BACvC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC;wBACxC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;aACjD;SACF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,gBAAgB;gBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YACzD,IAAI,aAAa;gBACf,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC9D;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,uBAAuB,CAC7B,KAAe,EAAE,MAAmB,EACpC,gBAAyB,EACzB,aAAsB;QAEtB,IAAI,KAAK,CAAC,oBAAoB,EAAE,KAAK,CAAC;YACpC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,WAAW,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACzC,MAAM,UAAU,GAAc,EAAE,CAAC;QACjC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,GAAG;YACD,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,UAAU,EAAE,CAAC;YAClC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACtB,IAAI,WAAW,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE;gBACnD,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACrB,WAAW,EAAE,CAAC;gBACd,YAAY,GAAG,CAAC,CAAC;aAClB;iBAAM;gBACL,YAAY,GAAG,CAAC,CAAC;aAClB;YACD,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC,EAAE,CAAC;SACL,QAAQ,CAAC,WAAW,GAAG,WAAW,CAAC,aAAa,CAAC,KAAK,KAAK,EAAE;QAE9D,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrD,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;SACrC;QAED,WAAW,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAEpC,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,kBAAkB;YAClB,MAAM,WAAW,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,CAAC;YAC1D,IAAI,gBAAgB,EAAE;gBACpB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;aACnD;SACF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,gBAAgB;gBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;SACtF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,aAAa,IAAI,YAAY,IAAI,CAAC;gBACpC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1E;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,CAAC;YAC1D,IAAI,aAAa,EAAE;gBACjB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;aACnD;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,KAAgB,EAAE,OAAgB;QACnD,IAAI,UAAU,EAAE,OAAO,CAAC;QACxB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,gBAAgB,CAC7C,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACpC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YAC1C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC5B,OAAO,GAAG,KAAK,CAAC;aACjB;iBAAM;gBACL,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;aACnC;YACD,UAAU,GAAG,KAAK,CAAC;SACpB;QACD,IAAI,OAAO,IAAI,OAAO,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS;YAC9D,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACxC,CAAC;IACD;;;;OAIG;IACK,cAAc,CAAC,YAA0B;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YACjD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;gBACtC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;oBAC9D,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;oBAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;oBAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;wBAChE,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;wBAC9B,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;qBAC/B;iBACF;aACF;SACF;IACH,CAAC;IAGD;;;;OAIG;IACI,mBAAmB,CAAC,cAAuB,IAAI,EAAE,kBAA0B,GAAG;QAEnF,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,oBAAoB,GAAG,GAAG,CAAC;QACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,kBAAkB,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,kBAAkB,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,QAAQ,CAAC,eAAe,CAAC,yBAAyB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;QACxE,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,QAAQ,CAAC,eAAe,CAAC,KAAK,EAAE,yBAAyB,CAAC,YAAY,CAAC,CAAC;QACxE,IAAI,WAAW,EAAE;YACf,mBAAmB,CAAC,iDAAiD,CAAC,IAAI,CAAC,KAAK,EAC9E,IAAI,kBAAkB,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC7E,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;SAC5C;QAED,YAAY,CAAC,+BAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,YAAY,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEvC,OAAO,QAAQ,EAAE,GAAG,SAAS,EAAE;YAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,6BAA6B,CAAC,eAAe,EAAE,oBAAoB,CAAC,CAAC;YAC1F,IAAI,OAAO,IAAI,CAAC;gBACd,MAAM;YACR,YAAY,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxC;IACH,CAAC;IAED,0BAA0B;IAC1B,qDAAqD;IACrD,sDAAsD;IACtD,gDAAgD;IAChD;;;;;;OAMG;IACI,aAAa,CAAC,mBAA4B,IAAI,EAAE,gBAAyB,IAAI,EAAE,uBAAgC,IAAI;QACxH,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAChC,CAAC,MAAqB,EAAE,QAAkB,EAAE,EAAE;YAC5C,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE;gBAC5C,IAAI,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,CAAC,EAAE;iBACpF;qBAAM,IAAI,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,oBAAoB,CAAC,EAAE;iBAC7G;aACF;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACL,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,2BAA2B,CAAC,gBAAyB,EAAE,WAAkB,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC;QAErG,MAAM,WAAW,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClE,IAAI,gBAAgB,IAAI,WAAW,GAAG,CAAC,EAAE;YACvC,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAC3B,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;SACzD;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;;AAjFc,sCAAY,GAAG,IAAI,CAAC;AACpB,sCAAY,GAAG,KAAK,CAAC;SAlazB,yBAAyB","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\nimport { Geometry } from \"../Geometry\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { HalfEdgeGraphMerge } from \"./Merging\";\r\nimport { Triangulator } from \"./Triangulation\";\r\nimport { RegularizationContext } from \"./RegularizeFace\";\r\nimport { HalfEdgeGraphSearch, HalfEdgeMaskTester } from \"./HalfEdgeGraphSearch\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n// cSpell:disable\r\n// const sSpineRelTol = 1.0e-8;\r\n// const sSpineGraphAbsTol = 0.0;\r\n// const sSpineGraphRelTol = 1.0e-10;\r\n\r\nfunction createNPoints(n: number): Point3d[] {\r\n  const points = [];\r\n  for (let i = 0; i < n; i++)\r\n    points.push(Point3d.create(0, 0, 0));\r\n  return points;\r\n}\r\nfunction createNVectors(n: number): Vector3d[] {\r\n  const points = [];\r\n  for (let i = 0; i < n; i++)\r\n    points.push(Vector3d.create(0, 0, 0));\r\n  return points;\r\n}\r\n// Local struct to pair a graph node with a double as a sort key for std::sort\r\nclass NodeSortKey {\r\n  private _a: number;\r\n  private _node: HalfEdge;\r\n  public get node() { return this._node; }\r\n\r\n  public constructor(node: HalfEdge, b: number) {\r\n    this._node = node;\r\n    this._a = b;\r\n  }\r\n  public static compareForSort(dataA: NodeSortKey, dataB: NodeSortKey): number { return dataA._a - dataB._a; }\r\n}\r\n\r\n/**\r\n * Context manager to hold a vu graph and do spine operations\r\n *\r\n * Spine calculations determine both (a) a \"skeletal\" network of linework that follows the interior\r\n *      path through within the boundaries, and (b) a block decomposition into quads and triangles.\r\n *\r\n * Usage pattern:\r\n * ```\r\n *    const sc = new HalfEdgeGraphSpineContext();\r\n *   // Data setup ....\r\n *    foreach polygon or polyline\r\n *        {\r\n *        sc.InsertEdges (edgePoints, bClosed)\r\n *        }\r\n *   // Analysis steps ...\r\n *     * bParity = true to treat the data as a \"polygon\".  The interior is determined by parity rules\r\n *                   and the triangulation and spine are only constructed \"inside\"\r\n *     * bParity = false if \"all\" spaces are to be triangulated and spined.\r\n *     * minSplitRadians -- suggested value 0.3.  If this value is large, it will encourage add internal\r\n *     *     edges from a vertex to an edge 'across' the polygon even if it creates small angles.\r\n *     * minDiagonalAngle -- suggested value 1.0.  If this value is large (up to about 1.5 as max) it favors\r\n *     *     using triangles to navigate turns.  If it is small, it favors using skewed quadrilaterals.\r\n *    sc.TriangulateForSpine (bParity, minSplitRadians)\r\n *    sc.MarkBoxes (true, minDiagonalAngle);\r\n *    edges = sc.GetSpineEdges ();\r\n * ```\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphSpineContext {\r\n  /** The Evolving graph */\r\n  private _spineGraph: HalfEdgeGraph;\r\n  /** mask marking edges that have been paired into quads */\r\n  private _diagonalMask: HalfEdgeMask;\r\n  private _boxMask: HalfEdgeMask;\r\n  public get graph() { return this._spineGraph; }\r\n  /**\r\n   * Create a context with an empty graph.\r\n   * * Reserve masks for specialized markup.\r\n   */\r\n  public constructor() {\r\n    this._spineGraph = new HalfEdgeGraph();\r\n    // vu_setTol (_spineGraph, sSpineGraphAbsTol, sSpineGraphRelTol);\r\n    this._diagonalMask = this._spineGraph.grabMask();\r\n    this._boxMask = this._spineGraph.grabMask();\r\n  }\r\n\r\n  /**\r\n   * Release resources to the graph.\r\n   */\r\n  public teardown() {\r\n    this._spineGraph.dropMask(this._diagonalMask);\r\n    this._spineGraph.dropMask(this._boxMask);\r\n    this._spineGraph.decommission();\r\n  }\r\n\r\n  //  an edge (as new bvector<DPoint3d> at back, with cloned points>\r\n  private addEdge(xyzOut: Point3d[][], xyzA: Point3d, xyzB: Point3d) {\r\n    const newArray = [];\r\n    newArray.push(xyzA.clone());\r\n    newArray.push(xyzB.clone());\r\n    xyzOut.push(newArray);\r\n  }\r\n\r\n  private getBoxCorners(diagonalNode: HalfEdge,\r\n    nodes: HalfEdge[],\r\n    points: Point3d[]): boolean {\r\n    const diagonalMate = diagonalNode.edgeMate;\r\n    nodes.length = 0;\r\n    points.length = 0;\r\n    if (!diagonalNode.getMask(HalfEdgeMask.BOUNDARY_EDGE)\r\n      && diagonalNode.countEdgesAroundFace() === 3\r\n      && diagonalMate.countEdgesAroundFace() === 3) {\r\n      const nodeA = diagonalMate.faceSuccessor;\r\n      nodes.push(nodeA);\r\n      nodes.push(nodeA.faceSuccessor);\r\n      const nodeB = diagonalNode.faceSuccessor;\r\n      nodes.push(nodeB);\r\n      nodes.push(nodeB.faceSuccessor);\r\n      for (let i = 0; i < 4; i++)\r\n        points.push(Point3d.create(nodes[i].x, nodes[i].y));\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  // Compute bisectors of the quad.\r\n  // function key is the smaller absolute angle between the bisectors.\r\n  // (pi/2 is max possible value).\r\n  private diagonalKeyFunc(pDiagonalNode: HalfEdge): number {\r\n\r\n    const nodes: HalfEdge[] = [];\r\n    const points: Point3d[] = [];\r\n    if (this.getBoxCorners(pDiagonalNode, nodes, points)) {\r\n      const xyzA = points[0];\r\n      const xyzB = points[1];\r\n      const xyzC = points[2];\r\n      const xyzD = points[3];\r\n      const xyzAB = xyzA.interpolate(0.5, xyzB);\r\n      const xyzBC = xyzB.interpolate(0.5, xyzC);\r\n      const xyzCD = xyzC.interpolate(0.5, xyzD);\r\n      const xyzDA = xyzD.interpolate(0.5, xyzA);\r\n\r\n      const vectorAB = Vector3d.createStartEnd(xyzA, xyzB);\r\n      const vectorBC = Vector3d.createStartEnd(xyzB, xyzC);\r\n      const vectorCD = Vector3d.createStartEnd(xyzC, xyzD);\r\n      const vectorDA = Vector3d.createStartEnd(xyzD, xyzA);\r\n\r\n      const vectorABToCD = Vector3d.createStartEnd(xyzCD, xyzAB);\r\n      const vectorBCToDA = Vector3d.createStartEnd(xyzDA, xyzBC);\r\n      vectorABToCD.z = 0.0;\r\n      vectorBCToDA.z = 0.0;\r\n      const thetaAB = vectorABToCD.smallerUnorientedAngleTo(vectorAB).radians;\r\n      const thetaBC = vectorBCToDA.smallerUnorientedAngleTo(vectorBC).radians;\r\n      const thetaCD = vectorABToCD.smallerUnorientedAngleTo(vectorCD).radians;\r\n      const thetaDA = vectorBCToDA.smallerUnorientedAngleTo(vectorDA).radians;\r\n\r\n      const alpha = thetaAB < thetaCD ? thetaAB : thetaCD;\r\n      const beta = thetaBC < thetaDA ? thetaBC : thetaDA;\r\n      return alpha < beta ? alpha : beta;\r\n    }\r\n\r\n    return Number.NEGATIVE_INFINITY;\r\n  }\r\n\r\n  // Select a branch point in a triangle.\r\n  // This may be the centroid or the midpoint of an edge joining midpoints of a pair of edges.\r\n  private selectTriangleInteriorPoint(pXYZ: Point3d[]): Point3d {\r\n\r\n    const xyz = createNPoints(6);\r\n    const xyzMid = createNPoints(6);     // Midpoints of each edge.\r\n    const interiorCandidate = createNPoints(4);   // for i in {012}, [i] is midpoint of midpoint[i+1] and midpoint[i+2].\r\n    // [3] is centroid.\r\n    const edgeVector = createNVectors(6);\r\n    const centroid = Point3d.create();\r\n    for (let i = 0; i < 3; i++) {\r\n      xyz[i] = xyz[i + 3] = pXYZ[i];\r\n      centroid.addInPlace(xyz[i]);\r\n    }\r\n    centroid.scaleInPlace(1.0 / 3.0);\r\n\r\n    // Edge midpoints ...\r\n    for (let i = 0; i < 3; i++) {\r\n      xyzMid[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      xyzMid[i + 3] = xyzMid[i];\r\n      edgeVector[i] = Vector3d.createStartEnd(xyz[i], xyz[i + 1]);    // use wraparound\r\n      edgeVector[i + 3] = edgeVector[i];\r\n    }\r\n\r\n    // Midpoints of midpoint-to-midpoint connections ..\r\n    for (let i = 0; i < 3; i++) {\r\n      const i1 = i + 1;\r\n      const i2 = i + 2;\r\n      interiorCandidate[i] = xyzMid[i1].interpolate(0.5, xyzMid[i2]);\r\n    }\r\n\r\n    interiorCandidate[3] = centroid;\r\n\r\n    let bestAngle = Number.NEGATIVE_INFINITY;\r\n    let bestIndex = -1;\r\n    const theta: number[] = [0, 0, 0];\r\n    let thetaMin;\r\n    for (let k: number = 0; k < 4; k++) {\r\n      // Measure angles from edge midpoints towards interior candidate.\r\n      thetaMin = Number.POSITIVE_INFINITY;\r\n      for (let i: number = 0; i < 3; i++) {\r\n        const edgeToInterior = Vector3d.createStartEnd(xyzMid[i], interiorCandidate[k]);\r\n        theta[i] = edgeVector[i].smallerUnorientedAngleTo(edgeToInterior).radians;\r\n        if (theta[i] < thetaMin)\r\n          thetaMin = theta[i];\r\n      }\r\n      if (thetaMin > bestAngle) {\r\n        bestAngle = thetaMin;\r\n        bestIndex = k;\r\n      }\r\n    }\r\n    return interiorCandidate[bestIndex];\r\n  }\r\n\r\n  private markBox(pA: HalfEdge): void {\r\n\r\n    const pB = pA.edgeMate;\r\n    pA.setMask(this._diagonalMask);\r\n    pB.setMask(this._diagonalMask);\r\n    pA.setMaskAroundFace(this._boxMask);\r\n    pB.setMaskAroundFace(this._boxMask);\r\n  }\r\n\r\n  private setSortedDiagonalMasks(minA: number): number {\r\n\r\n    const candidates: NodeSortKey[] = [];\r\n    let numDiagonal = 0;\r\n    for (const node of this._spineGraph.allHalfEdges) {\r\n      const b = this.diagonalKeyFunc(node);\r\n      if (b > minA)\r\n        candidates.push(new NodeSortKey(node, b));\r\n    }\r\n\r\n    candidates.sort(NodeSortKey.compareForSort);\r\n\r\n    let key;\r\n    while (undefined !== (key = candidates.pop())) {\r\n      const pA = key.node;\r\n      const pB = pA.edgeMate;\r\n      if (!pA.getMask(this._boxMask)\r\n        && !pB.getMask(this._boxMask)) {\r\n        this.markBox(pA);\r\n        numDiagonal++;\r\n      }\r\n    }\r\n    return numDiagonal;\r\n  }\r\n\r\n  /// <param name=\"xyzA\">Vertex whose angle is being split</param>\r\n  private splitOK(xyzA: Point3d, xyzB: Point3d, xyzQ: Point3d, xyzC: Point3d, minAngle: number): boolean {\r\n\r\n    const vectorAB = Vector3d.createStartEnd(xyzA, xyzB);\r\n    const vectorAQ = Vector3d.createStartEnd(xyzA, xyzQ);\r\n    const vectorAC = Vector3d.createStartEnd(xyzA, xyzC);\r\n    const angleBAQ = vectorAB.angleToXY(vectorAQ).radians;\r\n    const angleQAC = vectorAQ.angleToXY(vectorAC).radians;\r\n    return Math.abs(angleBAQ) > minAngle && Math.abs(angleQAC) > minAngle;\r\n  }\r\n\r\n  // Search a triangulation for vertices which have\r\n  //   (a) pre-split angle greater than 90 degrees\r\n  // (b) the opposite edge is a boundary.\r\n  //  (c) each post split angle is less than minSplitRadians\r\n  // Drop a perpenedicular to that boundary.\r\n  // return the number of edges added.\r\n  private addPerpendicularsToBoundaries(minSplitRadians: number, minCandidateRadians: number): number {\r\n\r\n    let numAdd = 0;\r\n    for (const pA of this._spineGraph.allHalfEdges) {\r\n      const pB = pA.faceSuccessor;\r\n      const pC = pB.faceSuccessor;\r\n      if (!pA.getMask(HalfEdgeMask.EXTERIOR)\r\n        && !pA.getMask(HalfEdgeMask.BOUNDARY_EDGE)   // ?? prevent deep recursion\r\n        && !pC.getMask(HalfEdgeMask.BOUNDARY_EDGE)   // ?? prevent deep recursion\r\n        && pB.getMask(HalfEdgeMask.BOUNDARY_EDGE)\r\n        && pC.faceSuccessor === pA\r\n      ) {\r\n        const vectorAB = pA.getVector2dAlongEdge();\r\n        const vectorBC = pB.getVector2dAlongEdge();\r\n        const vectorCA = pC.getVector2dAlongEdge();\r\n        const candidateRadians = Math.PI - vectorCA.angleTo(vectorAB).radians;\r\n        // const candidateDot = vectorCA.DotProduct (vectorAB);\r\n        if (candidateRadians > minCandidateRadians) { // vectorCA.DotProduct (vectorAB) > 0.0)\r\n          const bb = vectorBC.dotProduct(vectorBC);\r\n          const ba = -vectorBC.dotProduct(vectorAB);\r\n          const s = Geometry.conditionalDivideFraction(ba, bb);\r\n          if (s !== undefined && s > 0.0 && s < 1.0) {\r\n            const xyzA = pA.getPoint3d();\r\n            const xyzB = pB.getPoint3d();\r\n            const xyzC = pC.getPoint3d();\r\n            const xyzE = xyzB.interpolate(s, xyzC);\r\n            if (this.splitOK(xyzA, xyzB, xyzE, xyzC, minSplitRadians)) {\r\n              const pE = this._spineGraph.splitEdgeAtFraction(pB, s);\r\n              const pA1 = this._spineGraph.createEdgeHalfEdgeHalfEdge(pA, 0, pE, 0);\r\n              pA1.setXYZFrom(pA);\r\n              pE.setXYZAroundVertex(xyzE.x, xyzE.y, xyzE.z);\r\n              numAdd++;\r\n            }\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return numAdd;\r\n  }\r\n\r\n  private getSpineEdgesInQuad(\r\n    pFace: HalfEdge,\r\n    xyzOut: Point3d[][],\r\n    bIncludeInterior: boolean,\r\n    // true to include the edge to boundary when the qued is a dead end.\r\n    bIncludeFinal: boolean,\r\n    // true to include the two adjacent edges to boundary if the quad is at a corner.\r\n    bIncludeCornerSpokes: boolean): boolean {\r\n\r\n    if (pFace.countEdgesAroundFace() !== 4)\r\n      return false;\r\n    const pNode: HalfEdge[] = [];\r\n    const xyz = createNPoints(8);\r\n    const midpoint = createNPoints(8);\r\n    pNode[0] = pNode[4] = pFace;\r\n    pNode[1] = pNode[5] = pNode[0].faceSuccessor;\r\n    pNode[2] = pNode[6] = pNode[1].faceSuccessor;\r\n    pNode[3] = pNode[7] = pNode[2].faceSuccessor;\r\n    let numBoundary = 0;\r\n    let numInterior = 0;\r\n    const iBoundary: number[] = [];\r\n    const iInterior: number[] = [];\r\n    const bIsBoundary: boolean[] = [];\r\n    const centroid = Point3d.create();\r\n    for (let i: number = 0; i < 4; i++) {\r\n      bIsBoundary[i] = 0 !== pNode[i].getMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      if (pNode[i].getMask(HalfEdgeMask.BOUNDARY_EDGE))\r\n        iBoundary[numBoundary++] = i;\r\n      else\r\n        iInterior[numInterior++] = i;\r\n      xyz[i] = pNode[i].getPoint3d();\r\n      xyz[i + 4] = xyz[i];\r\n      centroid.addInPlace(xyz[i]);\r\n    }\r\n    for (let i: number = 0; i < 4; i++) {\r\n      midpoint[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      midpoint[i + 4] = midpoint[i];\r\n    }\r\n\r\n    centroid.scaleInPlace(0.25);\r\n    if (numBoundary === 0 || numBoundary === 1) {\r\n      for (let i: number = 0; i < numInterior; i++)\r\n        if (bIncludeInterior)\r\n          this.addEdge(xyzOut, midpoint[iInterior[i]], centroid);\r\n    } else if (numBoundary === 4) {\r\n      for (let i: number = 0; i < numBoundary; i++)\r\n        if (bIncludeFinal)\r\n          this.addEdge(xyzOut, midpoint[i], centroid);\r\n    } else if (numBoundary === 2) {\r\n      if (iInterior[1] === iInterior[0] + 2) {\r\n        // Spine enters one end, exits the other ..\r\n        if (bIncludeInterior)\r\n          this.addEdge(xyzOut, midpoint[iInterior[0]], midpoint[iInterior[1]]);\r\n      } else {\r\n        // Block sits as exterior corner.  Let the two spines continue to their opposite faces ..\r\n        for (let i: number = 0; i < 4; i++)\r\n          if ((bIsBoundary[i] && bIncludeCornerSpokes)\r\n            || (!bIsBoundary[i] && bIncludeInterior))\r\n            this.addEdge(xyzOut, midpoint[i], centroid);\r\n      }\r\n    } else if (numBoundary === 3) {\r\n      if (bIncludeInterior)\r\n        this.addEdge(xyzOut, midpoint[iInterior[0]], centroid);\r\n      if (bIncludeFinal)\r\n        this.addEdge(xyzOut, centroid, midpoint[iInterior[0] + 2]);\r\n    }\r\n    return true;\r\n  }\r\n\r\n  private getSpineEdgesInTriangle(\r\n    pFace: HalfEdge, xyzOut: Point3d[][],\r\n    bIncludeInterior: boolean,\r\n    bIncludeFinal: boolean): boolean {\r\n\r\n    if (pFace.countEdgesAroundFace() !== 3)\r\n      return false;\r\n    let n = 0;\r\n    const xyzMidpoint = createNPoints(6);\r\n    const xyz = createNPoints(6);\r\n    const xyzCentroid = Point3d.createZero();\r\n    const isBoundary: boolean[] = [];\r\n    let numBoundary = 0;\r\n    let lastBoundary = -1;\r\n    let lastInterior = -1;\r\n    let currentEdge = pFace;\r\n    do {\r\n      xyz[n] = currentEdge.getPoint3d();\r\n      xyzCentroid.addInPlace(xyz[n]);\r\n      isBoundary[n] = false;\r\n      if (currentEdge.getMask(HalfEdgeMask.BOUNDARY_EDGE)) {\r\n        isBoundary[n] = true;\r\n        numBoundary++;\r\n        lastBoundary = n;\r\n      } else {\r\n        lastInterior = n;\r\n      }\r\n      xyz[n + 3] = xyz[n];\r\n      isBoundary[n + 3] = isBoundary[n];\r\n      n++;\r\n    } while ((currentEdge = currentEdge.faceSuccessor) !== pFace);\r\n\r\n    for (let i: number = 0; i < 3; i++) {\r\n      xyzMidpoint[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      xyzMidpoint[i + 3] = xyzMidpoint[i];\r\n    }\r\n\r\n    xyzCentroid.scaleInPlace(1.0 / 3.0);\r\n\r\n    if (numBoundary === 0) {\r\n      // Interior branch\r\n      const xyzInterior = this.selectTriangleInteriorPoint(xyz);\r\n      if (bIncludeInterior) {\r\n        this.addEdge(xyzOut, xyzMidpoint[0], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[1], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[2], xyzInterior);\r\n      }\r\n    } else if (numBoundary === 1) {\r\n      if (bIncludeInterior)\r\n        this.addEdge(xyzOut, xyzMidpoint[lastBoundary + 1], xyzMidpoint[lastBoundary + 2]);\r\n    } else if (numBoundary === 2) {\r\n      if (bIncludeFinal && lastInterior >= 0)\r\n        this.addEdge(xyzOut, xyzMidpoint[lastInterior], xyz[lastInterior + 2]);\r\n    } else if (numBoundary === 3) {\r\n      const xyzInterior = this.selectTriangleInteriorPoint(xyz);\r\n      if (bIncludeFinal) {\r\n        this.addEdge(xyzOut, xyzMidpoint[0], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[1], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[2], xyzInterior);\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** Add a polyline to the graph.\r\n   * * This may be called multiple times\r\n   */\r\n  public insertEdges(xyzIn: Point3d[], bClosed: boolean): void {\r\n    let pPreviousB, pFirstA;\r\n    for (let i: number = 1; i < xyzIn.length; i++) {\r\n      const nodeA = this._spineGraph.createEdgeXYZXYZ(\r\n        xyzIn[i - 1].x, xyzIn[i - 1].y, 0, 0,\r\n        xyzIn[i].x, xyzIn[i].y, 0, 0);\r\n      const nodeB = nodeA.faceSuccessor;\r\n      nodeA.setMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      nodeB.setMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      if (pPreviousB === undefined) {\r\n        pFirstA = nodeA;\r\n      } else {\r\n        HalfEdge.pinch(pPreviousB, nodeA);\r\n      }\r\n      pPreviousB = nodeB;\r\n    }\r\n    if (bClosed && pFirstA !== undefined && pPreviousB !== undefined)\r\n      HalfEdge.pinch(pPreviousB, pFirstA);\r\n  }\r\n  /**\r\n   * Look for trivial (2 edge) faces that have exteriorMask and non-masked on both sides.\r\n   * * clear the mask\r\n   * @param exteriorMask\r\n   */\r\n  private purgeNullFaces(exteriorMask: HalfEdgeMask) {\r\n    for (const nodeA of this._spineGraph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      const nodeC = nodeB.faceSuccessor;\r\n      if (nodeB !== nodeA && nodeC === nodeA) {\r\n        if (nodeA.getMask(exteriorMask) && nodeB.getMask(exteriorMask)) {\r\n          const mateA = nodeA.edgeMate;\r\n          const mateB = nodeB.edgeMate;\r\n          if (!mateA.getMask(exteriorMask) && !mateB.getMask(exteriorMask)) {\r\n            nodeA.clearMask(exteriorMask);\r\n            nodeB.clearMask(exteriorMask);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  private static _regularize1 = true;\r\n  private static _regularize2 = false;\r\n  /**\r\n   * Triangulate the graph for the edges that have been inserted.\r\n   * @param applyParity if true ()\r\n   * @param minSplitRadians smallest allowed angle in the split sector that is split.\r\n   */\r\n  public triangulateForSpine(applyParity: boolean = true, minSplitRadians: number = 0.3): void {\r\n\r\n    const sMaxSplit = 20;\r\n    const sMinCandidateRadians = 1.0;\r\n    let numSplit = 0;\r\n    HalfEdgeGraphMerge.splitIntersectingEdges(this.graph);\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(this.graph);\r\n\r\n    const context1 = new RegularizationContext(this.graph);\r\n    context1.regularizeGraph(HalfEdgeGraphSpineContext._regularize1, false);\r\n    const context2 = new RegularizationContext(this.graph);\r\n    context2.regularizeGraph(false, HalfEdgeGraphSpineContext._regularize2);\r\n    if (applyParity) {\r\n      HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(this.graph,\r\n        new HalfEdgeMaskTester(HalfEdgeMask.BOUNDARY_EDGE), HalfEdgeMask.EXTERIOR);\r\n      this.purgeNullFaces(HalfEdgeMask.EXTERIOR);\r\n    }\r\n\r\n    Triangulator.triangulateAllPositiveAreaFaces(this.graph);\r\n    Triangulator.flipTriangles(this.graph);\r\n\r\n    while (numSplit++ < sMaxSplit) {\r\n      const numPerp = this.addPerpendicularsToBoundaries(minSplitRadians, sMinCandidateRadians);\r\n      if (numPerp <= 0)\r\n        break;\r\n      Triangulator.flipTriangles(this.graph);\r\n    }\r\n  }\r\n\r\n  // Find pseudo spine edges\r\n  // Optionally include pure internal midline segments.\r\n  // Optionally include midline segments into \"dead end\"\r\n  // Optionally include adjacent spokes to corner.\r\n  /**\r\n   * Retrieve edges of the spine as arrays of points.\r\n   * @param bIncludeInterior true to include fully internal segments\r\n   * @param bIncludeFinal true to include segments that terminate at a boundary\r\n   * @param bIncludeCornerSpokes\r\n   * @return array of line data.\r\n   */\r\n  public getSpineEdges(bIncludeInterior: boolean = true, bIncludeFinal: boolean = true, bIncludeCornerSpokes: boolean = true): Point3d[][] {\r\n    const xyzOut: Point3d[][] = [];\r\n    this._spineGraph.announceFaceLoops(\r\n      (_graph: HalfEdgeGraph, faceSeed: HalfEdge) => {\r\n        if (!faceSeed.getMask(HalfEdgeMask.EXTERIOR)) {\r\n          if (this.getSpineEdgesInTriangle(faceSeed, xyzOut, bIncludeInterior, bIncludeFinal)) {\r\n          } else if (this.getSpineEdgesInQuad(faceSeed, xyzOut, bIncludeInterior, bIncludeFinal, bIncludeCornerSpokes)) {\r\n          }\r\n        }\r\n        return true;\r\n      });\r\n    return xyzOut;\r\n  }\r\n\r\n  /**\r\n   * Intermediate markup step to identify quads between corresponding boundary edges.\r\n   * * search for and mark triangle edges that should be treated as diagonal of a quad\r\n   * * Angle logic is:\r\n   *   * In a candidate quad (formed by joining triangles that share an edge)\r\n   *   * form segments between opposite edges of the quad.\r\n   *   * compute angles between these segments and the edges of their quads.\r\n   *   * if this angle is larger than minAngleRadians, accept this as a quad.\r\n   *   * recommended angle is between 15 and 5 degrees; 50 degrees is typical\r\n   * @param bDeleteDiagonals if true, eliminate the diagonals.\r\n   * @param minAngleRadians angle tolerance, as described above.\r\n   */\r\n  public consolidateTrianglesToQuads(bDeleteDiagonals: boolean, minAngle: Angle = Angle.createDegrees(50)): number {\r\n\r\n    const numDiagonal = this.setSortedDiagonalMasks(minAngle.radians);\r\n    if (bDeleteDiagonals && numDiagonal > 0) {\r\n      this.graph.yankAndDeleteEdges(\r\n        (node: HalfEdge) => node.getMask(this._diagonalMask));\r\n    }\r\n    return numDiagonal;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgeGraphSpineContext.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgeGraphSpineContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAChF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,iBAAiB;AACjB,+BAA+B;AAC/B,iCAAiC;AACjC,qCAAqC;AAErC,SAAS,aAAa,CAAC,CAAS;IAC9B,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACxB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvC,OAAO,MAAM,CAAC;AAChB,CAAC;AACD,SAAS,cAAc,CAAC,CAAS;IAC/B,MAAM,MAAM,GAAG,EAAE,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACxB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACxC,OAAO,MAAM,CAAC;AAChB,CAAC;AACD,8EAA8E;AAC9E,MAAM,WAAW;IAGf,IAAW,IAAI,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAExC,YAAmB,IAAc,EAAE,CAAS;QAC1C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;IACd,CAAC;IACM,MAAM,CAAC,cAAc,CAAC,KAAkB,EAAE,KAAkB,IAAY,OAAO,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;CAC7G;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAa,yBAAyB;IAMpC,IAAW,KAAK,KAAK,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC/C;;;OAGG;IACH;QACE,IAAI,CAAC,WAAW,GAAG,IAAI,aAAa,EAAE,CAAC;QACvC,iEAAiE;QACjE,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;QACjD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,QAAQ;QACb,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC9C,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,CAAC;IAClC,CAAC;IAED,kEAAkE;IAC1D,OAAO,CAAC,MAAmB,EAAE,IAAa,EAAE,IAAa;QAC/D,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5B,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACxB,CAAC;IAEO,aAAa,CAAC,YAAsB,EAC1C,KAAiB,EACjB,MAAiB;QACjB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;QAC3C,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACjB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC;eAChD,YAAY,CAAC,oBAAoB,EAAE,KAAK,CAAC;eACzC,YAAY,CAAC,oBAAoB,EAAE,KAAK,CAAC,EAAE;YAC9C,MAAM,KAAK,GAAG,YAAY,CAAC,aAAa,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,YAAY,CAAC,aAAa,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACxB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,iCAAiC;IACjC,oEAAoE;IACpE,gCAAgC;IACxB,eAAe,CAAC,aAAuB;QAE7C,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE;YACpD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAE1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAErD,MAAM,YAAY,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,YAAY,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC;YACrB,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC;YACrB,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YACxE,MAAM,OAAO,GAAG,YAAY,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;YAExE,MAAM,KAAK,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACpD,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACnD,OAAO,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;SACpC;QAED,OAAO,MAAM,CAAC,iBAAiB,CAAC;IAClC,CAAC;IAED,uCAAuC;IACvC,4FAA4F;IACpF,2BAA2B,CAAC,IAAe;QAEjD,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAK,0BAA0B;QAC/D,MAAM,iBAAiB,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC,CAAG,sEAAsE;QACpH,mBAAmB;QACnB,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9B,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7B;QACD,QAAQ,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAEjC,qBAAqB;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,UAAU,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAI,iBAAiB;YACjF,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;SACnC;QAED,mDAAmD;QACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,iBAAiB,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;SAChE;QAED,iBAAiB,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;QAEhC,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACzC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;QACnB,MAAM,KAAK,GAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,IAAI,QAAQ,CAAC;QACb,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,iEAAiE;YACjE,QAAQ,GAAG,MAAM,CAAC,iBAAiB,CAAC;YACpC,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAClC,MAAM,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChF,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,wBAAwB,CAAC,cAAc,CAAC,CAAC,OAAO,CAAC;gBAC1E,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ;oBACrB,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;aACvB;YACD,IAAI,QAAQ,GAAG,SAAS,EAAE;gBACxB,SAAS,GAAG,QAAQ,CAAC;gBACrB,SAAS,GAAG,CAAC,CAAC;aACf;SACF;QACD,OAAO,iBAAiB,CAAC,SAAS,CAAC,CAAC;IACtC,CAAC;IAEO,OAAO,CAAC,EAAY;QAE1B,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC;QACvB,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC/B,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC/B,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,EAAE,CAAC,iBAAiB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAEO,sBAAsB,CAAC,IAAY;QAEzC,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YAChD,MAAM,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,CAAC,GAAG,IAAI;gBACV,UAAU,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;SAC7C;QAED,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,WAAW,CAAC,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QAE5E,IAAI,GAAG,CAAC;QACR,OAAO,SAAS,KAAK,CAAC,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE;YAC7C,MAAM,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC;YACpB,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC;YACvB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC;mBACzB,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAC/B,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACjB,WAAW,EAAE,CAAC;aACf;SACF;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,gEAAgE;IACxD,OAAO,CAAC,IAAa,EAAE,IAAa,EAAE,IAAa,EAAE,IAAa,EAAE,QAAgB;QAE1F,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;QACtD,MAAM,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;QACtD,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC;IACxE,CAAC;IAED,iDAAiD;IACjD,gDAAgD;IAChD,uCAAuC;IACvC,0DAA0D;IAC1D,0CAA0C;IAC1C,oCAAoC;IAC5B,6BAA6B,CAAC,eAAuB,EAAE,mBAA2B;QAExF,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YAC9C,MAAM,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;YAC5B,MAAM,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;YAC5B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC;mBACjC,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAG,4BAA4B;mBACtE,CAAC,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAG,4BAA4B;mBACtE,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC;mBACtC,EAAE,CAAC,aAAa,KAAK,EAAE,EAC1B;gBACA,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,EAAE,CAAC,oBAAoB,EAAE,CAAC;gBAC3C,MAAM,gBAAgB,GAAG,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC;gBACtE,uDAAuD;gBACvD,IAAI,gBAAgB,GAAG,mBAAmB,EAAE,EAAE,wCAAwC;oBACpF,MAAM,EAAE,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;oBACzC,MAAM,EAAE,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;oBAC1C,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG,EAAE;wBACzC,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,EAAE,CAAC;wBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;wBACvC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,CAAC,EAAE;4BACzD,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;4BACvD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;4BACtE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;4BACnB,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;4BAC9C,MAAM,EAAE,CAAC;yBACV;qBACF;iBACF;aACF;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,mBAAmB,CACzB,KAAe,EACf,MAAmB,EACnB,gBAAyB;IACzB,oEAAoE;IACpE,aAAsB;IACtB,iFAAiF;IACjF,oBAA6B;QAE7B,IAAI,KAAK,CAAC,oBAAoB,EAAE,KAAK,CAAC;YACpC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAe,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC5B,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAC7C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,WAAW,GAAc,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YACpE,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC;gBAC9C,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;;gBAE7B,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,CAAC;YAC/B,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC;YAC/B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7B;QACD,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAClD,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;SAC/B;QAED,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,WAAW,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,EAAE;YAC1C,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;gBAC1C,IAAI,gBAAgB;oBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;SAC5D;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE;gBAC1C,IAAI,aAAa;oBACf,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;SACjD;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;gBACrC,2CAA2C;gBAC3C,IAAI,gBAAgB;oBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aACxE;iBAAM;gBACL,yFAAyF;gBACzF,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAChC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,oBAAoB,CAAC;2BACvC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,gBAAgB,CAAC;wBACxC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;aACjD;SACF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,gBAAgB;gBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YACzD,IAAI,aAAa;gBACf,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SAC9D;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,uBAAuB,CAC7B,KAAe,EAAE,MAAmB,EACpC,gBAAyB,EACzB,aAAsB;QAEtB,IAAI,KAAK,CAAC,oBAAoB,EAAE,KAAK,CAAC;YACpC,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,WAAW,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,WAAW,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACzC,MAAM,UAAU,GAAc,EAAE,CAAC;QACjC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,GAAG;YACD,GAAG,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,UAAU,EAAE,CAAC;YAClC,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/B,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACtB,IAAI,WAAW,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE;gBACnD,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACrB,WAAW,EAAE,CAAC;gBACd,YAAY,GAAG,CAAC,CAAC;aAClB;iBAAM;gBACL,YAAY,GAAG,CAAC,CAAC;aAClB;YACD,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC,EAAE,CAAC;SACL,QAAQ,CAAC,WAAW,GAAG,WAAW,CAAC,aAAa,CAAC,KAAK,KAAK,EAAE;QAE9D,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAClC,WAAW,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrD,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;SACrC;QAED,WAAW,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QAEpC,IAAI,WAAW,KAAK,CAAC,EAAE;YACrB,kBAAkB;YAClB,MAAM,WAAW,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,CAAC;YAC1D,IAAI,gBAAgB,EAAE;gBACpB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;aACnD;SACF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,gBAAgB;gBAClB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;SACtF;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,IAAI,aAAa,IAAI,YAAY,IAAI,CAAC;gBACpC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1E;aAAM,IAAI,WAAW,KAAK,CAAC,EAAE;YAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,CAAC;YAC1D,IAAI,aAAa,EAAE;gBACjB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;gBAClD,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;aACnD;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,KAAgB,EAAE,OAAgB;QACnD,IAAI,UAAU,EAAE,OAAO,CAAC;QACxB,KAAK,IAAI,CAAC,GAAW,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,gBAAgB,CAC7C,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EACpC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YAC1C,IAAI,UAAU,KAAK,SAAS,EAAE;gBAC5B,OAAO,GAAG,KAAK,CAAC;aACjB;iBAAM;gBACL,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;aACnC;YACD,UAAU,GAAG,KAAK,CAAC;SACpB;QACD,IAAI,OAAO,IAAI,OAAO,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS;YAC9D,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IACxC,CAAC;IACD;;;;OAIG;IACK,cAAc,CAAC,YAA0B;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE;YACjD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;gBACtC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;oBAC9D,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;oBAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;oBAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;wBAChE,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;wBAC9B,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;qBAC/B;iBACF;aACF;SACF;IACH,CAAC;IAGD;;;;OAIG;IACI,mBAAmB,CAAC,cAAuB,IAAI,EAAE,kBAA0B,GAAG;QAEnF,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,MAAM,oBAAoB,GAAG,GAAG,CAAC;QACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,kBAAkB,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtD,kBAAkB,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,QAAQ,CAAC,eAAe,CAAC,yBAAyB,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;QACxE,MAAM,QAAQ,GAAG,IAAI,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,QAAQ,CAAC,eAAe,CAAC,KAAK,EAAE,yBAAyB,CAAC,YAAY,CAAC,CAAC;QACxE,IAAI,WAAW,EAAE;YACf,mBAAmB,CAAC,iDAAiD,CAAC,IAAI,CAAC,KAAK,EAC9E,IAAI,kBAAkB,CAAC,YAAY,CAAC,aAAa,CAAC,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;YAC7E,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;SAC5C;QAED,YAAY,CAAC,+BAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzD,YAAY,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEvC,OAAO,QAAQ,EAAE,GAAG,SAAS,EAAE;YAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,6BAA6B,CAAC,eAAe,EAAE,oBAAoB,CAAC,CAAC;YAC1F,IAAI,OAAO,IAAI,CAAC;gBACd,MAAM;YACR,YAAY,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACxC;IACH,CAAC;IAED,0BAA0B;IAC1B,qDAAqD;IACrD,sDAAsD;IACtD,gDAAgD;IAChD;;;;;;OAMG;IACI,aAAa,CAAC,mBAA4B,IAAI,EAAE,gBAAyB,IAAI,EAAE,uBAAgC,IAAI;QACxH,MAAM,MAAM,GAAgB,EAAE,CAAC;QAC/B,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAChC,CAAC,MAAqB,EAAE,QAAkB,EAAE,EAAE;YAC5C,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE;gBAC5C,IAAI,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,CAAC,EAAE;iBACpF;qBAAM,IAAI,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,MAAM,EAAE,gBAAgB,EAAE,aAAa,EAAE,oBAAoB,CAAC,EAAE;iBAC7G;aACF;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACL,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;OAWG;IACI,2BAA2B,CAAC,gBAAyB,EAAE,WAAkB,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC;QAErG,MAAM,WAAW,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClE,IAAI,gBAAgB,IAAI,WAAW,GAAG,CAAC,EAAE;YACvC,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAC3B,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;SACzD;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;;AAjFc,sCAAY,GAAG,IAAI,CAAC;AACpB,sCAAY,GAAG,KAAK,CAAC;SAlazB,yBAAyB","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\nimport { Geometry } from \"../Geometry\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { HalfEdgeGraphMerge } from \"./Merging\";\r\nimport { Triangulator } from \"./Triangulation\";\r\nimport { RegularizationContext } from \"./RegularizeFace\";\r\nimport { HalfEdgeGraphSearch, HalfEdgeMaskTester } from \"./HalfEdgeGraphSearch\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n// cSpell:disable\r\n// const sSpineRelTol = 1.0e-8;\r\n// const sSpineGraphAbsTol = 0.0;\r\n// const sSpineGraphRelTol = 1.0e-10;\r\n\r\nfunction createNPoints(n: number): Point3d[] {\r\n  const points = [];\r\n  for (let i = 0; i < n; i++)\r\n    points.push(Point3d.create(0, 0, 0));\r\n  return points;\r\n}\r\nfunction createNVectors(n: number): Vector3d[] {\r\n  const points = [];\r\n  for (let i = 0; i < n; i++)\r\n    points.push(Vector3d.create(0, 0, 0));\r\n  return points;\r\n}\r\n// Local struct to pair a graph node with a double as a sort key for std::sort\r\nclass NodeSortKey {\r\n  private _a: number;\r\n  private _node: HalfEdge;\r\n  public get node() { return this._node; }\r\n\r\n  public constructor(node: HalfEdge, b: number) {\r\n    this._node = node;\r\n    this._a = b;\r\n  }\r\n  public static compareForSort(dataA: NodeSortKey, dataB: NodeSortKey): number { return dataA._a - dataB._a; }\r\n}\r\n\r\n/**\r\n * Context manager to hold a vu graph and do spine operations\r\n *\r\n * Spine calculations determine both (a) a \"skeletal\" network of linework that follows the interior\r\n *      path through within the boundaries, and (b) a block decomposition into quads and triangles.\r\n *\r\n * Usage pattern:\r\n * ```\r\n *    const sc = new HalfEdgeGraphSpineContext();\r\n *   // Data setup ....\r\n *    foreach polygon or polyline\r\n *        {\r\n *        sc.InsertEdges (edgePoints, bClosed)\r\n *        }\r\n *   // Analysis steps ...\r\n *     * bParity = true to treat the data as a \"polygon\".  The interior is determined by parity rules\r\n *                   and the triangulation and spine are only constructed \"inside\"\r\n *     * bParity = false if \"all\" spaces are to be triangulated and spined.\r\n *     * minSplitRadians -- suggested value 0.3.  If this value is large, it will encourage add internal\r\n *     *     edges from a vertex to an edge 'across' the polygon even if it creates small angles.\r\n *     * minDiagonalAngle -- suggested value 1.0.  If this value is large (up to about 1.5 as max) it favors\r\n *     *     using triangles to navigate turns.  If it is small, it favors using skewed quadrilaterals.\r\n *    sc.TriangulateForSpine (bParity, minSplitRadians)\r\n *    sc.MarkBoxes (true, minDiagonalAngle);\r\n *    edges = sc.GetSpineEdges ();\r\n * ```\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphSpineContext {\r\n  /** The Evolving graph */\r\n  private _spineGraph: HalfEdgeGraph;\r\n  /** mask marking edges that have been paired into quads */\r\n  private _diagonalMask: HalfEdgeMask;\r\n  private _boxMask: HalfEdgeMask;\r\n  public get graph() { return this._spineGraph; }\r\n  /**\r\n   * Create a context with an empty graph.\r\n   * * Reserve masks for specialized markup.\r\n   */\r\n  public constructor() {\r\n    this._spineGraph = new HalfEdgeGraph();\r\n    // vu_setTol (_spineGraph, sSpineGraphAbsTol, sSpineGraphRelTol);\r\n    this._diagonalMask = this._spineGraph.grabMask();\r\n    this._boxMask = this._spineGraph.grabMask();\r\n  }\r\n\r\n  /**\r\n   * Release resources to the graph.\r\n   */\r\n  public teardown() {\r\n    this._spineGraph.dropMask(this._diagonalMask);\r\n    this._spineGraph.dropMask(this._boxMask);\r\n    this._spineGraph.decommission();\r\n  }\r\n\r\n  //  an edge (as new bvector<DPoint3d> at back, with cloned points>\r\n  private addEdge(xyzOut: Point3d[][], xyzA: Point3d, xyzB: Point3d) {\r\n    const newArray = [];\r\n    newArray.push(xyzA.clone());\r\n    newArray.push(xyzB.clone());\r\n    xyzOut.push(newArray);\r\n  }\r\n\r\n  private getBoxCorners(diagonalNode: HalfEdge,\r\n    nodes: HalfEdge[],\r\n    points: Point3d[]): boolean {\r\n    const diagonalMate = diagonalNode.edgeMate;\r\n    nodes.length = 0;\r\n    points.length = 0;\r\n    if (!diagonalNode.getMask(HalfEdgeMask.BOUNDARY_EDGE)\r\n      && diagonalNode.countEdgesAroundFace() === 3\r\n      && diagonalMate.countEdgesAroundFace() === 3) {\r\n      const nodeA = diagonalMate.faceSuccessor;\r\n      nodes.push(nodeA);\r\n      nodes.push(nodeA.faceSuccessor);\r\n      const nodeB = diagonalNode.faceSuccessor;\r\n      nodes.push(nodeB);\r\n      nodes.push(nodeB.faceSuccessor);\r\n      for (let i = 0; i < 4; i++)\r\n        points.push(Point3d.create(nodes[i].x, nodes[i].y));\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  // Compute bisectors of the quad.\r\n  // function key is the smaller absolute angle between the bisectors.\r\n  // (pi/2 is max possible value).\r\n  private diagonalKeyFunc(pDiagonalNode: HalfEdge): number {\r\n\r\n    const nodes: HalfEdge[] = [];\r\n    const points: Point3d[] = [];\r\n    if (this.getBoxCorners(pDiagonalNode, nodes, points)) {\r\n      const xyzA = points[0];\r\n      const xyzB = points[1];\r\n      const xyzC = points[2];\r\n      const xyzD = points[3];\r\n      const xyzAB = xyzA.interpolate(0.5, xyzB);\r\n      const xyzBC = xyzB.interpolate(0.5, xyzC);\r\n      const xyzCD = xyzC.interpolate(0.5, xyzD);\r\n      const xyzDA = xyzD.interpolate(0.5, xyzA);\r\n\r\n      const vectorAB = Vector3d.createStartEnd(xyzA, xyzB);\r\n      const vectorBC = Vector3d.createStartEnd(xyzB, xyzC);\r\n      const vectorCD = Vector3d.createStartEnd(xyzC, xyzD);\r\n      const vectorDA = Vector3d.createStartEnd(xyzD, xyzA);\r\n\r\n      const vectorABToCD = Vector3d.createStartEnd(xyzCD, xyzAB);\r\n      const vectorBCToDA = Vector3d.createStartEnd(xyzDA, xyzBC);\r\n      vectorABToCD.z = 0.0;\r\n      vectorBCToDA.z = 0.0;\r\n      const thetaAB = vectorABToCD.smallerUnorientedAngleTo(vectorAB).radians;\r\n      const thetaBC = vectorBCToDA.smallerUnorientedAngleTo(vectorBC).radians;\r\n      const thetaCD = vectorABToCD.smallerUnorientedAngleTo(vectorCD).radians;\r\n      const thetaDA = vectorBCToDA.smallerUnorientedAngleTo(vectorDA).radians;\r\n\r\n      const alpha = thetaAB < thetaCD ? thetaAB : thetaCD;\r\n      const beta = thetaBC < thetaDA ? thetaBC : thetaDA;\r\n      return alpha < beta ? alpha : beta;\r\n    }\r\n\r\n    return Number.NEGATIVE_INFINITY;\r\n  }\r\n\r\n  // Select a branch point in a triangle.\r\n  // This may be the centroid or the midpoint of an edge joining midpoints of a pair of edges.\r\n  private selectTriangleInteriorPoint(pXYZ: Point3d[]): Point3d {\r\n\r\n    const xyz = createNPoints(6);\r\n    const xyzMid = createNPoints(6);     // Midpoints of each edge.\r\n    const interiorCandidate = createNPoints(4);   // for i in {012}, [i] is midpoint of midpoint[i+1] and midpoint[i+2].\r\n    // [3] is centroid.\r\n    const edgeVector = createNVectors(6);\r\n    const centroid = Point3d.create();\r\n    for (let i = 0; i < 3; i++) {\r\n      xyz[i] = xyz[i + 3] = pXYZ[i];\r\n      centroid.addInPlace(xyz[i]);\r\n    }\r\n    centroid.scaleInPlace(1.0 / 3.0);\r\n\r\n    // Edge midpoints ...\r\n    for (let i = 0; i < 3; i++) {\r\n      xyzMid[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      xyzMid[i + 3] = xyzMid[i];\r\n      edgeVector[i] = Vector3d.createStartEnd(xyz[i], xyz[i + 1]);    // use wraparound\r\n      edgeVector[i + 3] = edgeVector[i];\r\n    }\r\n\r\n    // Midpoints of midpoint-to-midpoint connections ..\r\n    for (let i = 0; i < 3; i++) {\r\n      const i1 = i + 1;\r\n      const i2 = i + 2;\r\n      interiorCandidate[i] = xyzMid[i1].interpolate(0.5, xyzMid[i2]);\r\n    }\r\n\r\n    interiorCandidate[3] = centroid;\r\n\r\n    let bestAngle = Number.NEGATIVE_INFINITY;\r\n    let bestIndex = -1;\r\n    const theta: number[] = [0, 0, 0];\r\n    let thetaMin;\r\n    for (let k: number = 0; k < 4; k++) {\r\n      // Measure angles from edge midpoints towards interior candidate.\r\n      thetaMin = Number.POSITIVE_INFINITY;\r\n      for (let i: number = 0; i < 3; i++) {\r\n        const edgeToInterior = Vector3d.createStartEnd(xyzMid[i], interiorCandidate[k]);\r\n        theta[i] = edgeVector[i].smallerUnorientedAngleTo(edgeToInterior).radians;\r\n        if (theta[i] < thetaMin)\r\n          thetaMin = theta[i];\r\n      }\r\n      if (thetaMin > bestAngle) {\r\n        bestAngle = thetaMin;\r\n        bestIndex = k;\r\n      }\r\n    }\r\n    return interiorCandidate[bestIndex];\r\n  }\r\n\r\n  private markBox(pA: HalfEdge): void {\r\n\r\n    const pB = pA.edgeMate;\r\n    pA.setMask(this._diagonalMask);\r\n    pB.setMask(this._diagonalMask);\r\n    pA.setMaskAroundFace(this._boxMask);\r\n    pB.setMaskAroundFace(this._boxMask);\r\n  }\r\n\r\n  private setSortedDiagonalMasks(minA: number): number {\r\n\r\n    const candidates: NodeSortKey[] = [];\r\n    let numDiagonal = 0;\r\n    for (const node of this._spineGraph.allHalfEdges) {\r\n      const b = this.diagonalKeyFunc(node);\r\n      if (b > minA)\r\n        candidates.push(new NodeSortKey(node, b));\r\n    }\r\n\r\n    candidates.sort((dataA, dataB) => NodeSortKey.compareForSort(dataA, dataB));\r\n\r\n    let key;\r\n    while (undefined !== (key = candidates.pop())) {\r\n      const pA = key.node;\r\n      const pB = pA.edgeMate;\r\n      if (!pA.getMask(this._boxMask)\r\n        && !pB.getMask(this._boxMask)) {\r\n        this.markBox(pA);\r\n        numDiagonal++;\r\n      }\r\n    }\r\n    return numDiagonal;\r\n  }\r\n\r\n  /// <param name=\"xyzA\">Vertex whose angle is being split</param>\r\n  private splitOK(xyzA: Point3d, xyzB: Point3d, xyzQ: Point3d, xyzC: Point3d, minAngle: number): boolean {\r\n\r\n    const vectorAB = Vector3d.createStartEnd(xyzA, xyzB);\r\n    const vectorAQ = Vector3d.createStartEnd(xyzA, xyzQ);\r\n    const vectorAC = Vector3d.createStartEnd(xyzA, xyzC);\r\n    const angleBAQ = vectorAB.angleToXY(vectorAQ).radians;\r\n    const angleQAC = vectorAQ.angleToXY(vectorAC).radians;\r\n    return Math.abs(angleBAQ) > minAngle && Math.abs(angleQAC) > minAngle;\r\n  }\r\n\r\n  // Search a triangulation for vertices which have\r\n  //   (a) pre-split angle greater than 90 degrees\r\n  // (b) the opposite edge is a boundary.\r\n  //  (c) each post split angle is less than minSplitRadians\r\n  // Drop a perpenedicular to that boundary.\r\n  // return the number of edges added.\r\n  private addPerpendicularsToBoundaries(minSplitRadians: number, minCandidateRadians: number): number {\r\n\r\n    let numAdd = 0;\r\n    for (const pA of this._spineGraph.allHalfEdges) {\r\n      const pB = pA.faceSuccessor;\r\n      const pC = pB.faceSuccessor;\r\n      if (!pA.getMask(HalfEdgeMask.EXTERIOR)\r\n        && !pA.getMask(HalfEdgeMask.BOUNDARY_EDGE)   // ?? prevent deep recursion\r\n        && !pC.getMask(HalfEdgeMask.BOUNDARY_EDGE)   // ?? prevent deep recursion\r\n        && pB.getMask(HalfEdgeMask.BOUNDARY_EDGE)\r\n        && pC.faceSuccessor === pA\r\n      ) {\r\n        const vectorAB = pA.getVector2dAlongEdge();\r\n        const vectorBC = pB.getVector2dAlongEdge();\r\n        const vectorCA = pC.getVector2dAlongEdge();\r\n        const candidateRadians = Math.PI - vectorCA.angleTo(vectorAB).radians;\r\n        // const candidateDot = vectorCA.DotProduct (vectorAB);\r\n        if (candidateRadians > minCandidateRadians) { // vectorCA.DotProduct (vectorAB) > 0.0)\r\n          const bb = vectorBC.dotProduct(vectorBC);\r\n          const ba = -vectorBC.dotProduct(vectorAB);\r\n          const s = Geometry.conditionalDivideFraction(ba, bb);\r\n          if (s !== undefined && s > 0.0 && s < 1.0) {\r\n            const xyzA = pA.getPoint3d();\r\n            const xyzB = pB.getPoint3d();\r\n            const xyzC = pC.getPoint3d();\r\n            const xyzE = xyzB.interpolate(s, xyzC);\r\n            if (this.splitOK(xyzA, xyzB, xyzE, xyzC, minSplitRadians)) {\r\n              const pE = this._spineGraph.splitEdgeAtFraction(pB, s);\r\n              const pA1 = this._spineGraph.createEdgeHalfEdgeHalfEdge(pA, 0, pE, 0);\r\n              pA1.setXYZFrom(pA);\r\n              pE.setXYZAroundVertex(xyzE.x, xyzE.y, xyzE.z);\r\n              numAdd++;\r\n            }\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return numAdd;\r\n  }\r\n\r\n  private getSpineEdgesInQuad(\r\n    pFace: HalfEdge,\r\n    xyzOut: Point3d[][],\r\n    bIncludeInterior: boolean,\r\n    // true to include the edge to boundary when the qued is a dead end.\r\n    bIncludeFinal: boolean,\r\n    // true to include the two adjacent edges to boundary if the quad is at a corner.\r\n    bIncludeCornerSpokes: boolean): boolean {\r\n\r\n    if (pFace.countEdgesAroundFace() !== 4)\r\n      return false;\r\n    const pNode: HalfEdge[] = [];\r\n    const xyz = createNPoints(8);\r\n    const midpoint = createNPoints(8);\r\n    pNode[0] = pNode[4] = pFace;\r\n    pNode[1] = pNode[5] = pNode[0].faceSuccessor;\r\n    pNode[2] = pNode[6] = pNode[1].faceSuccessor;\r\n    pNode[3] = pNode[7] = pNode[2].faceSuccessor;\r\n    let numBoundary = 0;\r\n    let numInterior = 0;\r\n    const iBoundary: number[] = [];\r\n    const iInterior: number[] = [];\r\n    const bIsBoundary: boolean[] = [];\r\n    const centroid = Point3d.create();\r\n    for (let i: number = 0; i < 4; i++) {\r\n      bIsBoundary[i] = 0 !== pNode[i].getMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      if (pNode[i].getMask(HalfEdgeMask.BOUNDARY_EDGE))\r\n        iBoundary[numBoundary++] = i;\r\n      else\r\n        iInterior[numInterior++] = i;\r\n      xyz[i] = pNode[i].getPoint3d();\r\n      xyz[i + 4] = xyz[i];\r\n      centroid.addInPlace(xyz[i]);\r\n    }\r\n    for (let i: number = 0; i < 4; i++) {\r\n      midpoint[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      midpoint[i + 4] = midpoint[i];\r\n    }\r\n\r\n    centroid.scaleInPlace(0.25);\r\n    if (numBoundary === 0 || numBoundary === 1) {\r\n      for (let i: number = 0; i < numInterior; i++)\r\n        if (bIncludeInterior)\r\n          this.addEdge(xyzOut, midpoint[iInterior[i]], centroid);\r\n    } else if (numBoundary === 4) {\r\n      for (let i: number = 0; i < numBoundary; i++)\r\n        if (bIncludeFinal)\r\n          this.addEdge(xyzOut, midpoint[i], centroid);\r\n    } else if (numBoundary === 2) {\r\n      if (iInterior[1] === iInterior[0] + 2) {\r\n        // Spine enters one end, exits the other ..\r\n        if (bIncludeInterior)\r\n          this.addEdge(xyzOut, midpoint[iInterior[0]], midpoint[iInterior[1]]);\r\n      } else {\r\n        // Block sits as exterior corner.  Let the two spines continue to their opposite faces ..\r\n        for (let i: number = 0; i < 4; i++)\r\n          if ((bIsBoundary[i] && bIncludeCornerSpokes)\r\n            || (!bIsBoundary[i] && bIncludeInterior))\r\n            this.addEdge(xyzOut, midpoint[i], centroid);\r\n      }\r\n    } else if (numBoundary === 3) {\r\n      if (bIncludeInterior)\r\n        this.addEdge(xyzOut, midpoint[iInterior[0]], centroid);\r\n      if (bIncludeFinal)\r\n        this.addEdge(xyzOut, centroid, midpoint[iInterior[0] + 2]);\r\n    }\r\n    return true;\r\n  }\r\n\r\n  private getSpineEdgesInTriangle(\r\n    pFace: HalfEdge, xyzOut: Point3d[][],\r\n    bIncludeInterior: boolean,\r\n    bIncludeFinal: boolean): boolean {\r\n\r\n    if (pFace.countEdgesAroundFace() !== 3)\r\n      return false;\r\n    let n = 0;\r\n    const xyzMidpoint = createNPoints(6);\r\n    const xyz = createNPoints(6);\r\n    const xyzCentroid = Point3d.createZero();\r\n    const isBoundary: boolean[] = [];\r\n    let numBoundary = 0;\r\n    let lastBoundary = -1;\r\n    let lastInterior = -1;\r\n    let currentEdge = pFace;\r\n    do {\r\n      xyz[n] = currentEdge.getPoint3d();\r\n      xyzCentroid.addInPlace(xyz[n]);\r\n      isBoundary[n] = false;\r\n      if (currentEdge.getMask(HalfEdgeMask.BOUNDARY_EDGE)) {\r\n        isBoundary[n] = true;\r\n        numBoundary++;\r\n        lastBoundary = n;\r\n      } else {\r\n        lastInterior = n;\r\n      }\r\n      xyz[n + 3] = xyz[n];\r\n      isBoundary[n + 3] = isBoundary[n];\r\n      n++;\r\n    } while ((currentEdge = currentEdge.faceSuccessor) !== pFace);\r\n\r\n    for (let i: number = 0; i < 3; i++) {\r\n      xyzMidpoint[i] = xyz[i].interpolate(0.5, xyz[i + 1]);\r\n      xyzMidpoint[i + 3] = xyzMidpoint[i];\r\n    }\r\n\r\n    xyzCentroid.scaleInPlace(1.0 / 3.0);\r\n\r\n    if (numBoundary === 0) {\r\n      // Interior branch\r\n      const xyzInterior = this.selectTriangleInteriorPoint(xyz);\r\n      if (bIncludeInterior) {\r\n        this.addEdge(xyzOut, xyzMidpoint[0], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[1], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[2], xyzInterior);\r\n      }\r\n    } else if (numBoundary === 1) {\r\n      if (bIncludeInterior)\r\n        this.addEdge(xyzOut, xyzMidpoint[lastBoundary + 1], xyzMidpoint[lastBoundary + 2]);\r\n    } else if (numBoundary === 2) {\r\n      if (bIncludeFinal && lastInterior >= 0)\r\n        this.addEdge(xyzOut, xyzMidpoint[lastInterior], xyz[lastInterior + 2]);\r\n    } else if (numBoundary === 3) {\r\n      const xyzInterior = this.selectTriangleInteriorPoint(xyz);\r\n      if (bIncludeFinal) {\r\n        this.addEdge(xyzOut, xyzMidpoint[0], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[1], xyzInterior);\r\n        this.addEdge(xyzOut, xyzMidpoint[2], xyzInterior);\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** Add a polyline to the graph.\r\n   * * This may be called multiple times\r\n   */\r\n  public insertEdges(xyzIn: Point3d[], bClosed: boolean): void {\r\n    let pPreviousB, pFirstA;\r\n    for (let i: number = 1; i < xyzIn.length; i++) {\r\n      const nodeA = this._spineGraph.createEdgeXYZXYZ(\r\n        xyzIn[i - 1].x, xyzIn[i - 1].y, 0, 0,\r\n        xyzIn[i].x, xyzIn[i].y, 0, 0);\r\n      const nodeB = nodeA.faceSuccessor;\r\n      nodeA.setMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      nodeB.setMask(HalfEdgeMask.BOUNDARY_EDGE);\r\n      if (pPreviousB === undefined) {\r\n        pFirstA = nodeA;\r\n      } else {\r\n        HalfEdge.pinch(pPreviousB, nodeA);\r\n      }\r\n      pPreviousB = nodeB;\r\n    }\r\n    if (bClosed && pFirstA !== undefined && pPreviousB !== undefined)\r\n      HalfEdge.pinch(pPreviousB, pFirstA);\r\n  }\r\n  /**\r\n   * Look for trivial (2 edge) faces that have exteriorMask and non-masked on both sides.\r\n   * * clear the mask\r\n   * @param exteriorMask\r\n   */\r\n  private purgeNullFaces(exteriorMask: HalfEdgeMask) {\r\n    for (const nodeA of this._spineGraph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      const nodeC = nodeB.faceSuccessor;\r\n      if (nodeB !== nodeA && nodeC === nodeA) {\r\n        if (nodeA.getMask(exteriorMask) && nodeB.getMask(exteriorMask)) {\r\n          const mateA = nodeA.edgeMate;\r\n          const mateB = nodeB.edgeMate;\r\n          if (!mateA.getMask(exteriorMask) && !mateB.getMask(exteriorMask)) {\r\n            nodeA.clearMask(exteriorMask);\r\n            nodeB.clearMask(exteriorMask);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  private static _regularize1 = true;\r\n  private static _regularize2 = false;\r\n  /**\r\n   * Triangulate the graph for the edges that have been inserted.\r\n   * @param applyParity if true ()\r\n   * @param minSplitRadians smallest allowed angle in the split sector that is split.\r\n   */\r\n  public triangulateForSpine(applyParity: boolean = true, minSplitRadians: number = 0.3): void {\r\n\r\n    const sMaxSplit = 20;\r\n    const sMinCandidateRadians = 1.0;\r\n    let numSplit = 0;\r\n    HalfEdgeGraphMerge.splitIntersectingEdges(this.graph);\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(this.graph);\r\n\r\n    const context1 = new RegularizationContext(this.graph);\r\n    context1.regularizeGraph(HalfEdgeGraphSpineContext._regularize1, false);\r\n    const context2 = new RegularizationContext(this.graph);\r\n    context2.regularizeGraph(false, HalfEdgeGraphSpineContext._regularize2);\r\n    if (applyParity) {\r\n      HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(this.graph,\r\n        new HalfEdgeMaskTester(HalfEdgeMask.BOUNDARY_EDGE), HalfEdgeMask.EXTERIOR);\r\n      this.purgeNullFaces(HalfEdgeMask.EXTERIOR);\r\n    }\r\n\r\n    Triangulator.triangulateAllPositiveAreaFaces(this.graph);\r\n    Triangulator.flipTriangles(this.graph);\r\n\r\n    while (numSplit++ < sMaxSplit) {\r\n      const numPerp = this.addPerpendicularsToBoundaries(minSplitRadians, sMinCandidateRadians);\r\n      if (numPerp <= 0)\r\n        break;\r\n      Triangulator.flipTriangles(this.graph);\r\n    }\r\n  }\r\n\r\n  // Find pseudo spine edges\r\n  // Optionally include pure internal midline segments.\r\n  // Optionally include midline segments into \"dead end\"\r\n  // Optionally include adjacent spokes to corner.\r\n  /**\r\n   * Retrieve edges of the spine as arrays of points.\r\n   * @param bIncludeInterior true to include fully internal segments\r\n   * @param bIncludeFinal true to include segments that terminate at a boundary\r\n   * @param bIncludeCornerSpokes\r\n   * @return array of line data.\r\n   */\r\n  public getSpineEdges(bIncludeInterior: boolean = true, bIncludeFinal: boolean = true, bIncludeCornerSpokes: boolean = true): Point3d[][] {\r\n    const xyzOut: Point3d[][] = [];\r\n    this._spineGraph.announceFaceLoops(\r\n      (_graph: HalfEdgeGraph, faceSeed: HalfEdge) => {\r\n        if (!faceSeed.getMask(HalfEdgeMask.EXTERIOR)) {\r\n          if (this.getSpineEdgesInTriangle(faceSeed, xyzOut, bIncludeInterior, bIncludeFinal)) {\r\n          } else if (this.getSpineEdgesInQuad(faceSeed, xyzOut, bIncludeInterior, bIncludeFinal, bIncludeCornerSpokes)) {\r\n          }\r\n        }\r\n        return true;\r\n      });\r\n    return xyzOut;\r\n  }\r\n\r\n  /**\r\n   * Intermediate markup step to identify quads between corresponding boundary edges.\r\n   * * search for and mark triangle edges that should be treated as diagonal of a quad\r\n   * * Angle logic is:\r\n   *   * In a candidate quad (formed by joining triangles that share an edge)\r\n   *   * form segments between opposite edges of the quad.\r\n   *   * compute angles between these segments and the edges of their quads.\r\n   *   * if this angle is larger than minAngleRadians, accept this as a quad.\r\n   *   * recommended angle is between 15 and 5 degrees; 50 degrees is typical\r\n   * @param bDeleteDiagonals if true, eliminate the diagonals.\r\n   * @param minAngleRadians angle tolerance, as described above.\r\n   */\r\n  public consolidateTrianglesToQuads(bDeleteDiagonals: boolean, minAngle: Angle = Angle.createDegrees(50)): number {\r\n\r\n    const numDiagonal = this.setSortedDiagonalMasks(minAngle.radians);\r\n    if (bDeleteDiagonals && numDiagonal > 0) {\r\n      this.graph.yankAndDeleteEdges(\r\n        (node: HalfEdge) => node.getMask(this._diagonalMask));\r\n    }\r\n    return numDiagonal;\r\n  }\r\n}\r\n"]}

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

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

package/lib/esm/topology/HalfEdgePriorityQueue.js

@@ -17,7 +17,7 @@ import { HalfEdgeGraphOps } from "./Merging";
  * @internal
  */
 export class HalfEdgePriorityQueueWithPartnerArray {
-    constructor(compare = HalfEdgeGraphOps.compareNodesYXUp) {
+    constructor(compare = (a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b)) {
         this.priorityQueue = new PriorityQueue(compare);
         this.activeEdges = [];
     }

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;IAGhD,YACE,UAAuC,gBAAgB,CAAC,gBAAgB;QACxE,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;YACT,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAG,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACzB;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;YAC1B,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;gBACX,+BAA+B;gBAC/B,IAAI,OAAO,GAAG,CAAC;oBACb,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAChC,OAAO,EAAE,CAAC;aACX;iBAAM;gBACL,mBAAmB;aACpB;SACF;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> = HalfEdgeGraphOps.compareNodesYXUp) {\r\n    this.priorityQueue = new PriorityQueue(compare);\r\n    this.activeEdges = [];\r\n  }\r\n  /** Read a member from the queue and transfer to the active array. */\r\n  public popQueueToArray(): HalfEdge | undefined {\r\n    if (this.priorityQueue.isEmpty)\r\n      return undefined;\r\n    const x = this.priorityQueue.pop()!;\r\n    this.activeEdges.push(x);\r\n    return x;\r\n  }\r\n  /** Pop the last entry and put it back as replacement for current entry at index i.\r\n   * * Effectively remove active member at index i\r\n   * * The array order is changed.\r\n   * * constant time.\r\n   */\r\n  public popArrayToArrayIndex(i: number) {\r\n    const n = this.activeEdges.length;\r\n    if (i < n) {\r\n      const x = this.activeEdges.pop()!;\r\n      this.activeEdges[i] = x;\r\n    }\r\n  }\r\n  /**\r\n   * * Scan the active array.\r\n   * * remove edges whose top y is below y\r\n   * * (pack all remaining ones back towards the beginning)\r\n   */\r\n  public removeArrayMembersWithY1Below(y: number) {\r\n    let numKeep = 0;\r\n    const n = this.activeEdges.length;\r\n    for (let i = 0; i < n; i++) {\r\n      const q = this.activeEdges[i];\r\n      const yB = q.faceSuccessor.y;\r\n      if (yB >= y) {\r\n        // copy [i] forward to [target]\r\n        if (numKeep < i)\r\n          this.activeEdges[numKeep] = q;\r\n        numKeep++;\r\n      } else {\r\n        // let it go by !!!\r\n      }\r\n    }\r\n    this.activeEdges.length = numKeep;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgePriorityQueue.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAqB,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C;;;;;;;;GAQG;AACH,MAAM,OAAO,qCAAqC;IAGhD,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;YACT,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAG,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACzB;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;YAC1B,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;gBACX,+BAA+B;gBAC/B,IAAI,OAAO,GAAG,CAAC;oBACb,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAChC,OAAO,EAAE,CAAC;aACX;iBAAM;gBACL,mBAAmB;aACpB;SACF;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/RegularizeFace.js

@@ -206,7 +206,7 @@ export class RegularizationContext {
     }
     downwardConnectionFromBottomPeak(node) {
         let connectTo;
-        const upFunction = HalfEdgeGraphOps.compareNodesYXUp;
+        const upFunction = (a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b);
         const upEdgeBase = this.findTopVisibleEdge(node, this.upEdges, 1.0);
         const downEdgeBase = this.findTopVisibleEdge(node, this.downEdges, -1.0);
         connectTo = this.updateMaxNode(connectTo, upEdgeBase, upFunction);
@@ -259,7 +259,7 @@ export class RegularizationContext {
      */
     runRegularization(upSweep = true, downSweep = true) {
         if (upSweep) {
-            this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);
+            this.bottomPeaks.sort((a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b));
             for (const bottomPeak of this.bottomPeaks) {
                 // GeometryCoreTestIO.consoleLog("SEARCH", bottomPeak.id, [bottomPeak.x, bottomPeak.y]);
                 if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))
@@ -276,7 +276,7 @@ export class RegularizationContext {
             this.negateXY();
             // swap the various p and down seeds ....
             this.swapArrays();
-            this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);
+            this.bottomPeaks.sort((a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b));
             for (const bottomPeak of this.bottomPeaks) {
                 if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))
                     continue;

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

@@ -1 +1 @@
-{"version":3,"file":"RegularizeFace.js","sourceRoot":"","sources":["../../../src/topology/RegularizeFace.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAiB,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAOhC,YAAmB,KAAoB;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IAmBD;;;;OAIG;IACI,+BAA+B,CAAC,QAAkB;QACvD,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,GAAG;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aAEF;iBAAM,EAAE,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE;oBACR,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aACF;YACD,KAAK,GAAG,KAAK,CAAC;SACf,QAAQ,KAAK,KAAK,QAAQ,EAAE;IAC/B,CAAC;IAED;;;;OAIG;IACI,uCAAuC,CAAC,cAA0B;QACvE,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,KAAK,IAAI,cAAc,EAAE;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aAEF;iBAAM,EAAE,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE;oBACR,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aACF;SACF;IACH,CAAC;IAEO,UAAU;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC;QAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QAC9E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QAC1E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC;QAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAClF,CAAC;IAED;;;;;;;;OAQG;IACK,kBAAkB,CAAC,IAAc,EAAE,UAAsB,EAC/D,aAAqB;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,CAAC;QACP,IAAI,aAAa,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAC5C,IAAI,MAA4B,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;YAClC,MAAM,QAAQ,GAAG,SAAS,CAAC,aAAa,CAAC;YACzC,IAAI,SAAS,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI;gBACzC,SAAS;YACX,0FAA0F;YAC1F,MAAM,MAAM,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAClE,MAAM,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC/D,mFAAmF;YACnF,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC;gBACpB,SAAS;YACX,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,EAAE,GAAG,aAAa,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC5D,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,aAAa,EAAE;oBAChC,MAAM,GAAG,SAAS,CAAC;oBACnB,aAAa,GAAG,EAAE,CAAC;iBACpB;aACF;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACK,uBAAuB,CAAC,QAAkB,EAAE,aAAmC,EAAE,WAAiC;QACxH,IAAI,WAAW,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,sCAAsC;YACtC,IAAI,WAAW,KAAK,SAAS,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC;gBACzF,SAAS;YACX,iGAAiG;YACjG,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE;gBAC3D,IAAI,aAAa,EAAE;oBACjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;oBACtE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,EAAE,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC;wBAC3C,SAAS;iBACZ;gBACD,IAAI,WAAW,EAAE;oBACf,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE;wBACzC,SAAS;iBACZ;gBACD,WAAW,GAAG,MAAM,CAAC;aACtB;SACF;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,aAAa,CAAC,OAA6B,EAAE,SAA+B,EAAE,OAA6C;QACjI,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,IAAI,CAAC,SAAS;YACZ,OAAO,OAAO,CAAC;QACjB,oDAAoD;QACpD,IAAI,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,CAAC;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC;IACjB,CAAC;IACO,QAAQ;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE;YAC1C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SACd;IACH,CAAC;IACO,gCAAgC,CAAC,IAAc;QACrD,IAAI,SAAS,CAAC;QACd,MAAM,UAAU,GAAG,gBAAgB,CAAC,gBAAgB,CAAC;QACrD,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAE,CAAC;QACrE,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAE,CAAC;QAC1E,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClE,IAAI,YAAY;YACd,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;QACpF,MAAM,gBAAgB,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QACtF,IAAI,gBAAgB,KAAK,SAAS;YAChC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAC1E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,wGAAwG;IAChG,iBAAiB,CAAC,KAAe,EAAE,KAAe;QACxD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,GAAG;YACD,IAAI,QAAQ,CAAC,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC;gBAC/C,OAAO,MAAM,CAAC;YAChB,MAAM,GAAG,MAAM,CAAC,eAAe,CAAC;SACjC,QAAQ,MAAM,KAAK,KAAK,EAAE;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,SAAS,CAAC,KAAe,EAAE,KAAe,EAAE,SAAiB;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtG,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;YAChD,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9B,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,qBAAqB,CAAC,YAAY;gBACpC,qBAAqB,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC1E,OAAO,KAAK,CAAC;SACd;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACK,iBAAiB,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1E,IAAI,OAAO,EAAE;YACX,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;YACzD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACzC,wFAAwF;gBACxF,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,uHAAuH;oBACvH,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;iBACvC;aACF;SACF;QACD,IAAI,SAAS,EAAE;YACb,8BAA8B;YAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,yCAAyC;YACzC,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;YACzD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACzC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;iBACxC;aACF;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,EAAE,CAAC;SACnB;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACI,cAAc,CAAC,QAAkB,EAAE,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1F,IAAI,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAEM,eAAe,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QACvE,IAAI,CAAC,uCAAuC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACtE,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,cAAc,CAAC,IAAc;QACzC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,OAA6B,CAAC;QAClC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,EAAE,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE;gBAChB,IAAI,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,CAAC;oBACT,OAAO,GAAG,KAAK,CAAC;iBACjB;gBACD,IAAI,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,CAAC;iBACV;aACF;SACF,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,IAAI,EAAE;QACjD,OAAO,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,gCAAgC,CAC5C,KAAoB,EACpB,gBAAyB,EACzB,MAAgD,EAChD,WAAmC,EACnC,aAAqC;QACrC,IAAI,WAAW;YACb,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,aAAa;YACf,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC;QAClC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBAC7B,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,EAAE;oBAClD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,IAAI,IAAI,EAAE;wBACR,IAAI,WAAW;4BACb,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAC1B;yBAAM;wBACL,IAAI,aAAa;4BACf,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAC5B;iBACF;aACF;SACF;IACH,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 { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { HalfEdgeGraphOps } from \"./Merging\";\r\n\r\n/**\r\n * * Context for regularizing single faces.\r\n * @internal\r\n */\r\nexport class RegularizationContext {\r\n  // For debugging use ... \"almost always\" undefined.\r\n  // If defined, it is called with each inserted node pair.\r\n  // scale will be either plus or minus one.\r\n  // when it is negative, the node coordinates (both x and y) have been negated.\r\n  // The call is made after full insertion into vertex loop.\r\n  public static announceEdge?: (graph: HalfEdgeGraph, nodeA: HalfEdge, nodeB: HalfEdge, scale: number) => void;\r\n  public constructor(graph: HalfEdgeGraph) {\r\n    this.graph = graph;\r\n    this.upEdges = [];\r\n    this.downEdges = [];\r\n    this.bottomPeaks = [];\r\n    this.topPeaks = [];\r\n    this.localMin = [];\r\n    this.localMax = [];\r\n  }\r\n\r\n  /**\r\n   * These are public only for testing.\r\n   */\r\n  public graph: HalfEdgeGraph;\r\n  /** array of edges directed upward.  Turn can be left or right, but is not large enough to be a min or max */\r\n  public upEdges: HalfEdge[];\r\n  /** array of edges directed downward, Turn can be left or right, but is not large enough to be a min or max */\r\n  public downEdges: HalfEdge[];\r\n  /** Array of edges whose start is an upward peak (right turn, inbound up, outbound down) */\r\n  public topPeaks: HalfEdge[];\r\n  /** Array of edges whose start is an downward peak (right turn, inbound down, outbound up) */\r\n  public bottomPeaks: HalfEdge[];\r\n\r\n  /** Array of edges at local minima (left turn, inbound down, outbound up).  Ensuing chain is up */\r\n  public localMin: HalfEdge[];\r\n  /** Array of edges at local maxima (left turn, inbound up, outbound down).  Ensuing chain is down */\r\n  public localMax: HalfEdge[];\r\n  /**\r\n   * Collect (and classify) all the edges around a single face.\r\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\r\n   * @param faceSeed face to examine\r\n   */\r\n  public collectVerticalEventsAroundFace(faceSeed: HalfEdge) {\r\n    let nodeA = faceSeed;\r\n    let nodeB;\r\n    let nodeC;\r\n    let abUp;\r\n    let bcUp;\r\n    this.upEdges.length = 0;\r\n    this.downEdges.length = 0;\r\n    this.topPeaks.length = 0;\r\n    this.bottomPeaks.length = 0;\r\n    this.localMin.length = 0;\r\n    this.localMax.length = 0;\r\n    do {\r\n      nodeB = nodeA.faceSuccessor;\r\n      nodeC = nodeB.faceSuccessor;\r\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\r\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\r\n      if (abUp) {\r\n        this.upEdges.push(nodeA);\r\n        if (!bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\r\n            this.localMax.push(nodeB);\r\n          else\r\n            this.topPeaks.push(nodeB);\r\n        }\r\n\r\n      } else { // ab is DOWN\r\n        this.downEdges.push(nodeA);\r\n        if (bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\r\n            this.bottomPeaks.push(nodeB);\r\n          else\r\n            this.localMin.push(nodeB);\r\n        }\r\n      }\r\n      nodeA = nodeB;\r\n    } while (nodeA !== faceSeed);\r\n  }\r\n\r\n  /**\r\n   * Collect (and classify) all the edges in an array.\r\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\r\n   * @param candidateEdges array of edges.\r\n   */\r\n  public collectVerticalEventFromEdgesInAndArray(candidateEdges: HalfEdge[]) {\r\n    let nodeA;\r\n    let nodeB;\r\n    let nodeC;\r\n    let abUp;\r\n    let bcUp;\r\n    this.upEdges.length = 0;\r\n    this.downEdges.length = 0;\r\n    this.topPeaks.length = 0;\r\n    this.bottomPeaks.length = 0;\r\n    this.localMin.length = 0;\r\n    this.localMax.length = 0;\r\n    for (nodeA of candidateEdges) {\r\n      nodeB = nodeA.faceSuccessor;\r\n      nodeC = nodeB.faceSuccessor;\r\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\r\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\r\n      if (abUp) {\r\n        this.upEdges.push(nodeA);\r\n        if (!bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\r\n            this.localMax.push(nodeB);\r\n          else\r\n            this.topPeaks.push(nodeB);\r\n        }\r\n\r\n      } else { // ab is DOWN\r\n        this.downEdges.push(nodeA);\r\n        if (bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\r\n            this.bottomPeaks.push(nodeB);\r\n          else\r\n            this.localMin.push(nodeB);\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  private swapArrays() {\r\n    let save = this.downEdges; this.downEdges = this.upEdges; this.upEdges = save;\r\n    save = this.localMax; this.localMax = this.localMin; this.localMin = save;\r\n    save = this.topPeaks; this.topPeaks = this.bottomPeaks; this.bottomPeaks = save;\r\n  }\r\n\r\n  /**\r\n   * Find the edge (among candidates) which is first struck by a \"rightward\" scan from node\r\n   * * comparisonFunction determines scan sense\r\n   *   * HalfEdge.compareNodeYXTheta is an upward scan.\r\n   *   * HalfEdge.compareNodeYXThetaDownward is a downward scan.\r\n   * @param node\r\n   * @param candidates Array of nodes to search\r\n   * @param nodeComparisonFunction function for lexical comparison.\r\n   */\r\n  private findTopVisibleEdge(node: HalfEdge, candidates: HalfEdge[],\r\n    directionSign: number) {\r\n    const y0 = node.y;\r\n    const x0 = node.x;\r\n    let dx;\r\n    let distanceRight = Number.MAX_SAFE_INTEGER;\r\n    let result: HalfEdge | undefined;\r\n    for (const rightBase of candidates) {\r\n      const rightTop = rightBase.faceSuccessor;\r\n      if (rightBase === node || rightTop === node)\r\n        continue;\r\n      // for horizontal edge cases -- require edges ends to have strict sign change (no zeros!!)\r\n      const cRight = HalfEdgeGraphOps.compareNodesYXUp(node, rightBase);\r\n      const cTop = HalfEdgeGraphOps.compareNodesYXUp(node, rightTop);\r\n      // GeometryCoreTestIO.consoleLog(node.id, rightBase.id, rightTop.id, cRight, cTop);\r\n      if (cRight * cTop >= 0)\r\n        continue;\r\n      const fraction = HalfEdge.horizontalScanFraction01(rightBase, y0);\r\n      if (fraction !== undefined) {\r\n        dx = directionSign * (rightBase.fractionToX(fraction) - x0);\r\n        if (dx > 0 && dx < distanceRight) {\r\n          result = rightBase;\r\n          distanceRight = dx;\r\n        }\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   *\r\n   * @param downPeak a \"bottom\" node where the interior CCW loop has a local min\r\n   * @param downEdgeStart (optional) node at the start (heading downwards!) of an edge that brackets downPeak on the left.\r\n   * @param upEdgeStart  (optional) node at the start (heading up!) of the edge that brackets downPeak on the right.\r\n   */\r\n  private highestUpPeakConnection(downPeak: HalfEdge, downEdgeStart: HalfEdge | undefined, upEdgeStart: HalfEdge | undefined): HalfEdge | undefined {\r\n    let highestPeak;\r\n\r\n    for (const upPeak of this.topPeaks) {\r\n      const y0 = upPeak.y;\r\n      const x0 = upPeak.x;\r\n      // is upPeak higher than prior upPeak?\r\n      if (highestPeak !== undefined && HalfEdgeGraphOps.compareNodesYXUp(upPeak, highestPeak) < 0)\r\n        continue;\r\n      // is upPeak BELOW downPeak, ABOVE both limit edges lower node, and between limit edge interiors.\r\n      if (HalfEdgeGraphOps.compareNodesYXUp(upPeak, downPeak) < 0) {\r\n        if (downEdgeStart) {\r\n          const fraction = HalfEdge.horizontalScanFraction01(downEdgeStart, y0);\r\n          if (fraction === undefined)\r\n            continue;\r\n          if (x0 <= downEdgeStart.fractionToX(fraction))\r\n            continue;\r\n        }\r\n        if (upEdgeStart) {\r\n          const fraction = HalfEdge.horizontalScanFraction01(upEdgeStart, y0);\r\n          if (fraction === undefined)\r\n            continue;\r\n          if (upEdgeStart.fractionToX(fraction) <= x0)\r\n            continue;\r\n        }\r\n        highestPeak = upPeak;\r\n      }\r\n    }\r\n    return highestPeak;\r\n  }\r\n\r\n  private updateMaxNode(maxNode: HalfEdge | undefined, candidate: HalfEdge | undefined, compare: (a: HalfEdge, b: HalfEdge) => number): HalfEdge | undefined {\r\n    if (!maxNode)\r\n      return candidate;\r\n    if (!candidate)\r\n      return maxNode;\r\n    // both are defined .. look for positive compare ...\r\n    if (compare(maxNode, candidate) < 0)\r\n      return candidate;\r\n    return maxNode;\r\n  }\r\n  private negateXY() {\r\n    for (const node of this.graph.allHalfEdges) {\r\n      node.x *= -1;\r\n      node.y *= -1;\r\n    }\r\n  }\r\n  private downwardConnectionFromBottomPeak(node: HalfEdge): HalfEdge | undefined {\r\n    let connectTo;\r\n    const upFunction = HalfEdgeGraphOps.compareNodesYXUp;\r\n    const upEdgeBase = this.findTopVisibleEdge(node, this.upEdges, 1.0)!;\r\n    const downEdgeBase = this.findTopVisibleEdge(node, this.downEdges, -1.0)!;\r\n    connectTo = this.updateMaxNode(connectTo, upEdgeBase, upFunction);\r\n    if (downEdgeBase)\r\n      connectTo = this.updateMaxNode(connectTo, downEdgeBase.faceSuccessor, upFunction);\r\n    const upPeakConnection = this.highestUpPeakConnection(node, downEdgeBase, upEdgeBase);\r\n    if (upPeakConnection !== undefined)\r\n      connectTo = this.updateMaxNode(connectTo, upPeakConnection, upFunction);\r\n    return connectTo;\r\n  }\r\n  /** Search around the vertex of nodeA for a nodeA1 such that nodeB is visible in the sector at nodeA1 */\r\n  private findVisibleSector(nodeA: HalfEdge, nodeB: HalfEdge): HalfEdge | undefined {\r\n    let nodeA1 = nodeA;\r\n    do {\r\n      if (HalfEdge.isNodeVisibleInSector(nodeB, nodeA1))\r\n        return nodeA1;\r\n      nodeA1 = nodeA1.vertexSuccessor;\r\n    } while (nodeA1 !== nodeA);\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Create an edge from (some node around the vertex of) nodeA to (some node around the vertex of) nodeB.\r\n   * * looking around the vertex for alternate insertion corrects cusp insertion errors.\r\n   * @param nodeA\r\n   * @param nodeB\r\n   */\r\n  private joinNodes(nodeA: HalfEdge, nodeB: HalfEdge, direction: number): HalfEdge | undefined {\r\n    const nodeC = this.graph.createEdgeXYZXYZ(nodeA.x, nodeA.y, nodeA.z, 0, nodeB.x, nodeB.y, nodeB.z, 0);\r\n    const nodeA1 = this.findVisibleSector(nodeA, nodeB);\r\n    const nodeB1 = this.findVisibleSector(nodeB, nodeA);\r\n    if (nodeA1 !== undefined && nodeB1 !== undefined) {\r\n      HalfEdge.pinch(nodeA1, nodeC);\r\n      HalfEdge.pinch(nodeB1, nodeC.edgeMate);\r\n      if (RegularizationContext.announceEdge)\r\n        RegularizationContext.announceEdge(this.graph, nodeA, nodeB, direction);\r\n      return nodeC;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Regularize a single face.\r\n   * * Insert edge from any downward interior vertex to something lower\r\n   * * Insert an edge from each upward interior vertex to something higher.\r\n   * * The face is split into smaller faces\r\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\r\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\r\n   * @param faceSeed any representative half edge on the face\r\n   * @param upSweep true to do the upward sweep.\r\n   * @param downSweep true to do the downward sweep.\r\n   */\r\n  private runRegularization(upSweep: boolean = true, downSweep: boolean = true) {\r\n    if (upSweep) {\r\n      this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);\r\n      for (const bottomPeak of this.bottomPeaks) {\r\n        // GeometryCoreTestIO.consoleLog(\"SEARCH\", bottomPeak.id, [bottomPeak.x, bottomPeak.y]);\r\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\r\n          continue;\r\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\r\n        if (target !== undefined) {\r\n          // GeometryCoreTestIO.consoleLog(\"join\", bottomPeak.id, [bottomPeak.x, bottomPeak.y], target.id, [target.x, target.y]);\r\n          this.joinNodes(bottomPeak, target, 1);\r\n        }\r\n      }\r\n    }\r\n    if (downSweep) {\r\n      // flip the whole graph (ouch)\r\n      this.negateXY();\r\n      // swap the various p and down seeds ....\r\n      this.swapArrays();\r\n      this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);\r\n      for (const bottomPeak of this.bottomPeaks) {\r\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\r\n          continue;\r\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\r\n        if (target !== undefined) {\r\n          this.joinNodes(bottomPeak, target, -1);\r\n        }\r\n      }\r\n      this.negateXY();\r\n      this.swapArrays();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Regularize a single face.\r\n   * * Insert edge from any downward interior vertex to something lower\r\n   * * Insert an edge from each upward interior vertex to something higher.\r\n   * * The face is split into smaller faces\r\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\r\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\r\n   * @param faceSeed any representative half edge on the face\r\n   * @param upSweep true to do the upward sweep.\r\n   * @param downSweep true to do the downward sweep.\r\n   */\r\n  public regularizeFace(faceSeed: HalfEdge, upSweep: boolean = true, downSweep: boolean = true) {\r\n    this.collectVerticalEventsAroundFace(faceSeed);\r\n    this.runRegularization(upSweep, downSweep);\r\n  }\r\n\r\n  public regularizeGraph(upSweep: boolean = true, downSweep: boolean = true) {\r\n    this.collectVerticalEventFromEdgesInAndArray(this.graph.allHalfEdges);\r\n    this.runRegularization(upSweep, downSweep);\r\n  }\r\n\r\n  /** test if a single face is monotone;  if so, return its (single) min */\r\n  public static isMonotoneFace(seed: HalfEdge): HalfEdge | undefined {\r\n    let numMin = 0;\r\n    let numMax = 0;\r\n    let nodeMin: HalfEdge | undefined;\r\n    let nodeA = seed;\r\n    do {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      const nodeC = nodeB.faceSuccessor;\r\n      const ab = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB);\r\n      const bc = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC);\r\n      if (ab * bc <= 0) {\r\n        if (ab > 0) {\r\n          numMin++;\r\n          nodeMin = nodeB;\r\n        }\r\n        if (bc > 0) {\r\n          numMax++;\r\n        }\r\n      }\r\n    } while ((nodeA = nodeA.faceSuccessor) !== seed);\r\n    return numMin === 1 && numMax === 1 ? nodeMin : undefined;\r\n  }\r\n  /** Return faces filtered by area and test function.\r\n   * * find one arbitrary representative of each face\r\n   * * offer the candidate to the mutate function.\r\n   * * collect results\r\n   * @param mappedSeeds when filter returns a HalfEdge, collect it here\r\n   * @param unmappedSeeds when filter does not return a half edge, collect the candidate.\r\n   */\r\n  public static collectMappedFaceRepresentatives(\r\n    graph: HalfEdgeGraph,\r\n    positiveAreaOnly: boolean,\r\n    mutate: (seed: HalfEdge) => HalfEdge | undefined,\r\n    mappedEdges: HalfEdge[] | undefined,\r\n    unMappedSeeds: HalfEdge[] | undefined) {\r\n    if (mappedEdges)\r\n      mappedEdges.length = 0;\r\n    if (unMappedSeeds)\r\n      unMappedSeeds.length = 0;\r\n    const mask = HalfEdgeMask.VISITED;\r\n    graph.clearMask(mask);\r\n    for (const seed of graph.allHalfEdges) {\r\n      if (!seed.getMask(mask)) {\r\n        seed.setMaskAroundFace(mask);\r\n        if (!positiveAreaOnly || seed.signedFaceArea() > 0) {\r\n          const edge = mutate(seed);\r\n          if (edge) {\r\n            if (mappedEdges)\r\n              mappedEdges.push(edge);\r\n          } else {\r\n            if (unMappedSeeds)\r\n              unMappedSeeds.push(seed);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"RegularizeFace.js","sourceRoot":"","sources":["../../../src/topology/RegularizeFace.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAiB,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAOhC,YAAmB,KAAoB;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IAmBD;;;;OAIG;IACI,+BAA+B,CAAC,QAAkB;QACvD,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,GAAG;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aAEF;iBAAM,EAAE,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE;oBACR,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aACF;YACD,KAAK,GAAG,KAAK,CAAC;SACf,QAAQ,KAAK,KAAK,QAAQ,EAAE;IAC/B,CAAC;IAED;;;;OAIG;IACI,uCAAuC,CAAC,cAA0B;QACvE,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,KAAK,IAAI,cAAc,EAAE;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aAEF;iBAAM,EAAE,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE;oBACR,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aACF;SACF;IACH,CAAC;IAEO,UAAU;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC;QAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QAC9E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QAC1E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC;QAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAClF,CAAC;IAED;;;;;;;;OAQG;IACK,kBAAkB,CAAC,IAAc,EAAE,UAAsB,EAC/D,aAAqB;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,CAAC;QACP,IAAI,aAAa,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAC5C,IAAI,MAA4B,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;YAClC,MAAM,QAAQ,GAAG,SAAS,CAAC,aAAa,CAAC;YACzC,IAAI,SAAS,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI;gBACzC,SAAS;YACX,0FAA0F;YAC1F,MAAM,MAAM,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAClE,MAAM,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC/D,mFAAmF;YACnF,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC;gBACpB,SAAS;YACX,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,EAAE,GAAG,aAAa,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC5D,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,aAAa,EAAE;oBAChC,MAAM,GAAG,SAAS,CAAC;oBACnB,aAAa,GAAG,EAAE,CAAC;iBACpB;aACF;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACK,uBAAuB,CAAC,QAAkB,EAAE,aAAmC,EAAE,WAAiC;QACxH,IAAI,WAAW,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,sCAAsC;YACtC,IAAI,WAAW,KAAK,SAAS,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC;gBACzF,SAAS;YACX,iGAAiG;YACjG,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE;gBAC3D,IAAI,aAAa,EAAE;oBACjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;oBACtE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,EAAE,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC;wBAC3C,SAAS;iBACZ;gBACD,IAAI,WAAW,EAAE;oBACf,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE;wBACzC,SAAS;iBACZ;gBACD,WAAW,GAAG,MAAM,CAAC;aACtB;SACF;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,aAAa,CAAC,OAA6B,EAAE,SAA+B,EAAE,OAA6C;QACjI,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,IAAI,CAAC,SAAS;YACZ,OAAO,OAAO,CAAC;QACjB,oDAAoD;QACpD,IAAI,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,CAAC;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC;IACjB,CAAC;IACO,QAAQ;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE;YAC1C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SACd;IACH,CAAC;IACO,gCAAgC,CAAC,IAAc;QACrD,IAAI,SAAS,CAAC;QACd,MAAM,UAAU,GAAG,CAAC,CAAW,EAAE,CAAW,EAAE,EAAE,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzF,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAE,CAAC;QACrE,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAE,CAAC;QAC1E,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClE,IAAI,YAAY;YACd,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;QACpF,MAAM,gBAAgB,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QACtF,IAAI,gBAAgB,KAAK,SAAS;YAChC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAC1E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,wGAAwG;IAChG,iBAAiB,CAAC,KAAe,EAAE,KAAe;QACxD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,GAAG;YACD,IAAI,QAAQ,CAAC,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC;gBAC/C,OAAO,MAAM,CAAC;YAChB,MAAM,GAAG,MAAM,CAAC,eAAe,CAAC;SACjC,QAAQ,MAAM,KAAK,KAAK,EAAE;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,SAAS,CAAC,KAAe,EAAE,KAAe,EAAE,SAAiB;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtG,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;YAChD,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9B,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,qBAAqB,CAAC,YAAY;gBACpC,qBAAqB,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC1E,OAAO,KAAK,CAAC;SACd;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACK,iBAAiB,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1E,IAAI,OAAO,EAAE;YACX,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACzC,wFAAwF;gBACxF,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,uHAAuH;oBACvH,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;iBACvC;aACF;SACF;QACD,IAAI,SAAS,EAAE;YACb,8BAA8B;YAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,yCAAyC;YACzC,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACzC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;iBACxC;aACF;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,EAAE,CAAC;SACnB;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACI,cAAc,CAAC,QAAkB,EAAE,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1F,IAAI,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAEM,eAAe,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QACvE,IAAI,CAAC,uCAAuC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACtE,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,cAAc,CAAC,IAAc;QACzC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,OAA6B,CAAC;QAClC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,EAAE,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE;gBAChB,IAAI,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,CAAC;oBACT,OAAO,GAAG,KAAK,CAAC;iBACjB;gBACD,IAAI,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,CAAC;iBACV;aACF;SACF,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,IAAI,EAAE;QACjD,OAAO,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,gCAAgC,CAC5C,KAAoB,EACpB,gBAAyB,EACzB,MAAgD,EAChD,WAAmC,EACnC,aAAqC;QACrC,IAAI,WAAW;YACb,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,aAAa;YACf,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC;QAClC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBAC7B,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,EAAE;oBAClD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,IAAI,IAAI,EAAE;wBACR,IAAI,WAAW;4BACb,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAC1B;yBAAM;wBACL,IAAI,aAAa;4BACf,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAC5B;iBACF;aACF;SACF;IACH,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 { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { HalfEdgeGraphOps } from \"./Merging\";\r\n\r\n/**\r\n * * Context for regularizing single faces.\r\n * @internal\r\n */\r\nexport class RegularizationContext {\r\n  // For debugging use ... \"almost always\" undefined.\r\n  // If defined, it is called with each inserted node pair.\r\n  // scale will be either plus or minus one.\r\n  // when it is negative, the node coordinates (both x and y) have been negated.\r\n  // The call is made after full insertion into vertex loop.\r\n  public static announceEdge?: (graph: HalfEdgeGraph, nodeA: HalfEdge, nodeB: HalfEdge, scale: number) => void;\r\n  public constructor(graph: HalfEdgeGraph) {\r\n    this.graph = graph;\r\n    this.upEdges = [];\r\n    this.downEdges = [];\r\n    this.bottomPeaks = [];\r\n    this.topPeaks = [];\r\n    this.localMin = [];\r\n    this.localMax = [];\r\n  }\r\n\r\n  /**\r\n   * These are public only for testing.\r\n   */\r\n  public graph: HalfEdgeGraph;\r\n  /** array of edges directed upward.  Turn can be left or right, but is not large enough to be a min or max */\r\n  public upEdges: HalfEdge[];\r\n  /** array of edges directed downward, Turn can be left or right, but is not large enough to be a min or max */\r\n  public downEdges: HalfEdge[];\r\n  /** Array of edges whose start is an upward peak (right turn, inbound up, outbound down) */\r\n  public topPeaks: HalfEdge[];\r\n  /** Array of edges whose start is an downward peak (right turn, inbound down, outbound up) */\r\n  public bottomPeaks: HalfEdge[];\r\n\r\n  /** Array of edges at local minima (left turn, inbound down, outbound up).  Ensuing chain is up */\r\n  public localMin: HalfEdge[];\r\n  /** Array of edges at local maxima (left turn, inbound up, outbound down).  Ensuing chain is down */\r\n  public localMax: HalfEdge[];\r\n  /**\r\n   * Collect (and classify) all the edges around a single face.\r\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\r\n   * @param faceSeed face to examine\r\n   */\r\n  public collectVerticalEventsAroundFace(faceSeed: HalfEdge) {\r\n    let nodeA = faceSeed;\r\n    let nodeB;\r\n    let nodeC;\r\n    let abUp;\r\n    let bcUp;\r\n    this.upEdges.length = 0;\r\n    this.downEdges.length = 0;\r\n    this.topPeaks.length = 0;\r\n    this.bottomPeaks.length = 0;\r\n    this.localMin.length = 0;\r\n    this.localMax.length = 0;\r\n    do {\r\n      nodeB = nodeA.faceSuccessor;\r\n      nodeC = nodeB.faceSuccessor;\r\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\r\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\r\n      if (abUp) {\r\n        this.upEdges.push(nodeA);\r\n        if (!bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\r\n            this.localMax.push(nodeB);\r\n          else\r\n            this.topPeaks.push(nodeB);\r\n        }\r\n\r\n      } else { // ab is DOWN\r\n        this.downEdges.push(nodeA);\r\n        if (bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\r\n            this.bottomPeaks.push(nodeB);\r\n          else\r\n            this.localMin.push(nodeB);\r\n        }\r\n      }\r\n      nodeA = nodeB;\r\n    } while (nodeA !== faceSeed);\r\n  }\r\n\r\n  /**\r\n   * Collect (and classify) all the edges in an array.\r\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\r\n   * @param candidateEdges array of edges.\r\n   */\r\n  public collectVerticalEventFromEdgesInAndArray(candidateEdges: HalfEdge[]) {\r\n    let nodeA;\r\n    let nodeB;\r\n    let nodeC;\r\n    let abUp;\r\n    let bcUp;\r\n    this.upEdges.length = 0;\r\n    this.downEdges.length = 0;\r\n    this.topPeaks.length = 0;\r\n    this.bottomPeaks.length = 0;\r\n    this.localMin.length = 0;\r\n    this.localMax.length = 0;\r\n    for (nodeA of candidateEdges) {\r\n      nodeB = nodeA.faceSuccessor;\r\n      nodeC = nodeB.faceSuccessor;\r\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\r\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\r\n      if (abUp) {\r\n        this.upEdges.push(nodeA);\r\n        if (!bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\r\n            this.localMax.push(nodeB);\r\n          else\r\n            this.topPeaks.push(nodeB);\r\n        }\r\n\r\n      } else { // ab is DOWN\r\n        this.downEdges.push(nodeA);\r\n        if (bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\r\n            this.bottomPeaks.push(nodeB);\r\n          else\r\n            this.localMin.push(nodeB);\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  private swapArrays() {\r\n    let save = this.downEdges; this.downEdges = this.upEdges; this.upEdges = save;\r\n    save = this.localMax; this.localMax = this.localMin; this.localMin = save;\r\n    save = this.topPeaks; this.topPeaks = this.bottomPeaks; this.bottomPeaks = save;\r\n  }\r\n\r\n  /**\r\n   * Find the edge (among candidates) which is first struck by a \"rightward\" scan from node\r\n   * * comparisonFunction determines scan sense\r\n   *   * HalfEdge.compareNodeYXTheta is an upward scan.\r\n   *   * HalfEdge.compareNodeYXThetaDownward is a downward scan.\r\n   * @param node\r\n   * @param candidates Array of nodes to search\r\n   * @param nodeComparisonFunction function for lexical comparison.\r\n   */\r\n  private findTopVisibleEdge(node: HalfEdge, candidates: HalfEdge[],\r\n    directionSign: number) {\r\n    const y0 = node.y;\r\n    const x0 = node.x;\r\n    let dx;\r\n    let distanceRight = Number.MAX_SAFE_INTEGER;\r\n    let result: HalfEdge | undefined;\r\n    for (const rightBase of candidates) {\r\n      const rightTop = rightBase.faceSuccessor;\r\n      if (rightBase === node || rightTop === node)\r\n        continue;\r\n      // for horizontal edge cases -- require edges ends to have strict sign change (no zeros!!)\r\n      const cRight = HalfEdgeGraphOps.compareNodesYXUp(node, rightBase);\r\n      const cTop = HalfEdgeGraphOps.compareNodesYXUp(node, rightTop);\r\n      // GeometryCoreTestIO.consoleLog(node.id, rightBase.id, rightTop.id, cRight, cTop);\r\n      if (cRight * cTop >= 0)\r\n        continue;\r\n      const fraction = HalfEdge.horizontalScanFraction01(rightBase, y0);\r\n      if (fraction !== undefined) {\r\n        dx = directionSign * (rightBase.fractionToX(fraction) - x0);\r\n        if (dx > 0 && dx < distanceRight) {\r\n          result = rightBase;\r\n          distanceRight = dx;\r\n        }\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   *\r\n   * @param downPeak a \"bottom\" node where the interior CCW loop has a local min\r\n   * @param downEdgeStart (optional) node at the start (heading downwards!) of an edge that brackets downPeak on the left.\r\n   * @param upEdgeStart  (optional) node at the start (heading up!) of the edge that brackets downPeak on the right.\r\n   */\r\n  private highestUpPeakConnection(downPeak: HalfEdge, downEdgeStart: HalfEdge | undefined, upEdgeStart: HalfEdge | undefined): HalfEdge | undefined {\r\n    let highestPeak;\r\n\r\n    for (const upPeak of this.topPeaks) {\r\n      const y0 = upPeak.y;\r\n      const x0 = upPeak.x;\r\n      // is upPeak higher than prior upPeak?\r\n      if (highestPeak !== undefined && HalfEdgeGraphOps.compareNodesYXUp(upPeak, highestPeak) < 0)\r\n        continue;\r\n      // is upPeak BELOW downPeak, ABOVE both limit edges lower node, and between limit edge interiors.\r\n      if (HalfEdgeGraphOps.compareNodesYXUp(upPeak, downPeak) < 0) {\r\n        if (downEdgeStart) {\r\n          const fraction = HalfEdge.horizontalScanFraction01(downEdgeStart, y0);\r\n          if (fraction === undefined)\r\n            continue;\r\n          if (x0 <= downEdgeStart.fractionToX(fraction))\r\n            continue;\r\n        }\r\n        if (upEdgeStart) {\r\n          const fraction = HalfEdge.horizontalScanFraction01(upEdgeStart, y0);\r\n          if (fraction === undefined)\r\n            continue;\r\n          if (upEdgeStart.fractionToX(fraction) <= x0)\r\n            continue;\r\n        }\r\n        highestPeak = upPeak;\r\n      }\r\n    }\r\n    return highestPeak;\r\n  }\r\n\r\n  private updateMaxNode(maxNode: HalfEdge | undefined, candidate: HalfEdge | undefined, compare: (a: HalfEdge, b: HalfEdge) => number): HalfEdge | undefined {\r\n    if (!maxNode)\r\n      return candidate;\r\n    if (!candidate)\r\n      return maxNode;\r\n    // both are defined .. look for positive compare ...\r\n    if (compare(maxNode, candidate) < 0)\r\n      return candidate;\r\n    return maxNode;\r\n  }\r\n  private negateXY() {\r\n    for (const node of this.graph.allHalfEdges) {\r\n      node.x *= -1;\r\n      node.y *= -1;\r\n    }\r\n  }\r\n  private downwardConnectionFromBottomPeak(node: HalfEdge): HalfEdge | undefined {\r\n    let connectTo;\r\n    const upFunction = (a: HalfEdge, b: HalfEdge) => HalfEdgeGraphOps.compareNodesYXUp(a, b);\r\n    const upEdgeBase = this.findTopVisibleEdge(node, this.upEdges, 1.0)!;\r\n    const downEdgeBase = this.findTopVisibleEdge(node, this.downEdges, -1.0)!;\r\n    connectTo = this.updateMaxNode(connectTo, upEdgeBase, upFunction);\r\n    if (downEdgeBase)\r\n      connectTo = this.updateMaxNode(connectTo, downEdgeBase.faceSuccessor, upFunction);\r\n    const upPeakConnection = this.highestUpPeakConnection(node, downEdgeBase, upEdgeBase);\r\n    if (upPeakConnection !== undefined)\r\n      connectTo = this.updateMaxNode(connectTo, upPeakConnection, upFunction);\r\n    return connectTo;\r\n  }\r\n  /** Search around the vertex of nodeA for a nodeA1 such that nodeB is visible in the sector at nodeA1 */\r\n  private findVisibleSector(nodeA: HalfEdge, nodeB: HalfEdge): HalfEdge | undefined {\r\n    let nodeA1 = nodeA;\r\n    do {\r\n      if (HalfEdge.isNodeVisibleInSector(nodeB, nodeA1))\r\n        return nodeA1;\r\n      nodeA1 = nodeA1.vertexSuccessor;\r\n    } while (nodeA1 !== nodeA);\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Create an edge from (some node around the vertex of) nodeA to (some node around the vertex of) nodeB.\r\n   * * looking around the vertex for alternate insertion corrects cusp insertion errors.\r\n   * @param nodeA\r\n   * @param nodeB\r\n   */\r\n  private joinNodes(nodeA: HalfEdge, nodeB: HalfEdge, direction: number): HalfEdge | undefined {\r\n    const nodeC = this.graph.createEdgeXYZXYZ(nodeA.x, nodeA.y, nodeA.z, 0, nodeB.x, nodeB.y, nodeB.z, 0);\r\n    const nodeA1 = this.findVisibleSector(nodeA, nodeB);\r\n    const nodeB1 = this.findVisibleSector(nodeB, nodeA);\r\n    if (nodeA1 !== undefined && nodeB1 !== undefined) {\r\n      HalfEdge.pinch(nodeA1, nodeC);\r\n      HalfEdge.pinch(nodeB1, nodeC.edgeMate);\r\n      if (RegularizationContext.announceEdge)\r\n        RegularizationContext.announceEdge(this.graph, nodeA, nodeB, direction);\r\n      return nodeC;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Regularize a single face.\r\n   * * Insert edge from any downward interior vertex to something lower\r\n   * * Insert an edge from each upward interior vertex to something higher.\r\n   * * The face is split into smaller faces\r\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\r\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\r\n   * @param faceSeed any representative half edge on the face\r\n   * @param upSweep true to do the upward sweep.\r\n   * @param downSweep true to do the downward sweep.\r\n   */\r\n  private runRegularization(upSweep: boolean = true, downSweep: boolean = true) {\r\n    if (upSweep) {\r\n      this.bottomPeaks.sort((a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b));\r\n      for (const bottomPeak of this.bottomPeaks) {\r\n        // GeometryCoreTestIO.consoleLog(\"SEARCH\", bottomPeak.id, [bottomPeak.x, bottomPeak.y]);\r\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\r\n          continue;\r\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\r\n        if (target !== undefined) {\r\n          // GeometryCoreTestIO.consoleLog(\"join\", bottomPeak.id, [bottomPeak.x, bottomPeak.y], target.id, [target.x, target.y]);\r\n          this.joinNodes(bottomPeak, target, 1);\r\n        }\r\n      }\r\n    }\r\n    if (downSweep) {\r\n      // flip the whole graph (ouch)\r\n      this.negateXY();\r\n      // swap the various p and down seeds ....\r\n      this.swapArrays();\r\n      this.bottomPeaks.sort((a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b));\r\n      for (const bottomPeak of this.bottomPeaks) {\r\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\r\n          continue;\r\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\r\n        if (target !== undefined) {\r\n          this.joinNodes(bottomPeak, target, -1);\r\n        }\r\n      }\r\n      this.negateXY();\r\n      this.swapArrays();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Regularize a single face.\r\n   * * Insert edge from any downward interior vertex to something lower\r\n   * * Insert an edge from each upward interior vertex to something higher.\r\n   * * The face is split into smaller faces\r\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\r\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\r\n   * @param faceSeed any representative half edge on the face\r\n   * @param upSweep true to do the upward sweep.\r\n   * @param downSweep true to do the downward sweep.\r\n   */\r\n  public regularizeFace(faceSeed: HalfEdge, upSweep: boolean = true, downSweep: boolean = true) {\r\n    this.collectVerticalEventsAroundFace(faceSeed);\r\n    this.runRegularization(upSweep, downSweep);\r\n  }\r\n\r\n  public regularizeGraph(upSweep: boolean = true, downSweep: boolean = true) {\r\n    this.collectVerticalEventFromEdgesInAndArray(this.graph.allHalfEdges);\r\n    this.runRegularization(upSweep, downSweep);\r\n  }\r\n\r\n  /** test if a single face is monotone;  if so, return its (single) min */\r\n  public static isMonotoneFace(seed: HalfEdge): HalfEdge | undefined {\r\n    let numMin = 0;\r\n    let numMax = 0;\r\n    let nodeMin: HalfEdge | undefined;\r\n    let nodeA = seed;\r\n    do {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      const nodeC = nodeB.faceSuccessor;\r\n      const ab = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB);\r\n      const bc = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC);\r\n      if (ab * bc <= 0) {\r\n        if (ab > 0) {\r\n          numMin++;\r\n          nodeMin = nodeB;\r\n        }\r\n        if (bc > 0) {\r\n          numMax++;\r\n        }\r\n      }\r\n    } while ((nodeA = nodeA.faceSuccessor) !== seed);\r\n    return numMin === 1 && numMax === 1 ? nodeMin : undefined;\r\n  }\r\n  /** Return faces filtered by area and test function.\r\n   * * find one arbitrary representative of each face\r\n   * * offer the candidate to the mutate function.\r\n   * * collect results\r\n   * @param mappedSeeds when filter returns a HalfEdge, collect it here\r\n   * @param unmappedSeeds when filter does not return a half edge, collect the candidate.\r\n   */\r\n  public static collectMappedFaceRepresentatives(\r\n    graph: HalfEdgeGraph,\r\n    positiveAreaOnly: boolean,\r\n    mutate: (seed: HalfEdge) => HalfEdge | undefined,\r\n    mappedEdges: HalfEdge[] | undefined,\r\n    unMappedSeeds: HalfEdge[] | undefined) {\r\n    if (mappedEdges)\r\n      mappedEdges.length = 0;\r\n    if (unMappedSeeds)\r\n      unMappedSeeds.length = 0;\r\n    const mask = HalfEdgeMask.VISITED;\r\n    graph.clearMask(mask);\r\n    for (const seed of graph.allHalfEdges) {\r\n      if (!seed.getMask(mask)) {\r\n        seed.setMaskAroundFace(mask);\r\n        if (!positiveAreaOnly || seed.signedFaceArea() > 0) {\r\n          const edge = mutate(seed);\r\n          if (edge) {\r\n            if (mappedEdges)\r\n              mappedEdges.push(edge);\r\n          } else {\r\n            if (unMappedSeeds)\r\n              unMappedSeeds.push(seed);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n}\r\n"]}

package/lib/esm/topology/Triangulation.js

@@ -610,7 +610,7 @@ class Triangulator {
      *
      */
     static spliceLeftMostNodesOfHoles(graph, outerNode, leftMostHoleLoopNode) {
-        leftMostHoleLoopNode.sort(Triangulator.compareX);
+        leftMostHoleLoopNode.sort((a, b) => Triangulator.compareX(a, b));
         let numFail = 0;
         // process holes from left to right
         for (const holeStart of leftMostHoleLoopNode) {