@itwin/core-geometry 5.10.0-dev.18 → 5.10.0-dev.20

package/lib/cjs/curve/CurveCurve.js

@@ -85,11 +85,18 @@ class CurveCurve {
      * an `AnyRegion`, then close approaches are computed only to the defining curves, not to the area they enclose.
      * @param curveA first curve
      * @param curveB second curve
-     * @param maxDistance maximum xy-distance to consider between the curves.
+     * @param maxDistanceOrOptions maximum xy-distance to consider between the curves, or a list of extended options.
      * Close approaches further than this xy-distance are not returned.
+     * @return array of detail pairs of close xy-approaches. XY-length of the returned close approach is set in `detailA.a`
+     * and `detailB.a`.
      */
-    static closeApproachProjectedXYPairs(curveA, curveB, maxDistance) {
-        const handler = new CurveCurveCloseApproachXY_1.CurveCurveCloseApproachXY(curveB);
+    static closeApproachProjectedXYPairs(curveA, curveB, maxDistanceOrOptions = Geometry_1.Geometry.largeCoordinateResult) {
+        const optionIsNumber = Geometry_1.Geometry.isNumber(maxDistanceOrOptions);
+        const maxDistance = optionIsNumber ? maxDistanceOrOptions : maxDistanceOrOptions.maxDistance ?? Geometry_1.Geometry.largeCoordinateResult;
+        const xyTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.xyTolerance;
+        const newtonTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.newtonTolerance;
+        const maxIterations = optionIsNumber ? undefined : maxDistanceOrOptions.maxIterations;
+        const handler = new CurveCurveCloseApproachXY_1.CurveCurveCloseApproachXY(curveB, xyTolerance, newtonTolerance, maxIterations);
         handler.maxDistanceToAccept = maxDistance;
         curveA.dispatchToGeometryHandler(handler);
         return handler.grabPairedResults();
@@ -103,20 +110,20 @@ class CurveCurve {
      * found among the pairs.
      * @param curveA first curve
      * @param curveB second curve
-     * @return detail pair of closest xy-approach, undefined if not found
+     * @param options optional parameters for close approach calculation
+     * @return detail pair of closest xy-approach, undefined if not found. XY-length of the returned close approach is
+     * set in `detailA.a` and `detailB.a`.
      */
-    static closestApproachProjectedXYPair(curveA, curveB) {
-        const range = curveA.range();
-        range.extendRange(curveB.range());
-        const maxDistance = range.low.distanceXY(range.high);
-        const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, maxDistance);
+    static closestApproachProjectedXYPair(curveA, curveB, options) {
+        if (options === undefined)
+            options = { maxDistance: Geometry_1.Geometry.largeCoordinateResult };
+        const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, options);
         if (!closeApproaches.length)
             return undefined;
         let iMin = 0;
-        let minDistXY = 2 * maxDistance;
+        let minDistXY = Geometry_1.Geometry.largeCoordinateResult;
         for (let i = 0; i < closeApproaches.length; ++i) {
-            // TODO: this distance should already be in detail.a. Verify this, then just use it instead of recomputing below.
-            const distXY = closeApproaches[i].detailA.point.distanceXY(closeApproaches[i].detailB.point);
+            const distXY = closeApproaches[i].detailA.a;
             if (distXY < minDistXY) {
                 iMin = i;
                 minDistXY = distXY;

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

@@ -1 +1 @@
-{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAKvC,4FAAyF;AACzF,oFAAiF;AACjF,sFAAmF;AAEnF;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,OAAO,UAAU,CAAC,4BAA4B,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACzG,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAkC,EAClC,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7F,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,oBAAoB,CAChC,MAAgB,EAAE,OAAgB,EAAE,MAAgB,EAAE,OAAgB;QAEtE,MAAM,OAAO,GAAG,IAAI,+CAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACrE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iCAAiC,CAC7C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAgB,EAAE,MAAgB,EAAE,WAAmB;QAEvD,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,MAAM,CAAC,CAAC;QACtD,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,8BAA8B,CAAC,MAAgB,EAAE,MAAgB;QAC7E,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;QAClC,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACrD,MAAM,eAAe,GAAG,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QACxF,IAAI,CAAC,eAAe,CAAC,MAAM;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,SAAS,GAAG,CAAC,GAAG,WAAW,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAChD,iHAAiH;YACjH,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC7F,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,CAAC;gBACT,SAAS,GAAG,MAAM,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF;AA/HD,gCA+HC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyCurve } from \"./CurveTypes\";\nimport { CurveCurveCloseApproachXY } from \"./internalContexts/CurveCurveCloseApproachXY\";\nimport { CurveCurveIntersectXY } from \"./internalContexts/CurveCurveIntersectXY\";\nimport { CurveCurveIntersectXYZ } from \"./internalContexts/CurveCurveIntersectXYZ\";\n\n/**\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\n * @public\n */\nexport class CurveCurve {\n  /**\n   * Return xy intersections of 2 curves.\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static intersectionXYPairs(\n    curveA: AnyCurve,\n    extendA: boolean,\n    curveB: AnyCurve,\n    extendB: boolean,\n    tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    return CurveCurve.intersectionProjectedXYPairs(undefined, curveA, extendA, curveB, extendB, tolerance);\n  }\n  /**\n   * Return xy intersections of 2 projected curves.\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\n   * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static intersectionProjectedXYPairs(\n    worldToLocal: Matrix4d | undefined,\n    curveA: AnyCurve,\n    extendA: boolean,\n    curveB: AnyCurve,\n    extendB: boolean,\n    tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXY(worldToLocal, extendA, curveB, extendB, tolerance);\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return full 3d xyz intersections of 2 curves.\n   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\n   *  * Not Implemented for bspline and bezier curves.\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @returns array of intersections structured as CurveLocationDetailPair[]\n   */\n  public static intersectionXYZPairs(\n    curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXYZ(extendA, curveB, extendB);\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return xy intersections of input curves.\n   * @param primitives input curves to intersect\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static allIntersectionsAmongPrimitivesXY(\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);\n    for (let i = 0; i < primitives.length; i++) {\n      const curveA = primitives[i];\n      for (let j = i + 1; j < primitives.length; j++) {\n        handler.resetGeometryB(primitives[j]);\n        curveA.dispatchToGeometryHandler(handler);\n      }\n    }\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return at least one XY close approach between 2 curves.\n   * * Close approach xy-distances are measured without regard to z. This is equivalent to their separation distance\n   * as seen in the top view, or as measured between their projections onto the xy-plane.\n   * * If more than one approach is returned, one of them is the closest approach.\n   * * If an input curve is a `CurveCollection`, then close approaches are computed to each `CurvePrimitive` child.\n   * This can lead to many returned pairs, especially when both inputs are `CurveCollection`s. If an input curve is\n   * an `AnyRegion`, then close approaches are computed only to the defining curves, not to the area they enclose.\n   * @param curveA first curve\n   * @param curveB second curve\n   * @param maxDistance maximum xy-distance to consider between the curves.\n   * Close approaches further than this xy-distance are not returned.\n   */\n  public static closeApproachProjectedXYPairs(\n    curveA: AnyCurve, curveB: AnyCurve, maxDistance: number,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveCloseApproachXY(curveB);\n    handler.maxDistanceToAccept = maxDistance;\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Convenience method that calls [[closeApproachProjectedXYPairs]] with a large `maxDistance`\n   * and returns a detail pair representing the closest xy-approach between the curves.\n   * * There may be many detail pairs that represent \"closest\" xy-approach, including coincident interval pairs,\n   * isolated intersections, or close approaches within tolerance of each other. This method makes no attempt to\n   * distinguish among them, and returns a pair whose `detail.point` values are separated by the smallest xy distance\n   * found among the pairs.\n   * @param curveA first curve\n   * @param curveB second curve\n   * @return detail pair of closest xy-approach, undefined if not found\n   */\n  public static closestApproachProjectedXYPair(curveA: AnyCurve, curveB: AnyCurve): CurveLocationDetailPair | undefined {\n    const range = curveA.range();\n    range.extendRange(curveB.range());\n    const maxDistance = range.low.distanceXY(range.high);\n    const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, maxDistance);\n    if (!closeApproaches.length)\n      return undefined;\n    let iMin = 0;\n    let minDistXY = 2 * maxDistance;\n    for (let i = 0; i < closeApproaches.length; ++i) {\n      // TODO: this distance should already be in detail.a. Verify this, then just use it instead of recomputing below.\n      const distXY = closeApproaches[i].detailA.point.distanceXY(closeApproaches[i].detailB.point);\n      if (distXY < minDistXY) {\n        iMin = i;\n        minDistXY = distXY;\n      }\n    }\n    return closeApproaches[iMin];\n  }\n}\n"]}
+{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAKvC,4FAAyF;AACzF,oFAAiF;AACjF,sFAAmF;AA6BnF;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,OAAO,UAAU,CAAC,4BAA4B,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACzG,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAkC,EAClC,MAAgB,EAChB,OAAgB,EAChB,MAAgB,EAChB,OAAgB,EAChB,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,YAAY,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7F,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,oBAAoB,CAChC,MAAgB,EAAE,OAAgB,EAAE,MAAgB,EAAE,OAAgB;QAEtE,MAAM,OAAO,GAAG,IAAI,+CAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACrE,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iCAAiC,CAC7C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/C,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtC,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;;;OAcG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAgB,EAAE,MAAgB,EAAE,uBAAmD,mBAAQ,CAAC,qBAAqB;QAErH,MAAM,cAAc,GAAG,mBAAQ,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC;QAC/D,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,oBAAoB,CAAC,WAAW,IAAI,mBAAQ,CAAC,qBAAqB,CAAC;QAC/H,MAAM,WAAW,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,WAAW,CAAC;QAClF,MAAM,eAAe,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,eAAe,CAAC;QAC1F,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,aAAa,CAAC;QACtF,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,aAAa,CAAC,CAAC;QACnG,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,MAAM,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,8BAA8B,CAC1C,MAAgB,EAAE,MAAgB,EAAE,OAA2B;QAE/D,IAAI,OAAO,KAAK,SAAS;YACvB,OAAO,GAAG,EAAE,WAAW,EAAE,mBAAQ,CAAC,qBAAqB,EAAE,CAAC;QAC5D,MAAM,eAAe,GAAG,IAAI,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACpF,IAAI,CAAC,eAAe,CAAC,MAAM;YACzB,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,SAAS,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAChD,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC5C,IAAI,MAAM,GAAG,SAAS,EAAE,CAAC;gBACvB,IAAI,GAAG,CAAC,CAAC;gBACT,SAAS,GAAG,MAAM,CAAC;YACrB,CAAC;QACH,CAAC;QACD,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;CACF;AAxID,gCAwIC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyCurve } from \"./CurveTypes\";\nimport { CurveCurveCloseApproachXY } from \"./internalContexts/CurveCurveCloseApproachXY\";\nimport { CurveCurveIntersectXY } from \"./internalContexts/CurveCurveIntersectXY\";\nimport { CurveCurveIntersectXYZ } from \"./internalContexts/CurveCurveIntersectXYZ\";\n\n/**\n * Options used for method [[CurveCurve.closeApproachProjectedXYPairs]] and [[CurveCurve.closestApproachProjectedXYPair]].\n * @public\n */\nexport interface CurveCurveOptions {\n  /**\n   * Maximum xy approach distance to be returned.\n   * Default: {@link Geometry.largeCoordinateResult}.\n   */\n  maxDistance?: number;\n  /**\n   * Tolerance for comparing xy points.\n   * Default: {@link Geometry.smallMetricDistance}.\n   */\n  xyTolerance?: number;\n  /**\n   * Newton convergence tolerance, in parametric space.\n   * Default: {@link Geometry.smallNewtonStep}.\n   */\n  newtonTolerance?: number;\n  /**\n   * Maximum number of iterations for the Newton method.\n   * Default: 50.\n   */\n  maxIterations?: number;\n}\n\n/**\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\n * @public\n */\nexport class CurveCurve {\n  /**\n   * Return xy intersections of 2 curves.\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static intersectionXYPairs(\n    curveA: AnyCurve,\n    extendA: boolean,\n    curveB: AnyCurve,\n    extendB: boolean,\n    tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    return CurveCurve.intersectionProjectedXYPairs(undefined, curveA, extendA, curveB, extendB, tolerance);\n  }\n  /**\n   * Return xy intersections of 2 projected curves.\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\n   * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static intersectionProjectedXYPairs(\n    worldToLocal: Matrix4d | undefined,\n    curveA: AnyCurve,\n    extendA: boolean,\n    curveB: AnyCurve,\n    extendB: boolean,\n    tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXY(worldToLocal, extendA, curveB, extendB, tolerance);\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return full 3d xyz intersections of 2 curves.\n   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\n   *  * Not Implemented for bspline and bezier curves.\n   * @param curveA first curve\n   * @param extendA true to allow curveA to extend\n   * @param curveB second curve\n   * @param extendB true to allow curveB to extend\n   * @returns array of intersections structured as CurveLocationDetailPair[]\n   */\n  public static intersectionXYZPairs(\n    curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXYZ(extendA, curveB, extendB);\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return xy intersections of input curves.\n   * @param primitives input curves to intersect\n   * @param tolerance optional distance tolerance for coincidence\n   */\n  public static allIntersectionsAmongPrimitivesXY(\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\n  ): CurveLocationDetailPair[] {\n    const handler = new CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);\n    for (let i = 0; i < primitives.length; i++) {\n      const curveA = primitives[i];\n      for (let j = i + 1; j < primitives.length; j++) {\n        handler.resetGeometryB(primitives[j]);\n        curveA.dispatchToGeometryHandler(handler);\n      }\n    }\n    return handler.grabPairedResults();\n  }\n  /**\n   * Return at least one XY close approach between 2 curves.\n   * * Close approach xy-distances are measured without regard to z. This is equivalent to their separation distance\n   * as seen in the top view, or as measured between their projections onto the xy-plane.\n   * * If more than one approach is returned, one of them is the closest approach.\n   * * If an input curve is a `CurveCollection`, then close approaches are computed to each `CurvePrimitive` child.\n   * This can lead to many returned pairs, especially when both inputs are `CurveCollection`s. If an input curve is\n   * an `AnyRegion`, then close approaches are computed only to the defining curves, not to the area they enclose.\n   * @param curveA first curve\n   * @param curveB second curve\n   * @param maxDistanceOrOptions maximum xy-distance to consider between the curves, or a list of extended options.\n   * Close approaches further than this xy-distance are not returned.\n   * @return array of detail pairs of close xy-approaches. XY-length of the returned close approach is set in `detailA.a`\n   * and `detailB.a`.\n   */\n  public static closeApproachProjectedXYPairs(\n    curveA: AnyCurve, curveB: AnyCurve, maxDistanceOrOptions: number | CurveCurveOptions = Geometry.largeCoordinateResult,\n  ): CurveLocationDetailPair[] {\n    const optionIsNumber = Geometry.isNumber(maxDistanceOrOptions);\n    const maxDistance = optionIsNumber ? maxDistanceOrOptions : maxDistanceOrOptions.maxDistance ?? Geometry.largeCoordinateResult;\n    const xyTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.xyTolerance;\n    const newtonTolerance = optionIsNumber ? undefined : maxDistanceOrOptions.newtonTolerance;\n    const maxIterations = optionIsNumber ? undefined : maxDistanceOrOptions.maxIterations;\n    const handler = new CurveCurveCloseApproachXY(curveB, xyTolerance, newtonTolerance, maxIterations);\n    handler.maxDistanceToAccept = maxDistance;\n    curveA.dispatchToGeometryHandler(handler);\n    return handler.grabPairedResults();\n  }\n  /**\n   * Convenience method that calls [[closeApproachProjectedXYPairs]] with a large `maxDistance`\n   * and returns a detail pair representing the closest xy-approach between the curves.\n   * * There may be many detail pairs that represent \"closest\" xy-approach, including coincident interval pairs,\n   * isolated intersections, or close approaches within tolerance of each other. This method makes no attempt to\n   * distinguish among them, and returns a pair whose `detail.point` values are separated by the smallest xy distance\n   * found among the pairs.\n   * @param curveA first curve\n   * @param curveB second curve\n   * @param options optional parameters for close approach calculation\n   * @return detail pair of closest xy-approach, undefined if not found. XY-length of the returned close approach is\n   * set in `detailA.a` and `detailB.a`.\n   */\n  public static closestApproachProjectedXYPair(\n    curveA: AnyCurve, curveB: AnyCurve, options?: CurveCurveOptions\n  ): CurveLocationDetailPair | undefined {\n    if (options === undefined)\n      options = { maxDistance: Geometry.largeCoordinateResult };\n    const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, options);\n    if (!closeApproaches.length)\n      return undefined;\n    let iMin = 0;\n    let minDistXY = Geometry.largeCoordinateResult;\n    for (let i = 0; i < closeApproaches.length; ++i) {\n      const distXY = closeApproaches[i].detailA.a;\n      if (distXY < minDistXY) {\n        iMin = i;\n        minDistXY = distXY;\n      }\n    }\n    return closeApproaches[iMin];\n  }\n}\n"]}

package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts

@@ -33,6 +33,7 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     private _maxDistanceSquared;
     private _xyTolerance;
     private _newtonTolerance;
+    private _maxIterations;
     /**
      * Start and end points of line segments that meet closest approach criteria, i.e., they are perpendicular to
      * both curves and their length is smaller than _maxDistanceToAccept.
@@ -48,8 +49,9 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
      * @param geometryB second curve for intersection. Saved for reference by specific handler methods.
      * @param xyTolerance optional tolerance for comparing xy points (default [[Geometry.smallMetricDistance]]).
      * @param newtonTolerance optional relative fraction tolerance for Newton iteration (default [[Geometry.smallNewtonStep]]).
+     * @param maxIterations optional max iterations for Newton iteration (default 50).
      */
-    constructor(geometryB?: AnyCurve, xyTolerance?: number, newtonTolerance?: number);
+    constructor(geometryB?: AnyCurve, xyTolerance?: number, newtonTolerance?: number, maxIterations?: number);
     /** Set the (possibly undefined) max XY distance (z is ignored) to accept. */
     set maxDistanceToAccept(value: number | undefined);
     /** Access the (possibly undefined) max XY distance (z is ignored) to accept. */
@@ -197,11 +199,14 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     /** Specifies whether the curve needs to be stroked for close approach computation. */
     private needsStroking;
     /**
-     * Process seeds for xy close approach between one curve and another curve to be stroked.
+     * Process seeds for xy close approach between one curve and another curve.
+     * * Seeds typically result from solving a discrete close approach problem, where one or both curves have been stroked.
      * * Refine each result via Newton iteration. If it doesn't converge, remove it.
      * @param seeds the initial seed results to refine.
      * @param curveA curve to find its XY close approach with curveB.
-     * @param curveB the other curve to be stroked.
+     * @param curveAIsStroked whether `seeds` contains results from a linestring approximation to `curveA`
+     * @param curveB the other curve.
+     * @param curveBIsStroked whether `seeds` contains results from a linestring approximation to `curveB`
      * @param reversed whether `curveB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
      */
     private refineStrokedResultsByNewton;
@@ -218,7 +223,7 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     /**
      * Compute the XY close approach of a curve and another curve to be stroked.
      * @param curveA curve to find its XY close approach with curveB.
-     * @param curveB the other curve to be stroked.
+     * @param curveB the other curve, to be stroked.
      * @param reversed whether `curveB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
      */
     private dispatchCurveStrokedCurve;

package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CurveCurveCloseApproachXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveCloseApproachXY.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAEhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAOlF,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,2BAA2B,EAAE,MAAM,gCAAgC,CAAC;AAG7E,OAAO,EAA0C,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAEzG,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAKlE;;;;;;;;;;;;;GAaG;AACH,qBAAa,yBAA0B,SAAQ,8BAA8B;IAC3E,OAAO,CAAC,UAAU,CAAuB;IACzC;;;OAGG;IACH,OAAO,CAAC,oBAAoB,CAAqB;IACjD,gFAAgF;IAChF,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,gBAAgB,CAAS;IACjC;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAuC;IAEvD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,WAAW,CAAoB;IAE9C;;;;;OAKG;gBACgB,SAAS,CAAC,EAAE,QAAQ,EAAE,WAAW,GAAE,MAAqC,EAAE,eAAe,GAAE,MAAiC;IAS/I,6EAA6E;IAC7E,IAAW,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAQvD;IACD,gFAAgF;IAChF,IAAW,mBAAmB,IAAI,MAAM,GAAG,SAAS,CAEnD;IACD,mEAAmE;IACnE,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD;;;;OAIG;IACI,aAAa,CAAC,SAAS,CAAC,EAAE,QAAQ;IAIzC,8DAA8D;IAC9D,OAAO,CAAC,cAAc;IAOtB,0FAA0F;IACnF,iBAAiB,IAAI,uBAAuB,EAAE;IAGrD;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,sBAAsB;IAsB9B;;;;;;OAMG;IACH,OAAO,CAAC,iBAAiB;IAYzB;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,sBAAsB;IAsB9B,oEAAoE;IACpE,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAoB3C;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA2D5C;;;;;;OAMG;IACH,OAAO,CAAC,+BAA+B;IAavC,+DAA+D;IAC/D,OAAO,CAAC,uBAAuB;IAK/B;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAgB7B;;;;;;;;OAQG;IACH,OAAO,CAAC,0CAA0C;IAiBlD;;;;;;;;;OASG;IACH,OAAO,CAAC,iBAAiB;IA0CzB;;;;;;;OAOG;IACI,8BAA8B,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,GAAE,OAAe,GAAG,IAAI;IAmBhG,4CAA4C;IAC5C,OAAO,CAAC,cAAc;IAYtB,6DAA6D;IAC7D,OAAO,CAAC,wBAAwB;IAehC,yDAAyD;IACzD,OAAO,CAAC,oBAAoB;IA+B5B;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,wBAAwB;IAahC,0DAA0D;IAC1D,OAAO,CAAC,2BAA2B;IAgDnC,8CAA8C;IAC9C,OAAO,CAAC,uBAAuB;IAU/B,oFAAoF;IACpF,OAAO,CAAC,mCAAmC;IAmB3C,sFAAsF;IACtF,OAAO,CAAC,aAAa;IAGrB;;;;;;;OAOG;IACH,OAAO,CAAC,4BAA4B;IAkBpC;;;;;;OAMG;IACH,OAAO,CAAC,WAAW;IAKnB,4FAA4F;IAC5F,OAAO,CAAC,mCAAmC;IAkB3C;;;;;OAKG;IACH,OAAO,CAAC,yBAAyB;IAoBjC,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IAqBjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAgB1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAgB7C,gEAAgE;IAChD,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,GAAG;IAUjE,+DAA+D;IAC/C,sBAAsB,CAAC,MAAM,EAAE,kBAAkB,GAAG,GAAG;IAUvE,8EAA8E;IAC9D,iCAAiC,CAAC,KAAK,EAAE,2BAA2B,GAAG,GAAG;IAS1F,8EAA8E;IAC9D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAIpE"}
+{"version":3,"file":"CurveCurveCloseApproachXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveCloseApproachXY.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAEhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAOlF,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,2BAA2B,EAAE,MAAM,gCAAgC,CAAC;AAG7E,OAAO,EAA0C,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AAEzG,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,8BAA8B,CAAC;AAKlE;;;;;;;;;;;;;GAaG;AACH,qBAAa,yBAA0B,SAAQ,8BAA8B;IAC3E,OAAO,CAAC,UAAU,CAAuB;IACzC;;;OAGG;IACH,OAAO,CAAC,oBAAoB,CAAqB;IACjD,gFAAgF;IAChF,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,gBAAgB,CAAS;IACjC,OAAO,CAAC,cAAc,CAAS;IAC/B;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAuC;IAEvD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,WAAW,CAAoB;IAE9C;;;;;;OAMG;gBAED,SAAS,CAAC,EAAE,QAAQ,EACpB,WAAW,GAAE,MAAqC,EAClD,eAAe,GAAE,MAAiC,EAClD,aAAa,GAAE,MAAW;IAW5B,6EAA6E;IAC7E,IAAW,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAQvD;IACD,gFAAgF;IAChF,IAAW,mBAAmB,IAAI,MAAM,GAAG,SAAS,CAEnD;IACD,mEAAmE;IACnE,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD;;;;OAIG;IACI,aAAa,CAAC,SAAS,CAAC,EAAE,QAAQ;IAIzC,8DAA8D;IAC9D,OAAO,CAAC,cAAc;IAOtB,0FAA0F;IACnF,iBAAiB,IAAI,uBAAuB,EAAE;IAGrD;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,sBAAsB;IAsB9B;;;;;;OAMG;IACH,OAAO,CAAC,iBAAiB;IAYzB;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,sBAAsB;IAsB9B,oEAAoE;IACpE,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAoB3C;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA2D5C;;;;;;OAMG;IACH,OAAO,CAAC,+BAA+B;IAavC,+DAA+D;IAC/D,OAAO,CAAC,uBAAuB;IAK/B;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAgB7B;;;;;;;;OAQG;IACH,OAAO,CAAC,0CAA0C;IAiBlD;;;;;;;;;OASG;IACH,OAAO,CAAC,iBAAiB;IA0CzB;;;;;;;OAOG;IACI,8BAA8B,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,GAAE,OAAe,GAAG,IAAI;IAmBhG,4CAA4C;IAC5C,OAAO,CAAC,cAAc;IAYtB,6DAA6D;IAC7D,OAAO,CAAC,wBAAwB;IAehC,yDAAyD;IACzD,OAAO,CAAC,oBAAoB;IA+B5B;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,wBAAwB;IAahC,0DAA0D;IAC1D,OAAO,CAAC,2BAA2B;IAgDnC,8CAA8C;IAC9C,OAAO,CAAC,uBAAuB;IAU/B,oFAAoF;IACpF,OAAO,CAAC,mCAAmC;IAmB3C,sFAAsF;IACtF,OAAO,CAAC,aAAa;IAGrB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,4BAA4B;IA0BpC;;;;;;OAMG;IACH,OAAO,CAAC,WAAW;IAKnB,4FAA4F;IAC5F,OAAO,CAAC,mCAAmC;IAkB3C;;;;;OAKG;IACH,OAAO,CAAC,yBAAyB;IAmBjC,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IAqBjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAgB1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAgB7C,gEAAgE;IAChD,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,GAAG;IAUjE,+DAA+D;IAC/C,sBAAsB,CAAC,MAAM,EAAE,kBAAkB,GAAG,GAAG;IAUvE,8EAA8E;IAC9D,iCAAiC,CAAC,KAAK,EAAE,2BAA2B,GAAG,GAAG;IAS1F,8EAA8E;IAC9D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAIpE"}

package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js

@@ -54,6 +54,7 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
     _maxDistanceSquared;
     _xyTolerance;
     _newtonTolerance;
+    _maxIterations;
     /**
      * Start and end points of line segments that meet closest approach criteria, i.e., they are perpendicular to
      * both curves and their length is smaller than _maxDistanceToAccept.
@@ -69,13 +70,16 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
      * @param geometryB second curve for intersection. Saved for reference by specific handler methods.
      * @param xyTolerance optional tolerance for comparing xy points (default [[Geometry.smallMetricDistance]]).
      * @param newtonTolerance optional relative fraction tolerance for Newton iteration (default [[Geometry.smallNewtonStep]]).
+     * @param maxIterations optional max iterations for Newton iteration (default 50).
      */
-    constructor(geometryB, xyTolerance = Geometry_1.Geometry.smallMetricDistance, newtonTolerance = Geometry_1.Geometry.smallNewtonStep) {
+    constructor(geometryB, xyTolerance = Geometry_1.Geometry.smallMetricDistance, newtonTolerance = Geometry_1.Geometry.smallNewtonStep, maxIterations = 50 // seen: 47
+    ) {
         super();
         this._geometryB = geometryB instanceof ProxyCurve_1.ProxyCurve ? geometryB.proxyCurve : geometryB;
         this._maxDistanceSquared = Geometry_1.Geometry.smallMetricDistanceSquared;
         this._xyTolerance = xyTolerance;
         this._newtonTolerance = newtonTolerance;
+        this._maxIterations = maxIterations;
         const compare = CurveLocationDetail_1.CurveLocationDetailPair.comparePairsByPoints(xyTolerance, true);
         this._results = new core_bentley_1.SortedArray(compare, core_bentley_1.DuplicatePolicy.Retain);
     }
@@ -594,21 +598,27 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         return curve instanceof BSplineCurve_1.BSplineCurve3dBase || curve instanceof TransitionSpiral3d_1.TransitionSpiral3d;
     }
     /**
-     * Process seeds for xy close approach between one curve and another curve to be stroked.
+     * Process seeds for xy close approach between one curve and another curve.
+     * * Seeds typically result from solving a discrete close approach problem, where one or both curves have been stroked.
      * * Refine each result via Newton iteration. If it doesn't converge, remove it.
      * @param seeds the initial seed results to refine.
      * @param curveA curve to find its XY close approach with curveB.
-     * @param curveB the other curve to be stroked.
+     * @param curveAIsStroked whether `seeds` contains results from a linestring approximation to `curveA`
+     * @param curveB the other curve.
+     * @param curveBIsStroked whether `seeds` contains results from a linestring approximation to `curveB`
      * @param reversed whether `curveB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
      */
-    refineStrokedResultsByNewton(seeds, curveA, curveB, reversed = false) {
+    refineStrokedResultsByNewton(seeds, curveA, curveAIsStroked, curveB, curveBIsStroked, reversed = false) {
         const xyMatchingFunction = new Newton_1.CurveCurveCloseApproachXYRRtoRRD(curveA, curveB);
-        const newtonSearcher = new Newton_1.Newton2dUnboundedWithDerivative(xyMatchingFunction, 50, this._newtonTolerance); // seen: 47
+        const newtonSearcher = new Newton_1.Newton2dUnboundedWithDerivative(xyMatchingFunction, this._maxIterations, this._newtonTolerance);
         for (const seed of seeds) {
             const detailA = reversed ? seed.detailB : seed.detailA;
             const detailB = reversed ? seed.detailA : seed.detailB;
             (0, core_bentley_1.assert)(detailB.curve instanceof LineString3d_1.LineString3d, "Caller has discretized the curve");
-            newtonSearcher.setUV(detailA.fraction, detailB.fraction); // use the linestring fraction as initial curveB fraction (ASSUME it's close enough)
+            // when the curve is stroked, project the discrete seed to compute a fraction in the original curve's parameter space
+            const u = curveAIsStroked ? curveA.closestPointXY(detailA.point)?.fraction ?? detailA.fraction : detailA.fraction;
+            const v = curveBIsStroked ? curveB.closestPointXY(detailB.point)?.fraction ?? detailB.fraction : detailB.fraction;
+            newtonSearcher.setUV(u, v);
             if (newtonSearcher.runIterations()) {
                 const fractionA = newtonSearcher.getU();
                 const fractionB = newtonSearcher.getV();
@@ -651,7 +661,7 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
     /**
      * Compute the XY close approach of a curve and another curve to be stroked.
      * @param curveA curve to find its XY close approach with curveB.
-     * @param curveB the other curve to be stroked.
+     * @param curveB the other curve, to be stroked.
      * @param reversed whether `curveB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
      */
     dispatchCurveStrokedCurve(curveA, curveB, reversed) {
@@ -660,12 +670,11 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         for (const intersection of intersections)
             this.testAndRecordPair(intersection, reversed);
         // append seeds computed by solving the discretized spiral close approach problem, then refine the seeds via Newton
-        let cpA = curveA;
-        if (this.needsStroking(curveA))
-            cpA = this.strokeCurve(curveA);
+        const curveAIsStroked = this.needsStroking(curveA);
+        const cpA = curveAIsStroked ? this.strokeCurve(curveA) : curveA;
         const cpB = this.strokeCurve(curveB);
         const seeds = this.computeDiscreteCloseApproachResults(cpA, cpB, reversed);
-        this.refineStrokedResultsByNewton(seeds, curveA, curveB, reversed);
+        this.refineStrokedResultsByNewton(seeds, curveA, curveAIsStroked, curveB, true, reversed);
         if (curveA instanceof LineString3d_1.LineString3d) { // explicitly test corners (where Newton converges too slowly)
             const fStep = Geometry_1.Geometry.safeDivideFraction(1.0, curveA.numEdges(), 0);
             const v0 = CurveCurveCloseApproachXY._workPointBB0;

package/lib/cjs/curve/internalContexts/CurveCurveCloseApproachXY.js.map

@@ -1 +1 @@
-{"version":3,"file":"CurveCurveCloseApproachXY.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveCloseApproachXY.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA2E;AAC3E,6DAAgF;AAEhF,6CAA0C;AAC1C,sEAAkF;AAClF,gFAA6E;AAC7E,sEAA2D;AAC3D,kDAAiD;AACjD,kDAA0G;AAC1G,4DAA2D;AAC3D,4DAAyD;AACzD,oCAAiC;AACjC,gFAA6E;AAC7E,wDAAqD;AACrD,8CAA2C;AAC3C,gEAAyG;AACzG,sDAAmD;AAEnD,oDAAiD;AACjD,kDAA+C;AAC/C,8CAA2C;AAC3C,qEAAkE;AAGlE,+BAA+B;AAE/B;;;;;;;;;;;;;GAaG;AACH,MAAa,yBAA0B,SAAQ,gDAA8B;IACnE,UAAU,CAAuB;IACzC;;;OAGG;IACK,oBAAoB,CAAqB;IACjD,gFAAgF;IACxE,mBAAmB,CAAS;IAC5B,YAAY,CAAS;IACrB,gBAAgB,CAAS;IACjC;;;OAGG;IACK,QAAQ,CAAuC;IAE/C,MAAM,CAAC,aAAa,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACxC,MAAM,CAAC,aAAa,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACxC,MAAM,CAAC,aAAa,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACxC,MAAM,CAAC,aAAa,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACxC,MAAM,CAAC,WAAW,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IAE9C;;;;;OAKG;IACH,YAAmB,SAAoB,EAAE,cAAsB,mBAAQ,CAAC,mBAAmB,EAAE,kBAA0B,mBAAQ,CAAC,eAAe;QAC7I,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,YAAY,uBAAU,CAAC,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;QACrF,IAAI,CAAC,mBAAmB,GAAG,mBAAQ,CAAC,0BAA0B,CAAC;QAC/D,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;QACxC,MAAM,OAAO,GAAG,6CAAuB,CAAC,oBAAoB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QAChF,IAAI,CAAC,QAAQ,GAAG,IAAI,0BAAW,CAA0B,OAAO,EAAE,8BAAe,CAAC,MAAM,CAAC,CAAC;IAC5F,CAAC;IACD,6EAA6E;IAC7E,IAAW,mBAAmB,CAAC,KAAyB;QACtD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,oBAAoB,GAAG,SAAS,CAAC;YACtC,IAAI,CAAC,mBAAmB,GAAG,mBAAQ,CAAC,0BAA0B,CAAC;QACjE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,CAAC,mBAAmB,GAAG,KAAK,GAAG,KAAK,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,gFAAgF;IAChF,IAAW,mBAAmB;QAC5B,OAAO,IAAI,CAAC,oBAAoB,CAAC;IACnC,CAAC;IACD,mEAAmE;IACnE,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,oBAAoB,KAAK,SAAS,IAAI,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;IAClF,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,SAAoB;QACvC,IAAI,SAAS;YACX,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAChC,CAAC;IACD,8DAA8D;IACtD,cAAc,CAAC,QAAgB,EAAE,cAAsB,OAAO;QACpE,IAAI,QAAQ,GAAG,CAAC,WAAW;YACzB,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ,GAAG,GAAG,GAAG,WAAW;YAC9B,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0FAA0F;IACnF,iBAAiB;QACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;IACtC,CAAC;IACD;;;;;;;;;;;;OAYG;IACK,sBAAsB,CAC5B,GAAmB,EAAE,EAAU,EAAE,MAA2B,EAC5D,GAAmB,EAAE,EAAU,EAAE,MAA2B,EAC5D,QAAiB;QAEjB,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,EAAE,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxB,MAAM,OAAO,GAAG,yCAAmB,CAAC,gCAAgC,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YACzF,MAAM,OAAO,GAAG,yCAAmB,CAAC,gCAAgC,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YACzF,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;YACpD,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;YACpD,MAAM,IAAI,GAAG,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACrE,IAAI,QAAQ;gBACV,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACK,iBAAiB,CAAC,IAA6B,EAAE,QAAiB;QACxE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,EAAE,GAAG,IAAI,CAAC,mBAAmB;YAC/B,OAAO;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,QAAQ;YACV,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD;;;;;;;;;;;;;OAaG;IACK,sBAAsB,CAC5B,IAA6B,EAC7B,GAAmB,EAAE,UAAkB,EAAE,UAAkB,EAC3D,GAAmB,EAAE,UAAkB,EAAE,UAAkB,EAC3D,QAAiB;QAEjB,MAAM,eAAe,GAAG,mBAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC5F,MAAM,eAAe,GAAG,mBAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC5F,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,eAAe,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,eAAe,CAAC,CAAC;QACpD,MAAM,EAAE,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,EAAE,GAAG,IAAI,CAAC,mBAAmB;YAC/B,OAAO;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,yCAAmB,CAAC,gCAAgC,CAAC,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACpG,yCAAmB,CAAC,gCAAgC,CAAC,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACpG,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,QAAQ;YACV,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,oEAAoE;IAC5D,MAAM,CAAC,4BAA4B,CACzC,eAAwC,EACxC,SAAiB,EAAE,MAAe,EAClC,SAAiB,EAAE,OAAgB,EAAE,OAAgB,EACrD,kBAA0B;QAE1B,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,SAAS,GAAG,CAAC;YACf,SAAS,GAAG,CAAC,CAAC;aACX,IAAI,SAAS,GAAG,CAAC;YACpB,SAAS,GAAG,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACzE,MAAM,eAAe,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACzD,IAAI,eAAe,IAAI,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/E,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;YAC7E,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;YAC7E,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;;;;;OAWG;IACK,MAAM,CAAC,6BAA6B,CAC1C,EAAW,EAAE,EAAW,EACxB,EAAW,EAAE,EAAW,EACxB,kBAA0B;QAE1B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,IAAI,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,IAAI,GAAG,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5D,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,mDAAmD;YAC/F,MAAM,SAAS,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;YACxC,MAAM,SAAS,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;YACxC,OAAO,6CAAuB,CAAC,aAAa,CAC1C,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EACjG,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAClG,CAAC;QACJ,CAAC;QACD,4FAA4F;QAC5F,MAAM,eAAe,GAAG,IAAI,6CAAuB,EAAE,CAAC;QACtD,eAAe,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,kBAAkB,CAAC,CAAC,0CAA0C;QAC9F,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,MAAM,EAAE,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChD,IAAI,IAAI,GAAG,IAAI,IAAI,kBAAkB,GAAG,EAAE,EAAE,CAAC,CAAC,2BAA2B;YACvE,MAAM,SAAS,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YACpG,IAAI,IAAI,CAAC,4BAA4B,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC;gBAClG,QAAQ,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,IAAI,kBAAkB,GAAG,EAAE,EAAE,CAAC,CAAC,2BAA2B;YACvE,MAAM,SAAS,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YACpG,IAAI,IAAI,CAAC,4BAA4B,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC;gBAClG,QAAQ,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,MAAM,EAAE,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChD,IAAI,IAAI,GAAG,IAAI,IAAI,kBAAkB,GAAG,EAAE,EAAE,CAAC,CAAC,2BAA2B;YACvE,MAAM,SAAS,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YACrG,IAAI,IAAI,CAAC,4BAA4B,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC;gBAClG,QAAQ,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,IAAI,kBAAkB,GAAG,EAAE,EAAE,CAAC,CAAC,2BAA2B;YACvE,MAAM,SAAS,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YACrG,IAAI,IAAI,CAAC,4BAA4B,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC;gBAClG,QAAQ,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,GAAG,kBAAkB;YAChD,OAAO,SAAS,CAAC;QACnB,IAAI,QAAQ;YACV,eAAe,CAAC,WAAW,EAAE,CAAC;QAChC,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;;;;OAMG;IACK,+BAA+B,CAAC,GAAmB,EAAE,GAAmB,EAAE,QAAiB;QACjG,MAAM,EAAE,GAAG,yBAAyB,CAAC,WAAW,CAAC;QACjD,uGAAuG;QACvG,MAAM,WAAW,GAAG,CAAC,KAAqB,EAAE,EAAE,CAAC,KAAK,YAAY,aAAK,IAAI,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC;QAClG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;YACxE,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;YACzE,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IACD,+DAA+D;IACvD,uBAAuB,CAAC,GAAmB,EAAE,EAAU,EAAE,MAAe,EAAE,GAAmB,EAAE,QAAiB;QACtH,MAAM,MAAM,GAAG,GAAG,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,MAAM;YACR,IAAI,CAAC,sBAAsB,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC/F,CAAC;IACD;;;;;OAKG;IACK,qBAAqB,CAC3B,GAAmB,EAAE,OAAgB,EAAE,UAAkB,EAAE,OAAgB,EAAE,UAAkB,EAC/F,GAAmB,EAAE,OAAgB,EAAE,UAAkB,EAAE,OAAgB,EAAE,UAAkB,EAC/F,QAAiB;QAEjB,kDAAkD;QAClD,MAAM,QAAQ,GAAG,yBAAyB,CAAC,6BAA6B,CACtE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,mBAAmB,CAC7D,CAAC;QACF,uFAAuF;QACvF,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC/B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QAC5G,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACK,0CAA0C,CAChD,MAAe,EAAE,IAAa,EAAE,IAAW,EAC3C,QAA4H;QAE5H,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,sBAAsB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjE,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACjD,KAAK,MAAM,QAAQ,IAAI,CAAC,eAAe,EAAE,eAAe,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;YAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;YACzE,IAAI,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,oCAAoC;gBAC1E,MAAM,YAAY,GAAG,yBAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC9F,IAAI,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC;oBACjE,QAAQ,CAAC,YAAY,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;OASG;IACK,iBAAiB,CAAC,KAAoB,EAAE,IAAW,EAAE,QAAiB;QAC5E,4DAA4D;QAC5D,WAAW;QACX,+DAA+D;QAC/D,kCAAkC;QAClC,wGAAwG;QACxG,gFAAgF;QAChF,mBAAmB;QACnB,mBAAmB;QACnB,wBAAwB;QACxB,IAAI,iBAAiB,GAAG,KAAK,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB;QACnH,MAAM,IAAI,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB;QAClH,MAAM,KAAK,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB;QACpH,MAAM,OAAO,GAAG,IAAI,2CAAoB,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,2CAAoB,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,2CAAoB,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,2BAAa,CAAC,yCAAyC,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACtH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9H,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5F,IAAI,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,oCAAoC;gBAC1E,MAAM,YAAY,GAAG,yBAAW,CAAC,oCAAoC,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;gBAClH,IAAI,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE,CAAC;oBACpE,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;oBACnG,iBAAiB,GAAG,IAAI,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,iBAAiB;YACnB,OAAO;QACT,yEAAyE;QACzE,IAAI,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC5D,2CAA2C;QAC3C,2GAA2G;QAC3G,6EAA6E;QAC7E,IAAI,CAAC,0CAA0C,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,IAAI,EACpF,CAAC,YAAoB,EAAE,SAA8B,EAAE,WAAmB,EAAE,QAA6B,EAAE,EAAE,CAC3G,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,CAAC,CACrG,CAAC;IACJ,CAAC;IACD;;;;;;;OAOG;IACI,8BAA8B,CAAC,IAAW,EAAE,IAAW,EAAE,WAAoB,KAAK;QACvF,MAAM,eAAe,GAAG,IAAI,yCAAgC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACzE,oDAAoD;QACpD,MAAM,SAAS,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,oCAAoC;QAC9D,MAAM,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC;QAChC,MAAM,cAAc,GAAG,IAAI,wCAA+B,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC,CAAC,8CAA8C;QAChI,KAAK,IAAI,KAAK,GAAG,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;YAC1D,KAAK,IAAI,KAAK,GAAG,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;gBAC1D,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBACnC,IAAI,cAAc,CAAC,aAAa,EAAE,EAAE,CAAC;oBACnC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;oBACxC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;oBACxC,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,CAAC;wBACrE,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAChG,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,4CAA4C;IACpC,cAAc,CAAC,GAAU,EAAE,GAAU,EAAE,QAAiB;QAC9D,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,oBAAoB;YAC3B,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;YACnC,OAAO;QACT,uEAAuE;QACvE,IAAI,CAAC,+BAA+B,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACzD,gEAAgE;QAChE,IAAI,CAAC,8BAA8B,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IACD,6DAA6D;IACrD,wBAAwB,CAAC,IAAmB,EAAE,GAAiB,EAAE,QAAiB;QACxF,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,8BAA8B;YAC1D,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAE,qCAAqC;YACrG,GAAG,CAAC,YAAY,CAAC,+BAA+B,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC7D,GAAG,CAAC,YAAY,CAAC,+BAA+B,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;YACjE,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC1G,CAAC;IACH,CAAC;IACD,yDAAyD;IACjD,oBAAoB,CAAC,IAAW,EAAE,GAAiB,EAAE,QAAiB;QAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,oBAAoB;YAC3B,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;YACnC,OAAO;QACT,MAAM,EAAE,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACnD,MAAM,EAAE,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACnD,0BAA0B;QAC1B,MAAM,aAAa,GAAG,uBAAU,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACjG,KAAK,MAAM,YAAY,IAAI,aAAa;YACtC,IAAI,CAAC,iBAAiB,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QACjD,4DAA4D;QAC5D,MAAM,KAAK,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,GAAG,EAAE,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC;QAC7F,oEAAoE;QACpE,IAAI,CAAC,+BAA+B,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC1D,4DAA4D;QAC5D,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACnB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACjE,GAAG,CAAC,gBAAgB,CAAC,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;YACnC,IAAI,CAAC,0CAA0C,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAC1D,CAAC,YAAoB,EAAE,SAA8B,EAAE,WAAmB,EAAE,QAA6B,EAAE,EAAE;gBAC3G,MAAM,WAAW,GAAG,GAAG,CAAC,4CAA4C,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBACzF,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,GAAG,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YAClG,CAAC,CACF,CAAC;QACJ,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACK,wBAAwB,CAAC,CAAS,EAAE,CAAS,EAAE,KAAc;QACnE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,GAAG,IAAI,CAAC;aACX,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,GAAG,IAAI,CAAC;QAChB,wBAAwB;QACxB,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,IAAI,IAAI,CAAC;aACZ,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,IAAI,IAAI,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0DAA0D;IAClD,2BAA2B,CAAC,GAAiB,EAAE,GAAiB,EAAE,QAAiB;QACzF,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,oBAAoB;YAC3B,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;YACnC,OAAO;QACT,IAAI,KAAa,CAAC;QAClB,IAAI,KAAa,CAAC;QAClB,MAAM,OAAO,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;QAC7B,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YAC7B,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,GAAG,GAAG,CAAC;YACd,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YAClB,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACxB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;gBACtE,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;gBACf,GAAG,GAAG,GAAG,CAAC;gBACV,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBACzB,kEAAkE;gBAClE,OAAO,CAAC,OAAO,EAAE,CAAC;gBAClB,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC7B,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC7B,IAAI,IAAI,CAAC,oBAAoB;oBAC3B,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;gBACnD,IAAI,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC;oBACtC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACxB,KAAK,GAAG,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACrE,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,KAAK,GAAG,KAAK,EAAE,CAAC;wBACrF,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;wBACzB,KAAK,GAAG,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;wBACrE,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;wBACf,sFAAsF;wBACtF,oFAAoF;wBACpF,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;4BACvB,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;oBAC3G,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,8CAA8C;IACtC,uBAAuB,CAAC,KAAe,EAAE,YAAiC;QAChF,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO;QACtC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,YAAY,iCAAe,CAAC;YAClE,OAAO;QACT,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1B,YAAY,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,UAAU;IACrC,CAAC;IACD,oFAAoF;IAC5E,mCAAmC,CAAC,KAAe,EAAE,YAAiC;QAC5F,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,YAAY,yDAA2B,CAAC;YAC/E,OAAO;QACT,IAAI,KAAK,YAAY,yDAA2B;YAC9C,IAAA,qBAAM,EAAC,KAAK,EAAE,uDAAuD,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1B,YAAY,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAClD,YAAY,CAAC,OAAO,CAAC,CAAC,IAA6B,EAAE,EAAE;YACrD,yDAA2B,CAAC,qCAAqC,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YAC1F,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QACH,WAAW,CAAC,OAAO,CAAC,CAAC,IAA6B,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACrF,CAAC;IACD,sFAAsF;IAC9E,aAAa,CAAC,KAAgB;QACpC,OAAO,KAAK,YAAY,iCAAkB,IAAI,KAAK,YAAY,uCAAkB,CAAC;IACpF,CAAC;IACD;;;;;;;OAOG;IACK,4BAA4B,CAClC,KAAgC,EAAE,MAAsB,EAAE,MAAsB,EAAE,QAAQ,GAAG,KAAK;QAElG,MAAM,kBAAkB,GAAG,IAAI,yCAAgC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAChF,MAAM,cAAc,GAAG,IAAI,wCAA+B,CAAC,kBAAkB,EAAE,EAAE,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,WAAW;QACtH,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YACvD,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YACvD,IAAA,qBAAM,EAAC,OAAO,CAAC,KAAK,YAAY,2BAAY,EAAE,kCAAkC,CAAC,CAAC;YAClF,cAAc,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,oFAAoF;YAC9I,IAAI,cAAc,CAAC,aAAa,EAAE,EAAE,CAAC;gBACnC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;gBACxC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;gBACxC,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC;oBAClE,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YACtG,CAAC,CAAC,6BAA6B;QACjC,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACK,WAAW,CAAC,KAAqB,EAAE,OAAuB,EAAE,MAAqB;QACvF,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,2BAAY,CAAC,MAAM,EAAE,CAAC;QACnD,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAC/B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,4FAA4F;IACpF,mCAAmC,CAAC,MAAsB,EAAE,GAAiB,EAAE,QAAiB;QACtG,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC,uBAAuB;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAC9B,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,0CAA0C;QAC1G,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,iDAAiD;QAC/E,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,2FAA2F;YAC3F,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ;gBAChC,MAAM,CAAC,WAAW,EAAE,CAAC;QACzB,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC;QACnC,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QACrD,WAAW,CAAC,OAAO,CAAC,CAAC,IAA6B,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,0BAA0B;QAC9G,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;;;OAKG;IACK,yBAAyB,CAAC,MAAsB,EAAE,MAAsB,EAAE,QAAiB;QACjG,0GAA0G;QAC1G,MAAM,aAAa,GAAG,uBAAU,CAAC,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACtG,KAAK,MAAM,YAAY,IAAI,aAAa;YACtC,IAAI,CAAC,iBAAiB,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QACjD,mHAAmH;QACnH,IAAI,GAAG,GAAG,MAAM,CAAC;QACjB,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;YAC5B,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,mCAAmC,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC3E,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACnE,IAAI,MAAM,YAAY,2BAAY,EAAE,CAAC,CAAC,8DAA8D;YAClG,MAAM,KAAK,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,GAAG,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;YACrE,MAAM,EAAE,GAAG,yBAAyB,CAAC,aAAa,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACtG,CAAC;QACD,IAAI,CAAC,+BAA+B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IACjE,CAAC;IACD,0DAA0D;IAC1C,mBAAmB,CAAC,QAAuB;QACzD,IAAI,IAAI,CAAC,UAAU,YAAY,6BAAa,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;YACjC,IAAI,CAAC,qBAAqB,CACxB,QAAQ,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAC1D,QAAQ,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAC1D,KAAK,CACN,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,2BAAY,EAAE,CAAC;YACnD,IAAI,CAAC,wBAAwB,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAClE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,aAAK,EAAE,CAAC;YAC5C,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC3D,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACnE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9E,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAClE,IAAI,CAAC,mCAAmC,CAAC,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1F,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6DAA6D;IAC7C,kBAAkB,CAAC,GAAiB;QAClD,IAAI,IAAI,CAAC,UAAU,YAAY,6BAAa,EAAE,CAAC;YAC7C,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAC5D,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,2BAAY,EAAE,CAAC;YACnD,IAAI,CAAC,2BAA2B,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAChE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,aAAK,EAAE,CAAC;YAC5C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,yBAAyB,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACxE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAClE,IAAI,CAAC,mCAAmC,CAAC,GAAG,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,sDAAsD;IACtC,WAAW,CAAC,IAAW;QACrC,IAAI,IAAI,CAAC,UAAU,YAAY,6BAAa,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,2BAAY,EAAE,CAAC;YACnD,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC1D,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,aAAK,EAAE,CAAC;YAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACpD,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAClE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAClE,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,gEAAgE;IAChD,oBAAoB,CAAC,MAAsB;QACzD,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAC3D,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACzF,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,+BAAc,EAAE,CAAC;YACrD,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAChE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+DAA+D;IAC/C,sBAAsB,CAAC,MAA0B;QAC/D,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAC3D,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3F,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,+BAAc,EAAE,CAAC;YACrD,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAChE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IAC9D,iCAAiC,CAAC,KAAkC;QAClF,KAAK,CAAC,iCAAiC,CAAC,KAAK,CAAC,CAAC;QAC/C,kIAAkI;QAClI,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAClD,YAAY,CAAC,OAAO,CAAC,CAAC,IAA6B,EAAE,EAAE;YACrD,yDAA2B,CAAC,qCAAqC,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC1F,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC;IACD,8EAA8E;IAC9D,qBAAqB,CAAC,MAAuB;QAC3D,oEAAoE;QACpE,OAAO,SAAS,CAAC;IACnB,CAAC;;AAzvBH,8DA0vBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { assert, DuplicatePolicy, SortedArray } from \"@itwin/core-bentley\";\nimport { BSplineCurve3d, BSplineCurve3dBase } from \"../../bspline/BSplineCurve\";\nimport { BSplineCurve3dH } from \"../../bspline/BSplineCurve3dH\";\nimport { Geometry } from \"../../Geometry\";\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\nimport { GrowableFloat64Array } from \"../../geometry3d/GrowableFloat64Array\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { CurveCurveCloseApproachXYRRtoRRD, Newton2dUnboundedWithDerivative } from \"../../numerics/Newton\";\nimport { AnalyticRoots } from \"../../numerics/Polynomials\";\nimport { SmallSystem } from \"../../numerics/SmallSystem\";\nimport { Arc3d } from \"../Arc3d\";\nimport { CurveChainWithDistanceIndex } from \"../CurveChainWithDistanceIndex\";\nimport { CurveCollection } from \"../CurveCollection\";\nimport { CurveCurve } from \"../CurveCurve\";\nimport { CurveIntervalRole, CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { AnyCurve } from \"../CurveTypes\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { ProxyCurve } from \"../ProxyCurve\";\nimport { TransitionSpiral3d } from \"../spiral/TransitionSpiral3d\";\nimport { StrokeOptions } from \"../StrokeOptions\";\n\n// cspell:word XYRR currentdFdX\n\n/**\n * Handler class for XY close approach between _geometryB and another geometry.\n * * Approach means the XY distance (z is ignored) between _geometryB and another geometry.\n * * Closest approach is a measure of the proximity of one curve to another. It's the length of the shortest line\n * segment perpendicular to both curves; if the curves intersect, the closest approach is zero. In the context of\n * this class, z-coordinates are ignored, so the closest approach is as seen in the top view. If you have coplanar\n * input curves and want to find closest approach in their plane, rotate them first into a plane parallel to the\n * xy-plane, then afterward, rotate the results back as required.\n * * Close approach can also be from a curve endpoint perpendicular to another curve or from a curve endpoint to\n * another curve endpoint.\n * * Instances are initialized and called from CurveCurve.\n * * geometryB is saved for later reference.\n * @internal\n */\nexport class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHandler {\n  private _geometryB: AnyCurve | undefined;\n  /**\n   * Maximum XY distance (z is ignored). Approach larger than this is not interesting.\n   * This is caller defined and can be undefined.\n   */\n  private _maxDistanceToAccept: number | undefined;\n  /** Squared max distance. Default is [[Geometry.smallMetricDistanceSquared]]. */\n  private _maxDistanceSquared: number;\n  private _xyTolerance: number;\n  private _newtonTolerance: number;\n  /**\n   * Start and end points of line segments that meet closest approach criteria, i.e., they are perpendicular to\n   * both curves and their length is smaller than _maxDistanceToAccept.\n   */\n  private _results: SortedArray<CurveLocationDetailPair>;\n\n  private static _workPointAA0 = Point3d.create();\n  private static _workPointAA1 = Point3d.create();\n  private static _workPointBB0 = Point3d.create();\n  private static _workPointBB1 = Point3d.create();\n  private static _workPointB = Point3d.create();\n\n  /**\n   * Constructor.\n   * @param geometryB second curve for intersection. Saved for reference by specific handler methods.\n   * @param xyTolerance optional tolerance for comparing xy points (default [[Geometry.smallMetricDistance]]).\n   * @param newtonTolerance optional relative fraction tolerance for Newton iteration (default [[Geometry.smallNewtonStep]]).\n   */\n  public constructor(geometryB?: AnyCurve, xyTolerance: number = Geometry.smallMetricDistance, newtonTolerance: number = Geometry.smallNewtonStep) {\n    super();\n    this._geometryB = geometryB instanceof ProxyCurve ? geometryB.proxyCurve : geometryB;\n    this._maxDistanceSquared = Geometry.smallMetricDistanceSquared;\n    this._xyTolerance = xyTolerance;\n    this._newtonTolerance = newtonTolerance;\n    const compare = CurveLocationDetailPair.comparePairsByPoints(xyTolerance, true);\n    this._results = new SortedArray<CurveLocationDetailPair>(compare, DuplicatePolicy.Retain);\n  }\n  /** Set the (possibly undefined) max XY distance (z is ignored) to accept. */\n  public set maxDistanceToAccept(value: number | undefined) {\n    if (value === undefined) {\n      this._maxDistanceToAccept = undefined;\n      this._maxDistanceSquared = Geometry.smallMetricDistanceSquared;\n    } else {\n      this._maxDistanceToAccept = Math.abs(value);\n      this._maxDistanceSquared = value * value;\n    }\n  }\n  /** Access the (possibly undefined) max XY distance (z is ignored) to accept. */\n  public get maxDistanceToAccept(): number | undefined {\n    return this._maxDistanceToAccept;\n  }\n  /** Ask if the maxDistanceToAccept value is defined and positive */\n  public get isMaxDistanceSet(): boolean {\n    return this._maxDistanceToAccept !== undefined && this._maxDistanceToAccept > 0;\n  }\n  /**\n   * Reset the geometry.\n   * * Undefined inputs are ignored.\n   * * All other instance data is unchanged, including accumulated intersections.\n   */\n  public resetGeometry(geometryB?: AnyCurve) {\n    if (geometryB)\n      this._geometryB = geometryB;\n  }\n  /** returns true if `fraction` is in [0,1] within tolerance */\n  private acceptFraction(fraction: number, fractionTol: number = 1.0e-12) {\n    if (fraction < -fractionTol)\n      return false;\n    if (fraction > 1.0 + fractionTol)\n      return false;\n    return true;\n  }\n  /** Extract (and clear) the results, structured as an array of CurveLocationDetailPair. */\n  public grabPairedResults(): CurveLocationDetailPair[] {\n    return this._results.extractArray();\n  }\n  /**\n   * Create and record a close-approach pair from raw curve/fraction/point data.\n   * * If points are undefined, they are computed from the fractions via `fractionToPoint`.\n   * * Fractions are global (i.e., relative to the full curve, not a sub-segment).\n   * * The pair is recorded only if the XY distance is within `_maxDistanceSquared`.\n   * @param cpA first curve\n   * @param fA global fraction on cpA\n   * @param pointA point on cpA at fA, or undefined to compute from fA\n   * @param cpB second curve\n   * @param fB global fraction on cpB\n   * @param pointB point on cpB at fB, or undefined to compute from fB\n   * @param reversed if true, swap detailA and detailB before recording\n   */\n  private testAndRecordPointPair(\n    cpA: CurvePrimitive, fA: number, pointA: Point3d | undefined,\n    cpB: CurvePrimitive, fB: number, pointB: Point3d | undefined,\n    reversed: boolean\n  ): void {\n    if (!pointA)\n      pointA = cpA.fractionToPoint(fA);\n    if (!pointB)\n      pointB = cpB.fractionToPoint(fB);\n    const d2 = pointA.distanceSquaredXY(pointB);\n    if (d2 <= this._maxDistanceSquared) {\n      const d = Math.sqrt(d2);\n      const detailA = CurveLocationDetail.createCurveFractionPointDistance(cpA, fA, pointA, d);\n      const detailB = CurveLocationDetail.createCurveFractionPointDistance(cpB, fB, pointB, d);\n      detailA.setIntervalRole(CurveIntervalRole.isolated);\n      detailB.setIntervalRole(CurveIntervalRole.isolated);\n      const pair = CurveLocationDetailPair.createCapture(detailA, detailB);\n      if (reversed)\n        pair.swapDetails();\n      this._results.insert(pair);\n    }\n  }\n  /**\n   * Record a pre-built close-approach pair with global fractions already set.\n   * * Computes and stores the XY distance on both details.\n   * * The pair is recorded only if the XY distance is within `_maxDistanceSquared`.\n   * @param pair details with global fractions and points already set; modified in place\n   * @param reversed if true, swap detailA and detailB before recording\n   */\n  private testAndRecordPair(pair: CurveLocationDetailPair, reversed: boolean) {\n    const d2 = pair.detailA.point.distanceSquaredXY(pair.detailB.point);\n    if (d2 > this._maxDistanceSquared)\n      return;\n    const d = Math.sqrt(d2);\n    pair.detailA.a = pair.detailB.a = d;\n    pair.detailA.setIntervalRole(CurveIntervalRole.isolated);\n    pair.detailB.setIntervalRole(CurveIntervalRole.isolated);\n    if (reversed)\n      pair.swapDetails();\n    this._results.insert(pair);\n  }\n  /**\n   * Convert a close-approach pair from local (sub-segment) fractions to global fractions, then record it.\n   * * Local fractions in the pair are interpolated into the global fraction ranges.\n   * * Points are recomputed from the parent curves at the global fractions.\n   * * The pair is recorded only if the XY distance is within `_maxDistanceSquared`.\n   * @param pair local details (curve unspecified); modified in place with global fractions, curves, and points\n   * @param cpA parent curve A\n   * @param fractionA0 global fraction corresponding to local fraction 0 on curve A\n   * @param fractionA1 global fraction corresponding to local fraction 1 on curve A\n   * @param cpB parent curve B\n   * @param fractionB0 global fraction corresponding to local fraction 0 on curve B\n   * @param fractionB1 global fraction corresponding to local fraction 1 on curve B\n   * @param reversed if true, swap detailA and detailB before recording\n   */\n  private testAndRecordLocalPair(\n    pair: CurveLocationDetailPair,\n    cpA: CurvePrimitive, fractionA0: number, fractionA1: number,\n    cpB: CurvePrimitive, fractionB0: number, fractionB1: number,\n    reversed: boolean,\n  ) {\n    const globalFractionA = Geometry.interpolate(fractionA0, pair.detailA.fraction, fractionA1);\n    const globalFractionB = Geometry.interpolate(fractionB0, pair.detailB.fraction, fractionB1);\n    const pointA = cpA.fractionToPoint(globalFractionA);\n    const pointB = cpB.fractionToPoint(globalFractionB);\n    const d2 = pointA.distanceSquaredXY(pointB);\n    if (d2 > this._maxDistanceSquared)\n      return;\n    const d = Math.sqrt(d2);\n    CurveLocationDetail.createCurveFractionPointDistance(cpA, globalFractionA, pointA, d, pair.detailA);\n    CurveLocationDetail.createCurveFractionPointDistance(cpB, globalFractionB, pointB, d, pair.detailB);\n    pair.detailA.setIntervalRole(CurveIntervalRole.isolated);\n    pair.detailB.setIntervalRole(CurveIntervalRole.isolated);\n    if (reversed)\n      pair.swapDetails();\n    this._results.insert(pair);\n  }\n  /** Modify the current closest approach if the inputs are closer. */\n  private static updatePointToSegmentDistance(\n    closestApproach: CurveLocationDetailPair,\n    fractionA: number, pointA: Point3d,\n    fractionB: number, pointB0: Point3d, pointB1: Point3d,\n    maxDistanceSquared: number,\n  ): boolean {\n    let updated = false;\n    if (fractionB < 0)\n      fractionB = 0;\n    else if (fractionB > 1)\n      fractionB = 1;\n    const pointB = pointB0.interpolate(fractionB, pointB1, this._workPointB);\n    const distanceSquared = pointB.distanceSquaredXY(pointA);\n    if (distanceSquared <= Math.min(maxDistanceSquared, closestApproach.detailA.a)) {\n      closestApproach.detailA.setFP(fractionA, pointA, undefined, distanceSquared);\n      closestApproach.detailB.setFP(fractionB, pointB, undefined, distanceSquared);\n      updated = true;\n    }\n    return updated;\n  }\n  /**\n   * Return fractions of close approach within maxDistance between two line segments (a0,a1) and (b0,b1).\n   * * Math details can be found at core/geometry/internaldocs/Curve.md\n   * @param a0 start point of line a\n   * @param a1 end point of line a\n   * @param b0 start point of line b\n   * @param b1 end point of line b\n   * @param maxDistanceSquared maximum distance squared (assumed to be positive)\n   * @returns a pair of details for the closest approach, or `undefined` if no approach is within `maxDistanceSquared`.\n    * `detailA.fraction` is the fraction on segment a; `detailB.fraction` is the fraction on segment b. Returned\n    * details store the *squared* distance in the `a` property.\n   */\n  private static segmentSegmentBoundedApproach(\n    a0: Point3d, a1: Point3d,\n    b0: Point3d, b1: Point3d,\n    maxDistanceSquared: number,\n  ): CurveLocationDetailPair | undefined {\n    const ux = a1.x - a0.x;\n    const uy = a1.y - a0.y;\n    const vx = b1.x - b0.x;\n    const vy = b1.y - b0.y;\n    const e00x = b0.x - a0.x;\n    const e00y = b0.y - a0.y;\n    const e01x = b1.x - a0.x;\n    const e01y = b1.y - a0.y;\n    const e10x = b0.x - a1.x;\n    const e10y = b0.y - a1.y;\n    const hab0 = Geometry.crossProductXYXY(ux, uy, e00x, e00y);\n    const hab1 = Geometry.crossProductXYXY(ux, uy, e01x, e01y);\n    const hba0 = -Geometry.crossProductXYXY(vx, vy, e00x, e00y);\n    const hba1 = -Geometry.crossProductXYXY(vx, vy, e10x, e10y);\n    if (hab0 * hab1 < 0.0 && hba0 * hba1 < 0.0) { // true intersection, strictly within both segments\n      const fractionA = -hba0 / (hba1 - hba0);\n      const fractionB = -hab0 / (hab1 - hab0);\n      return CurveLocationDetailPair.createCapture(\n        CurveLocationDetail.createCurveFractionPoint(undefined, fractionA, a0.interpolate(fractionA, a1)),\n        CurveLocationDetail.createCurveFractionPoint(undefined, fractionB, b0.interpolate(fractionB, b1)),\n      );\n    }\n    // there's no intersection, so find the closest approach within maxDistance from an endpoint\n    const closestApproach = new CurveLocationDetailPair();\n    closestApproach.detailA.a = 2 * maxDistanceSquared; // init to an approach that's too far away\n    let reversed = false;\n    const uu = Geometry.hypotenuseSquaredXY(ux, uy);\n    if (hab0 * hab0 <= maxDistanceSquared * uu) { // test distance of b0 to u\n      const fractionA = Geometry.safeDivideFraction(Geometry.dotProductXYXY(ux, uy, e00x, e00y), uu, 0.0);\n      if (this.updatePointToSegmentDistance(closestApproach, 0, b0, fractionA, a0, a1, maxDistanceSquared))\n        reversed = true;\n    }\n    if (hab1 * hab1 <= maxDistanceSquared * uu) { // test distance of b1 to u\n      const fractionA = Geometry.safeDivideFraction(Geometry.dotProductXYXY(ux, uy, e01x, e01y), uu, 0.0);\n      if (this.updatePointToSegmentDistance(closestApproach, 1, b1, fractionA, a0, a1, maxDistanceSquared))\n        reversed = true;\n    }\n    const vv = Geometry.hypotenuseSquaredXY(vx, vy);\n    if (hba0 * hba0 <= maxDistanceSquared * vv) { // test distance of a0 to v\n      const fractionB = Geometry.safeDivideFraction(-Geometry.dotProductXYXY(vx, vy, e00x, e00y), vv, 0.0);\n      if (this.updatePointToSegmentDistance(closestApproach, 0, a0, fractionB, b0, b1, maxDistanceSquared))\n        reversed = false;\n    }\n    if (hba1 * hba1 <= maxDistanceSquared * vv) { // test distance of a1 to v\n      const fractionB = Geometry.safeDivideFraction(-Geometry.dotProductXYXY(vx, vy, e10x, e10y), vv, 0.0);\n      if (this.updatePointToSegmentDistance(closestApproach, 1, a1, fractionB, b0, b1, maxDistanceSquared))\n        reversed = false;\n    }\n    if (closestApproach.detailA.a > maxDistanceSquared)\n      return undefined;\n    if (reversed)\n      closestApproach.swapDetails();\n    return closestApproach;\n  }\n  /**\n   * Compute closest approaches from the endpoints of each curve (if open) to the other curve.\n   * Record a [[CurveLocationDetailPair]] if such a distance is less than [[maxDistance]].\n   * @param cpA curveA\n   * @param cpB curveB\n   * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to curveA).\n   */\n  private testAndRecordEndPointApproaches(cpA: CurvePrimitive, cpB: CurvePrimitive, reversed: boolean): void {\n    const pt = CurveCurveCloseApproachXY._workPointB;\n    // in closest approach context, endpoints of full sweep arcs are artificial locations, and thus ignored\n    const isClosedArc = (curve: CurvePrimitive) => curve instanceof Arc3d && curve.sweep.isFullCircle;\n    if (!isClosedArc(cpA)) {\n      this.testAndRecordProjection(cpA, 0, cpA.startPoint(pt), cpB, reversed);\n      this.testAndRecordProjection(cpA, 1, cpA.endPoint(pt), cpB, reversed);\n    }\n    if (!isClosedArc(cpB)) {\n      this.testAndRecordProjection(cpB, 0, cpB.startPoint(pt), cpA, !reversed);\n      this.testAndRecordProjection(cpB, 1, cpB.endPoint(pt), cpA, !reversed);\n    }\n  }\n  /** Find the closest xy approach between `pointA` and `cpB`. */\n  private testAndRecordProjection(cpA: CurvePrimitive, fA: number, pointA: Point3d, cpB: CurvePrimitive, reversed: boolean): void {\n    const detail = cpB.closestPointXY(pointA);\n    if (detail)\n      this.testAndRecordPointPair(cpA, fA, pointA, cpB, detail.fraction, detail.point, reversed);\n  }\n  /**\n   * Compute closest xy approach of two line segments.\n   * Filter by extension rules.\n   * Record with fraction mapping.\n   * * The fraction mappings allow portions of a linestring to be passed here.\n   */\n  private computeSegmentSegment(\n    cpA: CurvePrimitive, pointA0: Point3d, fractionA0: number, pointA1: Point3d, fractionA1: number,\n    cpB: CurvePrimitive, pointB0: Point3d, fractionB0: number, pointB1: Point3d, fractionB1: number,\n    reversed: boolean,\n  ): void {\n    // compute a pair with fractions local to segments\n    const approach = CurveCurveCloseApproachXY.segmentSegmentBoundedApproach(\n      pointA0, pointA1, pointB0, pointB1, this._maxDistanceSquared,\n    );\n    // adjust the pair to refer to input curves and global fractions, then record it if new\n    if (approach) {\n      approach.detailA.setCurve(cpA);\n      approach.detailB.setCurve(cpB);\n      this.testAndRecordLocalPair(approach, cpA, fractionA0, fractionA1, cpB, fractionB0, fractionB1, reversed);\n    }\n  }\n  /**\n   * Compute the perpendiculars between a line segment and an arc, without extending either curve.\n   * * One or two perpendiculars will be found.\n   * * Each perpendicular segment starts or ends on the arc where the arc tangent is parallel to the line tangent.\n   * @param startA line segment start point\n   * @param endA line segment end point\n   * @param arcB the arc\n   * @param announce callback to receive line and arc fractions and optional points of each perpendicular segment computed.\n   */\n  private announceAllPerpendicularsSegmentArcBounded(\n    startA: Point3d, endA: Point3d, arcB: Arc3d,\n    announce: (lineFraction: number, linePoint: Point3d | undefined, arcFraction: number, arcPoint: Point3d | undefined) => void,\n  ): void {\n    const dotUT = arcB.vector0.crossProductStartEndXY(startA, endA);\n    const dotVT = arcB.vector90.crossProductStartEndXY(startA, endA);\n    const parallelRadians = Math.atan2(dotVT, dotUT);\n    for (const radians1 of [parallelRadians, parallelRadians + Math.PI]) {\n      const arcPoint = arcB.radiansToPoint(radians1);\n      const arcFraction = arcB.sweep.radiansToSignedPeriodicFraction(radians1);\n      if (this.acceptFraction(arcFraction)) { // reject solution outside arc sweep\n        const lineFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(startA, endA, arcPoint);\n        if (lineFraction !== undefined && this.acceptFraction(lineFraction))\n          announce(lineFraction, undefined, arcFraction, arcPoint);\n      }\n    }\n  }\n  /**\n   * Find close approaches within maxDistance between a line segment and an arc.\n   * To consider:\n   * 1) intersection between arc and segment.\n   * 2) endpoints to endpoints, or endpoints projection to the other curve.\n   * 3) arc tangent parallel to line segment\n   * @param lineA the line segment\n   * @param arcB the arc\n   * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to arcA).\n   */\n  private computeSegmentArc(lineA: LineSegment3d, arcB: Arc3d, reversed: boolean): void {\n    // 1) intersection between arc and line segment (or string).\n    // Suppose:\n    // Arc: X = C + cU + sV where c = cos(theta) and s = sin(theta)\n    // Line: contains points A0 and A1\n    // The arc intersects the line at point X if det(A0, A1, X) = 0 with homogeneous xyw points and vectors.\n    // With equational X:  det(A0, A1, C) + c*det(A0, A1, U) + s*det(A0, A1, V) = 0.\n    // solve for theta.\n    // evaluate points.\n    // project back to line.\n    let intersectionFound = false;\n    const data = arcB.toTransformedVectors();\n    const alpha = Geometry.tripleProductXYW(lineA.point0Ref, 1, lineA.point1Ref, 1, data.center, 1); //  det(A0, A1, C)\n    const beta = Geometry.tripleProductXYW(lineA.point0Ref, 1, lineA.point1Ref, 1, data.vector0, 0); // det(A0, A1, U)\n    const gamma = Geometry.tripleProductXYW(lineA.point0Ref, 1, lineA.point1Ref, 1, data.vector90, 0); // det(A0, A1, V)\n    const cosines = new GrowableFloat64Array(2);\n    const sines = new GrowableFloat64Array(2);\n    const radians = new GrowableFloat64Array(2);\n    const numRoots = AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);\n    for (let i = 0; i < numRoots; i++) {\n      const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));\n      const arcFraction = data.sweep.radiansToSignedPeriodicFraction(radians.atUncheckedIndex(i));\n      if (this.acceptFraction(arcFraction)) { // reject solution outside arc sweep\n        const lineFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(lineA.point0Ref, lineA.point1Ref, arcPoint);\n        if (lineFraction !== undefined && this.acceptFraction(lineFraction)) {\n          this.testAndRecordPointPair(lineA, lineFraction, undefined, arcB, arcFraction, arcPoint, reversed);\n          intersectionFound = true;\n        }\n      }\n    }\n    if (intersectionFound)\n      return;\n    // 2) endpoints to endpoints, or endpoints projection to the other curve.\n    this.testAndRecordEndPointApproaches(lineA, arcB, reversed);\n    // 3) arc tangent parallel to line segment.\n    // If line does not intersect the arc, then the closest (and/or the furthest) point on arc to the line is a\n    // point where the tangent line on arc at that point is parallel to the line.\n    this.announceAllPerpendicularsSegmentArcBounded(lineA.point0Ref, lineA.point1Ref, arcB,\n      (lineFraction: number, linePoint: Point3d | undefined, arcFraction: number, arcPoint: Point3d | undefined) =>\n        this.testAndRecordPointPair(lineA, lineFraction, linePoint, arcB, arcFraction, arcPoint, reversed),\n    );\n  }\n  /**\n   * Compute segments perpendicular to two elliptical arcs, without extending either curve.\n   * * Perpendiculars from an endpoint are not explicitly computed.\n   * * Intersections are also found by this search: they are reported as zero-length segments.\n   * @param arcA first arc\n   * @param arcB second arc\n   * @param reversed swap the details in the recorded pair (default: false)\n   */\n  public allPerpendicularsArcArcBounded(arcA: Arc3d, arcB: Arc3d, reversed: boolean = false): void {\n    const newtonEvaluator = new CurveCurveCloseApproachXYRRtoRRD(arcA, arcB);\n    // HEURISTIC: 2 ellipses have up to 8 perpendiculars\n    const seedDelta = 1 / 10; // denominator 9 fails the unit test\n    const seedStart = seedDelta / 2;\n    const newtonSearcher = new Newton2dUnboundedWithDerivative(newtonEvaluator, 100); // observed convergence to 1.0e-11 in 49 iters\n    for (let seedU = seedStart; seedU < 1; seedU += seedDelta) {\n      for (let seedV = seedStart; seedV < 1; seedV += seedDelta) {\n        newtonSearcher.setUV(seedU, seedV);\n        if (newtonSearcher.runIterations()) {\n          const fractionA = newtonSearcher.getU();\n          const fractionB = newtonSearcher.getV();\n          if (this.acceptFraction(fractionA) && this.acceptFraction(fractionB)) {\n            this.testAndRecordPointPair(arcA, fractionA, undefined, arcB, fractionB, undefined, reversed);\n          }\n        }\n      }\n    }\n  }\n  /** Low level dispatch of arc with Arc3d. */\n  private dispatchArcArc(cpA: Arc3d, cpB: Arc3d, reversed: boolean): void {\n    const rangeA = cpA.range();\n    const rangeB = cpB.range();\n    if (this._maxDistanceToAccept)\n      rangeA.expandInPlace(this._maxDistanceToAccept);\n    if (!rangeB.intersectsRangeXY(rangeA))\n      return;\n    // 1) endpoints to endpoints or endpoints projection to the other curve\n    this.testAndRecordEndPointApproaches(cpA, cpB, reversed);\n    // 2) perpendicular line between 2 arcs (includes intersections)\n    this.allPerpendicularsArcArcBounded(cpA, cpB, reversed);\n  }\n  /** Detail computation for segment approaching linestring. */\n  private computeSegmentLineString(segA: LineSegment3d, lsB: LineString3d, reversed: boolean): void {\n    const numB = lsB.numPoints();\n    const deltaFracB = Geometry.safeDivideFraction(1, numB - 1, 0);\n    const pointA0 = segA.point0Ref;\n    const pointA1 = segA.point1Ref;\n    const pointB0 = CurveCurveCloseApproachXY._workPointBB0;\n    const pointB1 = CurveCurveCloseApproachXY._workPointBB1;\n    for (let i = 0; i < numB - 1; ++i) {\n      const fB0 = i * deltaFracB; // global linestring fractions\n      const fB1 = (i + 1 === numB - 1) ? 1.0 : (i + 1) * deltaFracB;  // make sure we nail the end fraction\n      lsB.packedPoints.getPoint3dAtUncheckedPointIndex(i, pointB0);\n      lsB.packedPoints.getPoint3dAtUncheckedPointIndex(i + 1, pointB1);\n      this.computeSegmentSegment(segA, pointA0, 0.0, pointA1, 1.0, lsB, pointB0, fB0, pointB1, fB1, reversed);\n    }\n  }\n  /** Detail computation for arc approaching linestring. */\n  private computeArcLineString(arcA: Arc3d, lsB: LineString3d, reversed: boolean): void {\n    const rangeA = arcA.range();\n    const rangeB = lsB.range();\n    if (this._maxDistanceToAccept)\n      rangeA.expandInPlace(this._maxDistanceToAccept);\n    if (!rangeB.intersectsRangeXY(rangeA))\n      return;\n    const v0 = CurveCurveCloseApproachXY._workPointBB0;\n    const v1 = CurveCurveCloseApproachXY._workPointBB1;\n    // 1. record intersections\n    const intersections = CurveCurve.intersectionXYPairs(arcA, false, lsB, false, this._xyTolerance);\n    for (const intersection of intersections)\n      this.testAndRecordPair(intersection, reversed);\n    // 2. record linestring interior vertex projections onto arc\n    const fStep = Geometry.safeDivideFraction(1.0, lsB.numEdges(), 0);\n    for (let i = 1; i < lsB.numEdges(); ++i)\n      this.testAndRecordProjection(lsB, i * fStep, lsB.pointAtUnchecked(i, v0), arcA, !reversed);\n    // 3. record arc/linestring endpoint projections onto linestring/arc\n    this.testAndRecordEndPointApproaches(arcA, lsB, reversed);\n    // 4. record perpendiculars from within a segment to the arc\n    lsB.startPoint(v0);\n    for (let iSeg = 0; iSeg < lsB.numEdges(); ++iSeg, v0.setFrom(v1)) {\n      lsB.pointAtUnchecked(iSeg + 1, v1);\n      this.announceAllPerpendicularsSegmentArcBounded(v0, v1, arcA,\n        (lineFraction: number, linePoint: Point3d | undefined, arcFraction: number, arcPoint: Point3d | undefined) => {\n          const fLineString = lsB.segmentIndexAndLocalFractionToGlobalFraction(iSeg, lineFraction);\n          this.testAndRecordPointPair(arcA, arcFraction, arcPoint, lsB, fLineString, linePoint, reversed);\n        },\n      );\n    }\n  }\n  /**\n   * Set bits for comparison to range xy\n   * * bit 0x01 => x smaller than range.low.x\n   * * bit 0x02 => x larger than range.high.x\n   * * bit 0x04 => y smaller than range.low.y\n   * * bit 0x08 => y larger than range.high.y\n   * * If we divide XY plane into 9 areas using the range, the function returns 0 for points\n   * inside the range. Below is other binary numbers returned by the function for all 9 areas:\n   *   1001 | 1000 | 1010\n   *   ------------------\n   *    1   |  0   |  10\n   *   ------------------\n   *   101  | 100  | 110\n   * @param xy point to test\n   * @param range range for comparison\n   */\n  private classifyBitsPointRangeXY(x: number, y: number, range: Range3d): number {\n    let result = 0;\n    if (x < range.low.x)\n      result = 0x01;\n    else if (x > range.high.x)\n      result = 0x02;\n    // note the OR operation\n    if (y < range.low.y)\n      result |= 0x04;\n    else if (y > range.high.y)\n      result |= 0x08;\n    return result;\n  }\n  /** Low level dispatch of line string with line string. */\n  private computeLineStringLineString(lsA: LineString3d, lsB: LineString3d, reversed: boolean): void {\n    const rangeA = lsA.range();\n    const rangeB = lsB.range();\n    if (this._maxDistanceToAccept)\n      rangeA.expandInPlace(this._maxDistanceToAccept);\n    if (!rangeB.intersectsRangeXY(rangeA))\n      return;\n    let bitB0: number;\n    let bitB1: number;\n    const rangeA1 = Range3d.createNull();\n    const pointA0 = CurveCurveCloseApproachXY._workPointAA0;\n    const pointA1 = CurveCurveCloseApproachXY._workPointAA1;\n    const pointB0 = CurveCurveCloseApproachXY._workPointBB0;\n    const pointB1 = CurveCurveCloseApproachXY._workPointBB1;\n    const numA = lsA.numPoints();\n    const numB = lsB.numPoints();\n    if (numA > 1 && numB > 1) {\n      const dfA = 1.0 / (numA - 1);\n      const dfB = 1.0 / (numB - 1);\n      let fA0 = 0.0;\n      let fA1, fB0, fB1;\n      lsA.pointAt(0, pointA0);\n      for (let ia = 1; ia < numA; ia++, pointA0.setFrom(pointA1), fA0 = fA1) {\n        fA1 = ia * dfA;\n        fB0 = 0.0;\n        lsA.pointAt(ia, pointA1);\n        // rangeA1 is around line segment [A0,A1] expanded by max distance\n        rangeA1.setNull();\n        rangeA1.extendPoint(pointA0);\n        rangeA1.extendPoint(pointA1);\n        if (this._maxDistanceToAccept)\n          rangeA1.expandInPlace(this._maxDistanceToAccept);\n        if (rangeA1.intersectsRangeXY(rangeB)) {\n          lsB.pointAt(0, pointB0);\n          bitB0 = this.classifyBitsPointRangeXY(pointB0.x, pointB0.y, rangeA1);\n          for (let ib = 1; ib < numB; ib++, pointB0.setFrom(pointB1), fB0 = fB1, bitB0 = bitB1) {\n            lsB.pointAt(ib, pointB1);\n            bitB1 = this.classifyBitsPointRangeXY(pointB1.x, pointB1.y, rangeA1);\n            fB1 = ib * dfB;\n            // DO NOT study the segment in detail if both bitB bits are on for any of the 4 planes\n            // (i.e., no intersection between rangeA1 and the range around line segment [B0,B1])\n            if ((bitB0 & bitB1) === 0)\n              this.computeSegmentSegment(lsA, pointA0, fA0, pointA1, fA1, lsB, pointB0, fB0, pointB1, fB1, reversed);\n          }\n        }\n      }\n    }\n  }\n  /** Low level dispatch of curve collection. */\n  private dispatchCurveCollection(geomA: AnyCurve, geomAHandler: (geomA: any) => any): void {\n    const geomB = this._geometryB; // save\n    if (!geomB || !geomB.children || !(geomB instanceof CurveCollection))\n      return;\n    for (const child of geomB.children) {\n      this.resetGeometry(child);\n      geomAHandler(geomA);\n    }\n    this._geometryB = geomB; // restore\n  }\n  /** Low level dispatch to geomA given a CurveChainWithDistanceIndex in geometryB. */\n  private dispatchCurveChainWithDistanceIndex(geomA: AnyCurve, geomAHandler: (geomA: any) => any): void {\n    if (!this._geometryB || !(this._geometryB instanceof CurveChainWithDistanceIndex))\n      return;\n    if (geomA instanceof CurveChainWithDistanceIndex)\n      assert(false, \"call handleCurveChainWithDistanceIndex(geomA) instead\");\n    const saveResults = this.grabPairedResults();\n    const geomB = this._geometryB;\n    for (const child of geomB.path.children) {\n      this.resetGeometry(child);\n      geomAHandler(geomA);\n    }\n    this.resetGeometry(geomB);\n    const childResults = this._results.extractArray();\n    childResults.forEach((pair: CurveLocationDetailPair) => {\n      CurveChainWithDistanceIndex.convertChildDetailToChainDetailSingle(pair, undefined, geomB);\n      this._results.insert(pair);\n    });\n    saveResults.forEach((pair: CurveLocationDetailPair) => this._results.insert(pair));\n  }\n  /** Specifies whether the curve needs to be stroked for close approach computation. */\n  private needsStroking(curve?: AnyCurve): curve is BSplineCurve3dBase | TransitionSpiral3d {\n    return curve instanceof BSplineCurve3dBase || curve instanceof TransitionSpiral3d;\n  }\n  /**\n   * Process seeds for xy close approach between one curve and another curve to be stroked.\n   * * Refine each result via Newton iteration. If it doesn't converge, remove it.\n   * @param seeds the initial seed results to refine.\n   * @param curveA curve to find its XY close approach with curveB.\n   * @param curveB the other curve to be stroked.\n   * @param reversed whether `curveB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.\n   */\n  private refineStrokedResultsByNewton(\n    seeds: CurveLocationDetailPair[], curveA: CurvePrimitive, curveB: CurvePrimitive, reversed = false\n  ): void {\n    const xyMatchingFunction = new CurveCurveCloseApproachXYRRtoRRD(curveA, curveB);\n    const newtonSearcher = new Newton2dUnboundedWithDerivative(xyMatchingFunction, 50, this._newtonTolerance); // seen: 47\n    for (const seed of seeds) {\n      const detailA = reversed ? seed.detailB : seed.detailA;\n      const detailB = reversed ? seed.detailA : seed.detailB;\n      assert(detailB.curve instanceof LineString3d, \"Caller has discretized the curve\");\n      newtonSearcher.setUV(detailA.fraction, detailB.fraction); // use the linestring fraction as initial curveB fraction (ASSUME it's close enough)\n      if (newtonSearcher.runIterations()) {\n        const fractionA = newtonSearcher.getU();\n        const fractionB = newtonSearcher.getV();\n        if (this.acceptFraction(fractionA) && this.acceptFraction(fractionB))\n          this.testAndRecordPointPair(curveA, fractionA, undefined, curveB, fractionB, undefined, reversed);\n      } // ignore failure to converge\n    }\n  }\n  /**\n   * Append stroke points and return the line string.\n   * * This is a convenient wrapper for [[CurvePrimitive.emitStrokes]] but the analogous instance method cannot be added\n   * to that class due to the ensuing recursion with subclass [[LineString3d]].\n   * @param options options for stroking the instance curve.\n   * @param result object to receive appended stroke points; if omitted, a new object is created, populated, and returned.\n   */\n  private strokeCurve(curve: CurvePrimitive, options?: StrokeOptions, result?: LineString3d): LineString3d {\n    const ls = result ? result : LineString3d.create();\n    curve.emitStrokes(ls, options);\n    return ls;\n  }\n  /** Find and return the close approaches between curveA and the discretization of curveB. */\n  private computeDiscreteCloseApproachResults(curveA: CurvePrimitive, lsB: LineString3d, reversed: boolean): CurveLocationDetailPair[] {\n    const maxDist = this.maxDistanceToAccept;\n    const saveResults = this.grabPairedResults(); // save current results\n    const geomB = this._geometryB;\n    this.maxDistanceToAccept = maxDist ? maxDist * 1.2 : undefined; // HEURISTIC: allow slack for Newton seeds\n    this.resetGeometry(curveA);\n    this.handleLineString3d(lsB); // populate empty results with discrete solutions\n    if (!reversed) {\n      // handleLineString3d put lsB data into detailA, so if we aren't reversing, we need to swap\n      for (const result of this._results)\n        result.swapDetails();\n    }\n    this.resetGeometry(geomB);\n    this.maxDistanceToAccept = maxDist;\n    const discreteResults = this._results.extractArray();\n    saveResults.forEach((pair: CurveLocationDetailPair) => this._results.insert(pair)); // restore current results\n    return discreteResults;\n  }\n  /**\n   * Compute the XY close approach of a curve and another curve to be stroked.\n   * @param curveA curve to find its XY close approach with curveB.\n   * @param curveB the other curve to be stroked.\n   * @param reversed whether `curveB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.\n   */\n  private dispatchCurveStrokedCurve(curveA: CurvePrimitive, curveB: CurvePrimitive, reversed: boolean): void {\n    // explicit search for intersections (Newton converges too slowly on DirectSpiral3d tangent intersections)\n    const intersections = CurveCurve.intersectionXYPairs(curveA, false, curveB, false, this._xyTolerance);\n    for (const intersection of intersections)\n      this.testAndRecordPair(intersection, reversed);\n    // append seeds computed by solving the discretized spiral close approach problem, then refine the seeds via Newton\n    let cpA = curveA;\n    if (this.needsStroking(curveA))\n      cpA = this.strokeCurve(curveA);\n    const cpB = this.strokeCurve(curveB);\n    const seeds = this.computeDiscreteCloseApproachResults(cpA, cpB, reversed);\n    this.refineStrokedResultsByNewton(seeds, curveA, curveB, reversed);\n    if (curveA instanceof LineString3d) { // explicitly test corners (where Newton converges too slowly)\n      const fStep = Geometry.safeDivideFraction(1.0, curveA.numEdges(), 0);\n      const v0 = CurveCurveCloseApproachXY._workPointBB0;\n      for (let i = 1; i < curveA.numEdges(); ++i)\n        this.testAndRecordProjection(curveA, i * fStep, curveA.pointAtUnchecked(i, v0), curveB, reversed);\n    }\n    this.testAndRecordEndPointApproaches(curveA, curveB, reversed);\n  }\n  /** Double dispatch handler for strongly typed segment. */\n  public override handleLineSegment3d(segmentA: LineSegment3d): any {\n    if (this._geometryB instanceof LineSegment3d) {\n      const segmentB = this._geometryB;\n      this.computeSegmentSegment(\n        segmentA, segmentA.point0Ref, 0.0, segmentA.point1Ref, 1.0,\n        segmentB, segmentB.point0Ref, 0.0, segmentB.point1Ref, 1.0,\n        false,\n      );\n    } else if (this._geometryB instanceof LineString3d) {\n      this.computeSegmentLineString(segmentA, this._geometryB, false);\n    } else if (this._geometryB instanceof Arc3d) {\n      this.computeSegmentArc(segmentA, this._geometryB, false);\n    } else if (this.needsStroking(this._geometryB)) {\n      this.dispatchCurveStrokedCurve(segmentA, this._geometryB, false);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(segmentA, this.handleLineSegment3d.bind(this));\n    } else if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(segmentA, this.handleLineSegment3d.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed linestring. */\n  public override handleLineString3d(lsA: LineString3d): any {\n    if (this._geometryB instanceof LineSegment3d) {\n      this.computeSegmentLineString(this._geometryB, lsA, true);\n    } else if (this._geometryB instanceof LineString3d) {\n      this.computeLineStringLineString(lsA, this._geometryB, false);\n    } else if (this._geometryB instanceof Arc3d) {\n      this.computeArcLineString(this._geometryB, lsA, true);\n    } else if (this.needsStroking(this._geometryB)) {\n      this.dispatchCurveStrokedCurve(lsA, this._geometryB, false);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(lsA, this.handleLineString3d.bind(this));\n    } else if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(lsA, this.handleLineString3d.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed arc. */\n  public override handleArc3d(arcA: Arc3d): any {\n    if (this._geometryB instanceof LineSegment3d) {\n      this.computeSegmentArc(this._geometryB, arcA, true);\n    } else if (this._geometryB instanceof LineString3d) {\n      this.computeArcLineString(arcA, this._geometryB, false);\n    } else if (this._geometryB instanceof Arc3d) {\n      this.dispatchArcArc(arcA, this._geometryB, false);\n    } else if (this.needsStroking(this._geometryB)) {\n      this.dispatchCurveStrokedCurve(arcA, this._geometryB, false);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(arcA, this.handleArc3d.bind(this));\n    } else if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(arcA, this.handleArc3d.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed bspline curve. */\n  public override handleBSplineCurve3d(curveA: BSplineCurve3d): any {\n    if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(curveA, this.handleBSplineCurve3d.bind(this));\n    } else if (this._geometryB instanceof CurvePrimitive) {\n      this.dispatchCurveStrokedCurve(this._geometryB, curveA, true);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(curveA, this.handleBSplineCurve3d.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed spiral curve. */\n  public override handleTransitionSpiral(spiral: TransitionSpiral3d): any {\n    if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(spiral, this.handleTransitionSpiral.bind(this));\n    } else if (this._geometryB instanceof CurvePrimitive) {\n      this.dispatchCurveStrokedCurve(this._geometryB, spiral, true);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(spiral, this.handleTransitionSpiral.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed CurveChainWithDistanceIndex. */\n  public override handleCurveChainWithDistanceIndex(chain: CurveChainWithDistanceIndex): any {\n    super.handleCurveChainWithDistanceIndex(chain);\n    // if _geometryB is also a CurveChainWithDistanceIndex, it will already have been converted by dispatchCurveChainWithDistanceIndex\n    const childResults = this._results.extractArray();\n    childResults.forEach((pair: CurveLocationDetailPair) => {\n      CurveChainWithDistanceIndex.convertChildDetailToChainDetailSingle(pair, chain, undefined);\n      this._results.insert(pair);\n    });\n  }\n  /** Double dispatch handler for strongly typed homogeneous bspline curve .. */\n  public override handleBSplineCurve3dH(_curve: BSplineCurve3dH): any {\n    // NEEDS WORK -- make \"dispatch\" methods tolerant of both 3d and 3dH\n    return undefined;\n  }\n}\n"]}
+{"version":3,"file":"CurveCurveCloseApproachXY.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveCloseApproachXY.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA2E;AAC3E,6DAAgF;AAEhF,6CAA0C;AAC1C,sEAAkF;AAClF,gFAA6E;AAC7E,sEAA2D;AAC3D,kDAAiD;AACjD,kDAA0G;AAC1G,4DAA2D;AAC3D,4DAAyD;AACzD,oCAAiC;AACjC,gFAA6E;AAC7E,wDAAqD;AACrD,8CAA2C;AAC3C,gEAAyG;AACzG,sDAAmD;AAEnD,oDAAiD;AACjD,kDAA+C;AAC/C,8CAA2C;AAC3C,qEAAkE;AAGlE,+BAA+B;AAE/B;;;;;;;;;;;;;GAaG;AACH,MAAa,yBAA0B,SAAQ,gDAA8B;IACnE,UAAU,CAAuB;IACzC;;;OAGG;IACK,oBAAoB,CAAqB;IACjD,gFAAgF;IACxE,mBAAmB,CAAS;IAC5B,YAAY,CAAS;IACrB,gBAAgB,CAAS;IACzB,cAAc,CAAS;IAC/B;;;OAGG;IACK,QAAQ,CAAuC;IAE/C,MAAM,CAAC,aAAa,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACxC,MAAM,CAAC,aAAa,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACxC,MAAM,CAAC,aAAa,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACxC,MAAM,CAAC,aAAa,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IACxC,MAAM,CAAC,WAAW,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;IAE9C;;;;;;OAMG;IACH,YACE,SAAoB,EACpB,cAAsB,mBAAQ,CAAC,mBAAmB,EAClD,kBAA0B,mBAAQ,CAAC,eAAe,EAClD,gBAAwB,EAAE,CAAC,WAAW;;QAEtC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,YAAY,uBAAU,CAAC,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;QACrF,IAAI,CAAC,mBAAmB,GAAG,mBAAQ,CAAC,0BAA0B,CAAC;QAC/D,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,gBAAgB,GAAG,eAAe,CAAC;QACxC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,MAAM,OAAO,GAAG,6CAAuB,CAAC,oBAAoB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QAChF,IAAI,CAAC,QAAQ,GAAG,IAAI,0BAAW,CAA0B,OAAO,EAAE,8BAAe,CAAC,MAAM,CAAC,CAAC;IAC5F,CAAC;IACD,6EAA6E;IAC7E,IAAW,mBAAmB,CAAC,KAAyB;QACtD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,oBAAoB,GAAG,SAAS,CAAC;YACtC,IAAI,CAAC,mBAAmB,GAAG,mBAAQ,CAAC,0BAA0B,CAAC;QACjE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,CAAC,mBAAmB,GAAG,KAAK,GAAG,KAAK,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,gFAAgF;IAChF,IAAW,mBAAmB;QAC5B,OAAO,IAAI,CAAC,oBAAoB,CAAC;IACnC,CAAC;IACD,mEAAmE;IACnE,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,oBAAoB,KAAK,SAAS,IAAI,IAAI,CAAC,oBAAoB,GAAG,CAAC,CAAC;IAClF,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,SAAoB;QACvC,IAAI,SAAS;YACX,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAChC,CAAC;IACD,8DAA8D;IACtD,cAAc,CAAC,QAAgB,EAAE,cAAsB,OAAO;QACpE,IAAI,QAAQ,GAAG,CAAC,WAAW;YACzB,OAAO,KAAK,CAAC;QACf,IAAI,QAAQ,GAAG,GAAG,GAAG,WAAW;YAC9B,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0FAA0F;IACnF,iBAAiB;QACtB,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;IACtC,CAAC;IACD;;;;;;;;;;;;OAYG;IACK,sBAAsB,CAC5B,GAAmB,EAAE,EAAU,EAAE,MAA2B,EAC5D,GAAmB,EAAE,EAAU,EAAE,MAA2B,EAC5D,QAAiB;QAEjB,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,EAAE,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxB,MAAM,OAAO,GAAG,yCAAmB,CAAC,gCAAgC,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YACzF,MAAM,OAAO,GAAG,yCAAmB,CAAC,gCAAgC,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YACzF,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;YACpD,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;YACpD,MAAM,IAAI,GAAG,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YACrE,IAAI,QAAQ;gBACV,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACK,iBAAiB,CAAC,IAA6B,EAAE,QAAiB;QACxE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,EAAE,GAAG,IAAI,CAAC,mBAAmB;YAC/B,OAAO;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,QAAQ;YACV,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD;;;;;;;;;;;;;OAaG;IACK,sBAAsB,CAC5B,IAA6B,EAC7B,GAAmB,EAAE,UAAkB,EAAE,UAAkB,EAC3D,GAAmB,EAAE,UAAkB,EAAE,UAAkB,EAC3D,QAAiB;QAEjB,MAAM,eAAe,GAAG,mBAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC5F,MAAM,eAAe,GAAG,mBAAQ,CAAC,WAAW,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;QAC5F,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,eAAe,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,eAAe,CAAC,CAAC;QACpD,MAAM,EAAE,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,EAAE,GAAG,IAAI,CAAC,mBAAmB;YAC/B,OAAO;QACT,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,yCAAmB,CAAC,gCAAgC,CAAC,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACpG,yCAAmB,CAAC,gCAAgC,CAAC,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACpG,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,uCAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,IAAI,QAAQ;YACV,IAAI,CAAC,WAAW,EAAE,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IACD,oEAAoE;IAC5D,MAAM,CAAC,4BAA4B,CACzC,eAAwC,EACxC,SAAiB,EAAE,MAAe,EAClC,SAAiB,EAAE,OAAgB,EAAE,OAAgB,EACrD,kBAA0B;QAE1B,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,SAAS,GAAG,CAAC;YACf,SAAS,GAAG,CAAC,CAAC;aACX,IAAI,SAAS,GAAG,CAAC;YACpB,SAAS,GAAG,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACzE,MAAM,eAAe,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACzD,IAAI,eAAe,IAAI,IAAI,CAAC,GAAG,CAAC,kBAAkB,EAAE,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/E,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;YAC7E,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;YAC7E,OAAO,GAAG,IAAI,CAAC;QACjB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;;;;;;OAWG;IACK,MAAM,CAAC,6BAA6B,CAC1C,EAAW,EAAE,EAAW,EACxB,EAAW,EAAE,EAAW,EACxB,kBAA0B;QAE1B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,IAAI,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,IAAI,GAAG,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC5D,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,IAAI,GAAG,GAAG,EAAE,CAAC,CAAC,mDAAmD;YAC/F,MAAM,SAAS,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;YACxC,MAAM,SAAS,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;YACxC,OAAO,6CAAuB,CAAC,aAAa,CAC1C,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,EACjG,yCAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,SAAS,EAAE,EAAE,CAAC,WAAW,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAClG,CAAC;QACJ,CAAC;QACD,4FAA4F;QAC5F,MAAM,eAAe,GAAG,IAAI,6CAAuB,EAAE,CAAC;QACtD,eAAe,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,GAAG,kBAAkB,CAAC,CAAC,0CAA0C;QAC9F,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,MAAM,EAAE,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChD,IAAI,IAAI,GAAG,IAAI,IAAI,kBAAkB,GAAG,EAAE,EAAE,CAAC,CAAC,2BAA2B;YACvE,MAAM,SAAS,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YACpG,IAAI,IAAI,CAAC,4BAA4B,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC;gBAClG,QAAQ,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,IAAI,kBAAkB,GAAG,EAAE,EAAE,CAAC,CAAC,2BAA2B;YACvE,MAAM,SAAS,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YACpG,IAAI,IAAI,CAAC,4BAA4B,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC;gBAClG,QAAQ,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,MAAM,EAAE,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChD,IAAI,IAAI,GAAG,IAAI,IAAI,kBAAkB,GAAG,EAAE,EAAE,CAAC,CAAC,2BAA2B;YACvE,MAAM,SAAS,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YACrG,IAAI,IAAI,CAAC,4BAA4B,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC;gBAClG,QAAQ,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,IAAI,IAAI,GAAG,IAAI,IAAI,kBAAkB,GAAG,EAAE,EAAE,CAAC,CAAC,2BAA2B;YACvE,MAAM,SAAS,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,mBAAQ,CAAC,cAAc,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;YACrG,IAAI,IAAI,CAAC,4BAA4B,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,EAAE,kBAAkB,CAAC;gBAClG,QAAQ,GAAG,KAAK,CAAC;QACrB,CAAC;QACD,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC,GAAG,kBAAkB;YAChD,OAAO,SAAS,CAAC;QACnB,IAAI,QAAQ;YACV,eAAe,CAAC,WAAW,EAAE,CAAC;QAChC,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;;;;OAMG;IACK,+BAA+B,CAAC,GAAmB,EAAE,GAAmB,EAAE,QAAiB;QACjG,MAAM,EAAE,GAAG,yBAAyB,CAAC,WAAW,CAAC;QACjD,uGAAuG;QACvG,MAAM,WAAW,GAAG,CAAC,KAAqB,EAAE,EAAE,CAAC,KAAK,YAAY,aAAK,IAAI,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC;QAClG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;YACxE,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACxE,CAAC;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;YACzE,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IACD,+DAA+D;IACvD,uBAAuB,CAAC,GAAmB,EAAE,EAAU,EAAE,MAAe,EAAE,GAAmB,EAAE,QAAiB;QACtH,MAAM,MAAM,GAAG,GAAG,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC1C,IAAI,MAAM;YACR,IAAI,CAAC,sBAAsB,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAC/F,CAAC;IACD;;;;;OAKG;IACK,qBAAqB,CAC3B,GAAmB,EAAE,OAAgB,EAAE,UAAkB,EAAE,OAAgB,EAAE,UAAkB,EAC/F,GAAmB,EAAE,OAAgB,EAAE,UAAkB,EAAE,OAAgB,EAAE,UAAkB,EAC/F,QAAiB;QAEjB,kDAAkD;QAClD,MAAM,QAAQ,GAAG,yBAAyB,CAAC,6BAA6B,CACtE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,mBAAmB,CAC7D,CAAC;QACF,uFAAuF;QACvF,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC/B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC/B,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,GAAG,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QAC5G,CAAC;IACH,CAAC;IACD;;;;;;;;OAQG;IACK,0CAA0C,CAChD,MAAe,EAAE,IAAa,EAAE,IAAW,EAC3C,QAA4H;QAE5H,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,sBAAsB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,sBAAsB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjE,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACjD,KAAK,MAAM,QAAQ,IAAI,CAAC,eAAe,EAAE,eAAe,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACpE,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;YAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;YACzE,IAAI,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,oCAAoC;gBAC1E,MAAM,YAAY,GAAG,yBAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;gBAC9F,IAAI,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC;oBACjE,QAAQ,CAAC,YAAY,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;;;;;;OASG;IACK,iBAAiB,CAAC,KAAoB,EAAE,IAAW,EAAE,QAAiB;QAC5E,4DAA4D;QAC5D,WAAW;QACX,+DAA+D;QAC/D,kCAAkC;QAClC,wGAAwG;QACxG,gFAAgF;QAChF,mBAAmB;QACnB,mBAAmB;QACnB,wBAAwB;QACxB,IAAI,iBAAiB,GAAG,KAAK,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,kBAAkB;QACnH,MAAM,IAAI,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB;QAClH,MAAM,KAAK,GAAG,mBAAQ,CAAC,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB;QACpH,MAAM,OAAO,GAAG,IAAI,2CAAoB,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,2CAAoB,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,2CAAoB,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,2BAAa,CAAC,yCAAyC,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACtH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9H,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5F,IAAI,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,oCAAoC;gBAC1E,MAAM,YAAY,GAAG,yBAAW,CAAC,oCAAoC,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;gBAClH,IAAI,YAAY,KAAK,SAAS,IAAI,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,EAAE,CAAC;oBACpE,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;oBACnG,iBAAiB,GAAG,IAAI,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,iBAAiB;YACnB,OAAO;QACT,yEAAyE;QACzE,IAAI,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC5D,2CAA2C;QAC3C,2GAA2G;QAC3G,6EAA6E;QAC7E,IAAI,CAAC,0CAA0C,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,IAAI,EACpF,CAAC,YAAoB,EAAE,SAA8B,EAAE,WAAmB,EAAE,QAA6B,EAAE,EAAE,CAC3G,IAAI,CAAC,sBAAsB,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,CAAC,CACrG,CAAC;IACJ,CAAC;IACD;;;;;;;OAOG;IACI,8BAA8B,CAAC,IAAW,EAAE,IAAW,EAAE,WAAoB,KAAK;QACvF,MAAM,eAAe,GAAG,IAAI,yCAAgC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACzE,oDAAoD;QACpD,MAAM,SAAS,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,oCAAoC;QAC9D,MAAM,SAAS,GAAG,SAAS,GAAG,CAAC,CAAC;QAChC,MAAM,cAAc,GAAG,IAAI,wCAA+B,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC,CAAC,8CAA8C;QAChI,KAAK,IAAI,KAAK,GAAG,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;YAC1D,KAAK,IAAI,KAAK,GAAG,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,SAAS,EAAE,CAAC;gBAC1D,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBACnC,IAAI,cAAc,CAAC,aAAa,EAAE,EAAE,CAAC;oBACnC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;oBACxC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;oBACxC,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,CAAC;wBACrE,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;oBAChG,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,4CAA4C;IACpC,cAAc,CAAC,GAAU,EAAE,GAAU,EAAE,QAAiB;QAC9D,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,oBAAoB;YAC3B,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;YACnC,OAAO;QACT,uEAAuE;QACvE,IAAI,CAAC,+BAA+B,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QACzD,gEAAgE;QAChE,IAAI,CAAC,8BAA8B,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC1D,CAAC;IACD,6DAA6D;IACrD,wBAAwB,CAAC,IAAmB,EAAE,GAAiB,EAAE,QAAiB;QACxF,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAClC,MAAM,GAAG,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,8BAA8B;YAC1D,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAE,qCAAqC;YACrG,GAAG,CAAC,YAAY,CAAC,+BAA+B,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC7D,GAAG,CAAC,YAAY,CAAC,+BAA+B,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;YACjE,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC1G,CAAC;IACH,CAAC;IACD,yDAAyD;IACjD,oBAAoB,CAAC,IAAW,EAAE,GAAiB,EAAE,QAAiB;QAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,oBAAoB;YAC3B,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;YACnC,OAAO;QACT,MAAM,EAAE,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACnD,MAAM,EAAE,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACnD,0BAA0B;QAC1B,MAAM,aAAa,GAAG,uBAAU,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACjG,KAAK,MAAM,YAAY,IAAI,aAAa;YACtC,IAAI,CAAC,iBAAiB,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QACjD,4DAA4D;QAC5D,MAAM,KAAK,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,GAAG,EAAE,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC;QAC7F,oEAAoE;QACpE,IAAI,CAAC,+BAA+B,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC1D,4DAA4D;QAC5D,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QACnB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,CAAC,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACjE,GAAG,CAAC,gBAAgB,CAAC,IAAI,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;YACnC,IAAI,CAAC,0CAA0C,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,EAC1D,CAAC,YAAoB,EAAE,SAA8B,EAAE,WAAmB,EAAE,QAA6B,EAAE,EAAE;gBAC3G,MAAM,WAAW,GAAG,GAAG,CAAC,4CAA4C,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBACzF,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,GAAG,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YAClG,CAAC,CACF,CAAC;QACJ,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACK,wBAAwB,CAAC,CAAS,EAAE,CAAS,EAAE,KAAc;QACnE,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,GAAG,IAAI,CAAC;aACX,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,GAAG,IAAI,CAAC;QAChB,wBAAwB;QACxB,IAAI,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,IAAI,IAAI,CAAC;aACZ,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACvB,MAAM,IAAI,IAAI,CAAC;QACjB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0DAA0D;IAClD,2BAA2B,CAAC,GAAiB,EAAE,GAAiB,EAAE,QAAiB;QACzF,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,oBAAoB;YAC3B,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC;YACnC,OAAO;QACT,IAAI,KAAa,CAAC;QAClB,IAAI,KAAa,CAAC;QAClB,MAAM,OAAO,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,OAAO,GAAG,yBAAyB,CAAC,aAAa,CAAC;QACxD,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;QAC7B,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YAC7B,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,GAAG,GAAG,GAAG,CAAC;YACd,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;YAClB,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACxB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,CAAC;gBACtE,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;gBACf,GAAG,GAAG,GAAG,CAAC;gBACV,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBACzB,kEAAkE;gBAClE,OAAO,CAAC,OAAO,EAAE,CAAC;gBAClB,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC7B,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;gBAC7B,IAAI,IAAI,CAAC,oBAAoB;oBAC3B,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;gBACnD,IAAI,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC,EAAE,CAAC;oBACtC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACxB,KAAK,GAAG,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;oBACrE,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,GAAG,EAAE,KAAK,GAAG,KAAK,EAAE,CAAC;wBACrF,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;wBACzB,KAAK,GAAG,IAAI,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;wBACrE,GAAG,GAAG,EAAE,GAAG,GAAG,CAAC;wBACf,sFAAsF;wBACtF,oFAAoF;wBACpF,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;4BACvB,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;oBAC3G,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,8CAA8C;IACtC,uBAAuB,CAAC,KAAe,EAAE,YAAiC;QAChF,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,OAAO;QACtC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,CAAC,CAAC,KAAK,YAAY,iCAAe,CAAC;YAClE,OAAO;QACT,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;YACnC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1B,YAAY,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,UAAU;IACrC,CAAC;IACD,oFAAoF;IAC5E,mCAAmC,CAAC,KAAe,EAAE,YAAiC;QAC5F,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,YAAY,yDAA2B,CAAC;YAC/E,OAAO;QACT,IAAI,KAAK,YAAY,yDAA2B;YAC9C,IAAA,qBAAM,EAAC,KAAK,EAAE,uDAAuD,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YAC1B,YAAY,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAClD,YAAY,CAAC,OAAO,CAAC,CAAC,IAA6B,EAAE,EAAE;YACrD,yDAA2B,CAAC,qCAAqC,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YAC1F,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;QACH,WAAW,CAAC,OAAO,CAAC,CAAC,IAA6B,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IACrF,CAAC;IACD,sFAAsF;IAC9E,aAAa,CAAC,KAAgB;QACpC,OAAO,KAAK,YAAY,iCAAkB,IAAI,KAAK,YAAY,uCAAkB,CAAC;IACpF,CAAC;IACD;;;;;;;;;;OAUG;IACK,4BAA4B,CAClC,KAAgC,EAChC,MAAsB,EAAE,eAAwB,EAChD,MAAsB,EAAE,eAAwB,EAChD,QAAQ,GAAG,KAAK;QAEhB,MAAM,kBAAkB,GAAG,IAAI,yCAAgC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAChF,MAAM,cAAc,GAAG,IAAI,wCAA+B,CACxD,kBAAkB,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,gBAAgB,CAC/D,CAAC;QACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YACvD,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;YACvD,IAAA,qBAAM,EAAC,OAAO,CAAC,KAAK,YAAY,2BAAY,EAAE,kCAAkC,CAAC,CAAC;YAClF,qHAAqH;YACrH,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;YAClH,MAAM,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC;YAClH,cAAc,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,IAAI,cAAc,CAAC,aAAa,EAAE,EAAE,CAAC;gBACnC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;gBACxC,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,EAAE,CAAC;gBACxC,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC;oBAClE,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;YACtG,CAAC,CAAC,6BAA6B;QACjC,CAAC;IACH,CAAC;IACD;;;;;;OAMG;IACK,WAAW,CAAC,KAAqB,EAAE,OAAuB,EAAE,MAAqB;QACvF,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,2BAAY,CAAC,MAAM,EAAE,CAAC;QACnD,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAC/B,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,4FAA4F;IACpF,mCAAmC,CAAC,MAAsB,EAAE,GAAiB,EAAE,QAAiB;QACtG,MAAM,OAAO,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC,CAAC,uBAAuB;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;QAC9B,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,0CAA0C;QAC1G,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,iDAAiD;QAC/E,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,2FAA2F;YAC3F,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ;gBAChC,MAAM,CAAC,WAAW,EAAE,CAAC;QACzB,CAAC;QACD,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC;QACnC,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QACrD,WAAW,CAAC,OAAO,CAAC,CAAC,IAA6B,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,0BAA0B;QAC9G,OAAO,eAAe,CAAC;IACzB,CAAC;IACD;;;;;OAKG;IACK,yBAAyB,CAAC,MAAsB,EAAE,MAAsB,EAAE,QAAiB;QACjG,0GAA0G;QAC1G,MAAM,aAAa,GAAG,uBAAU,CAAC,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACtG,KAAK,MAAM,YAAY,IAAI,aAAa;YACtC,IAAI,CAAC,iBAAiB,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC;QACjD,mHAAmH;QACnH,MAAM,eAAe,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QACnD,MAAM,GAAG,GAAG,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAChE,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,mCAAmC,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC;QAC3E,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QAC1F,IAAI,MAAM,YAAY,2BAAY,EAAE,CAAC,CAAC,8DAA8D;YAClG,MAAM,KAAK,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,GAAG,EAAE,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;YACrE,MAAM,EAAE,GAAG,yBAAyB,CAAC,aAAa,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;QACtG,CAAC;QACD,IAAI,CAAC,+BAA+B,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IACjE,CAAC;IACD,0DAA0D;IAC1C,mBAAmB,CAAC,QAAuB;QACzD,IAAI,IAAI,CAAC,UAAU,YAAY,6BAAa,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;YACjC,IAAI,CAAC,qBAAqB,CACxB,QAAQ,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAC1D,QAAQ,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE,QAAQ,CAAC,SAAS,EAAE,GAAG,EAC1D,KAAK,CACN,CAAC;QACJ,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,2BAAY,EAAE,CAAC;YACnD,IAAI,CAAC,wBAAwB,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAClE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,aAAK,EAAE,CAAC;YAC5C,IAAI,CAAC,iBAAiB,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC3D,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACnE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9E,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAClE,IAAI,CAAC,mCAAmC,CAAC,QAAQ,EAAE,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC1F,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6DAA6D;IAC7C,kBAAkB,CAAC,GAAiB;QAClD,IAAI,IAAI,CAAC,UAAU,YAAY,6BAAa,EAAE,CAAC;YAC7C,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAC5D,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,2BAAY,EAAE,CAAC;YACnD,IAAI,CAAC,2BAA2B,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAChE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,aAAK,EAAE,CAAC;YAC5C,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,yBAAyB,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,GAAG,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACxE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAClE,IAAI,CAAC,mCAAmC,CAAC,GAAG,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,sDAAsD;IACtC,WAAW,CAAC,IAAW;QACrC,IAAI,IAAI,CAAC,UAAU,YAAY,6BAAa,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACtD,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,2BAAY,EAAE,CAAC;YACnD,IAAI,CAAC,oBAAoB,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC1D,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,aAAK,EAAE,CAAC;YAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QACpD,CAAC;aAAM,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/C,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;QAC/D,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAClE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAClE,IAAI,CAAC,mCAAmC,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,gEAAgE;IAChD,oBAAoB,CAAC,MAAsB;QACzD,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAC3D,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACzF,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,+BAAc,EAAE,CAAC;YACrD,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAChE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+DAA+D;IAC/C,sBAAsB,CAAC,MAA0B;QAC/D,IAAI,IAAI,CAAC,UAAU,YAAY,yDAA2B,EAAE,CAAC;YAC3D,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3F,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,+BAAc,EAAE,CAAC;YACrD,IAAI,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAChE,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,YAAY,iCAAe,EAAE,CAAC;YACtD,IAAI,CAAC,uBAAuB,CAAC,MAAM,EAAE,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IAC9D,iCAAiC,CAAC,KAAkC;QAClF,KAAK,CAAC,iCAAiC,CAAC,KAAK,CAAC,CAAC;QAC/C,kIAAkI;QAClI,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAClD,YAAY,CAAC,OAAO,CAAC,CAAC,IAA6B,EAAE,EAAE;YACrD,yDAA2B,CAAC,qCAAqC,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC1F,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC,CAAC,CAAC;IACL,CAAC;IACD,8EAA8E;IAC9D,qBAAqB,CAAC,MAAuB;QAC3D,oEAAoE;QACpE,OAAO,SAAS,CAAC;IACnB,CAAC;;AA3wBH,8DA4wBC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { assert, DuplicatePolicy, SortedArray } from \"@itwin/core-bentley\";\nimport { BSplineCurve3d, BSplineCurve3dBase } from \"../../bspline/BSplineCurve\";\nimport { BSplineCurve3dH } from \"../../bspline/BSplineCurve3dH\";\nimport { Geometry } from \"../../Geometry\";\nimport { RecurseToCurvesGeometryHandler } from \"../../geometry3d/GeometryHandler\";\nimport { GrowableFloat64Array } from \"../../geometry3d/GrowableFloat64Array\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { CurveCurveCloseApproachXYRRtoRRD, Newton2dUnboundedWithDerivative } from \"../../numerics/Newton\";\nimport { AnalyticRoots } from \"../../numerics/Polynomials\";\nimport { SmallSystem } from \"../../numerics/SmallSystem\";\nimport { Arc3d } from \"../Arc3d\";\nimport { CurveChainWithDistanceIndex } from \"../CurveChainWithDistanceIndex\";\nimport { CurveCollection } from \"../CurveCollection\";\nimport { CurveCurve } from \"../CurveCurve\";\nimport { CurveIntervalRole, CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { AnyCurve } from \"../CurveTypes\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { ProxyCurve } from \"../ProxyCurve\";\nimport { TransitionSpiral3d } from \"../spiral/TransitionSpiral3d\";\nimport { StrokeOptions } from \"../StrokeOptions\";\n\n// cspell:word XYRR currentdFdX\n\n/**\n * Handler class for XY close approach between _geometryB and another geometry.\n * * Approach means the XY distance (z is ignored) between _geometryB and another geometry.\n * * Closest approach is a measure of the proximity of one curve to another. It's the length of the shortest line\n * segment perpendicular to both curves; if the curves intersect, the closest approach is zero. In the context of\n * this class, z-coordinates are ignored, so the closest approach is as seen in the top view. If you have coplanar\n * input curves and want to find closest approach in their plane, rotate them first into a plane parallel to the\n * xy-plane, then afterward, rotate the results back as required.\n * * Close approach can also be from a curve endpoint perpendicular to another curve or from a curve endpoint to\n * another curve endpoint.\n * * Instances are initialized and called from CurveCurve.\n * * geometryB is saved for later reference.\n * @internal\n */\nexport class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHandler {\n  private _geometryB: AnyCurve | undefined;\n  /**\n   * Maximum XY distance (z is ignored). Approach larger than this is not interesting.\n   * This is caller defined and can be undefined.\n   */\n  private _maxDistanceToAccept: number | undefined;\n  /** Squared max distance. Default is [[Geometry.smallMetricDistanceSquared]]. */\n  private _maxDistanceSquared: number;\n  private _xyTolerance: number;\n  private _newtonTolerance: number;\n  private _maxIterations: number;\n  /**\n   * Start and end points of line segments that meet closest approach criteria, i.e., they are perpendicular to\n   * both curves and their length is smaller than _maxDistanceToAccept.\n   */\n  private _results: SortedArray<CurveLocationDetailPair>;\n\n  private static _workPointAA0 = Point3d.create();\n  private static _workPointAA1 = Point3d.create();\n  private static _workPointBB0 = Point3d.create();\n  private static _workPointBB1 = Point3d.create();\n  private static _workPointB = Point3d.create();\n\n  /**\n   * Constructor.\n   * @param geometryB second curve for intersection. Saved for reference by specific handler methods.\n   * @param xyTolerance optional tolerance for comparing xy points (default [[Geometry.smallMetricDistance]]).\n   * @param newtonTolerance optional relative fraction tolerance for Newton iteration (default [[Geometry.smallNewtonStep]]).\n   * @param maxIterations optional max iterations for Newton iteration (default 50).\n   */\n  public constructor(\n    geometryB?: AnyCurve,\n    xyTolerance: number = Geometry.smallMetricDistance,\n    newtonTolerance: number = Geometry.smallNewtonStep,\n    maxIterations: number = 50 // seen: 47\n  ) {\n    super();\n    this._geometryB = geometryB instanceof ProxyCurve ? geometryB.proxyCurve : geometryB;\n    this._maxDistanceSquared = Geometry.smallMetricDistanceSquared;\n    this._xyTolerance = xyTolerance;\n    this._newtonTolerance = newtonTolerance;\n    this._maxIterations = maxIterations;\n    const compare = CurveLocationDetailPair.comparePairsByPoints(xyTolerance, true);\n    this._results = new SortedArray<CurveLocationDetailPair>(compare, DuplicatePolicy.Retain);\n  }\n  /** Set the (possibly undefined) max XY distance (z is ignored) to accept. */\n  public set maxDistanceToAccept(value: number | undefined) {\n    if (value === undefined) {\n      this._maxDistanceToAccept = undefined;\n      this._maxDistanceSquared = Geometry.smallMetricDistanceSquared;\n    } else {\n      this._maxDistanceToAccept = Math.abs(value);\n      this._maxDistanceSquared = value * value;\n    }\n  }\n  /** Access the (possibly undefined) max XY distance (z is ignored) to accept. */\n  public get maxDistanceToAccept(): number | undefined {\n    return this._maxDistanceToAccept;\n  }\n  /** Ask if the maxDistanceToAccept value is defined and positive */\n  public get isMaxDistanceSet(): boolean {\n    return this._maxDistanceToAccept !== undefined && this._maxDistanceToAccept > 0;\n  }\n  /**\n   * Reset the geometry.\n   * * Undefined inputs are ignored.\n   * * All other instance data is unchanged, including accumulated intersections.\n   */\n  public resetGeometry(geometryB?: AnyCurve) {\n    if (geometryB)\n      this._geometryB = geometryB;\n  }\n  /** returns true if `fraction` is in [0,1] within tolerance */\n  private acceptFraction(fraction: number, fractionTol: number = 1.0e-12) {\n    if (fraction < -fractionTol)\n      return false;\n    if (fraction > 1.0 + fractionTol)\n      return false;\n    return true;\n  }\n  /** Extract (and clear) the results, structured as an array of CurveLocationDetailPair. */\n  public grabPairedResults(): CurveLocationDetailPair[] {\n    return this._results.extractArray();\n  }\n  /**\n   * Create and record a close-approach pair from raw curve/fraction/point data.\n   * * If points are undefined, they are computed from the fractions via `fractionToPoint`.\n   * * Fractions are global (i.e., relative to the full curve, not a sub-segment).\n   * * The pair is recorded only if the XY distance is within `_maxDistanceSquared`.\n   * @param cpA first curve\n   * @param fA global fraction on cpA\n   * @param pointA point on cpA at fA, or undefined to compute from fA\n   * @param cpB second curve\n   * @param fB global fraction on cpB\n   * @param pointB point on cpB at fB, or undefined to compute from fB\n   * @param reversed if true, swap detailA and detailB before recording\n   */\n  private testAndRecordPointPair(\n    cpA: CurvePrimitive, fA: number, pointA: Point3d | undefined,\n    cpB: CurvePrimitive, fB: number, pointB: Point3d | undefined,\n    reversed: boolean\n  ): void {\n    if (!pointA)\n      pointA = cpA.fractionToPoint(fA);\n    if (!pointB)\n      pointB = cpB.fractionToPoint(fB);\n    const d2 = pointA.distanceSquaredXY(pointB);\n    if (d2 <= this._maxDistanceSquared) {\n      const d = Math.sqrt(d2);\n      const detailA = CurveLocationDetail.createCurveFractionPointDistance(cpA, fA, pointA, d);\n      const detailB = CurveLocationDetail.createCurveFractionPointDistance(cpB, fB, pointB, d);\n      detailA.setIntervalRole(CurveIntervalRole.isolated);\n      detailB.setIntervalRole(CurveIntervalRole.isolated);\n      const pair = CurveLocationDetailPair.createCapture(detailA, detailB);\n      if (reversed)\n        pair.swapDetails();\n      this._results.insert(pair);\n    }\n  }\n  /**\n   * Record a pre-built close-approach pair with global fractions already set.\n   * * Computes and stores the XY distance on both details.\n   * * The pair is recorded only if the XY distance is within `_maxDistanceSquared`.\n   * @param pair details with global fractions and points already set; modified in place\n   * @param reversed if true, swap detailA and detailB before recording\n   */\n  private testAndRecordPair(pair: CurveLocationDetailPair, reversed: boolean) {\n    const d2 = pair.detailA.point.distanceSquaredXY(pair.detailB.point);\n    if (d2 > this._maxDistanceSquared)\n      return;\n    const d = Math.sqrt(d2);\n    pair.detailA.a = pair.detailB.a = d;\n    pair.detailA.setIntervalRole(CurveIntervalRole.isolated);\n    pair.detailB.setIntervalRole(CurveIntervalRole.isolated);\n    if (reversed)\n      pair.swapDetails();\n    this._results.insert(pair);\n  }\n  /**\n   * Convert a close-approach pair from local (sub-segment) fractions to global fractions, then record it.\n   * * Local fractions in the pair are interpolated into the global fraction ranges.\n   * * Points are recomputed from the parent curves at the global fractions.\n   * * The pair is recorded only if the XY distance is within `_maxDistanceSquared`.\n   * @param pair local details (curve unspecified); modified in place with global fractions, curves, and points\n   * @param cpA parent curve A\n   * @param fractionA0 global fraction corresponding to local fraction 0 on curve A\n   * @param fractionA1 global fraction corresponding to local fraction 1 on curve A\n   * @param cpB parent curve B\n   * @param fractionB0 global fraction corresponding to local fraction 0 on curve B\n   * @param fractionB1 global fraction corresponding to local fraction 1 on curve B\n   * @param reversed if true, swap detailA and detailB before recording\n   */\n  private testAndRecordLocalPair(\n    pair: CurveLocationDetailPair,\n    cpA: CurvePrimitive, fractionA0: number, fractionA1: number,\n    cpB: CurvePrimitive, fractionB0: number, fractionB1: number,\n    reversed: boolean,\n  ) {\n    const globalFractionA = Geometry.interpolate(fractionA0, pair.detailA.fraction, fractionA1);\n    const globalFractionB = Geometry.interpolate(fractionB0, pair.detailB.fraction, fractionB1);\n    const pointA = cpA.fractionToPoint(globalFractionA);\n    const pointB = cpB.fractionToPoint(globalFractionB);\n    const d2 = pointA.distanceSquaredXY(pointB);\n    if (d2 > this._maxDistanceSquared)\n      return;\n    const d = Math.sqrt(d2);\n    CurveLocationDetail.createCurveFractionPointDistance(cpA, globalFractionA, pointA, d, pair.detailA);\n    CurveLocationDetail.createCurveFractionPointDistance(cpB, globalFractionB, pointB, d, pair.detailB);\n    pair.detailA.setIntervalRole(CurveIntervalRole.isolated);\n    pair.detailB.setIntervalRole(CurveIntervalRole.isolated);\n    if (reversed)\n      pair.swapDetails();\n    this._results.insert(pair);\n  }\n  /** Modify the current closest approach if the inputs are closer. */\n  private static updatePointToSegmentDistance(\n    closestApproach: CurveLocationDetailPair,\n    fractionA: number, pointA: Point3d,\n    fractionB: number, pointB0: Point3d, pointB1: Point3d,\n    maxDistanceSquared: number,\n  ): boolean {\n    let updated = false;\n    if (fractionB < 0)\n      fractionB = 0;\n    else if (fractionB > 1)\n      fractionB = 1;\n    const pointB = pointB0.interpolate(fractionB, pointB1, this._workPointB);\n    const distanceSquared = pointB.distanceSquaredXY(pointA);\n    if (distanceSquared <= Math.min(maxDistanceSquared, closestApproach.detailA.a)) {\n      closestApproach.detailA.setFP(fractionA, pointA, undefined, distanceSquared);\n      closestApproach.detailB.setFP(fractionB, pointB, undefined, distanceSquared);\n      updated = true;\n    }\n    return updated;\n  }\n  /**\n   * Return fractions of close approach within maxDistance between two line segments (a0,a1) and (b0,b1).\n   * * Math details can be found at core/geometry/internaldocs/Curve.md\n   * @param a0 start point of line a\n   * @param a1 end point of line a\n   * @param b0 start point of line b\n   * @param b1 end point of line b\n   * @param maxDistanceSquared maximum distance squared (assumed to be positive)\n   * @returns a pair of details for the closest approach, or `undefined` if no approach is within `maxDistanceSquared`.\n    * `detailA.fraction` is the fraction on segment a; `detailB.fraction` is the fraction on segment b. Returned\n    * details store the *squared* distance in the `a` property.\n   */\n  private static segmentSegmentBoundedApproach(\n    a0: Point3d, a1: Point3d,\n    b0: Point3d, b1: Point3d,\n    maxDistanceSquared: number,\n  ): CurveLocationDetailPair | undefined {\n    const ux = a1.x - a0.x;\n    const uy = a1.y - a0.y;\n    const vx = b1.x - b0.x;\n    const vy = b1.y - b0.y;\n    const e00x = b0.x - a0.x;\n    const e00y = b0.y - a0.y;\n    const e01x = b1.x - a0.x;\n    const e01y = b1.y - a0.y;\n    const e10x = b0.x - a1.x;\n    const e10y = b0.y - a1.y;\n    const hab0 = Geometry.crossProductXYXY(ux, uy, e00x, e00y);\n    const hab1 = Geometry.crossProductXYXY(ux, uy, e01x, e01y);\n    const hba0 = -Geometry.crossProductXYXY(vx, vy, e00x, e00y);\n    const hba1 = -Geometry.crossProductXYXY(vx, vy, e10x, e10y);\n    if (hab0 * hab1 < 0.0 && hba0 * hba1 < 0.0) { // true intersection, strictly within both segments\n      const fractionA = -hba0 / (hba1 - hba0);\n      const fractionB = -hab0 / (hab1 - hab0);\n      return CurveLocationDetailPair.createCapture(\n        CurveLocationDetail.createCurveFractionPoint(undefined, fractionA, a0.interpolate(fractionA, a1)),\n        CurveLocationDetail.createCurveFractionPoint(undefined, fractionB, b0.interpolate(fractionB, b1)),\n      );\n    }\n    // there's no intersection, so find the closest approach within maxDistance from an endpoint\n    const closestApproach = new CurveLocationDetailPair();\n    closestApproach.detailA.a = 2 * maxDistanceSquared; // init to an approach that's too far away\n    let reversed = false;\n    const uu = Geometry.hypotenuseSquaredXY(ux, uy);\n    if (hab0 * hab0 <= maxDistanceSquared * uu) { // test distance of b0 to u\n      const fractionA = Geometry.safeDivideFraction(Geometry.dotProductXYXY(ux, uy, e00x, e00y), uu, 0.0);\n      if (this.updatePointToSegmentDistance(closestApproach, 0, b0, fractionA, a0, a1, maxDistanceSquared))\n        reversed = true;\n    }\n    if (hab1 * hab1 <= maxDistanceSquared * uu) { // test distance of b1 to u\n      const fractionA = Geometry.safeDivideFraction(Geometry.dotProductXYXY(ux, uy, e01x, e01y), uu, 0.0);\n      if (this.updatePointToSegmentDistance(closestApproach, 1, b1, fractionA, a0, a1, maxDistanceSquared))\n        reversed = true;\n    }\n    const vv = Geometry.hypotenuseSquaredXY(vx, vy);\n    if (hba0 * hba0 <= maxDistanceSquared * vv) { // test distance of a0 to v\n      const fractionB = Geometry.safeDivideFraction(-Geometry.dotProductXYXY(vx, vy, e00x, e00y), vv, 0.0);\n      if (this.updatePointToSegmentDistance(closestApproach, 0, a0, fractionB, b0, b1, maxDistanceSquared))\n        reversed = false;\n    }\n    if (hba1 * hba1 <= maxDistanceSquared * vv) { // test distance of a1 to v\n      const fractionB = Geometry.safeDivideFraction(-Geometry.dotProductXYXY(vx, vy, e10x, e10y), vv, 0.0);\n      if (this.updatePointToSegmentDistance(closestApproach, 1, a1, fractionB, b0, b1, maxDistanceSquared))\n        reversed = false;\n    }\n    if (closestApproach.detailA.a > maxDistanceSquared)\n      return undefined;\n    if (reversed)\n      closestApproach.swapDetails();\n    return closestApproach;\n  }\n  /**\n   * Compute closest approaches from the endpoints of each curve (if open) to the other curve.\n   * Record a [[CurveLocationDetailPair]] if such a distance is less than [[maxDistance]].\n   * @param cpA curveA\n   * @param cpB curveB\n   * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to curveA).\n   */\n  private testAndRecordEndPointApproaches(cpA: CurvePrimitive, cpB: CurvePrimitive, reversed: boolean): void {\n    const pt = CurveCurveCloseApproachXY._workPointB;\n    // in closest approach context, endpoints of full sweep arcs are artificial locations, and thus ignored\n    const isClosedArc = (curve: CurvePrimitive) => curve instanceof Arc3d && curve.sweep.isFullCircle;\n    if (!isClosedArc(cpA)) {\n      this.testAndRecordProjection(cpA, 0, cpA.startPoint(pt), cpB, reversed);\n      this.testAndRecordProjection(cpA, 1, cpA.endPoint(pt), cpB, reversed);\n    }\n    if (!isClosedArc(cpB)) {\n      this.testAndRecordProjection(cpB, 0, cpB.startPoint(pt), cpA, !reversed);\n      this.testAndRecordProjection(cpB, 1, cpB.endPoint(pt), cpA, !reversed);\n    }\n  }\n  /** Find the closest xy approach between `pointA` and `cpB`. */\n  private testAndRecordProjection(cpA: CurvePrimitive, fA: number, pointA: Point3d, cpB: CurvePrimitive, reversed: boolean): void {\n    const detail = cpB.closestPointXY(pointA);\n    if (detail)\n      this.testAndRecordPointPair(cpA, fA, pointA, cpB, detail.fraction, detail.point, reversed);\n  }\n  /**\n   * Compute closest xy approach of two line segments.\n   * Filter by extension rules.\n   * Record with fraction mapping.\n   * * The fraction mappings allow portions of a linestring to be passed here.\n   */\n  private computeSegmentSegment(\n    cpA: CurvePrimitive, pointA0: Point3d, fractionA0: number, pointA1: Point3d, fractionA1: number,\n    cpB: CurvePrimitive, pointB0: Point3d, fractionB0: number, pointB1: Point3d, fractionB1: number,\n    reversed: boolean,\n  ): void {\n    // compute a pair with fractions local to segments\n    const approach = CurveCurveCloseApproachXY.segmentSegmentBoundedApproach(\n      pointA0, pointA1, pointB0, pointB1, this._maxDistanceSquared,\n    );\n    // adjust the pair to refer to input curves and global fractions, then record it if new\n    if (approach) {\n      approach.detailA.setCurve(cpA);\n      approach.detailB.setCurve(cpB);\n      this.testAndRecordLocalPair(approach, cpA, fractionA0, fractionA1, cpB, fractionB0, fractionB1, reversed);\n    }\n  }\n  /**\n   * Compute the perpendiculars between a line segment and an arc, without extending either curve.\n   * * One or two perpendiculars will be found.\n   * * Each perpendicular segment starts or ends on the arc where the arc tangent is parallel to the line tangent.\n   * @param startA line segment start point\n   * @param endA line segment end point\n   * @param arcB the arc\n   * @param announce callback to receive line and arc fractions and optional points of each perpendicular segment computed.\n   */\n  private announceAllPerpendicularsSegmentArcBounded(\n    startA: Point3d, endA: Point3d, arcB: Arc3d,\n    announce: (lineFraction: number, linePoint: Point3d | undefined, arcFraction: number, arcPoint: Point3d | undefined) => void,\n  ): void {\n    const dotUT = arcB.vector0.crossProductStartEndXY(startA, endA);\n    const dotVT = arcB.vector90.crossProductStartEndXY(startA, endA);\n    const parallelRadians = Math.atan2(dotVT, dotUT);\n    for (const radians1 of [parallelRadians, parallelRadians + Math.PI]) {\n      const arcPoint = arcB.radiansToPoint(radians1);\n      const arcFraction = arcB.sweep.radiansToSignedPeriodicFraction(radians1);\n      if (this.acceptFraction(arcFraction)) { // reject solution outside arc sweep\n        const lineFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(startA, endA, arcPoint);\n        if (lineFraction !== undefined && this.acceptFraction(lineFraction))\n          announce(lineFraction, undefined, arcFraction, arcPoint);\n      }\n    }\n  }\n  /**\n   * Find close approaches within maxDistance between a line segment and an arc.\n   * To consider:\n   * 1) intersection between arc and segment.\n   * 2) endpoints to endpoints, or endpoints projection to the other curve.\n   * 3) arc tangent parallel to line segment\n   * @param lineA the line segment\n   * @param arcB the arc\n   * @param reversed whether to reverse the details in the pair (e.g., so that detailB refers to arcA).\n   */\n  private computeSegmentArc(lineA: LineSegment3d, arcB: Arc3d, reversed: boolean): void {\n    // 1) intersection between arc and line segment (or string).\n    // Suppose:\n    // Arc: X = C + cU + sV where c = cos(theta) and s = sin(theta)\n    // Line: contains points A0 and A1\n    // The arc intersects the line at point X if det(A0, A1, X) = 0 with homogeneous xyw points and vectors.\n    // With equational X:  det(A0, A1, C) + c*det(A0, A1, U) + s*det(A0, A1, V) = 0.\n    // solve for theta.\n    // evaluate points.\n    // project back to line.\n    let intersectionFound = false;\n    const data = arcB.toTransformedVectors();\n    const alpha = Geometry.tripleProductXYW(lineA.point0Ref, 1, lineA.point1Ref, 1, data.center, 1); //  det(A0, A1, C)\n    const beta = Geometry.tripleProductXYW(lineA.point0Ref, 1, lineA.point1Ref, 1, data.vector0, 0); // det(A0, A1, U)\n    const gamma = Geometry.tripleProductXYW(lineA.point0Ref, 1, lineA.point1Ref, 1, data.vector90, 0); // det(A0, A1, V)\n    const cosines = new GrowableFloat64Array(2);\n    const sines = new GrowableFloat64Array(2);\n    const radians = new GrowableFloat64Array(2);\n    const numRoots = AnalyticRoots.appendImplicitLineUnitCircleIntersections(alpha, beta, gamma, cosines, sines, radians);\n    for (let i = 0; i < numRoots; i++) {\n      const arcPoint = data.center.plus2Scaled(data.vector0, cosines.atUncheckedIndex(i), data.vector90, sines.atUncheckedIndex(i));\n      const arcFraction = data.sweep.radiansToSignedPeriodicFraction(radians.atUncheckedIndex(i));\n      if (this.acceptFraction(arcFraction)) { // reject solution outside arc sweep\n        const lineFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(lineA.point0Ref, lineA.point1Ref, arcPoint);\n        if (lineFraction !== undefined && this.acceptFraction(lineFraction)) {\n          this.testAndRecordPointPair(lineA, lineFraction, undefined, arcB, arcFraction, arcPoint, reversed);\n          intersectionFound = true;\n        }\n      }\n    }\n    if (intersectionFound)\n      return;\n    // 2) endpoints to endpoints, or endpoints projection to the other curve.\n    this.testAndRecordEndPointApproaches(lineA, arcB, reversed);\n    // 3) arc tangent parallel to line segment.\n    // If line does not intersect the arc, then the closest (and/or the furthest) point on arc to the line is a\n    // point where the tangent line on arc at that point is parallel to the line.\n    this.announceAllPerpendicularsSegmentArcBounded(lineA.point0Ref, lineA.point1Ref, arcB,\n      (lineFraction: number, linePoint: Point3d | undefined, arcFraction: number, arcPoint: Point3d | undefined) =>\n        this.testAndRecordPointPair(lineA, lineFraction, linePoint, arcB, arcFraction, arcPoint, reversed),\n    );\n  }\n  /**\n   * Compute segments perpendicular to two elliptical arcs, without extending either curve.\n   * * Perpendiculars from an endpoint are not explicitly computed.\n   * * Intersections are also found by this search: they are reported as zero-length segments.\n   * @param arcA first arc\n   * @param arcB second arc\n   * @param reversed swap the details in the recorded pair (default: false)\n   */\n  public allPerpendicularsArcArcBounded(arcA: Arc3d, arcB: Arc3d, reversed: boolean = false): void {\n    const newtonEvaluator = new CurveCurveCloseApproachXYRRtoRRD(arcA, arcB);\n    // HEURISTIC: 2 ellipses have up to 8 perpendiculars\n    const seedDelta = 1 / 10; // denominator 9 fails the unit test\n    const seedStart = seedDelta / 2;\n    const newtonSearcher = new Newton2dUnboundedWithDerivative(newtonEvaluator, 100); // observed convergence to 1.0e-11 in 49 iters\n    for (let seedU = seedStart; seedU < 1; seedU += seedDelta) {\n      for (let seedV = seedStart; seedV < 1; seedV += seedDelta) {\n        newtonSearcher.setUV(seedU, seedV);\n        if (newtonSearcher.runIterations()) {\n          const fractionA = newtonSearcher.getU();\n          const fractionB = newtonSearcher.getV();\n          if (this.acceptFraction(fractionA) && this.acceptFraction(fractionB)) {\n            this.testAndRecordPointPair(arcA, fractionA, undefined, arcB, fractionB, undefined, reversed);\n          }\n        }\n      }\n    }\n  }\n  /** Low level dispatch of arc with Arc3d. */\n  private dispatchArcArc(cpA: Arc3d, cpB: Arc3d, reversed: boolean): void {\n    const rangeA = cpA.range();\n    const rangeB = cpB.range();\n    if (this._maxDistanceToAccept)\n      rangeA.expandInPlace(this._maxDistanceToAccept);\n    if (!rangeB.intersectsRangeXY(rangeA))\n      return;\n    // 1) endpoints to endpoints or endpoints projection to the other curve\n    this.testAndRecordEndPointApproaches(cpA, cpB, reversed);\n    // 2) perpendicular line between 2 arcs (includes intersections)\n    this.allPerpendicularsArcArcBounded(cpA, cpB, reversed);\n  }\n  /** Detail computation for segment approaching linestring. */\n  private computeSegmentLineString(segA: LineSegment3d, lsB: LineString3d, reversed: boolean): void {\n    const numB = lsB.numPoints();\n    const deltaFracB = Geometry.safeDivideFraction(1, numB - 1, 0);\n    const pointA0 = segA.point0Ref;\n    const pointA1 = segA.point1Ref;\n    const pointB0 = CurveCurveCloseApproachXY._workPointBB0;\n    const pointB1 = CurveCurveCloseApproachXY._workPointBB1;\n    for (let i = 0; i < numB - 1; ++i) {\n      const fB0 = i * deltaFracB; // global linestring fractions\n      const fB1 = (i + 1 === numB - 1) ? 1.0 : (i + 1) * deltaFracB;  // make sure we nail the end fraction\n      lsB.packedPoints.getPoint3dAtUncheckedPointIndex(i, pointB0);\n      lsB.packedPoints.getPoint3dAtUncheckedPointIndex(i + 1, pointB1);\n      this.computeSegmentSegment(segA, pointA0, 0.0, pointA1, 1.0, lsB, pointB0, fB0, pointB1, fB1, reversed);\n    }\n  }\n  /** Detail computation for arc approaching linestring. */\n  private computeArcLineString(arcA: Arc3d, lsB: LineString3d, reversed: boolean): void {\n    const rangeA = arcA.range();\n    const rangeB = lsB.range();\n    if (this._maxDistanceToAccept)\n      rangeA.expandInPlace(this._maxDistanceToAccept);\n    if (!rangeB.intersectsRangeXY(rangeA))\n      return;\n    const v0 = CurveCurveCloseApproachXY._workPointBB0;\n    const v1 = CurveCurveCloseApproachXY._workPointBB1;\n    // 1. record intersections\n    const intersections = CurveCurve.intersectionXYPairs(arcA, false, lsB, false, this._xyTolerance);\n    for (const intersection of intersections)\n      this.testAndRecordPair(intersection, reversed);\n    // 2. record linestring interior vertex projections onto arc\n    const fStep = Geometry.safeDivideFraction(1.0, lsB.numEdges(), 0);\n    for (let i = 1; i < lsB.numEdges(); ++i)\n      this.testAndRecordProjection(lsB, i * fStep, lsB.pointAtUnchecked(i, v0), arcA, !reversed);\n    // 3. record arc/linestring endpoint projections onto linestring/arc\n    this.testAndRecordEndPointApproaches(arcA, lsB, reversed);\n    // 4. record perpendiculars from within a segment to the arc\n    lsB.startPoint(v0);\n    for (let iSeg = 0; iSeg < lsB.numEdges(); ++iSeg, v0.setFrom(v1)) {\n      lsB.pointAtUnchecked(iSeg + 1, v1);\n      this.announceAllPerpendicularsSegmentArcBounded(v0, v1, arcA,\n        (lineFraction: number, linePoint: Point3d | undefined, arcFraction: number, arcPoint: Point3d | undefined) => {\n          const fLineString = lsB.segmentIndexAndLocalFractionToGlobalFraction(iSeg, lineFraction);\n          this.testAndRecordPointPair(arcA, arcFraction, arcPoint, lsB, fLineString, linePoint, reversed);\n        },\n      );\n    }\n  }\n  /**\n   * Set bits for comparison to range xy\n   * * bit 0x01 => x smaller than range.low.x\n   * * bit 0x02 => x larger than range.high.x\n   * * bit 0x04 => y smaller than range.low.y\n   * * bit 0x08 => y larger than range.high.y\n   * * If we divide XY plane into 9 areas using the range, the function returns 0 for points\n   * inside the range. Below is other binary numbers returned by the function for all 9 areas:\n   *   1001 | 1000 | 1010\n   *   ------------------\n   *    1   |  0   |  10\n   *   ------------------\n   *   101  | 100  | 110\n   * @param xy point to test\n   * @param range range for comparison\n   */\n  private classifyBitsPointRangeXY(x: number, y: number, range: Range3d): number {\n    let result = 0;\n    if (x < range.low.x)\n      result = 0x01;\n    else if (x > range.high.x)\n      result = 0x02;\n    // note the OR operation\n    if (y < range.low.y)\n      result |= 0x04;\n    else if (y > range.high.y)\n      result |= 0x08;\n    return result;\n  }\n  /** Low level dispatch of line string with line string. */\n  private computeLineStringLineString(lsA: LineString3d, lsB: LineString3d, reversed: boolean): void {\n    const rangeA = lsA.range();\n    const rangeB = lsB.range();\n    if (this._maxDistanceToAccept)\n      rangeA.expandInPlace(this._maxDistanceToAccept);\n    if (!rangeB.intersectsRangeXY(rangeA))\n      return;\n    let bitB0: number;\n    let bitB1: number;\n    const rangeA1 = Range3d.createNull();\n    const pointA0 = CurveCurveCloseApproachXY._workPointAA0;\n    const pointA1 = CurveCurveCloseApproachXY._workPointAA1;\n    const pointB0 = CurveCurveCloseApproachXY._workPointBB0;\n    const pointB1 = CurveCurveCloseApproachXY._workPointBB1;\n    const numA = lsA.numPoints();\n    const numB = lsB.numPoints();\n    if (numA > 1 && numB > 1) {\n      const dfA = 1.0 / (numA - 1);\n      const dfB = 1.0 / (numB - 1);\n      let fA0 = 0.0;\n      let fA1, fB0, fB1;\n      lsA.pointAt(0, pointA0);\n      for (let ia = 1; ia < numA; ia++, pointA0.setFrom(pointA1), fA0 = fA1) {\n        fA1 = ia * dfA;\n        fB0 = 0.0;\n        lsA.pointAt(ia, pointA1);\n        // rangeA1 is around line segment [A0,A1] expanded by max distance\n        rangeA1.setNull();\n        rangeA1.extendPoint(pointA0);\n        rangeA1.extendPoint(pointA1);\n        if (this._maxDistanceToAccept)\n          rangeA1.expandInPlace(this._maxDistanceToAccept);\n        if (rangeA1.intersectsRangeXY(rangeB)) {\n          lsB.pointAt(0, pointB0);\n          bitB0 = this.classifyBitsPointRangeXY(pointB0.x, pointB0.y, rangeA1);\n          for (let ib = 1; ib < numB; ib++, pointB0.setFrom(pointB1), fB0 = fB1, bitB0 = bitB1) {\n            lsB.pointAt(ib, pointB1);\n            bitB1 = this.classifyBitsPointRangeXY(pointB1.x, pointB1.y, rangeA1);\n            fB1 = ib * dfB;\n            // DO NOT study the segment in detail if both bitB bits are on for any of the 4 planes\n            // (i.e., no intersection between rangeA1 and the range around line segment [B0,B1])\n            if ((bitB0 & bitB1) === 0)\n              this.computeSegmentSegment(lsA, pointA0, fA0, pointA1, fA1, lsB, pointB0, fB0, pointB1, fB1, reversed);\n          }\n        }\n      }\n    }\n  }\n  /** Low level dispatch of curve collection. */\n  private dispatchCurveCollection(geomA: AnyCurve, geomAHandler: (geomA: any) => any): void {\n    const geomB = this._geometryB; // save\n    if (!geomB || !geomB.children || !(geomB instanceof CurveCollection))\n      return;\n    for (const child of geomB.children) {\n      this.resetGeometry(child);\n      geomAHandler(geomA);\n    }\n    this._geometryB = geomB; // restore\n  }\n  /** Low level dispatch to geomA given a CurveChainWithDistanceIndex in geometryB. */\n  private dispatchCurveChainWithDistanceIndex(geomA: AnyCurve, geomAHandler: (geomA: any) => any): void {\n    if (!this._geometryB || !(this._geometryB instanceof CurveChainWithDistanceIndex))\n      return;\n    if (geomA instanceof CurveChainWithDistanceIndex)\n      assert(false, \"call handleCurveChainWithDistanceIndex(geomA) instead\");\n    const saveResults = this.grabPairedResults();\n    const geomB = this._geometryB;\n    for (const child of geomB.path.children) {\n      this.resetGeometry(child);\n      geomAHandler(geomA);\n    }\n    this.resetGeometry(geomB);\n    const childResults = this._results.extractArray();\n    childResults.forEach((pair: CurveLocationDetailPair) => {\n      CurveChainWithDistanceIndex.convertChildDetailToChainDetailSingle(pair, undefined, geomB);\n      this._results.insert(pair);\n    });\n    saveResults.forEach((pair: CurveLocationDetailPair) => this._results.insert(pair));\n  }\n  /** Specifies whether the curve needs to be stroked for close approach computation. */\n  private needsStroking(curve?: AnyCurve): curve is BSplineCurve3dBase | TransitionSpiral3d {\n    return curve instanceof BSplineCurve3dBase || curve instanceof TransitionSpiral3d;\n  }\n  /**\n   * Process seeds for xy close approach between one curve and another curve.\n   * * Seeds typically result from solving a discrete close approach problem, where one or both curves have been stroked.\n   * * Refine each result via Newton iteration. If it doesn't converge, remove it.\n   * @param seeds the initial seed results to refine.\n   * @param curveA curve to find its XY close approach with curveB.\n   * @param curveAIsStroked whether `seeds` contains results from a linestring approximation to `curveA`\n   * @param curveB the other curve.\n   * @param curveBIsStroked whether `seeds` contains results from a linestring approximation to `curveB`\n   * @param reversed whether `curveB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.\n   */\n  private refineStrokedResultsByNewton(\n    seeds: CurveLocationDetailPair[],\n    curveA: CurvePrimitive, curveAIsStroked: boolean,\n    curveB: CurvePrimitive, curveBIsStroked: boolean,\n    reversed = false\n  ): void {\n    const xyMatchingFunction = new CurveCurveCloseApproachXYRRtoRRD(curveA, curveB);\n    const newtonSearcher = new Newton2dUnboundedWithDerivative(\n      xyMatchingFunction, this._maxIterations, this._newtonTolerance\n    );\n    for (const seed of seeds) {\n      const detailA = reversed ? seed.detailB : seed.detailA;\n      const detailB = reversed ? seed.detailA : seed.detailB;\n      assert(detailB.curve instanceof LineString3d, \"Caller has discretized the curve\");\n      // when the curve is stroked, project the discrete seed to compute a fraction in the original curve's parameter space\n      const u = curveAIsStroked ? curveA.closestPointXY(detailA.point)?.fraction ?? detailA.fraction : detailA.fraction;\n      const v = curveBIsStroked ? curveB.closestPointXY(detailB.point)?.fraction ?? detailB.fraction : detailB.fraction;\n      newtonSearcher.setUV(u, v);\n      if (newtonSearcher.runIterations()) {\n        const fractionA = newtonSearcher.getU();\n        const fractionB = newtonSearcher.getV();\n        if (this.acceptFraction(fractionA) && this.acceptFraction(fractionB))\n          this.testAndRecordPointPair(curveA, fractionA, undefined, curveB, fractionB, undefined, reversed);\n      } // ignore failure to converge\n    }\n  }\n  /**\n   * Append stroke points and return the line string.\n   * * This is a convenient wrapper for [[CurvePrimitive.emitStrokes]] but the analogous instance method cannot be added\n   * to that class due to the ensuing recursion with subclass [[LineString3d]].\n   * @param options options for stroking the instance curve.\n   * @param result object to receive appended stroke points; if omitted, a new object is created, populated, and returned.\n   */\n  private strokeCurve(curve: CurvePrimitive, options?: StrokeOptions, result?: LineString3d): LineString3d {\n    const ls = result ? result : LineString3d.create();\n    curve.emitStrokes(ls, options);\n    return ls;\n  }\n  /** Find and return the close approaches between curveA and the discretization of curveB. */\n  private computeDiscreteCloseApproachResults(curveA: CurvePrimitive, lsB: LineString3d, reversed: boolean): CurveLocationDetailPair[] {\n    const maxDist = this.maxDistanceToAccept;\n    const saveResults = this.grabPairedResults(); // save current results\n    const geomB = this._geometryB;\n    this.maxDistanceToAccept = maxDist ? maxDist * 1.2 : undefined; // HEURISTIC: allow slack for Newton seeds\n    this.resetGeometry(curveA);\n    this.handleLineString3d(lsB); // populate empty results with discrete solutions\n    if (!reversed) {\n      // handleLineString3d put lsB data into detailA, so if we aren't reversing, we need to swap\n      for (const result of this._results)\n        result.swapDetails();\n    }\n    this.resetGeometry(geomB);\n    this.maxDistanceToAccept = maxDist;\n    const discreteResults = this._results.extractArray();\n    saveResults.forEach((pair: CurveLocationDetailPair) => this._results.insert(pair)); // restore current results\n    return discreteResults;\n  }\n  /**\n   * Compute the XY close approach of a curve and another curve to be stroked.\n   * @param curveA curve to find its XY close approach with curveB.\n   * @param curveB the other curve, to be stroked.\n   * @param reversed whether `curveB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.\n   */\n  private dispatchCurveStrokedCurve(curveA: CurvePrimitive, curveB: CurvePrimitive, reversed: boolean): void {\n    // explicit search for intersections (Newton converges too slowly on DirectSpiral3d tangent intersections)\n    const intersections = CurveCurve.intersectionXYPairs(curveA, false, curveB, false, this._xyTolerance);\n    for (const intersection of intersections)\n      this.testAndRecordPair(intersection, reversed);\n    // append seeds computed by solving the discretized spiral close approach problem, then refine the seeds via Newton\n    const curveAIsStroked = this.needsStroking(curveA);\n    const cpA = curveAIsStroked ? this.strokeCurve(curveA) : curveA;\n    const cpB = this.strokeCurve(curveB);\n    const seeds = this.computeDiscreteCloseApproachResults(cpA, cpB, reversed);\n    this.refineStrokedResultsByNewton(seeds, curveA, curveAIsStroked, curveB, true, reversed);\n    if (curveA instanceof LineString3d) { // explicitly test corners (where Newton converges too slowly)\n      const fStep = Geometry.safeDivideFraction(1.0, curveA.numEdges(), 0);\n      const v0 = CurveCurveCloseApproachXY._workPointBB0;\n      for (let i = 1; i < curveA.numEdges(); ++i)\n        this.testAndRecordProjection(curveA, i * fStep, curveA.pointAtUnchecked(i, v0), curveB, reversed);\n    }\n    this.testAndRecordEndPointApproaches(curveA, curveB, reversed);\n  }\n  /** Double dispatch handler for strongly typed segment. */\n  public override handleLineSegment3d(segmentA: LineSegment3d): any {\n    if (this._geometryB instanceof LineSegment3d) {\n      const segmentB = this._geometryB;\n      this.computeSegmentSegment(\n        segmentA, segmentA.point0Ref, 0.0, segmentA.point1Ref, 1.0,\n        segmentB, segmentB.point0Ref, 0.0, segmentB.point1Ref, 1.0,\n        false,\n      );\n    } else if (this._geometryB instanceof LineString3d) {\n      this.computeSegmentLineString(segmentA, this._geometryB, false);\n    } else if (this._geometryB instanceof Arc3d) {\n      this.computeSegmentArc(segmentA, this._geometryB, false);\n    } else if (this.needsStroking(this._geometryB)) {\n      this.dispatchCurveStrokedCurve(segmentA, this._geometryB, false);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(segmentA, this.handleLineSegment3d.bind(this));\n    } else if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(segmentA, this.handleLineSegment3d.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed linestring. */\n  public override handleLineString3d(lsA: LineString3d): any {\n    if (this._geometryB instanceof LineSegment3d) {\n      this.computeSegmentLineString(this._geometryB, lsA, true);\n    } else if (this._geometryB instanceof LineString3d) {\n      this.computeLineStringLineString(lsA, this._geometryB, false);\n    } else if (this._geometryB instanceof Arc3d) {\n      this.computeArcLineString(this._geometryB, lsA, true);\n    } else if (this.needsStroking(this._geometryB)) {\n      this.dispatchCurveStrokedCurve(lsA, this._geometryB, false);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(lsA, this.handleLineString3d.bind(this));\n    } else if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(lsA, this.handleLineString3d.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed arc. */\n  public override handleArc3d(arcA: Arc3d): any {\n    if (this._geometryB instanceof LineSegment3d) {\n      this.computeSegmentArc(this._geometryB, arcA, true);\n    } else if (this._geometryB instanceof LineString3d) {\n      this.computeArcLineString(arcA, this._geometryB, false);\n    } else if (this._geometryB instanceof Arc3d) {\n      this.dispatchArcArc(arcA, this._geometryB, false);\n    } else if (this.needsStroking(this._geometryB)) {\n      this.dispatchCurveStrokedCurve(arcA, this._geometryB, false);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(arcA, this.handleArc3d.bind(this));\n    } else if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(arcA, this.handleArc3d.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed bspline curve. */\n  public override handleBSplineCurve3d(curveA: BSplineCurve3d): any {\n    if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(curveA, this.handleBSplineCurve3d.bind(this));\n    } else if (this._geometryB instanceof CurvePrimitive) {\n      this.dispatchCurveStrokedCurve(this._geometryB, curveA, true);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(curveA, this.handleBSplineCurve3d.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed spiral curve. */\n  public override handleTransitionSpiral(spiral: TransitionSpiral3d): any {\n    if (this._geometryB instanceof CurveChainWithDistanceIndex) {\n      this.dispatchCurveChainWithDistanceIndex(spiral, this.handleTransitionSpiral.bind(this));\n    } else if (this._geometryB instanceof CurvePrimitive) {\n      this.dispatchCurveStrokedCurve(this._geometryB, spiral, true);\n    } else if (this._geometryB instanceof CurveCollection) {\n      this.dispatchCurveCollection(spiral, this.handleTransitionSpiral.bind(this));\n    }\n    return undefined;\n  }\n  /** Double dispatch handler for strongly typed CurveChainWithDistanceIndex. */\n  public override handleCurveChainWithDistanceIndex(chain: CurveChainWithDistanceIndex): any {\n    super.handleCurveChainWithDistanceIndex(chain);\n    // if _geometryB is also a CurveChainWithDistanceIndex, it will already have been converted by dispatchCurveChainWithDistanceIndex\n    const childResults = this._results.extractArray();\n    childResults.forEach((pair: CurveLocationDetailPair) => {\n      CurveChainWithDistanceIndex.convertChildDetailToChainDetailSingle(pair, chain, undefined);\n      this._results.insert(pair);\n    });\n  }\n  /** Double dispatch handler for strongly typed homogeneous bspline curve .. */\n  public override handleBSplineCurve3dH(_curve: BSplineCurve3dH): any {\n    // NEEDS WORK -- make \"dispatch\" methods tolerant of both 3d and 3dH\n    return undefined;\n  }\n}\n"]}