@itwin/core-geometry 5.14.0-dev.5 → 5.14.0-dev.7

package/lib/cjs/curve/GeometryQuery.js.map

@@ -1 +1 @@
-{"version":3,"file":"GeometryQuery.js","sourceRoot":"","sources":["../../../src/curve/GeometryQuery.ts"],"names":[],"mappings":";;;AASA,+CAA8C;AAC9C,uDAAoD;AAsCpD;;;;;GAKG;AACH,MAAsB,aAAa;IAGjC,yDAAyD;IAClD,KAAK,CAAC,SAAqB,EAAE,MAAgB;QAClD,IAAI,MAAM;YACR,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,eAAO,CAAC,UAAU,EAAE,CAAC;QACrD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IASD,4CAA4C;IACrC,mBAAmB,CAAC,EAAU,EAAE,KAAa,GAAG,EAAE,KAAa,GAAG;QACvE,OAAO,IAAI,CAAC,mBAAmB,CAAC,qBAAS,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9E,CAAC;IAKD;;;OAGG;IACH,IAAW,QAAQ;QACjB,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;;;OAMG;IACI,aAAa,CAAC,KAAoB;QACvC,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC;YACjC,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;gBAC3B,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM;oBACvC,OAAO,KAAK,CAAC;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBAC3C,OAAO,KAAK,CAAC;gBACjB,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC;iBAAM,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC,CAAC,uGAAuG;gBAC1I,OAAO,KAAK,CAAC,CAAC,oBAAoB;YACpC,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC,CAAC,oCAAoC;YACnD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,cAAc,CAAC,CAA4B,EAAE,CAA4B;QACrF,IAAI,CAAC,YAAY,aAAa,IAAI,CAAC,YAAY,aAAa;YAC1D,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC;YACxC,OAAO,IAAI,CAAC;QACd,OAAO,KAAK,CAAC;IACf,CAAC;CAWF;AArFD,sCAqFC","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 Curve\r\n */\r\nimport { BSpline2dNd } from \"../bspline/BSplineSurface\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Polyface } from \"../polyface/Polyface\";\r\nimport { SolidPrimitive } from \"../solid/SolidPrimitive\";\r\nimport { CoordinateXYZ } from \"./CoordinateXYZ\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { PointString3d } from \"./PointString3d\";\r\n\r\n/**\r\n * Describes the category of a [[GeometryQuery]], enabling type-switching like:\r\n * ```ts\r\n *   function processGeometryQuery(q: GeometryQuery): void {\r\n *     if (\"solid\" === q.geometryCategory)\r\n *       alert(\"Solid type = \" + q.solidPrimitiveType); // compiler knows q is an instance of SolidPrimitive\r\n *    // ...etc...\r\n * ```\r\n *\r\n * Each string maps to a particular subclass of [[GeometryQuery]]:\r\n *  - \"polyface\" => [[Polyface]]\r\n *  - \"curvePrimitive\" => [[CurvePrimitive]]\r\n *  - \"curveCollection\" => [[CurveCollection]]\r\n *  - \"solid\" => [[SolidPrimitive]]\r\n *  - \"point\" => [[CoordinateXYZ]]\r\n *  - \"pointCollection\" => [[PointString3d]]\r\n *  - \"bsurf\" => [[BSpline2dNd]] (which is an intermediate class shared by [[BSplineSurface3d]] and [[BSplineSurface3dH]])\r\n *\r\n *  @see [[AnyGeometryQuery]]\r\n * @public\r\n */\r\nexport type GeometryQueryCategory = \"polyface\" | \"curvePrimitive\" | \"curveCollection\" | \"solid\" | \"point\" | \"pointCollection\" | \"bsurf\";\r\n\r\n/**\r\n * Union type for subclasses of [[GeometryQuery]]. Specific subclasses can be discriminated at compile- or run-time\r\n * using [[GeometryQuery.geometryCategory]].\r\n * @public\r\n */\r\nexport type AnyGeometryQuery = Polyface | CurvePrimitive | CurveCollection | SolidPrimitive | CoordinateXYZ | PointString3d | BSpline2dNd;\r\n\r\n/**\r\n * Queries to be supported by Curve, Surface, and Solid objects.\r\n * * `GeometryQuery` is an abstract base class with (abstract) methods for querying curve, solid primitive, mesh,\r\n * and bspline surfaces.\r\n * @public\r\n */\r\nexport abstract class GeometryQuery {\r\n  /** Type discriminator. */\r\n  public abstract readonly geometryCategory: GeometryQueryCategory;\r\n  /** Return the range of the entire GeometryQuery tree. */\r\n  public range(transform?: Transform, result?: Range3d): Range3d {\r\n    if (result)\r\n      result.setNull();\r\n    const range = result ? result : Range3d.createNull();\r\n    this.extendRange(range, transform);\r\n    return range;\r\n  }\r\n  /** Extend `rangeToExtend` by the range of this geometry multiplied by the `transform`. */\r\n  public abstract extendRange(rangeToExtend: Range3d, transform?: Transform): void;\r\n  /**\r\n   * Attempt to transform in place.\r\n   * * LineSegment3d, Arc3d, LineString3d, BsplineCurve3d always succeed.\r\n   * * Some geometry types may fail if scaling is non-uniform.\r\n   */\r\n  public abstract tryTransformInPlace(transform: Transform): boolean;\r\n  /** Try to move the geometry by dx,dy,dz. */\r\n  public tryTranslateInPlace(dx: number, dy: number = 0.0, dz: number = 0.0): boolean {\r\n    return this.tryTransformInPlace(Transform.createTranslationXYZ(dx, dy, dz));\r\n  }\r\n  /** Return a transformed clone. */\r\n  public abstract cloneTransformed(transform: Transform): GeometryQuery | undefined;\r\n  /** Return a clone */\r\n  public abstract clone(): GeometryQuery | undefined;\r\n  /**\r\n   * Return GeometryQuery children for recursive queries.\r\n   * * leaf classes do not need to implement.\r\n   */\r\n  public get children(): GeometryQuery[] | undefined {\r\n    return undefined;\r\n  }\r\n  /** Test `if (other instanceof this.Type)`. REQUIRED IN ALL CONCRETE CLASSES. */\r\n  public abstract isSameGeometryClass(other: GeometryQuery): boolean;\r\n  /**\r\n   * Test for exact structure and nearly identical geometry.\r\n   * *  Leaf classes must implement.\r\n   * *  Base class implementation recurses through children.\r\n   * *  Base implementation is complete for classes with children and no properties.\r\n   * *  Classes with both children and properties must implement for properties, call super for children.\r\n   */\r\n  public isAlmostEqual(other: GeometryQuery): boolean {\r\n    if (this.isSameGeometryClass(other)) {\r\n      const childrenA = this.children;\r\n      const childrenB = other.children;\r\n      if (childrenA && childrenB) {\r\n        if (childrenA.length !== childrenB.length)\r\n          return false;\r\n        for (let i = 0; i < childrenA.length; i++) {\r\n          if (!childrenA[i].isAlmostEqual(childrenB[i]))\r\n            return false;\r\n        }\r\n        return true;\r\n      } else if (childrenA || childrenB) { // CurveCollections start with empty arrays for children so these null pointer cases are never reached.\r\n        return false; // plainly different\r\n      } else {\r\n        return true; // both children null; call it equal\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Apply instance method [[isAlmostEqual]] if both are defined.\r\n   * * Both undefined returns true.\r\n   * * Single defined returns false.\r\n   */\r\n  public static areAlmostEqual(a: GeometryQuery | undefined, b: GeometryQuery | undefined): boolean {\r\n    if (a instanceof GeometryQuery && b instanceof GeometryQuery)\r\n      return a.isAlmostEqual(b);\r\n    if ((a === undefined) && (b === undefined))\r\n      return true;\r\n    return false;\r\n  }\r\n  /**\r\n   * Double Dispatch call pattern.\r\n   * * User code implements a `GeometryHandler` with specialized methods to handle `LineSegment3d`, `Arc3d`, etc as\r\n   * relevant to its use case.\r\n   * * Each such `GeometryQuery` class implements this method as a one-line method containing the appropriate call\r\n   * such as `handler.handleLineSegment3d())`\r\n   * * This allows each type-specific method to be called without a switch or `instanceof` test.\r\n   * @param handler handler to be called by the particular geometry class\r\n   */\r\n  public abstract dispatchToGeometryHandler(handler: GeometryHandler): any;\r\n}\r\n"]}
+{"version":3,"file":"GeometryQuery.js","sourceRoot":"","sources":["../../../src/curve/GeometryQuery.ts"],"names":[],"mappings":";;;AAQA,0CAAuC;AAEvC,+CAA8C;AAC9C,uDAAoD;AAqDpD;;;;;GAKG;AACH,MAAsB,aAAa;IAGjC,yDAAyD;IAClD,KAAK,CAAC,SAAqB,EAAE,MAAgB;QAClD,IAAI,MAAM;YACR,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,eAAO,CAAC,UAAU,EAAE,CAAC;QACrD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IASD,4CAA4C;IACrC,mBAAmB,CAAC,EAAU,EAAE,KAAa,GAAG,EAAE,KAAa,GAAG;QACvE,OAAO,IAAI,CAAC,mBAAmB,CAAC,qBAAS,CAAC,oBAAoB,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9E,CAAC;IAKD;;;OAGG;IACH,IAAW,QAAQ;QACjB,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;;;OAMG;IACI,aAAa,CAAC,KAAoB;QACvC,IAAI,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC;YACpC,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;YAChC,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC;YACjC,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC;gBAC3B,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM;oBACvC,OAAO,KAAK,CAAC;gBACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;wBAC3C,OAAO,KAAK,CAAC;gBACjB,CAAC;gBACD,OAAO,IAAI,CAAC;YACd,CAAC;iBAAM,IAAI,SAAS,IAAI,SAAS,EAAE,CAAC,CAAC,uGAAuG;gBAC1I,OAAO,KAAK,CAAC,CAAC,oBAAoB;YACpC,CAAC;iBAAM,CAAC;gBACN,OAAO,IAAI,CAAC,CAAC,oCAAoC;YACnD,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,cAAc,CAAC,CAA4B,EAAE,CAA4B;QACrF,IAAI,CAAC,YAAY,aAAa,IAAI,CAAC,YAAY,aAAa;YAC1D,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC;YACxC,OAAO,IAAI,CAAC;QACd,OAAO,KAAK,CAAC;IACf,CAAC;IAYD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,sBAAsB,CAAC,IAAqC,EAAE,OAAgC;QAC1G,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,iBAAiB,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,CAAC;QACpF,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,gBAAgB,IAAI,mBAAQ,CAAC,0BAA0B,CAAC,CAAC;QAC1F,MAAM,SAAS,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACvC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAgB,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;QAClH,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QACpG,OAAO,MAAM,GAAG,MAAM,GAAG,QAAQ,CAAC;IACpC,CAAC;IAED;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,yBAAyB,CAAC,IAAqC,EAAE,iBAAyB,EAAE,OAAgC;QACxI,IAAI,iBAAiB,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,SAAS,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;YACvC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAgB,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC,CAAC;YAClH,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;gBACtB,MAAM,QAAQ,GAAG,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;gBAC7E,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;oBACjB,qGAAqG;oBACrG,gGAAgG;oBAChG,MAAM,SAAS,GAAG,EAAE,CAAC,CAAC,qEAAqE;oBAC3F,MAAM,oBAAoB,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC;oBAClF,IAAI,oBAAoB,GAAG,SAAS;wBAClC,iBAAiB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,oBAAoB,GAAG,SAAS,CAAC,CAAC;gBACxE,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,iBAAiB,CAAC;IAC3B,CAAC;CACF;AA1ID,sCA0IC","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 Curve\r\n */\r\nimport { BSpline2dNd } from \"../bspline/BSplineSurface\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Polyface } from \"../polyface/Polyface\";\r\nimport { SolidPrimitive } from \"../solid/SolidPrimitive\";\r\nimport { CoordinateXYZ } from \"./CoordinateXYZ\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { PointString3d } from \"./PointString3d\";\r\n\r\n/**\r\n * Describes the category of a [[GeometryQuery]], enabling type-switching like:\r\n * ```ts\r\n *   function processGeometryQuery(q: GeometryQuery): void {\r\n *     if (\"solid\" === q.geometryCategory)\r\n *       alert(\"Solid type = \" + q.solidPrimitiveType); // compiler knows q is an instance of SolidPrimitive\r\n *    // ...etc...\r\n * ```\r\n *\r\n * Each string maps to a particular subclass of [[GeometryQuery]]:\r\n *  - \"polyface\" => [[Polyface]]\r\n *  - \"curvePrimitive\" => [[CurvePrimitive]]\r\n *  - \"curveCollection\" => [[CurveCollection]]\r\n *  - \"solid\" => [[SolidPrimitive]]\r\n *  - \"point\" => [[CoordinateXYZ]]\r\n *  - \"pointCollection\" => [[PointString3d]]\r\n *  - \"bsurf\" => [[BSpline2dNd]] (which is an intermediate class shared by [[BSplineSurface3d]] and [[BSplineSurface3dH]])\r\n *\r\n *  @see [[AnyGeometryQuery]]\r\n * @public\r\n */\r\nexport type GeometryQueryCategory = \"polyface\" | \"curvePrimitive\" | \"curveCollection\" | \"solid\" | \"point\" | \"pointCollection\" | \"bsurf\";\r\n\r\n/**\r\n * Union type for subclasses of [[GeometryQuery]]. Specific subclasses can be discriminated at compile- or run-time\r\n * using [[GeometryQuery.geometryCategory]].\r\n * @public\r\n */\r\nexport type AnyGeometryQuery = Polyface | CurvePrimitive | CurveCollection | SolidPrimitive | CoordinateXYZ | PointString3d | BSpline2dNd;\r\n\r\n/**\r\n * Options bundle for [[GeometryQuery.computeScaledTolerance]] and [[GeometryQuery.scaleToleranceForGeometry]].\r\n * @public\r\n */\r\nexport interface ScaledToleranceOptions {\r\n  /** Optional transform to apply to geometry before computing its size. */\r\n  transform?: Transform;\r\n  /** Relative tolerance by which to scale the computed geometry size. Default is [[Geometry.smallMetricDistance]]. */\r\n  relativeTolerance?: number;\r\n  /** Smallest tolerance to return. Default is [[Geometry.smallMetricDistanceSquared]]. */\r\n  minimumTolerance?: number;\r\n  /** Whether to ignore z-coordinates when computing the geometry size. */\r\n  xyOnly?: boolean;\r\n}\r\n\r\n/**\r\n * Queries to be supported by Curve, Surface, and Solid objects.\r\n * * `GeometryQuery` is an abstract base class with (abstract) methods for querying curve, solid primitive, mesh,\r\n * and bspline surfaces.\r\n * @public\r\n */\r\nexport abstract class GeometryQuery {\r\n  /** Type discriminator. */\r\n  public abstract readonly geometryCategory: GeometryQueryCategory;\r\n  /** Return the range of the entire GeometryQuery tree. */\r\n  public range(transform?: Transform, result?: Range3d): Range3d {\r\n    if (result)\r\n      result.setNull();\r\n    const range = result ? result : Range3d.createNull();\r\n    this.extendRange(range, transform);\r\n    return range;\r\n  }\r\n  /** Extend `rangeToExtend` by the range of this geometry multiplied by the `transform`. */\r\n  public abstract extendRange(rangeToExtend: Range3d, transform?: Transform): void;\r\n  /**\r\n   * Attempt to transform in place.\r\n   * * LineSegment3d, Arc3d, LineString3d, BsplineCurve3d always succeed.\r\n   * * Some geometry types may fail if scaling is non-uniform.\r\n   */\r\n  public abstract tryTransformInPlace(transform: Transform): boolean;\r\n  /** Try to move the geometry by dx,dy,dz. */\r\n  public tryTranslateInPlace(dx: number, dy: number = 0.0, dz: number = 0.0): boolean {\r\n    return this.tryTransformInPlace(Transform.createTranslationXYZ(dx, dy, dz));\r\n  }\r\n  /** Return a transformed clone. */\r\n  public abstract cloneTransformed(transform: Transform): GeometryQuery | undefined;\r\n  /** Return a clone */\r\n  public abstract clone(): GeometryQuery | undefined;\r\n  /**\r\n   * Return GeometryQuery children for recursive queries.\r\n   * * leaf classes do not need to implement.\r\n   */\r\n  public get children(): GeometryQuery[] | undefined {\r\n    return undefined;\r\n  }\r\n  /** Test `if (other instanceof this.Type)`. REQUIRED IN ALL CONCRETE CLASSES. */\r\n  public abstract isSameGeometryClass(other: GeometryQuery): boolean;\r\n  /**\r\n   * Test for exact structure and nearly identical geometry.\r\n   * *  Leaf classes must implement.\r\n   * *  Base class implementation recurses through children.\r\n   * *  Base implementation is complete for classes with children and no properties.\r\n   * *  Classes with both children and properties must implement for properties, call super for children.\r\n   */\r\n  public isAlmostEqual(other: GeometryQuery): boolean {\r\n    if (this.isSameGeometryClass(other)) {\r\n      const childrenA = this.children;\r\n      const childrenB = other.children;\r\n      if (childrenA && childrenB) {\r\n        if (childrenA.length !== childrenB.length)\r\n          return false;\r\n        for (let i = 0; i < childrenA.length; i++) {\r\n          if (!childrenA[i].isAlmostEqual(childrenB[i]))\r\n            return false;\r\n        }\r\n        return true;\r\n      } else if (childrenA || childrenB) { // CurveCollections start with empty arrays for children so these null pointer cases are never reached.\r\n        return false; // plainly different\r\n      } else {\r\n        return true; // both children null; call it equal\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * Apply instance method [[isAlmostEqual]] if both are defined.\r\n   * * Both undefined returns true.\r\n   * * Single defined returns false.\r\n   */\r\n  public static areAlmostEqual(a: GeometryQuery | undefined, b: GeometryQuery | undefined): boolean {\r\n    if (a instanceof GeometryQuery && b instanceof GeometryQuery)\r\n      return a.isAlmostEqual(b);\r\n    if ((a === undefined) && (b === undefined))\r\n      return true;\r\n    return false;\r\n  }\r\n  /**\r\n   * Double Dispatch call pattern.\r\n   * * User code implements a `GeometryHandler` with specialized methods to handle `LineSegment3d`, `Arc3d`, etc as\r\n   * relevant to its use case.\r\n   * * Each such `GeometryQuery` class implements this method as a one-line method containing the appropriate call\r\n   * such as `handler.handleLineSegment3d())`\r\n   * * This allows each type-specific method to be called without a switch or `instanceof` test.\r\n   * @param handler handler to be called by the particular geometry class\r\n   */\r\n  public abstract dispatchToGeometryHandler(handler: GeometryHandler): any;\r\n\r\n  /**\r\n   * Compute a distance tolerance appropriate for comparing the coordinates of `geom`.\r\n   * * The formula is `absTol = minTol + relTol * geomSize`, where `geomSize` is the largest absolute coordinate of\r\n   * the geometry range.\r\n   * * Scaling tolerances by geometry size helps account for the decreased floating point resolution between large\r\n   * coordinates. While using such scaled tolerances can enable more tolerance-sensitive constructions to succeed on\r\n   * far-flung geometries, on extremely small geometries at extremely large coordinate magnitudes, geometric\r\n   * constructions are generally more accurate when applied to the geometry temporarily translated to the origin.\r\n   * @param geom geometry to measure\r\n   * @param options bundle of options\r\n   * @returns the computed absolute tolerance\r\n   * @see [[scaleToleranceForGeometry]]\r\n   */\r\n  public static computeScaledTolerance(geom: GeometryQuery | GeometryQuery[], options?: ScaledToleranceOptions): number {\r\n    const relTol = Math.abs(options?.relativeTolerance ?? Geometry.smallMetricDistance);\r\n    const minTol = Math.abs(options?.minimumTolerance ?? Geometry.smallMetricDistanceSquared);\r\n    const geomRange = Range3d.createNull();\r\n    (Array.isArray(geom) ? geom : [geom]).forEach((g: GeometryQuery) => g.extendRange(geomRange, options?.transform));\r\n    const geomSize = geomRange.isNull ? 0 : options?.xyOnly ? geomRange.maxAbsXY() : geomRange.maxAbs();\r\n    return minTol + relTol * geomSize;\r\n  }\r\n\r\n  /**\r\n   * Scale the given distance tolerance as appropriate for comparing the coordinates of `geom`.\r\n   * * Scaling tolerances by geometry size helps account for the decreased floating point resolution between large\r\n   * coordinates. While using such scaled tolerances can enable more tolerance-sensitive constructions to succeed on\r\n   * far-flung geometries, on extremely small geometries at extremely large coordinate magnitudes, geometric\r\n   * constructions are generally more accurate when applied to the geometry temporarily translated to the origin.\r\n   * @param geom geometry to measure\r\n   * @param distanceTolerance positive input distance tolerance to examine\r\n   * @param options bundle of options (`minimumTolerance` and `relativeTolerance` are ignored)\r\n   * @return a distance tolerance >= `distanceTolerance`\r\n   * @see [[computeScaledTolerance]]\r\n   */\r\n  public static scaleToleranceForGeometry(geom: GeometryQuery | GeometryQuery[], distanceTolerance: number, options?: ScaledToleranceOptions): number {\r\n    if (distanceTolerance > 0) {\r\n      const geomRange = Range3d.createNull();\r\n      (Array.isArray(geom) ? geom : [geom]).forEach((g: GeometryQuery) => g.extendRange(geomRange, options?.transform));\r\n      if (!geomRange.isNull) {\r\n        const geomSize = options?.xyOnly ? geomRange.maxAbsXY() : geomRange.maxAbs();\r\n        if (geomSize > 0) {\r\n          // HEURISTIC: truncate the fractional part of a coordinate's base-10 significand to maxDigits digits.\r\n          // Adding the tolerance to this number should change the significand; otherwise, it's too small.\r\n          const maxDigits = 10; // comfortably far from IEEE double's 15 guaranteed fractional digits\r\n          const requiredDigitsForTol = Math.floor(Math.log10(geomSize / distanceTolerance));\r\n          if (requiredDigitsForTol > maxDigits)\r\n            distanceTolerance *= Math.pow(10, requiredDigitsForTol - maxDigits);\r\n        }\r\n      }\r\n    }\r\n    return distanceTolerance;\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts

@@ -3,6 +3,39 @@ import { CurveLocationDetailPair } from "../CurveLocationDetail";
 import { CurvePrimitive } from "../CurvePrimitive";
 import { Loop, SignedLoops } from "../Loop";
 import { ParityRegion } from "../ParityRegion";
+/** @packageDocumentation
+ * @module Curve
+ */
+/**
+ * Options bundle for [[PlanarSubdivision.createLoopInFace]] and [[PlanarSubdivision.createLoopOrParityRegionInFace]].
+ * @internal
+ */
+export interface CreateRegionInFaceOptions {
+    /**
+     * Optional callback invoked on each `edge` before its `curve` is added to `loop`.
+     * * Note that if a [[ParityRegion]] is being constructed, `curve` and `loop` may subsequently be reversed.
+     */
+    announceEdge?: (edge: HalfEdge, curve: CurvePrimitive, loop: Loop) => void;
+    /**
+     * Whether to consolidate adjacent curves in an output [[Loop]]. Default value is `false`.
+     * * If `announce` is defined, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
+     */
+    compress?: boolean;
+    /** Absolute xy-distance for confirming a returned Loop is closed. Default value is [[Geometry.smallMetricDistance]]. */
+    closureTol?: number;
+    /**
+     * Mask preset on bridge edges. Default value is `HalfEdgeMask.BRIDGE_EDGE`.
+     * * This mask is used to distinguish a split-washer type face, which can result in a [[ParityRegion]].
+     */
+    bridgeMask?: HalfEdgeMask;
+    /** Mask to use for visiting edges when creating a [[ParityRegion]] from a split-washer type face. Default value is `HalfEdgeMask.VISITED`. */
+    visitMask?: HalfEdgeMask;
+    /**
+     * Optional z-coordinate for the result region.
+     * * If undefined, graph z-coordinates are used, but this may result in a non-planar region if the graph is not planar!
+     */
+    z?: number;
+}
 /**
  * @internal
  */
@@ -14,7 +47,7 @@ export declare class PlanarSubdivision {
      * @param allPairs array of curve-curve xy-intersections
      * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
-    static assembleHalfEdgeGraph(primitives: CurvePrimitive[], allPairs: CurveLocationDetailPair[], mergeTolerance?: number): HalfEdgeGraph;
+    static assembleHalfEdgeGraph(primitives: CurvePrimitive[], allPairs: CurveLocationDetailPair[], mergeTolerance?: number, radianTolerance?: number): HalfEdgeGraph;
     /**
      * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.
      * * Different metrics are employed for expedience.
@@ -50,7 +83,7 @@ export declare class PlanarSubdivision {
      * @param options bundle of options.
      * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.
      */
-    static createLoopInFace(face: HalfEdge | HalfEdge[], options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | undefined;
+    static createLoopInFace(face: HalfEdge | HalfEdge[], options?: CreateRegionInFaceOptions): Loop | undefined;
     /**
      * Create a [[Loop]] or [[ParityRegion]] for the given face.
      * * A ParityRegion is created for a split-washer type face by removing bridge edges.
@@ -58,43 +91,11 @@ export declare class PlanarSubdivision {
      * @param options bundle of options.
      * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.
      */
-    static createLoopOrParityRegionInFace(face: HalfEdge, options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | ParityRegion | undefined;
+    static createLoopOrParityRegionInFace(face: HalfEdge, options?: CreateRegionInFaceOptions): Loop | ParityRegion | undefined;
     /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */
     private static isNullFace;
     /** Look across edge mates (possibly several) for a non-null mate face. */
     private static getNonNullEdgeMate;
     static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, closureTol?: number, areaTol?: number): SignedLoops[];
 }
-/**
- * @internal
-*/
-export declare namespace PlanarSubdivision {
-    /** Options bundle for [[PlanarSubdivision.createLoopInFace]] and [[PlanarSubdivision.createLoopOrParityRegionInFace]]. */
-    interface CreateRegionInFaceOptions {
-        /**
-         * Optional callback invoked on each `edge` before its `curve` is added to `loop`.
-         * * Note that if a [[ParityRegion]] is being constructed, `curve` and `loop` may subsequently be reversed.
-         */
-        announceEdge?: (edge: HalfEdge, curve: CurvePrimitive, loop: Loop) => void;
-        /**
-         * Whether to consolidate adjacent curves in an output [[Loop]]. Default value is `false`.
-         * * If `announce` is defined, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
-         */
-        compress?: boolean;
-        /** Absolute xy-distance for confirming a returned Loop is closed. Default value is [[Geometry.smallMetricDistance]]. */
-        closureTol?: number;
-        /**
-         * Mask preset on bridge edges. Default value is `HalfEdgeMask.BRIDGE_EDGE`.
-         * * This mask is used to distinguish a split-washer type face, which can result in a [[ParityRegion]].
-         */
-        bridgeMask?: HalfEdgeMask;
-        /** Mask to use for visiting edges when creating a [[ParityRegion]] from a split-washer type face. Default value is `HalfEdgeMask.VISITED`. */
-        visitMask?: HalfEdgeMask;
-        /**
-         * Optional z-coordinate for the result region.
-         * * If undefined, graph z-coordinates are used, but this may result in a non-planar region if the graph is not planar!
-         */
-        z?: number;
-    }
-}
 //# sourceMappingURL=PlanarSubdivision.d.ts.map

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAI7E,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAInD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAyE/C;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;;;;OAMG;WACW,qBAAqB,CACjC,UAAU,EAAE,cAAc,EAAE,EAC5B,QAAQ,EAAE,uBAAuB,EAAE,EACnC,cAAc,GAAE,MAAqC,GACpD,aAAa;IAoDhB;;;MAGE;IACF,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAW/B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IA6B1B;;;;;;OAMG;WACW,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,GAAE,MAAgB,EAAE,YAAY,CAAC,EAAE,OAAO,GAAG,MAAM;IAe7H,sDAAsD;IACtD,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAUtC,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAYhC;;;;;OAKG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,OAAO,CAAC,EAAE,iBAAiB,CAAC,yBAAyB,GAAG,IAAI,GAAG,SAAS;IAsBpI;;;;;;OAMG;WACW,8BAA8B,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,iBAAiB,CAAC,yBAAyB,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAqCpJ,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,UAAU;IAWzB,0EAA0E;IAC1E,OAAO,CAAC,MAAM,CAAC,kBAAkB;WAWnB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,UAAU,GAAE,MAAqC,EAAE,OAAO,GAAE,MAAgB,GAAG,WAAW,EAAE;CAkCtK;AAED;;EAEE;AACF,yBAAiB,iBAAiB,CAAC;IACjC,0HAA0H;IAC1H,UAAiB,yBAAyB;QACxC;;;WAGG;QACH,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC;QAC3E;;;WAGG;QACH,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,wHAAwH;QACxH,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB;;;WAGG;QACH,UAAU,CAAC,EAAE,YAAY,CAAC;QAC1B,8IAA8I;QAC9I,SAAS,CAAC,EAAE,YAAY,CAAC;QACzB;;;WAGG;QACH,CAAC,CAAC,EAAE,MAAM,CAAC;KACZ;CACF"}
+{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAI7E,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAInD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAI/C;;GAEG;AAEH;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACxC;;;OAGG;IACH,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC;IAC3E;;;OAGG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,wHAAwH;IACxH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;OAGG;IACH,UAAU,CAAC,EAAE,YAAY,CAAC;IAC1B,8IAA8I;IAC9I,SAAS,CAAC,EAAE,YAAY,CAAC;IACzB;;;OAGG;IACH,CAAC,CAAC,EAAE,MAAM,CAAC;CACZ;AAsED;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;;;;OAMG;WACW,qBAAqB,CACjC,UAAU,EAAE,cAAc,EAAE,EAC5B,QAAQ,EAAE,uBAAuB,EAAE,EACnC,cAAc,GAAE,MAAqC,EACrD,eAAe,GAAE,MAAmC,GACnD,aAAa;IAoDhB;;;MAGE;IACF,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAW/B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IA6B1B;;;;;;OAMG;WACW,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,GAAE,MAAgB,EAAE,YAAY,CAAC,EAAE,OAAO,GAAG,MAAM;IAe7H,sDAAsD;IACtD,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAUtC,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAYhC;;;;;OAKG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,OAAO,CAAC,EAAE,yBAAyB,GAAG,IAAI,GAAG,SAAS;IAsBlH;;;;;;OAMG;WACW,8BAA8B,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,yBAAyB,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAqClI,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,UAAU;IAWzB,0EAA0E;IAC1E,OAAO,CAAC,MAAM,CAAC,kBAAkB;WAWnB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,UAAU,GAAE,MAAqC,EAAE,OAAO,GAAE,MAAgB,GAAG,WAAW,EAAE;CAkCtK"}

package/lib/cjs/curve/Query/PlanarSubdivision.js

@@ -19,8 +19,8 @@ const Loop_1 = require("../Loop");
 const ParityRegion_1 = require("../ParityRegion");
 const RegionOps_1 = require("../RegionOps");
 const RegionOpsClassificationSweeps_1 = require("../RegionOpsClassificationSweeps");
-/** @packageDocumentation
- * @module Curve
+/**
+ * @internal
  */
 class MapCurvePrimitiveToCurveLocationDetailPairArray {
     primitiveToPair = new Map();
@@ -90,7 +90,7 @@ class PlanarSubdivision {
      * @param allPairs array of curve-curve xy-intersections
      * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
-    static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
+    static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = Geometry_1.Geometry.smallMetricDistance, radianTolerance = Geometry_1.Geometry.smallAngleRadians) {
         // map from key CurvePrimitive to CurveLocationDetailPair
         const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();
         for (const pair of allPairs)
@@ -138,7 +138,7 @@ class PlanarSubdivision {
             this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);
         }
         // every edge got its sortAngle defined by addHalfEdge
-        Merging_1.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle ?? 0, mergeTolerance);
+        Merging_1.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle ?? 0, mergeTolerance, radianTolerance);
         return graph;
     }
     /**

package/lib/cjs/curve/Query/PlanarSubdivision.js.map

@@ -1 +1 @@
-{"version":3,"file":"PlanarSubdivision.js","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,sDAA6C;AAC7C,6CAA0C;AAE1C,0DAAuD;AACvD,gDAA6E;AAC7E,4EAAyE;AACzE,oDAA4D;AAC5D,oCAAiC;AACjC,gEAAsF;AAGtF,oDAAiD;AACjD,kDAA+C;AAC/C,kCAAgE;AAChE,kDAA+C;AAC/C,4CAAyC;AACzC,oFAAwF;AAExF;;GAEG;AAEH,MAAM,+CAA+C;IAC5C,eAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;IAC9E,mDAAmD;IAC5C,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,qBAAqB,GAAW,CAAC,CAAC;IACnC,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACM,UAAU,CAAC,IAA6B;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IACD;;;;;OAKG;IACI,qCAAqC,CAC1C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,yBAAyB,GAAG,KAAK,CAAC;YACtC,IAAI,CAAC,YAAY,aAAK;gBACpB,yBAAyB,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;iBAC9C,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,2BAAY,CAAC,EAAE,6FAA6F;gBACnK,yBAAyB,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC;YACtF,IAAI,yBAAyB,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;oBACb,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;oBACH,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAa,iBAAiB;IAC5B;;;;;;OAMG;IACI,MAAM,CAAC,qBAAqB,CACjC,UAA4B,EAC5B,QAAmC,EACnC,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,yDAAyD;QACzD,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC;QAChF,KAAK,MAAM,IAAI,IAAI,QAAQ;YACzB,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,UAAU,CAAC,MAAM,GAAG,iBAAiB,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YAC/D,qEAAqE;YACrE,iBAAiB,CAAC,qCAAqC,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QACtF,CAAC;QACD,sFAAsF;QACtF,MAAM,kBAAkB,GAAG,CAAC,IAA6B,EAAE,KAAqB,EAAU,EAAE;YAC1F,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACxF,CAAC,CAAC;QACF,MAAM,gBAAgB,GAAG,CAAC,IAA6B,EAAE,KAAqB,EAAuB,EAAE;YACrG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACtE,CAAC,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YAChE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,qEAAqE;YACrE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAsC,EAAE,UAAU,EAAE,EAAE;gBACrF,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBAC/C,IAAI,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC/F,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;oBACjG,OAAO;wBACL,GAAG,WAAW;wBACd,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;wBACvD,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;qBACxD,CAAC;gBACJ,CAAC;gBACD,OAAO,CAAC,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC;YACtC,CAAC,EAAE,EAAE,CAAC,CAAC;YACP,0CAA0C;YAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE;gBAC9E,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC/C,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC/C,OAAO,SAAS,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;YACpD,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBAC/C,MAAM,cAAc,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,oEAAoE;gBAC/I,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;YAC7G,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC;QAC3F,CAAC;QACD,sDAAsD;QACtD,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,IAAI,CAAC,EAAE,cAAc,CAAC,CAAC;QACtG,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;MAGE;IACM,MAAM,CAAC,gBAAgB,CAAC,CAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,cAAsB;QAC/I,IAAI,mBAAQ,CAAC,eAAe,CAAC,SAAS,GAAG,SAAS,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACrD,IAAI,EAAE,EAAE,mBAAmB,CAAC,qBAAS,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU;gBACpG,OAAO,EAAE,CAAC,WAAW,EAAE,IAAI,cAAc,CAAC,CAAC,YAAY;QAC3D,CAAC;QACD,OAAO,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,YAAY;IACrE,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,WAAW,CACxB,KAAoB,EACpB,CAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,CAAC,EAAE,CAAC;YACpF,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,YAAY,iDAAiB,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iDAAiB,CAAC,WAAW;gBACzH,QAAQ,CAAC,iBAAiB,CAAC,oBAAY,CAAC,WAAW,CAAC,CAAC;YACvD,MAAM,QAAQ,GAAG,yCAAmB,CAAC,oCAAoC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACnG,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;YAC/B,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC;YAC5B,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;YACxB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;YACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC;YACrB,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,OAAgB,EAAU,EAAE;gBAC/D,MAAM,GAAG,GAAG,CAAC,CAAC,4BAA4B,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC,CAAC;YACF,QAAQ,CAAC,SAAS,GAAG,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACxD,IAAI,CAAC,SAAS,GAAG,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,uCAAuC;IACxF,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,IAAU,EAAE,QAAqB,EAAE,UAAkB,OAAO,EAAE,YAAsB;QAClH,IAAI,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,qBAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;YAC1B,IAAI,GAAG,GAAG,CAAC;QACZ,IAAY,CAAC,+BAA+B,GAAG,IAAI,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC;YACV,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACnC,IAAI,IAAI,GAAG,CAAC;YACf,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEtC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sDAAsD;IAC9C,MAAM,CAAC,uBAAuB,CAAC,IAAc;QACnD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,YAAY,yCAAmB,EAAE,CAAC;YAC/F,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;YAC5B,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;gBACnC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kDAAkD;IAC1C,MAAM,CAAC,iBAAiB,CAAC,IAAc,EAAE,CAAU;QACzD,IAAI,MAAkC,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC;YAC1D,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;YACxE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;YACxE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACrD,IAAI,MAAM,IAAI,CAAC,KAAK,SAAS;gBAC3B,MAAM,CAAC,mBAAmB,CAAC,qBAAS,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9F,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAA2B,EAAE,OAAqD;QAC/G,MAAM,WAAW,GAAG,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,IAAI,KAAK,CAAC,CAAC,+BAA+B;QAC/G,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,CAAC,IAAc,EAAQ,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YACvD,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,EAAE,YAAY,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC3C,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC,CAAC;QACF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;;YAE3B,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACzC,IAAI,WAAW,EAAE,CAAC;YAChB,qBAAS,CAAC,6BAA6B,CAAC,IAAI,EAAE,EAAE,mBAAmB,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/E,CAAC;QACD,IAAI,IAAI,CAAC,uBAAuB,CAAC,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,IAAA,qBAAM,EAAC,GAAG,EAAE,CAAC,KAAK,EAAE,+BAA+B,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,OAAqD;QAChH,IAAI,MAA6B,CAAC;QAClC,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,oBAAY,CAAC,OAAO,CAAC;QAC7D,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,oBAAY,CAAC,WAAW,CAAC;QACnE,IAAI,eAAqC,CAAC;QAC1C,6BAA6B;QAC7B,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACxG,MAAM,KAAK,GAAW,EAAE,CAAC;YACzB,MAAM,SAAS,GAAe,EAAE,CAAC;YACjC,MAAM,WAAW,GAAe,CAAC,eAAe,CAAC,CAAC;YAClD,MAAM,YAAY,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,cAAc,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC;gBAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,MAA4B,CAAC;YACjC,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,QAAQ,GAAG,MAAM,CAAC,kBAAkB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,uBAAuB;gBACtF,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;wBAC/B,SAAS;oBACX,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;oBACrB,IAAI,QAAQ,CAAC,wBAAwB,CAAC,UAAU,EAAE,YAAY,EAAE,cAAc,CAAC,EAAE,CAAC;wBAChF,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;wBACvD,IAAI,IAAI,EAAE,CAAC;4BACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACjB,SAAS;wBACX,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM,GAAG,qBAAS,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,qBAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,CAAC,MAAM,IAAI,CAAC,MAAM,YAAY,WAAI,IAAI,MAAM,YAAY,2BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD,yGAAyG;IACjG,MAAM,CAAC,UAAU,CAAC,EAAY;QACpC,MAAM,eAAe,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,aAAa,KAAK,EAAE,CAAC,CAAC;QAChE,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1E,IAAI,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,eAAe;gBACrD,YAAY,GAAG,IAAI,CAAC,CAAE,8EAA8E;QACxG,CAAC;QACD,OAAO,eAAe,IAAI,CAAC,YAAY,CAAC;IAC1C,CAAC;IACD,0EAA0E;IAClE,MAAM,CAAC,kBAAkB,CAAC,MAAqB,EAAE,CAAW;QAClE,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,oCAAoC,CAAC,KAAoB,EAAE,aAAqB,mBAAQ,CAAC,mBAAmB,EAAE,UAAkB,OAAO;QACnJ,MAAM,CAAC,GAAG,yCAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAClG,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;QACxD,KAAK,MAAM,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,cAAc,GAAgB,EAAE,iBAAiB,EAAE,EAAE,EAAE,iBAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAClG,MAAM,KAAK,GAAyB,EAAE,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC7C,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAY,EAAE,MAAsB,EAAE,KAAW,EAAE,EAAE;oBAClG,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;oBAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;wBACvB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBAC5B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;4BACpB,oGAAoG;4BACpG,MAAM,EAAE,GAAG,IAAI,yBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;4BACvE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;wBACtB,CAAC;6BAAM,IAAI,CAAC,YAAY,yBAAkB,EAAE,CAAC;4BAC3C,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;4BACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BACd,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;wBACvB,CAAC;oBACH,CAAC;gBACH,CAAC,CAAC;gBACF,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC;gBAC3E,IAAI,IAAI;oBACN,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;YACtE,CAAC;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAvSD,8CAuSC","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\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { AnyRegion } from \"../CurveTypes\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { RegionOps } from \"../RegionOps\";\r\nimport { RegionGroupMember, RegionGroupOpType } from \"../RegionOpsClassificationSweeps\";\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nclass MapCurvePrimitiveToCurveLocationDetailPairArray {\r\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\r\n  // index assigned to this primitive (for debugging)\r\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\r\n  private _numIndexedPrimitives: number = 0;\r\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\r\n    if (primitive !== undefined) {\r\n      const index = this.primitiveToIndex.get(primitive);\r\n      if (index === undefined) {\r\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\r\n      }\r\n    }\r\n  }\r\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\r\n    if (primitive) {\r\n      const priorPairs = this.primitiveToPair.get(primitive);\r\n      this.assignPrimitiveIndex(primitive);\r\n      if (!priorPairs) {\r\n        this.primitiveToPair.set(primitive, [pair]);\r\n      } else {\r\n        priorPairs.push(pair);\r\n      }\r\n    }\r\n  }\r\n  public insertPair(pair: CurveLocationDetailPair) {\r\n    const primitiveA = pair.detailA.curve;\r\n    if (primitiveA)\r\n      this.insertPrimitiveToPair(primitiveA, pair);\r\n    const primitiveB = pair.detailB.curve;\r\n    if (primitiveB)\r\n      this.insertPrimitiveToPair(primitiveB, pair);\r\n  }\r\n  /**\r\n   * Split closed missing primitives in half and add new intersection pairs.\r\n   * * When bridge edges aren't included in the primitives array, a closed primitive with no intersections will not be\r\n   * added to the graph because it isn't in the `primitiveToPair` map. By splitting such a missing primitive in two, we\r\n   * introduce two intersections for each half, which allows the primitive to be represented in the map.\r\n   */\r\n  public splitAndAppendMissingClosedPrimitives(\r\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): void {\r\n    for (const p of primitives) {\r\n      let closedCurveSplitCandidate = false;\r\n      if (p instanceof Arc3d)\r\n        closedCurveSplitCandidate = p.sweep.isFullCircle;\r\n      else if (!(p instanceof LineSegment3d) && !(p instanceof LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.\r\n        closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);\r\n      if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {\r\n        const p0 = p.clonePartialCurve(0.0, 0.5);\r\n        const p1 = p.clonePartialCurve(0.5, 1.0);\r\n        if (p0 && p1) {\r\n          this.insertPair(CurveLocationDetailPair.createCapture(\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0),\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0),\r\n          ));\r\n          this.insertPair(CurveLocationDetailPair.createCapture(\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0),\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0),\r\n          ));\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport class PlanarSubdivision {\r\n  /**\r\n   * Create a graph from curves and precomputed intersections.\r\n   * * Z-coordinates are ignored.\r\n   * @param primitives input curves\r\n   * @param allPairs array of curve-curve xy-intersections\r\n   * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].\r\n   */\r\n  public static assembleHalfEdgeGraph(\r\n    primitives: CurvePrimitive[],\r\n    allPairs: CurveLocationDetailPair[],\r\n    mergeTolerance: number = Geometry.smallMetricDistance,\r\n  ): HalfEdgeGraph {\r\n    // map from key CurvePrimitive to CurveLocationDetailPair\r\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();\r\n    for (const pair of allPairs)\r\n      detailByPrimitive.insertPair(pair);\r\n    if (primitives.length > detailByPrimitive.primitiveToPair.size) {\r\n      // otherwise, these single-primitive loops are missing from the graph\r\n      detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance);\r\n    }\r\n    // these helper lambdas assume exactly one of the paired details is on the input curve\r\n    const getFractionOnCurve = (pair: CurveLocationDetailPair, curve: CurvePrimitive): number => {\r\n      return (pair.detailA.curve === curve) ? pair.detailA.fraction : pair.detailB.fraction;\r\n    };\r\n    const getDetailOnCurve = (pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail => {\r\n      return (pair.detailA.curve === curve) ? pair.detailA : pair.detailB;\r\n    };\r\n    const graph = new HalfEdgeGraph();\r\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\r\n      const p = entry[0];\r\n      // convert each interval intersection into two isolated intersections\r\n      const details = entry[1].reduce((accumulator: CurveLocationDetailPair[], detailPair) => {\r\n        const detail = getDetailOnCurve(detailPair, p);\r\n        if (detail.isInterval()) {\r\n          const detail0 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);\r\n          const detail1 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1, detail.point1);\r\n          return [\r\n            ...accumulator,\r\n            CurveLocationDetailPair.createCapture(detail0, detail0),\r\n            CurveLocationDetailPair.createCapture(detail1, detail1),\r\n          ];\r\n        }\r\n        return [...accumulator, detailPair];\r\n      }, []);\r\n      // lexical sort on p intersection fraction\r\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\r\n        const fractionA = getFractionOnCurve(pairA, p);\r\n        const fractionB = getFractionOnCurve(pairB, p);\r\n        return fractionA - fractionB;\r\n      });\r\n      let last = { point: p.startPoint(), fraction: 0.0 };\r\n      for (const detailPair of details) {\r\n        const detail = getDetailOnCurve(detailPair, p);\r\n        const detailFraction = Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later\r\n        last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);\r\n      }\r\n      this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);\r\n    }\r\n    // every edge got its sortAngle defined by addHalfEdge\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle ?? 0, mergeTolerance);\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.\r\n   * * Different metrics are employed for expedience.\r\n  */\r\n  private static isCurveTrivialXY(p: CurvePrimitive, point0: Point3d, fraction0: number, point1: Point3d, fraction1: number, mergeTolerance: number): boolean {\r\n    if (Geometry.isSmallRelative(fraction0 - fraction1))\r\n      return true;\r\n    if (!(p instanceof LineSegment3d)) {\r\n      const p0 = p.clonePartialCurve(fraction0, fraction1);\r\n      if (p0?.tryTransformInPlace(Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0))) // flatten\r\n        return p0.curveLength() <= mergeTolerance; // Euclidean\r\n    }\r\n    return point0.isAlmostEqualXY(point1, mergeTolerance); // Manhattan\r\n  }\r\n\r\n  /**\r\n   * Create a pair of mated half edges referencing a non-trivial interval of a primitive.\r\n   * @param graph containing graph\r\n   * @param p the curve\r\n   * @param point0 start point\r\n   * @param fraction0 starting fraction\r\n   * @param point1 end point\r\n   * @param fraction1 end fraction\r\n   * @param mergeTolerance optional maximum xy-length of a trivial edge\r\n   * @returns end point and fraction\r\n   */\r\n  private static addHalfEdge(\r\n    graph: HalfEdgeGraph,\r\n    p: CurvePrimitive,\r\n    point0: Point3d,\r\n    fraction0: number,\r\n    point1: Point3d,\r\n    fraction1: number,\r\n    mergeTolerance: number = Geometry.smallMetricDistance,\r\n  ): { point: Point3d, fraction: number } {\r\n    if (!this.isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance)) {\r\n      const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);\r\n      if (p.parent && p.parent instanceof RegionGroupMember && p.parent.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\r\n        halfEdge.setMaskAroundEdge(HalfEdgeMask.BRIDGE_EDGE);\r\n      const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);\r\n      const mate = halfEdge.edgeMate;\r\n      halfEdge.edgeTag = detail01;\r\n      halfEdge.sortData = 1.0;\r\n      mate.edgeTag = detail01;\r\n      mate.sortData = -1.0;\r\n      const computeSortAngle = (f: number, reverse: boolean): number => {\r\n        const ray = p.fractionToPointAndDerivative(f);\r\n        const s = reverse ? -1.0 : 1.0;\r\n        return Math.atan2(s * ray.direction.y, s * ray.direction.x);\r\n      };\r\n      halfEdge.sortAngle = computeSortAngle(fraction0, false);\r\n      mate.sortAngle = computeSortAngle(fraction1, true);\r\n    }\r\n    return { point: point1, fraction: fraction1 }; // where the next curve fragment starts\r\n  }\r\n  /**\r\n   * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,\r\n   * or sliver loops.\r\n   * @param areaTol absolute area tolerance for sliver face detection\r\n   * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area\r\n   * @returns the area (forced to zero if within tolerance)\r\n   */\r\n  public static collectSignedLoop(loop: Loop, outLoops: SignedLoops, areaTol: number = 1.0e-10, isSliverFace?: boolean): number {\r\n    let area = isSliverFace ? 0.0 : RegionOps.computeXYArea(loop);\r\n    if (area === undefined)\r\n      area = 0;\r\n    if (Math.abs(area) < areaTol)\r\n      area = 0.0;\r\n    (loop as any).computedAreaInPlanarSubdivision = area;\r\n    if (area > 0)\r\n      outLoops.positiveAreaLoops.push(loop);\r\n    else if (area < 0)\r\n      outLoops.negativeAreaLoops.push(loop);\r\n    else\r\n      outLoops.slivers.push(loop);\r\n    return area;\r\n  }\r\n  /** Extract geometric info from a topological edge. */\r\n  private static extractGeometryFromEdge(edge: HalfEdge): { detail: CurveLocationDetail, reversed: boolean } | undefined {\r\n    if (edge.sortData !== undefined && edge.edgeTag && edge.edgeTag instanceof CurveLocationDetail) {\r\n      const detail = edge.edgeTag;\r\n      if (detail.curve && detail.fraction1 !== undefined) {\r\n        const reversed = edge.sortData < 0;\r\n        return { detail, reversed };\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Create the geometry for a topological edge. */\r\n  private static createCurveInEdge(edge: HalfEdge, z?: number): CurvePrimitive | undefined {\r\n    let result: CurvePrimitive | undefined;\r\n    const info = this.extractGeometryFromEdge(edge);\r\n    if (info && info.detail.curve && info.detail.isInterval()) {\r\n      const f0 = info.reversed ? info.detail.fraction1 : info.detail.fraction;\r\n      const f1 = info.reversed ? info.detail.fraction : info.detail.fraction1;\r\n      result = info.detail.curve.clonePartialCurve(f0, f1);\r\n      if (result && z !== undefined)\r\n        result.tryTransformInPlace(Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, z));\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a [[Loop]] for the given face or super face.\r\n   * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).\r\n   * @param options bundle of options.\r\n   * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.\r\n   */\r\n  public static createLoopInFace(face: HalfEdge | HalfEdge[], options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | undefined {\r\n    const consolidate = options?.announceEdge ? false : options?.compress ?? false; // can't compress if announcing\r\n    const loop = Loop.create();\r\n    const addEdgeCurve = (edge: HalfEdge): void => {\r\n      const curve = this.createCurveInEdge(edge, options?.z);\r\n      if (curve) {\r\n        options?.announceEdge?.(edge, curve, loop);\r\n        loop.tryAddChild(curve);\r\n      }\r\n    };\r\n    if (Array.isArray(face))\r\n      face.forEach(addEdgeCurve);\r\n    else\r\n      face.announceEdgesInFace(addEdgeCurve);\r\n    if (consolidate) {\r\n      RegionOps.consolidateAdjacentPrimitives(loop, { consolidateLoopSeam: true });\r\n    }\r\n    if (loop.isPhysicallyClosedCurve(options?.closureTol, true))\r\n      return loop;\r\n    assert(() => false, \"face is not physically closed\");\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Create a [[Loop]] or [[ParityRegion]] for the given face.\r\n   * * A ParityRegion is created for a split-washer type face by removing bridge edges.\r\n   * @param face a node in the face loop.\r\n   * @param options bundle of options.\r\n   * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.\r\n   */\r\n  public static createLoopOrParityRegionInFace(face: HalfEdge, options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | ParityRegion | undefined {\r\n    let region: AnyRegion | undefined;\r\n    const visitMask = options?.visitMask ?? HalfEdgeMask.VISITED;\r\n    const bridgeMask = options?.bridgeMask ?? HalfEdgeMask.BRIDGE_EDGE;\r\n    let startBridgeEdge: HalfEdge | undefined;\r\n    // is it a split-washer face?\r\n    if (face.isSplitWasherFace(bridgeMask) && (startBridgeEdge = face.findMaskAroundFace(bridgeMask, true))) {\r\n      const loops: Loop[] = [];\r\n      const loopEdges: HalfEdge[] = [];\r\n      const bridgeStack: HalfEdge[] = [startBridgeEdge];\r\n      const announceEdge = (he: HalfEdge) => { he.setMask(visitMask); loopEdges.push(he); };\r\n      const announceBridge = (he: HalfEdge) => { if (!he.isMaskSet(visitMask)) bridgeStack.push(he); };\r\n      face.clearMaskAroundFace(visitMask);\r\n      let bridge: HalfEdge | undefined;\r\n      while (undefined !== (bridge = bridgeStack.pop())) {\r\n        bridge.setMask(visitMask);\r\n        const loopSeed = bridge.findMaskAroundFace(bridgeMask, false); // advance to next loop\r\n        if (loopSeed) {\r\n          if (loopSeed.isMaskSet(visitMask))\r\n            continue;\r\n          loopEdges.length = 0;\r\n          if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {\r\n            const loop = this.createLoopInFace(loopEdges, options);\r\n            if (loop) {\r\n              loops.push(loop);\r\n              continue;\r\n            }\r\n          }\r\n        }\r\n      }\r\n      region = RegionOps.sortOuterAndHoleLoopsXY(loops);\r\n      region = RegionOps.simplifyRegion(region);\r\n    } else {\r\n      region = this.createLoopInFace(face, options);\r\n    }\r\n    return (region && (region instanceof Loop || region instanceof ParityRegion)) ? region : undefined;\r\n  }\r\n  /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */\r\n  private static isNullFace(he: HalfEdge): boolean {\r\n    const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);\r\n    let faceIsBanana = false;\r\n    if (faceHasTwoEdges) {\r\n      const c0 = HalfEdgeGraphMerge.curvatureSortKey(he);\r\n      const c1 = HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);\r\n      if (!Geometry.isSameCoordinate(c0, c1)) // default tol!\r\n        faceIsBanana = true;  // heuristic: we could also check end curvatures, and/or higher derivatives...\r\n    }\r\n    return faceHasTwoEdges && !faceIsBanana;\r\n  }\r\n  /** Look across edge mates (possibly several) for a non-null mate face. */\r\n  private static getNonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\r\n    if (this.isNullFace(e))\r\n      return undefined;\r\n    let e1 = e.edgeMate;\r\n    while (this.isNullFace(e1)) {\r\n      e1 = e1.faceSuccessor.edgeMate;\r\n      if (e1 === e)\r\n        return undefined;\r\n    }\r\n    return e1;\r\n  }\r\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, closureTol: number = Geometry.smallMetricDistance, areaTol: number = 1.0e-10): SignedLoops[] {\r\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    const result: SignedLoops[] = [];\r\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\r\n    for (const faceSeeds of q) {\r\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\r\n      const edges: LoopCurveLoopCurve[] = [];\r\n      for (const faceSeed of faceSeeds) {\r\n        const isNullFace = this.isNullFace(faceSeed);\r\n        const announceEdge = isNullFace ? undefined : (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\r\n          const mate = this.getNonNullEdgeMate(graph, he);\r\n          if (mate !== undefined) {\r\n            const e = edgeMap.get(mate);\r\n            if (e === undefined) {\r\n              // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\r\n              const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\r\n              edgeMap.set(he, e1);\r\n            } else if (e instanceof LoopCurveLoopCurve) {\r\n              e.setB(loopC, curveC);\r\n              edges.push(e);\r\n              edgeMap.delete(mate);\r\n            }\r\n          }\r\n        };\r\n        const loop = this.createLoopInFace(faceSeed, { announceEdge, closureTol });\r\n        if (loop)\r\n          this.collectSignedLoop(loop, componentAreas, areaTol, isNullFace);\r\n      }\r\n      componentAreas.edges = edges;\r\n      result.push(componentAreas);\r\n      edgeMap.clear();\r\n    }\r\n    return result;\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n*/\r\nexport namespace PlanarSubdivision {\r\n  /** Options bundle for [[PlanarSubdivision.createLoopInFace]] and [[PlanarSubdivision.createLoopOrParityRegionInFace]]. */\r\n  export interface CreateRegionInFaceOptions {\r\n    /**\r\n     * Optional callback invoked on each `edge` before its `curve` is added to `loop`.\r\n     * * Note that if a [[ParityRegion]] is being constructed, `curve` and `loop` may subsequently be reversed.\r\n     */\r\n    announceEdge?: (edge: HalfEdge, curve: CurvePrimitive, loop: Loop) => void;\r\n    /**\r\n     * Whether to consolidate adjacent curves in an output [[Loop]]. Default value is `false`.\r\n     * * If `announce` is defined, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.\r\n     */\r\n    compress?: boolean;\r\n    /** Absolute xy-distance for confirming a returned Loop is closed. Default value is [[Geometry.smallMetricDistance]]. */\r\n    closureTol?: number;\r\n    /**\r\n     * Mask preset on bridge edges. Default value is `HalfEdgeMask.BRIDGE_EDGE`.\r\n     * * This mask is used to distinguish a split-washer type face, which can result in a [[ParityRegion]].\r\n     */\r\n    bridgeMask?: HalfEdgeMask;\r\n    /** Mask to use for visiting edges when creating a [[ParityRegion]] from a split-washer type face. Default value is `HalfEdgeMask.VISITED`. */\r\n    visitMask?: HalfEdgeMask;\r\n    /**\r\n     * Optional z-coordinate for the result region.\r\n     * * If undefined, graph z-coordinates are used, but this may result in a non-planar region if the graph is not planar!\r\n     */\r\n    z?: number;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"PlanarSubdivision.js","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,sDAA6C;AAC7C,6CAA0C;AAE1C,0DAAuD;AACvD,gDAA6E;AAC7E,4EAAyE;AACzE,oDAA4D;AAC5D,oCAAiC;AACjC,gEAAsF;AAGtF,oDAAiD;AACjD,kDAA+C;AAC/C,kCAAgE;AAChE,kDAA+C;AAC/C,4CAAyC;AACzC,oFAAwF;AAqCxF;;GAEG;AACH,MAAM,+CAA+C;IAC5C,eAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;IAC9E,mDAAmD;IAC5C,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,qBAAqB,GAAW,CAAC,CAAC;IACnC,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACM,UAAU,CAAC,IAA6B;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IACD;;;;;OAKG;IACI,qCAAqC,CAC1C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,yBAAyB,GAAG,KAAK,CAAC;YACtC,IAAI,CAAC,YAAY,aAAK;gBACpB,yBAAyB,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;iBAC9C,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,2BAAY,CAAC,EAAE,6FAA6F;gBACnK,yBAAyB,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC;YACtF,IAAI,yBAAyB,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;oBACb,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;oBACH,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAa,iBAAiB;IAC5B;;;;;;OAMG;IACI,MAAM,CAAC,qBAAqB,CACjC,UAA4B,EAC5B,QAAmC,EACnC,iBAAyB,mBAAQ,CAAC,mBAAmB,EACrD,kBAA0B,mBAAQ,CAAC,iBAAiB;QAEpD,yDAAyD;QACzD,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC;QAChF,KAAK,MAAM,IAAI,IAAI,QAAQ;YACzB,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,UAAU,CAAC,MAAM,GAAG,iBAAiB,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YAC/D,qEAAqE;YACrE,iBAAiB,CAAC,qCAAqC,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QACtF,CAAC;QACD,sFAAsF;QACtF,MAAM,kBAAkB,GAAG,CAAC,IAA6B,EAAE,KAAqB,EAAU,EAAE;YAC1F,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACxF,CAAC,CAAC;QACF,MAAM,gBAAgB,GAAG,CAAC,IAA6B,EAAE,KAAqB,EAAuB,EAAE;YACrG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;QACtE,CAAC,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YAChE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,qEAAqE;YACrE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAsC,EAAE,UAAU,EAAE,EAAE;gBACrF,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBAC/C,IAAI,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC/F,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;oBACjG,OAAO;wBACL,GAAG,WAAW;wBACd,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;wBACvD,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;qBACxD,CAAC;gBACJ,CAAC;gBACD,OAAO,CAAC,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC;YACtC,CAAC,EAAE,EAAE,CAAC,CAAC;YACP,0CAA0C;YAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE;gBAC9E,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC/C,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC/C,OAAO,SAAS,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;YACpD,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBAC/C,MAAM,cAAc,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,oEAAoE;gBAC/I,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;YAC7G,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC;QAC3F,CAAC;QACD,sDAAsD;QACtD,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,IAAI,CAAC,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;QACvH,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;MAGE;IACM,MAAM,CAAC,gBAAgB,CAAC,CAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,cAAsB;QAC/I,IAAI,mBAAQ,CAAC,eAAe,CAAC,SAAS,GAAG,SAAS,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACrD,IAAI,EAAE,EAAE,mBAAmB,CAAC,qBAAS,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU;gBACpG,OAAO,EAAE,CAAC,WAAW,EAAE,IAAI,cAAc,CAAC,CAAC,YAAY;QAC3D,CAAC;QACD,OAAO,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,YAAY;IACrE,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,WAAW,CACxB,KAAoB,EACpB,CAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,CAAC,EAAE,CAAC;YACpF,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,YAAY,iDAAiB,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iDAAiB,CAAC,WAAW;gBACzH,QAAQ,CAAC,iBAAiB,CAAC,oBAAY,CAAC,WAAW,CAAC,CAAC;YACvD,MAAM,QAAQ,GAAG,yCAAmB,CAAC,oCAAoC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACnG,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;YAC/B,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC;YAC5B,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;YACxB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;YACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC;YACrB,MAAM,gBAAgB,GAAG,CAAC,CAAS,EAAE,OAAgB,EAAU,EAAE;gBAC/D,MAAM,GAAG,GAAG,CAAC,CAAC,4BAA4B,CAAC,CAAC,CAAC,CAAC;gBAC9C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC9D,CAAC,CAAC;YACF,QAAQ,CAAC,SAAS,GAAG,gBAAgB,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACxD,IAAI,CAAC,SAAS,GAAG,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACrD,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,uCAAuC;IACxF,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,IAAU,EAAE,QAAqB,EAAE,UAAkB,OAAO,EAAE,YAAsB;QAClH,IAAI,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,qBAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;YAC1B,IAAI,GAAG,GAAG,CAAC;QACZ,IAAY,CAAC,+BAA+B,GAAG,IAAI,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC;YACV,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACnC,IAAI,IAAI,GAAG,CAAC;YACf,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEtC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sDAAsD;IAC9C,MAAM,CAAC,uBAAuB,CAAC,IAAc;QACnD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,YAAY,yCAAmB,EAAE,CAAC;YAC/F,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;YAC5B,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;gBACnC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kDAAkD;IAC1C,MAAM,CAAC,iBAAiB,CAAC,IAAc,EAAE,CAAU;QACzD,IAAI,MAAkC,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC;YAC1D,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;YACxE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;YACxE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACrD,IAAI,MAAM,IAAI,CAAC,KAAK,SAAS;gBAC3B,MAAM,CAAC,mBAAmB,CAAC,qBAAS,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9F,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAA2B,EAAE,OAAmC;QAC7F,MAAM,WAAW,GAAG,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,IAAI,KAAK,CAAC,CAAC,+BAA+B;QAC/G,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,CAAC,IAAc,EAAQ,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YACvD,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,EAAE,YAAY,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC3C,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC,CAAC;QACF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;;YAE3B,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACzC,IAAI,WAAW,EAAE,CAAC;YAChB,qBAAS,CAAC,6BAA6B,CAAC,IAAI,EAAE,EAAE,mBAAmB,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/E,CAAC;QACD,IAAI,IAAI,CAAC,uBAAuB,CAAC,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,IAAA,qBAAM,EAAC,GAAG,EAAE,CAAC,KAAK,EAAE,+BAA+B,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,OAAmC;QAC9F,IAAI,MAA6B,CAAC;QAClC,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,oBAAY,CAAC,OAAO,CAAC;QAC7D,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,oBAAY,CAAC,WAAW,CAAC;QACnE,IAAI,eAAqC,CAAC;QAC1C,6BAA6B;QAC7B,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACxG,MAAM,KAAK,GAAW,EAAE,CAAC;YACzB,MAAM,SAAS,GAAe,EAAE,CAAC;YACjC,MAAM,WAAW,GAAe,CAAC,eAAe,CAAC,CAAC;YAClD,MAAM,YAAY,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,cAAc,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC;gBAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,MAA4B,CAAC;YACjC,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,QAAQ,GAAG,MAAM,CAAC,kBAAkB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,uBAAuB;gBACtF,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;wBAC/B,SAAS;oBACX,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;oBACrB,IAAI,QAAQ,CAAC,wBAAwB,CAAC,UAAU,EAAE,YAAY,EAAE,cAAc,CAAC,EAAE,CAAC;wBAChF,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;wBACvD,IAAI,IAAI,EAAE,CAAC;4BACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACjB,SAAS;wBACX,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM,GAAG,qBAAS,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,qBAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,CAAC,MAAM,IAAI,CAAC,MAAM,YAAY,WAAI,IAAI,MAAM,YAAY,2BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD,yGAAyG;IACjG,MAAM,CAAC,UAAU,CAAC,EAAY;QACpC,MAAM,eAAe,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,aAAa,KAAK,EAAE,CAAC,CAAC;QAChE,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1E,IAAI,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,eAAe;gBACrD,YAAY,GAAG,IAAI,CAAC,CAAE,8EAA8E;QACxG,CAAC;QACD,OAAO,eAAe,IAAI,CAAC,YAAY,CAAC;IAC1C,CAAC;IACD,0EAA0E;IAClE,MAAM,CAAC,kBAAkB,CAAC,MAAqB,EAAE,CAAW;QAClE,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,oCAAoC,CAAC,KAAoB,EAAE,aAAqB,mBAAQ,CAAC,mBAAmB,EAAE,UAAkB,OAAO;QACnJ,MAAM,CAAC,GAAG,yCAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAClG,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;QACxD,KAAK,MAAM,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,cAAc,GAAgB,EAAE,iBAAiB,EAAE,EAAE,EAAE,iBAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAClG,MAAM,KAAK,GAAyB,EAAE,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC7C,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAY,EAAE,MAAsB,EAAE,KAAW,EAAE,EAAE;oBAClG,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;oBAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;wBACvB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBAC5B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;4BACpB,oGAAoG;4BACpG,MAAM,EAAE,GAAG,IAAI,yBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;4BACvE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;wBACtB,CAAC;6BAAM,IAAI,CAAC,YAAY,yBAAkB,EAAE,CAAC;4BAC3C,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;4BACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BACd,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;wBACvB,CAAC;oBACH,CAAC;gBACH,CAAC,CAAC;gBACF,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,CAAC;gBAC3E,IAAI,IAAI;oBACN,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;YACtE,CAAC;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAxSD,8CAwSC","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\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { AnyRegion } from \"../CurveTypes\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { RegionOps } from \"../RegionOps\";\r\nimport { RegionGroupMember, RegionGroupOpType } from \"../RegionOpsClassificationSweeps\";\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\n/**\r\n * Options bundle for [[PlanarSubdivision.createLoopInFace]] and [[PlanarSubdivision.createLoopOrParityRegionInFace]].\r\n * @internal\r\n */\r\nexport interface CreateRegionInFaceOptions {\r\n  /**\r\n   * Optional callback invoked on each `edge` before its `curve` is added to `loop`.\r\n   * * Note that if a [[ParityRegion]] is being constructed, `curve` and `loop` may subsequently be reversed.\r\n   */\r\n  announceEdge?: (edge: HalfEdge, curve: CurvePrimitive, loop: Loop) => void;\r\n  /**\r\n   * Whether to consolidate adjacent curves in an output [[Loop]]. Default value is `false`.\r\n   * * If `announce` is defined, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.\r\n   */\r\n  compress?: boolean;\r\n  /** Absolute xy-distance for confirming a returned Loop is closed. Default value is [[Geometry.smallMetricDistance]]. */\r\n  closureTol?: number;\r\n  /**\r\n   * Mask preset on bridge edges. Default value is `HalfEdgeMask.BRIDGE_EDGE`.\r\n   * * This mask is used to distinguish a split-washer type face, which can result in a [[ParityRegion]].\r\n   */\r\n  bridgeMask?: HalfEdgeMask;\r\n  /** Mask to use for visiting edges when creating a [[ParityRegion]] from a split-washer type face. Default value is `HalfEdgeMask.VISITED`. */\r\n  visitMask?: HalfEdgeMask;\r\n  /**\r\n   * Optional z-coordinate for the result region.\r\n   * * If undefined, graph z-coordinates are used, but this may result in a non-planar region if the graph is not planar!\r\n   */\r\n  z?: number;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nclass MapCurvePrimitiveToCurveLocationDetailPairArray {\r\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\r\n  // index assigned to this primitive (for debugging)\r\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\r\n  private _numIndexedPrimitives: number = 0;\r\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\r\n    if (primitive !== undefined) {\r\n      const index = this.primitiveToIndex.get(primitive);\r\n      if (index === undefined) {\r\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\r\n      }\r\n    }\r\n  }\r\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\r\n    if (primitive) {\r\n      const priorPairs = this.primitiveToPair.get(primitive);\r\n      this.assignPrimitiveIndex(primitive);\r\n      if (!priorPairs) {\r\n        this.primitiveToPair.set(primitive, [pair]);\r\n      } else {\r\n        priorPairs.push(pair);\r\n      }\r\n    }\r\n  }\r\n  public insertPair(pair: CurveLocationDetailPair) {\r\n    const primitiveA = pair.detailA.curve;\r\n    if (primitiveA)\r\n      this.insertPrimitiveToPair(primitiveA, pair);\r\n    const primitiveB = pair.detailB.curve;\r\n    if (primitiveB)\r\n      this.insertPrimitiveToPair(primitiveB, pair);\r\n  }\r\n  /**\r\n   * Split closed missing primitives in half and add new intersection pairs.\r\n   * * When bridge edges aren't included in the primitives array, a closed primitive with no intersections will not be\r\n   * added to the graph because it isn't in the `primitiveToPair` map. By splitting such a missing primitive in two, we\r\n   * introduce two intersections for each half, which allows the primitive to be represented in the map.\r\n   */\r\n  public splitAndAppendMissingClosedPrimitives(\r\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): void {\r\n    for (const p of primitives) {\r\n      let closedCurveSplitCandidate = false;\r\n      if (p instanceof Arc3d)\r\n        closedCurveSplitCandidate = p.sweep.isFullCircle;\r\n      else if (!(p instanceof LineSegment3d) && !(p instanceof LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.\r\n        closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);\r\n      if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {\r\n        const p0 = p.clonePartialCurve(0.0, 0.5);\r\n        const p1 = p.clonePartialCurve(0.5, 1.0);\r\n        if (p0 && p1) {\r\n          this.insertPair(CurveLocationDetailPair.createCapture(\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0),\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0),\r\n          ));\r\n          this.insertPair(CurveLocationDetailPair.createCapture(\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0),\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0),\r\n          ));\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport class PlanarSubdivision {\r\n  /**\r\n   * Create a graph from curves and precomputed intersections.\r\n   * * Z-coordinates are ignored.\r\n   * @param primitives input curves\r\n   * @param allPairs array of curve-curve xy-intersections\r\n   * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].\r\n   */\r\n  public static assembleHalfEdgeGraph(\r\n    primitives: CurvePrimitive[],\r\n    allPairs: CurveLocationDetailPair[],\r\n    mergeTolerance: number = Geometry.smallMetricDistance,\r\n    radianTolerance: number = Geometry.smallAngleRadians,\r\n  ): HalfEdgeGraph {\r\n    // map from key CurvePrimitive to CurveLocationDetailPair\r\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();\r\n    for (const pair of allPairs)\r\n      detailByPrimitive.insertPair(pair);\r\n    if (primitives.length > detailByPrimitive.primitiveToPair.size) {\r\n      // otherwise, these single-primitive loops are missing from the graph\r\n      detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance);\r\n    }\r\n    // these helper lambdas assume exactly one of the paired details is on the input curve\r\n    const getFractionOnCurve = (pair: CurveLocationDetailPair, curve: CurvePrimitive): number => {\r\n      return (pair.detailA.curve === curve) ? pair.detailA.fraction : pair.detailB.fraction;\r\n    };\r\n    const getDetailOnCurve = (pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail => {\r\n      return (pair.detailA.curve === curve) ? pair.detailA : pair.detailB;\r\n    };\r\n    const graph = new HalfEdgeGraph();\r\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\r\n      const p = entry[0];\r\n      // convert each interval intersection into two isolated intersections\r\n      const details = entry[1].reduce((accumulator: CurveLocationDetailPair[], detailPair) => {\r\n        const detail = getDetailOnCurve(detailPair, p);\r\n        if (detail.isInterval()) {\r\n          const detail0 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);\r\n          const detail1 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1, detail.point1);\r\n          return [\r\n            ...accumulator,\r\n            CurveLocationDetailPair.createCapture(detail0, detail0),\r\n            CurveLocationDetailPair.createCapture(detail1, detail1),\r\n          ];\r\n        }\r\n        return [...accumulator, detailPair];\r\n      }, []);\r\n      // lexical sort on p intersection fraction\r\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\r\n        const fractionA = getFractionOnCurve(pairA, p);\r\n        const fractionB = getFractionOnCurve(pairB, p);\r\n        return fractionA - fractionB;\r\n      });\r\n      let last = { point: p.startPoint(), fraction: 0.0 };\r\n      for (const detailPair of details) {\r\n        const detail = getDetailOnCurve(detailPair, p);\r\n        const detailFraction = Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later\r\n        last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);\r\n      }\r\n      this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);\r\n    }\r\n    // every edge got its sortAngle defined by addHalfEdge\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle ?? 0, mergeTolerance, radianTolerance);\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.\r\n   * * Different metrics are employed for expedience.\r\n  */\r\n  private static isCurveTrivialXY(p: CurvePrimitive, point0: Point3d, fraction0: number, point1: Point3d, fraction1: number, mergeTolerance: number): boolean {\r\n    if (Geometry.isSmallRelative(fraction0 - fraction1))\r\n      return true;\r\n    if (!(p instanceof LineSegment3d)) {\r\n      const p0 = p.clonePartialCurve(fraction0, fraction1);\r\n      if (p0?.tryTransformInPlace(Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0))) // flatten\r\n        return p0.curveLength() <= mergeTolerance; // Euclidean\r\n    }\r\n    return point0.isAlmostEqualXY(point1, mergeTolerance); // Manhattan\r\n  }\r\n\r\n  /**\r\n   * Create a pair of mated half edges referencing a non-trivial interval of a primitive.\r\n   * @param graph containing graph\r\n   * @param p the curve\r\n   * @param point0 start point\r\n   * @param fraction0 starting fraction\r\n   * @param point1 end point\r\n   * @param fraction1 end fraction\r\n   * @param mergeTolerance optional maximum xy-length of a trivial edge\r\n   * @returns end point and fraction\r\n   */\r\n  private static addHalfEdge(\r\n    graph: HalfEdgeGraph,\r\n    p: CurvePrimitive,\r\n    point0: Point3d,\r\n    fraction0: number,\r\n    point1: Point3d,\r\n    fraction1: number,\r\n    mergeTolerance: number = Geometry.smallMetricDistance,\r\n  ): { point: Point3d, fraction: number } {\r\n    if (!this.isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance)) {\r\n      const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);\r\n      if (p.parent && p.parent instanceof RegionGroupMember && p.parent.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\r\n        halfEdge.setMaskAroundEdge(HalfEdgeMask.BRIDGE_EDGE);\r\n      const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);\r\n      const mate = halfEdge.edgeMate;\r\n      halfEdge.edgeTag = detail01;\r\n      halfEdge.sortData = 1.0;\r\n      mate.edgeTag = detail01;\r\n      mate.sortData = -1.0;\r\n      const computeSortAngle = (f: number, reverse: boolean): number => {\r\n        const ray = p.fractionToPointAndDerivative(f);\r\n        const s = reverse ? -1.0 : 1.0;\r\n        return Math.atan2(s * ray.direction.y, s * ray.direction.x);\r\n      };\r\n      halfEdge.sortAngle = computeSortAngle(fraction0, false);\r\n      mate.sortAngle = computeSortAngle(fraction1, true);\r\n    }\r\n    return { point: point1, fraction: fraction1 }; // where the next curve fragment starts\r\n  }\r\n  /**\r\n   * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,\r\n   * or sliver loops.\r\n   * @param areaTol absolute area tolerance for sliver face detection\r\n   * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area\r\n   * @returns the area (forced to zero if within tolerance)\r\n   */\r\n  public static collectSignedLoop(loop: Loop, outLoops: SignedLoops, areaTol: number = 1.0e-10, isSliverFace?: boolean): number {\r\n    let area = isSliverFace ? 0.0 : RegionOps.computeXYArea(loop);\r\n    if (area === undefined)\r\n      area = 0;\r\n    if (Math.abs(area) < areaTol)\r\n      area = 0.0;\r\n    (loop as any).computedAreaInPlanarSubdivision = area;\r\n    if (area > 0)\r\n      outLoops.positiveAreaLoops.push(loop);\r\n    else if (area < 0)\r\n      outLoops.negativeAreaLoops.push(loop);\r\n    else\r\n      outLoops.slivers.push(loop);\r\n    return area;\r\n  }\r\n  /** Extract geometric info from a topological edge. */\r\n  private static extractGeometryFromEdge(edge: HalfEdge): { detail: CurveLocationDetail, reversed: boolean } | undefined {\r\n    if (edge.sortData !== undefined && edge.edgeTag && edge.edgeTag instanceof CurveLocationDetail) {\r\n      const detail = edge.edgeTag;\r\n      if (detail.curve && detail.fraction1 !== undefined) {\r\n        const reversed = edge.sortData < 0;\r\n        return { detail, reversed };\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Create the geometry for a topological edge. */\r\n  private static createCurveInEdge(edge: HalfEdge, z?: number): CurvePrimitive | undefined {\r\n    let result: CurvePrimitive | undefined;\r\n    const info = this.extractGeometryFromEdge(edge);\r\n    if (info && info.detail.curve && info.detail.isInterval()) {\r\n      const f0 = info.reversed ? info.detail.fraction1 : info.detail.fraction;\r\n      const f1 = info.reversed ? info.detail.fraction : info.detail.fraction1;\r\n      result = info.detail.curve.clonePartialCurve(f0, f1);\r\n      if (result && z !== undefined)\r\n        result.tryTransformInPlace(Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, z));\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a [[Loop]] for the given face or super face.\r\n   * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).\r\n   * @param options bundle of options.\r\n   * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.\r\n   */\r\n  public static createLoopInFace(face: HalfEdge | HalfEdge[], options?: CreateRegionInFaceOptions): Loop | undefined {\r\n    const consolidate = options?.announceEdge ? false : options?.compress ?? false; // can't compress if announcing\r\n    const loop = Loop.create();\r\n    const addEdgeCurve = (edge: HalfEdge): void => {\r\n      const curve = this.createCurveInEdge(edge, options?.z);\r\n      if (curve) {\r\n        options?.announceEdge?.(edge, curve, loop);\r\n        loop.tryAddChild(curve);\r\n      }\r\n    };\r\n    if (Array.isArray(face))\r\n      face.forEach(addEdgeCurve);\r\n    else\r\n      face.announceEdgesInFace(addEdgeCurve);\r\n    if (consolidate) {\r\n      RegionOps.consolidateAdjacentPrimitives(loop, { consolidateLoopSeam: true });\r\n    }\r\n    if (loop.isPhysicallyClosedCurve(options?.closureTol, true))\r\n      return loop;\r\n    assert(() => false, \"face is not physically closed\");\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Create a [[Loop]] or [[ParityRegion]] for the given face.\r\n   * * A ParityRegion is created for a split-washer type face by removing bridge edges.\r\n   * @param face a node in the face loop.\r\n   * @param options bundle of options.\r\n   * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.\r\n   */\r\n  public static createLoopOrParityRegionInFace(face: HalfEdge, options?: CreateRegionInFaceOptions): Loop | ParityRegion | undefined {\r\n    let region: AnyRegion | undefined;\r\n    const visitMask = options?.visitMask ?? HalfEdgeMask.VISITED;\r\n    const bridgeMask = options?.bridgeMask ?? HalfEdgeMask.BRIDGE_EDGE;\r\n    let startBridgeEdge: HalfEdge | undefined;\r\n    // is it a split-washer face?\r\n    if (face.isSplitWasherFace(bridgeMask) && (startBridgeEdge = face.findMaskAroundFace(bridgeMask, true))) {\r\n      const loops: Loop[] = [];\r\n      const loopEdges: HalfEdge[] = [];\r\n      const bridgeStack: HalfEdge[] = [startBridgeEdge];\r\n      const announceEdge = (he: HalfEdge) => { he.setMask(visitMask); loopEdges.push(he); };\r\n      const announceBridge = (he: HalfEdge) => { if (!he.isMaskSet(visitMask)) bridgeStack.push(he); };\r\n      face.clearMaskAroundFace(visitMask);\r\n      let bridge: HalfEdge | undefined;\r\n      while (undefined !== (bridge = bridgeStack.pop())) {\r\n        bridge.setMask(visitMask);\r\n        const loopSeed = bridge.findMaskAroundFace(bridgeMask, false); // advance to next loop\r\n        if (loopSeed) {\r\n          if (loopSeed.isMaskSet(visitMask))\r\n            continue;\r\n          loopEdges.length = 0;\r\n          if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {\r\n            const loop = this.createLoopInFace(loopEdges, options);\r\n            if (loop) {\r\n              loops.push(loop);\r\n              continue;\r\n            }\r\n          }\r\n        }\r\n      }\r\n      region = RegionOps.sortOuterAndHoleLoopsXY(loops);\r\n      region = RegionOps.simplifyRegion(region);\r\n    } else {\r\n      region = this.createLoopInFace(face, options);\r\n    }\r\n    return (region && (region instanceof Loop || region instanceof ParityRegion)) ? region : undefined;\r\n  }\r\n  /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */\r\n  private static isNullFace(he: HalfEdge): boolean {\r\n    const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);\r\n    let faceIsBanana = false;\r\n    if (faceHasTwoEdges) {\r\n      const c0 = HalfEdgeGraphMerge.curvatureSortKey(he);\r\n      const c1 = HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);\r\n      if (!Geometry.isSameCoordinate(c0, c1)) // default tol!\r\n        faceIsBanana = true;  // heuristic: we could also check end curvatures, and/or higher derivatives...\r\n    }\r\n    return faceHasTwoEdges && !faceIsBanana;\r\n  }\r\n  /** Look across edge mates (possibly several) for a non-null mate face. */\r\n  private static getNonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\r\n    if (this.isNullFace(e))\r\n      return undefined;\r\n    let e1 = e.edgeMate;\r\n    while (this.isNullFace(e1)) {\r\n      e1 = e1.faceSuccessor.edgeMate;\r\n      if (e1 === e)\r\n        return undefined;\r\n    }\r\n    return e1;\r\n  }\r\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, closureTol: number = Geometry.smallMetricDistance, areaTol: number = 1.0e-10): SignedLoops[] {\r\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    const result: SignedLoops[] = [];\r\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\r\n    for (const faceSeeds of q) {\r\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\r\n      const edges: LoopCurveLoopCurve[] = [];\r\n      for (const faceSeed of faceSeeds) {\r\n        const isNullFace = this.isNullFace(faceSeed);\r\n        const announceEdge = isNullFace ? undefined : (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\r\n          const mate = this.getNonNullEdgeMate(graph, he);\r\n          if (mate !== undefined) {\r\n            const e = edgeMap.get(mate);\r\n            if (e === undefined) {\r\n              // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\r\n              const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\r\n              edgeMap.set(he, e1);\r\n            } else if (e instanceof LoopCurveLoopCurve) {\r\n              e.setB(loopC, curveC);\r\n              edges.push(e);\r\n              edgeMap.delete(mate);\r\n            }\r\n          }\r\n        };\r\n        const loop = this.createLoopInFace(faceSeed, { announceEdge, closureTol });\r\n        if (loop)\r\n          this.collectSignedLoop(loop, componentAreas, areaTol, isNullFace);\r\n      }\r\n      componentAreas.edges = edges;\r\n      result.push(componentAreas);\r\n      edgeMap.clear();\r\n    }\r\n    return result;\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/RegionOps.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAC0B,oBAAoB,EAAyB,0BAA0B,EACvG,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,yBAAyB,EAAE,wBAAwB,EAAE,MAAM,mBAAmB,CAAC;AAI/H,OAAO,EAAe,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAI7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAQ7D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAO9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AAEvH;;;GAGG;AACH,MAAM,WAAW,oCAAoC;IACnD,wGAAwG;IACxG,yBAAyB,CAAC,EAAE,OAAO,CAAC;IACpC,mGAAmG;IACnG,yBAAyB,CAAC,EAAE,OAAO,CAAC;IACpC;;;OAGG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,yFAAyF;IACzF,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC,mGAAmG;IACnG,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,2IAA2I;IAC3I,sBAAsB,CAAC,EAAE,MAAM,CAAC;CACjC;AAED;;;;GAIG;AACH,qBAAa,yCAA0C,YAAW,oCAAoC;IACpG,+EAA+E;IACxE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0EAA0E;IACnE,yBAAyB,EAAE,OAAO,CAAQ;IACjD;;;OAGG;IACI,mBAAmB,CAAC,EAAE,OAAO,CAAS;IAC7C,gEAAgE;IACzD,wBAAwB,CAAC,EAAE,OAAO,CAAS;IAClD,gDAAgD;IACzC,uBAAuB,EAAE,MAAM,CAAgC;IACtE,wFAAwF;IACjF,sBAAsB,EAAE,MAAM,CAAgC;CACtE;AAED;;;;GAIG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB;IACrC,kGAAkG;IAClG,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,uIAAuI;IACvI,eAAe,CAAC,EAAE,kBAAkB,CAAC;IACrC,wIAAwI;IACxI,eAAe,CAAC,EAAE,kBAAkB,CAAC;CACtC;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;;;;;;;;OAQG;WACW,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS7E;;;;;OAKG;WACW,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAStH;;;;OAIG;WACW,kBAAkB,CAAC,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAMlG;;;;;;OAMG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQlE;;;;;;;OAOG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO/E;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IAiCtF;;;OAGG;WACW,eAAe,CAC3B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,0BAA0B,EAChC,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GACnE,IAAI;IAqCP;;;;OAIG;WACW,0BAA0B,CACtC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GACvF,QAAQ,EAAE,GAAG,SAAS;IAYzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CACjD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,sCAAsC,CAClD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS;IAU9D;;;;;;;;OAQG;WACW,cAAc,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAqBtE;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAI7B,0DAA0D;IAC1D,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAQzC;;;;;;;;;;;;;;OAcG;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,kBAAkB,EAC7B,uBAAuB,GAAE,MAAM,GAAG,sBAAqD,GACtF,SAAS,GAAG,SAAS;IAkExB;;;;;;;;;;;OAWG;WACW,0BAA0B,CACtC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,EACpC,WAAW,GAAE,OAAe,GAC3B,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GACnC,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,4BAA4B,CACxC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAC/E,UAAU,GAAG,SAAS;IAIzB;;;;;;;OAOG;WACW,sBAAsB,CAClC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAClF,eAAe,GAAG,SAAS;IAI9B;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;;OASG;WACW,2BAA2B,CACvC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAC7F,eAAe,GAAG,SAAS;IAuB9B,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAG/D;;;;;;;;OAQG;WACW,uBAAuB,CACnC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAC/D,QAAQ,GAAG,SAAS;IAGvB;;;;;OAKG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS;IAahH;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAClE;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAG/E;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;;OAKG;WACW,2BAA2B,CACvC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GACnD;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBrF;;;;;;;;;;;;;;OAcG;WACW,sBAAsB,CAClC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GACrF,SAAS,GAAG,SAAS;IAgDxB;;;;;;;;;;;OAWG;WACW,6BAA6B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,oCAAoC,GAAG,IAAI;IAI1H;;;;;;;;;;;;OAYG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAa3F;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,eAAe;IAgB9B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAehC;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAmBvC;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IA8BvC,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAsBpC;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IA4C3C;;;;;;;;OAQG;WACW,2BAA2B,CAAC,KAAK,EAAE,aAAa,EAAE,YAAY,CAAC,EAAE,yBAAyB,EAAE,UAAU,CAAC,EAAE,wBAAwB,GAAG,MAAM;IA0BxJ;;;;;;;MAOE;IACF,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAgBhD;;;;;;;;;;;;;;;;;;;;;OAqBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACvC,SAAS,GAAE,MAAqC,EAChD,UAAU,GAAE,OAAc,GACzB,WAAW,EAAE;IA8BhB;;;;;;;;;;OAUG;WACW,sBAAsB,CAClC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACjC,cAAc,CAAC,EAAE,cAAc,EAAE,EACjC,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAClC,cAAc,EAAE;IAanB;;;;;OAKG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAkB3E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAqChD,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAepC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAIzC;;;;;;;;;OASG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAyBpG;;;;;MAKE;WACY,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,QAAQ,GAAE,OAAc,GAAG,gBAAgB,EAAE,GAAG,SAAS;CActI"}
+{"version":3,"file":"RegionOps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOps.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAC0B,oBAAoB,EAAyB,0BAA0B,EACvG,MAAM,oCAAoC,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAEpD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAEjE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,yBAAyB,EAAE,wBAAwB,EAAE,MAAM,mBAAmB,CAAC;AAI/H,OAAO,EAAe,UAAU,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAI7E,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAQ7D,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,QAAQ,CAAC;AAC3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9D,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAO9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD;;;;;;;GAOG;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,GAAG,KAAK,GAAG,CAAC;AAEvH;;;GAGG;AACH,MAAM,WAAW,oCAAoC;IACnD,wGAAwG;IACxG,yBAAyB,CAAC,EAAE,OAAO,CAAC;IACpC,mGAAmG;IACnG,yBAAyB,CAAC,EAAE,OAAO,CAAC;IACpC;;;OAGG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B,yFAAyF;IACzF,wBAAwB,CAAC,EAAE,OAAO,CAAC;IACnC,mGAAmG;IACnG,uBAAuB,CAAC,EAAE,MAAM,CAAC;IACjC,2IAA2I;IAC3I,sBAAsB,CAAC,EAAE,MAAM,CAAC;CACjC;AAED;;;;GAIG;AACH,qBAAa,yCAA0C,YAAW,oCAAoC;IACpG,+EAA+E;IACxE,yBAAyB,EAAE,OAAO,CAAQ;IACjD,0EAA0E;IACnE,yBAAyB,EAAE,OAAO,CAAQ;IACjD;;;OAGG;IACI,mBAAmB,CAAC,EAAE,OAAO,CAAS;IAC7C,gEAAgE;IACzD,wBAAwB,CAAC,EAAE,OAAO,CAAS;IAClD,gDAAgD;IACzC,uBAAuB,EAAE,MAAM,CAAgC;IACtE,wFAAwF;IACjF,sBAAsB,EAAE,MAAM,CAAgC;CACtE;AAED;;;;GAIG;AACH,oBAAY,kBAAkB;IAC5B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,OAAO,IAAI;IACX,OAAO,IAAI;CACZ;AAED;;;GAGG;AACH,MAAM,WAAW,sBAAsB;IACrC,kGAAkG;IAClG,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,uIAAuI;IACvI,eAAe,CAAC,EAAE,kBAAkB,CAAC;IACrC,wIAAwI;IACxI,eAAe,CAAC,EAAE,kBAAkB,CAAC;CACtC;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,SAAS;IACpB;;;;;;;;OAQG;WACW,oBAAoB,CAAC,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,SAAS;IAS7E;;;;;OAKG;WACW,sBAAsB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAStH;;;;OAIG;WACW,kBAAkB,CAAC,iBAAiB,GAAE,MAAqC,GAAG,MAAM;IAMlG;;;;;;OAMG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,GAAG,MAAM,GAAG,SAAS;IAQlE;;;;;;;OAOG;WACW,wBAAwB,CAAC,KAAK,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IAO/E;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,KAAK,GAAG,SAAS;IAiCtF;;;OAGG;WACW,eAAe,CAC3B,KAAK,EAAE,aAAa,EACpB,IAAI,EAAE,0BAA0B,EAChC,oBAAoB,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,KAAK,IAAI,GACnE,IAAI;IAqCP;;;;OAIG;WACW,0BAA0B,CACtC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,GAAG,GACvF,QAAQ,EAAE,GAAG,SAAS;IAYzB;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAUpC;;;;;;;;OAQG;WACW,qCAAqC,CACjD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;OAQG;WACW,sCAAsC,CAClD,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,WAAW,GAAE,OAAe,GACnG,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,kBAAkB,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS;IAU9D;;;;;;;;OAQG;WACW,cAAc,CAAC,MAAM,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAqBtE;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAI7B,0DAA0D;IAC1D,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAQzC;;;;;;;;;;;;;;OAcG;WACW,eAAe,CAC3B,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,MAAM,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAC3C,SAAS,EAAE,kBAAkB,EAC7B,uBAAuB,GAAE,MAAM,GAAG,sBAAqD,GACtF,SAAS,GAAG,SAAS;IAkExB;;;;;;;;;;;OAWG;WACW,0BAA0B,CACtC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,EACpC,WAAW,GAAE,OAAe,GAC3B,QAAQ,GAAG,SAAS;IASvB;;;;;;;;;;OAUG;WACW,uBAAuB,CACnC,MAAM,EAAE,0BAA0B,EAAE,EACpC,SAAS,EAAE,kBAAkB,EAC7B,MAAM,EAAE,0BAA0B,EAAE,GACnC,SAAS,GAAG,SAAS;IAwBxB;;;;;;;;;;;OAWG;WACW,4BAA4B,CACxC,MAAM,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAC/E,UAAU,GAAG,SAAS;IAIzB;;;;;;;OAOG;WACW,sBAAsB,CAClC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,YAAY,GAAG,aAAa,GAClF,eAAe,GAAG,SAAS;IAI9B;;;;;;OAMG;WACW,wBAAwB,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAGvF;;;;;;;;;OASG;WACW,2BAA2B,CACvC,MAAM,EAAE,cAAc,EAAE,EAAE,IAAI,GAAE,OAAc,EAAE,6BAA6B,GAAE,OAAe,GAC7F,eAAe,GAAG,SAAS;IAuB9B,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAA0B;IAClE;;;OAGG;WACW,qBAAqB,CAAC,CAAC,CAAC,EAAE,uBAAuB;IAG/D;;;;;;;;OAQG;WACW,uBAAuB,CACnC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,YAAY,EAAE,eAAe,GAC/D,QAAQ,GAAG,SAAS;IAGvB;;;;;OAKG;WACW,yBAAyB,CAAC,MAAM,EAAE,QAAQ,GAAG,SAAS,EAAE,UAAU,EAAE,OAAO,GAAG,QAAQ,GAAG,SAAS;IAahH;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAClE;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAG/E;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,GAAG,QAAQ,GAAG,SAAS;IAG7H;;;;;OAKG;WACW,2BAA2B,CACvC,WAAW,EAAE,QAAQ,GAAG,SAAS,EAAE,MAAM,EAAE,SAAS,GACnD;QAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;QAAC,YAAY,EAAE,QAAQ,EAAE,CAAC;QAAC,eAAe,EAAE,QAAQ,EAAE,CAAA;KAAE;IAqBrF;;;;;;;;;;;;;;OAcG;WACW,sBAAsB,CAClC,IAAI,EAAE,QAAQ,GAAG,OAAO,EAAE,GAAG,oBAAoB,EAAE,mBAAmB,GAAE,OAAc,GACrF,SAAS,GAAG,SAAS;IAgDxB;;;;;;;;;;;OAWG;WACW,6BAA6B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,oCAAoC,GAAG,IAAI;IAI1H;;;;;;;;;;;;OAYG;WACW,uBAAuB,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,GAAG,oBAAoB,CAAC,GAAG,SAAS;IAa3F;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,eAAe;IAgB9B;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAehC;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAmBvC;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IA8BvC,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAsBpC;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,4BAA4B;IA4C3C;;;;;;;;OAQG;WACW,2BAA2B,CAAC,KAAK,EAAE,aAAa,EAAE,YAAY,CAAC,EAAE,yBAAyB,EAAE,UAAU,CAAC,EAAE,wBAAwB,GAAG,MAAM;IA0BxJ;;;;;;;MAOE;IACF,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAgBhD;;;;;;;;;;;;;;;;;;;;;OAqBG;WACW,yBAAyB,CACrC,gBAAgB,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACvC,SAAS,GAAE,MAAqC,EAChD,UAAU,GAAE,OAAc,GACzB,WAAW,EAAE;IAgChB;;;;;;;;;;OAUG;WACW,sBAAsB,CAClC,UAAU,EAAE,QAAQ,GAAG,QAAQ,EAAE,EACjC,cAAc,CAAC,EAAE,cAAc,EAAE,EACjC,0BAA0B,GAAE,OAAe,EAC3C,kBAAkB,GAAE,OAAe,GAClC,cAAc,EAAE;IAanB;;;;;OAKG;WACW,iBAAiB,CAAC,UAAU,EAAE,cAAc,EAAE,GAAG,cAAc,EAAE;IAe/E;;;;OAIG;WACW,eAAe,CAAC,IAAI,EAAE,GAAG,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAkB3E;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,iCAAiC;IAqChD,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAepC;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAIzC;;;;;;;;;OASG;WACW,aAAa,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,eAAe,GAAG,SAAS;IAyBpG;;;;;MAKE;WACY,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,QAAQ,GAAE,OAAc,GAAG,gBAAgB,EAAE,GAAG,SAAS;CActI"}

package/lib/cjs/curve/RegionOps.js

@@ -1055,6 +1055,7 @@ class RegionOps {
      * to the edge and a constituent curve in each.
      */
     static constructAllXYRegionLoops(curvesAndRegions, tolerance = Geometry_1.Geometry.smallMetricDistance, addBridges = true) {
+        tolerance = GeometryQuery_1.GeometryQuery.scaleToleranceForGeometry(curvesAndRegions, tolerance, { xyOnly: true });
         let primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);
         primitives = TransferWithSplitArcs_1.TransferWithSplitArcs.clone(CurveCollection_1.BagOfCurves.create(...primitives)).children;
         let hasOpenCurve = false;
@@ -1077,8 +1078,9 @@ class RegionOps {
                 });
             }
         }
+        const radianTolerance = 10000 * Geometry_1.Geometry.smallAngleRadians; // be generous, and rely on curvature to break ties
         const intersections = CurveCurve_1.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
-        const graph = PlanarSubdivision_1.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
+        const graph = PlanarSubdivision_1.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance, radianTolerance);
         if (addBridges && hasOpenCurve)
             RegionOps.removeExtraneousBridgeEdges(graph);
         const areaTol = this.computeMinimumArea(tolerance);