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

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

@@ -1 +1 @@
-{"version":3,"file":"ChainMerge.js","sourceRoot":"","sources":["../../../src/topology/ChainMerge.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,wDAAqD;AACrD,0CAA+D;AAC/D,qEAAkE;AAClE,mEAAkE;AAClE,mCAAgE;AAChE,uCAA6C;AAoB7C,oGAAoG;AACpG,MAAM,iCAAiC;IACrC;;OAEG;IACI,SAAS,CAAS;IACzB;;OAEG;IACK,MAAM,CAAU,4BAA4B,GAAG,0BAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IAC/G;;OAEG;IACI,oBAAoB,CAAW;IACtC;;OAEG;IACI,MAAM,CAAC,uBAAuB,CAAC,MAAiB;QACrD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,MAAM,CAAC,oBAAoB,CAChC,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IACD;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,wBAAkC;QACvE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,oBAAoB,GAAG,wBAAwB,CAAC;IACvD,CAAC;IACD,qCAAqC;IAC9B,MAAM,CAAC,qBAAqB,CAAC,OAAkC;QACpE,MAAM,MAAM,GAAG,IAAI,iCAAiC,CAAC,mBAAQ,CAAC,mBAAmB,EAAE,iCAAiC,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAChJ,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;gBACjC,MAAM,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YACvC,IAAI,OAAO,CAAC,oBAAoB,KAAK,SAAS;gBAC5C,MAAM,CAAC,oBAAoB,GAAG,iCAAiC,CAAC,uBAAuB,EAAE,CAAC;QAC9F,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,iCAAiC,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC1F,CAAC;;AAEH;;;;;;;;;;;;;;GAcG;AACH,MAAa,iBAAiB;IAEpB,MAAM,CAAgB;IACtB,QAAQ,CAAoC;IAC5C,MAAM,CAA0B;IAChC,cAAc,CAAsB;IAC5C,YAAoB,OAA0C;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IACD,uEAAuE;IACvE,IAAW,KAAK,CAAC,KAAyC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IACpF,+CAA+C;IAC/C,IAAW,KAAK,KAAyC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE9E,uEAAuE;IACvE,IAAW,aAAa,CAAC,KAAqC,IAAI,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC;IAChG,+CAA+C;IAC/C,IAAW,aAAa,KAAqC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;IAE1F;;;;;;;;OAQG;IACI,MAAM,CAAC,MAAM,CAAC,OAAkC;QACrD,MAAM,gBAAgB,GAAG,iCAAiC,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAC1F,OAAO,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,CAAC;IACjD,CAAC;IACD,2CAA2C;IACpC,UAAU,CAAC,MAAe,EAAE,MAAe;QAChD,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjG,CAAC;IACD,mDAAmD;IAC5C,qBAAqB,CAAC,IAAqB;QAChD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD;;OAEG;IACI,kBAAkB,CAAC,MAAwB,EAAE,aAAsB,KAAK;QAC7E,IAAI,CAAC,IAAI,CAAC,MAAM;YACd,OAAO;QACT,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,CAAC;QACP,OAAO,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,EAAG,EAAE,GAAG,EAAE,EAAE,CAAC;YAC/C,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC;gBAC1E,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAC1B,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,EACnH,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3H,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,cAAc,CAAC,IAAc;QACnC,OAAO,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IACD,+DAA+D;IACvD,MAAM,CAAC,mBAAmB,CAAC,KAAe,EAAE,KAAe;QACjE,OAAO,KAAK,CAAC,QAAS,GAAG,KAAK,CAAC,QAAS,CAAC;IAC3C,CAAC;IACD,gIAAgI;IACxH,MAAM,CAAC,aAAa,CAAC,KAAe;QAC1C,OAAO,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IACzC,CAAC;IAED,6IAA6I;IACrI,MAAM,CAAC,qBAAqB,CAAC,KAAe;QAClD,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,OAAO,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,0BAA0B;QAC/B,0BAAgB,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QACnD,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACtF,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;QAC7C,4DAA4D;QAC5D,kEAAkE;QAClE,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,QAAS,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,YAAY,CAAC;YACjC,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;oBACnC,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3C,IAAI,KAAK,CAAC,QAAS,GAAG,IAAI;4BACxB,MAAM;wBACR,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;4BAC7C,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAC7B,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAI,gCAAgC;wBAC9D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,uCAAuC,CAAC,MAAsB,EAAE,KAAe,EAAE,SAAuB;QAC9G,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;YACjC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU,CAAC;gBACT,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;YACV,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,2CAA2C,CAAC,MAA0B,EAAE,KAAe,EAAE,SAAuB;QACtH,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,mCAAgB,EAAE,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU,CAAC;gBACT,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;YACV,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,uBAAuB,CAAC,IAAkB;QAChD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS;mBAClD,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;gBACrB,gBAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,gBAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;OAEG;IACI,oBAAoB;QACzB,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,+BAA+B;QACpC,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC7E,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAjOD,8CAiOC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { ConvexClipPlaneSet } from \"../clipping/ConvexClipPlaneSet\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * interface containing various options appropriate to merging lines segments into chains.\n * @internal\n */\nexport interface ChainMergeContextOptions {\n  /**\n   * Tolerance for declaring points equal\n   * * Default is `Geometry.smallMetricDistance`\n   */\n  tolerance?: number;\n  /**\n   * Direction for primary sort.\n   * * Default is `Vector3d.create(0.294234298, 0.72391399, 0.45234328798)`\n   * * this vector should NOT be along a principal x,y,z direction.\n   * * The internal form will be normalized.\n   */\n  primarySortDirection?: Vector3d;\n}\n/** Internal form of ChainMergeContextOptions -- same field names, but required to have contents. */\nclass ChainMergeContextValidatedOptions {\n  /**\n   * Tolerance for declaring points equal.\n   */\n  public tolerance: number;\n  /** UNNORMALIZED base vector for sorting.\n   * * Actual vector hoisted into an instance is normalized.\n   */\n  private static readonly _defaultPrimarySortDirection = Vector3d.create(0.294234298, 0.72391399, 0.45234328798);\n  /**\n   * Direction for primary sort.  This is normalized !!!\n   */\n  public primarySortDirection: Vector3d;\n  /** return a unit vector aligned with optional direction.\n   * * Default return is into the first quadrant at a quirky angle so any perpendicular plane is unlikely to hit many points\n   */\n  public static createPrimarySortVector(vector?: Vector3d): Vector3d {\n    if (vector === undefined) {\n      vector = this._defaultPrimarySortDirection.clone();\n    }\n    return vector.normalizeWithDefault(\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.x,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.y,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.z);\n  }\n  /**\n   * PRIVATE constructor -- assumes all inputs are validated in public create method !!!!\n   * @param tolerance\n   * @param unitVectorForPrimarySort\n   */\n  private constructor(tolerance: number, unitVectorForPrimarySort: Vector3d) {\n    this.tolerance = tolerance;\n    this.primarySortDirection = unitVectorForPrimarySort;\n  }\n  /** return the default option set. */\n  public static createFromUnValidated(options?: ChainMergeContextOptions): ChainMergeContextValidatedOptions {\n    const result = new ChainMergeContextValidatedOptions(Geometry.smallMetricDistance, ChainMergeContextValidatedOptions.createPrimarySortVector());\n    if (options !== undefined) {\n      if (options.tolerance !== undefined)\n        result.tolerance = options.tolerance;\n      if (options.primarySortDirection !== undefined)\n        result.primarySortDirection = ChainMergeContextValidatedOptions.createPrimarySortVector();\n    }\n    return result;\n  }\n  /** Clone this context. */\n  public clone(): ChainMergeContextValidatedOptions {\n    return new ChainMergeContextValidatedOptions(this.tolerance, this.primarySortDirection);\n  }\n}\n/**\n * * Context for assembling line segments into chains.\n * * Use the context in phases:\n *   * Create the context:   `context = ChainMergeContext.create ()`\n *   * Add line with any combination of:\n *      * `context.addSegment(pointA, pointB)`\n *      * `context.addLineSegment3dArray (segments)`\n *   * Scan all coordinate data for common coordinates.  Twist nodes together to form chains:\n *      * `context.clusterAndMergeVerticesXYZ ()`\n *   * Collect the chains:\n *      * myLinestringArray = context.collectMaximalChains();\n * * The context carries an optional plane which is used by addSegmentsOnPlane\n *\n * @internal\n */\nexport class ChainMergeContext {\n\n  private _graph: HalfEdgeGraph;\n  private _options: ChainMergeContextValidatedOptions;\n  private _plane?: PlaneAltitudeEvaluator;\n  private _convexClipper?: ConvexClipPlaneSet;\n  private constructor(options: ChainMergeContextValidatedOptions) {\n    this._graph = new HalfEdgeGraph();\n    this._options = options;\n  }\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set plane(value: PlaneAltitudeEvaluator | undefined) { this._plane = value; }\n  /** Property access for the reference plane. */\n  public get plane(): PlaneAltitudeEvaluator | undefined { return this._plane; }\n\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set convexClipper(value: ConvexClipPlaneSet | undefined) { this._convexClipper = value; }\n  /** Property access for the reference plane. */\n  public get convexClipper(): ConvexClipPlaneSet | undefined { return this._convexClipper; }\n\n  /**\n   * * Construct an empty chain merge graph.\n   * * The options parameter may contain any combination of the options values.\n   *   * tolerance = absolute tolerance for declaring points equal.\n   *     * Default is `Geometry.smallMetricDistance`\n   *   * primarySortDirection = direction for first sort.\n   *     * To minimize clash among points on primary sort, this should NOT be perpendicular to any principal plane.\n   *     * The default points into the first octant with non-obvious components.\n   */\n  public static create(options?: ChainMergeContextOptions): ChainMergeContext {\n    const validatedOptions = ChainMergeContextValidatedOptions.createFromUnValidated(options);\n    return new ChainMergeContext(validatedOptions);\n  }\n  /** Add a segment to the evolving graph. */\n  public addSegment(pointA: Point3d, pointB: Point3d) {\n    this._graph.createEdgeXYZXYZ(pointA.x, pointA.y, pointA.z, 0, pointB.x, pointB.y, pointB.z, 0);\n  }\n  /** Add all segments from an array to the graph. */\n  public addLineSegment3dArray(data: LineSegment3d[]) {\n    for (const segment of data) {\n      this.addSegment(segment.point0Ref, segment.point1Ref);\n    }\n  }\n  /** Add edges for all segments that are \"on\" the plane.\n   * * No action if `this.plane` is undefined.\n   */\n  public addSegmentsOnPlane(points: GrowableXYZArray, addClosure: boolean = false) {\n    if (!this._plane)\n      return;\n    const plane = this._plane;\n    let i0 = addClosure ? points.length - 1 : 0;\n    let a0 = points.evaluateUncheckedIndexPlaneAltitude(i0, plane);\n    let i1 = addClosure ? 0 : 1;\n    let a1;\n    for (; i1 < points.length; i0 = i1++ , a0 = a1) {\n      a1 = points.evaluateUncheckedIndexPlaneAltitude(i1, plane);\n      if (Geometry.isSmallMetricDistance(a0) && Geometry.isSmallMetricDistance(a1))\n        this._graph.createEdgeXYZXYZ(\n          points.getXAtUncheckedPointIndex(i0), points.getYAtUncheckedPointIndex(i0), points.getZAtUncheckedPointIndex(i0), 0,\n          points.getXAtUncheckedPointIndex(i1), points.getYAtUncheckedPointIndex(i1), points.getZAtUncheckedPointIndex(i1), 0);\n    }\n  }\n  /**\n   * Return a numeric value to be used for sorting, with little chance widely separated nodes will have identical key.\n   * * Any single x,y,z component is a poor choice because horizontal and vertical alignment is common.\n   * * Hence take dot product of x,y,z with non-trivial fraction values.\n   * @param node node with x,y,z coordinates\n   */\n  private primarySortKey(node: HalfEdge): number {\n    return this._options.primarySortDirection.dotProductXYZ(node.x, node.y, node.z);\n  }\n  /** Return difference of sortData members as sort comparison */\n  private static nodeCompareSortData(nodeA: HalfEdge, nodeB: HalfEdge): number {\n    return nodeA.sortData! - nodeB.sortData!;\n  }\n  /** test if nodeA is a dangling edge end (i.e. edges around vertex equal 1, but detect it without walking all the way around. */\n  private static isIsolatedEnd(nodeA: HalfEdge): boolean {\n    return nodeA.vertexSuccessor === nodeA;\n  }\n\n  /** test if nodeA is at a vertex with exactly 2 edges (i.e. edges around vertex equal w, but detect it without walking all the way around. */\n  private static isChainInteriorVertex(nodeA: HalfEdge): boolean {\n    const nodeB = nodeA.vertexSuccessor;\n    return nodeB !== nodeA && nodeB.vertexSuccessor === nodeA;\n  }\n\n  /**\n   * * isolate all edge ends.\n   * * perform cluster analysis to determine nearly coincident points.\n   * * pinch all edges together at each vertex.\n   */\n  public clusterAndMergeVerticesXYZ() {\n    HalfEdgeGraphOps.isolateAllEdges(this._graph);\n    for (const p of this._graph.allHalfEdges) {\n      p.sortData = this.primarySortKey(p);\n    }\n    const sortArray = this._graph.allHalfEdges.slice();\n    sortArray.sort((nodeA, nodeB) => ChainMergeContext.nodeCompareSortData(nodeA, nodeB));\n    const xyzTolerance = this._options.tolerance;\n    // A node is unvisited if it is its own vertex successor !!!\n    // otherwise the node has already been twisted into a base vertex.\n    const n = sortArray.length;\n    for (let i0 = 0; i0 < n; i0++) {\n      const node0 = sortArray[i0];\n      const qMin = node0.sortData!;\n      const qMax = qMin + xyzTolerance;\n      if (ChainMergeContext.isIsolatedEnd(node0)) {\n        for (let i1 = i0 + 1; i1 < n; i1++) {\n          const node1 = sortArray[i1];\n          if (ChainMergeContext.isIsolatedEnd(node1)) {\n            if (node1.sortData! > qMax)\n              break;\n            if (node0.distanceXYZ(node1) <= xyzTolerance) {\n              HalfEdge.pinch(node0, node1);\n              node1.setXYZFrom(node0);    // force true equal coordinates.\n            }\n          }\n        }\n      }\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalLineString3dFromStartNode(chains: LineString3d[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const ls = LineString3d.create();\n      ls.addPointXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        ls.addPointXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      chains.push(ls);\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalGrowableXYXArrayFromStartNode(result: GrowableXYZArray[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const points = new GrowableXYZArray();\n      points.pushXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        points.pushXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      if (points.length > 0)\n        result.push(points);\n    }\n  }\n\n  /**\n   * * find edges with start, end in same vertex loop.\n   * * pinch them away from the loop\n   * * set mask on both sides.\n   * * Return the number of excisions.\n   */\n  private exciseAndMarkSlingEdges(mask: HalfEdgeMask): number {\n    let n = 0;\n    for (const p of this._graph.allHalfEdges) {\n      if (p.distanceXYZ(p.edgeMate) < this._options.tolerance\n        && !p.isMaskSet(mask)) {\n        const q = p.edgeMate;\n        HalfEdge.pinch(p, p.vertexPredecessor);\n        HalfEdge.pinch(q, q.vertexPredecessor);\n        p.setMask(mask);\n        q.setMask(mask);\n        n++;\n      }\n    }\n    return n;\n  }\n  /** Collect chains which have maximum edge count, broken at an vertex with other than 2 edges.\n   * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`\n   */\n  public collectMaximalChains(): LineString3d[] {\n    const result: LineString3d[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n  public collectMaximalGrowableXYZArrays(): GrowableXYZArray[] {\n    const result: GrowableXYZArray[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n}\n"]}
+{"version":3,"file":"ChainMerge.js","sourceRoot":"","sources":["../../../src/topology/ChainMerge.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,wDAAqD;AACrD,0CAA+D;AAC/D,qEAAkE;AAClE,mEAAkE;AAClE,mCAAgE;AAChE,uCAA6C;AAoB7C,oGAAoG;AACpG,MAAM,iCAAiC;IACrC;;OAEG;IACI,SAAS,CAAS;IACzB;;OAEG;IACK,MAAM,CAAU,4BAA4B,GAAG,0BAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IAC/G;;OAEG;IACI,oBAAoB,CAAW;IACtC;;OAEG;IACI,MAAM,CAAC,uBAAuB,CAAC,MAAiB;QACrD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,MAAM,CAAC,oBAAoB,CAChC,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IACD;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,wBAAkC;QACvE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,oBAAoB,GAAG,wBAAwB,CAAC;IACvD,CAAC;IACD,qCAAqC;IAC9B,MAAM,CAAC,qBAAqB,CAAC,OAAkC;QACpE,MAAM,MAAM,GAAG,IAAI,iCAAiC,CAAC,mBAAQ,CAAC,mBAAmB,EAAE,iCAAiC,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAChJ,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;gBACjC,MAAM,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YACvC,IAAI,OAAO,CAAC,oBAAoB,KAAK,SAAS;gBAC5C,MAAM,CAAC,oBAAoB,GAAG,iCAAiC,CAAC,uBAAuB,EAAE,CAAC;QAC9F,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,iCAAiC,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC1F,CAAC;;AAEH;;;;;;;;;;;;;;GAcG;AACH,MAAa,iBAAiB;IAEpB,MAAM,CAAgB;IACtB,QAAQ,CAAoC;IAC5C,MAAM,CAA0B;IAChC,cAAc,CAAsB;IAC5C,YAAoB,OAA0C;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IACD,uEAAuE;IACvE,IAAW,KAAK,CAAC,KAAyC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IACpF,+CAA+C;IAC/C,IAAW,KAAK,KAAyC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE9E,uEAAuE;IACvE,IAAW,aAAa,CAAC,KAAqC,IAAI,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC;IAChG,+CAA+C;IAC/C,IAAW,aAAa,KAAqC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;IAE1F;;;;;;;;OAQG;IACI,MAAM,CAAC,MAAM,CAAC,OAAkC;QACrD,MAAM,gBAAgB,GAAG,iCAAiC,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAC1F,OAAO,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,CAAC;IACjD,CAAC;IACD,2CAA2C;IACpC,UAAU,CAAC,MAAe,EAAE,MAAe;QAChD,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjG,CAAC;IACD,mDAAmD;IAC5C,qBAAqB,CAAC,IAAqB;QAChD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD;;OAEG;IACI,kBAAkB,CAAC,MAAwB,EAAE,aAAsB,KAAK;QAC7E,IAAI,CAAC,IAAI,CAAC,MAAM;YACd,OAAO;QACT,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,CAAC;QACP,OAAO,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,EAAG,EAAE,GAAG,EAAE,EAAE,CAAC;YAC/C,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC;gBAC1E,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAC1B,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,EACnH,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3H,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,cAAc,CAAC,IAAc;QACnC,OAAO,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IACD,+DAA+D;IACvD,MAAM,CAAC,mBAAmB,CAAC,KAAe,EAAE,KAAe;QACjE,OAAO,KAAK,CAAC,QAAS,GAAG,KAAK,CAAC,QAAS,CAAC;IAC3C,CAAC;IACD,gIAAgI;IACxH,MAAM,CAAC,aAAa,CAAC,KAAe;QAC1C,OAAO,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IACzC,CAAC;IAED,6IAA6I;IACrI,MAAM,CAAC,qBAAqB,CAAC,KAAe;QAClD,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,OAAO,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,0BAA0B;QAC/B,0BAAgB,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QACnD,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACtF,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;QAC7C,4DAA4D;QAC5D,kEAAkE;QAClE,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,QAAS,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,YAAY,CAAC;YACjC,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;oBACnC,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3C,IAAI,KAAK,CAAC,QAAS,GAAG,IAAI;4BACxB,MAAM;wBACR,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;4BAC7C,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAC7B,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAI,gCAAgC;wBAC9D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,uCAAuC,CAAC,MAAsB,EAAE,KAAe,EAAE,SAAuB;QAC9G,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;YACjC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU,CAAC;gBACT,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;YACV,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,2CAA2C,CAAC,MAA0B,EAAE,KAAe,EAAE,SAAuB;QACtH,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,mCAAgB,EAAE,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU,CAAC;gBACT,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;YACV,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,uBAAuB,CAAC,IAAkB;QAChD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS;mBAClD,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;gBACrB,gBAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,gBAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;OAEG;IACI,oBAAoB;QACzB,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,+BAA+B;QACpC,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC7E,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAjOD,8CAiOC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { ConvexClipPlaneSet } from \"../clipping/ConvexClipPlaneSet\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * interface containing various options appropriate to merging lines segments into chains.\n * @internal\n */\nexport interface ChainMergeContextOptions {\n  /**\n   * Tolerance for declaring points equal\n   * * Default is `Geometry.smallMetricDistance`\n   */\n  tolerance?: number;\n  /**\n   * Direction for primary sort.\n   * * Default is `Vector3d.create(0.294234298, 0.72391399, 0.45234328798)`\n   * * this vector should NOT be along a principal x,y,z direction.\n   * * The internal form will be normalized.\n   */\n  primarySortDirection?: Vector3d;\n}\n/** Internal form of ChainMergeContextOptions -- same field names, but required to have contents. */\nclass ChainMergeContextValidatedOptions {\n  /**\n   * Tolerance for declaring points equal.\n   */\n  public tolerance: number;\n  /** UNNORMALIZED base vector for sorting.\n   * * Actual vector hoisted into an instance is normalized.\n   */\n  private static readonly _defaultPrimarySortDirection = Vector3d.create(0.294234298, 0.72391399, 0.45234328798);\n  /**\n   * Direction for primary sort.  This is normalized !!!\n   */\n  public primarySortDirection: Vector3d;\n  /** return a unit vector aligned with optional direction.\n   * * Default return is into the first quadrant at a quirky angle so any perpendicular plane is unlikely to hit many points\n   */\n  public static createPrimarySortVector(vector?: Vector3d): Vector3d {\n    if (vector === undefined) {\n      vector = this._defaultPrimarySortDirection.clone();\n    }\n    return vector.normalizeWithDefault(\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.x,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.y,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.z);\n  }\n  /**\n   * PRIVATE constructor -- assumes all inputs are validated in public create method !!!!\n   * @param tolerance\n   * @param unitVectorForPrimarySort\n   */\n  private constructor(tolerance: number, unitVectorForPrimarySort: Vector3d) {\n    this.tolerance = tolerance;\n    this.primarySortDirection = unitVectorForPrimarySort;\n  }\n  /** return the default option set. */\n  public static createFromUnValidated(options?: ChainMergeContextOptions): ChainMergeContextValidatedOptions {\n    const result = new ChainMergeContextValidatedOptions(Geometry.smallMetricDistance, ChainMergeContextValidatedOptions.createPrimarySortVector());\n    if (options !== undefined) {\n      if (options.tolerance !== undefined)\n        result.tolerance = options.tolerance;\n      if (options.primarySortDirection !== undefined)\n        result.primarySortDirection = ChainMergeContextValidatedOptions.createPrimarySortVector();\n    }\n    return result;\n  }\n  /** Clone this context. */\n  public clone(): ChainMergeContextValidatedOptions {\n    return new ChainMergeContextValidatedOptions(this.tolerance, this.primarySortDirection);\n  }\n}\n/**\n * * Context for assembling line segments into chains.\n * * Use the context in phases:\n *   * Create the context:   `context = ChainMergeContext.create ()`\n *   * Add line with any combination of:\n *      * `context.addSegment(pointA, pointB)`\n *      * `context.addLineSegment3dArray (segments)`\n *   * Scan all coordinate data for common coordinates.  Twist nodes together to form chains:\n *      * `context.clusterAndMergeVerticesXYZ ()`\n *   * Collect the chains:\n *      * myLinestringArray = context.collectMaximalChains();\n * * The context carries an optional plane which is used by addSegmentsOnPlane\n *\n * @internal\n */\nexport class ChainMergeContext {\n\n  private _graph: HalfEdgeGraph;\n  private _options: ChainMergeContextValidatedOptions;\n  private _plane?: PlaneAltitudeEvaluator;\n  private _convexClipper?: ConvexClipPlaneSet;\n  private constructor(options: ChainMergeContextValidatedOptions) {\n    this._graph = new HalfEdgeGraph();\n    this._options = options;\n  }\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set plane(value: PlaneAltitudeEvaluator | undefined) { this._plane = value; }\n  /** Property access for the reference plane. */\n  public get plane(): PlaneAltitudeEvaluator | undefined { return this._plane; }\n\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set convexClipper(value: ConvexClipPlaneSet | undefined) { this._convexClipper = value; }\n  /** Property access for the reference plane. */\n  public get convexClipper(): ConvexClipPlaneSet | undefined { return this._convexClipper; }\n\n  /**\n   * * Construct an empty chain merge graph.\n   * * The options parameter may contain any combination of the options values.\n   *   * tolerance = absolute tolerance for declaring points equal.\n   *     * Default is `Geometry.smallMetricDistance`\n   *   * primarySortDirection = direction for first sort.\n   *     * To minimize clash among points on primary sort, this should NOT be perpendicular to any principal plane.\n   *     * The default points into the first octant with non-obvious components.\n   */\n  public static create(options?: ChainMergeContextOptions): ChainMergeContext {\n    const validatedOptions = ChainMergeContextValidatedOptions.createFromUnValidated(options);\n    return new ChainMergeContext(validatedOptions);\n  }\n  /** Add a segment to the evolving graph. */\n  public addSegment(pointA: Point3d, pointB: Point3d) {\n    this._graph.createEdgeXYZXYZ(pointA.x, pointA.y, pointA.z, 0, pointB.x, pointB.y, pointB.z, 0);\n  }\n  /** Add all segments from an array to the graph. */\n  public addLineSegment3dArray(data: LineSegment3d[]) {\n    for (const segment of data) {\n      this.addSegment(segment.point0Ref, segment.point1Ref);\n    }\n  }\n  /** Add edges for all segments that are \"on\" the plane.\n   * * No action if `this.plane` is undefined.\n   */\n  public addSegmentsOnPlane(points: GrowableXYZArray, addClosure: boolean = false) {\n    if (!this._plane)\n      return;\n    const plane = this._plane;\n    let i0 = addClosure ? points.length - 1 : 0;\n    let a0 = points.evaluateUncheckedIndexPlaneAltitude(i0, plane);\n    let i1 = addClosure ? 0 : 1;\n    let a1;\n    for (; i1 < points.length; i0 = i1++ , a0 = a1) {\n      a1 = points.evaluateUncheckedIndexPlaneAltitude(i1, plane);\n      if (Geometry.isSmallMetricDistance(a0) && Geometry.isSmallMetricDistance(a1))\n        this._graph.createEdgeXYZXYZ(\n          points.getXAtUncheckedPointIndex(i0), points.getYAtUncheckedPointIndex(i0), points.getZAtUncheckedPointIndex(i0), 0,\n          points.getXAtUncheckedPointIndex(i1), points.getYAtUncheckedPointIndex(i1), points.getZAtUncheckedPointIndex(i1), 0);\n    }\n  }\n  /**\n   * Return a numeric value to be used for sorting, with little chance widely separated nodes will have identical key.\n   * * Any single x,y,z component is a poor choice because horizontal and vertical alignment is common.\n   * * Hence take dot product of x,y,z with non-trivial fraction values.\n   * @param node node with x,y,z coordinates\n   */\n  private primarySortKey(node: HalfEdge): number {\n    return this._options.primarySortDirection.dotProductXYZ(node.x, node.y, node.z);\n  }\n  /** Return difference of sortData members as sort comparison */\n  private static nodeCompareSortData(nodeA: HalfEdge, nodeB: HalfEdge): number {\n    return nodeA.sortData! - nodeB.sortData!;\n  }\n  /** test if nodeA is a dangling edge end (i.e. edges around vertex equal 1, but detect it without walking all the way around. */\n  private static isIsolatedEnd(nodeA: HalfEdge): boolean {\n    return nodeA.vertexSuccessor === nodeA;\n  }\n\n  /** test if nodeA is at a vertex with exactly 2 edges (i.e. edges around vertex equal w, but detect it without walking all the way around. */\n  private static isChainInteriorVertex(nodeA: HalfEdge): boolean {\n    const nodeB = nodeA.vertexSuccessor;\n    return nodeB !== nodeA && nodeB.vertexSuccessor === nodeA;\n  }\n\n  /**\n   * * isolate all edge ends.\n   * * perform cluster analysis to determine nearly coincident points.\n   * * pinch all edges together at each vertex.\n   */\n  public clusterAndMergeVerticesXYZ() {\n    HalfEdgeGraphOps.isolateAllEdges(this._graph);\n    for (const p of this._graph.allHalfEdges) {\n      p.sortData = this.primarySortKey(p);\n    }\n    const sortArray = this._graph.allHalfEdges.slice();\n    sortArray.sort((nodeA, nodeB) => ChainMergeContext.nodeCompareSortData(nodeA, nodeB));\n    const xyzTolerance = this._options.tolerance;\n    // A node is unvisited if it is its own vertex successor !!!\n    // otherwise the node has already been twisted into a base vertex.\n    const n = sortArray.length;\n    for (let i0 = 0; i0 < n; i0++) {\n      const node0 = sortArray[i0];\n      const qMin = node0.sortData!;\n      const qMax = qMin + xyzTolerance;\n      if (ChainMergeContext.isIsolatedEnd(node0)) {\n        for (let i1 = i0 + 1; i1 < n; i1++) {\n          const node1 = sortArray[i1];\n          if (ChainMergeContext.isIsolatedEnd(node1)) {\n            if (node1.sortData! > qMax)\n              break;\n            if (node0.distanceXYZ(node1) <= xyzTolerance) {\n              HalfEdge.pinch(node0, node1);\n              node1.setXYZFrom(node0);    // force true equal coordinates.\n            }\n          }\n        }\n      }\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalLineString3dFromStartNode(chains: LineString3d[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const ls = LineString3d.create();\n      ls.addPointXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        ls.addPointXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      chains.push(ls);\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalGrowableXYXArrayFromStartNode(result: GrowableXYZArray[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const points = new GrowableXYZArray();\n      points.pushXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        points.pushXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      if (points.length > 0)\n        result.push(points);\n    }\n  }\n\n  /**\n   * * find edges with start, end in same vertex loop.\n   * * pinch them away from the loop\n   * * set mask on both sides.\n   * * Return the number of excisions.\n   */\n  private exciseAndMarkSlingEdges(mask: HalfEdgeMask): number {\n    let n = 0;\n    for (const p of this._graph.allHalfEdges) {\n      if (p.distanceXYZ(p.edgeMate) < this._options.tolerance\n        && !p.isMaskSet(mask)) {\n        const q = p.edgeMate;\n        HalfEdge.pinch(p, p.vertexPredecessor);\n        HalfEdge.pinch(q, q.vertexPredecessor);\n        p.setMask(mask);\n        q.setMask(mask);\n        n++;\n      }\n    }\n    return n;\n  }\n  /** Collect chains which have maximum edge count, broken at vertices with more than 2 edges.\n   * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`\n   */\n  public collectMaximalChains(): LineString3d[] {\n    const result: LineString3d[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n  public collectMaximalGrowableXYZArrays(): GrowableXYZArray[] {\n    const result: GrowableXYZArray[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n}\n"]}

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

