@itwin/core-geometry 4.2.0-dev.3 → 4.2.0-dev.30

package/lib/esm/curve/UnionRegion.js.map

@@ -1 +1 @@
-{"version":3,"file":"UnionRegion.js","sourceRoot":"","sources":["../../../src/curve/UnionRegion.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAO/F,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAGpD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAG9C;;;;;;GAMG;AACH,MAAM,OAAO,WAAY,SAAQ,eAAe;IAG9C,yCAAyC;IAClC,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IAGD,kCAAkC;IAClC,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,iDAAiD;IACjD;QACE,KAAK,EAAE,CAAC;QAdV,wCAAwC;QACxB,wBAAmB,GAAG,aAAa,CAAC;QAclD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,wDAAwD;IACjD,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgC;QACtD,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;YACxB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;SAC3B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,+EAA+E;IACxE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,2FAA2F;IACpF,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,uDAAuD;IAChD,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE;YAC5B,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,YAAY;gBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,cAAc;QACnB,OAAO,IAAI,WAAW,EAAE,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,KAAe;QAChC,IAAI,KAAK,IAAI,KAAK,YAAY,YAAY,IAAI,KAAK,YAAY,IAAI,EAAE;YACnE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0CAA0C;IACnC,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IACvE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;CACF","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 { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { Loop } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `UnionRegion` is a collection of other planar region types -- `Loop` and `ParityRegion`.\r\n * * The composite is the union of the contained regions.\r\n * * A point is \"in\" the composite if it is \"in\" one or more of the contained regions.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class UnionRegion extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"unionRegion\";\r\n  /** Test if `other` is a `UnionRegion` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof UnionRegion;\r\n  }\r\n  /** Collection of Loop and ParityRegion children. */\r\n  protected _children: Array<ParityRegion | Loop>;\r\n  /** Return the array of regions */\r\n  public override get children(): Array<ParityRegion | Loop> {\r\n    return this._children;\r\n  }\r\n  /** Constructor -- initialize with no children */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Create a `UnionRegion` with given region children */\r\n  public static create(...data: Array<ParityRegion | Loop>): UnionRegion {\r\n    const result = new UnionRegion();\r\n    for (const child of data) {\r\n      result.tryAddChild(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (5) of a corresponding MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 5;\r\n  }\r\n  /** Dispatch to more strongly typed `processor.announceUnionRegion(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceUnionRegion(this, indexInParent);\r\n  }\r\n  /** Return structural clone with stroked primitives. */\r\n  public cloneStroked(options?: StrokeOptions): UnionRegion {\r\n    const clone = new UnionRegion();\r\n    let child;\r\n    for (child of this._children) {\r\n      const childStrokes = child.cloneStroked(options);\r\n      if (childStrokes)\r\n        clone.children.push(childStrokes);\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return new empty `UnionRegion` */\r\n  public cloneEmptyPeer(): UnionRegion {\r\n    return new UnionRegion();\r\n  }\r\n  /**\r\n   * Try to add a child.\r\n   * * Returns false if the `AnyCurve` child is not a region type.\r\n   */\r\n  public tryAddChild(child: AnyCurve): boolean {\r\n    if (child && child instanceof ParityRegion || child instanceof Loop) {\r\n      this._children.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child identified by index. */\r\n  public getChild(i: number): Loop | ParityRegion | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleUnionRegion(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleUnionRegion(this);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"UnionRegion.js","sourceRoot":"","sources":["../../../src/curve/UnionRegion.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAO/F,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAGpD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAG9C;;;;;;GAMG;AACH,MAAM,OAAO,WAAY,SAAQ,eAAe;IAG9C,yCAAyC;IAClC,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IAGD,kCAAkC;IAClC,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,iDAAiD;IACjD;QACE,KAAK,EAAE,CAAC;QAdV,wCAAwC;QACxB,wBAAmB,GAAG,aAAa,CAAC;QAclD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,wDAAwD;IACjD,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgC;QACtD,MAAM,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;YACxB,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;SAC3B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,+EAA+E;IACxE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,2FAA2F;IACpF,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,uDAAuD;IAChD,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE;YAC5B,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YACjD,IAAI,YAAY;gBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,cAAc;QACnB,OAAO,IAAI,WAAW,EAAE,CAAC;IAC3B,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,KAAe;QAChC,IAAI,KAAK,IAAI,CAAC,KAAK,YAAY,YAAY,IAAI,KAAK,YAAY,IAAI,CAAC,EAAE;YACrE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0CAA0C;IACnC,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM;YAC3B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8EAA8E;IACvE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;CACF","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 { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { AnyCurve } from \"./CurveTypes\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { Loop } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * * A `UnionRegion` is a collection of other planar region types -- `Loop` and `ParityRegion`.\r\n * * The composite is the union of the contained regions.\r\n * * A point is \"in\" the composite if it is \"in\" one or more of the contained regions.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport class UnionRegion extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"unionRegion\";\r\n  /** Test if `other` is a `UnionRegion` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof UnionRegion;\r\n  }\r\n  /** Collection of Loop and ParityRegion children. */\r\n  protected _children: Array<ParityRegion | Loop>;\r\n  /** Return the array of regions */\r\n  public override get children(): Array<ParityRegion | Loop> {\r\n    return this._children;\r\n  }\r\n  /** Constructor -- initialize with no children */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Create a `UnionRegion` with given region children */\r\n  public static create(...data: Array<ParityRegion | Loop>): UnionRegion {\r\n    const result = new UnionRegion();\r\n    for (const child of data) {\r\n      result.tryAddChild(child);\r\n    }\r\n    return result;\r\n  }\r\n  /** Return the boundary type (5) of a corresponding MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 5;\r\n  }\r\n  /** Dispatch to more strongly typed `processor.announceUnionRegion(this, indexInParent)` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceUnionRegion(this, indexInParent);\r\n  }\r\n  /** Return structural clone with stroked primitives. */\r\n  public cloneStroked(options?: StrokeOptions): UnionRegion {\r\n    const clone = new UnionRegion();\r\n    let child;\r\n    for (child of this._children) {\r\n      const childStrokes = child.cloneStroked(options);\r\n      if (childStrokes)\r\n        clone.children.push(childStrokes);\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return new empty `UnionRegion` */\r\n  public cloneEmptyPeer(): UnionRegion {\r\n    return new UnionRegion();\r\n  }\r\n  /**\r\n   * Try to add a child.\r\n   * * Returns false if the `AnyCurve` child is not a region type.\r\n   */\r\n  public tryAddChild(child: AnyCurve): boolean {\r\n    if (child && (child instanceof ParityRegion || child instanceof Loop)) {\r\n      this._children.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child identified by index. */\r\n  public getChild(i: number): Loop | ParityRegion | undefined {\r\n    if (i < this._children.length)\r\n      return this._children[i];\r\n    return undefined;\r\n  }\r\n  /** Second step of double dispatch:  call `handler.handleUnionRegion(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleUnionRegion(this);\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,225 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { BSplineCurve3d } from "../../bspline/BSplineCurve";
+import { BSplineCurve3dH } from "../../bspline/BSplineCurve3dH";
+import { RecurseToCurvesGeometryHandler } from "../../geometry3d/GeometryHandler";
+import { Arc3d } from "../Arc3d";
+import { AnyCurve } from "../CurveTypes";
+import { CurveLocationDetail, CurveLocationDetailPair } from "../CurveLocationDetail";
+import { CurvePrimitive } from "../CurvePrimitive";
+import { LineSegment3d } from "../LineSegment3d";
+import { LineString3d } from "../LineString3d";
+/**
+ * Handler class for XY close approach between _geometryB and another geometry.
+ * * Approach means the XY distance (z is ignored) between _geometryB and another geometry.
+ * * Closest approach is a measure of the proximity of one curve to another. It's the length of the shortest line
+ * segment perpendicular to both curves; if the curves intersect, the closest approach is zero. In the context of
+ * this class, z-coordinates are ignored, so the closest approach is as seen in the top view. If you have coplanar
+ * input curves and want to find closest approach in their plane, rotate them first into a plane parallel to the
+ * xy-plane, then afterward, rotate the results back as required.
+ * * Close approach can also be from a curve endpoint perpendicular to another curve or from a curve endpoint to
+ * another curve endpoint.
+ * * Instances are initialized and called from CurveCurve.
+ * * geometryB is saved for later reference.
+ * @internal
+ */
+export declare class CurveCurveCloseApproachXY extends RecurseToCurvesGeometryHandler {
+    private _geometryB;
+    private _circularArcB;
+    private _circularRadiusB;
+    private setGeometryB;
+    /**
+     * Maximum XY distance (z is ignored). Approach larger than this is not interesting.
+     * This is caller defined and can be undefined.
+     */
+    private _maxDistanceToAccept;
+    /** Squared max distance. This is private, and is forced to at least small metric distance squared. */
+    private _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.
+     */
+    private _results;
+    private static _workPointAA0;
+    private static _workPointAA1;
+    private static _workPointBB0;
+    private static _workPointBB1;
+    private static _workPointB;
+    private reinitialize;
+    /**
+     * Constructor.
+     * @param geometryB second curve for intersection. Saved for reference by specific handler methods.
+     */
+    constructor(geometryB: AnyCurve | undefined);
+    /** Set the (possibly undefined) max XY distance (z is ignored) to accept. */
+    set maxDistanceToAccept(value: number | undefined);
+    /** Access the (possibly undefined) max XY distance (z is ignored) to accept. */
+    get maxDistanceToAccept(): number | undefined;
+    /** Ask if the maxDistanceToAccept value is defined and positive */
+    get isMaxDistanceSet(): boolean;
+    /** Reset the geometry and flags, leaving all other parts unchanged (and preserving accumulated intersections) */
+    resetGeometry(geometryB: AnyCurve): void;
+    /** returns true if `fraction` is in [0,1] within tolerance */
+    private acceptFraction;
+    /**
+     * Return the results structure for the intersection calculation, structured as an array of CurveLocationDetailPair.
+     * @param reinitialize if true, a new results structure is created for use by later calls.
+     */
+    grabPairedResults(reinitialize?: boolean): CurveLocationDetailPair[];
+    /** Returns `true` if `detail` has same curve and fraction. */
+    private sameCurveAndFraction;
+    /**
+     * If distance between pointA and pointB is less than maxDistance, record CurveLocationDetailPair which is
+     * the approach from pointA to pointB.
+     */
+    private testAndRecordPointPairApproach;
+    /**
+     * Create a close approach pair if XY distance is within maxDistance.
+     * @param localFractionA a fraction on first curve
+     * @param cpA the first curve
+     * @param fractionA0 start of the first curve
+     * @param fractionA1 end of the first curve
+     * @param localFractionB a fraction on second curve
+     * @param cpB the second curve
+     * @param fractionB0 start of the second curve
+     * @param fractionB1 end of the second curve
+     * @param reversed true to have order reversed in final structures
+     * @param intervalDetails optional CurveLocationDetailPair
+     */
+    private recordPointWithLocalFractions;
+    /**
+     * Capture a close approach pair that has point and local fraction but not curve.
+     * * Record the pair, each detail modified with global fraction and input curve.
+     * * Pair is neither modified nor recorded if it would be a duplicate of the last recorded pair.
+     * @param pair details computed with local fractions
+     * @param cpA curveA
+     * @param fractionA0 global start fraction on curveA
+     * @param fractionA1 global end fraction on curveA
+     * @param cpB curveB
+     * @param fractionB0 global start fraction on curveB
+     * @param fractionB1 global end fraction on curveB
+     * @param reversed whether to reverse the details in the pair
+     */
+    private capturePairWithLocalFractions;
+    /**
+     * Emit recordPoint for multiple pairs (on full curve) if within maxDistance.
+     * @param cpA first curve primitive (possibly different from curve in detailA, but fraction compatible)
+     * @param cpB second curve primitive (possibly different from curve in detailA, but fraction compatible)
+     * @param pairs array of pairs
+     * @param reversed true to have order reversed in final structures.
+     */
+    recordPairs(cpA: CurvePrimitive, cpB: CurvePrimitive, pairs: CurveLocationDetailPair[] | undefined, reversed: boolean): void;
+    /**
+     * Record fully assembled (but possibly reversed) detail pair.
+     * @param detailA first detail
+     * @param detailB second detail
+     * @param reversed true to have order reversed in final structures.
+     */
+    captureDetailPair(detailA: CurveLocationDetail | undefined, detailB: CurveLocationDetail | undefined, reversed: boolean): void;
+    private static updatePointToSegmentDistance;
+    /**
+     * Return fractions of close approach within maxDistance between two line segments (a0,a1) and (b0,b1).
+     * * Math details can be found at docs/learning/geometry/CurveCurve.md
+     * @param a0 start point of line a
+     * @param a1 end point of line a
+     * @param b0 start point of line b
+     * @param b1 end point of line b
+     * @param maxDistanceSquared maximum distance squared (assumed to be positive)
+     * @returns the fractional (not xy) coordinates in result.x and result.y. result.x is fraction on line a.
+     * result.y is fraction on line b.
+     */
+    private static segmentSegmentBoundedApproach;
+    /**
+     * Check different combination of fractions on curveA and curveB. If distance between points at 2 fractions
+     * is less than maxDistance, record CurveLocationDetailPair which is the approach between the 2 points.
+     * Optionally, record close approaches of one curve's points if they fall between the other curve's points.
+     * @param cpA curveA
+     * @param fA0 fraction0 on curveA
+     * @param fA1 fraction1 on curveA
+     * @param testProjectionOnA whether to record projections of the given curveB points onto curveA
+     * @param cpB curveB
+     * @param fB0 fraction0 on curveB
+     * @param fB1 fraction0 on curveB
+     * @param testProjectionOnB whether to record projections of the given curveA points onto curveB
+     * @param reversed true to have order reversed in final structures.
+     */
+    private testAndRecordFractionalPairApproach;
+    /** Find the closest approach between pointA and cpB. Add the approach if it's within fB0 and fB1. */
+    private testAndRecordProjection;
+    /**
+     * Compute intersection of two line segments.
+     * Filter by extension rules.
+     * Record with fraction mapping.
+     * * The fraction mappings allow portions of a linestring to be passed here.
+     */
+    private computeSegmentSegment3D;
+    /** Low level dispatch of segment with segment. */
+    private dispatchSegmentSegment;
+    /**
+     * Low level dispatch of segment with arc.
+     * Find close approaches within maxDistance between a line segments (pointA0, pointA1) and an arc.
+     * To consider:
+     * 1) intersection between arc and segment.
+     * 2) arc endpoints to segment endpoints or arc endpoints projection to the segment.
+     * 3) line parallel to arc tangent.
+     * @param cpA curve A (line segment or line string)
+     * @param pointA0 start point of the segment
+     * @param fractionA0 fraction of the start of the segment
+     * @param pointA1 end point of the segment
+     * @param fractionA1 fraction of the end of the segment
+     * @param arc the arc
+     * @param reversed true to have order reversed in final structures
+     */
+    private dispatchSegmentArc;
+    /** Low level dispatch of circular arc with circular arc. radiusA must be larger than or equal to radiusB. */
+    private dispatchCircularCircularOrdered;
+    /** Find the fractional point (if any) on the circular `arc` in the direction of `radialVector`. */
+    private resolveDirectionToArcXYFraction;
+    /** Low level dispatch of arc with arc. Only circular arcs are supported. */
+    private dispatchArcArc;
+    /** Low level dispatch of arc with (beziers of) a bspline curve */
+    private dispatchArcBsplineCurve3d;
+    /** Low level dispatch of (beziers of) a bspline curve with (beziers of) a bspline curve */
+    private dispatchBSplineCurve3dBSplineCurve3d;
+    /** Low level dispatch of linestring with (beziers of) a bspline curve */
+    dispatchLineStringBSplineCurve(lsA: LineString3d, curveB: BSplineCurve3d, reversed: boolean): any;
+    /** Low level dispatch of segment with (beziers of) a bspline curve */
+    dispatchSegmentBsplineCurve(segA: LineSegment3d, curveB: BSplineCurve3d, reversed: boolean): any;
+    /** Detail computation for segment approaching linestring. */
+    computeSegmentLineString(segA: LineSegment3d, lsB: LineString3d, reversed: boolean): void;
+    /** Detail computation for arc approaching linestring. */
+    computeArcLineString(arcA: Arc3d, lsB: LineString3d, reversed: boolean): any;
+    /** Low level dispatch of curve collection. */
+    private dispatchCurveCollection;
+    /** Double dispatch handler for strongly typed segment. */
+    handleLineSegment3d(segmentA: LineSegment3d): any;
+    /**
+     * Set bits for comparison to range xy
+     * * bit 0x01 => x smaller than range.low.x
+     * * bit 0x02 => x larger than range.high.x
+     * * bit 0x04 => y smaller than range.low.y
+     * * bit 0x08 => y larger than range.high.y
+     * * If we divide XY plane into 9 areas using the range, the function returns 0 for points
+     * inside the range. Below is other binary numbers returned by the function for all 9 areas:
+     *   1001 | 1000 | 1010
+     *   ------------------
+     *    1   |  0   |  10
+     *   ------------------
+     *   101  | 100  | 110
+     * @param xy point to test
+     * @param range range for comparison
+     */
+    private classifyBitsPointRangeXY;
+    /** Low level dispatch of line string with line string. */
+    private computeLineStringLineString;
+    /** Double dispatch handler for strongly typed linestring. */
+    handleLineString3d(lsA: LineString3d): any;
+    /** Double dispatch handler for strongly typed arc. */
+    handleArc3d(arc0: Arc3d): any;
+    /** Double dispatch handler for strongly typed bspline curve. */
+    handleBSplineCurve3d(curve: BSplineCurve3d): any;
+    /** Double dispatch handler for strongly typed homogeneous bspline curve .. */
+    handleBSplineCurve3dH(_curve: BSplineCurve3dH): any;
+}
+//# sourceMappingURL=CurveCurveCloseApproachXY.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CurveCurveCloseApproachXY.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CurveCurveCloseApproachXY.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,cAAc,EAAsB,MAAM,4BAA4B,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAEhE,OAAO,EAAE,8BAA8B,EAAE,MAAM,kCAAkC,CAAC;AAKlF,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AACjC,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAEzC,OAAO,EAAqB,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACzG,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAI/C;;;;;;;;;;;;;GAaG;AACH,qBAAa,yBAA0B,SAAQ,8BAA8B;IAC3E,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,aAAa,CAAoB;IACzC,OAAO,CAAC,gBAAgB,CAAqB;IAC7C,OAAO,CAAC,YAAY;IAYpB;;;OAGG;IACH,OAAO,CAAC,oBAAoB,CAAqB;IACjD,sGAAsG;IACtG,OAAO,CAAC,mBAAmB,CAAS;IACpC;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAA6B;IAE7C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,aAAa,CAAoB;IAChD,OAAO,CAAC,MAAM,CAAC,WAAW,CAAoB;IAE9C,OAAO,CAAC,YAAY;IAGpB;;;OAGG;gBACgB,SAAS,EAAE,QAAQ,GAAG,SAAS;IAMlD,6EAA6E;IAC7E,IAAW,mBAAmB,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAIvD;IACD,gFAAgF;IAChF,IAAW,mBAAmB,IAAI,MAAM,GAAG,SAAS,CAEnD;IACD,mEAAmE;IACnE,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD,iHAAiH;IAC1G,aAAa,CAAC,SAAS,EAAE,QAAQ;IAGxC,8DAA8D;IAC9D,OAAO,CAAC,cAAc;IAOtB;;;OAGG;IACI,iBAAiB,CAAC,YAAY,GAAE,OAAe,GAAG,uBAAuB,EAAE;IAMlF,8DAA8D;IAC9D,OAAO,CAAC,oBAAoB;IAG5B;;;OAGG;IACH,OAAO,CAAC,8BAA8B;IAatC;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,6BAA6B;IA+DrC;;;;;;;;;;;;OAYG;IACH,OAAO,CAAC,6BAA6B;IAoCrC;;;;;;OAMG;IACI,WAAW,CAChB,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,cAAc,EAAE,KAAK,EAAE,uBAAuB,EAAE,GAAG,SAAS,EAAE,QAAQ,EAAE,OAAO,GACxG,IAAI;IASP;;;;;OAKG;IACI,iBAAiB,CACtB,OAAO,EAAE,mBAAmB,GAAG,SAAS,EAAE,OAAO,EAAE,mBAAmB,GAAG,SAAS,EAAE,QAAQ,EAAE,OAAO,GACpG,IAAI;IASP,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAuB3C;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,6BAA6B;IA6D5C;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAC,mCAAmC;IA4B3C,qGAAqG;IACrG,OAAO,CAAC,uBAAuB;IAY/B;;;;;OAKG;IACH,OAAO,CAAC,uBAAuB;IAwB/B,kDAAkD;IAClD,OAAO,CAAC,sBAAsB;IAmB9B;;;;;;;;;;;;;;OAcG;IACH,OAAO,CAAC,kBAAkB;IAmE1B,6GAA6G;IAC7G,OAAO,CAAC,+BAA+B;IA6BvC,mGAAmG;IACnG,OAAO,CAAC,+BAA+B;IAYvC,4EAA4E;IAC5E,OAAO,CAAC,cAAc;IAkBtB,kEAAkE;IAClE,OAAO,CAAC,yBAAyB;IAKjC,2FAA2F;IAC3F,OAAO,CAAC,oCAAoC;IAS5C,yEAAyE;IAClE,8BAA8B,CAAC,GAAG,EAAE,YAAY,EAAE,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,GAAG,GAAG;IAKxG,sEAAsE;IAC/D,2BAA2B,CAAC,IAAI,EAAE,aAAa,EAAE,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,OAAO,GAAG,GAAG;IAKvG,6DAA6D;IACtD,wBAAwB,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,GAAG,IAAI;IAehG,yDAAyD;IAClD,oBAAoB,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,GAAG,GAAG;IAuBnF,8CAA8C;IAC9C,OAAO,CAAC,uBAAuB;IAU/B,0DAA0D;IAC1C,mBAAmB,CAAC,QAAQ,EAAE,aAAa,GAAG,GAAG;IAmBjE;;;;;;;;;;;;;;;OAeG;IACH,OAAO,CAAC,wBAAwB;IAahC,0DAA0D;IAC1D,OAAO,CAAC,2BAA2B;IA8CnC,6DAA6D;IAC7C,kBAAkB,CAAC,GAAG,EAAE,YAAY,GAAG,GAAG;IAe1D,sDAAsD;IACtC,WAAW,CAAC,IAAI,EAAE,KAAK,GAAG,GAAG;IAgB7C,gEAAgE;IAChD,oBAAoB,CAAC,KAAK,EAAE,cAAc,GAAG,GAAG;IAchE,8EAA8E;IAC9D,qBAAqB,CAAC,MAAM,EAAE,eAAe,GAAG,GAAG;CAgBpE"}