@itwin/core-geometry 4.1.0-dev.77 → 4.1.0-dev.80

package/lib/esm/geometry3d/GeometryHandler.js

@@ -3,128 +3,219 @@
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
 /**
- * * `GeometryHandler` defines the base abstract methods for double-dispatch geometry computation.
+ * `GeometryHandler` defines the base abstract methods for double-dispatch geometry computation.
  * * User code that wants to handle one or all of the commonly known geometry types implements a handler class.
- * * User code that does not handle all types is most likely to start with `NullGeometryHandler`, which will provide no-action implementations for all types.
+ * * User code that does not handle all types is most likely to start with `NullGeometryHandler`, which will provide
+ * No-action implementations for all types.
  * @public
  */
 export class GeometryHandler {
-    /** handle strongly typed  [[CurveCollection]]  */
+    /** Handle strongly typed  [[CurveCollection]]  */
     handleCurveCollection(_g) { }
-    /** handle strongly typed Path (base class method calls handleCurveCollection) */
-    handlePath(g) { return this.handleCurveCollection(g); }
-    /** handle strongly typed  Loop (base class method calls handleCurveCollection) */
-    handleLoop(g) { return this.handleCurveCollection(g); }
-    /** handle strongly typed  ParityRegion (base class method calls handleCurveCollection) */
-    handleParityRegion(g) { return this.handleCurveCollection(g); }
-    /** handle strongly typed  UnionRegion (base class method calls handleCurveCollection) */
-    handleUnionRegion(g) { return this.handleCurveCollection(g); }
-    /** handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */
-    handleBagOfCurves(g) { return this.handleCurveCollection(g); }
+    /** Handle strongly typed Path (base class method calls handleCurveCollection) */
+    handlePath(g) {
+        return this.handleCurveCollection(g);
+    }
+    /** Handle strongly typed  Loop (base class method calls handleCurveCollection) */
+    handleLoop(g) {
+        return this.handleCurveCollection(g);
+    }
+    /** Handle strongly typed  ParityRegion (base class method calls handleCurveCollection) */
+    handleParityRegion(g) {
+        return this.handleCurveCollection(g);
+    }
+    /** Handle strongly typed  UnionRegion (base class method calls handleCurveCollection) */
+    handleUnionRegion(g) {
+        return this.handleCurveCollection(g);
+    }
+    /** Handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */
+    handleBagOfCurves(g) {
+        return this.handleCurveCollection(g);
+    }
 }
 /**
- * `NullGeometryHandler` is a base class for dispatching various geometry types to
- * application specific implementation of some service.
- *
+ * `NullGeometryHandler` is a base class for dispatching various geometry types to application specific implementation
+ * of some service.
  * To use:
  * * Derive a class from `NullGeometryHandler`
- * * Reimplement any or all of the specific `handleXXXX` methods
+ * * Re-implement any or all of the specific `handleXXXX` methods
  * * Create a handler instance `myHandler`
- * * To send a `GeometryQuery` object `candidateGeometry` through the (fast) dispatch, invoke   `candidateGeometry.dispatchToHandler (myHandler)
+ * * To send a `GeometryQuery` object `candidateGeometry` through the (fast) dispatch, invoke
+ * `candidateGeometry.dispatchToHandler (myHandler).
  * * The appropriate method or methods will get called with a strongly typed `_g ` value.
  * @public
  */
 export class NullGeometryHandler extends GeometryHandler {
-    /** no-action implementation */
-    handleLineSegment3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleLineString3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleArc3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleCurveCollection(_g) { return undefined; }
-    /** no-action implementation */
-    handleBSplineCurve3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleInterpolationCurve3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleAkimaCurve3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleBSplineCurve3dH(_g) { return undefined; }
-    /** no-action implementation */
-    handleBSplineSurface3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleCoordinateXYZ(_g) { return undefined; }
-    /** no-action implementation */
-    handleBSplineSurface3dH(_g) { return undefined; }
-    /** no-action implementation */
-    handleIndexedPolyface(_g) { return undefined; }
-    /** no-action implementation
+    /** No-action implementation */
+    handleLineSegment3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleLineString3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleArc3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleCurveCollection(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBSplineCurve3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleInterpolationCurve3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleAkimaCurve3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBSplineCurve3dH(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBSplineSurface3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleCoordinateXYZ(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBSplineSurface3dH(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleIndexedPolyface(_g) {
+        return undefined;
+    }
+    /** No-action implementation
      * @alpha
      */
-    handleTransitionSpiral(_g) { return undefined; }
-    /** no-action implementation */
-    handlePath(_g) { return undefined; }
-    /** no-action implementation */
-    handleLoop(_g) { return undefined; }
-    /** no-action implementation */
-    handleParityRegion(_g) { return undefined; }
-    /** no-action implementation */
-    handleUnionRegion(_g) { return undefined; }
-    /** no-action implementation */
-    handleBagOfCurves(_g) { return undefined; }
-    /** no-action implementation */
-    handleSphere(_g) { return undefined; }
-    /** no-action implementation */
-    handleCone(_g) { return undefined; }
-    /** no-action implementation */
-    handleBox(_g) { return undefined; }
-    /** no-action implementation */
-    handleTorusPipe(_g) { return undefined; }
-    /** no-action implementation */
-    handleLinearSweep(_g) { return undefined; }
-    /** no-action implementation */
-    handleRotationalSweep(_g) { return undefined; }
-    /** no-action implementation */
-    handleRuledSweep(_g) { return undefined; }
-    /** no-action implementation */
-    handlePointString3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleBezierCurve3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleBezierCurve3dH(_g) { return undefined; }
+    handleTransitionSpiral(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handlePath(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleLoop(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleParityRegion(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleUnionRegion(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBagOfCurves(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleSphere(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleCone(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBox(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleTorusPipe(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleLinearSweep(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleRotationalSweep(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleRuledSweep(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handlePointString3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBezierCurve3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBezierCurve3dH(_g) {
+        return undefined;
+    }
 }
 /**
  * Implement GeometryHandler methods, with all curve collection methods recursing to children.
  * @public
  */
 export class RecurseToCurvesGeometryHandler extends GeometryHandler {
-    /** no-action implementation */
-    handleLineSegment3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleLineString3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleArc3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleBSplineCurve3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleInterpolationCurve3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleAkimaCurve3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleBSplineCurve3dH(_g) { return undefined; }
-    /** no-action implementation */
-    handleBSplineSurface3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleCoordinateXYZ(_g) { return undefined; }
-    /** no-action implementation */
-    handleBSplineSurface3dH(_g) { return undefined; }
-    /** no-action implementation */
-    handleIndexedPolyface(_g) { return undefined; }
-    /** no-action implementation
+    /** No-action implementation */
+    handleLineSegment3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleLineString3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleArc3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBSplineCurve3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleInterpolationCurve3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleAkimaCurve3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBSplineCurve3dH(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBSplineSurface3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleCoordinateXYZ(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBSplineSurface3dH(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleIndexedPolyface(_g) {
+        return undefined;
+    }
+    /** No-action implementation
      * @alpha
      */
-    handleTransitionSpiral(_g) { return undefined; }
+    handleTransitionSpiral(_g) {
+        return undefined;
+    }
     /** Invoke `child.dispatchToGeometryHandler(this)` for each child in the array returned by the query `g.children` */
     handleChildren(g) {
         const children = g.children;
@@ -134,36 +225,68 @@ export class RecurseToCurvesGeometryHandler extends GeometryHandler {
             }
     }
     /** Recurse to children */
-    handleCurveCollection(g) { return this.handleChildren(g); }
+    handleCurveCollection(g) {
+        return this.handleChildren(g);
+    }
     /** Recurse to children */
-    handlePath(g) { return this.handleChildren(g); }
+    handlePath(g) {
+        return this.handleChildren(g);
+    }
     /** Recurse to children */
-    handleLoop(g) { return this.handleChildren(g); }
+    handleLoop(g) {
+        return this.handleChildren(g);
+    }
     /** Recurse to children */
-    handleParityRegion(g) { return this.handleChildren(g); }
+    handleParityRegion(g) {
+        return this.handleChildren(g);
+    }
     /** Recurse to children */
-    handleUnionRegion(g) { return this.handleChildren(g); }
+    handleUnionRegion(g) {
+        return this.handleChildren(g);
+    }
     /** Recurse to children */
-    handleBagOfCurves(g) { return this.handleChildren(g); }
-    /** no-action implementation */
-    handleSphere(_g) { return undefined; }
-    /** no-action implementation */
-    handleCone(_g) { return undefined; }
-    /** no-action implementation */
-    handleBox(_g) { return undefined; }
-    /** no-action implementation */
-    handleTorusPipe(_g) { return undefined; }
-    /** no-action implementation */
-    handleLinearSweep(_g) { return undefined; }
-    /** no-action implementation */
-    handleRotationalSweep(_g) { return undefined; }
-    /** no-action implementation */
-    handleRuledSweep(_g) { return undefined; }
-    /** no-action implementation */
-    handlePointString3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleBezierCurve3d(_g) { return undefined; }
-    /** no-action implementation */
-    handleBezierCurve3dH(_g) { return undefined; }
+    handleBagOfCurves(g) {
+        return this.handleChildren(g);
+    }
+    /** No-action implementation */
+    handleSphere(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleCone(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBox(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleTorusPipe(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleLinearSweep(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleRotationalSweep(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleRuledSweep(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handlePointString3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBezierCurve3d(_g) {
+        return undefined;
+    }
+    /** No-action implementation */
+    handleBezierCurve3dH(_g) {
+        return undefined;
+    }
 }
 //# sourceMappingURL=GeometryHandler.js.map

package/lib/esm/geometry3d/GeometryHandler.js.map

@@ -1 +1 @@
-{"version":3,"file":"GeometryHandler.js","sourceRoot":"","sources":["../../../src/geometry3d/GeometryHandler.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAuC/F;;;;;GAKG;AACH,MAAM,OAAgB,eAAe;IAOnC,kDAAkD;IAC3C,qBAAqB,CAAC,EAAmB,IAAS,CAAC;IAsB1D,iFAAiF;IAC1E,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,kFAAkF;IAC3E,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,0FAA0F;IACnF,kBAAkB,CAAC,CAAe,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,yFAAyF;IAClF,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,yFAAyF;IAClF,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAsBxF;AACD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,mBAAoB,SAAQ,eAAe;IACtD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,WAAW,CAAC,EAAS,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxD,+BAA+B;IACf,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACrF,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1E,+BAA+B;IACxB,0BAA0B,CAAC,EAAwB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtF,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,sBAAsB,CAAC,EAAoB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE9E,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,uBAAuB,CAAC,EAAqB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E;;OAEG;IACI,sBAAsB,CAAC,EAAsB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAEhF,+BAA+B;IACf,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/D,+BAA+B;IACf,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/D,+BAA+B;IACf,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC/E,+BAA+B;IACf,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC7E,+BAA+B;IACf,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE7E,+BAA+B;IACxB,YAAY,CAAC,EAAU,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1D,+BAA+B;IACxB,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtD,+BAA+B;IACxB,SAAS,CAAC,EAAO,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpD,+BAA+B;IACxB,eAAe,CAAC,EAAa,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChE,+BAA+B;IACxB,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,gBAAgB,CAAC,EAAc,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAClE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;CAC3E;AACD;;;GAGG;AACH,MAAM,OAAO,8BAA+B,SAAQ,eAAe;IACjE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,WAAW,CAAC,EAAS,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxD,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1E,+BAA+B;IACxB,0BAA0B,CAAC,EAAwB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtF,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,sBAAsB,CAAC,EAAoB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAE9E,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,uBAAuB,CAAC,EAAqB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E;;OAEG;IACI,sBAAsB,CAAC,EAAsB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChF,oHAAoH;IAC7G,cAAc,CAAC,CAAgB;QACpC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC5B,IAAI,QAAQ;YACV,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;gBAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;aACvC;IACL,CAAC;IACD,0BAA0B;IACV,qBAAqB,CAAC,CAAkB,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjG,0BAA0B;IACV,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,0BAA0B;IACV,UAAU,CAAC,CAAO,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,0BAA0B;IACV,kBAAkB,CAAC,CAAe,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3F,0BAA0B;IACV,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzF,0BAA0B;IACV,iBAAiB,CAAC,CAAc,IAAS,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzF,+BAA+B;IACxB,YAAY,CAAC,EAAU,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC1D,+BAA+B;IACxB,UAAU,CAAC,EAAQ,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACtD,+BAA+B;IACxB,SAAS,CAAC,EAAO,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpD,+BAA+B;IACxB,eAAe,CAAC,EAAa,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAChE,+BAA+B;IACxB,iBAAiB,CAAC,EAAe,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACpE,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAC5E,+BAA+B;IACxB,gBAAgB,CAAC,EAAc,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IAClE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;IACxE,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB,IAAS,OAAO,SAAS,CAAC,CAAC,CAAC;CAC3E","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 ArraysAndInterfaces\r\n */\r\n\r\nimport { AkimaCurve3d } from \"../bspline/AkimaCurve3d\";\r\nimport { BezierCurve3d } from \"../bspline/BezierCurve3d\";\r\nimport { BezierCurve3dH } from \"../bspline/BezierCurve3dH\";\r\nimport { BezierCurveBase } from \"../bspline/BezierCurveBase\";\r\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\r\nimport { BSplineCurve3dH } from \"../bspline/BSplineCurve3dH\";\r\nimport { BSplineSurface3d, BSplineSurface3dH } from \"../bspline/BSplineSurface\";\r\nimport { InterpolationCurve3d } from \"../bspline/InterpolationCurve3d\";\r\nimport { Arc3d } from \"../curve/Arc3d\";\r\nimport { CoordinateXYZ } from \"../curve/CoordinateXYZ\";\r\nimport { BagOfCurves, CurveCollection } from \"../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Loop } from \"../curve/Loop\";\r\nimport { ParityRegion } from \"../curve/ParityRegion\";\r\nimport { Path } from \"../curve/Path\";\r\nimport { PointString3d } from \"../curve/PointString3d\";\r\nimport { TransitionSpiral3d } from \"../curve/spiral/TransitionSpiral3d\";\r\nimport { UnionRegion } from \"../curve/UnionRegion\";\r\nimport { IndexedPolyface } from \"../polyface/Polyface\";\r\nimport { Box } from \"../solid/Box\";\r\nimport { Cone } from \"../solid/Cone\";\r\nimport { LinearSweep } from \"../solid/LinearSweep\";\r\nimport { RotationalSweep } from \"../solid/RotationalSweep\";\r\nimport { RuledSweep } from \"../solid/RuledSweep\";\r\nimport { Sphere } from \"../solid/Sphere\";\r\nimport { TorusPipe } from \"../solid/TorusPipe\";\r\nimport { Plane3dByOriginAndVectors } from \"./Plane3dByOriginAndVectors\";\r\nimport { Vector2d } from \"./Point2dVector2d\";\r\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\r\n\r\n/**\r\n * * `GeometryHandler` defines the base abstract methods for double-dispatch geometry computation.\r\n * * User code that wants to handle one or all of the commonly known geometry types implements a handler class.\r\n * * User code that does not handle all types is most likely to start with `NullGeometryHandler`, which will provide no-action implementations for all types.\r\n * @public\r\n */\r\nexport abstract class GeometryHandler {\r\n  /** handle strongly typed [[LineSegment3d]] */\r\n  public abstract handleLineSegment3d(g: LineSegment3d): any;\r\n  /** handle strongly typed  [[LineString3d]]  */\r\n  public abstract handleLineString3d(g: LineString3d): any;\r\n  /** handle strongly typed  [[Arc3d]]  */\r\n  public abstract handleArc3d(g: Arc3d): any;\r\n  /** handle strongly typed  [[CurveCollection]]  */\r\n  public handleCurveCollection(_g: CurveCollection): any { }\r\n  /** handle strongly typed  [[BSplineCurve3d]]  */\r\n  public abstract handleBSplineCurve3d(g: BSplineCurve3d): any;\r\n  /** handle strongly typed  [[InterpolationCurve3d]]  */\r\n  public abstract handleInterpolationCurve3d(g: InterpolationCurve3d): any;\r\n  /** handle strongly typed  [[AkimaCurve3d]]  */\r\n  public abstract handleAkimaCurve3d(g: AkimaCurve3d): any;\r\n  /** handle strongly typed  [[BSplineCurve3dH]]  */\r\n  public abstract handleBSplineCurve3dH(g: BSplineCurve3dH): any;\r\n  /** handle strongly typed  [[BSplineSurface3d]]  */\r\n  public abstract handleBSplineSurface3d(g: BSplineSurface3d): any;\r\n  /** handle strongly typed  [[CoordinateXYZ]]  */\r\n  public abstract handleCoordinateXYZ(g: CoordinateXYZ): any;\r\n  /** handle strongly typed  [[BSplineSurface3dH]]  */\r\n  public abstract handleBSplineSurface3dH(g: BSplineSurface3dH): any;\r\n  /** handle strongly typed  [[IndexedPolyface]]  */\r\n  public abstract handleIndexedPolyface(g: IndexedPolyface): any;\r\n  /** handle strongly typed [[TransitionSpiral3d]]\r\n   * @alpha\r\n   */\r\n  public abstract handleTransitionSpiral(g: TransitionSpiral3d): any;\r\n\r\n  /** handle strongly typed Path (base class method calls handleCurveCollection) */\r\n  public handlePath(g: Path): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  Loop (base class method calls handleCurveCollection) */\r\n  public handleLoop(g: Loop): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  ParityRegion (base class method calls handleCurveCollection) */\r\n  public handleParityRegion(g: ParityRegion): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  UnionRegion (base class method calls handleCurveCollection) */\r\n  public handleUnionRegion(g: UnionRegion): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */\r\n  public handleBagOfCurves(g: BagOfCurves): any { return this.handleCurveCollection(g); }\r\n  /** handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */\r\n  /** handle strongly typed  Sphere */\r\n  public abstract handleSphere(g: Sphere): any;\r\n  /** handle strongly typed  Cone */\r\n  public abstract handleCone(g: Cone): any;\r\n  /** handle strongly typed  Box */\r\n  public abstract handleBox(g: Box): any;\r\n  /** handle strongly typed  TorusPipe */\r\n  public abstract handleTorusPipe(g: TorusPipe): any;\r\n  /** handle strongly typed  LinearSweep */\r\n  public abstract handleLinearSweep(g: LinearSweep): any;\r\n  /** handle strongly typed  RotationalSweep */\r\n  public abstract handleRotationalSweep(g: RotationalSweep): any;\r\n  /** handle strongly typed  RuledSweep */\r\n  public abstract handleRuledSweep(g: RuledSweep): any;\r\n  /** handle strongly typed  PointString3d */\r\n  public abstract handlePointString3d(g: PointString3d): any;\r\n  /** handle strongly typed  BezierCurve3d */\r\n  public abstract handleBezierCurve3d(g: BezierCurve3d): any;\r\n  /** handle strongly typed  BezierCurve3dH */\r\n  public abstract handleBezierCurve3dH(g: BezierCurve3dH): any;\r\n}\r\n/**\r\n * `NullGeometryHandler` is a base class for dispatching various geometry types to\r\n * application specific implementation of some service.\r\n *\r\n * To use:\r\n * * Derive a class from `NullGeometryHandler`\r\n * * Reimplement any or all of the specific `handleXXXX` methods\r\n * * Create a handler instance `myHandler`\r\n * * To send a `GeometryQuery` object `candidateGeometry` through the (fast) dispatch, invoke   `candidateGeometry.dispatchToHandler (myHandler)\r\n * * The appropriate method or methods will get called with a strongly typed `_g ` value.\r\n * @public\r\n */\r\nexport class NullGeometryHandler extends GeometryHandler {\r\n  /** no-action implementation */\r\n  public handleLineSegment3d(_g: LineSegment3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLineString3d(_g: LineString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleArc3d(_g: Arc3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleCurveCollection(_g: CurveCollection): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3d(_g: BSplineCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleInterpolationCurve3d(_g: InterpolationCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleAkimaCurve3d(_g: AkimaCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3dH(_g: BSplineCurve3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3d(_g: BSplineSurface3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleCoordinateXYZ(_g: CoordinateXYZ): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3dH(_g: BSplineSurface3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleIndexedPolyface(_g: IndexedPolyface): any { return undefined; }\r\n  /** no-action implementation\r\n   * @alpha\r\n   */\r\n  public handleTransitionSpiral(_g: TransitionSpiral3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public override handlePath(_g: Path): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleLoop(_g: Loop): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleParityRegion(_g: ParityRegion): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleUnionRegion(_g: UnionRegion): any { return undefined; }\r\n  /** no-action implementation */\r\n  public override handleBagOfCurves(_g: BagOfCurves): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleSphere(_g: Sphere): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleCone(_g: Cone): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBox(_g: Box): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleTorusPipe(_g: TorusPipe): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLinearSweep(_g: LinearSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRotationalSweep(_g: RotationalSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRuledSweep(_g: RuledSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handlePointString3d(_g: PointString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3d(_g: BezierCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3dH(_g: BezierCurve3dH): any { return undefined; }\r\n}\r\n/**\r\n * Implement GeometryHandler methods, with all curve collection methods recursing to children.\r\n * @public\r\n */\r\nexport class RecurseToCurvesGeometryHandler extends GeometryHandler {\r\n  /** no-action implementation */\r\n  public handleLineSegment3d(_g: LineSegment3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLineString3d(_g: LineString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleArc3d(_g: Arc3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3d(_g: BSplineCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleInterpolationCurve3d(_g: InterpolationCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleAkimaCurve3d(_g: AkimaCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineCurve3dH(_g: BSplineCurve3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3d(_g: BSplineSurface3d): any { return undefined; }\r\n\r\n  /** no-action implementation */\r\n  public handleCoordinateXYZ(_g: CoordinateXYZ): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBSplineSurface3dH(_g: BSplineSurface3dH): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleIndexedPolyface(_g: IndexedPolyface): any { return undefined; }\r\n  /** no-action implementation\r\n   * @alpha\r\n   */\r\n  public handleTransitionSpiral(_g: TransitionSpiral3d): any { return undefined; }\r\n  /** Invoke `child.dispatchToGeometryHandler(this)` for each child in the array returned by the query `g.children` */\r\n  public handleChildren(g: GeometryQuery): any {\r\n    const children = g.children;\r\n    if (children)\r\n      for (const child of children) {\r\n        child.dispatchToGeometryHandler(this);\r\n      }\r\n  }\r\n  /** Recurse to children */\r\n  public override handleCurveCollection(g: CurveCollection): any { return this.handleChildren(g); }\r\n\r\n  /** Recurse to children */\r\n  public override handlePath(g: Path): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleLoop(g: Loop): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleParityRegion(g: ParityRegion): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleUnionRegion(g: UnionRegion): any { return this.handleChildren(g); }\r\n  /** Recurse to children */\r\n  public override handleBagOfCurves(g: BagOfCurves): any { return this.handleChildren(g); }\r\n\r\n  /** no-action implementation */\r\n  public handleSphere(_g: Sphere): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleCone(_g: Cone): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBox(_g: Box): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleTorusPipe(_g: TorusPipe): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleLinearSweep(_g: LinearSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRotationalSweep(_g: RotationalSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleRuledSweep(_g: RuledSweep): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handlePointString3d(_g: PointString3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3d(_g: BezierCurve3d): any { return undefined; }\r\n  /** no-action implementation */\r\n  public handleBezierCurve3dH(_g: BezierCurve3dH): any { return undefined; }\r\n}\r\n\r\n/** IStrokeHandler is an interface with methods to receive data about curves being stroked.\r\n * CurvePrimitives emitStrokes () methods emit calls to a handler object with these methods.\r\n * The various CurvePrimitive types are free to announce either single points (announcePoint), linear fragments,\r\n * or fractional intervals of the parent curve.\r\n * * handler.startCurvePrimitive (cp) -- announce the curve primitive whose strokes will follow.\r\n * * announcePointTangent (xyz, fraction, tangent) -- announce a single point on the curve.\r\n * * announceIntervalForUniformStepStrokes (cp, numStrokes, fraction0, fraction1) -- announce a fraction\r\n * interval in which the curve can be evaluated (e.g. the handler can call cp->fractionToPointAndDerivative ())\r\n * * announceSegmentInterval (cp, point0, point1, numStrokes, fraction0, fraction1) -- announce\r\n *    that the fractional interval fraction0, fraction1 is a straight line which should be broken into\r\n *    numStrokes strokes.\r\n *   * A LineSegment would make a single call to this.\r\n *   * A LineString would make one call to this for each of its segments, with fractions indicating position\r\n * within the linestring.\r\n * * endCurvePrimitive (cp) -- announce the end of the curve primitive.\r\n * @public\r\n */\r\nexport interface IStrokeHandler {\r\n  /** announce a parent curve primitive\r\n   * * startParentCurvePrimitive() ...endParentCurvePrimitive() are wrapped around startCurvePrimitive and endCurvePrimitive when the interior primitive is a proxy.\r\n   */\r\n  startParentCurvePrimitive(cp: CurvePrimitive): void;\r\n  /** Announce the curve primitive that will be described in subsequent calls. */\r\n  startCurvePrimitive(cp: CurvePrimitive): void;\r\n  /**\r\n   * announce a single point with its fraction and tangent.\r\n   * * (IMPORTANT) the same Point3d and Vector3d will be reset and passed on multiple calls.\r\n   * * (THEREFORE) if the implementation is saving coordinates, it must copy the xyz data out into its own data structure rather than save the references.\r\n   */\r\n  announcePointTangent(xyz: Point3d, fraction: number, tangent: Vector3d): void;\r\n\r\n  /** Announce that curve primitive cp should be evaluated in the specified fraction interval.\r\n   * * Note that this method is permitted (expected) to provide pre-stroked data if available.\r\n   * * In th pre-stroked case, the cp passed to the handler will be the stroked image, not the original.\r\n   * * Callers that want summary data should implement (and return true from) needPrimaryDataForStrokes\r\n  */\r\n  announceIntervalForUniformStepStrokes(\r\n    cp: CurvePrimitive,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n  /**\r\n   * OPTIONAL method for a handler to indicate that it wants primary geometry (e.g. spirals) rather than strokes.\r\n   * @returns true if primary geometry should be passed (rather than stroked or otherwise simplified)\r\n  */\r\n  needPrimaryGeometryForStrokes?(): boolean;\r\n  /** Announce numPoints interpolated between point0 and point1, with associated fractions */\r\n  announceSegmentInterval(\r\n    cp: CurvePrimitive,\r\n    point0: Point3d,\r\n    point1: Point3d,\r\n    numStrokes: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n  /** Announce that all data about `cp` has been announced. */\r\n  endCurvePrimitive(cp: CurvePrimitive): void;\r\n  /** Announce that all data about the parent primitive has been announced. */\r\n  endParentCurvePrimitive(cp: CurvePrimitive): void;\r\n  /**\r\n   * Announce a bezier curve fragment.\r\n   * * this is usually a section of BsplineCurve\r\n   * * If this function is missing, the same interval will be passed to announceIntervalForUniformSteps.\r\n   * @param bezier bezier fragment\r\n   * @param numStrokes suggested number of strokes (uniform in bezier interval 0..1)\r\n   * @param parent parent curve\r\n   * @param spanIndex spanIndex within parent\r\n   * @param fraction0 start fraction on parent curve\r\n   * @param fraction1 end fraction on parent curve\r\n   */\r\n  announceBezierCurve?(\r\n    bezier: BezierCurveBase,\r\n    numStrokes: number,\r\n    parent: CurvePrimitive,\r\n    spandex: number,\r\n    fraction0: number,\r\n    fraction1: number): void;\r\n}\r\n\r\n/**\r\n * Interface with methods for mapping (u,v) fractional coordinates to surface xyz and derivatives.\r\n * @public\r\n */\r\nexport interface UVSurface {\r\n  /**\r\n   * Convert fractional u and v coordinates to surface point.\r\n   * @param uFraction fractional coordinate in u direction\r\n   * @param vFraction fractional coordinate in v direction\r\n   * @param result optional pre-allocated point\r\n   */\r\n  uvFractionToPoint(uFraction: number, vFraction: number, result?: Point3d): Point3d;\r\n  /**\r\n   * Convert fractional u and v coordinates to surface point and in-surface tangent directions.\r\n   * * The vectors are expected to be non-zero tangents which can be crossed to get a normal.\r\n   * * Hence they are not necessarily (a) partial derivatives or (b) Frenet vectors.\r\n   * @param uFraction fractional coordinate in u direction\r\n   * @param vFraction fractional coordinate in v direction\r\n   * @param result optional pre-allocated carrier for point and vectors\r\n   */\r\n  uvFractionToPointAndTangents(uFraction: number, vFraction: number, result?: Plane3dByOriginAndVectors): Plane3dByOriginAndVectors;\r\n}\r\n/**\r\n * Interface for queries of distance-along in u and v directions\r\n * @public\r\n */\r\nexport interface UVSurfaceIsoParametricDistance {\r\n  /**\r\n   * * Return a vector whose x and y parts are \"size\" of the surface in the u and v directions.\r\n   * * Sizes are use for applying scaling to mesh parameters\r\n   * * These sizes are (reasonable approximations of) the max curve length along u and v isoparameter lines.\r\n   *   * e.g. for a sphere, these are:\r\n   *      * u direction = distance around the equator\r\n   *      * v direction = distance from south pole to north pole.\r\n   */\r\n  maxIsoParametricDistance(): Vector2d;\r\n}\r\n"]}
+{"version":3,"file":"GeometryHandler.js","sourceRoot":"","sources":["../../../src/geometry3d/GeometryHandler.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAuC/F;;;;;;GAMG;AACH,MAAM,OAAgB,eAAe;IAOnC,kDAAkD;IAC3C,qBAAqB,CAAC,EAAmB,IAAS,CAAC;IAsB1D,iFAAiF;IAC1E,UAAU,CAAC,CAAO;QACvB,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,kFAAkF;IAC3E,UAAU,CAAC,CAAO;QACvB,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,0FAA0F;IACnF,kBAAkB,CAAC,CAAe;QACvC,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,yFAAyF;IAClF,iBAAiB,CAAC,CAAc;QACrC,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IACD,yFAAyF;IAClF,iBAAiB,CAAC,CAAc;QACrC,OAAO,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;CAqBF;AACD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,mBAAoB,SAAQ,eAAe;IACtD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB;QAC1C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB;QACxC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,WAAW,CAAC,EAAS;QAC1B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,qBAAqB,CAAC,EAAmB;QACvD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB;QAC5C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,0BAA0B,CAAC,EAAwB;QACxD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB;QACxC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB;QAC9C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,sBAAsB,CAAC,EAAoB;QAChD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB;QAC1C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,uBAAuB,CAAC,EAAqB;QAClD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB;QAC9C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACI,sBAAsB,CAAC,EAAsB;QAClD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,UAAU,CAAC,EAAQ;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,UAAU,CAAC,EAAQ;QACjC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB,CAAC,EAAgB;QACjD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,iBAAiB,CAAC,EAAe;QAC/C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,iBAAiB,CAAC,EAAe;QAC/C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,YAAY,CAAC,EAAU;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,UAAU,CAAC,EAAQ;QACxB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,SAAS,CAAC,EAAO;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,eAAe,CAAC,EAAa;QAClC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,iBAAiB,CAAC,EAAe;QACtC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB;QAC9C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,gBAAgB,CAAC,EAAc;QACpC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB;QAC1C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB;QAC1C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB;QAC5C,OAAO,SAAS,CAAC;IACnB,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,8BAA+B,SAAQ,eAAe;IACjE,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB;QAC1C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB;QACxC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,WAAW,CAAC,EAAS;QAC1B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB;QAC5C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,0BAA0B,CAAC,EAAwB;QACxD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,kBAAkB,CAAC,EAAgB;QACxC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB;QAC9C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,sBAAsB,CAAC,EAAoB;QAChD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB;QAC1C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,uBAAuB,CAAC,EAAqB;QAClD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB;QAC9C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACI,sBAAsB,CAAC,EAAsB;QAClD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,oHAAoH;IAC7G,cAAc,CAAC,CAAgB;QACpC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAC5B,IAAI,QAAQ;YACV,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;gBAC5B,KAAK,CAAC,yBAAyB,CAAC,IAAI,CAAC,CAAC;aACvC;IACL,CAAC;IACD,0BAA0B;IACV,qBAAqB,CAAC,CAAkB;QACtD,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,0BAA0B;IACV,UAAU,CAAC,CAAO;QAChC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,0BAA0B;IACV,UAAU,CAAC,CAAO;QAChC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,0BAA0B;IACV,kBAAkB,CAAC,CAAe;QAChD,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,0BAA0B;IACV,iBAAiB,CAAC,CAAc;QAC9C,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,0BAA0B;IACV,iBAAiB,CAAC,CAAc;QAC9C,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IACD,+BAA+B;IACxB,YAAY,CAAC,EAAU;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,UAAU,CAAC,EAAQ;QACxB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,SAAS,CAAC,EAAO;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,eAAe,CAAC,EAAa;QAClC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,iBAAiB,CAAC,EAAe;QACtC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,qBAAqB,CAAC,EAAmB;QAC9C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,gBAAgB,CAAC,EAAc;QACpC,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB;QAC1C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,mBAAmB,CAAC,EAAiB;QAC1C,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACxB,oBAAoB,CAAC,EAAkB;QAC5C,OAAO,SAAS,CAAC;IACnB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module ArraysAndInterfaces\n */\n\nimport { AkimaCurve3d } from \"../bspline/AkimaCurve3d\";\nimport { BezierCurve3d } from \"../bspline/BezierCurve3d\";\nimport { BezierCurve3dH } from \"../bspline/BezierCurve3dH\";\nimport { BezierCurveBase } from \"../bspline/BezierCurveBase\";\nimport { BSplineCurve3d } from \"../bspline/BSplineCurve\";\nimport { BSplineCurve3dH } from \"../bspline/BSplineCurve3dH\";\nimport { BSplineSurface3d, BSplineSurface3dH } from \"../bspline/BSplineSurface\";\nimport { InterpolationCurve3d } from \"../bspline/InterpolationCurve3d\";\nimport { Arc3d } from \"../curve/Arc3d\";\nimport { CoordinateXYZ } from \"../curve/CoordinateXYZ\";\nimport { BagOfCurves, CurveCollection } from \"../curve/CurveCollection\";\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { ParityRegion } from \"../curve/ParityRegion\";\nimport { Path } from \"../curve/Path\";\nimport { PointString3d } from \"../curve/PointString3d\";\nimport { TransitionSpiral3d } from \"../curve/spiral/TransitionSpiral3d\";\nimport { UnionRegion } from \"../curve/UnionRegion\";\nimport { IndexedPolyface } from \"../polyface/Polyface\";\nimport { Box } from \"../solid/Box\";\nimport { Cone } from \"../solid/Cone\";\nimport { LinearSweep } from \"../solid/LinearSweep\";\nimport { RotationalSweep } from \"../solid/RotationalSweep\";\nimport { RuledSweep } from \"../solid/RuledSweep\";\nimport { Sphere } from \"../solid/Sphere\";\nimport { TorusPipe } from \"../solid/TorusPipe\";\nimport { Plane3dByOriginAndVectors } from \"./Plane3dByOriginAndVectors\";\nimport { Vector2d } from \"./Point2dVector2d\";\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\n\n/**\n * `GeometryHandler` defines the base abstract methods for double-dispatch geometry computation.\n * * User code that wants to handle one or all of the commonly known geometry types implements a handler class.\n * * User code that does not handle all types is most likely to start with `NullGeometryHandler`, which will provide\n * No-action implementations for all types.\n * @public\n */\nexport abstract class GeometryHandler {\n  /** Handle strongly typed [[LineSegment3d]] */\n  public abstract handleLineSegment3d(g: LineSegment3d): any;\n  /** Handle strongly typed  [[LineString3d]]  */\n  public abstract handleLineString3d(g: LineString3d): any;\n  /** Handle strongly typed  [[Arc3d]]  */\n  public abstract handleArc3d(g: Arc3d): any;\n  /** Handle strongly typed  [[CurveCollection]]  */\n  public handleCurveCollection(_g: CurveCollection): any { }\n  /** Handle strongly typed  [[BSplineCurve3d]]  */\n  public abstract handleBSplineCurve3d(g: BSplineCurve3d): any;\n  /** Handle strongly typed  [[InterpolationCurve3d]]  */\n  public abstract handleInterpolationCurve3d(g: InterpolationCurve3d): any;\n  /** Handle strongly typed  [[AkimaCurve3d]]  */\n  public abstract handleAkimaCurve3d(g: AkimaCurve3d): any;\n  /** Handle strongly typed  [[BSplineCurve3dH]]  */\n  public abstract handleBSplineCurve3dH(g: BSplineCurve3dH): any;\n  /** Handle strongly typed  [[BSplineSurface3d]]  */\n  public abstract handleBSplineSurface3d(g: BSplineSurface3d): any;\n  /** Handle strongly typed  [[CoordinateXYZ]]  */\n  public abstract handleCoordinateXYZ(g: CoordinateXYZ): any;\n  /** Handle strongly typed  [[BSplineSurface3dH]]  */\n  public abstract handleBSplineSurface3dH(g: BSplineSurface3dH): any;\n  /** Handle strongly typed  [[IndexedPolyface]]  */\n  public abstract handleIndexedPolyface(g: IndexedPolyface): any;\n  /**\n   * Handle strongly typed [[TransitionSpiral3d]]\n   * @alpha\n   */\n  public abstract handleTransitionSpiral(g: TransitionSpiral3d): any;\n  /** Handle strongly typed Path (base class method calls handleCurveCollection) */\n  public handlePath(g: Path): any {\n    return this.handleCurveCollection(g);\n  }\n  /** Handle strongly typed  Loop (base class method calls handleCurveCollection) */\n  public handleLoop(g: Loop): any {\n    return this.handleCurveCollection(g);\n  }\n  /** Handle strongly typed  ParityRegion (base class method calls handleCurveCollection) */\n  public handleParityRegion(g: ParityRegion): any {\n    return this.handleCurveCollection(g);\n  }\n  /** Handle strongly typed  UnionRegion (base class method calls handleCurveCollection) */\n  public handleUnionRegion(g: UnionRegion): any {\n    return this.handleCurveCollection(g);\n  }\n  /** Handle strongly typed  BagOfCurves (base class method calls handleCurveCollection) */\n  public handleBagOfCurves(g: BagOfCurves): any {\n    return this.handleCurveCollection(g);\n  }\n  /** Handle strongly typed  Sphere */\n  public abstract handleSphere(g: Sphere): any;\n  /** Handle strongly typed  Cone */\n  public abstract handleCone(g: Cone): any;\n  /** Handle strongly typed  Box */\n  public abstract handleBox(g: Box): any;\n  /** Handle strongly typed  TorusPipe */\n  public abstract handleTorusPipe(g: TorusPipe): any;\n  /** Handle strongly typed  LinearSweep */\n  public abstract handleLinearSweep(g: LinearSweep): any;\n  /** Handle strongly typed  RotationalSweep */\n  public abstract handleRotationalSweep(g: RotationalSweep): any;\n  /** Handle strongly typed  RuledSweep */\n  public abstract handleRuledSweep(g: RuledSweep): any;\n  /** Handle strongly typed  PointString3d */\n  public abstract handlePointString3d(g: PointString3d): any;\n  /** Handle strongly typed  BezierCurve3d */\n  public abstract handleBezierCurve3d(g: BezierCurve3d): any;\n  /** Handle strongly typed  BezierCurve3dH */\n  public abstract handleBezierCurve3dH(g: BezierCurve3dH): any;\n}\n/**\n * `NullGeometryHandler` is a base class for dispatching various geometry types to application specific implementation\n * of some service.\n * To use:\n * * Derive a class from `NullGeometryHandler`\n * * Re-implement any or all of the specific `handleXXXX` methods\n * * Create a handler instance `myHandler`\n * * To send a `GeometryQuery` object `candidateGeometry` through the (fast) dispatch, invoke\n * `candidateGeometry.dispatchToHandler (myHandler).\n * * The appropriate method or methods will get called with a strongly typed `_g ` value.\n * @public\n */\nexport class NullGeometryHandler extends GeometryHandler {\n  /** No-action implementation */\n  public handleLineSegment3d(_g: LineSegment3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleLineString3d(_g: LineString3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleArc3d(_g: Arc3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public override handleCurveCollection(_g: CurveCollection): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBSplineCurve3d(_g: BSplineCurve3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleInterpolationCurve3d(_g: InterpolationCurve3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleAkimaCurve3d(_g: AkimaCurve3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBSplineCurve3dH(_g: BSplineCurve3dH): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBSplineSurface3d(_g: BSplineSurface3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleCoordinateXYZ(_g: CoordinateXYZ): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBSplineSurface3dH(_g: BSplineSurface3dH): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleIndexedPolyface(_g: IndexedPolyface): any {\n    return undefined;\n  }\n  /** No-action implementation\n   * @alpha\n   */\n  public handleTransitionSpiral(_g: TransitionSpiral3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public override handlePath(_g: Path): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public override handleLoop(_g: Loop): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public override handleParityRegion(_g: ParityRegion): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public override handleUnionRegion(_g: UnionRegion): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public override handleBagOfCurves(_g: BagOfCurves): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleSphere(_g: Sphere): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleCone(_g: Cone): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBox(_g: Box): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleTorusPipe(_g: TorusPipe): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleLinearSweep(_g: LinearSweep): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleRotationalSweep(_g: RotationalSweep): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleRuledSweep(_g: RuledSweep): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handlePointString3d(_g: PointString3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBezierCurve3d(_g: BezierCurve3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBezierCurve3dH(_g: BezierCurve3dH): any {\n    return undefined;\n  }\n}\n/**\n * Implement GeometryHandler methods, with all curve collection methods recursing to children.\n * @public\n */\nexport class RecurseToCurvesGeometryHandler extends GeometryHandler {\n  /** No-action implementation */\n  public handleLineSegment3d(_g: LineSegment3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleLineString3d(_g: LineString3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleArc3d(_g: Arc3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBSplineCurve3d(_g: BSplineCurve3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleInterpolationCurve3d(_g: InterpolationCurve3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleAkimaCurve3d(_g: AkimaCurve3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBSplineCurve3dH(_g: BSplineCurve3dH): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBSplineSurface3d(_g: BSplineSurface3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleCoordinateXYZ(_g: CoordinateXYZ): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBSplineSurface3dH(_g: BSplineSurface3dH): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleIndexedPolyface(_g: IndexedPolyface): any {\n    return undefined;\n  }\n  /** No-action implementation\n   * @alpha\n   */\n  public handleTransitionSpiral(_g: TransitionSpiral3d): any {\n    return undefined;\n  }\n  /** Invoke `child.dispatchToGeometryHandler(this)` for each child in the array returned by the query `g.children` */\n  public handleChildren(g: GeometryQuery): any {\n    const children = g.children;\n    if (children)\n      for (const child of children) {\n        child.dispatchToGeometryHandler(this);\n      }\n  }\n  /** Recurse to children */\n  public override handleCurveCollection(g: CurveCollection): any {\n    return this.handleChildren(g);\n  }\n  /** Recurse to children */\n  public override handlePath(g: Path): any {\n    return this.handleChildren(g);\n  }\n  /** Recurse to children */\n  public override handleLoop(g: Loop): any {\n    return this.handleChildren(g);\n  }\n  /** Recurse to children */\n  public override handleParityRegion(g: ParityRegion): any {\n    return this.handleChildren(g);\n  }\n  /** Recurse to children */\n  public override handleUnionRegion(g: UnionRegion): any {\n    return this.handleChildren(g);\n  }\n  /** Recurse to children */\n  public override handleBagOfCurves(g: BagOfCurves): any {\n    return this.handleChildren(g);\n  }\n  /** No-action implementation */\n  public handleSphere(_g: Sphere): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleCone(_g: Cone): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBox(_g: Box): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleTorusPipe(_g: TorusPipe): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleLinearSweep(_g: LinearSweep): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleRotationalSweep(_g: RotationalSweep): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleRuledSweep(_g: RuledSweep): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handlePointString3d(_g: PointString3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBezierCurve3d(_g: BezierCurve3d): any {\n    return undefined;\n  }\n  /** No-action implementation */\n  public handleBezierCurve3dH(_g: BezierCurve3dH): any {\n    return undefined;\n  }\n}\n\n/**\n * IStrokeHandler is an interface with methods to receive data about curves being stroked.\n * CurvePrimitives emitStrokes () methods emit calls to a handler object with these methods.\n * The various CurvePrimitive types are free to announce either single points (announcePoint), linear fragments,\n * or fractional intervals of the parent curve.\n * * handler.startCurvePrimitive (cp) -- announce the curve primitive whose strokes will follow.\n * * announcePointTangent (xyz, fraction, tangent) -- announce a single point on the curve.\n * * announceIntervalForUniformStepStrokes (cp, numStrokes, fraction0, fraction1) -- announce a fraction\n * interval in which the curve can be evaluated (e.g. the handler can call cp->fractionToPointAndDerivative ())\n * * announceSegmentInterval (cp, point0, point1, numStrokes, fraction0, fraction1) -- announce\n *    that the fractional interval fraction0, fraction1 is a straight line which should be broken into\n *    numStrokes strokes.\n *   * A LineSegment would make a single call to this.\n *   * A LineString would make one call to this for each of its segments, with fractions indicating position\n * within the linestring.\n * * endCurvePrimitive (cp) -- announce the end of the curve primitive.\n * @public\n */\nexport interface IStrokeHandler {\n  /**\n   * Announce a parent curve primitive\n   * * startParentCurvePrimitive() ...endParentCurvePrimitive() are wrapped around startCurvePrimitive and\n   * endCurvePrimitive when the interior primitive is a proxy.\n   */\n  startParentCurvePrimitive(cp: CurvePrimitive): void;\n  /** Announce the curve primitive that will be described in subsequent calls. */\n  startCurvePrimitive(cp: CurvePrimitive): void;\n  /**\n   * Announce a single point with its fraction and tangent.\n   * * (IMPORTANT) the same Point3d and Vector3d will be reset and passed on multiple calls.\n   * * (THEREFORE) if the implementation is saving coordinates, it must copy the xyz data out into its own data\n   * structure rather than save the references.\n   */\n  announcePointTangent(xyz: Point3d, fraction: number, tangent: Vector3d): void;\n\n  /**\n   * Announce that curve primitive cp should be evaluated in the specified fraction interval.\n   * * Note that this method is permitted (expected) to provide pre-stroked data if available.\n   * * In th pre-stroked case, the cp passed to the handler will be the stroked image, not the original.\n   * * Callers that want summary data should implement (and return true from) needPrimaryDataForStrokes\n  */\n  announceIntervalForUniformStepStrokes(\n    cp: CurvePrimitive,\n    numStrokes: number,\n    fraction0: number,\n    fraction1: number): void;\n  /**\n   * OPTIONAL method for a handler to indicate that it wants primary geometry (e.g. spirals) rather than strokes.\n   * @returns true if primary geometry should be passed (rather than stroked or otherwise simplified)\n  */\n  needPrimaryGeometryForStrokes?(): boolean;\n  /** Announce numPoints interpolated between point0 and point1, with associated fractions */\n  announceSegmentInterval(\n    cp: CurvePrimitive, point0: Point3d, point1: Point3d, numStrokes: number, fraction0: number, fraction1: number,\n  ): void;\n  /** Announce that all data about `cp` has been announced. */\n  endCurvePrimitive(cp: CurvePrimitive): void;\n  /** Announce that all data about the parent primitive has been announced. */\n  endParentCurvePrimitive(cp: CurvePrimitive): void;\n  /**\n   * Announce a bezier curve fragment.\n   * * this is usually a section of BsplineCurve\n   * * If this function is missing, the same interval will be passed to announceIntervalForUniformSteps.\n   * @param bezier bezier fragment\n   * @param numStrokes suggested number of strokes (uniform in bezier interval 0..1)\n   * @param parent parent curve\n   * @param spanIndex spanIndex within parent\n   * @param fraction0 start fraction on parent curve\n   * @param fraction1 end fraction on parent curve\n   */\n  announceBezierCurve?(\n    bezier: BezierCurveBase,\n    numStrokes: number,\n    parent: CurvePrimitive,\n    spandex: number,\n    fraction0: number,\n    fraction1: number,\n  ): void;\n}\n\n/**\n * Interface with methods for mapping (u,v) fractional coordinates to surface xyz and derivatives.\n * @public\n */\nexport interface UVSurface {\n  /**\n   * Convert fractional u and v coordinates to surface point.\n   * @param uFraction fractional coordinate in u direction\n   * @param vFraction fractional coordinate in v direction\n   * @param result optional pre-allocated point\n   */\n  uvFractionToPoint(uFraction: number, vFraction: number, result?: Point3d): Point3d;\n  /**\n   * Convert fractional u and v coordinates to surface point and in-surface tangent directions.\n   * * The vectors are expected to be non-zero tangents which can be crossed to get a normal.\n   * * Hence they are not necessarily (a) partial derivatives or (b) Frenet vectors.\n   * @param uFraction fractional coordinate in u direction\n   * @param vFraction fractional coordinate in v direction\n   * @param result optional pre-allocated carrier for point and vectors\n   */\n  uvFractionToPointAndTangents(\n    uFraction: number, vFraction: number, result?: Plane3dByOriginAndVectors,\n  ): Plane3dByOriginAndVectors;\n}\n/**\n * Interface for queries of distance-along in u and v directions\n * @public\n */\nexport interface UVSurfaceIsoParametricDistance {\n  /**\n   * * Return a vector whose x and y parts are \"size\" of the surface in the u and v directions.\n   * * Sizes are use for applying scaling to mesh parameters\n   * * These sizes are (reasonable approximations of) the max curve length along u and v isoparameter lines.\n   *   * e.g. for a sphere, these are:\n   *      * u direction = distance around the equator\n   *      * v direction = distance from south pole to north pole.\n   */\n  maxIsoParametricDistance(): Vector2d;\n}\n"]}

package/lib/esm/geometry3d/GrowableBlockedArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"GrowableBlockedArray.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableBlockedArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAIH;;;;GAIG;AACH,MAAM,OAAO,oBAAoB;IAc/B;;;;;;;OAOG;IACH,YAAmB,SAAiB,EAAE,gBAAwB,CAAC,EAAE,YAAqB;QACpF,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,SAAS,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,qDAAqD;QACrD,IAAI,QAAQ,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC3F,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACzC,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,KAAK,CAAC;gBAClC,OAAO,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC;SACzC;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAC,CAAC;IAClF,CAAC;IAED;;;OAGG;IACI,KAAK;QACV,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QACjG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/C,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,yDAAyD;IACzD,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACnD,yDAAyD;IACzD,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACtD,gDAAgD;IAChD,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC5D;;;;OAIG;IACI,cAAc,CAAC,UAAkB,EAAE,gBAAwB;QAChE,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC,CAAC;IACrE,CAAC;IACD,uEAAuE;IAChE,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACnC,kDAAkD;IAC3C,aAAa;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;IAC7C,CAAC;IACD,+CAA+C;IACxC,mBAAmB,CAAC,aAAqB,EAAE,oBAA6B,IAAI;QACjF,IAAI,aAAa,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE;YACxC,IAAI,iBAAiB;gBACnB,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/D,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACpC;IACL,CAAC;IACD;;;OAGG;IACI,QAAQ,CAAC,OAAiB;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAChC,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU;YAC5B,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;YAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACO,aAAa;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;YACjC,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE;YAClD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,QAAQ;QACb,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;IACD,gFAAgF;IACtE,uBAAuB,CAAC,UAAkB,IAAI,OAAO,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC;IAC9F,wHAAwH;IACjH,gBAAgB,CAAC,UAAkB,EAAE,cAAsB;QAChE,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,IAAI,UAAU,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,IAAI,CAAC,UAAU;YACxG,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACnE,CAAC;IACD,oFAAoF;IAC7E,SAAS,CAAC,UAAkB,EAAE,cAAsB;QACzD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACnE,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,mBAAmB,CAAC,IAAkB,EAAE,SAAiB,EAAE,EAAU,EAAE,EAAU;QAC7F,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAClC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAClB,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAClB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC,CAAC;SACxB;QACD,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,wDAAwD;IAC1E,CAAC;IACD,+EAA+E;IACxE,kBAAkB,CAAC,gBAAyC,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,oBAAoB,CAAC,mBAAmB,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/J,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,sBAAsB;QACtB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CACT,CAAC,WAAmB,EAAE,WAAmB,EAAE,EAAE;YAC3C,gBAAgB;YAChB,OAAO,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,GAAG,SAAS,EAAE,WAAW,GAAG,SAAS,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;QACL,+BAA+B;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,qFAAqF;IAC9E,qBAAqB,CAAC,WAAmB,EAAE,WAAmB;QACnE,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,IAAI,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;YACxC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED,2HAA2H;IACpH,wBAAwB,CAAC,WAAmB,EAAE,WAAmB,EAAE,MAAc,EAAE,IAAY;QACpG,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACrD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAClC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAChC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,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/** @packageDocumentation\r\n * @module ArraysAndInterfaces\r\n */\r\n\r\nimport { BlockComparisonFunction } from \"./GrowableFloat64Array\";\r\n\r\n/**\r\n * Array of contiguous doubles, indexed by block number and index within block.\r\n * * This is essentially a rectangular matrix (two dimensional array), with each block being a row of the matrix.\r\n * @public\r\n */\r\nexport class GrowableBlockedArray {\r\n  /** underlying contiguous, oversized buffer. */\r\n  protected _data: Float64Array;\r\n  /** Number of blocks (matrix rows) in use. */\r\n  protected _inUse: number;\r\n  /** number of numbers per block in the array.\r\n   * * If viewing the array as a two dimensional array, this is the row size.\r\n   */\r\n  protected _blockSize: number;  // positive integer !!!\r\n  /**\r\n   * multiplier used by ensureBlockCapacity to expand requested reallocation size\r\n   */\r\n  protected _growthFactor: number;\r\n\r\n  /**\r\n   * Construct an array whose contents are in blocked (row-major) order, possibly with extra capacity.\r\n   * * Total capacity is `this._data.length`\r\n   * * Actual in-use count is `this._inUse * this._blockSize`\r\n   * @param blockSize number of entries in each block, i.e., row size\r\n   * @param initialBlocks initial capacity in blocks (default 8)\r\n   * @param growthFactor used by ensureBlockCapacity to expand requested reallocation size (default 1.5)\r\n   */\r\n  public constructor(blockSize: number, initialBlocks: number = 8, growthFactor?: number) {\r\n    this._data = new Float64Array(initialBlocks * blockSize);\r\n    this._inUse = 0;\r\n    this._blockSize = blockSize > 0 ? blockSize : 1;\r\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\r\n  }\r\n\r\n  /** Copy data from source array. Does not reallocate or change active block count.\r\n   * @param source array to copy from\r\n   * @param sourceCount copy the first sourceCount blocks; all blocks if undefined\r\n   * @param destOffset copy to instance array starting at this block index; zero if undefined\r\n   * @return count and offset of blocks copied\r\n   */\r\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\r\n    // validate inputs and convert from blocks to entries\r\n    let myOffset = (undefined !== destOffset) ? destOffset * this.numPerBlock : 0;\r\n    if (myOffset < 0)\r\n      myOffset = 0;\r\n    if (myOffset >= this._data.length)\r\n      return {count: 0, offset: 0};\r\n    let myCount = (undefined !== sourceCount) ? sourceCount * this.numPerBlock : source.length;\r\n    if (myCount > 0) {\r\n      if (myCount > source.length)\r\n        myCount = source.length;\r\n      if (myOffset + myCount > this._data.length)\r\n        myCount = this._data.length - myOffset;\r\n      if (myCount % this.numPerBlock !== 0)\r\n        myCount -= myCount % this.numPerBlock;\r\n    }\r\n    if (myCount <= 0)\r\n      return {count: 0, offset: 0};\r\n    if (myCount === source.length)\r\n      this._data.set(source, myOffset);\r\n    else if (source instanceof Float64Array)\r\n      this._data.set(source.subarray(0, myCount), myOffset);\r\n    else\r\n      this._data.set(source.slice(0, myCount), myOffset);\r\n    return {count: myCount / this.numPerBlock, offset: myOffset / this.numPerBlock};\r\n  }\r\n\r\n  /**\r\n   * Make a copy of the (active) blocks in this array.\r\n   * (The clone does NOT get excess capacity)\r\n   */\r\n  public clone(): GrowableBlockedArray {\r\n    const newBlocks = new GrowableBlockedArray(this.numPerBlock, this.numBlocks, this._growthFactor);\r\n    newBlocks.copyData(this._data, this.numBlocks);\r\n    newBlocks._inUse = this.numBlocks;\r\n    return newBlocks;\r\n  }\r\n\r\n  /** computed property: length (in blocks, not doubles) */\r\n  public get length(): number { return this._inUse; }\r\n  /** computed property: length (in blocks, not doubles) */\r\n  public get numBlocks(): number { return this._inUse; }\r\n  /** property: number of data values per block */\r\n  public get numPerBlock(): number { return this._blockSize; }\r\n  /**\r\n   * Return a single value indexed within a block. Indices are unchecked.\r\n   * @param blockIndex index of block to read\r\n   * @param indexInBlock  offset within the block\r\n   */\r\n  public getWithinBlock(blockIndex: number, indexWithinBlock: number): number {\r\n    return this._data[blockIndex * this._blockSize + indexWithinBlock];\r\n  }\r\n  /** clear the block count to zero, but maintain the allocated memory */\r\n  public clear() { this._inUse = 0; }\r\n  /** Return the capacity in blocks (not doubles) */\r\n  public blockCapacity() {\r\n    return this._data.length / this._blockSize;\r\n  }\r\n  /** ensure capacity (in blocks, not doubles) */\r\n  public ensureBlockCapacity(blockCapacity: number, applyGrowthFactor: boolean = true) {\r\n    if (blockCapacity > this.blockCapacity()) {\r\n      if (applyGrowthFactor)\r\n        blockCapacity *= this._growthFactor;\r\n      const prevData = this._data;\r\n      this._data = new Float64Array(blockCapacity * this._blockSize);\r\n      this.copyData(prevData, this._inUse);\r\n      }\r\n  }\r\n  /** Add a new block of data.\r\n   * * If newData has fewer than numPerBlock entries, the remaining part of the new block is zeros.\r\n   * * If newData has more entries, only the first numPerBlock are taken.\r\n   */\r\n  public addBlock(newData: number[]) {\r\n    const k0 = this.newBlockIndex();\r\n    let numValue = newData.length;\r\n    if (numValue > this._blockSize)\r\n      numValue = this._blockSize;\r\n    for (let i = 0; i < numValue; i++)\r\n      this._data[k0 + i] = newData[i];\r\n  }\r\n  /**\r\n   * Return the starting index of a block of (zero-initialized) doubles at the end.\r\n   *\r\n   * * this.data is reallocated if needed to include the new block.\r\n   * * The inUse count is incremented to include the new block.\r\n   * * The returned block is an index to the Float64Array (not a block index)\r\n   */\r\n  protected newBlockIndex(): number {\r\n    const index = this._blockSize * this._inUse;\r\n    if ((index + 1) > this._data.length)\r\n      this.ensureBlockCapacity(1 + this._inUse);\r\n    this._inUse++;\r\n    for (let i = index; i < index + this._blockSize; i++)\r\n      this._data[i] = 0.0;\r\n    return index;\r\n  }\r\n  /** reduce the block count by one. */\r\n  public popBlock() {\r\n    if (this._inUse > 0)\r\n      this._inUse--;\r\n  }\r\n  /** convert a block index to the simple index to the underlying Float64Array. */\r\n  protected blockIndexToDoubleIndex(blockIndex: number) { return this._blockSize * blockIndex; }\r\n  /** Access a single double at offset within a block, with index checking and return undefined if indexing is invalid. */\r\n  public checkedComponent(blockIndex: number, componentIndex: number): number | undefined {\r\n    if (blockIndex >= this._inUse || blockIndex < 0 || componentIndex < 0 || componentIndex >= this._blockSize)\r\n      return undefined;\r\n    return this._data[this._blockSize * blockIndex + componentIndex];\r\n  }\r\n  /** Access a single double at offset within a block.  This has no index checking. */\r\n  public component(blockIndex: number, componentIndex: number): number {\r\n    return this._data[this._blockSize * blockIndex + componentIndex];\r\n  }\r\n  /** compare two blocks in simple lexical order.\r\n   * @param data data array\r\n   * @param blockSize number of items to compare\r\n   * @param ia raw index (not block index) of first block\r\n   * @param ib raw index (not block index) of second block\r\n   */\r\n  public static compareLexicalBlock(data: Float64Array, blockSize: number, ia: number, ib: number): number {\r\n    let ax = 0;\r\n    let bx = 0;\r\n    for (let i = 0; i < blockSize; i++) {\r\n      ax = data[ia + i];\r\n      bx = data[ib + i];\r\n      if (ax > bx) return 1;\r\n      if (ax < bx) return -1;\r\n    }\r\n    return ia - ib; // so original order is maintained among duplicates !!!!\r\n  }\r\n  /** Return an array of block indices sorted per compareLexicalBlock function */\r\n  public sortIndicesLexical(compareBlocks: BlockComparisonFunction = (dataArray, size, iA, iB) => GrowableBlockedArray.compareLexicalBlock(dataArray, size, iA, iB)): Uint32Array {\r\n    const n = this._inUse;\r\n    // let numCompare = 0;\r\n    const result = new Uint32Array(n);\r\n    const data = this._data;\r\n    const blockSize = this._blockSize;\r\n    for (let i = 0; i < n; i++)result[i] = i;\r\n    result.sort(\r\n      (blockIndexA: number, blockIndexB: number) => {\r\n        // numCompare++;\r\n        return compareBlocks(data, blockSize, blockIndexA * blockSize, blockIndexB * blockSize);\r\n      });\r\n    // console.log (n, numCompare);\r\n    return result;\r\n  }\r\n  /** Return the distance (hypotenuse=sqrt(summed squares)) between indicated blocks */\r\n  public distanceBetweenBlocks(blockIndexA: number, blockIndexB: number): number {\r\n    let dd = 0.0;\r\n    let iA = this.blockIndexToDoubleIndex(blockIndexA);\r\n    let iB = this.blockIndexToDoubleIndex(blockIndexB);\r\n    let a = 0;\r\n    const data = this._data;\r\n    for (let i = 0; i < this._blockSize; i++) {\r\n      a = data[iA++] - data[iB++];\r\n      dd += a * a;\r\n    }\r\n    return Math.sqrt(dd);\r\n  }\r\n\r\n  /** Return the distance (hypotenuse=sqrt(summed squares)) between block entries `iBegin <= i < iEnd` of indicated blocks */\r\n  public distanceBetweenSubBlocks(blockIndexA: number, blockIndexB: number, iBegin: number, iEnd: number): number {\r\n    let dd = 0.0;\r\n    const iA = this.blockIndexToDoubleIndex(blockIndexA);\r\n    const iB = this.blockIndexToDoubleIndex(blockIndexB);\r\n    let a = 0;\r\n    const data = this._data;\r\n    for (let i = iBegin; i < iEnd; i++) {\r\n      a = data[iA + i] - data[iB + i];\r\n      dd += a * a;\r\n    }\r\n    return Math.sqrt(dd);\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"GrowableBlockedArray.js","sourceRoot":"","sources":["../../../src/geometry3d/GrowableBlockedArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAIH;;;;GAIG;AACH,MAAM,OAAO,oBAAoB;IAc/B;;;;;;;OAOG;IACH,YAAmB,SAAiB,EAAE,gBAAwB,CAAC,EAAE,YAAqB;QACpF,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,SAAS,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAChB,IAAI,CAAC,UAAU,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,CAAC,SAAS,KAAK,YAAY,IAAI,YAAY,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,CAAC;IAED;;;;;OAKG;IACO,QAAQ,CAAC,MAA+B,EAAE,WAAoB,EAAE,UAAmB;QAC3F,qDAAqD;QACrD,IAAI,QAAQ,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9E,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAC/B,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,GAAG,CAAC,SAAS,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAC3F,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM;gBACzB,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC1B,IAAI,QAAQ,GAAG,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;gBACxC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC;YACzC,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,KAAK,CAAC;gBAClC,OAAO,IAAI,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC;SACzC;QACD,IAAI,OAAO,IAAI,CAAC;YACd,OAAO,EAAC,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAC,CAAC;QAC/B,IAAI,OAAO,KAAK,MAAM,CAAC,MAAM;YAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;aAC9B,IAAI,MAAM,YAAY,YAAY;YACrC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;;YAEtD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC;QACrD,OAAO,EAAC,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAC,CAAC;IAClF,CAAC;IAED;;;OAGG;IACI,KAAK;QACV,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QACjG,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/C,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,yDAAyD;IACzD,IAAW,MAAM,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACnD,yDAAyD;IACzD,IAAW,SAAS,KAAa,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACtD,gDAAgD;IAChD,IAAW,WAAW,KAAa,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC5D;;;;OAIG;IACI,cAAc,CAAC,UAAkB,EAAE,gBAAwB;QAChE,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC,CAAC;IACrE,CAAC;IACD,uEAAuE;IAChE,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACnC,kDAAkD;IAC3C,aAAa;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;IAC7C,CAAC;IACD,+CAA+C;IACxC,mBAAmB,CAAC,aAAqB,EAAE,oBAA6B,IAAI;QACjF,IAAI,aAAa,GAAG,IAAI,CAAC,aAAa,EAAE,EAAE;YACxC,IAAI,iBAAiB;gBACnB,aAAa,IAAI,IAAI,CAAC,aAAa,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,CAAC,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/D,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;SACpC;IACL,CAAC;IACD;;;OAGG;IACI,QAAQ,CAAC,OAAiB;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QAChC,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU;YAC5B,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE;YAC/B,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;OAMG;IACO,aAAa;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;YACjC,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE;YAClD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,qCAAqC;IAC9B,QAAQ;QACb,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;IACD,gFAAgF;IACtE,uBAAuB,CAAC,UAAkB,IAAI,OAAO,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC;IAC9F,wHAAwH;IACjH,gBAAgB,CAAC,UAAkB,EAAE,cAAsB;QAChE,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,IAAI,UAAU,GAAG,CAAC,IAAI,cAAc,GAAG,CAAC,IAAI,cAAc,IAAI,IAAI,CAAC,UAAU;YACxG,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACnE,CAAC;IACD,oFAAoF;IAC7E,SAAS,CAAC,UAAkB,EAAE,cAAsB;QACzD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,GAAG,cAAc,CAAC,CAAC;IACnE,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,mBAAmB,CAAC,IAAkB,EAAE,SAAiB,EAAE,EAAU,EAAE,EAAU;QAC7F,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;YAClC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAClB,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAClB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC;YACtB,IAAI,EAAE,GAAG,EAAE;gBAAE,OAAO,CAAC,CAAC,CAAC;SACxB;QACD,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,wDAAwD;IAC1E,CAAC;IACD,+EAA+E;IACxE,kBAAkB,CAAC,gBAAyC,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,oBAAoB,CAAC,mBAAmB,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;QAC/J,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,sBAAsB;QACtB,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,CAAC,IAAI,CACT,CAAC,WAAmB,EAAE,WAAmB,EAAE,EAAE;YAC3C,gBAAgB;YAChB,OAAO,aAAa,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,GAAG,SAAS,EAAE,WAAW,GAAG,SAAS,CAAC,CAAC;QAC1F,CAAC,CAAC,CAAC;QACL,+BAA+B;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,qFAAqF;IAC9E,qBAAqB,CAAC,WAAmB,EAAE,WAAmB;QACnE,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,IAAI,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;YACxC,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;IAED,2HAA2H;IACpH,wBAAwB,CAAC,WAAmB,EAAE,WAAmB,EAAE,MAAc,EAAE,IAAY;QACpG,IAAI,EAAE,GAAG,GAAG,CAAC;QACb,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACrD,MAAM,EAAE,GAAG,IAAI,CAAC,uBAAuB,CAAC,WAAW,CAAC,CAAC;QACrD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAClC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAChC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;SACb;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module ArraysAndInterfaces\n */\n\nimport { BlockComparisonFunction } from \"./GrowableFloat64Array\";\n\n/**\n * Array of contiguous doubles, indexed by block number and index within block.\n * * This is essentially a rectangular matrix (two dimensional array), with each block being a row of the matrix.\n * @public\n */\nexport class GrowableBlockedArray {\n  /** underlying contiguous, oversized buffer. */\n  protected _data: Float64Array;\n  /** Number of blocks (matrix rows) in use. */\n  protected _inUse: number;\n  /** number of numbers per block in the array.\n   * * If viewing the array as a two dimensional array, this is the row size.\n   */\n  protected _blockSize: number;  // positive integer !!!\n  /**\n   * multiplier used by ensureBlockCapacity to expand requested reallocation size\n   */\n  protected _growthFactor: number;\n\n  /**\n   * Construct an array whose contents are in blocked (row-major) order, possibly with extra capacity.\n   * * Total capacity is `this._data.length`\n   * * Actual in-use count is `this._inUse * this._blockSize`\n   * @param blockSize number of entries in each block, i.e., row size\n   * @param initialBlocks initial capacity in blocks (default 8)\n   * @param growthFactor used by ensureBlockCapacity to expand requested reallocation size (default 1.5)\n   */\n  public constructor(blockSize: number, initialBlocks: number = 8, growthFactor?: number) {\n    this._data = new Float64Array(initialBlocks * blockSize);\n    this._inUse = 0;\n    this._blockSize = blockSize > 0 ? blockSize : 1;\n    this._growthFactor = (undefined !== growthFactor && growthFactor >= 1.0) ? growthFactor : 1.5;\n  }\n\n  /** Copy data from source array. Does not reallocate or change active block count.\n   * @param source array to copy from\n   * @param sourceCount copy the first sourceCount blocks; all blocks if undefined\n   * @param destOffset copy to instance array starting at this block index; zero if undefined\n   * @return count and offset of blocks copied\n   */\n  protected copyData(source: Float64Array | number[], sourceCount?: number, destOffset?: number): {count: number, offset: number} {\n    // validate inputs and convert from blocks to entries\n    let myOffset = (undefined !== destOffset) ? destOffset * this.numPerBlock : 0;\n    if (myOffset < 0)\n      myOffset = 0;\n    if (myOffset >= this._data.length)\n      return {count: 0, offset: 0};\n    let myCount = (undefined !== sourceCount) ? sourceCount * this.numPerBlock : source.length;\n    if (myCount > 0) {\n      if (myCount > source.length)\n        myCount = source.length;\n      if (myOffset + myCount > this._data.length)\n        myCount = this._data.length - myOffset;\n      if (myCount % this.numPerBlock !== 0)\n        myCount -= myCount % this.numPerBlock;\n    }\n    if (myCount <= 0)\n      return {count: 0, offset: 0};\n    if (myCount === source.length)\n      this._data.set(source, myOffset);\n    else if (source instanceof Float64Array)\n      this._data.set(source.subarray(0, myCount), myOffset);\n    else\n      this._data.set(source.slice(0, myCount), myOffset);\n    return {count: myCount / this.numPerBlock, offset: myOffset / this.numPerBlock};\n  }\n\n  /**\n   * Make a copy of the (active) blocks in this array.\n   * (The clone does NOT get excess capacity)\n   */\n  public clone(): GrowableBlockedArray {\n    const newBlocks = new GrowableBlockedArray(this.numPerBlock, this.numBlocks, this._growthFactor);\n    newBlocks.copyData(this._data, this.numBlocks);\n    newBlocks._inUse = this.numBlocks;\n    return newBlocks;\n  }\n\n  /** computed property: length (in blocks, not doubles) */\n  public get length(): number { return this._inUse; }\n  /** computed property: length (in blocks, not doubles) */\n  public get numBlocks(): number { return this._inUse; }\n  /** property: number of data values per block */\n  public get numPerBlock(): number { return this._blockSize; }\n  /**\n   * Return a single value indexed within a block. Indices are unchecked.\n   * @param blockIndex index of block to read\n   * @param indexInBlock  offset within the block\n   */\n  public getWithinBlock(blockIndex: number, indexWithinBlock: number): number {\n    return this._data[blockIndex * this._blockSize + indexWithinBlock];\n  }\n  /** clear the block count to zero, but maintain the allocated memory */\n  public clear() { this._inUse = 0; }\n  /** Return the capacity in blocks (not doubles) */\n  public blockCapacity() {\n    return this._data.length / this._blockSize;\n  }\n  /** ensure capacity (in blocks, not doubles) */\n  public ensureBlockCapacity(blockCapacity: number, applyGrowthFactor: boolean = true) {\n    if (blockCapacity > this.blockCapacity()) {\n      if (applyGrowthFactor)\n        blockCapacity *= this._growthFactor;\n      const prevData = this._data;\n      this._data = new Float64Array(blockCapacity * this._blockSize);\n      this.copyData(prevData, this._inUse);\n      }\n  }\n  /** Add a new block of data.\n   * * If newData has fewer than numPerBlock entries, the remaining part of the new block is zeros.\n   * * If newData has more entries, only the first numPerBlock are taken.\n   */\n  public addBlock(newData: number[]) {\n    const k0 = this.newBlockIndex();\n    let numValue = newData.length;\n    if (numValue > this._blockSize)\n      numValue = this._blockSize;\n    for (let i = 0; i < numValue; i++)\n      this._data[k0 + i] = newData[i];\n  }\n  /**\n   * Return the starting index of a block of (zero-initialized) doubles at the end.\n   *\n   * * this.data is reallocated if needed to include the new block.\n   * * The inUse count is incremented to include the new block.\n   * * The returned block is an index to the Float64Array (not a block index)\n   */\n  protected newBlockIndex(): number {\n    const index = this._blockSize * this._inUse;\n    if ((index + 1) > this._data.length)\n      this.ensureBlockCapacity(1 + this._inUse);\n    this._inUse++;\n    for (let i = index; i < index + this._blockSize; i++)\n      this._data[i] = 0.0;\n    return index;\n  }\n  /** reduce the block count by one. */\n  public popBlock() {\n    if (this._inUse > 0)\n      this._inUse--;\n  }\n  /** convert a block index to the simple index to the underlying Float64Array. */\n  protected blockIndexToDoubleIndex(blockIndex: number) { return this._blockSize * blockIndex; }\n  /** Access a single double at offset within a block, with index checking and return undefined if indexing is invalid. */\n  public checkedComponent(blockIndex: number, componentIndex: number): number | undefined {\n    if (blockIndex >= this._inUse || blockIndex < 0 || componentIndex < 0 || componentIndex >= this._blockSize)\n      return undefined;\n    return this._data[this._blockSize * blockIndex + componentIndex];\n  }\n  /** Access a single double at offset within a block.  This has no index checking. */\n  public component(blockIndex: number, componentIndex: number): number {\n    return this._data[this._blockSize * blockIndex + componentIndex];\n  }\n  /** compare two blocks in simple lexical order.\n   * @param data data array\n   * @param blockSize number of items to compare\n   * @param ia raw index (not block index) of first block\n   * @param ib raw index (not block index) of second block\n   */\n  public static compareLexicalBlock(data: Float64Array, blockSize: number, ia: number, ib: number): number {\n    let ax = 0;\n    let bx = 0;\n    for (let i = 0; i < blockSize; i++) {\n      ax = data[ia + i];\n      bx = data[ib + i];\n      if (ax > bx) return 1;\n      if (ax < bx) return -1;\n    }\n    return ia - ib; // so original order is maintained among duplicates !!!!\n  }\n  /** Return an array of block indices sorted per compareLexicalBlock function */\n  public sortIndicesLexical(compareBlocks: BlockComparisonFunction = (dataArray, size, iA, iB) => GrowableBlockedArray.compareLexicalBlock(dataArray, size, iA, iB)): Uint32Array {\n    const n = this._inUse;\n    // let numCompare = 0;\n    const result = new Uint32Array(n);\n    const data = this._data;\n    const blockSize = this._blockSize;\n    for (let i = 0; i < n; i++)result[i] = i;\n    result.sort(\n      (blockIndexA: number, blockIndexB: number) => {\n        // numCompare++;\n        return compareBlocks(data, blockSize, blockIndexA * blockSize, blockIndexB * blockSize);\n      });\n    // console.log (n, numCompare);\n    return result;\n  }\n  /** Return the distance (hypotenuse=sqrt(summed squares)) between indicated blocks */\n  public distanceBetweenBlocks(blockIndexA: number, blockIndexB: number): number {\n    let dd = 0.0;\n    let iA = this.blockIndexToDoubleIndex(blockIndexA);\n    let iB = this.blockIndexToDoubleIndex(blockIndexB);\n    let a = 0;\n    const data = this._data;\n    for (let i = 0; i < this._blockSize; i++) {\n      a = data[iA++] - data[iB++];\n      dd += a * a;\n    }\n    return Math.sqrt(dd);\n  }\n\n  /** Return the distance (hypotenuse=sqrt(summed squares)) between block entries `iBegin <= i < iEnd` of indicated blocks */\n  public distanceBetweenSubBlocks(blockIndexA: number, blockIndexB: number, iBegin: number, iEnd: number): number {\n    let dd = 0.0;\n    const iA = this.blockIndexToDoubleIndex(blockIndexA);\n    const iB = this.blockIndexToDoubleIndex(blockIndexB);\n    let a = 0;\n    const data = this._data;\n    for (let i = iBegin; i < iEnd; i++) {\n      a = data[iA + i] - data[iB + i];\n      dd += a * a;\n    }\n    return Math.sqrt(dd);\n  }\n}\n"]}