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

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

@@ -3,20 +3,19 @@ import { Angle } from "../geometry3d/Angle";
  * Tolerance blob for various stroking methods.
  *
  * * Across many applications, the critical concepts are:   chordTol, angleTol, maxEdgeLength
- * * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.
- * * angle is the angle between two contiguous strokes or across a facet edge.
- * * maxEdgeLength is the length of a stroke or a edge of a facet.
- *
- * It is rare for all three to be active at once:
+ *   * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.
+ *   * angle is the angle between two contiguous strokes or across a facet edge.
+ *   * maxEdgeLength is the length of a stroke or a edge of a facet.
+ * * It is rare for all three to be active at once.
  * * Nearly all stroke and facet use cases will apply an angle tolerance.
- * * * For curves, 15 degrees is typical
- * * * For facets, 22.5 degrees is typical.
- * * * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.
- * * * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.
+ *   * For curves, 15 degrees is typical
+ *   * For facets, 22.5 degrees is typical.
+ *   * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.
+ *   * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.
  * * When creating output for devices such as 3D printing will want a chord tolerance.
  * * For graphics display, use an angle tolerance of around 15 degrees and an chord tolerance which is the size of several pixels.
  * * Analysis meshes (e.g. Finite Elements) commonly need to apply maxEdgeLength.
- * * * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.
+ *   * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.
  * * Facet tolerances are, as the Pirates' Code, guidelines, not absolute rules.   Facet and stroke code may ignore tolerances in awkward situations.
  * * If multiple tolerances are in effect, the actual count will usually be based on the one that demands the most strokes or facets, unless it is so high that it violates some upper limit on the number of facets on an arc or a section of a curve.
  * @public
