@itwin/core-geometry 5.0.0-dev.10 → 5.0.0-dev.102

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

@@ -1 +1 @@
-{"version":3,"file":"AppendPlaneIntersectionStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAAkE;AAGlE,kDAA+C;AAC/C,wEAAgE;AAChE,kDAA+E;AAC/E,gEAA6D;AAE7D,uEAAoE;AAEpE;;;GAGG;AACH,MAAa,oCAAqC,SAAQ,iDAAuB;IAe/E,+EAA+E;IACxE,cAAc;QACnB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,OAAO,IAAI,CAAC,qBAAqB,CAAC;QACpC,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,YAAY,CAAC,CAAI,2FAA2F;IAC1H,CAAC;IAED,YAAmB,KAA6B,EAAE,aAAoC;QACpF,KAAK,EAAE,CAAC;QAvBF,eAAU,GAAW,CAAC,CAAC;QACvB,eAAU,GAAW,CAAC,CAAC;QAC/B,0DAA0D;QAClD,eAAU,GAAW,CAAC,CAAC;QACvB,eAAU,GAAW,CAAC,CAAC;QACvB,iBAAY,GAAW,CAAC,CAAC;QACzB,kBAAa,GAAW,CAAC,CAAC;QAkBhC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,aAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IAEM,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;QACtB,0BAA0B;IAC5B,CAAC;IAEM,iBAAiB;IACxB,CAAC;IAEM,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,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,IAAI,CAAC,CAAC;YACrD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAEM,uBAAuB,CAC5B,GAAmB,EACnB,MAAe,EACf,MAAe,EACf,WAAmB,EACnB,SAAiB,EACjB,SAAiB;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG;YACf,OAAO;QACT,MAAM,UAAU,GAAG,gCAAY,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnD,2BAA2B;QAC3B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,qBAAqB;YACrB,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;YACxE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,CAAC;YACD,qHAAqH;QACvH,CAAC;IACH,CAAC;IAEO,wBAAwB,CAAC,QAAgB;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACpE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,yCAAmB,CAAC,wBAAwB,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5G,CAAC;IACH,CAAC;IAEM,QAAQ,CAAC,QAAgB;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YACR,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YAAE,OAAO;QAClD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,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;IAED,kEAAkE;IAC1D,SAAS,CAAC,GAAY,EAAE,QAAgB,EAAE,OAAiB;QACjE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED;;;;;;;;;OASG;IACI,oBAAoB,CAAC,GAAY,EAAE,QAAgB,EAAE,OAAiB;QAC3E,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;CACF;AA/ID,oFA+IC","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, PlaneAltitudeEvaluator } from \"../../Geometry\";\r\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Order2Bezier } from \"../../numerics/BezierPolynomials\";\r\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\r\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\r\n\r\n/**\r\n * Context for computing intersections of a CurvePrimitive with a plane.\r\n * @internal\r\n */\r\nexport class AppendPlaneIntersectionStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\r\n  private _curve: CurvePrimitive | undefined;\r\n  private _plane: PlaneAltitudeEvaluator;\r\n  private _intersections: CurveLocationDetail[];\r\n  private _fractionA: number = 0;\r\n  private _functionA: number = 0;\r\n  // private derivativeA: number;   <---- Not currently used\r\n  private _functionB: number = 0;\r\n  private _fractionB: number = 0;\r\n  private _derivativeB: number = 0;\r\n  private _numThisCurve: number = 0;\r\n  // scratch vars for use within methods.\r\n  private _ray: Ray3d;\r\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\r\n\r\n  // Return the first defined curve among: this.parentCurvePrimitive, this.curve;\r\n  public effectiveCurve(): CurvePrimitive | undefined {\r\n    if (this._parentCurvePrimitive)\r\n      return this._parentCurvePrimitive;\r\n    return this._curve;\r\n  }\r\n\r\n  public get getDerivativeB() {\r\n    return this._derivativeB;    // <--- _derivativeB is not currently used anywhere. Provided getter to suppress lint error\r\n  }\r\n\r\n  public constructor(plane: PlaneAltitudeEvaluator, intersections: CurveLocationDetail[]) {\r\n    super();\r\n    this._plane = plane;\r\n    this._intersections = intersections;\r\n    this.startCurvePrimitive(undefined);\r\n    this._ray = Ray3d.createZero();\r\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\r\n  }\r\n\r\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\r\n    this._curve = curve;\r\n    this._fractionA = 0.0;\r\n    this._numThisCurve = 0;\r\n    this._functionA = 0.0;\r\n    // this.derivativeA = 0.0;\r\n  }\r\n\r\n  public endCurvePrimitive() {\r\n  }\r\n\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void {\r\n    this.startCurvePrimitive(cp);\r\n    if (numStrokes < 1) numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    for (let i = 0; i <= numStrokes; i++) {\r\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\r\n      cp.fractionToPointAndDerivative(fraction, this._ray);\r\n      this.announcePointTangent(this._ray.origin, fraction, this._ray.direction);\r\n    }\r\n  }\r\n\r\n  public announceSegmentInterval(\r\n    _cp: CurvePrimitive,\r\n    point0: Point3d,\r\n    point1: Point3d,\r\n    _numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void {\r\n    const h0 = this._plane.altitude(point0);\r\n    const h1 = this._plane.altitude(point1);\r\n    if (h0 * h1 > 0.0)\r\n      return;\r\n    const fraction01 = Order2Bezier.solveCoffs(h0, h1);\r\n    // let numIntersection = 0;\r\n    if (fraction01 !== undefined) {\r\n      // numIntersection++;\r\n      const fraction = Geometry.interpolate(fraction0, fraction01, fraction1);\r\n      this._newtonSolver.setX(fraction);\r\n      if (this._newtonSolver.runIterations()) {\r\n        this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n      // this.intersections.push(CurveLocationDetail.createCurveFractionPoint(cp, fraction, cp.fractionToPoint(fraction)));\r\n    }\r\n  }\r\n\r\n  private announceSolutionFraction(fraction: number) {\r\n    const curve = this.effectiveCurve();\r\n    if (curve) {\r\n      this._ray = curve.fractionToPointAndDerivative(fraction, this._ray);\r\n      this._intersections.push(CurveLocationDetail.createCurveFractionPoint(curve, fraction, this._ray.origin));\r\n    }\r\n  }\r\n\r\n  public evaluate(fraction: number): boolean {\r\n    const curve = this.effectiveCurve();\r\n    if (!curve)\r\n      return false;\r\n    this.currentF = this._plane.altitude(curve.fractionToPoint(fraction));\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * * ASSUME both the \"A\" and \"B\"  evaluations (fraction, function, and derivative) are known.\r\n   * * If function value changed sign between, interpolate an approximate root and improve it with\r\n   *     the newton solver.\r\n   */\r\n  private searchInterval() {\r\n    if (this._functionA * this._functionB > 0) return;\r\n    if (this._functionA === 0) this.announceSolutionFraction(this._fractionA);\r\n    if (this._functionB === 0) this.announceSolutionFraction(this._fractionB);\r\n    if (this._functionA * this._functionB < 0) {\r\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\r\n      if (fraction) {\r\n        this._newtonSolver.setX(fraction);\r\n        if (this._newtonSolver.runIterations())\r\n          this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Evaluate and save _functionB, _derivativeB, and _fractionB. */\r\n  private evaluateB(xyz: Point3d, fraction: number, tangent: Vector3d) {\r\n    this._functionB = this._plane.altitude(xyz);\r\n    this._derivativeB = this._plane.velocity(tangent);\r\n    this._fractionB = fraction;\r\n  }\r\n\r\n  /**\r\n   * Announce point and tangent for evaluations.\r\n   * * The function evaluation is saved as the \"B\" function point.\r\n   * * The function point count is incremented\r\n   * * If function point count is greater than 1, the current interval is searched.\r\n   * * The just-evaluated point (\"B\") is saved as the \"old\" (\"A\") evaluation point.\r\n   * @param xyz\r\n   * @param fraction\r\n   * @param tangent\r\n   */\r\n  public announcePointTangent(xyz: Point3d, fraction: number, tangent: Vector3d): void {\r\n    this.evaluateB(xyz, fraction, tangent);\r\n    if (this._numThisCurve++ > 0) this.searchInterval();\r\n    this._functionA = this._functionB;\r\n    this._fractionA = this._fractionB;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"AppendPlaneIntersectionStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/AppendPlaneIntersectionStrokeHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAAkE;AAGlE,kDAA+C;AAC/C,wEAAgE;AAChE,kDAA+E;AAC/E,gEAA6D;AAE7D,uEAAoE;AAEpE;;;GAGG;AACH,MAAa,oCAAqC,SAAQ,iDAAuB;IACvE,MAAM,CAA6B;IACnC,MAAM,CAAyB;IAC/B,cAAc,CAAwB;IACtC,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IAC/B,0DAA0D;IAClD,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,YAAY,GAAW,CAAC,CAAC;IACzB,aAAa,GAAW,CAAC,CAAC;IAClC,uCAAuC;IAC/B,IAAI,CAAQ;IACZ,aAAa,CAAyC;IAE9D,+EAA+E;IACxE,cAAc;QACnB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,OAAO,IAAI,CAAC,qBAAqB,CAAC;QACpC,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,YAAY,CAAC,CAAI,2FAA2F;IAC1H,CAAC;IAED,YAAmB,KAA6B,EAAE,aAAoC;QACpF,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,aAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IAEM,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;QACtB,0BAA0B;IAC5B,CAAC;IAEM,iBAAiB;IACxB,CAAC;IAEM,qCAAqC,CAC1C,EAAkB,EAClB,UAAkB,EAClB,SAAiB,EACjB,SAAiB;QACjB,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,UAAU,GAAG,CAAC;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,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,IAAI,CAAC,CAAC;YACrD,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC;IAEM,uBAAuB,CAC5B,GAAmB,EACnB,MAAe,EACf,MAAe,EACf,WAAmB,EACnB,SAAiB,EACjB,SAAiB;QACjB,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG;YACf,OAAO;QACT,MAAM,UAAU,GAAG,gCAAY,CAAC,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnD,2BAA2B;QAC3B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,qBAAqB;YACrB,MAAM,QAAQ,GAAG,mBAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,CAAC;YACxE,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,EAAE,CAAC;gBACvC,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3D,CAAC;YACD,qHAAqH;QACvH,CAAC;IACH,CAAC;IAEO,wBAAwB,CAAC,QAAgB;QAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YACpE,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,yCAAmB,CAAC,wBAAwB,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC5G,CAAC;IACH,CAAC;IAEM,QAAQ,CAAC,QAAgB;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK;YACR,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACK,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YAAE,OAAO;QAClD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,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;IAED,kEAAkE;IAC1D,SAAS,CAAC,GAAY,EAAE,QAAgB,EAAE,OAAiB;QACjE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAC5C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAClD,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAC;IAC7B,CAAC;IAED;;;;;;;;;OASG;IACI,oBAAoB,CAAC,GAAY,EAAE,QAAgB,EAAE,OAAiB;QAC3E,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;CACF;AA/ID,oFA+IC","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, PlaneAltitudeEvaluator } from \"../../Geometry\";\r\nimport { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Order2Bezier } from \"../../numerics/BezierPolynomials\";\r\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\r\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\r\n\r\n/**\r\n * Context for computing intersections of a CurvePrimitive with a plane.\r\n * @internal\r\n */\r\nexport class AppendPlaneIntersectionStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\r\n  private _curve: CurvePrimitive | undefined;\r\n  private _plane: PlaneAltitudeEvaluator;\r\n  private _intersections: CurveLocationDetail[];\r\n  private _fractionA: number = 0;\r\n  private _functionA: number = 0;\r\n  // private derivativeA: number;   <---- Not currently used\r\n  private _functionB: number = 0;\r\n  private _fractionB: number = 0;\r\n  private _derivativeB: number = 0;\r\n  private _numThisCurve: number = 0;\r\n  // scratch vars for use within methods.\r\n  private _ray: Ray3d;\r\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\r\n\r\n  // Return the first defined curve among: this.parentCurvePrimitive, this.curve;\r\n  public effectiveCurve(): CurvePrimitive | undefined {\r\n    if (this._parentCurvePrimitive)\r\n      return this._parentCurvePrimitive;\r\n    return this._curve;\r\n  }\r\n\r\n  public get getDerivativeB() {\r\n    return this._derivativeB;    // <--- _derivativeB is not currently used anywhere. Provided getter to suppress lint error\r\n  }\r\n\r\n  public constructor(plane: PlaneAltitudeEvaluator, intersections: CurveLocationDetail[]) {\r\n    super();\r\n    this._plane = plane;\r\n    this._intersections = intersections;\r\n    this.startCurvePrimitive(undefined);\r\n    this._ray = Ray3d.createZero();\r\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\r\n  }\r\n\r\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\r\n    this._curve = curve;\r\n    this._fractionA = 0.0;\r\n    this._numThisCurve = 0;\r\n    this._functionA = 0.0;\r\n    // this.derivativeA = 0.0;\r\n  }\r\n\r\n  public endCurvePrimitive() {\r\n  }\r\n\r\n  public announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void {\r\n    this.startCurvePrimitive(cp);\r\n    if (numStrokes < 1) numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    for (let i = 0; i <= numStrokes; i++) {\r\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\r\n      cp.fractionToPointAndDerivative(fraction, this._ray);\r\n      this.announcePointTangent(this._ray.origin, fraction, this._ray.direction);\r\n    }\r\n  }\r\n\r\n  public announceSegmentInterval(\r\n    _cp: CurvePrimitive,\r\n    point0: Point3d,\r\n    point1: Point3d,\r\n    _numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void {\r\n    const h0 = this._plane.altitude(point0);\r\n    const h1 = this._plane.altitude(point1);\r\n    if (h0 * h1 > 0.0)\r\n      return;\r\n    const fraction01 = Order2Bezier.solveCoffs(h0, h1);\r\n    // let numIntersection = 0;\r\n    if (fraction01 !== undefined) {\r\n      // numIntersection++;\r\n      const fraction = Geometry.interpolate(fraction0, fraction01, fraction1);\r\n      this._newtonSolver.setX(fraction);\r\n      if (this._newtonSolver.runIterations()) {\r\n        this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n      // this.intersections.push(CurveLocationDetail.createCurveFractionPoint(cp, fraction, cp.fractionToPoint(fraction)));\r\n    }\r\n  }\r\n\r\n  private announceSolutionFraction(fraction: number) {\r\n    const curve = this.effectiveCurve();\r\n    if (curve) {\r\n      this._ray = curve.fractionToPointAndDerivative(fraction, this._ray);\r\n      this._intersections.push(CurveLocationDetail.createCurveFractionPoint(curve, fraction, this._ray.origin));\r\n    }\r\n  }\r\n\r\n  public evaluate(fraction: number): boolean {\r\n    const curve = this.effectiveCurve();\r\n    if (!curve)\r\n      return false;\r\n    this.currentF = this._plane.altitude(curve.fractionToPoint(fraction));\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * * ASSUME both the \"A\" and \"B\"  evaluations (fraction, function, and derivative) are known.\r\n   * * If function value changed sign between, interpolate an approximate root and improve it with\r\n   *     the newton solver.\r\n   */\r\n  private searchInterval() {\r\n    if (this._functionA * this._functionB > 0) return;\r\n    if (this._functionA === 0) this.announceSolutionFraction(this._fractionA);\r\n    if (this._functionB === 0) this.announceSolutionFraction(this._fractionB);\r\n    if (this._functionA * this._functionB < 0) {\r\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\r\n      if (fraction) {\r\n        this._newtonSolver.setX(fraction);\r\n        if (this._newtonSolver.runIterations())\r\n          this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Evaluate and save _functionB, _derivativeB, and _fractionB. */\r\n  private evaluateB(xyz: Point3d, fraction: number, tangent: Vector3d) {\r\n    this._functionB = this._plane.altitude(xyz);\r\n    this._derivativeB = this._plane.velocity(tangent);\r\n    this._fractionB = fraction;\r\n  }\r\n\r\n  /**\r\n   * Announce point and tangent for evaluations.\r\n   * * The function evaluation is saved as the \"B\" function point.\r\n   * * The function point count is incremented\r\n   * * If function point count is greater than 1, the current interval is searched.\r\n   * * The just-evaluated point (\"B\") is saved as the \"old\" (\"A\") evaluation point.\r\n   * @param xyz\r\n   * @param fraction\r\n   * @param tangent\r\n   */\r\n  public announcePointTangent(xyz: Point3d, fraction: number, tangent: Vector3d): void {\r\n    this.evaluateB(xyz, fraction, tangent);\r\n    if (this._numThisCurve++ > 0) this.searchInterval();\r\n    this._functionA = this._functionB;\r\n    this._fractionA = this._fractionB;\r\n  }\r\n}\r\n"]}

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