@@ -1,6 +1,3 @@
-/** @packageDocumentation
- * @module Topology
- */
 import { LineSegment3d } from "../curve/LineSegment3d";
 import { Point2d, Vector2d } from "../geometry3d/Point2dVector2d";
 import { Point3d, Vector3d } from "../geometry3d/Point3dVector3d";
@@ -39,12 +36,16 @@ export declare enum HalfEdgeMask {
      * BOUNDARY_EDGE nor EXTERIOR_EDGE.
      */
     PRIMARY_EDGE = 4,
-    /** Mask used for low level searches to identify previously-visited nodes. */
-    VISITED = 16,
+    /** Mask set on both sides of a bridge edge added by algorithms to join loops. */
+    BRIDGE_EDGE = 8,
+    /** Mask set on both sides of an edge added during graph regularization. */
+    REGULARIZED_EDGE = 16,
     /** Mask applied to triangles by earcut triangulator. */
     TRIANGULATED_FACE = 256,
     /** Mask applied in a face with 2 edges. */
     NULL_FACE = 512,
+    /** Temporary mask used for low level searches to identify previously-visited nodes. */
+    VISITED = 65536,
     /** No mask bits. */
     NULL_MASK = 0,
     /** The "upper 12" bits of 32 bit integer reserved for grab/drop. */
@@ -201,6 +202,18 @@ export declare class HalfEdge implements HalfEdgeUserData {
      * @returns reference to the half edge created, the new face successor of `baseA`.
      */
     static splitEdge(baseA: undefined | HalfEdge, xA: number | undefined, yA: number | undefined, zA: number | undefined, iA: number | undefined, heArray: HalfEdge[] | undefined): HalfEdge;
+    /**
+     * Reverse of [[splitEdge]]: remove the vertex at `doomed` and merge its two incident edges.
+     * @param doomed one of two nodes added by [[splitEdge]]. These nodes should form a vertex loop of two nodes.
+     * On successful return this node and its mate are isolated.
+     * @param checkParallel whether to check that the doomed edge and the preceding edge in its face loop are parallel.
+     * When passing `true` the assumption is that edge geometry is linear. If nonlinear edge geometry is attached, the
+     * caller should a) verify that the geometry on either side of the doomed vertex can be merged, and if so, they
+     * should b) call this method passing `false`, and c) adjust the geometry of the returned edge and its edge mate
+     * as appropriate.
+     * @returns the former (surviving) face predecessor of `doomed`, or undefined if the edge can't be healed.
+     */
+    static healEdge(doomed: HalfEdge, checkParallel?: boolean): HalfEdge | undefined;
     /**
      * Create a new sliver face "inside" an existing edge.
      * * This creates two nodes that are each face predecessor and successor to the other.
@@ -212,12 +225,12 @@ export declare class HalfEdge implements HalfEdgeUserData {
      * @returns reference to the half edge created in the vertex loop of baseA.
      */
     static splitEdgeCreateSliverFace(baseA: HalfEdge, heArray: HalfEdge[] | undefined): HalfEdge;
-    /** Edge property masks. */
+    /** Masks copied when an edge is split. */
     private static _edgePropertyMasks;
     /**
      * Copy "edge based" content of `fromNode` to `toNode`:
      * * edgeTag
-     * * masks EXTERIOR, BOUNDARY_EDGE, NULL_FACE, PRIMARY_EDGE
+     * * edge masks
      */
     static transferEdgeProperties(fromNode: HalfEdge, toNode: HalfEdge): void;
     /** Return the next half edge around this vertex in the CCW direction. */
@@ -285,7 +298,7 @@ export declare class HalfEdge implements HalfEdgeUserData {
     /**
      * Returns the number of nodes that match (or do not match) the given mask value around this face loop.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
      */
     countMaskAroundFace(mask: HalfEdgeMask, value?: boolean): number;
     /**
@@ -296,16 +309,17 @@ export declare class HalfEdge implements HalfEdgeUserData {
     countMaskAroundVertex(mask: HalfEdgeMask, value?: boolean): number;
     /**
      * Returns the first node that matches (or does not match) the given mask value around this vertex loop, starting
-     * with the instance node and proceeding via vertex successors.
+     * with the instance node and proceeding via `vertexSuccessor`.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
+     * @param reverse if true, search in reverse order via `vertexPredecessor`. Default is `false`.
      */
-    findMaskAroundVertex(mask: HalfEdgeMask, value?: boolean): HalfEdge | undefined;
+    findMaskAroundVertex(mask: HalfEdgeMask, value?: boolean, reverse?: boolean): HalfEdge | undefined;
     /**
      * Returns the first node that matches (or does not match) the given mask value around this face loop, starting
      * with the instance node and proceeding via face successors.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
      */
     findMaskAroundFace(mask: HalfEdgeMask, value?: boolean): HalfEdge | undefined;
     /**
@@ -366,6 +380,8 @@ export declare class HalfEdge implements HalfEdgeUserData {
      * * If the inputs are in the same face loop, the loop splits into two face loops after the pinch.
      */
     static pinch(nodeA: HalfEdge, nodeB: HalfEdge): void;
+    /** Return whether the edge is dangling at its base. */
+    get isDangling(): boolean;
     /**
      * Pinch this half edge out of its base vertex loop.
      * @return the surviving HalfEdge in the vertex loop or `undefined` if the instance HalfEdge is already dangling.
@@ -459,7 +475,10 @@ export declare class HalfEdge implements HalfEdgeUserData {
     isFaceConvex(tolerance?: number): boolean;
     /** Isolate the edge from the graph by yanking each end from its vertex loop. */
     isolateEdge(): void;
-    /** Specify whether this edge is isolated from the rest of the graph. */
+    /**
+     * Specify whether this edge is isolated from the rest of the graph.
+     * * Both edge mates of an isolated edge return true for [[isDangling]].
+     */
     get isIsolatedEdge(): boolean;
     /** Return true if `this` is lexically below `other`. We compare y first, then x, and ignore z. */
     belowYX(other: HalfEdge): boolean;
@@ -481,6 +500,29 @@ export declare class HalfEdge implements HalfEdgeUserData {
     distanceXY(other: HalfEdge): number;
     /** Return distance between xyz coordinates of `this` and `other` node. */
     distanceXYZ(other: HalfEdge): number;
+    /**
+     * Search around the instance's face loop for nodes with the specified mask value.
+     * * Returned nodes satisfy `node.isMaskSet(mask) === value`.
+     * @param mask target mask.
+     * @param value target boolean value for mask on half edges (default `true`).
+     * @param result optional array to be cleared, populated with masked nodes, and returned.
+     * @return array of masked half edges
+     */
+    collectMaskedEdgesAroundFace(mask: HalfEdgeMask, value?: boolean, result?: HalfEdge[]): HalfEdge[];
+    /**
+     * Announce edges in the face loop, starting with the instance and proceeding in a `faceSuccessor` traversal.
+     * @param announceEdge function to call at each edge
+     */
+    announceEdgesInFace(announceEdge: NodeFunction): void;
+    /**
+     * Announce edges in the super face loop, starting with the instance.
+     * * A super face admits a `faceSuccessor` traversal, where the next edge at the far vertex is the first one lacking `skipMask` in a `vertexPredecessor` traversal.
+     * @param skipMask mask on edges to skip.
+     * @param announceEdge function to call at each edge that is not skipped.
+     * @param announceSkipped optional function to call at each edge that is skipped.
+     * @return whether a super face was found. Specifically, if a vertex loop has all edges with `skipMask` set, the return value is `false`.
+     */
+    announceEdgesInSuperFace(skipMask: HalfEdgeMask, announceEdge: NodeFunction, announceSkipped?: NodeFunction): boolean;
     /**
      * Evaluate `f(node)` at each node around `this` node's face loop. Collect the function values.
      * @param f optional node function. If `undefined`, collect the nodes themselves.
@@ -601,6 +643,14 @@ export declare class HalfEdge implements HalfEdgeUserData {
      * @param copyFaceData true to copy `faceTag`.
      */
     copyDataFrom(source: HalfEdge, copyXYZ: boolean, copyVertexData: boolean, copyEdgeData: boolean, copyFaceData: boolean): void;
+    /**
+     * Is the instance's face loop a split-washer type face?
+     * * A split-washer face contains at least one bridge edge.
+     * * A bridge edge and its edge mate have the same `bridgeMask` and live in the same face loop.
+     * * By connecting hole/outer loops with bridge edges, a split-washer face can represent a parity region.
+     * @param bridgeMask mask preset on bridge edges (default is [[HalfEdgeMask.BRIDGE_EDGE]]).
+     */
+    isSplitWasherFace(bridgeMask?: HalfEdgeMask): boolean;
 }
 /**
  * A HalfEdgeGraph has:
@@ -616,7 +666,7 @@ export declare class HalfEdgeGraph {
     constructor();
     /**
      * Ask for a mask (from the graph's free pool) for caller's use.
-     * * Optionally clear the mask throughout the graph.
+     * @param clearInAllHalfEdges optionally clear the mask throughout the graph (default `true`).
      */
     grabMask(clearInAllHalfEdges?: boolean): HalfEdgeMask;
     /** Return `mask` to the free pool. */

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

@@ -1 +1 @@
-{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../src/topology/Graph.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AASvE;;;;;;;;;;;GAWG;AACH,oBAAY,YAAY;IAStB;;;;;MAKE;IAEF,QAAQ,IAAa;IACrB;;;;OAIG;IAEH,aAAa,IAAa;IAC1B;;;;;OAKG;IACH,YAAY,IAAa;IACzB,6EAA6E;IAC7E,OAAO,KAAY;IACnB,wDAAwD;IACxD,iBAAiB,MAAa;IAC9B,2CAA2C;IAC3C,SAAS,MAAa;IACtB,oBAAoB;IACpB,SAAS,IAAa;IACtB,oEAAoE;IACpE,mBAAmB,aAAa;IAChC,oBAAoB;IACpB,QAAQ,aAAa;CAKtB;AAED;;;GAGG;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,GAAG,CAAC;AACnD;;;GAGG;AACH,MAAM,MAAM,oBAAoB,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,MAAM,CAAC;AAC9D;;;GAGG;AACH,MAAM,MAAM,yBAAyB,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,CAAC;AACpE;;;GAGG;AACH,MAAM,MAAM,gCAAgC,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC;AAC/F;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GAAG,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,OAAO,CAAC;AAClF;;;;;GAKG;AACH,MAAM,WAAW,gBAAiB,SAAQ,cAAc;IACtD,yCAAyC;IACzC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,OAAO,CAAC,EAAE,GAAG,CAAC;IACd;;;OAGG;IACH,OAAO,CAAC,EAAE,GAAG,CAAC;CACf;AACD;;;;;;;;;;;;;;;;;GAiBG;AACH,qBAAa,QAAS,YAAW,gBAAgB;IAC/C,sDAAsD;IAC/C,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACI,QAAQ,EAAE,MAAM,CAAC;IACxB,2BAA2B;IACpB,CAAC,EAAE,MAAM,CAAC;IACjB,2BAA2B;IACpB,CAAC,EAAE,MAAM,CAAC;IACjB,2BAA2B;IACpB,CAAC,EAAE,MAAM,CAAC;IACjB,wCAAwC;IACjC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC1B,oEAAoE;IAC7D,QAAQ,CAAC,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACI,OAAO,CAAC,EAAE,GAAG,CAAC;IACrB;;;OAGG;IACI,OAAO,CAAC,EAAE,GAAG,CAAC;IACrB,OAAO,CAAC,GAAG,CAAS;IACpB,uFAAuF;IACvF,IAAW,EAAE,WAEZ;IACD,OAAO,CAAC,gBAAgB,CAAW;IACnC,OAAO,CAAC,cAAc,CAAW;IACjC,OAAO,CAAC,SAAS,CAAW;IAC5B,2CAA2C;IAC3C,IAAW,eAAe,IAAI,QAAQ,CAErC;IACD,uCAAuC;IACvC,IAAW,aAAa,IAAI,QAAQ,CAEnC;IACD,gDAAgD;IAChD,IAAW,QAAQ,IAAI,QAAQ,CAE9B;IACD,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAAK;gBACnB,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU;IAiB7E;;;;OAIG;IACI,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAUzC;;;;;OAKG;WACW,kBAAkB,CAAC,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,GAAG,QAAQ;IAa3E;;;;;;OAMG;WACW,iCAAiC,CAC7C,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAC9D,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAC9D,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,GAC9B,QAAQ;IAaX;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,YAAY;IAI3B,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,YAAY;IAI3B;;;;;;;;;OASG;WACW,SAAS,CACrB,KAAK,EAAE,SAAS,GAAG,QAAQ,EAC3B,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,GAC9B,QAAQ;IA6BX;;;;;;;;;OASG;WACW,yBAAyB,CACrC,KAAK,EAAE,QAAQ,EACf,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,GAC9B,QAAQ;IAiBX,2BAA2B;IAC3B,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAE/B;IACF;;;;OAIG;WACW,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAG,IAAI;IAShF,yEAAyE;IACzE,IAAW,eAAe,IAAI,QAAQ,CAErC;IACD,wEAAwE;IACxE,IAAW,iBAAiB,IAAI,QAAQ,CAEvC;IACD;;;OAGG;IACI,OAAO,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAGxC;;;OAGG;IACI,OAAO,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM;IAG1C;;;OAGG;IACI,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAG1C;;;OAGG;IACI,mBAAmB,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAQpD,8CAA8C;IACvC,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IAShE;;;OAGG;IACI,iBAAiB,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAOlD;;;OAGG;IACI,iBAAiB,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAIlD;;;OAGG;IACI,mBAAmB,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAIpD,oDAAoD;IAC7C,oBAAoB,IAAI,MAAM;IASrC,4EAA4E;IACrE,gBAAgB,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IASjD,0EAA0E;IACnE,cAAc,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAS/C;;;;OAIG;IACI,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,OAAO;IAiB7E;;;;;OAKG;IACI,2BAA2B,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,GAAE,OAAe,GAAG,IAAI;IAapG,iDAAiD;IAC1C,sBAAsB,IAAI,MAAM;IASvC;;;;OAIG;IACI,mBAAmB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,MAAM;IAkB7E;;;;OAIG;IACI,qBAAqB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,MAAM;IAkB/E;;;;;OAKG;IACI,oBAAoB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,QAAQ,GAAG,SAAS;IAS5F;;;;;OAKG;IACI,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,QAAQ,GAAG,SAAS;IAS1F;;;;;OAKG;IACI,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,QAAQ,GAAG,SAAS;IAQ1F;;;OAGG;IACI,cAAc,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM;IAKjD;;;OAGG;IACI,UAAU,CAAC,IAAI,EAAE,QAAQ;IAKhC;;;OAGG;IACI,MAAM,CAAC,GAAG,EAAE,MAAM;IAKzB;;;OAGG;IACI,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO;IAG7C;;;;OAIG;WACW,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,GAAG,OAAO;IAGzE;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,GAAG,OAAO;IAG1E;;;;;;;;;OASG;WACW,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,QAAQ;IAShH;;;;;;OAMG;WACW,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ;IAWpD;;;OAGG;IACI,kBAAkB,IAAI,QAAQ,GAAG,SAAS;IAQjD;;;OAGG;IACI,YAAY;IAKnB,kGAAkG;WACpF,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,GAAG;IAG7C,6DAA6D;WAC/C,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAG9C,uEAAuE;WACzD,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAGpD,4EAA4E;WAC9D,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,EAAE,CAAA;KAAE;IAGxF,sFAAsF;WACxE,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAItD,kFAAkF;WACpE,iBAAiB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAGvD;;;;OAIG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAYtD,6CAA6C;WAC/B,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,EAAE;IAGhD,gFAAgF;IACzE,uBAAuB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAG3D,qDAAqD;IAC9C,qBAAqB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IASzD,qDAAqD;IAC9C,uBAAuB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAS3D;;;;;;;;OAQG;WACW,qBAAqB,CAAC,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,GAAG,OAAO;IAoCvF,iGAAiG;WACnF,uBAAuB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;IAMnG,iGAAiG;WACnF,6BAA6B,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;IAM3H,8FAA8F;WAChF,wBAAwB,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,GAAG,MAAM;IAMjG;;;;;;;;;;;;OAYG;WACW,cAAc,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,GAAE,MAAU,GAAG,OAAO;IAUnH;;;;;;;;;OASG;IACI,cAAc,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,OAAO;IAKtD;;;;;;;;OAQG;IACI,YAAY,CAAC,SAAS,GAAE,MAA4C,GAAG,OAAO;IAUrF,gFAAgF;IACzE,WAAW,IAAI,IAAI;IAK1B,wEAAwE;IACxE,IAAW,cAAc,IAAI,OAAO,CAEnC;IACD,kGAAkG;IAC3F,OAAO,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IASxC,yEAAyE;WAC3D,uBAAuB,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAG9D,oEAAoE;WACtD,oBAAoB,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAG3D;;;;OAIG;WACW,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAG,MAAM;IAU7E,8DAA8D;WAChD,sBAAsB,CAAC,IAAI,EAAE,QAAQ;IAGnD,kFAAkF;IAC3E,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,QAAQ,GAAG,OAAO;IAGlD,yEAAyE;IAClE,UAAU,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM;IAG1C,0EAA0E;IACnE,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM;IAG3C;;;;OAIG;IACI,iBAAiB,CAAC,CAAC,CAAC,EAAE,YAAY,GAAG,GAAG,EAAE;IASjD;;;;;;OAMG;IACI,8BAA8B,CACnC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,GAC7D,QAAQ,EAAE;IAab;;;;OAIG;IACI,mBAAmB,CAAC,CAAC,CAAC,EAAE,YAAY,GAAG,GAAG,EAAE;IASnD;;;;OAIG;IACI,aAAa,CAAC,CAAC,EAAE,oBAAoB,GAAG,MAAM;IASrD;;;;OAIG;IACI,eAAe,CAAC,CAAC,EAAE,oBAAoB,GAAG,MAAM;IASvD,0EAA0E;IACnE,mBAAmB,CAAC,IAAI,EAAE,YAAY;IAO7C,gFAAgF;IACzE,qBAAqB,CAAC,IAAI,EAAE,YAAY;IAO/C;;;;;OAKG;IACI,cAAc,IAAI,MAAM;IAkC/B;;;;OAIG;IACI,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAQrE;;;;OAIG;IACI,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IASrE;;;;;;OAMG;IACI,sCAAsC,CAC3C,aAAa,EAAE,MAAM,EAAE,qBAAqB,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GACrE,OAAO;IAUV,mDAAmD;IAC5C,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG5C,mDAAmD;IAC5C,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG5C,8DAA8D;IACvD,oBAAoB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAIxD,8DAA8D;IACvD,oBAAoB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAIxD;;;OAGG;IACI,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI5C;;;OAGG;IACI,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI5C;;;OAGG;IACI,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI5C;;;;;;;OAOG;WACW,+BAA+B,CAC3C,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,QAAQ,GACpD,QAAQ,GAAG,SAAS;IAkBvB;;;;;;OAMG;WACW,sBAAsB,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,QAAQ;IAW/F;;;;;;OAMG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAYtF;;;;;;;OAOG;IACI,YAAY,CACjB,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,GACxG,IAAI;CAiBR;AAED;;;;;GAKG;AACH,qBAAa,aAAa;IACxB,qEAAqE;IAC9D,YAAY,EAAE,QAAQ,EAAE,CAAC;IAChC,OAAO,CAAC,YAAY,CAAc;IAClC,OAAO,CAAC,gBAAgB,CAAK;;IAK7B;;;OAGG;IACI,QAAQ,CAAC,mBAAmB,GAAE,OAAc,GAAG,YAAY;IAOlE,sCAAsC;IAC/B,QAAQ,CAAC,IAAI,EAAE,YAAY;IAGlC;;;;;;OAMG;IACI,gBAAgB,CACrB,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAC9D,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,GAC7D,QAAQ;IAGX;;;;;;;;;OASG;IACI,cAAc,CAAC,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,GAAG,QAAQ;IAG/D;;;OAGG;IACI,qBAAqB,CAC1B,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,IAAI,EAAE,QAAQ,EACd,EAAE,GAAE,MAAU,GACb,QAAQ;IAOX;;;OAGG;IACI,0BAA0B,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,GAAE,MAAU,GAAG,QAAQ;IAU3G;;;;;;OAMG;IACI,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,QAAQ;IAKvF;;;;;;;;;OASG;IACI,SAAS,CAAC,IAAI,EAAE,SAAS,GAAG,QAAQ,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,GAAG,QAAQ;IAGtH;;;;;;;;;OASG;IACI,yBAAyB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ;IAG1D;;;;;;;;OAQG;IACI,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,GAAG,QAAQ;IAKtE;;;OAGG;IACI,YAAY;IAOnB;;;OAGG;IACI,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,QAAQ;IAO1E,4DAA4D;IACrD,SAAS,CAAC,IAAI,EAAE,YAAY;IAInC,0DAA0D;IACnD,OAAO,CAAC,IAAI,EAAE,YAAY;IAIjC,6DAA6D;IACtD,WAAW,CAAC,IAAI,EAAE,YAAY;IAKrC;;;OAGG;IACI,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM;IAO5C;;;;;OAKG;IACI,eAAe,IAAI,aAAa,EAAE;IAazC,+DAA+D;IACxD,gBAAgB,IAAI,MAAM;IAUjC,6DAA6D;IACtD,cAAc,IAAI,MAAM;IAU/B,wFAAwF;IACjF,4BAA4B,CAAC,MAAM,EAAE,gCAAgC,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM;IAWzG,+FAA+F;IACxF,kBAAkB,IAAI,QAAQ,EAAE;IAUvC,6FAA6F;IACtF,gBAAgB,IAAI,QAAQ,EAAE;IAUrC;;;;;;OAMG;IACI,mBAAmB,CAAC,cAAc,EAAE,iBAAiB,GAAG,IAAI;IAUnE;;;;;;OAMG;IACI,iBAAiB,CAAC,YAAY,EAAE,iBAAiB,GAAG,IAAI;IAU/D;;;;;;;OAOG;IACI,aAAa,CAAC,YAAY,EAAE,iBAAiB,GAAG,IAAI;IAY3D;;;;;;OAMG;IACI,aAAa,CAAC,YAAY,EAAE,iBAAiB,GAAG,IAAI;IAM3D,+CAA+C;IACxC,UAAU,IAAI,MAAM;IAG3B,2DAA2D;IACpD,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI;IAKnD;;;;OAIG;IACI,kBAAkB,CAAC,cAAc,EAAE,YAAY,GAAG,MAAM;IAc/D;;;OAGG;IACI,mBAAmB,IAAI,MAAM;CAarC"}
+{"version":3,"file":"Graph.d.ts","sourceRoot":"","sources":["../../../src/topology/Graph.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAQvE;;;;;;;;;;;GAWG;AACH,oBAAY,YAAY;IACtB;;;;;MAKE;IAEF,QAAQ,IAAa;IACrB;;;;OAIG;IAEH,aAAa,IAAa;IAC1B;;;;;OAKG;IACH,YAAY,IAAa;IACzB,iFAAiF;IACjF,WAAW,IAAa;IACxB,2EAA2E;IAC3E,gBAAgB,KAAa;IAC7B,wDAAwD;IACxD,iBAAiB,MAAa;IAC9B,2CAA2C;IAC3C,SAAS,MAAa;IACtB,uFAAuF;IACvF,OAAO,QAAa;IACpB,oBAAoB;IACpB,SAAS,IAAa;IACtB,oEAAoE;IACpE,mBAAmB,aAAa;IAChC,oBAAoB;IACpB,QAAQ,aAAa;CACtB;AAED;;;GAGG;AACH,MAAM,MAAM,YAAY,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,GAAG,CAAC;AACnD;;;GAGG;AACH,MAAM,MAAM,oBAAoB,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,MAAM,CAAC;AAC9D;;;GAGG;AACH,MAAM,MAAM,yBAAyB,GAAG,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,CAAC;AACpE;;;GAGG;AACH,MAAM,MAAM,gCAAgC,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,KAAK,OAAO,CAAC;AAC/F;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GAAG,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,OAAO,CAAC;AAClF;;;;;GAKG;AACH,MAAM,WAAW,gBAAiB,SAAQ,cAAc;IACtD,yCAAyC;IACzC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,qEAAqE;IACrE,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,OAAO,CAAC,EAAE,GAAG,CAAC;IACd;;;OAGG;IACH,OAAO,CAAC,EAAE,GAAG,CAAC;CACf;AACD;;;;;;;;;;;;;;;;;GAiBG;AACH,qBAAa,QAAS,YAAW,gBAAgB;IAC/C,sDAAsD;IAC/C,CAAC,EAAE,MAAM,CAAC;IACjB;;;;OAIG;IACI,QAAQ,EAAE,MAAM,CAAC;IACxB,2BAA2B;IACpB,CAAC,EAAE,MAAM,CAAC;IACjB,2BAA2B;IACpB,CAAC,EAAE,MAAM,CAAC;IACjB,2BAA2B;IACpB,CAAC,EAAE,MAAM,CAAC;IACjB,wCAAwC;IACjC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC1B,oEAAoE;IAC7D,QAAQ,CAAC,EAAE,MAAM,CAAC;IACzB;;;OAGG;IACI,OAAO,CAAC,EAAE,GAAG,CAAC;IACrB;;;OAGG;IACI,OAAO,CAAC,EAAE,GAAG,CAAC;IACrB,OAAO,CAAC,GAAG,CAAS;IACpB,uFAAuF;IACvF,IAAW,EAAE,WAEZ;IACD,OAAO,CAAC,gBAAgB,CAAW;IACnC,OAAO,CAAC,cAAc,CAAW;IACjC,OAAO,CAAC,SAAS,CAAW;IAC5B,2CAA2C;IAC3C,IAAW,eAAe,IAAI,QAAQ,CAErC;IACD,uCAAuC;IACvC,IAAW,aAAa,IAAI,QAAQ,CAEnC;IACD,gDAAgD;IAChD,IAAW,QAAQ,IAAI,QAAQ,CAE9B;IACD,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAAK;gBACnB,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU,EAAE,CAAC,GAAE,MAAU;IAiB7E;;;;OAIG;IACI,SAAS,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAUzC;;;;;OAKG;WACW,kBAAkB,CAAC,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,GAAG,QAAQ;IAa3E;;;;;;OAMG;WACW,iCAAiC,CAC7C,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAC9D,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAAE,EAAE,EAAE,MAAM,YAAI,EAC9D,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,GAC9B,QAAQ;IAaX;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,YAAY;IAI3B,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,YAAY;IAI3B;;;;;;;;;OASG;WACW,SAAS,CACrB,KAAK,EAAE,SAAS,GAAG,QAAQ,EAC3B,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,GAC9B,QAAQ;IA6BX;;;;;;;;;;OAUG;WACW,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,aAAa,GAAE,OAAc,GAAG,QAAQ,GAAG,SAAS;IAoB7F;;;;;;;;;OASG;WACW,yBAAyB,CACrC,KAAK,EAAE,QAAQ,EACf,OAAO,EAAE,QAAQ,EAAE,GAAG,SAAS,GAC9B,QAAQ;IAiBX,0CAA0C;IAC1C,OAAO,CAAC,MAAM,CAAC,kBAAkB,CAE/B;IACF;;;;OAIG;WACW,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAG,IAAI;IAShF,yEAAyE;IACzE,IAAW,eAAe,IAAI,QAAQ,CAErC;IACD,wEAAwE;IACxE,IAAW,iBAAiB,IAAI,QAAQ,CAEvC;IACD;;;OAGG;IACI,OAAO,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAGxC;;;OAGG;IACI,OAAO,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM;IAG1C;;;OAGG;IACI,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAG1C;;;OAGG;IACI,mBAAmB,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAQpD,8CAA8C;IACvC,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI;IAShE;;;OAGG;IACI,iBAAiB,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAOlD;;;OAGG;IACI,iBAAiB,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAIlD;;;OAGG;IACI,mBAAmB,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI;IAIpD,oDAAoD;IAC7C,oBAAoB,IAAI,MAAM;IASrC,4EAA4E;IACrE,gBAAgB,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IASjD,0EAA0E;IACnE,cAAc,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAS/C;;;;OAIG;IACI,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,OAAO;IAiB7E;;;;;OAKG;IACI,2BAA2B,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,EAAE,GAAG,EAAE,WAAW,GAAE,OAAe,GAAG,IAAI;IAapG,iDAAiD;IAC1C,sBAAsB,IAAI,MAAM;IASvC;;;;OAIG;IACI,mBAAmB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,MAAM;IAkB7E;;;;OAIG;IACI,qBAAqB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,MAAM;IAkB/E;;;;;;OAMG;IACI,oBAAoB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,EAAE,OAAO,GAAE,OAAe,GAAG,QAAQ,GAAG,SAAS;IAStH;;;;;OAKG;IACI,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,QAAQ,GAAG,SAAS;IAS1F;;;;;OAKG;IACI,kBAAkB,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,GAAG,QAAQ,GAAG,SAAS;IAQ1F;;;OAGG;IACI,cAAc,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM;IAKjD;;;OAGG;IACI,UAAU,CAAC,IAAI,EAAE,QAAQ;IAKhC;;;OAGG;IACI,MAAM,CAAC,GAAG,EAAE,MAAM;IAKzB;;;OAGG;IACI,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,OAAO;IAG7C;;;;OAIG;WACW,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,GAAG,OAAO;IAGzE;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,GAAG,OAAO;IAG1E;;;;;;;;;OASG;WACW,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,QAAQ;IAShH;;;;;;OAMG;WACW,KAAK,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ;IAWpD,uDAAuD;IACvD,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD;;;OAGG;IACI,kBAAkB,IAAI,QAAQ,GAAG,SAAS;IAQjD;;;OAGG;IACI,YAAY;IAKnB,kGAAkG;WACpF,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,GAAG;IAG7C,6DAA6D;WAC/C,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAG9C,uEAAuE;WACzD,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAGpD,4EAA4E;WAC9D,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,EAAE,CAAA;KAAE;IAGxF,sFAAsF;WACxE,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAItD,kFAAkF;WACpE,iBAAiB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAGvD;;;;OAIG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IAYtD,6CAA6C;WAC/B,QAAQ,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,EAAE;IAGhD,gFAAgF;IACzE,uBAAuB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAG3D,qDAAqD;IAC9C,qBAAqB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IASzD,qDAAqD;IAC9C,uBAAuB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAS3D;;;;;;;;OAQG;WACW,qBAAqB,CAAC,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,GAAG,OAAO;IAoCvF,iGAAiG;WACnF,uBAAuB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;IAMnG,iGAAiG;WACnF,6BAA6B,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;IAM3H,8FAA8F;WAChF,wBAAwB,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,GAAG,MAAM;IAMjG;;;;;;;;;;;;OAYG;WACW,cAAc,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,GAAE,MAAU,GAAG,OAAO;IAUnH;;;;;;;;;OASG;IACI,cAAc,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,OAAO;IAKtD;;;;;;;;OAQG;IACI,YAAY,CAAC,SAAS,GAAE,MAA4C,GAAG,OAAO;IAUrF,gFAAgF;IACzE,WAAW,IAAI,IAAI;IAK1B;;;OAGG;IACH,IAAW,cAAc,IAAI,OAAO,CAEnC;IACD,kGAAkG;IAC3F,OAAO,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IASxC,yEAAyE;WAC3D,uBAAuB,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAG9D,oEAAoE;WACtD,oBAAoB,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAG3D;;;;OAIG;WACW,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAG,MAAM;IAU7E,8DAA8D;WAChD,sBAAsB,CAAC,IAAI,EAAE,QAAQ;IAGnD,kFAAkF;IAC3E,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,QAAQ,GAAG,OAAO;IAGlD,yEAAyE;IAClE,UAAU,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM;IAG1C,0EAA0E;IACnE,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,MAAM;IAG3C;;;;;;;OAOG;IACI,4BAA4B,CAAC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,GAAG,QAAQ,EAAE;IAa/G;;;OAGG;IACI,mBAAmB,CAAC,YAAY,EAAE,YAAY,GAAG,IAAI;IAO5D;;;;;;;OAOG;IACI,wBAAwB,CAAC,QAAQ,EAAE,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,eAAe,CAAC,EAAE,YAAY,GAAG,OAAO;IAyB5H;;;;OAIG;IACI,iBAAiB,CAAC,CAAC,CAAC,EAAE,YAAY,GAAG,GAAG,EAAE;IASjD;;;;;;OAMG;IACI,8BAA8B,CACnC,IAAI,EAAE,YAAY,EAAE,KAAK,GAAE,OAAc,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,GAC7D,QAAQ,EAAE;IAab;;;;OAIG;IACI,mBAAmB,CAAC,CAAC,CAAC,EAAE,YAAY,GAAG,GAAG,EAAE;IASnD;;;;OAIG;IACI,aAAa,CAAC,CAAC,EAAE,oBAAoB,GAAG,MAAM;IASrD;;;;OAIG;IACI,eAAe,CAAC,CAAC,EAAE,oBAAoB,GAAG,MAAM;IASvD,0EAA0E;IACnE,mBAAmB,CAAC,IAAI,EAAE,YAAY;IAO7C,gFAAgF;IACzE,qBAAqB,CAAC,IAAI,EAAE,YAAY;IAO/C;;;;;OAKG;IACI,cAAc,IAAI,MAAM;IAkC/B;;;;OAIG;IACI,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAQrE;;;;OAIG;IACI,iBAAiB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IASrE;;;;;;OAMG;IACI,sCAAsC,CAC3C,aAAa,EAAE,MAAM,EAAE,qBAAqB,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GACrE,OAAO;IAUV,mDAAmD;IAC5C,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG5C,mDAAmD;IAC5C,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG5C,8DAA8D;IACvD,oBAAoB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAIxD,8DAA8D;IACvD,oBAAoB,CAAC,MAAM,CAAC,EAAE,QAAQ,GAAG,QAAQ;IAIxD;;;OAGG;IACI,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI5C;;;OAGG;IACI,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI5C;;;OAGG;IACI,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAI5C;;;;;;;OAOG;WACW,+BAA+B,CAC3C,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,QAAQ,GACpD,QAAQ,GAAG,SAAS;IAkBvB;;;;;;OAMG;WACW,sBAAsB,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,GAAG,QAAQ;IAW/F;;;;;;OAMG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAYtF;;;;;;;OAOG;IACI,YAAY,CACjB,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,GACxG,IAAI;IAaP;;;;;;OAMG;IACI,iBAAiB,CAAC,UAAU,GAAE,YAAuC,GAAG,OAAO;CAkBvF;AAED;;;;;GAKG;AACH,qBAAa,aAAa;IACxB,qEAAqE;IAC9D,YAAY,EAAE,QAAQ,EAAE,CAAC;IAChC,OAAO,CAAC,YAAY,CAAc;IAClC,OAAO,CAAC,gBAAgB,CAAK;;IAK7B;;;OAGG;IACI,QAAQ,CAAC,mBAAmB,GAAE,OAAc,GAAG,YAAY;IAOlE,sCAAsC;IAC/B,QAAQ,CAAC,IAAI,EAAE,YAAY;IAGlC;;;;;;OAMG;IACI,gBAAgB,CACrB,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAC9D,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,GAC7D,QAAQ;IAGX;;;;;;;;;OASG;IACI,cAAc,CAAC,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,GAAG,QAAQ;IAG/D;;;OAGG;IACI,qBAAqB,CAC1B,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,EAAE,EAAE,MAAM,YAAI,EACd,IAAI,EAAE,QAAQ,EACd,EAAE,GAAE,MAAU,GACb,QAAQ;IAOX;;;OAGG;IACI,0BAA0B,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,GAAE,MAAU,GAAG,QAAQ;IAU3G;;;;;;OAMG;IACI,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,QAAQ;IAKvF;;;;;;;;;OASG;IACI,SAAS,CAAC,IAAI,EAAE,SAAS,GAAG,QAAQ,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,EAAE,EAAE,GAAE,MAAU,GAAG,QAAQ;IAGtH;;;;;;;;;OASG;IACI,yBAAyB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ;IAG1D;;;;;;;;OAQG;IACI,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,GAAG,QAAQ;IAKtE;;;OAGG;IACI,YAAY;IAOnB;;;OAGG;IACI,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,QAAQ;IAO1E,4DAA4D;IACrD,SAAS,CAAC,IAAI,EAAE,YAAY;IAInC,0DAA0D;IACnD,OAAO,CAAC,IAAI,EAAE,YAAY;IAIjC,6DAA6D;IACtD,WAAW,CAAC,IAAI,EAAE,YAAY;IAKrC;;;OAGG;IACI,SAAS,CAAC,IAAI,EAAE,YAAY,GAAG,MAAM;IAO5C;;;;;OAKG;IACI,eAAe,IAAI,aAAa,EAAE;IAazC,+DAA+D;IACxD,gBAAgB,IAAI,MAAM;IAUjC,6DAA6D;IACtD,cAAc,IAAI,MAAM;IAU/B,wFAAwF;IACjF,4BAA4B,CAAC,MAAM,EAAE,gCAAgC,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM;IAWzG,+FAA+F;IACxF,kBAAkB,IAAI,QAAQ,EAAE;IAUvC,6FAA6F;IACtF,gBAAgB,IAAI,QAAQ,EAAE;IAUrC;;;;;;OAMG;IACI,mBAAmB,CAAC,cAAc,EAAE,iBAAiB,GAAG,IAAI;IAUnE;;;;;;OAMG;IACI,iBAAiB,CAAC,YAAY,EAAE,iBAAiB,GAAG,IAAI;IAU/D;;;;;;;OAOG;IACI,aAAa,CAAC,YAAY,EAAE,iBAAiB,GAAG,IAAI;IAY3D;;;;;;OAMG;IACI,aAAa,CAAC,YAAY,EAAE,iBAAiB,GAAG,IAAI;IAM3D,+CAA+C;IACxC,UAAU,IAAI,MAAM;IAG3B,2DAA2D;IACpD,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI;IAKnD;;;;OAIG;IACI,kBAAkB,CAAC,cAAc,EAAE,YAAY,GAAG,MAAM;IAc/D;;;OAGG;IACI,mBAAmB,IAAI,MAAM;CAarC"}

package/lib/cjs/topology/Graph.js

@@ -8,6 +8,7 @@ exports.HalfEdgeGraph = exports.HalfEdge = exports.HalfEdgeMask = void 0;
 /** @packageDocumentation
  * @module Topology
  */
+const core_bentley_1 = require("@itwin/core-bentley");
 const LineSegment3d_1 = require("../curve/LineSegment3d");
 const Geometry_1 = require("../Geometry");
 const Angle_1 = require("../geometry3d/Angle");
@@ -17,7 +18,6 @@ const SmallSystem_1 = require("../numerics/SmallSystem");
 const MaskManager_1 = require("./MaskManager");
 // import { GraphChecker } from "../test/topology/Graph.test"; // used for debugging
 /* eslint-disable @typescript-eslint/no-this-alias */
-// cspell:word CONSTU CONSTV USEAM VSEAM internaldocs
 /**
  * * Each node of the graph has a mask member.
  * * The mask member is a number which is used as set of single bit boolean values.
@@ -32,14 +32,6 @@ const MaskManager_1 = require("./MaskManager");
  */
 var HalfEdgeMask;
 (function (HalfEdgeMask) {
-    // REMARK: Various mask names are COMMENTED here for reference to native legacy code.
-    // CONSTU_MASK = 0x00000004,
-    // CONSTV_MASK = 0x00000008,
-    // USEAM_MASK = 0x00000010,
-    // VSEAM_MASK = 0x00000020,
-    // BOUNDARY_VERTEX_MASK = 0x00000040,
-    // PRIMARY_VERTEX_MASK = 0x00000080,
-    // DIRECTED_EDGE_MASK = 0x00000100,
     /**
      * Mask commonly set consistently around exterior faces.
      * * A boundary edge with interior to one side, exterior to the other, will have EXTERIOR only on the outside.
@@ -62,22 +54,22 @@ var HalfEdgeMask;
      * BOUNDARY_EDGE nor EXTERIOR_EDGE.
      */
     HalfEdgeMask[HalfEdgeMask["PRIMARY_EDGE"] = 4] = "PRIMARY_EDGE";
-    /** Mask used for low level searches to identify previously-visited nodes. */
-    HalfEdgeMask[HalfEdgeMask["VISITED"] = 16] = "VISITED";
+    /** Mask set on both sides of a bridge edge added by algorithms to join loops. */
+    HalfEdgeMask[HalfEdgeMask["BRIDGE_EDGE"] = 8] = "BRIDGE_EDGE";
+    /** Mask set on both sides of an edge added during graph regularization. */
+    HalfEdgeMask[HalfEdgeMask["REGULARIZED_EDGE"] = 16] = "REGULARIZED_EDGE";
     /** Mask applied to triangles by earcut triangulator. */
     HalfEdgeMask[HalfEdgeMask["TRIANGULATED_FACE"] = 256] = "TRIANGULATED_FACE";
     /** Mask applied in a face with 2 edges. */
     HalfEdgeMask[HalfEdgeMask["NULL_FACE"] = 512] = "NULL_FACE";
+    /** Temporary mask used for low level searches to identify previously-visited nodes. */
+    HalfEdgeMask[HalfEdgeMask["VISITED"] = 65536] = "VISITED";
     /** No mask bits. */
     HalfEdgeMask[HalfEdgeMask["NULL_MASK"] = 0] = "NULL_MASK";
     /** The "upper 12" bits of 32 bit integer reserved for grab/drop. */
     HalfEdgeMask[HalfEdgeMask["ALL_GRAB_DROP_MASKS"] = 4293918720] = "ALL_GRAB_DROP_MASKS";
     /** All mask bits */
     HalfEdgeMask[HalfEdgeMask["ALL_MASK"] = 4294967295] = "ALL_MASK";
-    // informal convention on preassigned mask bit numbers:
-    // byte0 (EXTERIOR, BOUNDARY_EDGE, PRIMARY_EDGE) -- edge properties
-    // byte1 (VISITED, VISIT_A, WORK_MASK0, WORK_MASK1) -- temp masks for algorithms.
-    // byte2 (TRIANGULATED_FACE, NULL_FACE) -- face properties.
 })(HalfEdgeMask || (exports.HalfEdgeMask = HalfEdgeMask = {}));
 /**
  * A HalfEdge is "one side of an edge" in a structure of faces, edges and vertices. From a node there are
@@ -273,6 +265,37 @@ class HalfEdge {
         }
         return newA;
     }
+    /**
+     * Reverse of [[splitEdge]]: remove the vertex at `doomed` and merge its two incident edges.
+     * @param doomed one of two nodes added by [[splitEdge]]. These nodes should form a vertex loop of two nodes.
+     * On successful return this node and its mate are isolated.
+     * @param checkParallel whether to check that the doomed edge and the preceding edge in its face loop are parallel.
+     * When passing `true` the assumption is that edge geometry is linear. If nonlinear edge geometry is attached, the
+     * caller should a) verify that the geometry on either side of the doomed vertex can be merged, and if so, they
+     * should b) call this method passing `false`, and c) adjust the geometry of the returned edge and its edge mate
+     * as appropriate.
+     * @returns the former (surviving) face predecessor of `doomed`, or undefined if the edge can't be healed.
+     */
+    static healEdge(doomed, checkParallel = true) {
+        if (doomed.isIsolatedEdge)
+            return undefined;
+        const doomed1 = doomed.vertexSuccessor;
+        if (doomed1.vertexSuccessor !== doomed)
+            return undefined; // v-loop not a 2-cycle
+        if (checkParallel && !doomed.vectorToFaceSuccessor().isParallelTo(doomed.facePredecessor.vectorToFaceSuccessor(), false, true))
+            return undefined; // removing this vertex does not leave a straight edge behind
+        const fPred = doomed.facePredecessor;
+        const fSucc = doomed.faceSuccessor;
+        const fPred1 = doomed1.facePredecessor;
+        const fSucc1 = doomed1.faceSuccessor;
+        this.setFaceLinks(fPred, fSucc);
+        this.setFaceLinks(fPred1, fSucc1);
+        this.setEdgeMates(fPred, fPred1);
+        this.setFaceLinks(doomed, doomed1);
+        this.setFaceLinks(doomed1, doomed);
+        this.setEdgeMates(doomed, doomed1);
+        return fPred;
+    }
     /**
      * Create a new sliver face "inside" an existing edge.
      * * This creates two nodes that are each face predecessor and successor to the other.
@@ -300,14 +323,14 @@ class HalfEdge {
         newB.copyDataFrom(baseB, true, true, false, false);
         return newA;
     }
-    /** Edge property masks. */
+    /** Masks copied when an edge is split. */
     static _edgePropertyMasks = [
-        HalfEdgeMask.BOUNDARY_EDGE, HalfEdgeMask.EXTERIOR, HalfEdgeMask.PRIMARY_EDGE, HalfEdgeMask.NULL_FACE,
+        HalfEdgeMask.EXTERIOR, HalfEdgeMask.BOUNDARY_EDGE, HalfEdgeMask.PRIMARY_EDGE, HalfEdgeMask.BRIDGE_EDGE, HalfEdgeMask.REGULARIZED_EDGE, HalfEdgeMask.NULL_FACE
     ];
     /**
      * Copy "edge based" content of `fromNode` to `toNode`:
      * * edgeTag
-     * * masks EXTERIOR, BOUNDARY_EDGE, NULL_FACE, PRIMARY_EDGE
+     * * edge masks
      */
     static transferEdgeProperties(fromNode, toNode) {
         toNode.edgeTag = fromNode.edgeTag;
@@ -480,7 +503,7 @@ class HalfEdge {
     /**
      * Returns the number of nodes that match (or do not match) the given mask value around this face loop.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
      */
     countMaskAroundFace(mask, value = true) {
         let count = 0;
@@ -527,16 +550,17 @@ class HalfEdge {
     }
     /**
      * Returns the first node that matches (or does not match) the given mask value around this vertex loop, starting
-     * with the instance node and proceeding via vertex successors.
+     * with the instance node and proceeding via `vertexSuccessor`.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
+     * @param reverse if true, search in reverse order via `vertexPredecessor`. Default is `false`.
      */
-    findMaskAroundVertex(mask, value = true) {
+    findMaskAroundVertex(mask, value = true, reverse = false) {
         let node = this;
         do {
             if (node.isMaskSet(mask) === value)
                 return node;
-            node = node.vertexSuccessor;
+            node = reverse ? node.vertexPredecessor : node.vertexSuccessor;
         } while (node !== this);
         return undefined;
     }
@@ -544,7 +568,7 @@ class HalfEdge {
      * Returns the first node that matches (or does not match) the given mask value around this face loop, starting
      * with the instance node and proceeding via face successors.
      * @param mask the mask to check.
-     * @param value true for mask match and false for mask not match.
+     * @param value true for mask match and false for mask not match. Default is `true`.
      */
     findMaskAroundFace(mask, value = true) {
         let node = this;
@@ -656,6 +680,10 @@ class HalfEdge {
             predA._faceSuccessor = nodeB;
         }
     }
+    /** Return whether the edge is dangling at its base. */
+    get isDangling() {
+        return this.edgeMate.faceSuccessor === this;
+    }
     /**
      * Pinch this half edge out of its base vertex loop.
      * @return the surviving HalfEdge in the vertex loop or `undefined` if the instance HalfEdge is already dangling.
@@ -859,7 +887,10 @@ class HalfEdge {
         this.yankFromVertexLoop();
         mate.yankFromVertexLoop();
     }
-    /** Specify whether this edge is isolated from the rest of the graph. */
+    /**
+     * Specify whether this edge is isolated from the rest of the graph.
+     * * Both edge mates of an isolated edge return true for [[isDangling]].
+     */
     get isIsolatedEdge() {
         return this === this.vertexSuccessor && this.edgeMate === this.edgeMate.vertexSuccessor;
     }
@@ -907,6 +938,71 @@ class HalfEdge {
     distanceXYZ(other) {
         return Geometry_1.Geometry.distanceXYZXYZ(this.x, this.y, this.z, other.x, other.y, other.z);
     }
+    /**
+     * Search around the instance's face loop for nodes with the specified mask value.
+     * * Returned nodes satisfy `node.isMaskSet(mask) === value`.
+     * @param mask target mask.
+     * @param value target boolean value for mask on half edges (default `true`).
+     * @param result optional array to be cleared, populated with masked nodes, and returned.
+     * @return array of masked half edges
+     */
+    collectMaskedEdgesAroundFace(mask, value = true, result) {
+        if (result === undefined)
+            result = [];
+        else
+            result.length = 0;
+        let node = this;
+        do {
+            if (node.isMaskSet(mask) === value)
+                result.push(node);
+            node = node.faceSuccessor;
+        } while (node !== this);
+        return result;
+    }
+    /**
+     * Announce edges in the face loop, starting with the instance and proceeding in a `faceSuccessor` traversal.
+     * @param announceEdge function to call at each edge
+     */
+    announceEdgesInFace(announceEdge) {
+        let node = this;
+        do {
+            announceEdge(node);
+            node = node.faceSuccessor;
+        } while (node !== this);
+    }
+    /**
+     * Announce edges in the super face loop, starting with the instance.
+     * * A super face admits a `faceSuccessor` traversal, where the next edge at the far vertex is the first one lacking `skipMask` in a `vertexPredecessor` traversal.
+     * @param skipMask mask on edges to skip.
+     * @param announceEdge function to call at each edge that is not skipped.
+     * @param announceSkipped optional function to call at each edge that is skipped.
+     * @return whether a super face was found. Specifically, if a vertex loop has all edges with `skipMask` set, the return value is `false`.
+     */
+    announceEdgesInSuperFace(skipMask, announceEdge, announceSkipped) {
+        const maxIter = 1000; // safeguard against infinite loops
+        let iter = 0;
+        const findNextNodeAroundVertex = (he) => {
+            let vNode = he;
+            do {
+                if (!vNode.isMaskSet(skipMask))
+                    return vNode;
+                announceSkipped?.(vNode);
+                vNode = vNode.vertexPredecessor;
+            } while (vNode !== he);
+            return undefined;
+        };
+        const firstNode = findNextNodeAroundVertex(this);
+        if (!firstNode)
+            return false;
+        let node = firstNode;
+        do {
+            announceEdge(node);
+            node = findNextNodeAroundVertex(node.faceSuccessor);
+            if (!node)
+                return false;
+        } while (node !== firstNode && iter++ < maxIter);
+        return iter < maxIter;
+    }
     /**
      * Evaluate `f(node)` at each node around `this` node's face loop. Collect the function values.
      * @param f optional node function. If `undefined`, collect the nodes themselves.
@@ -1184,16 +1280,37 @@ class HalfEdge {
             this.y = source.y;
             this.z = source.z;
         }
-        if (copyVertexData) {
+        if (copyVertexData)
             this.i = source.i;
-        }
-        if (copyEdgeData) {
+        if (copyEdgeData)
             HalfEdge.transferEdgeProperties(source, this);
-            this.edgeTag = source.edgeTag;
-        }
-        if (copyFaceData) {
+        if (copyFaceData)
             this.faceTag = source.faceTag;
+    }
+    /**
+     * Is the instance's face loop a split-washer type face?
+     * * A split-washer face contains at least one bridge edge.
+     * * A bridge edge and its edge mate have the same `bridgeMask` and live in the same face loop.
+     * * By connecting hole/outer loops with bridge edges, a split-washer face can represent a parity region.
+     * @param bridgeMask mask preset on bridge edges (default is [[HalfEdgeMask.BRIDGE_EDGE]]).
+     */
+    isSplitWasherFace(bridgeMask = HalfEdgeMask.BRIDGE_EDGE) {
+        if (!this.countMaskAroundFace(HalfEdgeMask.BRIDGE_EDGE))
+            return false;
+        const bridges = new core_bentley_1.OrderedSet((a, b) => a.id - b.id);
+        let node = this;
+        do {
+            if (node.isMaskSet(bridgeMask))
+                bridges.add(node);
+            node = node.faceSuccessor;
+        } while (node !== this);
+        if (bridges.size === 0)
+            return false;
+        for (const bridge of bridges) {
+            if (!bridges.has(bridge.edgeMate) || !bridge.edgeMate.isMaskSet(bridgeMask))
+                return false;
         }
+        return true;
     }
 }
 exports.HalfEdge = HalfEdge;
@@ -1214,7 +1331,7 @@ class HalfEdgeGraph {
     }
     /**
      * Ask for a mask (from the graph's free pool) for caller's use.
-     * * Optionally clear the mask throughout the graph.
+     * @param clearInAllHalfEdges optionally clear the mask throughout the graph (default `true`).
      */
     grabMask(clearInAllHalfEdges = true) {
         const mask = this._maskManager.grabMask();