@itwin/core-geometry 5.9.0-dev.15 → 5.9.0-dev.16

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

@@ -1 +1 @@
-{"version":3,"file":"Loop.d.ts","sourceRoot":"","sources":["../../../src/curve/Loop.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;GAIG;AACH,qBAAa,IAAK,SAAQ,UAAU;IAClC,wCAAwC;IACxC,SAAgB,mBAAmB,UAAU;IAC7C,qFAAqF;IACrE,OAAO,EAAE,OAAO,CAAS;IACzC,kCAAkC;IAC3B,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;;IAMzD;;;;;OAKG;WACW,MAAM,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI;IAUvD;;;;;OAKG;WACW,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI;IAGzD;;;MAGE;WACY,aAAa,CAAC,MAAM,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,IAAI;IAK3E,wDAAwD;IACjD,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAYlD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAQhC,2DAA2D;IACpD,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,2CAA2C;IACpC,cAAc,IAAI,IAAI;IAG7B,uEAAuE;IAChE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE;AAED;;;GAGG;AACH,qBAAa,kBAAkB;IAC7B,iBAAiB;IACV,KAAK,CAAC,EAAE,IAAI,CAAC;IACpB,2CAA2C;IACpC,MAAM,CAAC,EAAE,cAAc,CAAC;IAC/B,kBAAkB;IACX,KAAK,CAAC,EAAE,IAAI,CAAC;IACpB,2CAA2C;IACpC,MAAM,CAAC,EAAE,cAAc,CAAC;IAC/B,kBAAkB;gBAEhB,KAAK,EAAE,IAAI,GAAG,SAAS,EAAE,MAAM,EAAE,cAAc,GAAG,SAAS,EAAE,KAAK,EAAE,IAAI,GAAG,SAAS,EAAE,MAAM,EAAE,cAAc,GAAG,SAAS;IAO1H,uCAAuC;IAChC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc;IAI7C,uCAAuC;IAChC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc;CAI9C;AAED;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,iFAAiF;IACjF,iBAAiB,EAAE,IAAI,EAAE,CAAC;IAC1B,0EAA0E;IAC1E,iBAAiB,EAAE,IAAI,EAAE,CAAC;IAC1B,mEAAmE;IACnE,OAAO,EAAE,IAAI,EAAE,CAAC;IAChB,2CAA2C;IAC3C,KAAK,CAAC,EAAE,kBAAkB,EAAE,CAAC;CAC9B"}
+{"version":3,"file":"Loop.d.ts","sourceRoot":"","sources":["../../../src/curve/Loop.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;GAIG;AACH,qBAAa,IAAK,SAAQ,UAAU;IAClC,wCAAwC;IACxC,SAAgB,mBAAmB,UAAU;IAC7C,qFAAqF;IACrE,OAAO,EAAE,OAAO,CAAS;IACzC,kCAAkC;IAC3B,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;;IAMzD;;;;;OAKG;WACW,MAAM,CAAC,GAAG,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI;IAUvD;;;;;OAKG;WACW,WAAW,CAAC,MAAM,EAAE,cAAc,EAAE,GAAG,IAAI;IAGzD;;;MAGE;WACY,aAAa,CAAC,MAAM,EAAE,oBAAoB,GAAG,OAAO,EAAE,GAAG,IAAI;IAK3E,wDAAwD;IACjD,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;IAYlD,gFAAgF;IACzE,eAAe,IAAI,MAAM;IAQhC,2DAA2D;IACpD,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,2CAA2C;IACpC,cAAc,IAAI,IAAI;IAK7B,uEAAuE;IAChE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE;AAED;;;GAGG;AACH,qBAAa,kBAAkB;IAC7B,iBAAiB;IACV,KAAK,CAAC,EAAE,IAAI,CAAC;IACpB,2CAA2C;IACpC,MAAM,CAAC,EAAE,cAAc,CAAC;IAC/B,kBAAkB;IACX,KAAK,CAAC,EAAE,IAAI,CAAC;IACpB,2CAA2C;IACpC,MAAM,CAAC,EAAE,cAAc,CAAC;IAC/B,kBAAkB;gBAEhB,KAAK,EAAE,IAAI,GAAG,SAAS,EAAE,MAAM,EAAE,cAAc,GAAG,SAAS,EAAE,KAAK,EAAE,IAAI,GAAG,SAAS,EAAE,MAAM,EAAE,cAAc,GAAG,SAAS;IAO1H,uCAAuC;IAChC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc;IAI7C,uCAAuC;IAChC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,cAAc;CAI9C;AAED;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,iFAAiF;IACjF,iBAAiB,EAAE,IAAI,EAAE,CAAC;IAC1B,0EAA0E;IAC1E,iBAAiB,EAAE,IAAI,EAAE,CAAC;IAC1B,mEAAmE;IACnE,OAAO,EAAE,IAAI,EAAE,CAAC;IAChB,2CAA2C;IAC3C,KAAK,CAAC,EAAE,kBAAkB,EAAE,CAAC;CAC9B"}

package/lib/cjs/curve/Loop.js

@@ -87,7 +87,9 @@ class Loop extends CurveCollection_1.CurveChain {
     }
     /** Create a new `Loop` with no children */
     cloneEmptyPeer() {
-        return new Loop();
+        const emptyClone = new Loop();
+        emptyClone.isInner = this.isInner;
+        return emptyClone;
     }
     /** Second step of double dispatch:  call `handler.handleLoop(this)` */
     dispatchToGeometryHandler(handler) {

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

@@ -1 +1 @@
-{"version":3,"file":"Loop.js","sourceRoot":"","sources":["../../../src/curve/Loop.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,+EAA4E;AAC5E,uDAA+C;AAI/C,iDAA8C;AAG9C;;;;GAIG;AACH,MAAa,IAAK,SAAQ,4BAAU;IAClC,wCAAwC;IACxB,mBAAmB,GAAG,MAAM,CAAC;IAC7C,qFAAqF;IACrE,OAAO,GAAY,KAAK,CAAC;IACzC,kCAAkC;IAC3B,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,IAAI,CAAC;IAC/B,CAAC;IACD;QACE,KAAK,EAAE,CAAC;IACV,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,GAAG,MAAwB;QAC9C,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,YAAY,yDAA2B;gBAC9C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;;gBAE7C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CAAC,MAAwB;QAChD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,CAAC;IACD;;;MAGE;IACK,MAAM,CAAC,aAAa,CAAC,MAAwC;QAClE,MAAM,UAAU,GAAG,2BAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,UAAU,CAAC,eAAe,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACjC,CAAC;IACD,wDAAwD;IACjD,YAAY,CAAC,OAAuB;QACzC,MAAM,OAAO,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,mDAAmD;QACnD,OAAO,CAAC,qBAAqB,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC/B,OAAO,CAAC,QAAQ,EAAE,CAAC;YACnB,OAAO,CAAC,eAAe,EAAE,CAAC;QAC5B,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB;;;;WAIG;QACH,OAAO,CAAC,CAAC;IACX,CAAC;IACD,2DAA2D;IACpD,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACrD,CAAC;IACD,2CAA2C;IACpC,cAAc;QACnB,OAAO,IAAI,IAAI,EAAE,CAAC;IACpB,CAAC;IACD,uEAAuE;IAChE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACF;AAhFD,oBAgFC;AAED;;;GAGG;AACH,MAAa,kBAAkB;IAC7B,iBAAiB;IACV,KAAK,CAAQ;IACpB,2CAA2C;IACpC,MAAM,CAAkB;IAC/B,kBAAkB;IACX,KAAK,CAAQ;IACpB,2CAA2C;IACpC,MAAM,CAAkB;IAC/B,kBAAkB;IAClB,YACE,KAAuB,EAAE,MAAkC,EAAE,KAAuB,EAAE,MAAkC;QAExH,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IACD,uCAAuC;IAChC,IAAI,CAAC,IAAU,EAAE,KAAqB;QAC3C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IACD,uCAAuC;IAChC,IAAI,CAAC,IAAU,EAAE,KAAqB;QAC3C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;CACF;AA5BD,gDA4BC","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 */\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { CurveChainWithDistanceIndex } from \"./CurveChainWithDistanceIndex\";\nimport { CurveChain } from \"./CurveCollection\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { LineString3d } from \"./LineString3d\";\nimport { StrokeOptions } from \"./StrokeOptions\";\n\n/**\n * A `Loop` is a curve chain that is the boundary of a closed (planar) loop.\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\n * @public\n */\nexport class Loop extends CurveChain {\n  /** String name for schema properties */\n  public readonly curveCollectionType = \"loop\";\n  /** Tag value that can be set to true for user code to mark inner and outer loops. */\n  public override isInner: boolean = false;\n  /** Test if `other` is a `Loop` */\n  public isSameGeometryClass(other: GeometryQuery): boolean {\n    return other instanceof Loop;\n  }\n  public constructor() {\n    super();\n  }\n  /**\n   * Create a loop from a variable length list of [[CurvePrimitive]]s.\n   * * A significant gap between the end of one curve and the start of the next, or between chain start and end,\n   * is not bridged and may cause unexpected behavior.\n   * @param curves array of individual curve primitives, assumed to form a closed planar loop.\n   */\n  public static create(...curves: CurvePrimitive[]): Loop {\n    const result = new Loop();\n    for (const curve of curves) {\n      if (curve instanceof CurveChainWithDistanceIndex)\n        result.children.push(...curve.path.children);\n      else\n        result.children.push(curve);\n    }\n    return result;\n  }\n  /**\n   * Create a loop from an array of [[CurvePrimitive]]s.\n   * * A significant gap between the end of one curve and the start of the next, or between chain start and end,\n   * is not bridged and may cause unexpected behavior.\n   * @param curves array of individual curve primitives, assumed to form a closed planar loop.\n   */\n  public static createArray(curves: CurvePrimitive[]): Loop {\n    return this.create(...curves);\n  }\n  /**\n   * Create a loop from an array of coplanar points.\n   * @param points vertices of polygon, closure point optional.\n  */\n  public static createPolygon(points: IndexedXYZCollection | Point3d[]): Loop {\n    const linestring = LineString3d.create(points);\n    linestring.addClosurePoint();\n    return Loop.create(linestring);\n  }\n  /** Create a loop with the stroked form of this loop. */\n  public cloneStroked(options?: StrokeOptions): Loop {\n    const strokes = LineString3d.create();\n    for (const curve of this.children)\n      curve.emitStrokes(strokes, options);\n    // eliminate near-duplicate points between children\n    strokes.removeDuplicatePoints();\n    if (strokes.isPhysicallyClosed) {\n      strokes.popPoint();\n      strokes.addClosurePoint();\n    }\n    return Loop.create(strokes);\n  }\n  /** Return the boundary type (2) of a corresponding  MicroStation CurveVector */\n  public dgnBoundaryType(): number {\n    /**\n     * All \"Loop\" become \"outer\". TypeScript Loop object is equivalent to a native CurveVector with\n     * boundaryType = BOUNDARY_TYPE_Outer. In other words, TypeScript has no flavor of Loop that\n     * carries \"hole\" semantics.\n     */\n    return 2;\n  }\n  /** Invoke `processor.announceLoop(this, indexInParent)` */\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\n    return processor.announceLoop(this, indexInParent);\n  }\n  /** Create a new `Loop` with no children */\n  public cloneEmptyPeer(): Loop {\n    return new Loop();\n  }\n  /** Second step of double dispatch:  call `handler.handleLoop(this)` */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleLoop(this);\n  }\n}\n\n/**\n * Structure carrying a pair of loops with curve geometry.\n * @public\n */\nexport class LoopCurveLoopCurve {\n  /** First loop */\n  public loopA?: Loop;\n  /** A curve (typically an edge of loopA) */\n  public curveA?: CurvePrimitive;\n  /** second loop */\n  public loopB?: Loop;\n  /** A curve (typically an edge of loopB) */\n  public curveB?: CurvePrimitive;\n  /** Constructor */\n  public constructor(\n    loopA: Loop | undefined, curveA: CurvePrimitive | undefined, loopB: Loop | undefined, curveB: CurvePrimitive | undefined,\n  ) {\n    this.loopA = loopA;\n    this.curveA = curveA;\n    this.loopB = loopB;\n    this.curveB = curveB;\n  }\n  /** Set the loopA and curveA members */\n  public setA(loop: Loop, curve: CurvePrimitive) {\n    this.loopA = loop;\n    this.curveA = curve;\n  }\n  /** Set the loopB and curveB members */\n  public setB(loop: Loop, curve: CurvePrimitive) {\n    this.loopB = loop;\n    this.curveB = curve;\n  }\n}\n\n/**\n * Carrier object for loops characterized by area sign\n * @public\n */\nexport interface SignedLoops {\n  /** Array of loops that have positive area sign (i.e. counterclockwise loops). */\n  positiveAreaLoops: Loop[];\n  /** Array of loops that have negative area sign (i.e. clockwise loops). */\n  negativeAreaLoops: Loop[];\n  /** Slivers where there are coincident sections of input curves. */\n  slivers: Loop[];\n  /** Array indicating edges between loops */\n  edges?: LoopCurveLoopCurve[];\n}\n"]}
+{"version":3,"file":"Loop.js","sourceRoot":"","sources":["../../../src/curve/Loop.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,+EAA4E;AAC5E,uDAA+C;AAI/C,iDAA8C;AAG9C;;;;GAIG;AACH,MAAa,IAAK,SAAQ,4BAAU;IAClC,wCAAwC;IACxB,mBAAmB,GAAG,MAAM,CAAC;IAC7C,qFAAqF;IACrE,OAAO,GAAY,KAAK,CAAC;IACzC,kCAAkC;IAC3B,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,IAAI,CAAC;IAC/B,CAAC;IACD;QACE,KAAK,EAAE,CAAC;IACV,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,GAAG,MAAwB;QAC9C,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,IAAI,KAAK,YAAY,yDAA2B;gBAC9C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;;gBAE7C,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,WAAW,CAAC,MAAwB;QAChD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IAChC,CAAC;IACD;;;MAGE;IACK,MAAM,CAAC,aAAa,CAAC,MAAwC;QAClE,MAAM,UAAU,GAAG,2BAAY,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC/C,UAAU,CAAC,eAAe,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACjC,CAAC;IACD,wDAAwD;IACjD,YAAY,CAAC,OAAuB;QACzC,MAAM,OAAO,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ;YAC/B,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtC,mDAAmD;QACnD,OAAO,CAAC,qBAAqB,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC/B,OAAO,CAAC,QAAQ,EAAE,CAAC;YACnB,OAAO,CAAC,eAAe,EAAE,CAAC;QAC5B,CAAC;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IACD,gFAAgF;IACzE,eAAe;QACpB;;;;WAIG;QACH,OAAO,CAAC,CAAC;IACX,CAAC;IACD,2DAA2D;IACpD,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IACrD,CAAC;IACD,2CAA2C;IACpC,cAAc;QACnB,MAAM,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC;QAC9B,UAAU,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAClC,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,uEAAuE;IAChE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACF;AAlFD,oBAkFC;AAED;;;GAGG;AACH,MAAa,kBAAkB;IAC7B,iBAAiB;IACV,KAAK,CAAQ;IACpB,2CAA2C;IACpC,MAAM,CAAkB;IAC/B,kBAAkB;IACX,KAAK,CAAQ;IACpB,2CAA2C;IACpC,MAAM,CAAkB;IAC/B,kBAAkB;IAClB,YACE,KAAuB,EAAE,MAAkC,EAAE,KAAuB,EAAE,MAAkC;QAExH,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IACD,uCAAuC;IAChC,IAAI,CAAC,IAAU,EAAE,KAAqB;QAC3C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IACD,uCAAuC;IAChC,IAAI,CAAC,IAAU,EAAE,KAAqB;QAC3C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;CACF;AA5BD,gDA4BC","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 */\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { CurveChainWithDistanceIndex } from \"./CurveChainWithDistanceIndex\";\nimport { CurveChain } from \"./CurveCollection\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { LineString3d } from \"./LineString3d\";\nimport { StrokeOptions } from \"./StrokeOptions\";\n\n/**\n * A `Loop` is a curve chain that is the boundary of a closed (planar) loop.\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\n * @public\n */\nexport class Loop extends CurveChain {\n  /** String name for schema properties */\n  public readonly curveCollectionType = \"loop\";\n  /** Tag value that can be set to true for user code to mark inner and outer loops. */\n  public override isInner: boolean = false;\n  /** Test if `other` is a `Loop` */\n  public isSameGeometryClass(other: GeometryQuery): boolean {\n    return other instanceof Loop;\n  }\n  public constructor() {\n    super();\n  }\n  /**\n   * Create a loop from a variable length list of [[CurvePrimitive]]s.\n   * * A significant gap between the end of one curve and the start of the next, or between chain start and end,\n   * is not bridged and may cause unexpected behavior.\n   * @param curves array of individual curve primitives, assumed to form a closed planar loop.\n   */\n  public static create(...curves: CurvePrimitive[]): Loop {\n    const result = new Loop();\n    for (const curve of curves) {\n      if (curve instanceof CurveChainWithDistanceIndex)\n        result.children.push(...curve.path.children);\n      else\n        result.children.push(curve);\n    }\n    return result;\n  }\n  /**\n   * Create a loop from an array of [[CurvePrimitive]]s.\n   * * A significant gap between the end of one curve and the start of the next, or between chain start and end,\n   * is not bridged and may cause unexpected behavior.\n   * @param curves array of individual curve primitives, assumed to form a closed planar loop.\n   */\n  public static createArray(curves: CurvePrimitive[]): Loop {\n    return this.create(...curves);\n  }\n  /**\n   * Create a loop from an array of coplanar points.\n   * @param points vertices of polygon, closure point optional.\n  */\n  public static createPolygon(points: IndexedXYZCollection | Point3d[]): Loop {\n    const linestring = LineString3d.create(points);\n    linestring.addClosurePoint();\n    return Loop.create(linestring);\n  }\n  /** Create a loop with the stroked form of this loop. */\n  public cloneStroked(options?: StrokeOptions): Loop {\n    const strokes = LineString3d.create();\n    for (const curve of this.children)\n      curve.emitStrokes(strokes, options);\n    // eliminate near-duplicate points between children\n    strokes.removeDuplicatePoints();\n    if (strokes.isPhysicallyClosed) {\n      strokes.popPoint();\n      strokes.addClosurePoint();\n    }\n    return Loop.create(strokes);\n  }\n  /** Return the boundary type (2) of a corresponding  MicroStation CurveVector */\n  public dgnBoundaryType(): number {\n    /**\n     * All \"Loop\" become \"outer\". TypeScript Loop object is equivalent to a native CurveVector with\n     * boundaryType = BOUNDARY_TYPE_Outer. In other words, TypeScript has no flavor of Loop that\n     * carries \"hole\" semantics.\n     */\n    return 2;\n  }\n  /** Invoke `processor.announceLoop(this, indexInParent)` */\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\n    return processor.announceLoop(this, indexInParent);\n  }\n  /** Create a new `Loop` with no children */\n  public cloneEmptyPeer(): Loop {\n    const emptyClone = new Loop();\n    emptyClone.isInner = this.isInner;\n    return emptyClone;\n  }\n  /** Second step of double dispatch:  call `handler.handleLoop(this)` */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleLoop(this);\n  }\n}\n\n/**\n * Structure carrying a pair of loops with curve geometry.\n * @public\n */\nexport class LoopCurveLoopCurve {\n  /** First loop */\n  public loopA?: Loop;\n  /** A curve (typically an edge of loopA) */\n  public curveA?: CurvePrimitive;\n  /** second loop */\n  public loopB?: Loop;\n  /** A curve (typically an edge of loopB) */\n  public curveB?: CurvePrimitive;\n  /** Constructor */\n  public constructor(\n    loopA: Loop | undefined, curveA: CurvePrimitive | undefined, loopB: Loop | undefined, curveB: CurvePrimitive | undefined,\n  ) {\n    this.loopA = loopA;\n    this.curveA = curveA;\n    this.loopB = loopB;\n    this.curveB = curveB;\n  }\n  /** Set the loopA and curveA members */\n  public setA(loop: Loop, curve: CurvePrimitive) {\n    this.loopA = loop;\n    this.curveA = curve;\n  }\n  /** Set the loopB and curveB members */\n  public setB(loop: Loop, curve: CurvePrimitive) {\n    this.loopB = loop;\n    this.curveB = curve;\n  }\n}\n\n/**\n * Carrier object for loops characterized by area sign\n * @public\n */\nexport interface SignedLoops {\n  /** Array of loops that have positive area sign (i.e. counterclockwise loops). */\n  positiveAreaLoops: Loop[];\n  /** Array of loops that have negative area sign (i.e. clockwise loops). */\n  negativeAreaLoops: Loop[];\n  /** Slivers where there are coincident sections of input curves. */\n  slivers: Loop[];\n  /** Array indicating edges between loops */\n  edges?: LoopCurveLoopCurve[];\n}\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"ClosestPointStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,6CAA0C;AAE1C,sEAAqE;AACrE,kDAA+C;AAC/C,kDAAwG;AACxG,4DAAyD;AACzD,wDAAsG;AACtG,gEAA6D;AAG7D;;;GAGG;AACH,MAAa,yBAA0B,SAAQ,gCAAuB;IAC5D,MAAM,CAA6B;IACnC,aAAa,CAAkC;IAC/C,WAAW,CAAU;IACrB,OAAO,CAA8B;IACrC,OAAO,CAAU;IACzB,iFAAiF;IACzE,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IAC/B,uFAAuF;IAC/E,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,aAAa,GAAW,CAAC,CAAC;IAClC,qCAAqC;IAC7B,UAAU,CAAU;IACpB,QAAQ,CAAQ;IAChB,aAAa,CAAyC;IAC9D,kBAAkB;IAClB,YAAmB,UAAmB,EAAE,MAAoC,EAAE,MAA4B,EAAE,MAAgB;QAC1H,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,aAAK,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;QAC5B,IAAI,IAAI,CAAC,aAAa;YACpB,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,mBAAQ,CAAC,qBAAqB,CAAA;QACvD,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC;QAC/B,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACM,WAAW;QAChB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;YACvC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,EAAE,CAAC;gBACvC,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;gBACzC,QAAQ,GAAG,oCAAkB,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACtE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACM,mBAAmB,CAAC,KAAiC;QAC1D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IACxB,CAAC;IACM,iBAAiB;IACxB,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,8BAA8B;QAClE,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,4BAA4B;QAChE,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACpE,EAAE,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACO,iBAAiB,CAAC,EAAkB,EAAE,QAAgB,EAAE,KAAc;QAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtG,IAAI,IAAI,CAAC,aAAa,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;YACvD,OAAO;QACT,IAAI,CAAC,aAAa,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAC3G,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,QAAQ,CAAC;QAChC,IAAI,IAAI,CAAC,qBAAqB,KAAK,SAAS;YAC1C,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;IAC1D,CAAC;IACM,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,WAAmB,EAAE,SAAiB,EAAE,SAAiB;QAE/G,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,IAAI,CAAC,OAAO;YACd,aAAa,GAAG,yBAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;;YAExG,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACnF,yGAAyG;QACzG,MAAM,OAAO,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAe,CAAC,IAAI,CAAC;QACnJ,MAAM,OAAO,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAe,CAAC,IAAI,CAAC;QACnJ,aAAa,GAAG,oCAAkB,CAAC,eAAe,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC;QACtF,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAC5D,MAAM,cAAc,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QACjF,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9D,CAAC;IACD;;;;;;;OAOG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YACvC,OAAO,CAAC,qEAAqE;QAC/E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,yGAAyG;QACzG,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACjH,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE;oBACpC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACO,wBAAwB,CAAC,QAAgB;QAC/C,IAAI,IAAI,CAAC,MAAM;YACb,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzF,CAAC;IACD;;;;;;;OAOG;IACK,gBAAgB,CAAC,kBAA0B,EAAE,QAAiB,EAAE,KAAsB;QAC5F,IAAI,kBAAkB;YACpB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;aACvC,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK;YACtC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;;YAE5E,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,CAAC,OAAO;YACd,OAAO,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;YAE3D,OAAO,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7D,CAAC;IACM,QAAQ,CAAC,QAAgB;QAC9B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAChE,IAAI,KAAK,KAAK,SAAS;YACrB,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACO,WAAW,CAAC,QAAgB,EAAE,IAAW;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAA,qBAAM,EAAC,KAAK,KAAK,SAAS,EAAE,iFAAiF,CAAC,CAAC;QAC/G,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;QAC3B,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,oFAAoF;YAChH,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;IACM,oBAAoB,CAAC,KAAc,EAAE,QAAgB,EAAE,OAAiB;QAC7E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;CACF;AAvKD,8DAuKC","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 { assert } from \"@itwin/core-bentley\";\nimport { Geometry } from \"../../Geometry\";\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\nimport { Newton1dUnboundedApproximateDerivative, NewtonRtoRStrokeHandler } from \"../../numerics/Newton\";\nimport { SmallSystem } from \"../../numerics/SmallSystem\";\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"../CurveExtendMode\";\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\n\n/**\n * Context for searching for the closest point to a CurvePrimitive.\n * @internal\n */\nexport class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\n  private _curve: CurvePrimitive | undefined;\n  private _closestPoint: CurveLocationDetail | undefined;\n  private _spacePoint: Point3d;\n  private _extend: VariantCurveExtendParameter;\n  private _xyOnly: boolean;\n  // fraction and function value on one side of an interval that may bracket a root\n  private _fractionA: number = 0;\n  private _functionA: number = 0;\n  // fraction and function value on the other side of an interval that may bracket a root\n  private _fractionB: number = 0;\n  private _functionB: number = 0;\n  private _numThisCurve: number = 0;\n  // scratch vars to use within methods\n  private _workPoint: Point3d;\n  private _workRay: Ray3d;\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\n  /** Constructor */\n  public constructor(spacePoint: Point3d, extend?: VariantCurveExtendParameter, result?: CurveLocationDetail, xyOnly?: boolean) {\n    super();\n    this._spacePoint = spacePoint;\n    this._workPoint = Point3d.create();\n    this._workRay = Ray3d.createZero();\n    this._closestPoint = result;\n    if (this._closestPoint)\n      this._closestPoint.a = Geometry.largeCoordinateResult\n    this._extend = extend ?? false;\n    this._xyOnly = xyOnly ?? false;\n    this.startCurvePrimitive(undefined);\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\n  }\n  public claimResult(): CurveLocationDetail | undefined {\n    if (this._closestPoint) {\n      this._newtonSolver.setX(this._closestPoint.fraction);\n      this._curve = this._closestPoint.curve;\n      if (this._newtonSolver.runIterations()) {\n        let fraction = this._newtonSolver.getX();\n        fraction = CurveExtendOptions.correctFraction(this._extend, fraction);\n        this.announceSolutionFraction(fraction);\n      }\n    }\n    return this._closestPoint;\n  }\n  public needPrimaryGeometryForStrokes() {\n    return true;\n  }\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\n    this._curve = curve;\n    this._fractionA = 0.0;\n    this._numThisCurve = 0;\n    this._functionA = 0.0;\n  }\n  public endCurvePrimitive() {\n  }\n  public announceIntervalForUniformStepStrokes(\n    cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\n  ): void {\n    this.startCurvePrimitive(cp);\n    this.announceSolutionFraction(0.0); // test start point as closest\n    this.announceSolutionFraction(1.0); // test end point as closest\n    if (numStrokes < 1)\n      numStrokes = 1;\n    const df = 1.0 / numStrokes;\n    for (let i = 0; i <= numStrokes; i++) {\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\n      cp.fractionToPointAndDerivative(fraction, this._workRay);\n      this.announceRay(fraction, this._workRay);\n    }\n  }\n  private announceCandidate(cp: CurvePrimitive, fraction: number, point: Point3d) {\n    const distance = this._xyOnly ? this._spacePoint.distanceXY(point) : this._spacePoint.distance(point);\n    if (this._closestPoint && distance > this._closestPoint.a)\n      return;\n    this._closestPoint = CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);\n    this._closestPoint.a = distance;\n    if (this._parentCurvePrimitive !== undefined)\n      this._closestPoint.curve = this._parentCurvePrimitive;\n  }\n  public announceSegmentInterval(\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, _numStrokes: number, fraction0: number, fraction1: number,\n  ): void {\n    let localFraction = 0;\n    if (this._xyOnly)\n      localFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(point0, point1, this._spacePoint) ?? 0;\n    else\n      localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);\n    // only consider segment extension at a parent curve endpoint, i.e. when fraction0 is 0 or fraction1 is 1\n    const extend0 = (fraction0 === 0) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(this._extend, 0) : CurveExtendMode.None;\n    const extend1 = (fraction1 === 1) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(this._extend, 1) : CurveExtendMode.None;\n    localFraction = CurveExtendOptions.correctFraction([extend0, extend1], localFraction);\n    this._workPoint = point0.interpolate(localFraction, point1);\n    const globalFraction = Geometry.interpolate(fraction0, localFraction, fraction1);\n    this.announceCandidate(cp, globalFraction, this._workPoint);\n  }\n  /**\n   * Given a function `f` and (unordered) fractions `a` and `b`, search for and announce a root of `f` in this\n   * fractional interval.\n   * * This method searches for a root of `f` if and only if the stroke segment defined by `(a, f(a))` and\n   * `(b, f(b))` has a root. This is a HEURISTIC: given continuous `f` between `a` and `b`, a root of the stroke\n   * segment implies a root of `f`, but not vice-versa. Therefore, if the strokes are not sufficiently dense,\n   * this method can miss a root of `f`.\n   */\n  private searchInterval() {\n    if (this._functionA * this._functionB > 0)\n      return; // stroke segment has no root; ASSUME the function has no root either\n    if (this._functionA === 0)\n      this.announceSolutionFraction(this._fractionA);\n    if (this._functionB === 0)\n      this.announceSolutionFraction(this._fractionB);\n    // by the Intermediate Value Theorem, a root lies between fractionA and fractionB; use Newton to find it.\n    if (this._functionA * this._functionB < 0) {\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\n      if (fraction) {\n        this._newtonSolver.setX(fraction);\n        if (this._newtonSolver.runIterations())\n          this.announceSolutionFraction(this._newtonSolver.getX());\n      }\n    }\n  }\n  private announceSolutionFraction(fraction: number) {\n    if (this._curve)\n      this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));\n  }\n  /**\n   * Evaluate the univariate real-valued function for which we are finding roots.\n   * * For finding the closest point to curve X from point Q, this function is `f(t) := Q-X(t) dot X'(t)`.\n   * * Either `pointAndDerivative` must be defined, or both `fraction` and `curve`.\n   * @param pointAndDerivative pre-evaluated curve\n   * @param fraction fraction at which to evaluate `curve`\n   * @param curve curve to evaluate at `fraction`\n   */\n  private evaluateFunction(pointAndDerivative?: Ray3d, fraction?: number, curve?: CurvePrimitive): number | undefined {\n    if (pointAndDerivative)\n      this._workRay.setFrom(pointAndDerivative);\n    else if (fraction !== undefined && curve)\n      this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);\n    else\n      return undefined;\n    if (this._xyOnly)\n      return this._workRay.dotProductToPointXY(this._spacePoint);\n    else\n      return this._workRay.dotProductToPoint(this._spacePoint);\n  }\n  public evaluate(fraction: number): boolean {\n    let curve = this._curve;\n    if (this._parentCurvePrimitive)\n      curve = this._parentCurvePrimitive;\n    const value = this.evaluateFunction(undefined, fraction, curve);\n    if (value === undefined)\n      return false;\n    this.currentF = value;\n    return true;\n  }\n  private announceRay(fraction: number, data: Ray3d): void {\n    const value = this.evaluateFunction(data);\n    assert(value !== undefined, \"expect defined because evaluateFunction never returns undefined for input Ray3d\");\n    this._functionB = value;\n    this._fractionB = fraction;\n    if (this._numThisCurve++ > 0) // after the first stroke point, a stroke segment is defined, so we have an interval\n      this.searchInterval();\n    this._functionA = this._functionB;\n    this._fractionA = this._fractionB;\n  }\n  public announcePointTangent(point: Point3d, fraction: number, tangent: Vector3d) {\n    this._workRay.set(point, tangent);\n    this.announceRay(fraction, this._workRay);\n  }\n}\n"]}
+{"version":3,"file":"ClosestPointStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,sDAA6C;AAC7C,6CAA0C;AAE1C,sEAAqE;AACrE,kDAA+C;AAC/C,kDAAwG;AACxG,4DAAyD;AACzD,wDAAsG;AACtG,gEAA6D;AAG7D;;;GAGG;AACH,MAAa,yBAA0B,SAAQ,gCAAuB;IAC5D,MAAM,CAA6B;IACnC,aAAa,CAAkC;IAC/C,WAAW,CAAU;IACrB,OAAO,CAA8B;IACrC,OAAO,CAAU;IACzB,iFAAiF;IACzE,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IAC/B,uFAAuF;IAC/E,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,aAAa,GAAW,CAAC,CAAC;IAClC,qCAAqC;IAC7B,UAAU,CAAU;IACpB,QAAQ,CAAQ;IAChB,aAAa,CAAyC;IAC9D,kBAAkB;IAClB,YAAmB,UAAmB,EAAE,MAAoC,EAAE,MAA4B,EAAE,MAAgB;QAC1H,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,UAAU,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,aAAK,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC;QAC5B,IAAI,IAAI,CAAC,aAAa;YACpB,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,mBAAQ,CAAC,qBAAqB,CAAC;QACxD,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,KAAK,CAAC;QAC/B,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACM,WAAW;QAChB,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACvB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC;YACvC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,EAAE,CAAC;gBACvC,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;gBACzC,QAAQ,GAAG,oCAAkB,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;gBACtE,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IACM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IACM,mBAAmB,CAAC,KAAiC;QAC1D,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IACxB,CAAC;IACM,iBAAiB;IACxB,CAAC;IACM,qCAAqC,CAC1C,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QAE5E,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,8BAA8B;QAClE,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,4BAA4B;QAChE,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAC,CAAC;QACjB,MAAM,EAAE,GAAG,GAAG,GAAG,UAAU,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,GAAG,EAAE,EAAE,SAAS,CAAC,CAAC;YACpE,EAAE,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IACO,iBAAiB,CAAC,EAAkB,EAAE,QAAgB,EAAE,KAAc;QAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtG,IAAI,IAAI,CAAC,aAAa,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC;YACvD,OAAO;QACT,IAAI,CAAC,aAAa,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QAC3G,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,QAAQ,CAAC;QAChC,IAAI,IAAI,CAAC,qBAAqB,KAAK,SAAS;YAC1C,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;IAC1D,CAAC;IACM,uBAAuB,CAC5B,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,WAAmB,EAAE,SAAiB,EAAE,SAAiB;QAE/G,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,IAAI,CAAC,OAAO;YACd,aAAa,GAAG,yBAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;;YAExG,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACnF,yGAAyG;QACzG,MAAM,OAAO,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAe,CAAC,IAAI,CAAC;QACnJ,MAAM,OAAO,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,oCAAkB,CAAC,mDAAmD,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,iCAAe,CAAC,IAAI,CAAC;QACnJ,aAAa,GAAG,oCAAkB,CAAC,eAAe,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC;QACtF,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;QAC5D,MAAM,cAAc,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;QACjF,IAAI,CAAC,iBAAiB,CAAC,EAAE,EAAE,cAAc,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC9D,CAAC;IACD;;;;;;;OAOG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YACvC,OAAO,CAAC,qEAAqE;QAC/E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjD,yGAAyG;QACzG,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACjH,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE;oBACpC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;IACH,CAAC;IACO,wBAAwB,CAAC,QAAgB;QAC/C,IAAI,IAAI,CAAC,MAAM;YACb,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;IACzF,CAAC;IACD;;;;;;;OAOG;IACK,gBAAgB,CAAC,kBAA0B,EAAE,QAAiB,EAAE,KAAsB;QAC5F,IAAI,kBAAkB;YACpB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;aACvC,IAAI,QAAQ,KAAK,SAAS,IAAI,KAAK;YACtC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;;YAE5E,OAAO,SAAS,CAAC;QACnB,IAAI,IAAI,CAAC,OAAO;YACd,OAAO,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;YAE3D,OAAO,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC7D,CAAC;IACM,QAAQ,CAAC,QAAgB;QAC9B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QAChE,IAAI,KAAK,KAAK,SAAS;YACrB,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACO,WAAW,CAAC,QAAgB,EAAE,IAAW;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAA,qBAAM,EAAC,KAAK,KAAK,SAAS,EAAE,iFAAiF,CAAC,CAAC;QAC/G,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;QAC3B,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC,EAAE,oFAAoF;YAChH,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;IACM,oBAAoB,CAAC,KAAc,EAAE,QAAgB,EAAE,OAAiB;QAC7E,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAClC,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5C,CAAC;CACF;AAvKD,8DAuKC","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 { assert } from \"@itwin/core-bentley\";\nimport { Geometry } from \"../../Geometry\";\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\nimport { Newton1dUnboundedApproximateDerivative, NewtonRtoRStrokeHandler } from \"../../numerics/Newton\";\nimport { SmallSystem } from \"../../numerics/SmallSystem\";\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"../CurveExtendMode\";\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\n\n/**\n * Context for searching for the closest point to a CurvePrimitive.\n * @internal\n */\nexport class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\n  private _curve: CurvePrimitive | undefined;\n  private _closestPoint: CurveLocationDetail | undefined;\n  private _spacePoint: Point3d;\n  private _extend: VariantCurveExtendParameter;\n  private _xyOnly: boolean;\n  // fraction and function value on one side of an interval that may bracket a root\n  private _fractionA: number = 0;\n  private _functionA: number = 0;\n  // fraction and function value on the other side of an interval that may bracket a root\n  private _fractionB: number = 0;\n  private _functionB: number = 0;\n  private _numThisCurve: number = 0;\n  // scratch vars to use within methods\n  private _workPoint: Point3d;\n  private _workRay: Ray3d;\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\n  /** Constructor */\n  public constructor(spacePoint: Point3d, extend?: VariantCurveExtendParameter, result?: CurveLocationDetail, xyOnly?: boolean) {\n    super();\n    this._spacePoint = spacePoint;\n    this._workPoint = Point3d.create();\n    this._workRay = Ray3d.createZero();\n    this._closestPoint = result;\n    if (this._closestPoint)\n      this._closestPoint.a = Geometry.largeCoordinateResult;\n    this._extend = extend ?? false;\n    this._xyOnly = xyOnly ?? false;\n    this.startCurvePrimitive(undefined);\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\n  }\n  public claimResult(): CurveLocationDetail | undefined {\n    if (this._closestPoint) {\n      this._newtonSolver.setX(this._closestPoint.fraction);\n      this._curve = this._closestPoint.curve;\n      if (this._newtonSolver.runIterations()) {\n        let fraction = this._newtonSolver.getX();\n        fraction = CurveExtendOptions.correctFraction(this._extend, fraction);\n        this.announceSolutionFraction(fraction);\n      }\n    }\n    return this._closestPoint;\n  }\n  public needPrimaryGeometryForStrokes() {\n    return true;\n  }\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\n    this._curve = curve;\n    this._fractionA = 0.0;\n    this._numThisCurve = 0;\n    this._functionA = 0.0;\n  }\n  public endCurvePrimitive() {\n  }\n  public announceIntervalForUniformStepStrokes(\n    cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number,\n  ): void {\n    this.startCurvePrimitive(cp);\n    this.announceSolutionFraction(0.0); // test start point as closest\n    this.announceSolutionFraction(1.0); // test end point as closest\n    if (numStrokes < 1)\n      numStrokes = 1;\n    const df = 1.0 / numStrokes;\n    for (let i = 0; i <= numStrokes; i++) {\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\n      cp.fractionToPointAndDerivative(fraction, this._workRay);\n      this.announceRay(fraction, this._workRay);\n    }\n  }\n  private announceCandidate(cp: CurvePrimitive, fraction: number, point: Point3d) {\n    const distance = this._xyOnly ? this._spacePoint.distanceXY(point) : this._spacePoint.distance(point);\n    if (this._closestPoint && distance > this._closestPoint.a)\n      return;\n    this._closestPoint = CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);\n    this._closestPoint.a = distance;\n    if (this._parentCurvePrimitive !== undefined)\n      this._closestPoint.curve = this._parentCurvePrimitive;\n  }\n  public announceSegmentInterval(\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, _numStrokes: number, fraction0: number, fraction1: number,\n  ): void {\n    let localFraction = 0;\n    if (this._xyOnly)\n      localFraction = SmallSystem.lineSegment3dXYClosestPointUnbounded(point0, point1, this._spacePoint) ?? 0;\n    else\n      localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);\n    // only consider segment extension at a parent curve endpoint, i.e. when fraction0 is 0 or fraction1 is 1\n    const extend0 = (fraction0 === 0) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(this._extend, 0) : CurveExtendMode.None;\n    const extend1 = (fraction1 === 1) ? CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(this._extend, 1) : CurveExtendMode.None;\n    localFraction = CurveExtendOptions.correctFraction([extend0, extend1], localFraction);\n    this._workPoint = point0.interpolate(localFraction, point1);\n    const globalFraction = Geometry.interpolate(fraction0, localFraction, fraction1);\n    this.announceCandidate(cp, globalFraction, this._workPoint);\n  }\n  /**\n   * Given a function `f` and (unordered) fractions `a` and `b`, search for and announce a root of `f` in this\n   * fractional interval.\n   * * This method searches for a root of `f` if and only if the stroke segment defined by `(a, f(a))` and\n   * `(b, f(b))` has a root. This is a HEURISTIC: given continuous `f` between `a` and `b`, a root of the stroke\n   * segment implies a root of `f`, but not vice-versa. Therefore, if the strokes are not sufficiently dense,\n   * this method can miss a root of `f`.\n   */\n  private searchInterval() {\n    if (this._functionA * this._functionB > 0)\n      return; // stroke segment has no root; ASSUME the function has no root either\n    if (this._functionA === 0)\n      this.announceSolutionFraction(this._fractionA);\n    if (this._functionB === 0)\n      this.announceSolutionFraction(this._fractionB);\n    // by the Intermediate Value Theorem, a root lies between fractionA and fractionB; use Newton to find it.\n    if (this._functionA * this._functionB < 0) {\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\n      if (fraction) {\n        this._newtonSolver.setX(fraction);\n        if (this._newtonSolver.runIterations())\n          this.announceSolutionFraction(this._newtonSolver.getX());\n      }\n    }\n  }\n  private announceSolutionFraction(fraction: number) {\n    if (this._curve)\n      this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));\n  }\n  /**\n   * Evaluate the univariate real-valued function for which we are finding roots.\n   * * For finding the closest point to curve X from point Q, this function is `f(t) := Q-X(t) dot X'(t)`.\n   * * Either `pointAndDerivative` must be defined, or both `fraction` and `curve`.\n   * @param pointAndDerivative pre-evaluated curve\n   * @param fraction fraction at which to evaluate `curve`\n   * @param curve curve to evaluate at `fraction`\n   */\n  private evaluateFunction(pointAndDerivative?: Ray3d, fraction?: number, curve?: CurvePrimitive): number | undefined {\n    if (pointAndDerivative)\n      this._workRay.setFrom(pointAndDerivative);\n    else if (fraction !== undefined && curve)\n      this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);\n    else\n      return undefined;\n    if (this._xyOnly)\n      return this._workRay.dotProductToPointXY(this._spacePoint);\n    else\n      return this._workRay.dotProductToPoint(this._spacePoint);\n  }\n  public evaluate(fraction: number): boolean {\n    let curve = this._curve;\n    if (this._parentCurvePrimitive)\n      curve = this._parentCurvePrimitive;\n    const value = this.evaluateFunction(undefined, fraction, curve);\n    if (value === undefined)\n      return false;\n    this.currentF = value;\n    return true;\n  }\n  private announceRay(fraction: number, data: Ray3d): void {\n    const value = this.evaluateFunction(data);\n    assert(value !== undefined, \"expect defined because evaluateFunction never returns undefined for input Ray3d\");\n    this._functionB = value;\n    this._fractionB = fraction;\n    if (this._numThisCurve++ > 0) // after the first stroke point, a stroke segment is defined, so we have an interval\n      this.searchInterval();\n    this._functionA = this._functionB;\n    this._fractionA = this._fractionB;\n  }\n  public announcePointTangent(point: Point3d, fraction: number, tangent: Vector3d) {\n    this._workRay.set(point, tangent);\n    this.announceRay(fraction, this._workRay);\n  }\n}\n"]}

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

@@ -167,14 +167,6 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     allPerpendicularsArcArcBounded(arcA: Arc3d, arcB: Arc3d, reversed?: boolean): void;
     /** Low level dispatch of arc with Arc3d. */
     private dispatchArcArc;
-    /** Low level dispatch of arc with (beziers of) a bspline curve */
-    private dispatchArcBsplineCurve3d;
-    /** Low level dispatch of (beziers of) a bspline curve with (beziers of) a bspline curve */
-    private dispatchBSplineCurve3dBSplineCurve3d;
-    /** Low level dispatch of linestring with (beziers of) a bspline curve */
-    private dispatchLineStringBSplineCurve;
-    /** Low level dispatch of segment with (beziers of) a bspline curve */
-    private dispatchSegmentBsplineCurve;
     /** Detail computation for segment approaching linestring. */
     private computeSegmentLineString;
     /** Detail computation for arc approaching linestring. */
@@ -202,23 +194,17 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     private dispatchCurveCollection;
     /** Low level dispatch to geomA given a CurveChainWithDistanceIndex in geometryB. */
     private dispatchCurveChainWithDistanceIndex;
-    /** Double dispatch handler for strongly typed segment. */
-    handleLineSegment3d(segmentA: LineSegment3d): any;
-    /** Double dispatch handler for strongly typed linestring. */
-    handleLineString3d(lsA: LineString3d): any;
-    /** Double dispatch handler for strongly typed arc. */
-    handleArc3d(arcA: Arc3d): any;
-    /** Double dispatch handler for strongly typed bspline curve. */
-    handleBSplineCurve3d(curveA: BSplineCurve3d): any;
+    /** Specifies whether the curve needs to be stroked for close approach computation. */
+    private needsStroking;
     /**
-     * Process seeds for xy close approach between the curve and spiral.
+     * Process seeds for xy close approach between one curve and another curve to be stroked.
      * * Refine each result via Newton iteration. If it doesn't converge, remove it.
-     * @param seeds The initial seed results to refine.
-     * @param curveA The other curve primitive. May also be a transition spiral.
-     * @param spiralB The transition spiral.
-     * @param reversed whether `spiralB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
+     * @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 reversed whether `curveB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
      */
-    private refineSpiralResultsByNewton;
+    private refineStrokedResultsByNewton;
     /**
      * Append stroke points and return the line string.
      * * This is a convenient wrapper for [[CurvePrimitive.emitStrokes]] but the analogous instance method cannot be added
@@ -230,12 +216,20 @@ export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHa
     /** Find and return the close approaches between curveA and the discretization of curveB. */
     private computeDiscreteCloseApproachResults;
     /**
-     * Compute the XY close approach of a curve and a spiral.
-     * @param curveA curve to find its close approach with spiralB. May also be a transition spiral.
-     * @param spiralB transition spiral to find its close approach with curveA.
-     * @param reversed whether `spiralB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
+     * 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 reversed whether `curveB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
      */
-    private dispatchCurveSpiral;
+    private dispatchCurveStrokedCurve;
+    /** Double dispatch handler for strongly typed segment. */
+    handleLineSegment3d(segmentA: LineSegment3d): any;
+    /** Double dispatch handler for strongly typed linestring. */
+    handleLineString3d(lsA: LineString3d): any;
+    /** Double dispatch handler for strongly typed arc. */
+    handleArc3d(arcA: Arc3d): any;
+    /** Double dispatch handler for strongly typed bspline curve. */
+    handleBSplineCurve3d(curveA: BSplineCurve3d): any;
     /** Double dispatch handler for strongly typed spiral curve. */
     handleTransitionSpiral(spiral: TransitionSpiral3d): any;
     /** Double dispatch handler for strongly typed CurveChainWithDistanceIndex. */

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,kEAAkE;IAClE,OAAO,CAAC,yBAAyB;IAKjC,2FAA2F;IAC3F,OAAO,CAAC,oCAAoC;IAS5C,yEAAyE;IACzE,OAAO,CAAC,8BAA8B;IAKtC,sEAAsE;IACtE,OAAO,CAAC,2BAA2B;IAKnC,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,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IAuBjE,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAkB1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAkB7C,gEAAgE;IAChD,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,GAAG;IAkBjE;;;;;;;OAOG;IACH,OAAO,CAAC,2BAA2B;IAkBnC;;;;;;OAMG;IACH,OAAO,CAAC,WAAW;IAKnB,4FAA4F;IAC5F,OAAO,CAAC,mCAAmC;IAkB3C;;;;;OAKG;IACH,OAAO,CAAC,mBAAmB;IAoB3B,+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;CAgBpE"}
+{"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"}

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

@@ -434,32 +434,6 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         // 2) perpendicular line between 2 arcs (includes intersections)
         this.allPerpendicularsArcArcBounded(cpA, cpB, reversed);
     }
-    /** Low level dispatch of arc with (beziers of) a bspline curve */
-    dispatchArcBsplineCurve3d(cpA, cpB, reversed) {
-        const ls = LineString3d_1.LineString3d.create();
-        cpB.emitStrokes(ls);
-        this.computeArcLineString(cpA, ls, reversed);
-    }
-    /** Low level dispatch of (beziers of) a bspline curve with (beziers of) a bspline curve */
-    dispatchBSplineCurve3dBSplineCurve3d(bcurveA, bcurveB, reversed) {
-        const lsA = LineString3d_1.LineString3d.create();
-        bcurveA.emitStrokes(lsA);
-        const lsB = LineString3d_1.LineString3d.create();
-        bcurveB.emitStrokes(lsB);
-        this.computeLineStringLineString(lsA, lsB, reversed);
-    }
-    /** Low level dispatch of linestring with (beziers of) a bspline curve */
-    dispatchLineStringBSplineCurve(lsA, curveB, reversed) {
-        const lsB = LineString3d_1.LineString3d.create();
-        curveB.emitStrokes(lsB);
-        this.computeLineStringLineString(lsA, lsB, reversed);
-    }
-    /** Low level dispatch of segment with (beziers of) a bspline curve */
-    dispatchSegmentBsplineCurve(segA, curveB, reversed) {
-        const lsB = LineString3d_1.LineString3d.create();
-        curveB.emitStrokes(lsB);
-        this.computeSegmentLineString(segA, lsB, reversed);
-    }
     /** Detail computation for segment approaching linestring. */
     computeSegmentLineString(segA, lsB, reversed) {
         const numB = lsB.numPoints();
@@ -615,6 +589,91 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         });
         saveResults.forEach((pair) => this._results.insert(pair));
     }