@@ -30,6 +30,10 @@ const Path_1 = require("../Path");
  * @internal
  */
 class ChainCollectorContext {
+    _chains;
+    _makeClones;
+    static _staticPointA;
+    static _staticPointB;
     /**
      * Push a new chain with an optional first primitive.
      */
@@ -44,6 +48,7 @@ class ChainCollectorContext {
             this.pushNewChain();
         return this._chains[this._chains.length - 1];
     }
+    _xyzWork0;
     findAnyChainToConnect(xyz) {
         for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {
             const path = this._chains[chainIndexA];
@@ -63,6 +68,7 @@ class ChainCollectorContext {
         this._chains = [];
         this._makeClones = makeClones;
     }
+    _xyzWork1;
     /** Announce a curve primitive
      * * searchAllChains controls the extent of search for connecting points.
      *   * false ==> only consider connection to most recent chain.

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

@@ -1 +1 @@
-{"version":3,"file":"ChainCollectorContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ChainCollectorContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAM/F,wDAAiD;AACjD,sDAAmD;AACnD,kCAA+B;AAC/B,kCAA+B;AAE/B;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,qBAAqB;IAOhC;;OAEG;IACK,YAAY,CAAC,SAA0B;QAC7C,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,IAAI,SAAS;YACX,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACO,qBAAqB;QAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAC3B,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEO,qBAAqB,CAAC,GAAY;QAExC,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;YAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACvC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChE,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC;gBACnC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC;gBACnC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,YAAmB,UAAmB;QACpC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IAID;;;;;OAKG;IACI,sBAAsB,CAAC,SAAyB,EAAE,kBAA2B,KAAK;QACvF,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;gBACrC,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,YAAY,+BAAc,CAAC;oBACxD,OAAO;gBACT,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBAC3C,SAAS,GAAG,UAAU,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,eAAe,EAAE,CAAC;gBACrB,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBACjD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,0BAA0B,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC;oBAC/H,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;oBAE5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACtD,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzD,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;wBAClB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACnD,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC3B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC3D,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACrD,IAAI,OAAO,EAAE,CAAC,CAAE,4BAA4B;wBAC1C,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;4BAClB,SAAS,CAAC,cAAc,EAAE,CAAC;4BAC3B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACnD,CAAC;6BAAM,CAAC;4BACN,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;wBAC3D,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,yEAAyE;IACjE,cAAc,CAAC,MAAsB,EAAE,IAAoB;QACjE,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YAChC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC;IACH,CAAC;IACD;;;OAGG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE,CAAC;YACrB,qBAAqB,CAAC,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YAChG,qBAAqB,CAAC,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YAC9G,IAAI,qBAAqB,CAAC,aAAa,CAAC,aAAa,CAAC,qBAAqB,CAAC,aAAa,CAAC;gBACxF,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,8EAA8E;IACvE,UAAU,CAAC,mBAA4B,KAAK;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CAAC,UAAsC,EAAE,UAAsC,EAAE,WAAoB,KAAK;QAChJ,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,CAAC,MAAM,KAAK,SAAS;YACjC,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,OAAO,IAAI,CAAC;QACd,qBAAqB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QAC/F,qBAAqB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QACjG,OAAO,QAAQ;YACb,CAAC,CAAC,CAAC,qBAAqB,CAAC,aAAa,CAAC,eAAe,CAAC,qBAAqB,CAAC,aAAa,CAAC;YAC3F,CAAC,CAAC,CAAC,qBAAqB,CAAC,aAAa,CAAC,aAAa,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;IAC9F,CAAC;CACF;AAxJD,sDAwJC","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\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { BagOfCurves } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Loop } from \"../Loop\";\r\nimport { Path } from \"../Path\";\r\n\r\n/**\r\n * Manage a growing array of arrays of curve primitives that are to be joined \"head to tail\" in paths.\r\n * * The caller makes a sequence of calls to announce individual primitives.\r\n *    * The collector has 2 use cases in mind, controlled by `searchAllPaths` flag on `chainCollectorContext.announceCurvePrimitive`\r\n *    * (a) \"simple chains\" -- the caller has the curve primitives in order and just needs to have them monitored for coordinate breaks that indicate transition to a new chain.\r\n *        * The collector needs to watch for connection to the most recent path but not search for prior paths to join to instead.\r\n *    * (b)  \"mixed\" primitives -- primitive order is NOT significant for chain assembly.\r\n *        * The collector needs to search all prior paths at both start and end, and consider connection to both the start and end of each new primitive.\r\n * * The per-curve announcement is\r\n *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).\r\n * * When all curves have been announced, the call to grab the paths option\r\n *    * formLoopsIfClosed\r\n *       * If true, convert closed paths to `Loop`, open paths to `Path`\r\n *       * If false, convert all paths (open or not) to `Path`\r\n * * Usage pattern is\r\n *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`\r\n *   * many times: `   context.announceCurvePrimitive (primitive, searchAllPaths)`\r\n *   * end:        ` result = context.grabResults (formLoopsIfClosed)`\r\n * @internal\r\n */\r\nexport class ChainCollectorContext {\r\n  private _chains: CurvePrimitive[][];\r\n  private _makeClones: boolean;\r\n\r\n  private static _staticPointA: Point3d;\r\n  private static _staticPointB: Point3d;\r\n\r\n  /**\r\n   * Push a new chain with an optional first primitive.\r\n   */\r\n  private pushNewChain(primitive?: CurvePrimitive) {\r\n    const chain = [];\r\n    if (primitive)\r\n      chain.push(primitive);\r\n    this._chains.push(chain);\r\n  }\r\n  private findOrCreateTailChain(): CurvePrimitive[] {\r\n    if (this._chains.length === 0)\r\n      this.pushNewChain();\r\n    return this._chains[this._chains.length - 1];\r\n  }\r\n  private _xyzWork0?: Point3d;\r\n  private findAnyChainToConnect(xyz: Point3d): { chainIndex: number, atEnd: boolean } | undefined {\r\n\r\n    for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {\r\n      const path = this._chains[chainIndexA];\r\n      this._xyzWork1 = path[path.length - 1].endPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz))\r\n        return { chainIndex: chainIndexA, atEnd: true };\r\n      this._xyzWork1 = path[0].startPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz))\r\n        return { chainIndex: chainIndexA, atEnd: false };\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /** Initialize with an empty array of chains.\r\n   * @param makeClones if true, all CurvePrimitives sent to `announceCurvePrimitive` is immediately cloned.  If false, the reference to the original curve is maintained.\r\n   */\r\n  public constructor(makeClones: boolean) {\r\n    this._chains = [];\r\n    this._makeClones = makeClones;\r\n  }\r\n\r\n  private _xyzWork1?: Point3d;\r\n\r\n  /** Announce a curve primitive\r\n   * * searchAllChains controls the extent of search for connecting points.\r\n   *   * false ==> only consider connection to most recent chain.\r\n   *   * true ==> search for any connection, reversing direction as needed.\r\n   * * Otherwise start a new chain.\r\n   */\r\n  public announceCurvePrimitive(candidate: CurvePrimitive, searchAllChains: boolean = false) {\r\n    if (candidate) {\r\n      if (this._makeClones) {\r\n        const candidate1 = candidate.clone();\r\n        if (!candidate1 || !(candidate1 instanceof CurvePrimitive))\r\n          return;\r\n        this.transferMarkup(candidate, candidate1);\r\n        candidate = candidate1;\r\n      }\r\n      if (!searchAllChains) {\r\n        const activeChain = this.findOrCreateTailChain();\r\n        if (activeChain.length === 0 || !ChainCollectorContext.needBreakBetweenPrimitives(activeChain[activeChain.length - 1], candidate))\r\n          activeChain.push(candidate);\r\n        else\r\n          this.pushNewChain(candidate);\r\n      } else {\r\n        this._xyzWork0 = candidate.startPoint(this._xyzWork0);\r\n        let connect = this.findAnyChainToConnect(this._xyzWork0);\r\n        if (connect) {\r\n          if (connect.atEnd) {\r\n            this._chains[connect.chainIndex].push(candidate);\r\n          } else {\r\n            candidate.reverseInPlace();\r\n            this._chains[connect.chainIndex].splice(0, 0, candidate);\r\n          }\r\n        } else {\r\n          this._xyzWork0 = candidate.endPoint(this._xyzWork0);\r\n          connect = this.findAnyChainToConnect(this._xyzWork0);\r\n          if (connect) {  // START of new primitive ..\r\n            if (connect.atEnd) {\r\n              candidate.reverseInPlace();\r\n              this._chains[connect.chainIndex].push(candidate);\r\n            } else {\r\n              this._chains[connect.chainIndex].splice(0, 0, candidate);\r\n            }\r\n          } else {\r\n            this._chains.push([candidate]);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Transfer markup (e.g. startCut, endCut) from source to destination */\r\n  private transferMarkup(source: CurvePrimitive, dest: CurvePrimitive) {\r\n    if (source && dest) {\r\n      dest.startCut = source.startCut;\r\n      dest.endCut = source.endCut;\r\n    }\r\n  }\r\n  /** turn an array of curve primitives into the simplest possible strongly typed curve structure.\r\n   * * The input array is assumed to be connected appropriately to act as the curves of a Path.\r\n   * * When a path is created the curves array is CAPTURED.\r\n   */\r\n  private promoteArrayToCurves(curves: CurvePrimitive[], makeLoopIfClosed: boolean): CurvePrimitive | Path | Loop | undefined {\r\n    if (curves.length === 0)\r\n      return undefined;\r\n    if (makeLoopIfClosed) {\r\n      ChainCollectorContext._staticPointA = curves[0].startPoint(ChainCollectorContext._staticPointA);\r\n      ChainCollectorContext._staticPointB = curves[curves.length - 1].endPoint(ChainCollectorContext._staticPointB);\r\n      if (ChainCollectorContext._staticPointA.isAlmostEqual(ChainCollectorContext._staticPointB))\r\n        return Loop.createArray(curves);\r\n    }\r\n    if (curves.length === 1)\r\n      return curves[0];\r\n    return Path.createArray(curves);\r\n  }\r\n  /** Return the collected results, structured as the simplest possible type. */\r\n  public grabResult(makeLoopIfClosed: boolean = false): CurvePrimitive | Path | BagOfCurves | Loop | undefined {\r\n    const chains = this._chains;\r\n    if (chains.length === 0)\r\n      return undefined;\r\n    if (chains.length === 1)\r\n      return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);\r\n    const bag = BagOfCurves.create();\r\n    for (const chain of chains) {\r\n      const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);\r\n      bag.tryAddChild(q);\r\n    }\r\n    return bag;\r\n  }\r\n  /** test if there is a break between primitiveA and primitiveB, due to any condition such as\r\n   * * primitiveA.endCut\r\n   * * primitiveB.startCut\r\n   * * physical gap between primitives.\r\n   */\r\n  public static needBreakBetweenPrimitives(primitiveA: CurvePrimitive | undefined, primitiveB: CurvePrimitive | undefined, isXYOnly: boolean = false): boolean {\r\n    if (primitiveA === undefined)\r\n      return true;\r\n    if (primitiveB === undefined)\r\n      return true;\r\n    if (primitiveA.endCut !== undefined)\r\n      return true;\r\n    if (primitiveB.startCut !== undefined)\r\n      return true;\r\n    ChainCollectorContext._staticPointA = primitiveA.endPoint(ChainCollectorContext._staticPointA);\r\n    ChainCollectorContext._staticPointB = primitiveB.startPoint(ChainCollectorContext._staticPointB);\r\n    return isXYOnly\r\n      ? !ChainCollectorContext._staticPointA.isAlmostEqualXY(ChainCollectorContext._staticPointB)\r\n      : !ChainCollectorContext._staticPointA.isAlmostEqual(ChainCollectorContext._staticPointB);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ChainCollectorContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ChainCollectorContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAM/F,wDAAiD;AACjD,sDAAmD;AACnD,kCAA+B;AAC/B,kCAA+B;AAE/B;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAa,qBAAqB;IACxB,OAAO,CAAqB;IAC5B,WAAW,CAAU;IAErB,MAAM,CAAC,aAAa,CAAU;IAC9B,MAAM,CAAC,aAAa,CAAU;IAEtC;;OAEG;IACK,YAAY,CAAC,SAA0B;QAC7C,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,IAAI,SAAS;YACX,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACO,qBAAqB;QAC3B,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAC3B,IAAI,CAAC,YAAY,EAAE,CAAC;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;IACO,SAAS,CAAW;IACpB,qBAAqB,CAAC,GAAY;QAExC,KAAK,IAAI,WAAW,GAAG,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,CAAC;YAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACvC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChE,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC;gBACnC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC;gBACnC,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,YAAmB,UAAmB;QACpC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IAEO,SAAS,CAAW;IAE5B;;;;;OAKG;IACI,sBAAsB,CAAC,SAAyB,EAAE,kBAA2B,KAAK;QACvF,IAAI,SAAS,EAAE,CAAC;YACd,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACrB,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;gBACrC,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,YAAY,+BAAc,CAAC;oBACxD,OAAO;gBACT,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBAC3C,SAAS,GAAG,UAAU,CAAC;YACzB,CAAC;YACD,IAAI,CAAC,eAAe,EAAE,CAAC;gBACrB,MAAM,WAAW,GAAG,IAAI,CAAC,qBAAqB,EAAE,CAAC;gBACjD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,0BAA0B,CAAC,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC;oBAC/H,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;;oBAE5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACtD,IAAI,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACzD,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;wBAClB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACnD,CAAC;yBAAM,CAAC;wBACN,SAAS,CAAC,cAAc,EAAE,CAAC;wBAC3B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC3D,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACpD,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACrD,IAAI,OAAO,EAAE,CAAC,CAAE,4BAA4B;wBAC1C,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;4BAClB,SAAS,CAAC,cAAc,EAAE,CAAC;4BAC3B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBACnD,CAAC;6BAAM,CAAC;4BACN,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;wBAC3D,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;oBACjC,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,yEAAyE;IACjE,cAAc,CAAC,MAAsB,EAAE,IAAoB;QACjE,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;YAChC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;QAC9B,CAAC;IACH,CAAC;IACD;;;OAGG;IACK,oBAAoB,CAAC,MAAwB,EAAE,gBAAyB;QAC9E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,gBAAgB,EAAE,CAAC;YACrB,qBAAqB,CAAC,aAAa,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YAChG,qBAAqB,CAAC,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;YAC9G,IAAI,qBAAqB,CAAC,aAAa,CAAC,aAAa,CAAC,qBAAqB,CAAC,aAAa,CAAC;gBACxF,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,WAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IACD,8EAA8E;IACvE,UAAU,CAAC,mBAA4B,KAAK;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YACrB,OAAO,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC;QAChE,MAAM,GAAG,GAAG,6BAAW,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,CAAC,CAAC;YAC7D,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,0BAA0B,CAAC,UAAsC,EAAE,UAAsC,EAAE,WAAoB,KAAK;QAChJ,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,KAAK,SAAS;YAC1B,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,CAAC,MAAM,KAAK,SAAS;YACjC,OAAO,IAAI,CAAC;QACd,IAAI,UAAU,CAAC,QAAQ,KAAK,SAAS;YACnC,OAAO,IAAI,CAAC;QACd,qBAAqB,CAAC,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QAC/F,qBAAqB,CAAC,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;QACjG,OAAO,QAAQ;YACb,CAAC,CAAC,CAAC,qBAAqB,CAAC,aAAa,CAAC,eAAe,CAAC,qBAAqB,CAAC,aAAa,CAAC;YAC3F,CAAC,CAAC,CAAC,qBAAqB,CAAC,aAAa,CAAC,aAAa,CAAC,qBAAqB,CAAC,aAAa,CAAC,CAAC;IAC9F,CAAC;CACF;AAxJD,sDAwJC","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\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { BagOfCurves } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Loop } from \"../Loop\";\r\nimport { Path } from \"../Path\";\r\n\r\n/**\r\n * Manage a growing array of arrays of curve primitives that are to be joined \"head to tail\" in paths.\r\n * * The caller makes a sequence of calls to announce individual primitives.\r\n *    * The collector has 2 use cases in mind, controlled by `searchAllPaths` flag on `chainCollectorContext.announceCurvePrimitive`\r\n *    * (a) \"simple chains\" -- the caller has the curve primitives in order and just needs to have them monitored for coordinate breaks that indicate transition to a new chain.\r\n *        * The collector needs to watch for connection to the most recent path but not search for prior paths to join to instead.\r\n *    * (b)  \"mixed\" primitives -- primitive order is NOT significant for chain assembly.\r\n *        * The collector needs to search all prior paths at both start and end, and consider connection to both the start and end of each new primitive.\r\n * * The per-curve announcement is\r\n *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).\r\n * * When all curves have been announced, the call to grab the paths option\r\n *    * formLoopsIfClosed\r\n *       * If true, convert closed paths to `Loop`, open paths to `Path`\r\n *       * If false, convert all paths (open or not) to `Path`\r\n * * Usage pattern is\r\n *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`\r\n *   * many times: `   context.announceCurvePrimitive (primitive, searchAllPaths)`\r\n *   * end:        ` result = context.grabResults (formLoopsIfClosed)`\r\n * @internal\r\n */\r\nexport class ChainCollectorContext {\r\n  private _chains: CurvePrimitive[][];\r\n  private _makeClones: boolean;\r\n\r\n  private static _staticPointA: Point3d;\r\n  private static _staticPointB: Point3d;\r\n\r\n  /**\r\n   * Push a new chain with an optional first primitive.\r\n   */\r\n  private pushNewChain(primitive?: CurvePrimitive) {\r\n    const chain = [];\r\n    if (primitive)\r\n      chain.push(primitive);\r\n    this._chains.push(chain);\r\n  }\r\n  private findOrCreateTailChain(): CurvePrimitive[] {\r\n    if (this._chains.length === 0)\r\n      this.pushNewChain();\r\n    return this._chains[this._chains.length - 1];\r\n  }\r\n  private _xyzWork0?: Point3d;\r\n  private findAnyChainToConnect(xyz: Point3d): { chainIndex: number, atEnd: boolean } | undefined {\r\n\r\n    for (let chainIndexA = 0; chainIndexA < this._chains.length; chainIndexA++) {\r\n      const path = this._chains[chainIndexA];\r\n      this._xyzWork1 = path[path.length - 1].endPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz))\r\n        return { chainIndex: chainIndexA, atEnd: true };\r\n      this._xyzWork1 = path[0].startPoint(this._xyzWork1);\r\n      if (this._xyzWork1.isAlmostEqual(xyz))\r\n        return { chainIndex: chainIndexA, atEnd: false };\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  /** Initialize with an empty array of chains.\r\n   * @param makeClones if true, all CurvePrimitives sent to `announceCurvePrimitive` is immediately cloned.  If false, the reference to the original curve is maintained.\r\n   */\r\n  public constructor(makeClones: boolean) {\r\n    this._chains = [];\r\n    this._makeClones = makeClones;\r\n  }\r\n\r\n  private _xyzWork1?: Point3d;\r\n\r\n  /** Announce a curve primitive\r\n   * * searchAllChains controls the extent of search for connecting points.\r\n   *   * false ==> only consider connection to most recent chain.\r\n   *   * true ==> search for any connection, reversing direction as needed.\r\n   * * Otherwise start a new chain.\r\n   */\r\n  public announceCurvePrimitive(candidate: CurvePrimitive, searchAllChains: boolean = false) {\r\n    if (candidate) {\r\n      if (this._makeClones) {\r\n        const candidate1 = candidate.clone();\r\n        if (!candidate1 || !(candidate1 instanceof CurvePrimitive))\r\n          return;\r\n        this.transferMarkup(candidate, candidate1);\r\n        candidate = candidate1;\r\n      }\r\n      if (!searchAllChains) {\r\n        const activeChain = this.findOrCreateTailChain();\r\n        if (activeChain.length === 0 || !ChainCollectorContext.needBreakBetweenPrimitives(activeChain[activeChain.length - 1], candidate))\r\n          activeChain.push(candidate);\r\n        else\r\n          this.pushNewChain(candidate);\r\n      } else {\r\n        this._xyzWork0 = candidate.startPoint(this._xyzWork0);\r\n        let connect = this.findAnyChainToConnect(this._xyzWork0);\r\n        if (connect) {\r\n          if (connect.atEnd) {\r\n            this._chains[connect.chainIndex].push(candidate);\r\n          } else {\r\n            candidate.reverseInPlace();\r\n            this._chains[connect.chainIndex].splice(0, 0, candidate);\r\n          }\r\n        } else {\r\n          this._xyzWork0 = candidate.endPoint(this._xyzWork0);\r\n          connect = this.findAnyChainToConnect(this._xyzWork0);\r\n          if (connect) {  // START of new primitive ..\r\n            if (connect.atEnd) {\r\n              candidate.reverseInPlace();\r\n              this._chains[connect.chainIndex].push(candidate);\r\n            } else {\r\n              this._chains[connect.chainIndex].splice(0, 0, candidate);\r\n            }\r\n          } else {\r\n            this._chains.push([candidate]);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  /** Transfer markup (e.g. startCut, endCut) from source to destination */\r\n  private transferMarkup(source: CurvePrimitive, dest: CurvePrimitive) {\r\n    if (source && dest) {\r\n      dest.startCut = source.startCut;\r\n      dest.endCut = source.endCut;\r\n    }\r\n  }\r\n  /** turn an array of curve primitives into the simplest possible strongly typed curve structure.\r\n   * * The input array is assumed to be connected appropriately to act as the curves of a Path.\r\n   * * When a path is created the curves array is CAPTURED.\r\n   */\r\n  private promoteArrayToCurves(curves: CurvePrimitive[], makeLoopIfClosed: boolean): CurvePrimitive | Path | Loop | undefined {\r\n    if (curves.length === 0)\r\n      return undefined;\r\n    if (makeLoopIfClosed) {\r\n      ChainCollectorContext._staticPointA = curves[0].startPoint(ChainCollectorContext._staticPointA);\r\n      ChainCollectorContext._staticPointB = curves[curves.length - 1].endPoint(ChainCollectorContext._staticPointB);\r\n      if (ChainCollectorContext._staticPointA.isAlmostEqual(ChainCollectorContext._staticPointB))\r\n        return Loop.createArray(curves);\r\n    }\r\n    if (curves.length === 1)\r\n      return curves[0];\r\n    return Path.createArray(curves);\r\n  }\r\n  /** Return the collected results, structured as the simplest possible type. */\r\n  public grabResult(makeLoopIfClosed: boolean = false): CurvePrimitive | Path | BagOfCurves | Loop | undefined {\r\n    const chains = this._chains;\r\n    if (chains.length === 0)\r\n      return undefined;\r\n    if (chains.length === 1)\r\n      return this.promoteArrayToCurves(chains[0], makeLoopIfClosed);\r\n    const bag = BagOfCurves.create();\r\n    for (const chain of chains) {\r\n      const q = this.promoteArrayToCurves(chain, makeLoopIfClosed);\r\n      bag.tryAddChild(q);\r\n    }\r\n    return bag;\r\n  }\r\n  /** test if there is a break between primitiveA and primitiveB, due to any condition such as\r\n   * * primitiveA.endCut\r\n   * * primitiveB.startCut\r\n   * * physical gap between primitives.\r\n   */\r\n  public static needBreakBetweenPrimitives(primitiveA: CurvePrimitive | undefined, primitiveB: CurvePrimitive | undefined, isXYOnly: boolean = false): boolean {\r\n    if (primitiveA === undefined)\r\n      return true;\r\n    if (primitiveB === undefined)\r\n      return true;\r\n    if (primitiveA.endCut !== undefined)\r\n      return true;\r\n    if (primitiveB.startCut !== undefined)\r\n      return true;\r\n    ChainCollectorContext._staticPointA = primitiveA.endPoint(ChainCollectorContext._staticPointA);\r\n    ChainCollectorContext._staticPointB = primitiveB.startPoint(ChainCollectorContext._staticPointB);\r\n    return isXYOnly\r\n      ? !ChainCollectorContext._staticPointA.isAlmostEqualXY(ChainCollectorContext._staticPointB)\r\n      : !ChainCollectorContext._staticPointA.isAlmostEqual(ChainCollectorContext._staticPointB);\r\n  }\r\n}\r\n"]}

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

@@ -16,6 +16,8 @@ const CurveProcessor_1 = require("../CurveProcessor");
  * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent
  */
 class CloneCurvesContext extends CurveProcessor_1.RecursiveCurveProcessorWithStack {
+    _result;
+    _transform;
     constructor(transform) {
         super();
         this._transform = transform;

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

@@ -1 +1 @@
-{"version":3,"file":"CloneCurvesContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneCurvesContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,wDAA8E;AAE9E,sDAAqE;AAErE;;;;GAIG;AACH,MAAa,kBAAmB,SAAQ,iDAAgC;IAGtE,YAAsB,SAAqB;QACzC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IAC3B,CAAC;IACM,MAAM,CAAC,KAAK,CAAC,MAAuB,EAAE,SAAqB;QAChE,MAAM,OAAO,GAAG,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,OAAO,CAAC;IACzB,CAAC;IACe,KAAK,CAAC,CAAkB;QACtC,IAAI,CAAC,YAAY,iCAAe;YAC9B,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC;IACpC,CAAC;IACe,KAAK;QACnB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,mCAAmC;gBAC/D,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;iBACnB,oCAAoC;gBACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,iGAAiG;IACvF,OAAO,CAAC,SAAyB;QACzC,IAAI,IAAI,CAAC,UAAU;YACjB,OAAO,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IACe,sBAAsB,CAAC,SAAyB,EAAE,cAAsB;QACtF,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,YAAY,4BAAU,IAAI,MAAM,YAAY,6BAAW;gBAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;wBACnB,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACxB,CAAC;QACL,CAAC;IACH,CAAC;CACF;AA/CD,gDA+CC","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 { Transform } from \"../../geometry3d/Transform\";\r\nimport { BagOfCurves, CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\n\r\n/**\r\n * Algorithmic class for cloning curve collections.\r\n * * recurse through collection nodes, building image nodes as needed and inserting clones of children.\r\n * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent\r\n */\r\nexport class CloneCurvesContext extends RecursiveCurveProcessorWithStack {\r\n  protected _result: CurveCollection | undefined;\r\n  private _transform: Transform | undefined;\r\n  protected constructor(transform?: Transform) {\r\n    super();\r\n    this._transform = transform;\r\n    this._result = undefined;\r\n  }\r\n  public static clone(target: CurveCollection, transform?: Transform): CurveCollection | undefined {\r\n    const context = new CloneCurvesContext(transform);\r\n    target.announceToCurveProcessor(context);\r\n    return context._result;\r\n  }\r\n  public override enter(c: CurveCollection) {\r\n    if (c instanceof CurveCollection)\r\n      super.enter(c.cloneEmptyPeer());\r\n  }\r\n  public override leave(): CurveCollection | undefined {\r\n    const result = super.leave();\r\n    if (result) {\r\n      if (this._stack.length === 0) // this should only happen once !!!\r\n        this._result = result;\r\n      else // push this result to top of stack.\r\n        this._stack[this._stack.length - 1].tryAddChild(result);\r\n    }\r\n    return result;\r\n  }\r\n  // specialized clone methods override this (and allow announceCurvePrimitive to insert to parent)\r\n  protected doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    if (this._transform)\r\n      return primitive.cloneTransformed(this._transform);\r\n    return primitive.clone();\r\n  }\r\n  public override announceCurvePrimitive(primitive: CurvePrimitive, _indexInParent: number): void {\r\n    const c = this.doClone(primitive);\r\n    if (c !== undefined && this._stack.length > 0) {\r\n      const parent = this._stack[this._stack.length - 1];\r\n      if (parent instanceof CurveChain || parent instanceof BagOfCurves)\r\n        if (Array.isArray(c)) {\r\n          for (const c1 of c) {\r\n            parent.tryAddChild(c1);\r\n          }\r\n        } else {\r\n          parent.tryAddChild(c);\r\n        }\r\n    }\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CloneCurvesContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneCurvesContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAGH,wDAA8E;AAE9E,sDAAqE;AAErE;;;;GAIG;AACH,MAAa,kBAAmB,SAAQ,iDAAgC;IAC5D,OAAO,CAA8B;IACvC,UAAU,CAAwB;IAC1C,YAAsB,SAAqB;QACzC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IAC3B,CAAC;IACM,MAAM,CAAC,KAAK,CAAC,MAAuB,EAAE,SAAqB;QAChE,MAAM,OAAO,GAAG,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,OAAO,CAAC;IACzB,CAAC;IACe,KAAK,CAAC,CAAkB;QACtC,IAAI,CAAC,YAAY,iCAAe;YAC9B,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC;IACpC,CAAC;IACe,KAAK;QACnB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,MAAM,EAAE,CAAC;YACX,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,mCAAmC;gBAC/D,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;iBACnB,oCAAoC;gBACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5D,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,iGAAiG;IACvF,OAAO,CAAC,SAAyB;QACzC,IAAI,IAAI,CAAC,UAAU;YACjB,OAAO,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IACe,sBAAsB,CAAC,SAAyB,EAAE,cAAsB;QACtF,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,YAAY,4BAAU,IAAI,MAAM,YAAY,6BAAW;gBAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrB,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE,CAAC;wBACnB,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBACxB,CAAC;QACL,CAAC;IACH,CAAC;CACF;AA/CD,gDA+CC","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 { Transform } from \"../../geometry3d/Transform\";\r\nimport { BagOfCurves, CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\n\r\n/**\r\n * Algorithmic class for cloning curve collections.\r\n * * recurse through collection nodes, building image nodes as needed and inserting clones of children.\r\n * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent\r\n */\r\nexport class CloneCurvesContext extends RecursiveCurveProcessorWithStack {\r\n  protected _result: CurveCollection | undefined;\r\n  private _transform: Transform | undefined;\r\n  protected constructor(transform?: Transform) {\r\n    super();\r\n    this._transform = transform;\r\n    this._result = undefined;\r\n  }\r\n  public static clone(target: CurveCollection, transform?: Transform): CurveCollection | undefined {\r\n    const context = new CloneCurvesContext(transform);\r\n    target.announceToCurveProcessor(context);\r\n    return context._result;\r\n  }\r\n  public override enter(c: CurveCollection) {\r\n    if (c instanceof CurveCollection)\r\n      super.enter(c.cloneEmptyPeer());\r\n  }\r\n  public override leave(): CurveCollection | undefined {\r\n    const result = super.leave();\r\n    if (result) {\r\n      if (this._stack.length === 0) // this should only happen once !!!\r\n        this._result = result;\r\n      else // push this result to top of stack.\r\n        this._stack[this._stack.length - 1].tryAddChild(result);\r\n    }\r\n    return result;\r\n  }\r\n  // specialized clone methods override this (and allow announceCurvePrimitive to insert to parent)\r\n  protected doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    if (this._transform)\r\n      return primitive.cloneTransformed(this._transform);\r\n    return primitive.clone();\r\n  }\r\n  public override announceCurvePrimitive(primitive: CurvePrimitive, _indexInParent: number): void {\r\n    const c = this.doClone(primitive);\r\n    if (c !== undefined && this._stack.length > 0) {\r\n      const parent = this._stack[this._stack.length - 1];\r\n      if (parent instanceof CurveChain || parent instanceof BagOfCurves)\r\n        if (Array.isArray(c)) {\r\n          for (const c1 of c) {\r\n            parent.tryAddChild(c1);\r\n          }\r\n        } else {\r\n          parent.tryAddChild(c);\r\n        }\r\n    }\r\n  }\r\n}\r\n"]}

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

@@ -20,13 +20,21 @@ const NewtonRtoRStrokeHandler_1 = require("./NewtonRtoRStrokeHandler");
  * @internal
  */
 class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler_1.NewtonRtoRStrokeHandler {
+    _curve;
+    _closestPoint;
+    _spacePoint;
+    _extend;
+    _fractionA = 0;
+    _functionA = 0;
+    _functionB = 0;
+    _fractionB = 0;
+    _numThisCurve = 0;
+    // scratch vars for use within methods.
+    _workPoint;
+    _workRay;
+    _newtonSolver;
     constructor(spacePoint, extend, result) {
         super();
-        this._fractionA = 0;
-        this._functionA = 0;
-        this._functionB = 0;
-        this._fractionB = 0;
-        this._numThisCurve = 0;
         this._spacePoint = spacePoint;
         this._workPoint = Point3dVector3d_1.Point3d.create();
         this._workRay = Ray3d_1.Ray3d.createZero();

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,6CAA0C;AAE1C,sEAAqE;AACrE,kDAA+C;AAC/C,kDAA+E;AAC/E,wDAAqF;AACrF,gEAA6D;AAE7D,uEAAoE;AAEpE;;;GAGG;AACH,MAAa,yBAA0B,SAAQ,iDAAuB;IAepE,YAAmB,UAAmB,EAAE,MAAmC,EAAE,MAA4B;QACvG,KAAK,EAAE,CAAC;QAXF,eAAU,GAAW,CAAC,CAAC;QACvB,eAAU,GAAW,CAAC,CAAC;QACvB,eAAU,GAAW,CAAC,CAAC;QACvB,eAAU,GAAW,CAAC,CAAC;QACvB,kBAAa,GAAW,CAAC,CAAC;QAQhC,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,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IAEM,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;IAEM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,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;IAEM,iBAAiB;IACxB,CAAC;IAEM,qCAAqC,CAAC,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QACvH,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;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,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;IAEO,iBAAiB,CAAC,EAAkB,EAAE,QAAgB,EAAE,KAAc;QAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClD,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;IAEM,uBAAuB,CAAC,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,WAAmB,EAAE,SAAiB,EAAE,SAAiB;QAC5I,IAAI,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACrF,2FAA2F;QAC3F,IAAI,CAAC,IAAI,CAAC,OAAO;YACf,aAAa,GAAG,mBAAQ,CAAC,eAAe,CAAC,aAAa,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aAC/D,CAAC;YACJ,IAAI,SAAS,KAAK,GAAG;gBACnB,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YAC/C,IAAI,SAAS,KAAK,GAAG;gBACnB,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QACjD,CAAC;QACD,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;IAEO,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YAAE,OAAO;QAClD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,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;IAEO,SAAS,CAAC,SAAiB,EAAE,KAAY;QAC/C,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAEO,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;IAEM,QAAQ,CAAC,QAAgB;QAC9B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5E,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,WAAW,CAAC,QAAgB,EAAE,IAAW;QAC9C,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC/B,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;IAEM,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;AA3ID,8DA2IC","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 { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\r\nimport { CurveExtendOptions, VariantCurveExtendParameter } from \"../CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\r\n\r\n/**\r\n * Context for searching for the closest point to a CurvePrimitive.\r\n * @internal\r\n */\r\nexport class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\r\n  private _curve: CurvePrimitive | undefined;\r\n  private _closestPoint: CurveLocationDetail | undefined;\r\n  private _spacePoint: Point3d;\r\n  private _extend: VariantCurveExtendParameter;\r\n  private _fractionA: number = 0;\r\n  private _functionA: number = 0;\r\n  private _functionB: number = 0;\r\n  private _fractionB: number = 0;\r\n  private _numThisCurve: number = 0;\r\n  // scratch vars for use within methods.\r\n  private _workPoint: Point3d;\r\n  private _workRay: Ray3d;\r\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\r\n\r\n  public constructor(spacePoint: Point3d, extend: VariantCurveExtendParameter, result?: CurveLocationDetail) {\r\n    super();\r\n    this._spacePoint = spacePoint;\r\n    this._workPoint = Point3d.create();\r\n    this._workRay = Ray3d.createZero();\r\n    this._closestPoint = result;\r\n    this._extend = extend;\r\n    this.startCurvePrimitive(undefined);\r\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\r\n  }\r\n\r\n  public claimResult(): CurveLocationDetail | undefined {\r\n    if (this._closestPoint) {\r\n      this._newtonSolver.setX(this._closestPoint.fraction);\r\n      this._curve = this._closestPoint.curve;\r\n      if (this._newtonSolver.runIterations()) {\r\n        let fraction = this._newtonSolver.getX();\r\n        fraction = CurveExtendOptions.correctFraction(this._extend, fraction);\r\n        this.announceSolutionFraction(fraction);\r\n      }\r\n    }\r\n    return this._closestPoint;\r\n  }\r\n\r\n  public needPrimaryGeometryForStrokes() {\r\n    return true;\r\n  }\r\n\r\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\r\n    this._curve = curve;\r\n    this._fractionA = 0.0;\r\n    this._numThisCurve = 0;\r\n    this._functionA = 0.0;\r\n  }\r\n\r\n  public endCurvePrimitive() {\r\n  }\r\n\r\n  public announceIntervalForUniformStepStrokes(cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number): void {\r\n    this.startCurvePrimitive(cp);\r\n    this.announceSolutionFraction(0.0); // test start point as closest\r\n    this.announceSolutionFraction(1.0); // test end point as closest\r\n    if (numStrokes < 1) numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    for (let i = 0; i <= numStrokes; i++) {\r\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\r\n      cp.fractionToPointAndDerivative(fraction, this._workRay);\r\n      this.announceRay(fraction, this._workRay);\r\n    }\r\n  }\r\n\r\n  private announceCandidate(cp: CurvePrimitive, fraction: number, point: Point3d) {\r\n    const distance = this._spacePoint.distance(point);\r\n    if (this._closestPoint && distance > this._closestPoint.a)\r\n      return;\r\n    this._closestPoint = CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);\r\n    this._closestPoint.a = distance;\r\n    if (this._parentCurvePrimitive !== undefined)\r\n      this._closestPoint.curve = this._parentCurvePrimitive;\r\n  }\r\n\r\n  public announceSegmentInterval(cp: CurvePrimitive, point0: Point3d, point1: Point3d, _numStrokes: number, fraction0: number, fraction1: number): void {\r\n    let localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);\r\n    // only consider extending the segment if the immediate caller says we are at endpoints ...\r\n    if (!this._extend)\r\n      localFraction = Geometry.clampToStartEnd(localFraction, 0.0, 1.0);\r\n    else {\r\n      if (fraction0 !== 0.0)\r\n        localFraction = Math.max(localFraction, 0.0);\r\n      if (fraction1 !== 1.0)\r\n        localFraction = Math.min(localFraction, 1.0);\r\n    }\r\n    this._workPoint = point0.interpolate(localFraction, point1);\r\n    const globalFraction = Geometry.interpolate(fraction0, localFraction, fraction1);\r\n    this.announceCandidate(cp, globalFraction, this._workPoint);\r\n  }\r\n\r\n  private searchInterval() {\r\n    if (this._functionA * this._functionB > 0) return;\r\n    if (this._functionA === 0) this.announceSolutionFraction(this._fractionA);\r\n    if (this._functionB === 0) this.announceSolutionFraction(this._fractionB);\r\n    if (this._functionA * this._functionB < 0) {\r\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\r\n      if (fraction) {\r\n        this._newtonSolver.setX(fraction);\r\n        if (this._newtonSolver.runIterations())\r\n          this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n    }\r\n  }\r\n\r\n  private evaluateB(fractionB: number, dataB: Ray3d) {\r\n    this._functionB = dataB.dotProductToPoint(this._spacePoint);\r\n    this._fractionB = fractionB;\r\n  }\r\n\r\n  private announceSolutionFraction(fraction: number) {\r\n    if (this._curve)\r\n      this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));\r\n  }\r\n\r\n  public evaluate(fraction: number): boolean {\r\n    let curve = this._curve;\r\n    if (this._parentCurvePrimitive)\r\n      curve = this._parentCurvePrimitive;\r\n    if (curve) {\r\n      this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);\r\n      this.currentF = this._workRay.dotProductToPoint(this._spacePoint);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  public announceRay(fraction: number, data: Ray3d): void {\r\n    this.evaluateB(fraction, data);\r\n    if (this._numThisCurve++ > 0) this.searchInterval();\r\n    this._functionA = this._functionB;\r\n    this._fractionA = this._fractionB;\r\n  }\r\n\r\n  public announcePointTangent(point: Point3d, fraction: number, tangent: Vector3d) {\r\n    this._workRay.set(point, tangent);\r\n    this.announceRay(fraction, this._workRay);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"ClosestPointStrokeHandler.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/ClosestPointStrokeHandler.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,6CAA0C;AAE1C,sEAAqE;AACrE,kDAA+C;AAC/C,kDAA+E;AAC/E,wDAAqF;AACrF,gEAA6D;AAE7D,uEAAoE;AAEpE;;;GAGG;AACH,MAAa,yBAA0B,SAAQ,iDAAuB;IAC5D,MAAM,CAA6B;IACnC,aAAa,CAAkC;IAC/C,WAAW,CAAU;IACrB,OAAO,CAA8B;IACrC,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,UAAU,GAAW,CAAC,CAAC;IACvB,aAAa,GAAW,CAAC,CAAC;IAClC,uCAAuC;IAC/B,UAAU,CAAU;IACpB,QAAQ,CAAQ;IAChB,aAAa,CAAyC;IAE9D,YAAmB,UAAmB,EAAE,MAAmC,EAAE,MAA4B;QACvG,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,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,+CAAsC,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IAEM,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;IAEM,6BAA6B;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,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;IAEM,iBAAiB;IACxB,CAAC;IAEM,qCAAqC,CAAC,EAAkB,EAAE,UAAkB,EAAE,SAAiB,EAAE,SAAiB;QACvH,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;YAAE,UAAU,GAAG,CAAC,CAAC;QACnC,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;IAEO,iBAAiB,CAAC,EAAkB,EAAE,QAAgB,EAAE,KAAc;QAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClD,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;IAEM,uBAAuB,CAAC,EAAkB,EAAE,MAAe,EAAE,MAAe,EAAE,WAAmB,EAAE,SAAiB,EAAE,SAAiB;QAC5I,IAAI,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,0BAA0B,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QACrF,2FAA2F;QAC3F,IAAI,CAAC,IAAI,CAAC,OAAO;YACf,aAAa,GAAG,mBAAQ,CAAC,eAAe,CAAC,aAAa,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aAC/D,CAAC;YACJ,IAAI,SAAS,KAAK,GAAG;gBACnB,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YAC/C,IAAI,SAAS,KAAK,GAAG;gBACnB,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;QACjD,CAAC;QACD,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;IAEO,cAAc;QACpB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC;YAAE,OAAO;QAClD,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YAAE,IAAI,CAAC,wBAAwB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1E,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;IAEO,SAAS,CAAC,SAAiB,EAAE,KAAY;QAC/C,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAEO,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;IAEM,QAAQ,CAAC,QAAgB;QAC9B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QACxB,IAAI,IAAI,CAAC,qBAAqB;YAC5B,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC;QACrC,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5E,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClE,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,WAAW,CAAC,QAAgB,EAAE,IAAW;QAC9C,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC/B,IAAI,IAAI,CAAC,aAAa,EAAE,GAAG,CAAC;YAAE,IAAI,CAAC,cAAc,EAAE,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;IACpC,CAAC;IAEM,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;AA3ID,8DA2IC","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 { IStrokeHandler } from \"../../geometry3d/GeometryHandler\";\r\nimport { Point3d, Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../../geometry3d/Ray3d\";\r\nimport { Newton1dUnboundedApproximateDerivative } from \"../../numerics/Newton\";\r\nimport { CurveExtendOptions, VariantCurveExtendParameter } from \"../CurveExtendMode\";\r\nimport { CurveLocationDetail } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { NewtonRtoRStrokeHandler } from \"./NewtonRtoRStrokeHandler\";\r\n\r\n/**\r\n * Context for searching for the closest point to a CurvePrimitive.\r\n * @internal\r\n */\r\nexport class ClosestPointStrokeHandler extends NewtonRtoRStrokeHandler implements IStrokeHandler {\r\n  private _curve: CurvePrimitive | undefined;\r\n  private _closestPoint: CurveLocationDetail | undefined;\r\n  private _spacePoint: Point3d;\r\n  private _extend: VariantCurveExtendParameter;\r\n  private _fractionA: number = 0;\r\n  private _functionA: number = 0;\r\n  private _functionB: number = 0;\r\n  private _fractionB: number = 0;\r\n  private _numThisCurve: number = 0;\r\n  // scratch vars for use within methods.\r\n  private _workPoint: Point3d;\r\n  private _workRay: Ray3d;\r\n  private _newtonSolver: Newton1dUnboundedApproximateDerivative;\r\n\r\n  public constructor(spacePoint: Point3d, extend: VariantCurveExtendParameter, result?: CurveLocationDetail) {\r\n    super();\r\n    this._spacePoint = spacePoint;\r\n    this._workPoint = Point3d.create();\r\n    this._workRay = Ray3d.createZero();\r\n    this._closestPoint = result;\r\n    this._extend = extend;\r\n    this.startCurvePrimitive(undefined);\r\n    this._newtonSolver = new Newton1dUnboundedApproximateDerivative(this);\r\n  }\r\n\r\n  public claimResult(): CurveLocationDetail | undefined {\r\n    if (this._closestPoint) {\r\n      this._newtonSolver.setX(this._closestPoint.fraction);\r\n      this._curve = this._closestPoint.curve;\r\n      if (this._newtonSolver.runIterations()) {\r\n        let fraction = this._newtonSolver.getX();\r\n        fraction = CurveExtendOptions.correctFraction(this._extend, fraction);\r\n        this.announceSolutionFraction(fraction);\r\n      }\r\n    }\r\n    return this._closestPoint;\r\n  }\r\n\r\n  public needPrimaryGeometryForStrokes() {\r\n    return true;\r\n  }\r\n\r\n  public startCurvePrimitive(curve: CurvePrimitive | undefined) {\r\n    this._curve = curve;\r\n    this._fractionA = 0.0;\r\n    this._numThisCurve = 0;\r\n    this._functionA = 0.0;\r\n  }\r\n\r\n  public endCurvePrimitive() {\r\n  }\r\n\r\n  public announceIntervalForUniformStepStrokes(cp: CurvePrimitive, numStrokes: number, fraction0: number, fraction1: number): void {\r\n    this.startCurvePrimitive(cp);\r\n    this.announceSolutionFraction(0.0); // test start point as closest\r\n    this.announceSolutionFraction(1.0); // test end point as closest\r\n    if (numStrokes < 1) numStrokes = 1;\r\n    const df = 1.0 / numStrokes;\r\n    for (let i = 0; i <= numStrokes; i++) {\r\n      const fraction = Geometry.interpolate(fraction0, i * df, fraction1);\r\n      cp.fractionToPointAndDerivative(fraction, this._workRay);\r\n      this.announceRay(fraction, this._workRay);\r\n    }\r\n  }\r\n\r\n  private announceCandidate(cp: CurvePrimitive, fraction: number, point: Point3d) {\r\n    const distance = this._spacePoint.distance(point);\r\n    if (this._closestPoint && distance > this._closestPoint.a)\r\n      return;\r\n    this._closestPoint = CurveLocationDetail.createCurveFractionPoint(cp, fraction, point, this._closestPoint);\r\n    this._closestPoint.a = distance;\r\n    if (this._parentCurvePrimitive !== undefined)\r\n      this._closestPoint.curve = this._parentCurvePrimitive;\r\n  }\r\n\r\n  public announceSegmentInterval(cp: CurvePrimitive, point0: Point3d, point1: Point3d, _numStrokes: number, fraction0: number, fraction1: number): void {\r\n    let localFraction = this._spacePoint.fractionOfProjectionToLine(point0, point1, 0.0);\r\n    // only consider extending the segment if the immediate caller says we are at endpoints ...\r\n    if (!this._extend)\r\n      localFraction = Geometry.clampToStartEnd(localFraction, 0.0, 1.0);\r\n    else {\r\n      if (fraction0 !== 0.0)\r\n        localFraction = Math.max(localFraction, 0.0);\r\n      if (fraction1 !== 1.0)\r\n        localFraction = Math.min(localFraction, 1.0);\r\n    }\r\n    this._workPoint = point0.interpolate(localFraction, point1);\r\n    const globalFraction = Geometry.interpolate(fraction0, localFraction, fraction1);\r\n    this.announceCandidate(cp, globalFraction, this._workPoint);\r\n  }\r\n\r\n  private searchInterval() {\r\n    if (this._functionA * this._functionB > 0) return;\r\n    if (this._functionA === 0) this.announceSolutionFraction(this._fractionA);\r\n    if (this._functionB === 0) this.announceSolutionFraction(this._fractionB);\r\n    if (this._functionA * this._functionB < 0) {\r\n      const fraction = Geometry.inverseInterpolate(this._fractionA, this._functionA, this._fractionB, this._functionB);\r\n      if (fraction) {\r\n        this._newtonSolver.setX(fraction);\r\n        if (this._newtonSolver.runIterations())\r\n          this.announceSolutionFraction(this._newtonSolver.getX());\r\n      }\r\n    }\r\n  }\r\n\r\n  private evaluateB(fractionB: number, dataB: Ray3d) {\r\n    this._functionB = dataB.dotProductToPoint(this._spacePoint);\r\n    this._fractionB = fractionB;\r\n  }\r\n\r\n  private announceSolutionFraction(fraction: number) {\r\n    if (this._curve)\r\n      this.announceCandidate(this._curve, fraction, this._curve.fractionToPoint(fraction));\r\n  }\r\n\r\n  public evaluate(fraction: number): boolean {\r\n    let curve = this._curve;\r\n    if (this._parentCurvePrimitive)\r\n      curve = this._parentCurvePrimitive;\r\n    if (curve) {\r\n      this._workRay = curve.fractionToPointAndDerivative(fraction, this._workRay);\r\n      this.currentF = this._workRay.dotProductToPoint(this._spacePoint);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n\r\n  public announceRay(fraction: number, data: Ray3d): void {\r\n    this.evaluateB(fraction, data);\r\n    if (this._numThisCurve++ > 0) this.searchInterval();\r\n    this._functionA = this._functionB;\r\n    this._fractionA = this._fractionB;\r\n  }\r\n\r\n  public announcePointTangent(point: Point3d, fraction: number, tangent: Vector3d) {\r\n    this._workRay.set(point, tangent);\r\n    this.announceRay(fraction, this._workRay);\r\n  }\r\n}\r\n"]}

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

@@ -12,6 +12,9 @@ const LineString3d_1 = require("../LineString3d");
  * @internal
  */
 class CountLinearPartsSearchContext extends CurveProcessor_1.RecursiveCurveProcessorWithStack {
+    numLineSegment;
+    numLineString;
+    numOther;
     constructor() {
         super();
         this.numLineSegment = 0;

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

@@ -1 +1 @@
-{"version":3,"file":"CountLinearPartsSearchContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CountLinearPartsSearchContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAO/F,sDAAqE;AACrE,oDAAiD;AACjD,kDAA+C;AAE/C;;GAEG;AACH,MAAa,6BAA8B,SAAQ,iDAAgC;IAIjF;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;IACM,MAAM,CAAC,sBAAsB,CAAC,MAAuB;QAC1D,MAAM,OAAO,GAAG,IAAI,6BAA6B,EAAE,CAAC;QACpD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC;IAC9B,CAAC;IACe,sBAAsB,CAAC,KAAqB,EAAE,cAAsB;QAClF,IAAI,KAAK,YAAY,6BAAa;YAChC,IAAI,CAAC,cAAc,EAAE,CAAC;aACnB,IAAI,KAAK,YAAY,2BAAY;YACpC,IAAI,CAAC,aAAa,EAAE,CAAC;;YAErB,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpB,CAAC;CACF;AAvBD,sEAuBC","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\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\n\r\n/** Algorithmic class: Count LineSegment3d and LineString3d primitives.\r\n * @internal\r\n */\r\nexport class CountLinearPartsSearchContext extends RecursiveCurveProcessorWithStack {\r\n  public numLineSegment: number;\r\n  public numLineString: number;\r\n  public numOther: number;\r\n  constructor() {\r\n    super();\r\n    this.numLineSegment = 0;\r\n    this.numLineString = 0;\r\n    this.numOther = 0;\r\n  }\r\n  public static hasNonLinearPrimitives(target: CurveCollection): boolean {\r\n    const context = new CountLinearPartsSearchContext();\r\n    target.announceToCurveProcessor(context);\r\n    return context.numOther > 0;\r\n  }\r\n  public override announceCurvePrimitive(curve: CurvePrimitive, _indexInParent: number): void {\r\n    if (curve instanceof LineSegment3d)\r\n      this.numLineSegment++;\r\n    else if (curve instanceof LineString3d)\r\n      this.numLineString++;\r\n    else\r\n      this.numOther++;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CountLinearPartsSearchContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CountLinearPartsSearchContext.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAO/F,sDAAqE;AACrE,oDAAiD;AACjD,kDAA+C;AAE/C;;GAEG;AACH,MAAa,6BAA8B,SAAQ,iDAAgC;IAC1E,cAAc,CAAS;IACvB,aAAa,CAAS;IACtB,QAAQ,CAAS;IACxB;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;IACM,MAAM,CAAC,sBAAsB,CAAC,MAAuB;QAC1D,MAAM,OAAO,GAAG,IAAI,6BAA6B,EAAE,CAAC;QACpD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC;IAC9B,CAAC;IACe,sBAAsB,CAAC,KAAqB,EAAE,cAAsB;QAClF,IAAI,KAAK,YAAY,6BAAa;YAChC,IAAI,CAAC,cAAc,EAAE,CAAC;aACnB,IAAI,KAAK,YAAY,2BAAY;YACpC,IAAI,CAAC,aAAa,EAAE,CAAC;;YAErB,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpB,CAAC;CACF;AAvBD,sEAuBC","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\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\n\r\n/** Algorithmic class: Count LineSegment3d and LineString3d primitives.\r\n * @internal\r\n */\r\nexport class CountLinearPartsSearchContext extends RecursiveCurveProcessorWithStack {\r\n  public numLineSegment: number;\r\n  public numLineString: number;\r\n  public numOther: number;\r\n  constructor() {\r\n    super();\r\n    this.numLineSegment = 0;\r\n    this.numLineString = 0;\r\n    this.numOther = 0;\r\n  }\r\n  public static hasNonLinearPrimitives(target: CurveCollection): boolean {\r\n    const context = new CountLinearPartsSearchContext();\r\n    target.announceToCurveProcessor(context);\r\n    return context.numOther > 0;\r\n  }\r\n  public override announceCurvePrimitive(curve: CurvePrimitive, _indexInParent: number): void {\r\n    if (curve instanceof LineSegment3d)\r\n      this.numLineSegment++;\r\n    else if (curve instanceof LineString3d)\r\n      this.numLineString++;\r\n    else\r\n      this.numOther++;\r\n  }\r\n}\r\n"]}

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

@@ -40,9 +40,27 @@ const LineString3d_1 = require("../LineString3d");
  * @internal
  */
 class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometryHandler {
+    _geometryB;
     setGeometryB(geometryB) {
         this._geometryB = geometryB;
     }
+    /**
+     * Maximum XY distance (z is ignored). Approach larger than this is not interesting.
+     * This is caller defined and can be undefined.
+     */
+    _maxDistanceToAccept;
+    /** Squared max distance. This is private, and is forced to at least small metric distance squared. */
+    _maxDistanceSquared;
+    /**
+     * Start and end points of line segments that meet closest approach criteria, i.e., they are perpendicular to
+     * both curves and their length is smaller than _maxDistanceToAccept.
+     */
+    _results;
+    static _workPointAA0 = Point3dVector3d_1.Point3d.create();
+    static _workPointAA1 = Point3dVector3d_1.Point3d.create();
+    static _workPointBB0 = Point3dVector3d_1.Point3d.create();
+    static _workPointBB1 = Point3dVector3d_1.Point3d.create();
+    static _workPointB = Point3dVector3d_1.Point3d.create();
     /**
      * Constructor.
      * @param geometryB second curve for intersection. Saved for reference by specific handler methods.
@@ -834,9 +852,4 @@ class CurveCurveCloseApproachXY extends GeometryHandler_1.RecurseToCurvesGeometr
     }
 }
 exports.CurveCurveCloseApproachXY = CurveCurveCloseApproachXY;
-CurveCurveCloseApproachXY._workPointAA0 = Point3dVector3d_1.Point3d.create();
-CurveCurveCloseApproachXY._workPointAA1 = Point3dVector3d_1.Point3d.create();
-CurveCurveCloseApproachXY._workPointBB0 = Point3dVector3d_1.Point3d.create();
-CurveCurveCloseApproachXY._workPointBB1 = Point3dVector3d_1.Point3d.create();
-CurveCurveCloseApproachXY._workPointB = Point3dVector3d_1.Point3d.create();
 //# sourceMappingURL=CurveCurveCloseApproachXY.js.map