@itwin/core-geometry 5.0.0-dev.3 → 5.0.0-dev.32

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,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrC,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,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;AA9HD,gCA8HC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\r\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyCurve } from \"./CurveTypes\";\r\nimport { CurveCurveCloseApproachXY } from \"./internalContexts/CurveCurveCloseApproachXY\";\r\nimport { CurveCurveIntersectXY } from \"./internalContexts/CurveCurveIntersectXY\";\r\nimport { CurveCurveIntersectXYZ } from \"./internalContexts/CurveCurveIntersectXYZ\";\r\n\r\n/**\r\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\r\n * @public\r\n */\r\nexport class CurveCurve {\r\n  /**\r\n   * Return xy intersections of 2 curves.\r\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\r\n   * @param curveA first curve\r\n   * @param extendA true to allow curveA to extend\r\n   * @param curveB second curve\r\n   * @param extendB true to allow curveB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionXYPairs(\r\n    curveA: AnyCurve,\r\n    extendA: boolean,\r\n    curveB: AnyCurve,\r\n    extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    return CurveCurve.intersectionProjectedXYPairs(undefined, curveA, extendA, curveB, extendB, tolerance);\r\n  }\r\n  /**\r\n   * Return xy intersections of 2 projected curves.\r\n   * * Curves can be extended if extend flags are set. B-splines are not extended even if the flag is set.\r\n   * @param worldToLocal transform (possibly perspective) defining the local coordinates in which to compute xy intersections\r\n   * @param curveA first curve\r\n   * @param extendA true to allow curveA to extend\r\n   * @param curveB second curve\r\n   * @param extendB true to allow curveB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionProjectedXYPairs(\r\n    worldToLocal: Matrix4d | undefined,\r\n    curveA: AnyCurve,\r\n    extendA: boolean,\r\n    curveB: AnyCurve,\r\n    extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(worldToLocal, extendA, curveB, extendB, tolerance);\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return full 3d xyz intersections of 2 curves.\r\n   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\r\n   *  * Not Implemented for bspline and bezier curves.\r\n   * @param curveA first curve\r\n   * @param extendA true to allow curveA to extend\r\n   * @param curveB second curve\r\n   * @param extendB true to allow curveB to extend\r\n   * @returns array of intersections structured as CurveLocationDetailPair[]\r\n   */\r\n  public static intersectionXYZPairs(\r\n    curveA: AnyCurve, extendA: boolean, curveB: AnyCurve, extendB: boolean,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXYZ(extendA, curveB, extendB);\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of input curves.\r\n   * @param primitives input curves to intersect\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static allIntersectionsAmongPrimitivesXY(\r\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);\r\n    for (let i = 0; i < primitives.length; i++) {\r\n      const curveA = primitives[i];\r\n      for (let j = i + 1; j < primitives.length; j++) {\r\n        handler.resetGeometry(primitives[j]);\r\n        curveA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return at least one XY close approach between 2 curves.\r\n   * * Close approach xy-distances are measured without regard to z. This is equivalent to their separation distance\r\n   * as seen in the top view, or as measured between their projections onto the xy-plane.\r\n   * * If more than one approach is returned, one of them is the closest approach.\r\n   * * If an input curve is a `CurveCollection`, then close approaches are computed to each `CurvePrimitive` child.\r\n   * This can lead to many returned pairs, especially when both inputs are `CurveCollection`s. If an input curve is\r\n   * an `AnyRegion` then close approaches are computed only to the boundary curves, not to the interior.\r\n   * @param curveA first curve\r\n   * @param curveB second curve\r\n   * @param maxDistance maximum xy-distance to consider between the curves.\r\n   * Close approaches further than this xy-distance are not returned.\r\n   */\r\n  public static closeApproachProjectedXYPairs(\r\n    curveA: AnyCurve, curveB: AnyCurve, maxDistance: number,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveCloseApproachXY(curveB);\r\n    handler.maxDistanceToAccept = maxDistance;\r\n    curveA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Convenience method that calls [[closeApproachProjectedXYPairs]] with a large `maxDistance`\r\n   * and returns a detail pair representing the closest xy-approach between the curves.\r\n   * * There may be many detail pairs that represent \"closest\" xy-approach, including coincident interval pairs,\r\n   * isolated intersections, or close approaches within tolerance of each other. This method makes no attempt to\r\n   * distinguish among them, and returns a pair whose `detail.point` values are separated by the smallest xy distance\r\n   * found among the pairs.\r\n   * @param curveA first curve\r\n   * @param curveB second curve\r\n   * @return detail pair of closest xy-approach, undefined if not found\r\n   */\r\n  public static closestApproachProjectedXYPair(curveA: AnyCurve, curveB: AnyCurve): CurveLocationDetailPair | undefined {\r\n    const range = curveA.range();\r\n    range.extendRange(curveB.range());\r\n    const maxDistance = range.low.distanceXY(range.high);\r\n    const closeApproaches = this.closeApproachProjectedXYPairs(curveA, curveB, maxDistance);\r\n    if (!closeApproaches.length)\r\n      return undefined;\r\n    let iMin = 0;\r\n    let minDistXY = 2 * maxDistance;\r\n    for (let i = 0; i < closeApproaches.length; ++i) {\r\n      const distXY = closeApproaches[i].detailA.point.distanceXY(closeApproaches[i].detailB.point);\r\n      if (distXY < minDistXY) {\r\n        iMin = i;\r\n        minDistXY = distXY;\r\n      }\r\n    }\r\n    return closeApproaches[iMin];\r\n  }\r\n}\r\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;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,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrC,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,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;AA9HD,gCA8HC","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.resetGeometry(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 boundary curves, not to the interior.\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      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"]}

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

