@itwin/core-geometry 4.1.0-dev.8 → 4.1.0-dev.81

package/lib/cjs/curve/CurveCollection.js

@@ -25,10 +25,12 @@ const ProxyCurve_1 = require("./ProxyCurve");
  * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:
  * - `CurveChain` is a (non-instantiable) intermediate class for a sequence of `CurvePrimitive` joining head-to-tail.
  * The two instantiable forms of `CurveChain` are
- *   - `Path` - A chain not required to close, and not enclosing a planar area
- *   - `Loop` - A chain required to close from last to first so that a planar area is enclosed.
- * - `ParityRegion` -- a collection of coplanar `Loop`s, with "in/out" classification by parity rules
- * - `UnionRegion` -- a collection of coplanar `Loop`s, with "in/out" classification by union rules
+ *   - `Path` - A chain not required to close and not enclosing a planar area (so curves do not have to be on the
+ * same plane).
+ *   - `Loop` - A chain required to close from last to first so that a planar area is enclosed (so curves have to
+ * be on the same plane).
+ * - `ParityRegion` -- a collection of coplanar `Loop`, with "in/out" classification by parity rules.
+ * - `UnionRegion` -- a collection of coplanar `Loop` and/or `ParityRegion`, with "in/out" classification by union rules.
  * - `BagOfCurves` -- a collection of `AnyCurve` with no implied structure.
  *
  * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.
@@ -68,7 +70,7 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
      * Return the max gap between adjacent primitives in Path and Loop collections.
      * * In a Path, gaps are computed between consecutive primitives.
      * * In a Loop, gaps are computed between consecutive primitives and between last and first.