@@ -28,7 +27,10 @@ export declare class StrokeOptions {
     angleTol?: Angle;
     /** Maximum length of a single stroke. */
     maxEdgeLength?: number;
-    /** Caller expects convex facets.  */
+    /**
+     * Caller expects convex facets.
+     * @deprecated in 4.x - never used. See [[shouldTriangulate]] and [[maximizeConvexFacets]].
+     */
     needConvexFacets?: boolean;
     /** Minimum strokes on a primitive */
     minStrokesPerPrimitive?: number;
@@ -56,6 +58,13 @@ export declare class StrokeOptions {
     get hasChordTol(): boolean;
     /** Ask if maxEdgeLength is specified */
     get hasMaxEdgeLength(): boolean;
+    private _maximizeConvexFacets?;
+    /**
+     * Whether to post-process a planar triangulation by removing edges to maximize the size of convex facets.
+     * * Setting this to true also sets [[shouldTriangulate]] to true.
+     */
+    get maximizeConvexFacets(): boolean;
+    set maximizeConvexFacets(value: boolean);
     /** Return a deep clone  */
     clone(): StrokeOptions;
     /** Return stroke count which is the larger of the minCount or count needed for edge length condition. */

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

@@ -1 +1 @@
-{"version":3,"file":"StrokeOptions.d.ts","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAI5C;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,aAAa;IACxB,8CAA8C;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAC;IACzB,qCAAqC;IAC9B,QAAQ,CAAC,EAAE,KAAK,CAAC;IACxB,yCAAyC;IAClC,aAAa,CAAC,EAAE,MAAM,CAAC;IAC9B,qCAAqC;IAC9B,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAClC,qCAAqC;IAC9B,sBAAsB,CAAC,EAAE,MAAM,CAAC;IACvC,qDAAqD;IAC9C,iBAAiB,EAAE,OAAO,CAAS;IAC1C,OAAO,CAAC,YAAY,CAAC,CAAU;IAC/B,OAAO,CAAC,aAAa,CAAC,CAAU;IAChC,OAAO,CAAC,WAAW,CAAC,CAAU;IAC9B,oCAAoC;IACpC,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD,IAAW,UAAU,CAAC,KAAK,EAAE,OAAO,EAEnC;IACD,oCAAoC;IACpC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,IAAW,WAAW,CAAC,KAAK,EAAE,OAAO,EAEpC;IACD,qCAAqC;IACrC,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD,IAAW,YAAY,CAAC,KAAK,EAAE,OAAO,EAErC;IACD,kCAAkC;IAC3B,UAAU,CAAC,EAAE,OAAO,CAAC;IAC5B,8CAA8C;IACvC,oBAAoB,SAAM;IACjC,mCAAmC;IACnC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,mCAAmC;IACnC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,wCAAwC;IACxC,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD,2BAA2B;IACpB,KAAK,IAAI,aAAa;IAe7B,yGAAyG;IAClG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM;IAOxE;;;;OAIG;IACI,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,GAAG,MAAM;IAGhG;;;OAGG;WACW,aAAa,CACzB,OAAO,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,MAAM,GACtG,MAAM;IAST;;;;;OAKG;WACW,kBAAkB,CAC9B,OAAO,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GACvE,MAAM;IAUT;;;OAGG;IACI,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,GAAE,MAAoB,GAAG,MAAM;IAQvF,4HAA4H;IACrH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAQpF;;;OAGG;IACI,+BAA+B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAQtG,iGAAiG;IAC1F,2BAA2B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAM5D;;;;OAIG;WACW,eAAe,IAAI,aAAa;IAK9C;;;;OAIG;WACW,eAAe,IAAI,aAAa;CAK/C"}
+{"version":3,"file":"StrokeOptions.d.ts","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAI5C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,qBAAa,aAAa;IACxB,8CAA8C;IACvC,QAAQ,CAAC,EAAE,MAAM,CAAC;IACzB,qCAAqC;IAC9B,QAAQ,CAAC,EAAE,KAAK,CAAC;IACxB,yCAAyC;IAClC,aAAa,CAAC,EAAE,MAAM,CAAC;IAC9B;;;OAGG;IACI,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAClC,qCAAqC;IAC9B,sBAAsB,CAAC,EAAE,MAAM,CAAC;IACvC,qDAAqD;IAC9C,iBAAiB,EAAE,OAAO,CAAS;IAC1C,OAAO,CAAC,YAAY,CAAC,CAAU;IAC/B,OAAO,CAAC,aAAa,CAAC,CAAU;IAChC,OAAO,CAAC,WAAW,CAAC,CAAU;IAC9B,oCAAoC;IACpC,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD,IAAW,UAAU,CAAC,KAAK,EAAE,OAAO,EAEnC;IACD,oCAAoC;IACpC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,IAAW,WAAW,CAAC,KAAK,EAAE,OAAO,EAEpC;IACD,qCAAqC;IACrC,IAAW,YAAY,IAAI,OAAO,CAEjC;IACD,IAAW,YAAY,CAAC,KAAK,EAAE,OAAO,EAErC;IACD,kCAAkC;IAC3B,UAAU,CAAC,EAAE,OAAO,CAAC;IAC5B,8CAA8C;IACvC,oBAAoB,SAAM;IACjC,mCAAmC;IACnC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,mCAAmC;IACnC,IAAW,WAAW,IAAI,OAAO,CAEhC;IACD,wCAAwC;IACxC,IAAW,gBAAgB,IAAI,OAAO,CAErC;IACD,OAAO,CAAC,qBAAqB,CAAC,CAAU;IACxC;;;OAGG;IACH,IAAW,oBAAoB,IAAI,OAAO,CAEzC;IACD,IAAW,oBAAoB,CAAC,KAAK,EAAE,OAAO,EAI7C;IACD,2BAA2B;IACpB,KAAK,IAAI,aAAa;IAe7B,yGAAyG;IAClG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM;IAOxE;;;;OAIG;IACI,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,GAAG,MAAM;IAGhG;;;OAGG;WACW,aAAa,CACzB,OAAO,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,MAAM,GACtG,MAAM;IAST;;;;;OAKG;WACW,kBAAkB,CAC9B,OAAO,EAAE,aAAa,GAAG,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GACvE,MAAM;IAUT;;;OAGG;IACI,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,YAAY,GAAE,MAAoB,GAAG,MAAM;IAQvF,4HAA4H;IACrH,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAQpF;;;OAGG;IACI,+BAA+B,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAQtG,iGAAiG;IAC1F,2BAA2B,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAM5D;;;;OAIG;WACW,eAAe,IAAI,aAAa;IAK9C;;;;OAIG;WACW,eAAe,IAAI,aAAa;CAK/C"}

package/lib/cjs/curve/StrokeOptions.js

@@ -15,20 +15,19 @@ const Angle_1 = require("../geometry3d/Angle");
  * Tolerance blob for various stroking methods.
  *
  * * Across many applications, the critical concepts are:   chordTol, angleTol, maxEdgeLength
- * * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.
- * * angle is the angle between two contiguous strokes or across a facet edge.
- * * maxEdgeLength is the length of a stroke or a edge of a facet.
- *
- * It is rare for all three to be active at once:
+ *   * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.
+ *   * angle is the angle between two contiguous strokes or across a facet edge.
+ *   * maxEdgeLength is the length of a stroke or a edge of a facet.
+ * * It is rare for all three to be active at once.
  * * Nearly all stroke and facet use cases will apply an angle tolerance.
- * * * For curves, 15 degrees is typical
- * * * For facets, 22.5 degrees is typical.
- * * * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.
- * * * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.
+ *   * For curves, 15 degrees is typical
+ *   * For facets, 22.5 degrees is typical.
+ *   * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.
+ *   * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.
  * * When creating output for devices such as 3D printing will want a chord tolerance.
  * * For graphics display, use an angle tolerance of around 15 degrees and an chord tolerance which is the size of several pixels.
  * * Analysis meshes (e.g. Finite Elements) commonly need to apply maxEdgeLength.
- * * * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.
+ *   * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.
  * * Facet tolerances are, as the Pirates' Code, guidelines, not absolute rules.   Facet and stroke code may ignore tolerances in awkward situations.
  * * If multiple tolerances are in effect, the actual count will usually be based on the one that demands the most strokes or facets, unless it is so high that it violates some upper limit on the number of facets on an arc or a section of a curve.
  * @public
@@ -73,13 +72,24 @@ class StrokeOptions {
     get hasMaxEdgeLength() {
         return this.maxEdgeLength !== undefined && this.maxEdgeLength > 0.0;
     }
+    /**
+     * Whether to post-process a planar triangulation by removing edges to maximize the size of convex facets.
+     * * Setting this to true also sets [[shouldTriangulate]] to true.
+     */
+    get maximizeConvexFacets() {
+        return this._maximizeConvexFacets ?? false;
+    }
+    set maximizeConvexFacets(value) {
+        this._maximizeConvexFacets = value;
+        if (value)
+            this.shouldTriangulate = value;
+    }
     /** Return a deep clone  */
     clone() {
         const options = new StrokeOptions();
         options.chordTol = this.chordTol;
         options.angleTol = this.angleTol?.clone();
         options.maxEdgeLength = this.maxEdgeLength;
-        options.needConvexFacets = this.needConvexFacets;
         options.minStrokesPerPrimitive = this.minStrokesPerPrimitive;
         options.shouldTriangulate = this.shouldTriangulate;
         options._needNormals = this._needNormals;
@@ -87,6 +97,7 @@ class StrokeOptions {
         options._needParams = this._needParams;
         options.needColors = this.needColors;
         options.defaultCircleStrokes = this.defaultCircleStrokes;
+        options._maximizeConvexFacets = this._maximizeConvexFacets;
         return options;
     }
     /** Return stroke count which is the larger of the minCount or count needed for edge length condition. */

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

@@ -1 +1 @@
-{"version":3,"file":"StrokeOptions.js","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,+CAA4C;AAE5C,mEAAmE;AAEnE;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAa,aAAa;IAA1B;QAWE,qDAAqD;QAC9C,sBAAiB,GAAY,KAAK,CAAC;QA2B1C,8CAA8C;QACvC,yBAAoB,GAAG,EAAE,CAAC;IA0InC,CAAC;IAlKC,oCAAoC;IACpC,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;IACnE,CAAC;IACD,IAAW,UAAU,CAAC,KAAc;QAClC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IACD,oCAAoC;IACpC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;IACrE,CAAC;IACD,IAAW,WAAW,CAAC,KAAc;QACnC,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;IAC5B,CAAC;IACD,qCAAqC;IACrC,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;IACvE,CAAC;IACD,IAAW,YAAY,CAAC,KAAc;QACpC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC;IAC7B,CAAC;IAKD,mCAAmC;IACnC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;IAC9E,CAAC;IACD,mCAAmC;IACnC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IAC5D,CAAC;IACD,wCAAwC;IACxC,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;IACtE,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACjC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC1C,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QACjD,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,sBAAsB,CAAC;QAC7D,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACnD,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACzC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACvC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACrC,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACzD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,yGAAyG;IAClG,kBAAkB,CAAC,QAAgB,EAAE,WAAmB;QAC7D,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG,WAAW,EAAE;YACjG,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC1E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,QAAgB,EAAE,YAAoB,EAAE,kBAA0B;QACrF,OAAO,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,kBAAkB,CAAC,CAAC;IACvF,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CACzB,OAAkC,EAAE,QAAgB,EAAE,YAAoB,EAAE,kBAA2B;QAEvG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACtC,IAAI,WAAW,GAAG,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;QAC1E,IAAI,OAAO,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG;YAC/D,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;QACzC,IAAI,QAAQ,GAAG,WAAW,GAAG,YAAY;YACvC,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;QACrE,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAC9B,OAAkC,EAAE,QAAgB,EAAE,UAAkB;QAExE,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAE,UAAU,CAAC;QAC5B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,OAAO,IAAI,OAAO,CAAC,aAAa,IAAI,OAAO,CAAC,aAAa,GAAG,QAAQ,GAAG,UAAU,EAAE;YACrF,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;SAC5E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,oBAAoB,CAAC,MAAc,EAAE,eAAuB,IAAI,CAAC,EAAE,GAAG,CAAC;QAC5E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QAC1E,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,YAAY,GAAG,MAAM,CAAC,CAAC;QACxE,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,UAAU,CAAC,CAAC;QAC1D,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,4HAA4H;IACrH,aAAa,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QACzE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE;YAClE,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACxB,MAAM,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACxD,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;SACpE;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,+BAA+B,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QAC3F,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,EAAE;YACxC,MAAM,MAAM,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACxE,IAAI,MAAM,KAAK,SAAS;gBACtB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;SAC7D;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,iGAAiG;IAC1F,2BAA2B,CAAC,QAAgB;QACjD,IAAI,IAAI,CAAC,sBAAsB,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC;eACxF,IAAI,CAAC,sBAAsB,GAAG,QAAQ;YACzC,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAlLD,sCAkLC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n\r\n/**\r\n * Tolerance blob for various stroking methods.\r\n *\r\n * * Across many applications, the critical concepts are:   chordTol, angleTol, maxEdgeLength\r\n * * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.\r\n * * angle is the angle between two contiguous strokes or across a facet edge.\r\n * * maxEdgeLength is the length of a stroke or a edge of a facet.\r\n *\r\n * It is rare for all three to be active at once:\r\n * * Nearly all stroke and facet use cases will apply an angle tolerance.\r\n * * * For curves, 15 degrees is typical\r\n * * * For facets, 22.5 degrees is typical.\r\n * * * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.\r\n * * * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.\r\n * * When creating output for devices such as 3D printing will want a chord tolerance.\r\n * * For graphics display, use an angle tolerance of around 15 degrees and an chord tolerance which is the size of several pixels.\r\n * * Analysis meshes (e.g. Finite Elements) commonly need to apply maxEdgeLength.\r\n * * * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.\r\n * * Facet tolerances are, as the Pirates' Code, guidelines, not absolute rules.   Facet and stroke code may ignore tolerances in awkward situations.\r\n * * If multiple tolerances are in effect, the actual count will usually be based on the one that demands the most strokes or facets, unless it is so high that it violates some upper limit on the number of facets on an arc or a section of a curve.\r\n * @public\r\n */\r\nexport class StrokeOptions {\r\n  /** Distance from stroke to actual geometry */\r\n  public chordTol?: number;\r\n  /** Turning angle between strokes. */\r\n  public angleTol?: Angle;\r\n  /** Maximum length of a single stroke. */\r\n  public maxEdgeLength?: number;\r\n  /** Caller expects convex facets.  */\r\n  public needConvexFacets?: boolean;\r\n  /** Minimum strokes on a primitive */\r\n  public minStrokesPerPrimitive?: number;\r\n  /** Whether or not to triangulate each added facet */\r\n  public shouldTriangulate: boolean = false;\r\n  private _needNormals?: boolean;\r\n  private _needTwoSided?: boolean;\r\n  private _needParams?: boolean;\r\n  /** Whether params are requested. */\r\n  public get needParams(): boolean {\r\n    return this._needParams !== undefined ? this._needParams : false;\r\n  }\r\n  public set needParams(value: boolean) {\r\n    this._needParams = value;\r\n  }\r\n  /** Whether normals are requested */\r\n  public get needNormals(): boolean {\r\n    return this._needNormals !== undefined ? this._needNormals : false;\r\n  }\r\n  public set needNormals(value: boolean) {\r\n    this._needNormals = value;\r\n  }\r\n  /** Whether twoSided is requested. */\r\n  public get needTwoSided(): boolean {\r\n    return this._needTwoSided !== undefined ? this._needTwoSided : false;\r\n  }\r\n  public set needTwoSided(value: boolean) {\r\n    this._needTwoSided = value;\r\n  }\r\n  /** Optional color request flag */\r\n  public needColors?: boolean;\r\n  /** Default number of strokes for a circle. */\r\n  public defaultCircleStrokes = 16;\r\n  /** Ask if angleTol is specified */\r\n  public get hasAngleTol(): boolean {\r\n    return this.angleTol !== undefined && Math.abs(this.angleTol.radians) > 0.0;\r\n  }\r\n  /** Ask if chordTol is specified */\r\n  public get hasChordTol(): boolean {\r\n    return this.chordTol !== undefined && this.chordTol > 0.0;\r\n  }\r\n  /** Ask if maxEdgeLength is specified */\r\n  public get hasMaxEdgeLength(): boolean {\r\n    return this.maxEdgeLength !== undefined && this.maxEdgeLength > 0.0;\r\n  }\r\n  /** Return a deep clone  */\r\n  public clone(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.chordTol = this.chordTol;\r\n    options.angleTol = this.angleTol?.clone();\r\n    options.maxEdgeLength = this.maxEdgeLength;\r\n    options.needConvexFacets = this.needConvexFacets;\r\n    options.minStrokesPerPrimitive = this.minStrokesPerPrimitive;\r\n    options.shouldTriangulate = this.shouldTriangulate;\r\n    options._needNormals = this._needNormals;\r\n    options._needTwoSided = this._needTwoSided;\r\n    options._needParams = this._needParams;\r\n    options.needColors = this.needColors;\r\n    options.defaultCircleStrokes = this.defaultCircleStrokes;\r\n    return options;\r\n  }\r\n  /** Return stroke count which is the larger of the minCount or count needed for edge length condition. */\r\n  public applyMaxEdgeLength(minCount: number, totalLength: number): number {\r\n    totalLength = Math.abs(totalLength);\r\n    if (this.maxEdgeLength && this.maxEdgeLength > 0.0 && minCount * this.maxEdgeLength < totalLength) {\r\n      minCount = Geometry.stepCount(this.maxEdgeLength, totalLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of the existing count or count needed for angle condition for given\r\n   * sweepRadians.\r\n   * * defaultStepRadians is assumed to be larger than zero.\r\n   */\r\n  public applyAngleTol(minCount: number, sweepRadians: number, defaultStepRadians: number): number {\r\n    return StrokeOptions.applyAngleTol(this, minCount, sweepRadians, defaultStepRadians);\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of minCount and the count required to turn sweepRadians, using tolerance\r\n   * from the options.\r\n   */\r\n  public static applyAngleTol(\r\n    options: StrokeOptions | undefined, minCount: number, sweepRadians: number, defaultStepRadians?: number,\r\n  ): number {\r\n    sweepRadians = Math.abs(sweepRadians);\r\n    let stepRadians = defaultStepRadians ? defaultStepRadians : Math.PI / 8.0;\r\n    if (options && options.angleTol && options.angleTol.radians > 0.0)\r\n      stepRadians = options.angleTol.radians;\r\n    if (minCount * stepRadians < sweepRadians)\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return the number of strokes needed for given edgeLength curve.\r\n   * @param options\r\n   * @param minCount smallest allowed count\r\n   * @param edgeLength\r\n   */\r\n  public static applyMaxEdgeLength(\r\n    options: StrokeOptions | undefined, minCount: number, edgeLength: number,\r\n  ): number {\r\n    if (edgeLength < 0)\r\n      edgeLength = - edgeLength;\r\n    if (minCount < 1)\r\n      minCount = 1;\r\n    if (options && options.maxEdgeLength && options.maxEdgeLength * minCount < edgeLength) {\r\n      minCount = Geometry.stepCount(options.maxEdgeLength, edgeLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Determine a stroke count for a (partial) circular arc of given radius. This considers angle, maxEdgeLength,\r\n   * chord, and minimum stroke.\r\n   */\r\n  public applyTolerancesToArc(radius: number, sweepRadians: number = Math.PI * 2): number {\r\n    let numStrokes = 1;\r\n    numStrokes = this.applyAngleTol(numStrokes, sweepRadians, Math.PI * 0.25);\r\n    numStrokes = this.applyMaxEdgeLength(numStrokes, sweepRadians * radius);\r\n    numStrokes = this.applyChordTol(numStrokes, radius, sweepRadians);\r\n    numStrokes = this.applyMinStrokesPerPrimitive(numStrokes);\r\n    return numStrokes;\r\n  }\r\n  /** Return stroke count which is the larger of existing count or count needed for circular arc chord tolerance condition. */\r\n  public applyChordTol(minCount: number, radius: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0 && this.chordTol < radius) {\r\n      const a = this.chordTol;\r\n      const stepRadians = 2.0 * Math.acos((1.0 - a / radius));\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of existing count or count needed for circular arc chord tol with given\r\n   * arc length and radians\r\n   */\r\n  public applyChordTolToLengthAndRadians(minCount: number, length: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0) {\r\n      const radius = Geometry.conditionalDivideFraction(length, sweepRadians);\r\n      if (radius !== undefined)\r\n        return this.applyChordTol(minCount, radius, sweepRadians);\r\n    }\r\n    return minCount;\r\n  }\r\n  /** Return stroke count which is the larger of existing count or `this.minStrokesPerPrimitive` */\r\n  public applyMinStrokesPerPrimitive(minCount: number): number {\r\n    if (this.minStrokesPerPrimitive !== undefined && Number.isFinite(this.minStrokesPerPrimitive)\r\n      && this.minStrokesPerPrimitive > minCount)\r\n      minCount = this.minStrokesPerPrimitive;\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Create `StrokeOptions` with defaults appropriate for curves.\r\n   * * angle tolerance of 15 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForCurves(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(15.0);\r\n    return options;\r\n  }\r\n  /**\r\n   * Create `StrokeOptions` with defaults appropriate for surfaces facets\r\n   * * angle tolerance of 22.5 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForFacets(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(22.5);\r\n    return options;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"StrokeOptions.js","sourceRoot":"","sources":["../../../src/curve/StrokeOptions.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,+CAA4C;AAE5C,mEAAmE;AAEnE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAa,aAAa;IAA1B;QAcE,qDAAqD;QAC9C,sBAAiB,GAAY,KAAK,CAAC;QA2B1C,8CAA8C;QACvC,yBAAoB,GAAG,EAAE,CAAC;IAuJnC,CAAC;IA/KC,oCAAoC;IACpC,IAAW,UAAU;QACnB,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC;IACnE,CAAC;IACD,IAAW,UAAU,CAAC,KAAc;QAClC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IACD,oCAAoC;IACpC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;IACrE,CAAC;IACD,IAAW,WAAW,CAAC,KAAc;QACnC,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;IAC5B,CAAC;IACD,qCAAqC;IACrC,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;IACvE,CAAC;IACD,IAAW,YAAY,CAAC,KAAc;QACpC,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC;IAC7B,CAAC;IAKD,mCAAmC;IACnC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;IAC9E,CAAC;IACD,mCAAmC;IACnC,IAAW,WAAW;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IAC5D,CAAC;IACD,wCAAwC;IACxC,IAAW,gBAAgB;QACzB,OAAO,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC;IACtE,CAAC;IAED;;;OAGG;IACH,IAAW,oBAAoB;QAC7B,OAAO,IAAI,CAAC,qBAAqB,IAAI,KAAK,CAAC;IAC7C,CAAC;IACD,IAAW,oBAAoB,CAAC,KAAc;QAC5C,IAAI,CAAC,qBAAqB,GAAG,KAAK,CAAC;QACnC,IAAI,KAAK;YACP,IAAI,CAAC,iBAAiB,GAAG,KAAK,CAAC;IACnC,CAAC;IACD,2BAA2B;IACpB,KAAK;QACV,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QACjC,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC;QAC1C,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,sBAAsB,GAAG,IAAI,CAAC,sBAAsB,CAAC;QAC7D,OAAO,CAAC,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC;QACnD,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;QACzC,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC;QAC3C,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QACvC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACrC,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,CAAC;QACzD,OAAO,CAAC,qBAAqB,GAAG,IAAI,CAAC,qBAAqB,CAAC;QAC3D,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,yGAAyG;IAClG,kBAAkB,CAAC,QAAgB,EAAE,WAAmB;QAC7D,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,GAAG,WAAW,EAAE;YACjG,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;SAC1E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,QAAgB,EAAE,YAAoB,EAAE,kBAA0B;QACrF,OAAO,aAAa,CAAC,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,kBAAkB,CAAC,CAAC;IACvF,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,aAAa,CACzB,OAAkC,EAAE,QAAgB,EAAE,YAAoB,EAAE,kBAA2B;QAEvG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;QACtC,IAAI,WAAW,GAAG,kBAAkB,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;QAC1E,IAAI,OAAO,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG;YAC/D,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC;QACzC,IAAI,QAAQ,GAAG,WAAW,GAAG,YAAY;YACvC,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;QACrE,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAC9B,OAAkC,EAAE,QAAgB,EAAE,UAAkB;QAExE,IAAI,UAAU,GAAG,CAAC;YAChB,UAAU,GAAG,CAAE,UAAU,CAAC;QAC5B,IAAI,QAAQ,GAAG,CAAC;YACd,QAAQ,GAAG,CAAC,CAAC;QACf,IAAI,OAAO,IAAI,OAAO,CAAC,aAAa,IAAI,OAAO,CAAC,aAAa,GAAG,QAAQ,GAAG,UAAU,EAAE;YACrF,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;SAC5E;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,oBAAoB,CAAC,MAAc,EAAE,eAAuB,IAAI,CAAC,EAAE,GAAG,CAAC;QAC5E,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC;QAC1E,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,YAAY,GAAG,MAAM,CAAC,CAAC;QACxE,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;QAClE,UAAU,GAAG,IAAI,CAAC,2BAA2B,CAAC,UAAU,CAAC,CAAC;QAC1D,OAAO,UAAU,CAAC;IACpB,CAAC;IACD,4HAA4H;IACrH,aAAa,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QACzE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,IAAI,IAAI,CAAC,QAAQ,GAAG,MAAM,EAAE;YAClE,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACxB,MAAM,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;YACxD,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;SACpE;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,+BAA+B,CAAC,QAAgB,EAAE,MAAc,EAAE,YAAoB;QAC3F,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,GAAG,EAAE;YACxC,MAAM,MAAM,GAAG,mBAAQ,CAAC,yBAAyB,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;YACxE,IAAI,MAAM,KAAK,SAAS;gBACtB,OAAO,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;SAC7D;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,iGAAiG;IAC1F,2BAA2B,CAAC,QAAgB;QACjD,IAAI,IAAI,CAAC,sBAAsB,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,sBAAsB,CAAC;eACxF,IAAI,CAAC,sBAAsB,GAAG,QAAQ;YACzC,QAAQ,GAAG,IAAI,CAAC,sBAAsB,CAAC;QACzC,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,eAAe;QAC3B,MAAM,OAAO,GAAG,IAAI,aAAa,EAAE,CAAC;QACpC,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC7C,OAAO,OAAO,CAAC;IACjB,CAAC;CACF;AAlMD,sCAkMC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty */\r\n\r\n/**\r\n * Tolerance blob for various stroking methods.\r\n *\r\n * * Across many applications, the critical concepts are:   chordTol, angleTol, maxEdgeLength\r\n *   * Chord error is an distance measured from a curve or facet to its approximating stroke or facet.\r\n *   * angle is the angle between two contiguous strokes or across a facet edge.\r\n *   * maxEdgeLength is the length of a stroke or a edge of a facet.\r\n * * It is rare for all three to be active at once.\r\n * * Nearly all stroke and facet use cases will apply an angle tolerance.\r\n *   * For curves, 15 degrees is typical\r\n *   * For facets, 22.5 degrees is typical.\r\n *   * Halving the angle tolerance will (roughly) make curves get twice as many strokes, and surfaces get 4 times as many facets.\r\n *   * The angle tolerance has the useful property that its effect is independent of scale of that data.  If data is suddenly scaled into millimeters rather than meters, the facet counts remain the same.\r\n * * When creating output for devices such as 3D printing will want a chord tolerance.\r\n * * For graphics display, use an angle tolerance of around 15 degrees and an chord tolerance which is the size of several pixels.\r\n * * Analysis meshes (e.g. Finite Elements) commonly need to apply maxEdgeLength.\r\n *   * Using maxEdgeLength for graphics probably produces too many facets.   For example, it causes long cylinders to get many nearly-square facets instead of the small number of long quads usually used for graphics.\r\n * * Facet tolerances are, as the Pirates' Code, guidelines, not absolute rules.   Facet and stroke code may ignore tolerances in awkward situations.\r\n * * If multiple tolerances are in effect, the actual count will usually be based on the one that demands the most strokes or facets, unless it is so high that it violates some upper limit on the number of facets on an arc or a section of a curve.\r\n * @public\r\n */\r\nexport class StrokeOptions {\r\n  /** Distance from stroke to actual geometry */\r\n  public chordTol?: number;\r\n  /** Turning angle between strokes. */\r\n  public angleTol?: Angle;\r\n  /** Maximum length of a single stroke. */\r\n  public maxEdgeLength?: number;\r\n  /**\r\n   * Caller expects convex facets.\r\n   * @deprecated in 4.x - never used. See [[shouldTriangulate]] and [[maximizeConvexFacets]].\r\n   */\r\n  public needConvexFacets?: boolean;\r\n  /** Minimum strokes on a primitive */\r\n  public minStrokesPerPrimitive?: number;\r\n  /** Whether or not to triangulate each added facet */\r\n  public shouldTriangulate: boolean = false;\r\n  private _needNormals?: boolean;\r\n  private _needTwoSided?: boolean;\r\n  private _needParams?: boolean;\r\n  /** Whether params are requested. */\r\n  public get needParams(): boolean {\r\n    return this._needParams !== undefined ? this._needParams : false;\r\n  }\r\n  public set needParams(value: boolean) {\r\n    this._needParams = value;\r\n  }\r\n  /** Whether normals are requested */\r\n  public get needNormals(): boolean {\r\n    return this._needNormals !== undefined ? this._needNormals : false;\r\n  }\r\n  public set needNormals(value: boolean) {\r\n    this._needNormals = value;\r\n  }\r\n  /** Whether twoSided is requested. */\r\n  public get needTwoSided(): boolean {\r\n    return this._needTwoSided !== undefined ? this._needTwoSided : false;\r\n  }\r\n  public set needTwoSided(value: boolean) {\r\n    this._needTwoSided = value;\r\n  }\r\n  /** Optional color request flag */\r\n  public needColors?: boolean;\r\n  /** Default number of strokes for a circle. */\r\n  public defaultCircleStrokes = 16;\r\n  /** Ask if angleTol is specified */\r\n  public get hasAngleTol(): boolean {\r\n    return this.angleTol !== undefined && Math.abs(this.angleTol.radians) > 0.0;\r\n  }\r\n  /** Ask if chordTol is specified */\r\n  public get hasChordTol(): boolean {\r\n    return this.chordTol !== undefined && this.chordTol > 0.0;\r\n  }\r\n  /** Ask if maxEdgeLength is specified */\r\n  public get hasMaxEdgeLength(): boolean {\r\n    return this.maxEdgeLength !== undefined && this.maxEdgeLength > 0.0;\r\n  }\r\n  private _maximizeConvexFacets?: boolean;\r\n  /**\r\n   * Whether to post-process a planar triangulation by removing edges to maximize the size of convex facets.\r\n   * * Setting this to true also sets [[shouldTriangulate]] to true.\r\n   */\r\n  public get maximizeConvexFacets(): boolean {\r\n    return this._maximizeConvexFacets ?? false;\r\n  }\r\n  public set maximizeConvexFacets(value: boolean) {\r\n    this._maximizeConvexFacets = value;\r\n    if (value)\r\n      this.shouldTriangulate = value;\r\n  }\r\n  /** Return a deep clone  */\r\n  public clone(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.chordTol = this.chordTol;\r\n    options.angleTol = this.angleTol?.clone();\r\n    options.maxEdgeLength = this.maxEdgeLength;\r\n    options.minStrokesPerPrimitive = this.minStrokesPerPrimitive;\r\n    options.shouldTriangulate = this.shouldTriangulate;\r\n    options._needNormals = this._needNormals;\r\n    options._needTwoSided = this._needTwoSided;\r\n    options._needParams = this._needParams;\r\n    options.needColors = this.needColors;\r\n    options.defaultCircleStrokes = this.defaultCircleStrokes;\r\n    options._maximizeConvexFacets = this._maximizeConvexFacets;\r\n    return options;\r\n  }\r\n  /** Return stroke count which is the larger of the minCount or count needed for edge length condition. */\r\n  public applyMaxEdgeLength(minCount: number, totalLength: number): number {\r\n    totalLength = Math.abs(totalLength);\r\n    if (this.maxEdgeLength && this.maxEdgeLength > 0.0 && minCount * this.maxEdgeLength < totalLength) {\r\n      minCount = Geometry.stepCount(this.maxEdgeLength, totalLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of the existing count or count needed for angle condition for given\r\n   * sweepRadians.\r\n   * * defaultStepRadians is assumed to be larger than zero.\r\n   */\r\n  public applyAngleTol(minCount: number, sweepRadians: number, defaultStepRadians: number): number {\r\n    return StrokeOptions.applyAngleTol(this, minCount, sweepRadians, defaultStepRadians);\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of minCount and the count required to turn sweepRadians, using tolerance\r\n   * from the options.\r\n   */\r\n  public static applyAngleTol(\r\n    options: StrokeOptions | undefined, minCount: number, sweepRadians: number, defaultStepRadians?: number,\r\n  ): number {\r\n    sweepRadians = Math.abs(sweepRadians);\r\n    let stepRadians = defaultStepRadians ? defaultStepRadians : Math.PI / 8.0;\r\n    if (options && options.angleTol && options.angleTol.radians > 0.0)\r\n      stepRadians = options.angleTol.radians;\r\n    if (minCount * stepRadians < sweepRadians)\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return the number of strokes needed for given edgeLength curve.\r\n   * @param options\r\n   * @param minCount smallest allowed count\r\n   * @param edgeLength\r\n   */\r\n  public static applyMaxEdgeLength(\r\n    options: StrokeOptions | undefined, minCount: number, edgeLength: number,\r\n  ): number {\r\n    if (edgeLength < 0)\r\n      edgeLength = - edgeLength;\r\n    if (minCount < 1)\r\n      minCount = 1;\r\n    if (options && options.maxEdgeLength && options.maxEdgeLength * minCount < edgeLength) {\r\n      minCount = Geometry.stepCount(options.maxEdgeLength, edgeLength, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Determine a stroke count for a (partial) circular arc of given radius. This considers angle, maxEdgeLength,\r\n   * chord, and minimum stroke.\r\n   */\r\n  public applyTolerancesToArc(radius: number, sweepRadians: number = Math.PI * 2): number {\r\n    let numStrokes = 1;\r\n    numStrokes = this.applyAngleTol(numStrokes, sweepRadians, Math.PI * 0.25);\r\n    numStrokes = this.applyMaxEdgeLength(numStrokes, sweepRadians * radius);\r\n    numStrokes = this.applyChordTol(numStrokes, radius, sweepRadians);\r\n    numStrokes = this.applyMinStrokesPerPrimitive(numStrokes);\r\n    return numStrokes;\r\n  }\r\n  /** Return stroke count which is the larger of existing count or count needed for circular arc chord tolerance condition. */\r\n  public applyChordTol(minCount: number, radius: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0 && this.chordTol < radius) {\r\n      const a = this.chordTol;\r\n      const stepRadians = 2.0 * Math.acos((1.0 - a / radius));\r\n      minCount = Geometry.stepCount(stepRadians, sweepRadians, minCount);\r\n    }\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Return stroke count which is the larger of existing count or count needed for circular arc chord tol with given\r\n   * arc length and radians\r\n   */\r\n  public applyChordTolToLengthAndRadians(minCount: number, length: number, sweepRadians: number): number {\r\n    if (this.chordTol && this.chordTol > 0.0) {\r\n      const radius = Geometry.conditionalDivideFraction(length, sweepRadians);\r\n      if (radius !== undefined)\r\n        return this.applyChordTol(minCount, radius, sweepRadians);\r\n    }\r\n    return minCount;\r\n  }\r\n  /** Return stroke count which is the larger of existing count or `this.minStrokesPerPrimitive` */\r\n  public applyMinStrokesPerPrimitive(minCount: number): number {\r\n    if (this.minStrokesPerPrimitive !== undefined && Number.isFinite(this.minStrokesPerPrimitive)\r\n      && this.minStrokesPerPrimitive > minCount)\r\n      minCount = this.minStrokesPerPrimitive;\r\n    return minCount;\r\n  }\r\n  /**\r\n   * Create `StrokeOptions` with defaults appropriate for curves.\r\n   * * angle tolerance of 15 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForCurves(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(15.0);\r\n    return options;\r\n  }\r\n  /**\r\n   * Create `StrokeOptions` with defaults appropriate for surfaces facets\r\n   * * angle tolerance of 22.5 degrees.\r\n   * * all others inactive.\r\n   */\r\n  public static createForFacets(): StrokeOptions {\r\n    const options = new StrokeOptions();\r\n    options.angleTol = Angle.createDegrees(22.5);\r\n    return options;\r\n  }\r\n}\r\n"]}

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

@@ -2,7 +2,7 @@
  * @module Curve
  */
 import { GeometryHandler } from "../geometry3d/GeometryHandler";
-import { AnyCurve } from "./CurveChain";
+import { AnyCurve } from "./CurveTypes";
 import { CurveCollection } from "./CurveCollection";
 import { RecursiveCurveProcessor } from "./CurveProcessor";
 import { GeometryQuery } from "./GeometryQuery";
@@ -27,7 +27,7 @@ export declare class UnionRegion extends CurveCollection {
     get children(): Array<ParityRegion | Loop>;
     /** Constructor -- initialize with no children */
     constructor();
-    /** Create a `UnionRegion` with given region children */
+    /** Create a `UnionRegion` by capturing the given regions as children. */
     static create(...data: Array<ParityRegion | Loop>): UnionRegion;
     /** Return the boundary type (5) of a corresponding MicroStation CurveVector */
     dgnBoundaryType(): number;
@@ -38,7 +38,7 @@ export declare class UnionRegion extends CurveCollection {
     /** Return new empty `UnionRegion` */
     cloneEmptyPeer(): UnionRegion;
     /**
-     * Try to add a child.
+     * Try to add a child (by capturing it).
      * * Returns false if the `AnyCurve` child is not a region type.
      */
     tryAddChild(child: AnyCurve): boolean;

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

@@ -1 +1 @@
-{"version":3,"file":"UnionRegion.d.ts","sourceRoot":"","sources":["../../../src/curve/UnionRegion.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;GAMG;AACH,qBAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxC,SAAgB,mBAAmB,iBAAiB;IACpD,yCAAyC;IAClC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,oDAAoD;IACpD,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC;IAChD,kCAAkC;IAClC,IAAoB,QAAQ,IAAI,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,CAEzD;IACD,iDAAiD;;IAKjD,wDAAwD;WAC1C,MAAM,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,WAAW;IAOtE,+EAA+E;IACxE,eAAe,IAAI,MAAM;IAGhC,2FAA2F;IACpF,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,uDAAuD;IAChD,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,WAAW;IAUzD,qCAAqC;IAC9B,cAAc,IAAI,WAAW;IAGpC;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAO5C,0CAA0C;IACnC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAK3D,8EAA8E;IACvE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}
+{"version":3,"file":"UnionRegion.d.ts","sourceRoot":"","sources":["../../../src/curve/UnionRegion.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,uBAAuB,EAAE,MAAM,kBAAkB,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAEhD;;;;;;GAMG;AACH,qBAAa,WAAY,SAAQ,eAAe;IAC9C,wCAAwC;IACxC,SAAgB,mBAAmB,iBAAiB;IACpD,yCAAyC;IAClC,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAGzD,oDAAoD;IACpD,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,CAAC;IAChD,kCAAkC;IAClC,IAAoB,QAAQ,IAAI,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,CAEzD;IACD,iDAAiD;;IAKjD,yEAAyE;WAC3D,MAAM,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,WAAW;IAOtE,+EAA+E;IACxE,eAAe,IAAI,MAAM;IAGhC,2FAA2F;IACpF,wBAAwB,CAAC,SAAS,EAAE,uBAAuB,EAAE,aAAa,GAAE,MAAW,GAAG,IAAI;IAGrG,uDAAuD;IAChD,YAAY,CAAC,OAAO,CAAC,EAAE,aAAa,GAAG,WAAW;IAUzD,qCAAqC;IAC9B,cAAc,IAAI,WAAW;IAGpC;;;OAGG;IACI,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAO5C,0CAA0C;IACnC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAK3D,8EAA8E;IACvE,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;CAGhE"}

package/lib/cjs/curve/UnionRegion.js

@@ -31,7 +31,7 @@ class UnionRegion extends CurveCollection_1.CurveCollection {
         this.curveCollectionType = "unionRegion";
         this._children = [];
     }
-    /** Create a `UnionRegion` with given region children */
+    /** Create a `UnionRegion` by capturing the given regions as children. */
     static create(...data) {
         const result = new UnionRegion();
         for (const child of data) {
@@ -63,11 +63,11 @@ class UnionRegion extends CurveCollection_1.CurveCollection {
         return new UnionRegion();
     }
     /**
-     * Try to add a child.
+     * Try to add a child (by capturing it).
      * * Returns false if the `AnyCurve` child is not a region type.
      */
     tryAddChild(child) {
-        if (child && child instanceof ParityRegion_1.ParityRegion || child instanceof Loop_1.Loop) {
+        if (child && (child instanceof ParityRegion_1.ParityRegion || child instanceof Loop_1.Loop)) {
             this._children.push(child);
             return true;
         }

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

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

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

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

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

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