+    /** Specifies whether the curve needs to be stroked for close approach computation. */
+    needsStroking(curve) {
+        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.
+     * * 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 reversed whether `curveB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
+     */
+    refineStrokedResultsByNewton(seeds, curveA, curveB, reversed = false) {
+        const xyMatchingFunction = new Newton_1.CurveCurveCloseApproachXYRRtoRRD(curveA, curveB);
+        const newtonSearcher = new Newton_1.Newton2dUnboundedWithDerivative(xyMatchingFunction, 50, this._newtonTolerance); // seen: 47
+        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)
+            if (newtonSearcher.runIterations()) {
+                const fractionA = newtonSearcher.getU();
+                const fractionB = newtonSearcher.getV();
+                if (this.acceptFraction(fractionA) && this.acceptFraction(fractionB))
+                    this.testAndRecordPointPair(curveA, fractionA, undefined, curveB, fractionB, undefined, reversed);
+            } // ignore failure to converge
+        }
+    }
+    /**
+     * Append stroke points and return the line string.
+     * * This is a convenient wrapper for [[CurvePrimitive.emitStrokes]] but the analogous instance method cannot be added
+     * to that class due to the ensuing recursion with subclass [[LineString3d]].
+     * @param options options for stroking the instance curve.
+     * @param result object to receive appended stroke points; if omitted, a new object is created, populated, and returned.
+     */
+    strokeCurve(curve, options, result) {
+        const ls = result ? result : LineString3d_1.LineString3d.create();
+        curve.emitStrokes(ls, options);
+        return ls;
+    }
+    /** Find and return the close approaches between curveA and the discretization of curveB. */
+    computeDiscreteCloseApproachResults(curveA, lsB, reversed) {
+        const maxDist = this.maxDistanceToAccept;
+        const saveResults = this.grabPairedResults(); // save current results
+        const geomB = this._geometryB;
+        this.maxDistanceToAccept = maxDist ? maxDist * 1.2 : undefined; // HEURISTIC: allow slack for Newton seeds
+        this.resetGeometry(curveA);
+        this.handleLineString3d(lsB); // populate empty results with discrete solutions
+        if (!reversed) {
+            // handleLineString3d put lsB data into detailA, so if we aren't reversing, we need to swap
+            for (const result of this._results)
+                result.swapDetails();
+        }
+        this.resetGeometry(geomB);
+        this.maxDistanceToAccept = maxDist;
+        const discreteResults = this._results.extractArray();
+        saveResults.forEach((pair) => this._results.insert(pair)); // restore current results
+        return discreteResults;
+    }
+    /**
+     * 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 reversed whether `curveB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
+     */
+    dispatchCurveStrokedCurve(curveA, curveB, reversed) {
+        // explicit search for intersections (Newton converges too slowly on DirectSpiral3d tangent intersections)
+        const intersections = CurveCurve_1.CurveCurve.intersectionXYPairs(curveA, false, curveB, false, this._xyTolerance);
+        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 cpB = this.strokeCurve(curveB);
+        const seeds = this.computeDiscreteCloseApproachResults(cpA, cpB, reversed);
+        this.refineStrokedResultsByNewton(seeds, curveA, curveB, 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;
+            for (let i = 1; i < curveA.numEdges(); ++i)
+                this.testAndRecordProjection(curveA, i * fStep, curveA.pointAtUnchecked(i, v0), curveB, reversed);
+        }
+        this.testAndRecordEndPointApproaches(curveA, curveB, reversed);
+    }
     /** Double dispatch handler for strongly typed segment. */
     handleLineSegment3d(segmentA) {
         if (this._geometryB instanceof LineSegment3d_1.LineSegment3d) {
@@ -627,11 +686,8 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         else if (this._geometryB instanceof Arc3d_1.Arc3d) {
             this.computeSegmentArc(segmentA, this._geometryB, false);
         }
-        else if (this._geometryB instanceof BSplineCurve_1.BSplineCurve3d) {
-            this.dispatchSegmentBsplineCurve(segmentA, this._geometryB, false);
-        }
-        else if (this._geometryB instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
-            this.dispatchCurveSpiral(segmentA, this._geometryB, false);
+        else if (this.needsStroking(this._geometryB)) {
+            this.dispatchCurveStrokedCurve(segmentA, this._geometryB, false);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
             this.dispatchCurveCollection(segmentA, this.handleLineSegment3d.bind(this));
@@ -652,11 +708,8 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         else if (this._geometryB instanceof Arc3d_1.Arc3d) {
             this.computeArcLineString(this._geometryB, lsA, true);
         }
-        else if (this._geometryB instanceof BSplineCurve_1.BSplineCurve3d) {
-            this.dispatchLineStringBSplineCurve(lsA, this._geometryB, false);
-        }
-        else if (this._geometryB instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
-            this.dispatchCurveSpiral(lsA, this._geometryB, false);
+        else if (this.needsStroking(this._geometryB)) {
+            this.dispatchCurveStrokedCurve(lsA, this._geometryB, false);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
             this.dispatchCurveCollection(lsA, this.handleLineString3d.bind(this));
@@ -677,11 +730,8 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
         else if (this._geometryB instanceof Arc3d_1.Arc3d) {
             this.dispatchArcArc(arcA, this._geometryB, false);
         }
-        else if (this._geometryB instanceof BSplineCurve_1.BSplineCurve3d) {
-            this.dispatchArcBsplineCurve3d(arcA, this._geometryB, false);
-        }
-        else if (this._geometryB instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
-            this.dispatchCurveSpiral(arcA, this._geometryB, false);
+        else if (this.needsStroking(this._geometryB)) {
+            this.dispatchCurveStrokedCurve(arcA, this._geometryB, false);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
             this.dispatchCurveCollection(arcA, this.handleArc3d.bind(this));
@@ -693,117 +743,24 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
     }
     /** Double dispatch handler for strongly typed bspline curve. */
     handleBSplineCurve3d(curveA) {
-        if (this._geometryB instanceof LineSegment3d_1.LineSegment3d) {
-            this.dispatchSegmentBsplineCurve(this._geometryB, curveA, true);
-        }
-        else if (this._geometryB instanceof LineString3d_1.LineString3d) {
-            this.dispatchLineStringBSplineCurve(this._geometryB, curveA, true);
-        }
-        else if (this._geometryB instanceof Arc3d_1.Arc3d) {
-            this.dispatchArcBsplineCurve3d(this._geometryB, curveA, true);
-        }
-        else if (this._geometryB instanceof BSplineCurve_1.BSplineCurve3dBase) {
-            this.dispatchBSplineCurve3dBSplineCurve3d(curveA, this._geometryB, false);
+        if (this._geometryB instanceof CurveChainWithDistanceIndex_1.CurveChainWithDistanceIndex) {
+            this.dispatchCurveChainWithDistanceIndex(curveA, this.handleBSplineCurve3d.bind(this));
         }
-        else if (this._geometryB instanceof TransitionSpiral3d_1.TransitionSpiral3d) {
-            this.dispatchCurveSpiral(curveA, this._geometryB, false);
+        else if (this._geometryB instanceof CurvePrimitive_1.CurvePrimitive) {
+            this.dispatchCurveStrokedCurve(this._geometryB, curveA, true);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
             this.dispatchCurveCollection(curveA, this.handleBSplineCurve3d.bind(this));
         }
-        else if (this._geometryB instanceof CurveChainWithDistanceIndex_1.CurveChainWithDistanceIndex) {
-            this.dispatchCurveChainWithDistanceIndex(curveA, this.handleBSplineCurve3d.bind(this));
-        }
         return undefined;
     }
-    /**
-     * Process seeds for xy close approach between the curve and spiral.
-     * * Refine each result via Newton iteration. If it doesn't converge, remove it.
-     * @param seeds The initial seed results to refine.
-     * @param curveA The other curve primitive. May also be a transition spiral.
-     * @param spiralB The transition spiral.
-     * @param reversed whether `spiralB` data is in `detailA` of each recorded pair, and `curveA` data in `detailB`.
-     */
-    refineSpiralResultsByNewton(seeds, curveA, spiralB, reversed = false) {
-        const xyMatchingFunction = new Newton_1.CurveCurveCloseApproachXYRRtoRRD(curveA, spiralB);
-        const newtonSearcher = new Newton_1.Newton2dUnboundedWithDerivative(xyMatchingFunction, 50, this._newtonTolerance); // seen: 47
-        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 spiral");
-            newtonSearcher.setUV(detailA.fraction, detailB.fraction); // use linestring fraction as spiral param; it generally yields a closer point than fractional length!
-            if (newtonSearcher.runIterations()) {
-                const fractionA = newtonSearcher.getU();
-                const fractionB = newtonSearcher.getV();
-                if (this.acceptFraction(fractionA) && this.acceptFraction(fractionB))
-                    this.testAndRecordPointPair(curveA, fractionA, undefined, spiralB, fractionB, undefined, reversed);
-            } // ignore failure to converge
-        }
-    }
-    /**
-     * Append stroke points and return the line string.
-     * * This is a convenient wrapper for [[CurvePrimitive.emitStrokes]] but the analogous instance method cannot be added
-     * to that class due to the ensuing recursion with subclass [[LineString3d]].
-     * @param options options for stroking the instance curve.
-     * @param result object to receive appended stroke points; if omitted, a new object is created, populated, and returned.
-     */
-    strokeCurve(curve, options, result) {
-        const ls = result ? result : LineString3d_1.LineString3d.create();
-        curve.emitStrokes(ls, options);
-        return ls;
-    }
-    /** Find and return the close approaches between curveA and the discretization of curveB. */
-    computeDiscreteCloseApproachResults(curveA, lsB, reversed) {
-        const maxDist = this.maxDistanceToAccept;
-        const saveResults = this.grabPairedResults(); // save current results
-        const geomB = this._geometryB;
-        this.maxDistanceToAccept = maxDist ? maxDist * 1.2 : undefined; // HEURISTIC: allow slack for Newton seeds
-        this.resetGeometry(curveA);
-        this.handleLineString3d(lsB); // populate empty results with discrete solutions
-        if (!reversed) {
-            // handleLineString3d put lsB data into detailA, so if we aren't reversing, we need to swap
-            for (const result of this._results)
-                result.swapDetails();
-        }
-        this.resetGeometry(geomB);
-        this.maxDistanceToAccept = maxDist;
-        const discreteResults = this._results.extractArray();
-        saveResults.forEach((pair) => this._results.insert(pair)); // restore current results
-        return discreteResults;
-    }
-    /**
-     * Compute the XY close approach of a curve and a spiral.
-     * @param curveA curve to find its close approach with spiralB. May also be a transition spiral.
-     * @param spiralB transition spiral to find its close approach with curveA.
-     * @param reversed whether `spiralB` data will be recorded in `detailA` of each result, and `curveA` data in `detailB`.
-     */
-    dispatchCurveSpiral(curveA, spiralB, reversed) {
-        // explicit search for intersections (Newton converges too slowly on DirectSpiral3d tangent intersections)
-        const intersections = CurveCurve_1.CurveCurve.intersectionXYPairs(curveA, false, spiralB, false, this._xyTolerance);
-        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 (curveA instanceof TransitionSpiral3d_1.TransitionSpiral3d)
-            cpA = this.strokeCurve(curveA);
-        const cpB = this.strokeCurve(spiralB);
-        const seeds = this.computeDiscreteCloseApproachResults(cpA, cpB, reversed);
-        this.refineSpiralResultsByNewton(seeds, curveA, spiralB, 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;
-            for (let i = 1; i < curveA.numEdges(); ++i)
-                this.testAndRecordProjection(curveA, i * fStep, curveA.pointAtUnchecked(i, v0), spiralB, reversed);
-        }
-        this.testAndRecordEndPointApproaches(curveA, spiralB, reversed);
-    }
     /** Double dispatch handler for strongly typed spiral curve. */
     handleTransitionSpiral(spiral) {
         if (this._geometryB instanceof CurveChainWithDistanceIndex_1.CurveChainWithDistanceIndex) {
             this.dispatchCurveChainWithDistanceIndex(spiral, this.handleTransitionSpiral.bind(this));
         }
         else if (this._geometryB instanceof CurvePrimitive_1.CurvePrimitive) {
-            this.dispatchCurveSpiral(this._geometryB, spiral, true);
+            this.dispatchCurveStrokedCurve(this._geometryB, spiral, true);
         }
         else if (this._geometryB instanceof CurveCollection_1.CurveCollection) {
             this.dispatchCurveCollection(spiral, this.handleTransitionSpiral.bind(this));
@@ -822,19 +779,7 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
     }
     /** Double dispatch handler for strongly typed homogeneous bspline curve .. */
     handleBSplineCurve3dH(_curve) {
-        /*
-        //NEEDS WORK -- make "dispatch" methods tolerant of both 3d and 3dH.
-        // "easy" if both present BezierCurve3dH span loaders
-        if (this._geometryB instanceof LineSegment3d) {
-          this.dispatchSegmentBsplineCurve(
-            this._geometryB, this._extendB, this._geometryB.point0Ref, 0.0, this._geometryB.point1Ref, 1.0, this._extendB,
-            curve, this._extendA, true);
-        } else if (this._geometryB instanceof LineString3d) {
-          this.dispatchLineStringBSplineCurve(this._geometryB, this._extendB, curve, this._extendA, true);
-        } else if (this._geometryB instanceof Arc3d) {
-          this.dispatchArcBsplineCurve3d(this._geometryB, this._extendB, curve, this._extendA, true);
-        }
-        */
+        // NEEDS WORK -- make "dispatch" methods tolerant of both 3d and 3dH
         return undefined;
     }
 }