@@ -1 +1 @@
-{"version":3,"file":"CurveExtendMode.js","sourceRoot":"","sources":["../../../src/curve/CurveExtendMode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAGvC;;;;GAIG;AACH,IAAY,eAOX;AAPD,WAAY,eAAe;IACzB,4BAA4B;IAC5B,qDAAQ,CAAA;IACR,oDAAoD;IACpD,+DAAa,CAAA;IACb,8CAA8C;IAC9C,2DAAW,CAAA;AACb,CAAC,EAPW,eAAe,+BAAf,eAAe,QAO1B;AACD;;;GAGG;AACH,MAAa,kBAAkB;IAC7B;;;;;;OAMG;IACI,MAAM,CAAC,mDAAmD,CAC/D,KAAkC,EAAE,QAAe;QAEnD,IAAI,KAAK,KAAK,KAAK;YACjB,OAAO,eAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,KAAK,KAAK,IAAI;YAChB,OAAO,eAAe,CAAC,OAAO,CAAC;QACjC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACtB,OAAO,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,WAAwC,EAAE,QAAgB;QACtF,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,6BAA6B,CACzC,WAAwC,EAAE,OAAe,EAAE,KAAiB;QAE5E,IAAI,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;oBACnC,sEAAsE;oBACtE,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;gBAC5D,CAAC;qBAAM,CAAC;oBACN,0BAA0B;oBAC1B,IAAI,QAAQ,GAAG,GAAG;wBAChB,QAAQ,IAAI,cAAc,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBAC1C,IAAI,QAAQ,GAAG,GAAG;oBAChB,QAAQ,IAAI,cAAc,CAAC;YAC/B,CAAC;iBAAM,CAAC,CAAC,eAAe;gBACtB,QAAQ,GAAG,mBAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAtED,gDAsEC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { AngleSweep } from \"../geometry3d/AngleSweep\";\r\n\r\n/**\r\n * Enumeration of condition for extending a curve beyond start or end point.\r\n * * Not all CurvePrimitives support these modes.\r\n * @public\r\n */\r\nexport enum CurveExtendMode {\r\n  /** No extension allowed. */\r\n  None = 0,\r\n  /** Extend along continuation of the end tangent. */\r\n  OnTangent = 1,\r\n  /** Extend along continuation of the curve. */\r\n  OnCurve = 2,\r\n}\r\n/**\r\n * Logic for deciding how a curve may be extended for closest point or intersection searches.\r\n * @public\r\n */\r\nexport class CurveExtendOptions {\r\n  /**\r\n   * Given a `VariantCurveExtendParameter`, isolate the particular CurveExtendMode in effect at an end.\r\n   * * Return `CurveExtendMode.None` if `param === false`.\r\n   * * Return `CurveExtendMode.OnCurve` if `param === true`.\r\n   * * Return the param if it is a single CurveExtendMode.\r\n   * * Return dereferenced array at entry `endIndex` if the param is an array of CurveExtendMode.\r\n   */\r\n  public static resolveVariantCurveExtendParameterToCurveExtendMode(\r\n    param: VariantCurveExtendParameter, endIndex: 0 | 1,\r\n  ): CurveExtendMode {\r\n    if (param === false)\r\n      return CurveExtendMode.None;\r\n    if (param === true)\r\n      return CurveExtendMode.OnCurve;\r\n    if (Array.isArray(param))\r\n      return param.length > endIndex ? param[endIndex] : CurveExtendMode.None;\r\n    return param;\r\n  }\r\n  /**\r\n   * Correct fraction to be within [0,1].\r\n   * * If fraction is in [0,1] return it unchanged.\r\n   * * If fraction is less than 0 use `extendParam` to decide whether to return it unchanged, or to return 0.\r\n   * * If fraction is greater than 1 use `extendParam` to decide whether to return it unchanged, or to return 1.\r\n   */\r\n  public static correctFraction(extendParam: VariantCurveExtendParameter, fraction: number): number {\r\n    if (fraction < 0) {\r\n      const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\r\n      if (mode === CurveExtendMode.None)\r\n        fraction = 0.0;\r\n    } else if (fraction > 1.0) {\r\n      const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\r\n      if (mode === CurveExtendMode.None)\r\n        fraction = 1.0;\r\n    }\r\n    return fraction;\r\n  }\r\n  /**\r\n   * Adjust a radians value to an angle sweep, allowing the extendParam to affect choice among periodic fractions.\r\n   * * If radians is within the sweep, convert it to a fraction of the sweep.\r\n   * * If radians is outside, use the extendParam to choose among:\r\n   *    * fraction below 0.\r\n   *    * fraction above 1.\r\n   */\r\n  public static resolveRadiansToSweepFraction(\r\n    extendParam: VariantCurveExtendParameter, radians: number, sweep: AngleSweep,\r\n  ): number {\r\n    let fraction = sweep.radiansToSignedPeriodicFraction(radians);\r\n    if (!sweep.isRadiansInSweep(radians)) {\r\n      const fractionPeriod = sweep.fractionPeriod();\r\n      const mode0 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\r\n      const mode1 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\r\n      if (mode0 !== CurveExtendMode.None) {\r\n        if (mode1 !== CurveExtendMode.None) {\r\n          // both extensions possible; let the sweep resolve to the \"closer\" end\r\n          fraction = sweep.radiansToSignedPeriodicFraction(radians);\r\n        } else {\r\n          // only extend to negative\r\n          if (fraction > 1.0)\r\n            fraction -= fractionPeriod;\r\n        }\r\n      } else if (mode1 !== CurveExtendMode.None) {\r\n        if (fraction < 0.0)\r\n          fraction += fractionPeriod;\r\n      } else { // both clamped\r\n        fraction = Geometry.clamp(fraction, 0, 1);\r\n      }\r\n    }\r\n    return fraction;\r\n  }\r\n}\r\n/**\r\n * Variant options for extending a curve.\r\n * * Useful for specifying either a single boolean/`CurveExtendMode` option applicable to both ends of the curve,\r\n * or an array of options, the first entry of which applies to the curve start; the second, to curve end.\r\n * @public\r\n */\r\nexport type VariantCurveExtendParameter = boolean | CurveExtendMode | CurveExtendMode[];\r\n"]}
+{"version":3,"file":"CurveExtendMode.js","sourceRoot":"","sources":["../../../src/curve/CurveExtendMode.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAGvC;;;;GAIG;AACH,IAAY,eAOX;AAPD,WAAY,eAAe;IACzB,4BAA4B;IAC5B,qDAAQ,CAAA;IACR,oDAAoD;IACpD,+DAAa,CAAA;IACb,8CAA8C;IAC9C,2DAAW,CAAA;AACb,CAAC,EAPW,eAAe,+BAAf,eAAe,QAO1B;AACD;;;GAGG;AACH,MAAa,kBAAkB;IAC7B;;;;;;OAMG;IACI,MAAM,CAAC,mDAAmD,CAC/D,KAAkC,EAAE,QAAe;QAEnD,IAAI,KAAK,KAAK,KAAK;YACjB,OAAO,eAAe,CAAC,IAAI,CAAC;QAC9B,IAAI,KAAK,KAAK,IAAI;YAChB,OAAO,eAAe,CAAC,OAAO,CAAC;QACjC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACtB,OAAO,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,WAAwC,EAAE,QAAgB;QACtF,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;aAAM,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACpG,IAAI,IAAI,KAAK,eAAe,CAAC,IAAI;gBAC/B,QAAQ,GAAG,GAAG,CAAC;QACnB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,6BAA6B,CACzC,WAAwC,EAAE,OAAe,EAAE,KAAiB;QAE5E,IAAI,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,MAAM,cAAc,GAAG,KAAK,CAAC,cAAc,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,MAAM,KAAK,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;YACrG,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBACnC,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;oBACnC,sEAAsE;oBACtE,QAAQ,GAAG,KAAK,CAAC,+BAA+B,CAAC,OAAO,CAAC,CAAC;gBAC5D,CAAC;qBAAM,CAAC;oBACN,0BAA0B;oBAC1B,IAAI,QAAQ,GAAG,GAAG;wBAChB,QAAQ,IAAI,cAAc,CAAC;gBAC/B,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,eAAe,CAAC,IAAI,EAAE,CAAC;gBAC1C,IAAI,QAAQ,GAAG,GAAG;oBAChB,QAAQ,IAAI,cAAc,CAAC;YAC/B,CAAC;iBAAM,CAAC,CAAC,eAAe;gBACtB,QAAQ,GAAG,mBAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAtED,gDAsEC","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 { AngleSweep } from \"../geometry3d/AngleSweep\";\n\n/**\n * Enumeration of condition for extending a curve beyond start or end point.\n * * Not all CurvePrimitives support these modes.\n * @public\n */\nexport enum CurveExtendMode {\n  /** No extension allowed. */\n  None = 0,\n  /** Extend along continuation of the end tangent. */\n  OnTangent = 1,\n  /** Extend along continuation of the curve. */\n  OnCurve = 2,\n}\n/**\n * Logic for deciding how a curve may be extended for closest point or intersection searches.\n * @public\n */\nexport class CurveExtendOptions {\n  /**\n   * Given a `VariantCurveExtendParameter`, isolate the particular CurveExtendMode in effect at an end.\n   * * Return `CurveExtendMode.None` if `param === false`.\n   * * Return `CurveExtendMode.OnCurve` if `param === true`.\n   * * Return the param if it is a single CurveExtendMode.\n   * * Return dereferenced array at entry `endIndex` if the param is an array of CurveExtendMode.\n   */\n  public static resolveVariantCurveExtendParameterToCurveExtendMode(\n    param: VariantCurveExtendParameter, endIndex: 0 | 1,\n  ): CurveExtendMode {\n    if (param === false)\n      return CurveExtendMode.None;\n    if (param === true)\n      return CurveExtendMode.OnCurve;\n    if (Array.isArray(param))\n      return param.length > endIndex ? param[endIndex] : CurveExtendMode.None;\n    return param;\n  }\n  /**\n   * Correct fraction to be within [0,1].\n   * * If fraction is in [0,1] return it unchanged.\n   * * If fraction is less than 0 use `extendParam` to decide whether to return it unchanged, or to return 0.\n   * * If fraction is greater than 1 use `extendParam` to decide whether to return it unchanged, or to return 1.\n   */\n  public static correctFraction(extendParam: VariantCurveExtendParameter, fraction: number): number {\n    if (fraction < 0) {\n      const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\n      if (mode === CurveExtendMode.None)\n        fraction = 0.0;\n    } else if (fraction > 1.0) {\n      const mode = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\n      if (mode === CurveExtendMode.None)\n        fraction = 1.0;\n    }\n    return fraction;\n  }\n  /**\n   * Adjust a radians value to an angle sweep, allowing the extendParam to affect choice among periodic fractions.\n   * * If radians is within the sweep, convert it to a fraction of the sweep.\n   * * If radians is outside, use the extendParam to choose among:\n   *    * fraction below 0.\n   *    * fraction above 1.\n   */\n  public static resolveRadiansToSweepFraction(\n    extendParam: VariantCurveExtendParameter, radians: number, sweep: AngleSweep,\n  ): number {\n    let fraction = sweep.radiansToSignedPeriodicFraction(radians);\n    if (!sweep.isRadiansInSweep(radians)) {\n      const fractionPeriod = sweep.fractionPeriod();\n      const mode0 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 0);\n      const mode1 = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendParam, 1);\n      if (mode0 !== CurveExtendMode.None) {\n        if (mode1 !== CurveExtendMode.None) {\n          // both extensions possible; let the sweep resolve to the \"closer\" end\n          fraction = sweep.radiansToSignedPeriodicFraction(radians);\n        } else {\n          // only extend to negative\n          if (fraction > 1.0)\n            fraction -= fractionPeriod;\n        }\n      } else if (mode1 !== CurveExtendMode.None) {\n        if (fraction < 0.0)\n          fraction += fractionPeriod;\n      } else { // both clamped\n        fraction = Geometry.clamp(fraction, 0, 1);\n      }\n    }\n    return fraction;\n  }\n}\n/**\n * Variant options for extending a curve.\n * * Useful for specifying either a single boolean/`CurveExtendMode` option applicable to both ends of the curve,\n * or an array of options, the first entry of which applies to the curve start; the second, to curve end.\n * @public\n */\nexport type VariantCurveExtendParameter = boolean | CurveExtendMode | CurveExtendMode[];\n"]}