-     * * gaps are NOT computed between consecutive CurvePrimitives in "unstructured" collections.  The type is
+     * * Gaps are NOT computed between consecutive CurvePrimitives in "unstructured" collections. The type is
      * "unstructured" so gaps should not be semantically meaningful.
      */
     maxGap() {
@@ -90,11 +92,15 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
     cloneTransformed(transform) {
         return CloneCurvesContext_1.CloneCurvesContext.clone(this, transform);
     }
-    /** Create a deep copy with all linestrings expanded to multiple LineSegment3d. */
+    /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */
     cloneWithExpandedLineStrings() {
         return CloneWithExpandedLineStrings_1.CloneWithExpandedLineStrings.clone(this);
     }
-    /** Recurse through children to collect CurvePrimitive's in flat array. */
+    /**
+     * Push all CurvePrimitives contained in the instance onto the `results` array.
+     * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives
+     * of the Loop are pushed onto `results`.
+     */
     collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings = false) {
         if (this.children) {
             for (const child of this.children) {
@@ -106,10 +112,12 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
         }
     }
     /**
-     * Return an array containing only the curve primitives.
+     * Return an array containing all CurvePrimitives in the instance.
+     * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of
+     * the Loop are pushed onto the returned array.
      * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without
-     * clearing the array.)
-     * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself.  If true,
+     * clearing the array).
+     * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,
      * it recurses to its (otherwise hidden) children.
      */
     collectCurvePrimitives(collectorArray, smallestPossiblePrimitives = false, explodeLineStrings = false) {
@@ -124,7 +132,7 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
      * * `UnionRegion`
      */
     get isAnyRegionType() {
-        return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 5 || this.dgnBoundaryType() === 4;
+        return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;
     }
     /** Return true for a `Path`, i.e. a chain of curves joined head-to-tail */
     get isOpenPath() {
@@ -132,12 +140,16 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
     }
     /**
      * Return true for a single-loop planar region type, i.e. `Loop`.
-     * * This is _not- a test for physical closure of a `Path`
+     * * This is NOT a test for physical closure of a `Path`.
      */
     get isClosedPath() {
         return this.dgnBoundaryType() === 2;
     }
-    /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */
+    /**
+     * Extend (increase) the given range as needed to encompass all curves in the curve collection.
+     * @param rangeToExtend the given range.
+     * @param transform if supplied, the range is extended with transformed curves.
+     */
     extendRange(rangeToExtend, transform) {
         const children = this.children;
         if (children) {
@@ -147,8 +159,8 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
         }
     }
     /**
-     * * Find any curve primitive in the source.
-     * * Evaluate it at a fraction (which by default is an interior fraction)
+     * Find any CurvePrimitive in the source and evaluate it at the given fraction.
+     * * The first CurvePrimitive found is evaluated. Any other CurvePrimitives are ignored.
      * @param source containing `CurvePrimitive` or `CurveCollection`
      * @param fraction fraction to use in `curve.fractionToPoint(fraction)`
      */
@@ -181,19 +193,20 @@ class CurveCollection extends GeometryQuery_1.GeometryQuery {
 exports.CurveCollection = CurveCollection;
 /**
  * Shared base class for use by both open and closed paths.
- * - A `CurveChain` contains only curvePrimitives.  No other paths, loops, or regions allowed.
- * - A single entry in the chain can in fact contain multiple curve primitives if the entry itself is (for instance)
- * `CurveChainWithDistanceIndex`
- *   which presents itself (through method interface) as a CurvePrimitive with well defined mappings from fraction
- * to xyz, but in fact does all the
- *   calculations over multiple primitives.
- * - The specific derived classes are `Path` and `Loop`
- * - `CurveChain` is an intermediate class.   It is not instantiable on its own.
+ * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.
+ * * The specific derived classes are `Path` and `Loop`
+ * * `CurveChain` is an intermediate class. It is not instantiable on its own.
+ * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings
+ * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.
  * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.
  * @public
  */
 class CurveChain extends CurveCollection {
-    constructor() { super(); this._curves = []; }
+    /** Constructor */
+    constructor() {
+        super();
+        this._curves = [];
+    }
     /** Return the array of `CurvePrimitive` */
     get children() {
         if (this._curves === undefined)
@@ -201,7 +214,7 @@ class CurveChain extends CurveCollection {
         return this._curves;
     }
     /**
-     * Return the `[index]` curve primitive, optionally using `modulo` to map`index` to the cyclic indexing.
+     * Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.
      * * In particular, `-1` is the final curve.
      * @param index cyclic index
      */
@@ -209,8 +222,7 @@ class CurveChain extends CurveCollection {
         const n = this.children.length;
         if (n === 0)
             return undefined;
-        /** Try simplest non-cyclic access first . . */
-        if (index >= 0 && index < n)
+        if (index >= 0 && index < n) // try simplest non-cyclic access first
             return this.children[index];
         if (cyclic) {
             const index2 = Geometry_1.Geometry.modulo(index, n);
@@ -223,6 +235,11 @@ class CurveChain extends CurveCollection {
      * @param options tolerance parameters controlling the stroking.
      */
     getPackedStrokes(options) {
+        /**
+         * The object returned by "cloneStroked" has the same type (Loop or Path) but instead of a chain of
+         * CurvePrimitives as children, it has a single LineString3d child. "getPackedStrokes" just returns
+         * the points of that LineString3d using "packedPoints".
+         */
         const tree = this.cloneStroked(options);
         if (tree instanceof CurveChain) {
             const children = tree.children;
@@ -234,16 +251,6 @@ class CurveChain extends CurveCollection {
         }
         return undefined;
     }
-    /*  EDL 01/20 Path, Loop, CurveChainWithDistanceIndex all implement this.
-        Reducing it to abstract.
-        Hypothetically, a derived class in the wild might be depending on this.
-     {
-      const strokes = LineString3d.create();
-      for (const curve of this.children)
-        curve.emitStrokes(strokes, options);
-      return strokes;
-    }
-    */
     /**
      * Add a child curve.
      * * Returns false if the given child is not a CurvePrimitive.
@@ -276,7 +283,7 @@ class CurveChain extends CurveCollection {
         this._curves.reverse();
     }
     /**
-     * Return the index where target is found in the array of children
+     * Return the index where target is found in the array of children.
      * @param alsoSearchProxies whether to also check proxy curves of the children
     */
     childIndex(target, alsoSearchProxies) {
@@ -295,7 +302,7 @@ class CurveChain extends CurveCollection {
         }
         return undefined;
     }
-    /** Evaluate an indexed curve at a fraction.  Return as a CurveLocationDetail that indicates the primitive. */
+    /** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. */
     primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(index, fraction, cyclic = false, result) {
         const primitive = this.cyclicCurvePrimitive(index, cyclic);
         if (primitive) {

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

@@ -1 +1 @@
-{"version":3,"file":"CurveCollection.js","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,0CAAuC;AAQvC,+DAA4D;AAC5D,qDAAkD;AAElD,mDAAgD;AAChD,8EAA2E;AAC3E,kGAA+F;AAC/F,oGAAiG;AACjG,0EAAuE;AACvE,4FAAyF;AACzF,4EAAyE;AACzE,wFAAqF;AACrF,iDAA8C;AAC9C,6CAA0C;AAe1C;;;;;;;;;;;;GAYG;AACH,MAAsB,eAAgB,SAAQ,6BAAa;IAA3D;;QACE,wCAAwC;QACxB,qBAAgB,GAAG,iBAAiB,CAAC;QAGrD,mEAAmE;QACnE,uDAAuD;QAChD,YAAO,GAAY,KAAK,CAAC;IA8JlC,CAAC;IA7JC,6DAA6D;IACtD,UAAU;QACf,OAAO,qCAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,uDAAuD;IAChD,YAAY,CAAC,UAAmB;QACrC,IAAI,OAAwC,CAAC;QAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,IAAI,KAAK,YAAY,+BAAc,EAAE;oBACnC,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;oBACtD,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;iBAChE;qBAAM,IAAI,KAAK,YAAY,eAAe,EAAE;oBAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;oBAC/C,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;iBAChE;aACF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;OAMG;IACI,MAAM;QACX,OAAO,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,wGAAwG;IACjG,2BAA2B;QAChC,OAAO,6DAA6B,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,8CAA8C;IACvC,mBAAmB,CAAC,SAAoB;QAC7C,OAAO,iDAAuB,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;IAC3D,CAAC;IACD,gDAAgD;IAChC,gBAAgB,CAAC,SAAoB;QACnD,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,kFAAkF;IAC3E,4BAA4B;QACjC,OAAO,2DAA4B,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD,0EAA0E;IAClE,wBAAwB,CAC9B,OAAyB,EAAE,0BAAmC,EAAE,qBAA8B,KAAK;QAEnG,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,IAAI,KAAK,YAAY,+BAAc;oBACjC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;qBACrF,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC3F;SACF;IACH,CAAC;IACD;;;;;;OAMG;IACI,sBAAsB,CAC3B,cAAiC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAEnH,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QACvF,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;OAKG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtG,CAAC;IACD,2EAA2E;IAC3E,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD;;;OAGG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAoBD,mGAAmG;IAC5F,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,QAAQ,EAAE;YACZ,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;gBACxB,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;aACzC;SACF;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,4CAA4C,CACxD,MAAiC,EAAE,WAAmB,GAAG;QAEzD,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc,EAAE;YACpC,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;SAC3E;aAAM,IAAI,MAAM,YAAY,eAAe,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;YAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,4CAA4C,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClF,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;aACjB;QACH,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QACrE,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;CACF;AArKD,0CAqKC;AAED;;;;;;;;;;;;GAYG;AACH,MAAsB,UAAW,SAAQ,eAAe;IAGtD,gBAA0B,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC;IACvD,2CAA2C;IAC3C,IAAoB,QAAQ;QAC1B,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;YAC5B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,oBAAoB,CAAC,KAAa,EAAE,SAAkB,IAAI;QAC/D,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,+CAA+C;QAC/C,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC;YACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,MAAM,EAAE;YACV,MAAM,MAAM,GAAG,mBAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;SAC9B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,OAAuB;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,YAAY,UAAU,EAAE;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;gBACzB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,YAAY,2BAAY;oBAC5B,OAAO,EAAE,CAAC,YAAY,CAAC;aAC1B;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;;;;;;MASE;IACF;;;OAGG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,+BAAc,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IACvB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,mEAAmE;IACnD,WAAW,CAAC,KAAc,EAAE,SAAqB;QAC/D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IACD;;;OAGG;IACI,sBAAsB;QAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD;;;MAGE;IACK,UAAU,CAAC,MAAkC,EAAE,iBAA2B;QAC/E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM;gBAC5B,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,iBAAiB,IAAI,KAAK,EAAE;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,UAAU,YAAY,uBAAU,EAAE;oBACpC,IAAI,UAAU,CAAC,UAAU,KAAK,MAAM;wBAClC,OAAO,CAAC,CAAC;iBACZ;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,8GAA8G;IACvG,gEAAgE,CACrE,KAAa,EAAE,QAAgB,EAAE,SAAkB,KAAK,EAAE,MAA4B;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3D,IAAI,SAAS,EAAE;YACb,OAAO,yCAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SACxG;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AApHD,gCAoHC;AAED;;;;GAIG;AACH,MAAa,WAAY,SAAQ,eAAe;IAG9C,sDAAsD;IAC/C,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IAMD,uCAAuC;IACvC;QAAuB,KAAK,EAAE,CAAC;QAZ/B,wCAAwC;QACxB,wBAAmB,GAAG,aAAa,CAAC;QAWpB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IAAC,CAAC;IACtD,kDAAkD;IAClD,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,gCAAgC;IACzB,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgB;QACtC,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,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,mEAAmE;IAC5D,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,0CAA0C;IACnC,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC3B,IAAI,KAAK,YAAY,+BAAc,EAAE;gBACnC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;gBACjC,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC/B,IAAI,EAAE;oBACJ,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC3B;iBAAM,IAAI,KAAK,YAAY,eAAe,EAAE;gBAC3C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,YAAY;oBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aACrC;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oCAAoC;IAC7B,cAAc;QACnB,OAAO,IAAI,WAAW,EAAE,CAAC;IAC3B,CAAC;IACD,mBAAmB;IACZ,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK;YACP,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2BAA2B;IACpB,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;AAxED,kCAwEC;AAED;;;GAGG;AACH,MAAa,yCAAyC;IAAtD;QACE,8GAA8G;QACvG,8BAAyB,GAAY,IAAI,CAAC;QACjD,0CAA0C;QACnC,8BAAyB,GAAY,IAAI,CAAC;QACjD,gDAAgD;QACzC,4BAAuB,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAC9D,uDAAuD;QAChD,2BAAsB,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;IAC/D,CAAC;CAAA;AATD,8FASC","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 { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { CloneCurvesContext } from \"./internalContexts/CloneCurvesContext\";\r\nimport { CloneWithExpandedLineStrings } from \"./internalContexts/CloneWithExpandedLineStrings\";\r\nimport { CountLinearPartsSearchContext } from \"./internalContexts/CountLinearPartsSearchContext\";\r\nimport { GapSearchContext } from \"./internalContexts/GapSearchContext\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { SumLengthsContext } from \"./internalContexts/SumLengthsContext\";\r\nimport { TransformInPlaceContext } from \"./internalContexts/TransformInPlaceContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { ProxyCurve } from \"./ProxyCurve\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be\r\n * used in conditional statements for type-switching.\r\n *    - \"loop\" => [[Loop]]\r\n *    - \"path\" => [[Path]]\r\n *    - \"unionRegion\" => [[UnionRegion]]\r\n *    - \"parityRegion\" => [[ParityRegion]]\r\n *    - \"bagOfCurves\" => [[BagOfCurves]]\r\n * @public\r\n */\r\nexport type CurveCollectionType = \"loop\" | \"path\" | \"unionRegion\" | \"parityRegion\" | \"bagOfCurves\";\r\n\r\n/**\r\n * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:\r\n * - `CurveChain` is a (non-instantiable) intermediate class for a sequence of `CurvePrimitive` joining head-to-tail.\r\n * The two instantiable forms of `CurveChain` are\r\n *   - `Path` - A chain not required to close, and not enclosing a planar area\r\n *   - `Loop` - A chain required to close from last to first so that a planar area is enclosed.\r\n * - `ParityRegion` -- a collection of coplanar `Loop`s, with \"in/out\" classification by parity rules\r\n * - `UnionRegion` -- a collection of coplanar `Loop`s, with \"in/out\" classification by union rules\r\n * - `BagOfCurves` -- a collection of `AnyCurve` with no implied structure.\r\n *\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveCollection extends GeometryQuery {\r\n  /** String name for schema properties */\r\n  public readonly geometryCategory = \"curveCollection\";\r\n  /** Type discriminator. */\r\n  public abstract readonly curveCollectionType: CurveCollectionType;\r\n  /* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n  /** Flag for inner loop status. Only used by `Loop`. */\r\n  public isInner: boolean = false;\r\n  /** Return the sum of the lengths of all contained curves. */\r\n  public sumLengths(): number {\r\n    return SumLengthsContext.sumLengths(this);\r\n  }\r\n  /** Return the closest point on the contained curves */\r\n  public closestPoint(spacePoint: Point3d): CurveLocationDetail | undefined {\r\n    let detailA: CurveLocationDetail | undefined;\r\n    if (this.children !== undefined) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive) {\r\n          const detailB = child.closestPoint(spacePoint, false);\r\n          detailA = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        } else if (child instanceof CurveCollection) {\r\n          const detailB = child.closestPoint(spacePoint);\r\n          detailA = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        }\r\n      }\r\n    }\r\n    return detailA;\r\n  }\r\n  /**\r\n   * Return the max gap between adjacent primitives in Path and Loop collections.\r\n   * * In a Path, gaps are computed between consecutive primitives.\r\n   * * In a Loop, gaps are computed between consecutive primitives and between last and first.\r\n   * * gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections.  The type is\r\n   * \"unstructured\" so gaps should not be semantically meaningful.\r\n   */\r\n  public maxGap(): number {\r\n    return GapSearchContext.maxGap(this);\r\n  }\r\n  /** Return true if the curve collection has any primitives other than LineSegment3d and LineString3d  */\r\n  public checkForNonLinearPrimitives(): boolean {\r\n    return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\r\n  }\r\n  /** Apply transform recursively to children */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    return TransformInPlaceContext.tryTransformInPlace(this, transform);\r\n  }\r\n  /** Return a deep copy. */\r\n  public override clone(): CurveCollection {\r\n    return CloneCurvesContext.clone(this) as CurveCollection;\r\n  }\r\n  /** Create a deep copy of transformed curves. */\r\n  public override cloneTransformed(transform: Transform): CurveCollection | undefined {\r\n    return CloneCurvesContext.clone(this, transform);\r\n  }\r\n  /** Create a deep copy with all linestrings expanded to multiple LineSegment3d. */\r\n  public cloneWithExpandedLineStrings(): CurveCollection {\r\n    return CloneWithExpandedLineStrings.clone(this);\r\n  }\r\n  /** Recurse through children to collect CurvePrimitive's in flat array. */\r\n  private collectCurvePrimitivesGo(\r\n    results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false\r\n  ): void {\r\n    if (this.children) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n        else if (child instanceof CurveCollection)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return an array containing only the curve primitives.\r\n   * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\r\n   * clearing the array.)\r\n   * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself.  If true,\r\n   * it recurses to its (otherwise hidden) children.\r\n   */\r\n  public collectCurvePrimitives(\r\n    collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false\r\n  ): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\r\n    return results;\r\n  }\r\n  /**\r\n   * Return true for planar region types:\r\n   * * `Loop`\r\n   * * `ParityRegion`\r\n   * * `UnionRegion`\r\n   */\r\n  public get isAnyRegionType(): boolean {\r\n    return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 5 || this.dgnBoundaryType() === 4;\r\n  }\r\n  /** Return true for a `Path`, i.e. a chain of curves joined head-to-tail */\r\n  public get isOpenPath(): boolean {\r\n    return this.dgnBoundaryType() === 1;\r\n  }\r\n  /**\r\n   * Return true for a single-loop planar region type, i.e. `Loop`.\r\n   * * This is _not- a test for physical closure of a `Path`\r\n   */\r\n  public get isClosedPath(): boolean {\r\n    return this.dgnBoundaryType() === 2;\r\n  }\r\n  /** Return a CurveCollection with the same structure but all curves replaced by strokes. */\r\n  public abstract cloneStroked(options?: StrokeOptions): AnyCurve;\r\n  /** Support method for ICurvePrimitive ... one line call to specific announce method . . */\r\n  public abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;\r\n  /** Clone an empty collection. */\r\n  public abstract cloneEmptyPeer(): CurveCollection;\r\n  /**\r\n   * Return the boundary type of a corresponding  MicroStation CurveVector.\r\n   * * Derived class must implement.\r\n   */\r\n  public abstract dgnBoundaryType(): number;\r\n  /**\r\n   * Try to add a child.\r\n   * @param child child to add.\r\n   * @return true if child is an acceptable type for this collection.\r\n   */\r\n  public abstract tryAddChild(child: AnyCurve | undefined): boolean;\r\n  /** Return a child identified by by index */\r\n  public abstract getChild(i: number): AnyCurve | undefined;\r\n  /** Extend (increase) `rangeToExtend` as needed to include these curves (optionally transformed) */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    const children = this.children;\r\n    if (children) {\r\n      for (const c of children) {\r\n        c.extendRange(rangeToExtend, transform);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * * Find any curve primitive in the source.\r\n   * * Evaluate it at a fraction (which by default is an interior fraction)\r\n   * @param source containing `CurvePrimitive` or `CurveCollection`\r\n   * @param fraction fraction to use in `curve.fractionToPoint(fraction)`\r\n   */\r\n  public static createCurveLocationDetailOnAnyCurvePrimitive(\r\n    source: GeometryQuery | undefined, fraction: number = 0.5\r\n  ): CurveLocationDetail | undefined {\r\n    if (!source)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFraction(source, fraction);\r\n    } else if (source instanceof CurveCollection && source.children !== undefined)\r\n      for (const child of source.children) {\r\n        const detail = this.createCurveLocationDetailOnAnyCurvePrimitive(child, fraction);\r\n        if (detail)\r\n          return detail;\r\n      }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\r\n   * of projection.\r\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n   * @param lowHigh optional receiver for output\r\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n   * end of the ray.\r\n   */\r\n  public projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n  }\r\n}\r\n\r\n/**\r\n * Shared base class for use by both open and closed paths.\r\n * - A `CurveChain` contains only curvePrimitives.  No other paths, loops, or regions allowed.\r\n * - A single entry in the chain can in fact contain multiple curve primitives if the entry itself is (for instance)\r\n * `CurveChainWithDistanceIndex`\r\n *   which presents itself (through method interface) as a CurvePrimitive with well defined mappings from fraction\r\n * to xyz, but in fact does all the\r\n *   calculations over multiple primitives.\r\n * - The specific derived classes are `Path` and `Loop`\r\n * - `CurveChain` is an intermediate class.   It is not instantiable on its own.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveChain extends CurveCollection {\r\n  /** The curve primitives in the chain. */\r\n  protected _curves: CurvePrimitive[];\r\n  protected constructor() { super(); this._curves = []; }\r\n  /** Return the array of `CurvePrimitive` */\r\n  public override get children(): CurvePrimitive[] {\r\n    if (this._curves === undefined)\r\n      this._curves = [];\r\n    return this._curves;\r\n  }\r\n  /**\r\n   * Return the `[index]` curve primitive, optionally using `modulo` to map`index` to the cyclic indexing.\r\n   * * In particular, `-1` is the final curve.\r\n   * @param index cyclic index\r\n   */\r\n  public cyclicCurvePrimitive(index: number, cyclic: boolean = true): CurvePrimitive | undefined {\r\n    const n = this.children.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    /** Try simplest non-cyclic access first . . */\r\n    if (index >= 0 && index < n)\r\n      return this.children[index];\r\n    if (cyclic) {\r\n      const index2 = Geometry.modulo(index, n);\r\n      return this.children[index2];\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Stroke the chain into a simple xyz array.\r\n   * @param options tolerance parameters controlling the stroking.\r\n   */\r\n  public getPackedStrokes(options?: StrokeOptions): GrowableXYZArray | undefined {\r\n    const tree = this.cloneStroked(options);\r\n    if (tree instanceof CurveChain) {\r\n      const children = tree.children;\r\n      if (children.length === 1) {\r\n        const ls = children[0];\r\n        if (ls instanceof LineString3d)\r\n          return ls.packedPoints;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return a structural clone, with CurvePrimitive objects stroked. */\r\n  public abstract override cloneStroked(options?: StrokeOptions): AnyCurve;\r\n  /*  EDL 01/20 Path, Loop, CurveChainWithDistanceIndex all implement this.\r\n      Reducing it to abstract.\r\n      Hypothetically, a derived class in the wild might be depending on this.\r\n   {\r\n    const strokes = LineString3d.create();\r\n    for (const curve of this.children)\r\n      curve.emitStrokes(strokes, options);\r\n    return strokes;\r\n  }\r\n  */\r\n  /**\r\n   * Add a child curve.\r\n   * * Returns false if the given child is not a CurvePrimitive.\r\n   */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child && child instanceof CurvePrimitive) {\r\n      this._curves.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child by index */\r\n  public getChild(i: number): CurvePrimitive | undefined {\r\n    if (i < this._curves.length) return this._curves[i];\r\n    return undefined;\r\n  }\r\n  /** Invoke `curve.extendRange(range, transform)` for each child  */\r\n  public override extendRange(range: Range3d, transform?: Transform): void {\r\n    for (const curve of this._curves)\r\n      curve.extendRange(range, transform);\r\n  }\r\n  /**\r\n   * Reverse each child curve (in place)\r\n   * Reverse the order of the children in the CurveChain array.\r\n   */\r\n  public reverseChildrenInPlace() {\r\n    for (const curve of this._curves)\r\n      curve.reverseInPlace();\r\n    this._curves.reverse();\r\n  }\r\n  /**\r\n   * Return the index where target is found in the array of children\r\n   * @param alsoSearchProxies whether to also check proxy curves of the children\r\n  */\r\n  public childIndex(target: CurvePrimitive | undefined, alsoSearchProxies?: boolean): number | undefined {\r\n    for (let i = 0; i < this._curves.length; i++) {\r\n      if (this._curves[i] === target)\r\n        return i;\r\n    }\r\n    if (alsoSearchProxies ?? false) {\r\n      for (let i = 0; i < this._curves.length; i++) {\r\n        const childCurve = this._curves[i];\r\n        if (childCurve instanceof ProxyCurve) {\r\n          if (childCurve.proxyCurve === target)\r\n            return i;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Evaluate an indexed curve at a fraction.  Return as a CurveLocationDetail that indicates the primitive. */\r\n  public primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(\r\n    index: number, fraction: number, cyclic: boolean = false, result?: CurveLocationDetail\r\n  ): CurveLocationDetail | undefined {\r\n    const primitive = this.cyclicCurvePrimitive(index, cyclic);\r\n    if (primitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFractionPointAndDerivative(primitive, fraction, result);\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n\r\n/**\r\n * * A `BagOfCurves` object is a collection of `AnyCurve` objects.\r\n * * A `BagOfCurves` has no implied properties such as being planar.\r\n * @public\r\n */\r\nexport class BagOfCurves extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"bagOfCurves\";\r\n  /** Test if `other` is an instance of `BagOfCurves` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof BagOfCurves;\r\n  }\r\n  /**\r\n   * Array of children.\r\n   * * No restrictions on type.\r\n   */\r\n  protected _children: AnyCurve[];\r\n  /** Construct an empty `BagOfCurves` */\r\n  public constructor() { super(); this._children = []; }\r\n  /** Return the (reference to) array of children */\r\n  public override get children(): AnyCurve[] {\r\n    return this._children;\r\n  }\r\n  /** Create with given curves. */\r\n  public static create(...data: AnyCurve[]): BagOfCurves {\r\n    const result = new BagOfCurves();\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 (0) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 0;\r\n  }\r\n  /** Invoke `processor.announceBagOfCurves(this, indexInParent);` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceBagOfCurves(this, indexInParent);\r\n  }\r\n  /** Clone all children in stroked form. */\r\n  public cloneStroked(options?: StrokeOptions): BagOfCurves {\r\n    const clone = new BagOfCurves();\r\n    let child;\r\n    for (child of this.children) {\r\n      if (child instanceof CurvePrimitive) {\r\n        const ls = LineString3d.create();\r\n        child.emitStrokes(ls, options);\r\n        if (ls)\r\n          clone.children.push(ls);\r\n      } else if (child instanceof CurveCollection) {\r\n        const childStrokes = child.cloneStroked(options);\r\n        if (childStrokes)\r\n          clone.children.push(childStrokes);\r\n      }\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return an empty `BagOfCurves` */\r\n  public cloneEmptyPeer(): BagOfCurves {\r\n    return new BagOfCurves();\r\n  }\r\n  /** Add a child  */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child)\r\n      this._children.push(child);\r\n    return true;\r\n  }\r\n  /** Get a child by index */\r\n  public getChild(i: number): AnyCurve | 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.handleBagOfCurves(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleBagOfCurves(this);\r\n  }\r\n}\r\n\r\n/**\r\n * * Options to control method `RegionOps.consolidateAdjacentPrimitives`\r\n * @public\r\n */\r\nexport class ConsolidateAdjacentCurvePrimitivesOptions {\r\n  /** True to consolidated linear geometry   (e.g. separate LineSegment3d and LineString3d) into LineString3d */\r\n  public consolidateLinearGeometry: boolean = true;\r\n  /** True to consolidate contiguous arcs */\r\n  public consolidateCompatibleArcs: boolean = true;\r\n  /** Tolerance for collapsing identical points */\r\n  public duplicatePointTolerance = Geometry.smallMetricDistance;\r\n  /** Tolerance for removing interior colinear points. */\r\n  public colinearPointTolerance = Geometry.smallMetricDistance;\r\n}\r\n"]}
+{"version":3,"file":"CurveCollection.js","sourceRoot":"","sources":["../../../src/curve/CurveCollection.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH,0CAAuC;AAQvC,+DAA4D;AAC5D,qDAAkD;AAElD,mDAAgD;AAChD,8EAA2E;AAC3E,kGAA+F;AAC/F,oGAAiG;AACjG,0EAAuE;AACvE,4FAAyF;AACzF,4EAAyE;AACzE,wFAAqF;AACrF,iDAA8C;AAC9C,6CAA0C;AAe1C;;;;;;;;;;;;;;GAcG;AACH,MAAsB,eAAgB,SAAQ,6BAAa;IAA3D;;QACE,wCAAwC;QACxB,qBAAgB,GAAG,iBAAiB,CAAC;QAGrD,mEAAmE;QACnE,uDAAuD;QAChD,YAAO,GAAY,KAAK,CAAC;IAwKlC,CAAC;IAvKC,6DAA6D;IACtD,UAAU;QACf,OAAO,qCAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;IACD,uDAAuD;IAChD,YAAY,CAAC,UAAmB;QACrC,IAAI,OAAwC,CAAC;QAC7C,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,IAAI,KAAK,YAAY,+BAAc,EAAE;oBACnC,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;oBACtD,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;iBAChE;qBAAM,IAAI,KAAK,YAAY,eAAe,EAAE;oBAC3C,MAAM,OAAO,GAAG,KAAK,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;oBAC/C,OAAO,GAAG,yCAAmB,CAAC,cAAc,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;iBAChE;aACF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;;OAMG;IACI,MAAM;QACX,OAAO,mCAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACD,wGAAwG;IACjG,2BAA2B;QAChC,OAAO,6DAA6B,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD,8CAA8C;IACvC,mBAAmB,CAAC,SAAoB;QAC7C,OAAO,iDAAuB,CAAC,mBAAmB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACtE,CAAC;IACD,0BAA0B;IACV,KAAK;QACnB,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,CAAoB,CAAC;IAC3D,CAAC;IACD,gDAAgD;IAChC,gBAAgB,CAAC,SAAoB;QACnD,OAAO,uCAAkB,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACnD,CAAC;IACD,uFAAuF;IAChF,4BAA4B;QACjC,OAAO,2DAA4B,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD;;;;OAIG;IACK,wBAAwB,CAC9B,OAAyB,EAAE,0BAAmC,EAAE,qBAA8B,KAAK;QAEnG,IAAI,IAAI,CAAC,QAAQ,EAAE;YACjB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACjC,IAAI,KAAK,YAAY,+BAAc;oBACjC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;qBACrF,IAAI,KAAK,YAAY,eAAe;oBACvC,KAAK,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;aAC3F;SACF;IACH,CAAC;IACD;;;;;;;;OAQG;IACI,sBAAsB,CAC3B,cAAiC,EAAE,6BAAsC,KAAK,EAAE,qBAA8B,KAAK;QAEnH,MAAM,OAAO,GAAqB,cAAc,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC;QACrF,IAAI,CAAC,wBAAwB,CAAC,OAAO,EAAE,0BAA0B,EAAE,kBAAkB,CAAC,CAAC;QACvF,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;;OAKG;IACH,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtG,CAAC;IACD,2EAA2E;IAC3E,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IACD;;;OAGG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;IACtC,CAAC;IAoBD;;;;OAIG;IACI,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,QAAQ,EAAE;YACZ,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE;gBACxB,CAAC,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;aACzC;SACF;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,4CAA4C,CACxD,MAAiC,EAAE,WAAmB,GAAG;QAEzD,IAAI,CAAC,MAAM;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,MAAM,YAAY,+BAAc,EAAE;YACpC,OAAO,yCAAmB,CAAC,4BAA4B,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;SAC3E;aAAM,IAAI,MAAM,YAAY,eAAe,IAAI,MAAM,CAAC,QAAQ,KAAK,SAAS;YAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACnC,MAAM,MAAM,GAAG,IAAI,CAAC,4CAA4C,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClF,IAAI,MAAM;oBACR,OAAO,MAAM,CAAC;aACjB;QACH,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,uBAAuB,CAAC,GAAqB,EAAE,OAAiB;QACrE,OAAO,qDAAyB,CAAC,kCAAkC,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC1F,CAAC;CACF;AA/KD,0CA+KC;AAED;;;;;;;;;GASG;AACH,MAAsB,UAAW,SAAQ,eAAe;IAGtD,kBAAkB;IAClB;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,CAAC;IACD,2CAA2C;IAC3C,IAAoB,QAAQ;QAC1B,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;YAC5B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,oBAAoB,CAAC,KAAa,EAAE,SAAkB,IAAI;QAC/D,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC;YACT,OAAO,SAAS,CAAC;QACnB,IAAI,KAAK,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,uCAAuC;YAClE,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,MAAM,EAAE;YACV,MAAM,MAAM,GAAG,mBAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;SAC9B;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,OAAuB;QAC7C;;;;WAIG;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,IAAI,YAAY,UAAU,EAAE;YAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;gBACzB,MAAM,EAAE,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,YAAY,2BAAY;oBAC5B,OAAO,EAAE,CAAC,YAAY,CAAC;aAC1B;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;OAGG;IACI,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK,IAAI,KAAK,YAAY,+BAAc,EAAE;YAC5C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8BAA8B;IACvB,QAAQ,CAAC,CAAS;QACvB,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACpD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,mEAAmE;IACnD,WAAW,CAAC,KAAc,EAAE,SAAqB;QAC/D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IACD;;;OAGG;IACI,sBAAsB;QAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO;YAC9B,KAAK,CAAC,cAAc,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;IACzB,CAAC;IACD;;;MAGE;IACK,UAAU,CAAC,MAAkC,EAAE,iBAA2B;QAC/E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,MAAM;gBAC5B,OAAO,CAAC,CAAC;SACZ;QACD,IAAI,iBAAiB,IAAI,KAAK,EAAE;YAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,UAAU,YAAY,uBAAU,EAAE;oBACpC,IAAI,UAAU,CAAC,UAAU,KAAK,MAAM;wBAClC,OAAO,CAAC,CAAC;iBACZ;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,6GAA6G;IACtG,gEAAgE,CACrE,KAAa,EAAE,QAAgB,EAAE,SAAkB,KAAK,EAAE,MAA4B;QAEtF,MAAM,SAAS,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3D,IAAI,SAAS,EAAE;YACb,OAAO,yCAAmB,CAAC,8CAA8C,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SACxG;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AAlHD,gCAkHC;AAED;;;;GAIG;AACH,MAAa,WAAY,SAAQ,eAAe;IAG9C,sDAAsD;IAC/C,mBAAmB,CAAC,KAAoB;QAC7C,OAAO,KAAK,YAAY,WAAW,CAAC;IACtC,CAAC;IAMD,uCAAuC;IACvC;QACE,KAAK,EAAE,CAAC;QAbV,wCAAwC;QACxB,wBAAmB,GAAG,aAAa,CAAC;QAalD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD,kDAAkD;IAClD,IAAoB,QAAQ;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,gCAAgC;IACzB,MAAM,CAAC,MAAM,CAAC,GAAG,IAAgB;QACtC,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,gFAAgF;IACzE,eAAe;QACpB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,mEAAmE;IAC5D,wBAAwB,CAAC,SAAkC,EAAE,gBAAwB,CAAC,CAAC;QAC5F,OAAO,SAAS,CAAC,mBAAmB,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC5D,CAAC;IACD,0CAA0C;IACnC,YAAY,CAAC,OAAuB;QACzC,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC;QACV,KAAK,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC3B,IAAI,KAAK,YAAY,+BAAc,EAAE;gBACnC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;gBACjC,KAAK,CAAC,WAAW,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAC/B,IAAI,EAAE;oBACJ,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC3B;iBAAM,IAAI,KAAK,YAAY,eAAe,EAAE;gBAC3C,MAAM,YAAY,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBACjD,IAAI,YAAY;oBACd,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;aACrC;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oCAAoC;IAC7B,cAAc;QACnB,OAAO,IAAI,WAAW,EAAE,CAAC;IAC3B,CAAC;IACD,mBAAmB;IACZ,WAAW,CAAC,KAA2B;QAC5C,IAAI,KAAK;YACP,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2BAA2B;IACpB,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;AA3ED,kCA2EC;AAED;;;GAGG;AACH,MAAa,yCAAyC;IAAtD;QACE,8GAA8G;QACvG,8BAAyB,GAAY,IAAI,CAAC;QACjD,0CAA0C;QACnC,8BAAyB,GAAY,IAAI,CAAC;QACjD,gDAAgD;QACzC,4BAAuB,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;QAC9D,uDAAuD;QAChD,2BAAsB,GAAG,mBAAQ,CAAC,mBAAmB,CAAC;IAC/D,CAAC;CAAA;AATD,8FASC","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 { Geometry } from \"../Geometry\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range1d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { AnyCurve } from \"./CurveChain\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { RecursiveCurveProcessor } from \"./CurveProcessor\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { CloneCurvesContext } from \"./internalContexts/CloneCurvesContext\";\r\nimport { CloneWithExpandedLineStrings } from \"./internalContexts/CloneWithExpandedLineStrings\";\r\nimport { CountLinearPartsSearchContext } from \"./internalContexts/CountLinearPartsSearchContext\";\r\nimport { GapSearchContext } from \"./internalContexts/GapSearchContext\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { SumLengthsContext } from \"./internalContexts/SumLengthsContext\";\r\nimport { TransformInPlaceContext } from \"./internalContexts/TransformInPlaceContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { ProxyCurve } from \"./ProxyCurve\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n/**\r\n * Describes the concrete type of a [[CurveCollection]]. Each type name maps to a specific subclass and can be\r\n * used in conditional statements for type-switching.\r\n *    - \"loop\" => [[Loop]]\r\n *    - \"path\" => [[Path]]\r\n *    - \"unionRegion\" => [[UnionRegion]]\r\n *    - \"parityRegion\" => [[ParityRegion]]\r\n *    - \"bagOfCurves\" => [[BagOfCurves]]\r\n * @public\r\n */\r\nexport type CurveCollectionType = \"loop\" | \"path\" | \"unionRegion\" | \"parityRegion\" | \"bagOfCurves\";\r\n\r\n/**\r\n * A `CurveCollection` is an abstract (non-instantiable) class for various sets of curves with particular structures:\r\n * - `CurveChain` is a (non-instantiable) intermediate class for a sequence of `CurvePrimitive` joining head-to-tail.\r\n * The two instantiable forms of `CurveChain` are\r\n *   - `Path` - A chain not required to close and not enclosing a planar area (so curves do not have to be on the\r\n * same plane).\r\n *   - `Loop` - A chain required to close from last to first so that a planar area is enclosed (so curves have to\r\n * be on the same plane).\r\n * - `ParityRegion` -- a collection of coplanar `Loop`, with \"in/out\" classification by parity rules.\r\n * - `UnionRegion` -- a collection of coplanar `Loop` and/or `ParityRegion`, with \"in/out\" classification by union rules.\r\n * - `BagOfCurves` -- a collection of `AnyCurve` with no implied structure.\r\n *\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveCollection extends GeometryQuery {\r\n  /** String name for schema properties */\r\n  public readonly geometryCategory = \"curveCollection\";\r\n  /** Type discriminator. */\r\n  public abstract readonly curveCollectionType: CurveCollectionType;\r\n  /* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n  /** Flag for inner loop status. Only used by `Loop`. */\r\n  public isInner: boolean = false;\r\n  /** Return the sum of the lengths of all contained curves. */\r\n  public sumLengths(): number {\r\n    return SumLengthsContext.sumLengths(this);\r\n  }\r\n  /** Return the closest point on the contained curves */\r\n  public closestPoint(spacePoint: Point3d): CurveLocationDetail | undefined {\r\n    let detailA: CurveLocationDetail | undefined;\r\n    if (this.children !== undefined) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive) {\r\n          const detailB = child.closestPoint(spacePoint, false);\r\n          detailA = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        } else if (child instanceof CurveCollection) {\r\n          const detailB = child.closestPoint(spacePoint);\r\n          detailA = CurveLocationDetail.chooseSmallerA(detailA, detailB);\r\n        }\r\n      }\r\n    }\r\n    return detailA;\r\n  }\r\n  /**\r\n   * Return the max gap between adjacent primitives in Path and Loop collections.\r\n   * * In a Path, gaps are computed between consecutive primitives.\r\n   * * In a Loop, gaps are computed between consecutive primitives and between last and first.\r\n   * * Gaps are NOT computed between consecutive CurvePrimitives in \"unstructured\" collections. The type is\r\n   * \"unstructured\" so gaps should not be semantically meaningful.\r\n   */\r\n  public maxGap(): number {\r\n    return GapSearchContext.maxGap(this);\r\n  }\r\n  /** Return true if the curve collection has any primitives other than LineSegment3d and LineString3d  */\r\n  public checkForNonLinearPrimitives(): boolean {\r\n    return CountLinearPartsSearchContext.hasNonLinearPrimitives(this);\r\n  }\r\n  /** Apply transform recursively to children */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    return TransformInPlaceContext.tryTransformInPlace(this, transform);\r\n  }\r\n  /** Return a deep copy. */\r\n  public override clone(): CurveCollection {\r\n    return CloneCurvesContext.clone(this) as CurveCollection;\r\n  }\r\n  /** Create a deep copy of transformed curves. */\r\n  public override cloneTransformed(transform: Transform): CurveCollection | undefined {\r\n    return CloneCurvesContext.clone(this, transform);\r\n  }\r\n  /** Create a deep copy with all linestrings broken down into multiple LineSegment3d. */\r\n  public cloneWithExpandedLineStrings(): CurveCollection {\r\n    return CloneWithExpandedLineStrings.clone(this);\r\n  }\r\n  /**\r\n   * Push all CurvePrimitives contained in the instance onto the `results` array.\r\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives\r\n   * of the Loop are pushed onto `results`.\r\n   */\r\n  private collectCurvePrimitivesGo(\r\n    results: CurvePrimitive[], smallestPossiblePrimitives: boolean, explodeLinestrings: boolean = false,\r\n  ): void {\r\n    if (this.children) {\r\n      for (const child of this.children) {\r\n        if (child instanceof CurvePrimitive)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n        else if (child instanceof CurveCollection)\r\n          child.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLinestrings);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Return an array containing all CurvePrimitives in the instance.\r\n   * * This method is recursive. For example, if the CurveCollection contains a Loop, all CurvePrimitives of\r\n   * the Loop are pushed onto the returned array.\r\n   * @param collectorArray optional array to receive primitives. If present, new primitives are ADDED (without\r\n   * clearing the array).\r\n   * @param smallestPossiblePrimitives if false, CurvePrimitiveWithDistanceIndex returns only itself. If true,\r\n   * it recurses to its (otherwise hidden) children.\r\n   */\r\n  public collectCurvePrimitives(\r\n    collectorArray?: CurvePrimitive[], smallestPossiblePrimitives: boolean = false, explodeLineStrings: boolean = false,\r\n  ): CurvePrimitive[] {\r\n    const results: CurvePrimitive[] = collectorArray === undefined ? [] : collectorArray;\r\n    this.collectCurvePrimitivesGo(results, smallestPossiblePrimitives, explodeLineStrings);\r\n    return results;\r\n  }\r\n  /**\r\n   * Return true for planar region types:\r\n   * * `Loop`\r\n   * * `ParityRegion`\r\n   * * `UnionRegion`\r\n   */\r\n  public get isAnyRegionType(): boolean {\r\n    return this.dgnBoundaryType() === 2 || this.dgnBoundaryType() === 4 || this.dgnBoundaryType() === 5;\r\n  }\r\n  /** Return true for a `Path`, i.e. a chain of curves joined head-to-tail */\r\n  public get isOpenPath(): boolean {\r\n    return this.dgnBoundaryType() === 1;\r\n  }\r\n  /**\r\n   * Return true for a single-loop planar region type, i.e. `Loop`.\r\n   * * This is NOT a test for physical closure of a `Path`.\r\n   */\r\n  public get isClosedPath(): boolean {\r\n    return this.dgnBoundaryType() === 2;\r\n  }\r\n  /** Return a CurveCollection with the same structure but all curves replaced by strokes. */\r\n  public abstract cloneStroked(options?: StrokeOptions): AnyCurve;\r\n  /** Support method for ICurvePrimitive ... one line call to specific announce method . . */\r\n  public abstract announceToCurveProcessor(processor: RecursiveCurveProcessor): void;\r\n  /** Clone an empty collection. */\r\n  public abstract cloneEmptyPeer(): CurveCollection;\r\n  /**\r\n   * Return the boundary type of a corresponding MicroStation CurveVector.\r\n   * * Derived class must implement.\r\n   */\r\n  public abstract dgnBoundaryType(): number;\r\n  /**\r\n   * Try to add a child.\r\n   * @param child child to add.\r\n   * @return true if child is an acceptable type for this collection.\r\n   */\r\n  public abstract tryAddChild(child: AnyCurve | undefined): boolean;\r\n  /** Return a child identified by by index */\r\n  public abstract getChild(i: number): AnyCurve | undefined;\r\n  /**\r\n   * Extend (increase) the given range as needed to encompass all curves in the curve collection.\r\n   * @param rangeToExtend the given range.\r\n   * @param transform if supplied, the range is extended with transformed curves.\r\n   */\r\n  public extendRange(rangeToExtend: Range3d, transform?: Transform): void {\r\n    const children = this.children;\r\n    if (children) {\r\n      for (const c of children) {\r\n        c.extendRange(rangeToExtend, transform);\r\n      }\r\n    }\r\n  }\r\n  /**\r\n   * Find any CurvePrimitive in the source and evaluate it at the given fraction.\r\n   * * The first CurvePrimitive found is evaluated. Any other CurvePrimitives are ignored.\r\n   * @param source containing `CurvePrimitive` or `CurveCollection`\r\n   * @param fraction fraction to use in `curve.fractionToPoint(fraction)`\r\n   */\r\n  public static createCurveLocationDetailOnAnyCurvePrimitive(\r\n    source: GeometryQuery | undefined, fraction: number = 0.5,\r\n  ): CurveLocationDetail | undefined {\r\n    if (!source)\r\n      return undefined;\r\n    if (source instanceof CurvePrimitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFraction(source, fraction);\r\n    } else if (source instanceof CurveCollection && source.children !== undefined)\r\n      for (const child of source.children) {\r\n        const detail = this.createCurveLocationDetailOnAnyCurvePrimitive(child, fraction);\r\n        if (detail)\r\n          return detail;\r\n      }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Project instance geometry (via dispatch) onto the given ray, and return the extreme fractional parameters\r\n   * of projection.\r\n   * @param ray ray onto which the instance is projected. A `Vector3d` is treated as a `Ray3d` with zero origin.\r\n   * @param lowHigh optional receiver for output\r\n   * @returns range of fractional projection parameters onto the ray, where 0.0 is start of the ray and 1.0 is the\r\n   * end of the ray.\r\n   */\r\n  public projectedParameterRange(ray: Vector3d | Ray3d, lowHigh?: Range1d): Range1d | undefined {\r\n    return PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);\r\n  }\r\n}\r\n\r\n/**\r\n * Shared base class for use by both open and closed paths.\r\n * * A `CurveChain` contains only CurvePrimitives. No other paths, loops, or regions allowed.\r\n * * The specific derived classes are `Path` and `Loop`\r\n * * `CurveChain` is an intermediate class. It is not instantiable on its own.\r\n * * The related class `CurveChainWithDistanceIndex` is a `CurvePrimitive` whose API presents well-defined mappings\r\n * from fraction to xyz over the entire chain, but in fact does all the calculations over multiple primitives.\r\n * @see [Curve Collections]($docs/learning/geometry/CurveCollection.md) learning article.\r\n * @public\r\n */\r\nexport abstract class CurveChain extends CurveCollection {\r\n  /** The curve primitives in the chain. */\r\n  protected _curves: CurvePrimitive[];\r\n  /** Constructor */\r\n  protected constructor() {\r\n    super();\r\n    this._curves = [];\r\n  }\r\n  /** Return the array of `CurvePrimitive` */\r\n  public override get children(): CurvePrimitive[] {\r\n    if (this._curves === undefined)\r\n      this._curves = [];\r\n    return this._curves;\r\n  }\r\n  /**\r\n   * Return the curve primitive at the given `index`, optionally using `modulo` to map `index` to the cyclic indexing.\r\n   * * In particular, `-1` is the final curve.\r\n   * @param index cyclic index\r\n   */\r\n  public cyclicCurvePrimitive(index: number, cyclic: boolean = true): CurvePrimitive | undefined {\r\n    const n = this.children.length;\r\n    if (n === 0)\r\n      return undefined;\r\n    if (index >= 0 && index < n) // try simplest non-cyclic access first\r\n      return this.children[index];\r\n    if (cyclic) {\r\n      const index2 = Geometry.modulo(index, n);\r\n      return this.children[index2];\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Stroke the chain into a simple xyz array.\r\n   * @param options tolerance parameters controlling the stroking.\r\n   */\r\n  public getPackedStrokes(options?: StrokeOptions): GrowableXYZArray | undefined {\r\n    /**\r\n     * The object returned by \"cloneStroked\" has the same type (Loop or Path) but instead of a chain of\r\n     * CurvePrimitives as children, it has a single LineString3d child. \"getPackedStrokes\" just returns\r\n     * the points of that LineString3d using \"packedPoints\".\r\n     */\r\n    const tree = this.cloneStroked(options);\r\n    if (tree instanceof CurveChain) {\r\n      const children = tree.children;\r\n      if (children.length === 1) {\r\n        const ls = children[0];\r\n        if (ls instanceof LineString3d)\r\n          return ls.packedPoints;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return a structural clone, with CurvePrimitive objects stroked. */\r\n  public abstract override cloneStroked(options?: StrokeOptions): AnyCurve;\r\n  /**\r\n   * Add a child curve.\r\n   * * Returns false if the given child is not a CurvePrimitive.\r\n   */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child && child instanceof CurvePrimitive) {\r\n      this._curves.push(child);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Return a child by index */\r\n  public getChild(i: number): CurvePrimitive | undefined {\r\n    if (i < this._curves.length) return this._curves[i];\r\n    return undefined;\r\n  }\r\n  /** Invoke `curve.extendRange(range, transform)` for each child  */\r\n  public override extendRange(range: Range3d, transform?: Transform): void {\r\n    for (const curve of this._curves)\r\n      curve.extendRange(range, transform);\r\n  }\r\n  /**\r\n   * Reverse each child curve (in place)\r\n   * Reverse the order of the children in the CurveChain array.\r\n   */\r\n  public reverseChildrenInPlace(): void {\r\n    for (const curve of this._curves)\r\n      curve.reverseInPlace();\r\n    this._curves.reverse();\r\n  }\r\n  /**\r\n   * Return the index where target is found in the array of children.\r\n   * @param alsoSearchProxies whether to also check proxy curves of the children\r\n  */\r\n  public childIndex(target: CurvePrimitive | undefined, alsoSearchProxies?: boolean): number | undefined {\r\n    for (let i = 0; i < this._curves.length; i++) {\r\n      if (this._curves[i] === target)\r\n        return i;\r\n    }\r\n    if (alsoSearchProxies ?? false) {\r\n      for (let i = 0; i < this._curves.length; i++) {\r\n        const childCurve = this._curves[i];\r\n        if (childCurve instanceof ProxyCurve) {\r\n          if (childCurve.proxyCurve === target)\r\n            return i;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Evaluate an indexed curve at a fraction. Return as a CurveLocationDetail that indicates the primitive. */\r\n  public primitiveIndexAndFractionToCurveLocationDetailPointAndDerivative(\r\n    index: number, fraction: number, cyclic: boolean = false, result?: CurveLocationDetail,\r\n  ): CurveLocationDetail | undefined {\r\n    const primitive = this.cyclicCurvePrimitive(index, cyclic);\r\n    if (primitive) {\r\n      return CurveLocationDetail.createCurveEvaluatedFractionPointAndDerivative(primitive, fraction, result);\r\n    }\r\n    return undefined;\r\n  }\r\n}\r\n\r\n/**\r\n * * A `BagOfCurves` object is a collection of `AnyCurve` objects.\r\n * * A `BagOfCurves` has no implied properties such as being planar.\r\n * @public\r\n */\r\nexport class BagOfCurves extends CurveCollection {\r\n  /** String name for schema properties */\r\n  public readonly curveCollectionType = \"bagOfCurves\";\r\n  /** Test if `other` is an instance of `BagOfCurves` */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean {\r\n    return other instanceof BagOfCurves;\r\n  }\r\n  /**\r\n   * Array of children.\r\n   * * No restrictions on type.\r\n   */\r\n  protected _children: AnyCurve[];\r\n  /** Construct an empty `BagOfCurves` */\r\n  public constructor() {\r\n    super();\r\n    this._children = [];\r\n  }\r\n  /** Return the (reference to) array of children */\r\n  public override get children(): AnyCurve[] {\r\n    return this._children;\r\n  }\r\n  /** Create with given curves. */\r\n  public static create(...data: AnyCurve[]): BagOfCurves {\r\n    const result = new BagOfCurves();\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 (0) of a corresponding  MicroStation CurveVector */\r\n  public dgnBoundaryType(): number {\r\n    return 0;\r\n  }\r\n  /** Invoke `processor.announceBagOfCurves(this, indexInParent);` */\r\n  public announceToCurveProcessor(processor: RecursiveCurveProcessor, indexInParent: number = -1): void {\r\n    return processor.announceBagOfCurves(this, indexInParent);\r\n  }\r\n  /** Clone all children in stroked form. */\r\n  public cloneStroked(options?: StrokeOptions): BagOfCurves {\r\n    const clone = new BagOfCurves();\r\n    let child;\r\n    for (child of this.children) {\r\n      if (child instanceof CurvePrimitive) {\r\n        const ls = LineString3d.create();\r\n        child.emitStrokes(ls, options);\r\n        if (ls)\r\n          clone.children.push(ls);\r\n      } else if (child instanceof CurveCollection) {\r\n        const childStrokes = child.cloneStroked(options);\r\n        if (childStrokes)\r\n          clone.children.push(childStrokes);\r\n      }\r\n    }\r\n    return clone;\r\n  }\r\n  /** Return an empty `BagOfCurves` */\r\n  public cloneEmptyPeer(): BagOfCurves {\r\n    return new BagOfCurves();\r\n  }\r\n  /** Add a child  */\r\n  public tryAddChild(child: AnyCurve | undefined): boolean {\r\n    if (child)\r\n      this._children.push(child);\r\n    return true;\r\n  }\r\n  /** Get a child by index */\r\n  public getChild(i: number): AnyCurve | 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.handleBagOfCurves(this)` */\r\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\r\n    return handler.handleBagOfCurves(this);\r\n  }\r\n}\r\n\r\n/**\r\n * * Options to control method `RegionOps.consolidateAdjacentPrimitives`\r\n * @public\r\n */\r\nexport class ConsolidateAdjacentCurvePrimitivesOptions {\r\n  /** True to consolidated linear geometry   (e.g. separate LineSegment3d and LineString3d) into LineString3d */\r\n  public consolidateLinearGeometry: boolean = true;\r\n  /** True to consolidate contiguous arcs */\r\n  public consolidateCompatibleArcs: boolean = true;\r\n  /** Tolerance for collapsing identical points */\r\n  public duplicatePointTolerance = Geometry.smallMetricDistance;\r\n  /** Tolerance for removing interior colinear points. */\r\n  public colinearPointTolerance = Geometry.smallMetricDistance;\r\n}\r\n"]}

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

@@ -13,6 +13,7 @@ import { GeometryQuery } from "./GeometryQuery";
 export declare class CurveCurve {
     /**
      * Return xy intersections of 2 curves.
+     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
      * @param geometryA first geometry
      * @param extendA true to allow geometryA to extend
      * @param geometryB second geometry
@@ -21,7 +22,8 @@ export declare class CurveCurve {
      */
     static intersectionXYPairs(geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean, tolerance?: number): CurveLocationDetailPair[];
     /**
-     * Return xy intersections of 2 projected curves
+     * Return xy intersections of 2 projected curves.
+     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
      * @param geometryA first geometry
      * @param extendA true to allow geometryA to extend
      * @param geometryB second geometry
@@ -33,6 +35,7 @@ export declare class CurveCurve {
      * Return full 3d xyz intersections of 2 curves.
      *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.
      *  * Not Implemented for bspline and bezier curves.
+     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
      * @beta
      * @param geometryA first geometry
      * @param extendA true to allow geometryA to extend
@@ -47,7 +50,8 @@ export declare class CurveCurve {
      */
     static allIntersectionsAmongPrimitivesXY(primitives: CurvePrimitive[], tolerance?: number): CurveLocationDetailPair[];
     /**
-     * Return xy close approaches of 2 projected curves
+     * Return xy close approaches of 2 projected curves.
+     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
      * @param geometryA first geometry
      * @param geometryB second geometry
      */

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

@@ -1 +1 @@
-{"version":3,"file":"CurveCurve.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAGlD,OAAO,EAAyB,4BAA4B,EAAE,MAAM,yBAAyB,CAAC;AAE9F,OAAO,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;GAGG;AACH,qBAAa,UAAU;IACrB;;;;;;;OAOG;WACW,mBAAmB,CAAC,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,uBAAuB,EAAE;IAatM;;;;;;;OAOG;WACW,4BAA4B,CAAC,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,uBAAuB,EAAE;IAKvO;;;;;;;;;OASG;WACW,eAAe,CAAC,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,GAAG,4BAA4B;IAKnJ;;;;OAIG;WACW,iCAAiC,CAAC,UAAU,EAAE,cAAc,EAAE,EAAE,SAAS,GAAE,MAAqC,GAAG,uBAAuB,EAAE;IAW1J;;;;OAIG;WACW,6BAA6B,CACzC,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,GAAG,uBAAuB,EAAE;CAOtG"}
+{"version":3,"file":"CurveCurve.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAGlD,OAAO,EAAyB,4BAA4B,EAAE,MAAM,yBAAyB,CAAC;AAE9F,OAAO,EAAE,uBAAuB,EAAE,MAAM,uBAAuB,CAAC;AAChE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;GAGG;AACH,qBAAa,UAAU;IACrB;;;;;;;;OAQG;WACW,mBAAmB,CAC/B,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EACtF,SAAS,GAAE,MAAqC,GAC/C,uBAAuB,EAAE;IAa5B;;;;;;;;OAQG;WACW,4BAA4B,CACxC,YAAY,EAAE,QAAQ,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAC9G,SAAS,GAAE,MAAqC,GAC/C,uBAAuB,EAAE;IAK5B;;;;;;;;;;OAUG;WACW,eAAe,CAC3B,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,OAAO,EAAE,OAAO,GACrF,4BAA4B;IAK/B;;;;OAIG;WACW,iCAAiC,CAC7C,UAAU,EAAE,cAAc,EAAE,EAAE,SAAS,GAAE,MAAqC,GAC7E,uBAAuB,EAAE;IAW5B;;;;;OAKG;WACW,6BAA6B,CACzC,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,GACtE,uBAAuB,EAAE;CAM7B"}

package/lib/cjs/curve/CurveCurve.js

@@ -21,6 +21,7 @@ const CurvePrimitive_1 = require("./CurvePrimitive");
 class CurveCurve {
     /**
      * Return xy intersections of 2 curves.
+     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
      * @param geometryA first geometry
      * @param extendA true to allow geometryA to extend
      * @param geometryB second geometry
@@ -28,21 +29,22 @@ class CurveCurve {
      * @param tolerance optional distance tolerance for coincidence
      */
     static intersectionXYPairs(geometryA, extendA, geometryB, extendB, tolerance = Geometry_1.Geometry.smallMetricDistance) {
-        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(undefined, geometryA, extendA, geometryB, extendB, tolerance);
+        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(undefined, extendA, geometryB, extendB, tolerance);
         if (geometryB instanceof CurvePrimitive_1.CurvePrimitive) {
             geometryA.dispatchToGeometryHandler(handler);
         }
         else if (geometryB instanceof CurveCollection_1.CurveCollection) {
             const allCurves = geometryB.collectCurvePrimitives();
             for (const child of allCurves) {
-                handler.resetGeometry(geometryA, false, child, false);
+                handler.resetGeometry(false, child, false);
                 geometryA.dispatchToGeometryHandler(handler);
             }
         }
         return handler.grabPairedResults();
     }
     /**
-     * Return xy intersections of 2 projected curves
+     * Return xy intersections of 2 projected curves.
+     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
      * @param geometryA first geometry
      * @param extendA true to allow geometryA to extend
      * @param geometryB second geometry
@@ -50,7 +52,7 @@ class CurveCurve {
      * @param tolerance optional distance tolerance for coincidence
      */
     static intersectionProjectedXYPairs(worldToLocal, geometryA, extendA, geometryB, extendB, tolerance = Geometry_1.Geometry.smallMetricDistance) {
-        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(worldToLocal, geometryA, extendA, geometryB, extendB, tolerance);
+        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(worldToLocal, extendA, geometryB, extendB, tolerance);
         geometryA.dispatchToGeometryHandler(handler);
         return handler.grabPairedResults();
     }
@@ -58,6 +60,7 @@ class CurveCurve {
      * Return full 3d xyz intersections of 2 curves.
      *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.
      *  * Not Implemented for bspline and bezier curves.
+     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
      * @beta
      * @param geometryA first geometry
      * @param extendA true to allow geometryA to extend
@@ -65,7 +68,7 @@ class CurveCurve {
      * @param extendB true to allow geometryB to extend
      */
     static intersectionXYZ(geometryA, extendA, geometryB, extendB) {
-        const handler = new CurveCurveIntersectXYZ_1.CurveCurveIntersectXYZ(geometryA, extendA, geometryB, extendB);
+        const handler = new CurveCurveIntersectXYZ_1.CurveCurveIntersectXYZ(extendA, geometryB, extendB);
         geometryA.dispatchToGeometryHandler(handler);
         return handler.grabResults();
     }
@@ -75,23 +78,24 @@ class CurveCurve {
      * @param tolerance optional distance tolerance for coincidence
      */
     static allIntersectionsAmongPrimitivesXY(primitives, tolerance = Geometry_1.Geometry.smallMetricDistance) {
-        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(undefined, undefined, false, undefined, false, tolerance);
+        const handler = new CurveCurveIntersectXY_1.CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);
         for (let i = 0; i < primitives.length; i++) {
             const geometryA = primitives[i];
             for (let j = i + 1; j < primitives.length; j++) {
-                handler.resetGeometry(geometryA, false, primitives[j], false);
+                handler.resetGeometry(false, primitives[j], false);
                 geometryA.dispatchToGeometryHandler(handler);
             }
         }
         return handler.grabPairedResults();
     }
     /**
-     * Return xy close approaches of 2 projected curves
+     * Return xy close approaches of 2 projected curves.
+     * * **NOTE:** GeometryQuery inputs should really be AnyCurve.
      * @param geometryA first geometry
      * @param geometryB second geometry
      */
     static closeApproachProjectedXYPairs(geometryA, geometryB, maxDistance) {
-        const handler = new CurveCurveCloseApproachXY_1.CurveCurveCloseApproachXY(geometryA, geometryB);
+        const handler = new CurveCurveCloseApproachXY_1.CurveCurveCloseApproachXY(geometryB);
         handler.maxDistanceToAccept = maxDistance;
         geometryA.dispatchToGeometryHandler(handler);
         return handler.grabPairedResults();

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

@@ -1 +1 @@
-{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAEvC,uDAAoD;AACpD,2EAAwE;AACxE,mEAA8F;AAC9F,qEAAkE;AAElE,qDAAkD;AAGlD;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;OAOG;IACI,MAAM,CAAC,mBAAmB,CAAC,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACxK,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QACxG,IAAI,SAAS,YAAY,+BAAc,EAAE;YACvC,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;SAC9C;aAAM,IAAI,SAAS,YAAY,iCAAe,EAAE;YAC/C,MAAM,SAAS,GAAG,SAAS,CAAC,sBAAsB,EAAE,CAAC;YACrD,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE;gBAC7B,OAAO,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBACtD,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;aAC9C;SACF;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,4BAA4B,CAAC,YAAsB,EAAE,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACzM,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC3G,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,eAAe,CAAC,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB;QAClH,MAAM,OAAO,GAAG,IAAI,+CAAsB,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACnF,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iCAAiC,CAAC,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAC5H,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACpG,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,OAAO,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC9D,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;aAC9C;SACF;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CACzC,SAAwB,EAAE,SAAwB,EAAE,WAAmB;QACvE,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACpE,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;CAEF;AA/ED,gCA+EC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { CurveCurveCloseApproachXY } from \"./CurveCurveCloseApproachXY\";\r\nimport { CurveCurveIntersectXY, CurveLocationDetailArrayPair } from \"./CurveCurveIntersectXY\";\r\nimport { CurveCurveIntersectXYZ } from \"./CurveCurveIntersectXYZ\";\r\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\n\r\n/**\r\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\r\n * @public\r\n */\r\nexport class CurveCurve {\r\n  /**\r\n   * Return xy intersections of 2 curves.\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionXYPairs(geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean, tolerance: number = Geometry.smallMetricDistance): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, geometryA, extendA, geometryB, extendB, tolerance);\r\n    if (geometryB instanceof CurvePrimitive) {\r\n      geometryA.dispatchToGeometryHandler(handler);\r\n    } else if (geometryB instanceof CurveCollection) {\r\n      const allCurves = geometryB.collectCurvePrimitives();\r\n      for (const child of allCurves) {\r\n        handler.resetGeometry(geometryA, false, child, false);\r\n        geometryA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of 2 projected curves\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionProjectedXYPairs(worldToLocal: Matrix4d, geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean, tolerance: number = Geometry.smallMetricDistance): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(worldToLocal, geometryA, extendA, geometryB, extendB, tolerance);\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return full 3d xyz intersections of 2 curves.\r\n   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\r\n   *  * Not Implemented for bspline and bezier curves.\r\n   * @beta\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   */\r\n  public static intersectionXYZ(geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean): CurveLocationDetailArrayPair {\r\n    const handler = new CurveCurveIntersectXYZ(geometryA, extendA, geometryB, extendB);\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of input curves.\r\n   * @param primitives input curves to intersect\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static allIntersectionsAmongPrimitivesXY(primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, undefined, false, undefined, false, tolerance);\r\n    for (let i = 0; i < primitives.length; i++) {\r\n      const geometryA = primitives[i];\r\n      for (let j = i + 1; j < primitives.length; j++) {\r\n        handler.resetGeometry(geometryA, false, primitives[j], false);\r\n        geometryA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy close approaches of 2 projected curves\r\n   * @param geometryA first geometry\r\n   * @param geometryB second geometry\r\n   */\r\n  public static closeApproachProjectedXYPairs(\r\n    geometryA: GeometryQuery, geometryB: GeometryQuery, maxDistance: number): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveCloseApproachXY(geometryA, geometryB);\r\n    handler.maxDistanceToAccept = maxDistance;\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"CurveCurve.js","sourceRoot":"","sources":["../../../src/curve/CurveCurve.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AAEvC,uDAAoD;AACpD,2EAAwE;AACxE,mEAA8F;AAC9F,qEAAkE;AAElE,qDAAkD;AAGlD;;;GAGG;AACH,MAAa,UAAU;IACrB;;;;;;;;OAQG;IACI,MAAM,CAAC,mBAAmB,CAC/B,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB,EACtF,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7F,IAAI,SAAS,YAAY,+BAAc,EAAE;YACvC,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;SAC9C;aAAM,IAAI,SAAS,YAAY,iCAAe,EAAE;YAC/C,MAAM,SAAS,GAAG,SAAS,CAAC,sBAAsB,EAAE,CAAC;YACrD,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE;gBAC7B,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;gBAC3C,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;aAC9C;SACF;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,4BAA4B,CACxC,YAAsB,EAAE,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB,EAC9G,YAAoB,mBAAQ,CAAC,mBAAmB;QAEhD,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAChG,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,eAAe,CAC3B,SAAwB,EAAE,OAAgB,EAAE,SAAwB,EAAE,OAAgB;QAEtF,MAAM,OAAO,GAAG,IAAI,+CAAsB,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACxE,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IAC/B,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,iCAAiC,CAC7C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,MAAM,OAAO,GAAG,IAAI,6CAAqB,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBAC9C,OAAO,CAAC,aAAa,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;gBACnD,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;aAC9C;SACF;QACD,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,6BAA6B,CACzC,SAAwB,EAAE,SAAwB,EAAE,WAAmB;QAEvE,MAAM,OAAO,GAAG,IAAI,qDAAyB,CAAC,SAAS,CAAC,CAAC;QACzD,OAAO,CAAC,mBAAmB,GAAG,WAAW,CAAC;QAC1C,SAAS,CAAC,yBAAyB,CAAC,OAAO,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC,iBAAiB,EAAE,CAAC;IACrC,CAAC;CACF;AA7FD,gCA6FC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Matrix4d } from \"../geometry4d/Matrix4d\";\r\nimport { CurveCollection } from \"./CurveCollection\";\r\nimport { CurveCurveCloseApproachXY } from \"./CurveCurveCloseApproachXY\";\r\nimport { CurveCurveIntersectXY, CurveLocationDetailArrayPair } from \"./CurveCurveIntersectXY\";\r\nimport { CurveCurveIntersectXYZ } from \"./CurveCurveIntersectXYZ\";\r\nimport { CurveLocationDetailPair } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\n\r\n/**\r\n * `CurveCurve` has static method for various computations that work on a pair of curves or curve collections.\r\n * @public\r\n */\r\nexport class CurveCurve {\r\n  /**\r\n   * Return xy intersections of 2 curves.\r\n   * * **NOTE:** GeometryQuery inputs should really be AnyCurve.\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionXYPairs(\r\n    geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, extendA, geometryB, extendB, tolerance);\r\n    if (geometryB instanceof CurvePrimitive) {\r\n      geometryA.dispatchToGeometryHandler(handler);\r\n    } else if (geometryB instanceof CurveCollection) {\r\n      const allCurves = geometryB.collectCurvePrimitives();\r\n      for (const child of allCurves) {\r\n        handler.resetGeometry(false, child, false);\r\n        geometryA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of 2 projected curves.\r\n   * * **NOTE:** GeometryQuery inputs should really be AnyCurve.\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static intersectionProjectedXYPairs(\r\n    worldToLocal: Matrix4d, geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean,\r\n    tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(worldToLocal, extendA, geometryB, extendB, tolerance);\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return full 3d xyz intersections of 2 curves.\r\n   *  * Implemented for combinations of LineSegment3d, LineString3d, Arc3d.\r\n   *  * Not Implemented for bspline and bezier curves.\r\n   * * **NOTE:** GeometryQuery inputs should really be AnyCurve.\r\n   * @beta\r\n   * @param geometryA first geometry\r\n   * @param extendA true to allow geometryA to extend\r\n   * @param geometryB second geometry\r\n   * @param extendB true to allow geometryB to extend\r\n   */\r\n  public static intersectionXYZ(\r\n    geometryA: GeometryQuery, extendA: boolean, geometryB: GeometryQuery, extendB: boolean,\r\n  ): CurveLocationDetailArrayPair {\r\n    const handler = new CurveCurveIntersectXYZ(extendA, geometryB, extendB);\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabResults();\r\n  }\r\n  /**\r\n   * Return xy intersections of input curves.\r\n   * @param primitives input curves to intersect\r\n   * @param tolerance optional distance tolerance for coincidence\r\n   */\r\n  public static allIntersectionsAmongPrimitivesXY(\r\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveIntersectXY(undefined, false, undefined, false, tolerance);\r\n    for (let i = 0; i < primitives.length; i++) {\r\n      const geometryA = primitives[i];\r\n      for (let j = i + 1; j < primitives.length; j++) {\r\n        handler.resetGeometry(false, primitives[j], false);\r\n        geometryA.dispatchToGeometryHandler(handler);\r\n      }\r\n    }\r\n    return handler.grabPairedResults();\r\n  }\r\n  /**\r\n   * Return xy close approaches of 2 projected curves.\r\n   * * **NOTE:** GeometryQuery inputs should really be AnyCurve.\r\n   * @param geometryA first geometry\r\n   * @param geometryB second geometry\r\n   */\r\n  public static closeApproachProjectedXYPairs(\r\n    geometryA: GeometryQuery, geometryB: GeometryQuery, maxDistance: number,\r\n  ): CurveLocationDetailPair[] {\r\n    const handler = new CurveCurveCloseApproachXY(geometryB);\r\n    handler.maxDistanceToAccept = maxDistance;\r\n    geometryA.dispatchToGeometryHandler(handler);\r\n    return handler.grabPairedResults();\r\n  }\r\n}\r\n"]}