package/lib/cjs/curve/CurveFactory.d.ts

@@ -23,13 +23,14 @@ import { Path } from "./Path";
 import { IntegratedSpiralTypeName } from "./spiral/TransitionSpiral3d";
 import { StrokeOptions } from "./StrokeOptions";
 /**
- * Interface to carry parallel arrays of planes and sections, and optional geometry assembled from them, as returned by [CurveFactory.createMiteredSweepSections].
+ * Interface to carry parallel arrays of planes and sections, and optional geometry assembled from them,
+ * as returned by [CurveFactory.createMiteredSweepSections].
  * @public
  */
 export interface SectionSequenceWithPlanes {
-    /** the plane of each section */
+    /** The plane of each section. */
     planes: Plane3dByOriginAndUnitNormal[];
-    /** section curve projected onto the corresponding plane */
+    /** Section curve projected onto the corresponding plane. */
     sections: AnyCurve[];
     /**
      * Optional `RuledSweep` generated from the sections.
@@ -60,17 +61,21 @@ export interface MiteredSweepOptions {
     wrapIfPhysicallyClosed?: boolean;
     /** Whether to output sections only, or sections plus optional geometry constructed from them. Default value is `MiteredSweepOutputSelect.Sections`. */
     outputSelect?: MiteredSweepOutputSelect;
-    /** How to stroke the ruled sweep if outputting a mesh. If undefined, default stroke options are used. */
+    /** How to stroke smooth input curves. If undefined, default stroke options are used. */
     strokeOptions?: StrokeOptions;
     /** Whether to cap the ruled sweep if outputting a ruled sweep or mesh. Default value is `false`. */
     capped?: boolean;
+    /** The first section's normal is aligned to this vector, typically the start tangent of the smooth curve stroked for the centerline. */
+    startTangent?: Vector3d;
+    /** The last section's normal is aligned to this vector, typically the end tangent of the smooth curve stroked for the centerline. */
+    endTangent?: Vector3d;
 }
 /**
  * The `CurveFactory` class contains methods for specialized curve constructions.
  * @public
  */
 export declare class CurveFactory {
-    /** (cautiously) construct and save a line segment between fractional positions. */
+    /** (Cautiously) construct and save a line segment between fractional positions. */
     private static addPartialSegment;
     /**
      * Create a circular arc defined by start point, tangent at start point, and end point.
@@ -89,23 +94,25 @@ export declare class CurveFactory {
      * @param allowBackupAlongEdge true to allow edges to be created going "backwards" along edges if needed to create the blend.
      */
     static createFilletsInLineString(points: LineString3d | IndexedXYZCollection | Point3d[], radius: number | number[], allowBackupAlongEdge?: boolean): Path | undefined;
-    /** Create a `Loop` with given xy corners and fixed z.
+    /**
+     * Create a `Loop` with given xy corners and fixed z.
      * * The corners always proceed counter clockwise from lower left.
      * * If the radius is too large for the outer rectangle size, it is reduced to half of the the smaller x or y size.
-    */
+     */
     static createRectangleXY(x0: number, y0: number, x1: number, y1: number, z?: number, filletRadius?: number): Loop;
     /**
      * If `arcB` is a continuation of `arcA`, extend `arcA` (in place) to include the range of `arcB`
      * * This only succeeds if the two arcs are part of identical complete arcs and end of `arcA` matches the beginning of `arcB`.
-     * @param arcA first arc, modified in place
-     * @param arcB second arc, unmodified
-     * @param allowReversed whether to consolidate even when second arc is reversed
-     * @returns whether `arcA` was modified
+     * @param arcA first arc, modified in place.
+     * @param arcB second arc, unmodified.
+     * @param allowReversed whether to consolidate even when second arc is reversed.
+     * @returns whether `arcA` was modified.
      */
     static appendToArcInPlace(arcA: Arc3d, arcB: Arc3d, allowReverse?: boolean): boolean;
     /**
      * Return a `Path` containing arcs are on the surface of an ellipsoid and pass through a sequence of points.
-     * * Each arc passes through the two given endpoints and in the plane containing the true surface normal at given `fractionForIntermediateNormal`
+     * * Each arc passes through the two given endpoints and in the plane containing the true surface normal at
+     * given `fractionForIntermediateNormal`
      * @param ellipsoid
      * @param pathPoints
      * @param fractionForIntermediateNormal fractional position for surface normal used to create the section plane.
@@ -114,39 +121,71 @@ export declare class CurveFactory {
     private static appendGeometryQueryArray;
     /**
      * Create solid primitives for pipe segments (e.g. Cone or TorusPipe) around line and arc primitives.
-     * @param centerline centerline geometry/
+     * @param centerline centerline geometry.
      * @param pipeRadius radius of pipe.
      */
     static createPipeSegments(centerline: CurvePrimitive | CurveChain, pipeRadius: number): GeometryQuery | GeometryQuery[] | undefined;
+    /** Get start point and tangent for variant curve data. */
+    private static startPointAndTangent;
+    /** Create an [[Arc3d]] from `sectionData` that has its center at the start point of the centerline. */
+    static createArcFromSectionData(centerline: IndexedXYZCollection | Point3d[] | CurvePrimitive, sectionData: number | XAndY | Arc3d): Arc3d | undefined;
     /**
-     * * Create section arcs for mitered pipe.
-     * * At each end of each pipe, the pipe is cut by the plane that bisects the angle between successive pipe centerlines.
-     * * The arc definitions are constructed so that lines between corresponding fractional positions on the arcs are
-     *     axial lines on the pipes.
-     * * This means that each arc definition axes (aka vector0 and vector90) are _not_ perpendicular to each other.
-     * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis lengths, or a full Arc3d.
-     *    * For semi-axis length input, x corresponds to an ellipse local axis nominally situated parallel to the xy-plane.
-     *    * The center of Arc3d input is translated to the centerline start point to act as initial cross section.
-     * @param centerline centerline of pipe
-     * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d
+     * Create section arcs for mitered pipe.
+     * * At the end of each pipe segment, the pipe is mitered by the plane that bisects the angle between successive
+     * centerline segments.
+     * * The section arcs are constructed so that lines between corresponding fractional positions on the arcs are
+     *   axial lines on the pipes.
+     * * This means that the initial arc's vector0 and vector90 lengths and angular separation are _not_ preserved in
+     * the section arcs.
+     * * Circular or elliptical pipe cross sections can be specified by supplying either a radius, a pair of semi-axis
+     * lengths, or an Arc3d:
+     *    * For semi-axis length input, x and y correspond to ellipse local axes perpendicular to each other and to the
+     * start tangent.
+     *    * For Arc3d input, the center is translated to the centerline start point. For best results, ensure this arc
+     * is perpendicular to the centerline start tangent.
+     * * This function internally calls [[createMiteredSweepSections]] with default options.
+     * @param centerline centerline of pipe. For best results, ensure no successive duplicate points with e.g.,
+     * [[GrowableXYZArray.createCompressed]].
+     * @param sectionData circle radius, ellipse semi-axis lengths, or full Arc3d (if not full, function makes it full).
+     * @returns array of sections or empty array if section creation failed.
      */
     static createMiteredPipeSections(centerline: IndexedXYZCollection, sectionData: number | XAndY | Arc3d): Arc3d[];
+    /** For a smooth curve, stroke and return unnormalized start/end tangents. */
+    private static strokeSmoothCurve;
+    /**
+     * Align two bisector plane normals to given smooth rail tangents or optional overrides.
+     * * Optionally average the normals for physically closed rail.
+     */
+    private static alignFirstAndLastBisectorPlanes;
+    /** Reverse a closed curve or region if necessary so that its orientation is CCW with respect to the plane normal. */
+    private static alignClosedCurveToPlane;
     /**
-     * Sweep the initialSection along each segment of the centerLine until it hits the bisector plane at the next vertex.
-     * * The caller should place the initialSection on a plane perpendicular to the first edge.
-     *   * This plane is commonly (but not necessarily) through the start point itself.
-     *   * If the geometry is not "on a perpendicular plane", the output geometry will still be flattened onto the various planes.
-     * * In the "open path" case (i.e when wrapIfPhysicallyClosed is false or the path does not have matched first and last points)
-     *       the first/last output plane will be at the start/end of the first/last edge and on a perpendicular plane.
-     * * In the "closed path" case, the output plane for the first and last point is the bisector of the start and end planes from the "open path" case,
-     *    and the first/last section geometry may be different from `initialSection`.
-     * * The centerline path does NOT have to be planar, however twisting effects effects will appear in the various bisector planes.
-     * @param centerline sweep path, e.g., as stroked from a smooth centerline curve
-     * @param initialSection profile curve to be swept. As noted above, this should be on a plane perpendicular to the first segment of the centerline.
-     * @param options options for computation and output
-     * @return array of sections, starting with `initialSection` projected along the first edge to the first plane.
+     * Projection to target plane, constructing sweep direction from two given planes.
+     * * If successful, push the target plane and swept section to the output arrays and return the swept section.
+     * * If unsuccessful, leave the output arrays alone and return the input section.
      */
-    static createMiteredSweepSections(centerline: IndexedXYZCollection | Point3d[], initialSection: AnyCurve, options: MiteredSweepOptions): SectionSequenceWithPlanes | undefined;
+    private static doSweepToPlane;
+    /**
+     * Sweep the `initialSection` along each segment of the (stroked) `centerline` until it hits the bisector plane at
+     * the next vertex.
+     * * For best results, the caller should place `initialSection` in a plane perpendicular to the `centerline`
+     * start tangent.
+     *   * This plane is commonly (but not necessarily) through the centerline start point itself.
+     *   * To compute the sections, `initialSection` is projected in the direction of the centerline start tangent onto
+     * the first bisector plane at the centerline start. The result of this projection will be likewise projected onto
+     * the second plane, and so on in sequence.
+     * * By default, the first/last bisector plane normals are set to the centerline start/end tangents. The caller can
+     * override these with tangents supplied in `options`. If the centerline is physically closed and
+     * `options.wrapIfPhysicallyClosed` is true, the first and last plane normals are averaged and equated.
+     * * The centerline path does NOT have to be planar, however non-planarity will result in twisting of the sections
+     * in the bisector planes.
+     * @param centerline sweep path. Will be stroked if smooth.
+     * @param initialSection profile curve to be swept. As noted above, this should be on a plane perpendicular to the
+     * centerline start tangent.
+     * @param options options for computation and output.
+     * @return array of sections, formed from projecting `initialSection` successively onto the bisector planes.
+     */
+    static createMiteredSweepSections(centerline: IndexedXYZCollection | Point3d[] | CurvePrimitive | CurveChain, initialSection: AnyCurve, options?: MiteredSweepOptions): SectionSequenceWithPlanes | undefined;
     /**
      * Create a circular arc from start point, tangent at start, radius, optional plane normal, arc sweep.
      * * The vector from start point to center is in the direction of upVector crossed with tangentA.
@@ -160,11 +199,11 @@ export declare class CurveFactory {
     /**
      * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.
      * * First spiral begins at given start point.
-     * * first tangent aims at shoulder
+     * * first tangent aims at shoulder.
      * * outbound spiral joins line from shoulder to target.
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * @param spiralType name of spiral type. THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param startPoint inbound start point.
-     * @param shoulder point target point for (both) spiral-to-line tangencies
+     * @param shoulder point target point for (both) spiral-to-line tangencies.
      * @return array with the computed spirals, or undefined if failure.
      */
     static createLineSpiralSpiralLine(spiralType: IntegratedSpiralTypeName, startPoint: Point3d, shoulderPoint: Point3d, targetPoint: Point3d): GeometryQuery[] | undefined;
@@ -172,30 +211,25 @@ export declare class CurveFactory {
      * Compute 2 spirals (all in XY) for a symmetric line-to-line transition.
      * * Spiral length is given.
      * * tangency points float on both lines.
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param pointA inbound start point.
-     * @param shoulder point target point for (both) spiral-to-line tangencies
+     * @param shoulder point target point for (both) spiral-to-line tangencies.
      * @param spiralLength for each part of the spiral pair.
      * @return array with the computed spirals, or undefined if failure.
      */
     static createLineSpiralSpiralLineWithSpiralLength(spiralType: IntegratedSpiralTypeName, pointA: Point3d, pointB: Point3d, pointC: Point3d, spiralLength: number): GeometryQuery[] | undefined;
     /**
      * Compute 2 spirals and an arc (all in XY) for a symmetric line-to-line transition.
-     * Spiral lengths and arc radius are given.   (e.g. from design speed standards.)
-     * @param spiralType name of spiral type.  THIS MUST BE AN "Integrated" SPIRAL TYPE
+     * Spiral lengths and arc radius are given (e.g., from design speed standards).
+     * @param spiralType name of spiral type. THIS MUST BE AN "Integrated" SPIRAL TYPE.
      * @param pointA inbound start point.
-     * @param pointB shoulder (target)  point for (both) spiral-to-line tangencies
-     * @param lengthA inbound spiral length
-     * @param lengthB outbound spiral length
+     * @param pointB shoulder (target)  point for (both) spiral-to-line tangencies.
+     * @param lengthA inbound spiral length.
+     * @param lengthB outbound spiral length.
      * @return array with the computed spirals, or undefined if failure.
      */
     static createLineSpiralArcSpiralLine(spiralType: IntegratedSpiralTypeName, pointA: Point3d, pointB: Point3d, pointC: Point3d, lengthA: number, lengthB: number, arcRadius: number): GeometryQuery[] | undefined;
-    /**
-     * Return the intersection point of 3 planes.
-     * @param planeA
-     * @param planeB
-     * @param planeC
-     */
+    /** Return the intersection point of 3 planes. */
     static planePlaneIntersectionRay(planeA: PlaneAltitudeEvaluator, planeB: PlaneAltitudeEvaluator): Ray3d | undefined;
 }
 //# sourceMappingURL=CurveFactory.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"CurveFactory.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveFactory.ts"],"names":[],"mappings":"AAKA;;GAEG;AAIH,OAAO,EAAkC,sBAAsB,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAG1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAGvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,KAAK,EAAgB,MAAM,SAAS,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE9B,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAIhD;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACxC,gCAAgC;IAChC,MAAM,EAAE,4BAA4B,EAAE,CAAC;IACvC,2DAA2D;IAC3D,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB;;;OAGG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,iFAAiF;IACjF,IAAI,CAAC,EAAE,eAAe,CAAC;CACxB;AAED;;;GAGG;AACH,oBAAY,wBAAwB;IAClC,8DAA8D;IAC9D,QAAQ,IAAI;IACZ,wEAAwE;IACxE,cAAc,IAAI;IAClB,6FAA6F;IAC7F,QAAQ,IAAI;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,iIAAiI;IACjI,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,uJAAuJ;IACvJ,YAAY,CAAC,EAAE,wBAAwB,CAAC;IACxC,yGAAyG;IACzG,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,oGAAoG;IACpG,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,qBAAa,YAAY;IACvB,mFAAmF;IACnF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAMhC;;;;OAIG;WACW,0BAA0B,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,GAAG,KAAK,GAAG,SAAS;IAOnH;;;;;;;;;OASG;WACW,yBAAyB,CAAC,MAAM,EAAE,YAAY,GAAG,oBAAoB,GAAG,OAAO,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,oBAAoB,GAAE,OAAc,GAAG,IAAI,GAAG,SAAS;IAuEnL;;;MAGE;WACY,iBAAiB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI;IAkC3H;;;;;;;OAOG;WACW,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,GAAE,OAAe,GAAG,OAAO;IA2BlG;;;;;;OAMG;WACW,2BAA2B,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,iBAAiB,EAAE,EAAE,6BAA6B,GAAE,MAAY,GAAG,IAAI;IAYnJ,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAUvC;;;;OAIG;WACW,kBAAkB,CAAC,UAAU,EAAE,cAAc,GAAG,UAAU,EAAE,UAAU,EAAE,MAAM,GAAG,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;IAoB1I;;;;;;;;;;;OAWG;WACW,yBAAyB,CAAC,UAAU,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE;IAqDvH;;;;;;;;;;;;;;OAcG;WACW,0BAA0B,CAAC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,EAAE,mBAAmB,GAAG,yBAAyB,GAAG,SAAS;IA2CrL;;;;;;;;OAQG;WACW,2BAA2B,CACvC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,UAAU,GACxG,KAAK,GAAG,SAAS;IAIpB;;;;;;;;;OASG;WACW,0BAA0B,CACtC,UAAU,EAAE,wBAAwB,EACpC,UAAU,EAAE,OAAO,EACnB,aAAa,EAAE,OAAO,EACtB,WAAW,EAAE,OAAO,GACnB,aAAa,EAAE,GAAG,SAAS;IAmC9B;;;;;;;;;OASG;WACW,0CAA0C,CACtD,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,YAAY,EAAE,MAAM,GACnB,aAAa,EAAE,GAAG,SAAS;IAoC9B;;;;;;;;;OASG;WACW,6BAA6B,CACzC,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,GAAG,SAAS;IAoD9B;;;;;OAKG;WACW,yBAAyB,CACrC,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,sBAAsB,GAAG,KAAK,GAAG,SAAS;CAuBrF"}
+{"version":3,"file":"CurveFactory.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveFactory.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAkC,sBAAsB,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,SAAS,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AACvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAG1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAG5C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAGvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,KAAK,EAAgB,MAAM,SAAS,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAa,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAG9B,OAAO,EAAE,wBAAwB,EAAE,MAAM,6BAA6B,CAAC;AACvE,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAIhD;;;;GAIG;AACH,MAAM,WAAW,yBAAyB;IACxC,iCAAiC;IACjC,MAAM,EAAE,4BAA4B,EAAE,CAAC;IACvC,4DAA4D;IAC5D,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB;;;OAGG;IACH,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,iFAAiF;IACjF,IAAI,CAAC,EAAE,eAAe,CAAC;CACxB;AAED;;;GAGG;AACH,oBAAY,wBAAwB;IAClC,8DAA8D;IAC9D,QAAQ,IAAI;IACZ,wEAAwE;IACxE,cAAc,IAAI;IAClB,6FAA6F;IAC7F,QAAQ,IAAI;CACb;AAED;;;GAGG;AACH,MAAM,WAAW,mBAAmB;IAClC,iIAAiI;IACjI,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,uJAAuJ;IACvJ,YAAY,CAAC,EAAE,wBAAwB,CAAC;IACxC,wFAAwF;IACxF,aAAa,CAAC,EAAE,aAAa,CAAC;IAC9B,oGAAoG;IACpG,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,wIAAwI;IACxI,YAAY,CAAC,EAAE,QAAQ,CAAC;IACxB,qIAAqI;IACrI,UAAU,CAAC,EAAE,QAAQ,CAAC;CACvB;AAeD;;;GAGG;AACH,qBAAa,YAAY;IACvB,mFAAmF;IACnF,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAUhC;;;;OAIG;WACW,0BAA0B,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,GAAG,EAAE,OAAO,GAAG,KAAK,GAAG,SAAS;IAOnH;;;;;;;;;OASG;WACW,yBAAyB,CACrC,MAAM,EAAE,YAAY,GAAG,oBAAoB,GAAG,OAAO,EAAE,EACvD,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,EACzB,oBAAoB,GAAE,OAAc,GACnC,IAAI,GAAG,SAAS;IAuEnB;;;;OAIG;WACW,iBAAiB,CAC7B,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,GAAE,MAAU,EAAE,YAAY,CAAC,EAAE,MAAM,GACnF,IAAI;IA4CP;;;;;;;OAOG;WACW,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,GAAE,OAAe,GAAG,OAAO;IA6BlG;;;;;;;OAOG;WACW,2BAA2B,CACvC,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,iBAAiB,EAAE,EAAE,6BAA6B,GAAE,MAAY,GACjG,IAAI;IAWP,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAQvC;;;;OAIG;WACW,kBAAkB,CAC9B,UAAU,EAAE,cAAc,GAAG,UAAU,EAAE,UAAU,EAAE,MAAM,GAC1D,aAAa,GAAG,aAAa,EAAE,GAAG,SAAS;IAmB9C,0DAA0D;IAC1D,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAYnC,uGAAuG;WACzF,wBAAwB,CACpC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GACjG,KAAK,GAAG,SAAS;IAsBpB;;;;;;;;;;;;;;;;;;;OAmBG;WACW,yBAAyB,CAAC,UAAU,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE;IAUvH,6EAA6E;IAC7E,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAuBhC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAsB9C,qHAAqH;IACrH,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAmBtC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAqB7B;;;;;;;;;;;;;;;;;;;OAmBG;WACW,0BAA0B,CACtC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,cAAc,GAAG,UAAU,EAC1E,cAAc,EAAE,QAAQ,EACxB,OAAO,CAAC,EAAE,mBAAmB,GAC5B,yBAAyB,GAAG,SAAS;IAiCxC;;;;;;;;OAQG;WACW,2BAA2B,CACvC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,UAAU,GACxG,KAAK,GAAG,SAAS;IAGpB;;;;;;;;;OASG;WACW,0BAA0B,CACtC,UAAU,EAAE,wBAAwB,EACpC,UAAU,EAAE,OAAO,EACnB,aAAa,EAAE,OAAO,EACtB,WAAW,EAAE,OAAO,GACnB,aAAa,EAAE,GAAG,SAAS;IAkC9B;;;;;;;;;OASG;WACW,0CAA0C,CACtD,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,YAAY,EAAE,MAAM,GACnB,aAAa,EAAE,GAAG,SAAS;IA4C9B;;;;;;;;;OASG;WACW,6BAA6B,CACzC,UAAU,EAAE,wBAAwB,EACpC,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,GAChB,aAAa,EAAE,GAAG,SAAS;IAkD9B,iDAAiD;WACnC,yBAAyB,CACrC,MAAM,EAAE,sBAAsB,EAAE,MAAM,EAAE,sBAAsB,GAAG,KAAK,GAAG,SAAS;CAsBrF"}