@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

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

@@ -0,0 +1,62 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
+import { BagOfCurves, CurveChain, CurveCollection } from "../CurveCollection";
+import { RecursiveCurveProcessorWithStack } from "../CurveProcessor";
+/**
+ * Algorithmic class for cloning curve collections.
+ * * recurse through collection nodes, building image nodes as needed and inserting clones of children.
+ * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent
+ */
+export class CloneCurvesContext extends RecursiveCurveProcessorWithStack {
+    constructor(transform) {
+        super();
+        this._transform = transform;
+        this._result = undefined;
+    }
+    static clone(target, transform) {
+        const context = new CloneCurvesContext(transform);
+        target.announceToCurveProcessor(context);
+        return context._result;
+    }
+    enter(c) {
+        if (c instanceof CurveCollection)
+            super.enter(c.cloneEmptyPeer());
+    }
+    leave() {
+        const result = super.leave();
+        if (result) {
+            if (this._stack.length === 0) // this should only happen once !!!
+                this._result = result;
+            else // push this result to top of stack.
+                this._stack[this._stack.length - 1].tryAddChild(result);
+        }
+        return result;
+    }
+    // specialized clone methods override this (and allow announceCurvePrimitive to insert to parent)
+    doClone(primitive) {
+        if (this._transform)
+            return primitive.cloneTransformed(this._transform);
+        return primitive.clone();
+    }
+    announceCurvePrimitive(primitive, _indexInParent) {
+        const c = this.doClone(primitive);
+        if (c !== undefined && this._stack.length > 0) {
+            const parent = this._stack[this._stack.length - 1];
+            if (parent instanceof CurveChain || parent instanceof BagOfCurves)
+                if (Array.isArray(c)) {
+                    for (const c1 of c) {
+                        parent.tryAddChild(c1);
+                    }
+                }
+                else {
+                    parent.tryAddChild(c);
+                }
+        }
+    }
+}
+//# sourceMappingURL=CloneCurvesContext.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CloneCurvesContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneCurvesContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAE9E,OAAO,EAAE,gCAAgC,EAAE,MAAM,mBAAmB,CAAC;AAErE;;;;GAIG;AACH,MAAM,OAAO,kBAAmB,SAAQ,gCAAgC;IAGtE,YAAsB,SAAqB;QACzC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;IAC3B,CAAC;IACM,MAAM,CAAC,KAAK,CAAC,MAAuB,EAAE,SAAqB;QAChE,MAAM,OAAO,GAAG,IAAI,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAClD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,OAAO,CAAC;IACzB,CAAC;IACe,KAAK,CAAC,CAAkB;QACtC,IAAI,CAAC,YAAY,eAAe;YAC9B,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,EAAE,CAAC,CAAC;IACpC,CAAC;IACe,KAAK;QACnB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,MAAM,EAAE;YACV,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,mCAAmC;gBAC/D,IAAI,CAAC,OAAO,GAAG,MAAqB,CAAC;iBAClC,oCAAoC;gBACvC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;SAC3D;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,iGAAiG;IACvF,OAAO,CAAC,SAAyB;QACzC,IAAI,IAAI,CAAC,UAAU;YACjB,OAAO,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,UAAU,CAAmB,CAAC;QACvE,OAAO,SAAS,CAAC,KAAK,EAAoB,CAAC;IAC7C,CAAC;IACe,sBAAsB,CAAC,SAAyB,EAAE,cAAsB;QACtF,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAClC,IAAI,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,YAAY,UAAU,IAAI,MAAM,YAAY,WAAW;gBAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;oBACpB,KAAK,MAAM,EAAE,IAAI,CAAC,EAAE;wBAClB,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;qBACxB;iBACF;qBAAM;oBACL,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;iBACvB;SACJ;IACH,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 Curve\r\n */\r\n\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { BagOfCurves, CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\n\r\n/**\r\n * Algorithmic class for cloning curve collections.\r\n * * recurse through collection nodes, building image nodes as needed and inserting clones of children.\r\n * * for individual primitive, invoke doClone (protected) for direct clone; insert into parent\r\n */\r\nexport class CloneCurvesContext extends RecursiveCurveProcessorWithStack {\r\n  protected _result: CurveCollection | undefined;\r\n  private _transform: Transform | undefined;\r\n  protected constructor(transform?: Transform) {\r\n    super();\r\n    this._transform = transform;\r\n    this._result = undefined;\r\n  }\r\n  public static clone(target: CurveCollection, transform?: Transform): CurveCollection | undefined {\r\n    const context = new CloneCurvesContext(transform);\r\n    target.announceToCurveProcessor(context);\r\n    return context._result;\r\n  }\r\n  public override enter(c: CurveCollection) {\r\n    if (c instanceof CurveCollection)\r\n      super.enter(c.cloneEmptyPeer());\r\n  }\r\n  public override leave(): CurveCollection | undefined {\r\n    const result = super.leave();\r\n    if (result) {\r\n      if (this._stack.length === 0) // this should only happen once !!!\r\n        this._result = result as BagOfCurves;\r\n      else // push this result to top of stack.\r\n        this._stack[this._stack.length - 1].tryAddChild(result);\r\n    }\r\n    return result;\r\n  }\r\n  // specialized clone methods override this (and allow announceCurvePrimitive to insert to parent)\r\n  protected doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    if (this._transform)\r\n      return primitive.cloneTransformed(this._transform) as CurvePrimitive;\r\n    return primitive.clone() as CurvePrimitive;\r\n  }\r\n  public override announceCurvePrimitive(primitive: CurvePrimitive, _indexInParent: number): void {\r\n    const c = this.doClone(primitive);\r\n    if (c !== undefined && this._stack.length > 0) {\r\n      const parent = this._stack[this._stack.length - 1];\r\n      if (parent instanceof CurveChain || parent instanceof BagOfCurves)\r\n        if (Array.isArray(c)) {\r\n          for (const c1 of c) {\r\n            parent.tryAddChild(c1);\r\n          }\r\n        } else {\r\n          parent.tryAddChild(c);\r\n        }\r\n    }\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,16 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { CurveCollection } from "../CurveCollection";
+import { CurvePrimitive } from "../CurvePrimitive";
+import { CloneCurvesContext } from "./CloneCurvesContext";
+/**
+ * Algorithmic class for cloning with linestrings expanded to line segments
+ * @internal
+ */
+export declare class CloneWithExpandedLineStrings extends CloneCurvesContext {
+    constructor();
+    protected doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] | undefined;
+    static clone(target: CurveCollection): CurveCollection | undefined;
+}
+//# sourceMappingURL=CloneWithExpandedLineStrings.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CloneWithExpandedLineStrings.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneWithExpandedLineStrings.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAGnD,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D;;;GAGG;AACH,qBAAa,4BAA6B,SAAQ,kBAAkB;;cAM/C,OAAO,CAAC,SAAS,EAAE,cAAc,GAAG,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;WAY7E,KAAK,CAAC,MAAM,EAAE,eAAe,GAAG,eAAe,GAAG,SAAS;CAKnF"}

package/lib/esm/curve/internalContexts/CloneWithExpandedLineStrings.js

@@ -0,0 +1,36 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { LineSegment3d } from "../LineSegment3d";
+import { LineString3d } from "../LineString3d";
+import { CloneCurvesContext } from "./CloneCurvesContext";
+/**
+ * Algorithmic class for cloning with linestrings expanded to line segments
+ * @internal
+ */
+export class CloneWithExpandedLineStrings extends CloneCurvesContext {
+    constructor() {
+        // we have no transform ....
+        super(undefined);
+    }
+    // We know we have no transform !!!
+    doClone(primitive) {
+        if (primitive instanceof LineString3d && primitive.numPoints() > 1) {
+            const packedPoints = primitive.packedPoints;
+            const n = packedPoints.length;
+            const segments = [];
+            for (let i = 0; i + 1 < n; i++) {
+                segments.push(LineSegment3d.createCapture(packedPoints.getPoint3dAtUncheckedPointIndex(i), packedPoints.getPoint3dAtUncheckedPointIndex(i + 1)));
+            }
+            return segments;
+        }
+        return primitive.clone();
+    }
+    static clone(target) {
+        const context = new CloneWithExpandedLineStrings();
+        target.announceToCurveProcessor(context);
+        return context._result;
+    }
+}
+//# sourceMappingURL=CloneWithExpandedLineStrings.js.map

package/lib/esm/curve/internalContexts/CloneWithExpandedLineStrings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CloneWithExpandedLineStrings.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CloneWithExpandedLineStrings.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAQ/F,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAE1D;;;GAGG;AACH,MAAM,OAAO,4BAA6B,SAAQ,kBAAkB;IAClE;QACE,4BAA4B;QAC5B,KAAK,CAAC,SAAS,CAAC,CAAC;IACnB,CAAC;IACD,mCAAmC;IAChB,OAAO,CAAC,SAAyB;QAClD,IAAI,SAAS,YAAY,YAAY,IAAI,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,EAAE;YAClE,MAAM,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC;YAC5C,MAAM,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC;YAC9B,MAAM,QAAQ,GAAG,EAAE,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC9B,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC,YAAY,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,+BAA+B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAClJ;YACD,OAAO,QAAQ,CAAC;SACjB;QACD,OAAO,SAAS,CAAC,KAAK,EAAoB,CAAC;IAC7C,CAAC;IACM,MAAM,CAAU,KAAK,CAAC,MAAuB;QAClD,MAAM,OAAO,GAAG,IAAI,4BAA4B,EAAE,CAAC;QACnD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,OAAO,CAAC;IACzB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { CloneCurvesContext } from \"./CloneCurvesContext\";\r\n\r\n/**\r\n * Algorithmic class for cloning with linestrings expanded to line segments\r\n * @internal\r\n */\r\nexport class CloneWithExpandedLineStrings extends CloneCurvesContext {\r\n  public constructor() {\r\n    // we have no transform ....\r\n    super(undefined);\r\n  }\r\n  // We know we have no transform !!!\r\n  protected override doClone(primitive: CurvePrimitive): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    if (primitive instanceof LineString3d && primitive.numPoints() > 1) {\r\n      const packedPoints = primitive.packedPoints;\r\n      const n = packedPoints.length;\r\n      const segments = [];\r\n      for (let i = 0; i + 1 < n; i++) {\r\n        segments.push(LineSegment3d.createCapture(packedPoints.getPoint3dAtUncheckedPointIndex(i), packedPoints.getPoint3dAtUncheckedPointIndex(i + 1)));\r\n      }\r\n      return segments;\r\n    }\r\n    return primitive.clone() as CurvePrimitive;\r\n  }\r\n  public static override clone(target: CurveCollection): CurveCollection | undefined {\r\n    const context = new CloneWithExpandedLineStrings();\r\n    target.announceToCurveProcessor(context);\r\n    return context._result;\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,18 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { CurveCollection } from "../CurveCollection";
+import { CurvePrimitive } from "../CurvePrimitive";
+import { RecursiveCurveProcessorWithStack } from "../CurveProcessor";
+/** Algorithmic class: Count LineSegment3d and LineString3d primitives.
+ * @internal
+ */
+export declare class CountLinearPartsSearchContext extends RecursiveCurveProcessorWithStack {
+    numLineSegment: number;
+    numLineString: number;
+    numOther: number;
+    constructor();
+    static hasNonLinearPrimitives(target: CurveCollection): boolean;
+    announceCurvePrimitive(curve: CurvePrimitive, _indexInParent: number): void;
+}
+//# sourceMappingURL=CountLinearPartsSearchContext.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CountLinearPartsSearchContext.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CountLinearPartsSearchContext.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACrD,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,gCAAgC,EAAE,MAAM,mBAAmB,CAAC;AAIrE;;GAEG;AACH,qBAAa,6BAA8B,SAAQ,gCAAgC;IAC1E,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,MAAM,CAAC;;WAOV,sBAAsB,CAAC,MAAM,EAAE,eAAe,GAAG,OAAO;IAKtD,sBAAsB,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,GAAG,IAAI;CAQ5F"}

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

@@ -0,0 +1,32 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { RecursiveCurveProcessorWithStack } from "../CurveProcessor";
+import { LineSegment3d } from "../LineSegment3d";
+import { LineString3d } from "../LineString3d";
+/** Algorithmic class: Count LineSegment3d and LineString3d primitives.
+ * @internal
+ */
+export class CountLinearPartsSearchContext extends RecursiveCurveProcessorWithStack {
+    constructor() {
+        super();
+        this.numLineSegment = 0;
+        this.numLineString = 0;
+        this.numOther = 0;
+    }
+    static hasNonLinearPrimitives(target) {
+        const context = new CountLinearPartsSearchContext();
+        target.announceToCurveProcessor(context);
+        return context.numOther > 0;
+    }
+    announceCurvePrimitive(curve, _indexInParent) {
+        if (curve instanceof LineSegment3d)
+            this.numLineSegment++;
+        else if (curve instanceof LineString3d)
+            this.numLineString++;
+        else
+            this.numOther++;
+    }
+}
+//# sourceMappingURL=CountLinearPartsSearchContext.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"CountLinearPartsSearchContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/CountLinearPartsSearchContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAO/F,OAAO,EAAE,gCAAgC,EAAE,MAAM,mBAAmB,CAAC;AACrE,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C;;GAEG;AACH,MAAM,OAAO,6BAA8B,SAAQ,gCAAgC;IAIjF;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IACpB,CAAC;IACM,MAAM,CAAC,sBAAsB,CAAC,MAAuB;QAC1D,MAAM,OAAO,GAAG,IAAI,6BAA6B,EAAE,CAAC;QACpD,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAC;IAC9B,CAAC;IACe,sBAAsB,CAAC,KAAqB,EAAE,cAAsB;QAClF,IAAI,KAAK,YAAY,aAAa;YAChC,IAAI,CAAC,cAAc,EAAE,CAAC;aACnB,IAAI,KAAK,YAAY,YAAY;YACpC,IAAI,CAAC,aAAa,EAAE,CAAC;;YAErB,IAAI,CAAC,QAAQ,EAAE,CAAC;IACpB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\n\r\n/** Algorithmic class: Count LineSegment3d and LineString3d primitives.\r\n * @internal\r\n */\r\nexport class CountLinearPartsSearchContext extends RecursiveCurveProcessorWithStack {\r\n  public numLineSegment: number;\r\n  public numLineString: number;\r\n  public numOther: number;\r\n  constructor() {\r\n    super();\r\n    this.numLineSegment = 0;\r\n    this.numLineString = 0;\r\n    this.numOther = 0;\r\n  }\r\n  public static hasNonLinearPrimitives(target: CurveCollection): boolean {\r\n    const context = new CountLinearPartsSearchContext();\r\n    target.announceToCurveProcessor(context);\r\n    return context.numOther > 0;\r\n  }\r\n  public override announceCurvePrimitive(curve: CurvePrimitive, _indexInParent: number): void {\r\n    if (curve instanceof LineSegment3d)\r\n      this.numLineSegment++;\r\n    else if (curve instanceof LineString3d)\r\n      this.numLineString++;\r\n    else\r\n      this.numOther++;\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,16 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { CurveCollection } from "../CurveCollection";
+import { CurvePrimitive } from "../CurvePrimitive";
+import { RecursiveCurveProcessorWithStack } from "../CurveProcessor";
+/** Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
+ * @internal
+ */
+export declare class GapSearchContext extends RecursiveCurveProcessorWithStack {
+    maxGap: number;
+    constructor();
+    static maxGap(target: CurveCollection): number;
+    announceCurvePrimitive(curve: CurvePrimitive, _indexInParent: number): void;
+}
+//# sourceMappingURL=GapSearchContext.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GapSearchContext.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/GapSearchContext.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAc,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,gCAAgC,EAAE,MAAM,mBAAmB,CAAC;AAGrE;;GAEG;AACH,qBAAa,gBAAiB,SAAQ,gCAAgC;IAC7D,MAAM,EAAE,MAAM,CAAC;;WAER,MAAM,CAAC,MAAM,EAAE,eAAe,GAAG,MAAM;IAKrC,sBAAsB,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,GAAG,IAAI;CAY5F"}

package/lib/esm/curve/internalContexts/GapSearchContext.js

@@ -0,0 +1,34 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Curve
+ */
+import { CurveChain } from "../CurveCollection";
+import { RecursiveCurveProcessorWithStack } from "../CurveProcessor";
+// import { SumLengthsContext, GapSearchContext, CountLinearPartsSearchContext, CloneCurvesContext, TransformInPlaceContext } from "./CurveSearches";
+/** Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
+ * @internal
+ */
+export class GapSearchContext extends RecursiveCurveProcessorWithStack {
+    constructor() { super(); this.maxGap = 0.0; }
+    static maxGap(target) {
+        const context = new GapSearchContext();
+        target.announceToCurveProcessor(context);
+        return context.maxGap;
+    }
+    announceCurvePrimitive(curve, _indexInParent) {
+        if (this._stack.length > 0) {
+            const parent = this._stack[this._stack.length - 1];
+            if (parent instanceof CurveChain) {
+                const chain = parent;
+                const nextCurve = chain.cyclicCurvePrimitive(_indexInParent + 1);
+                if (curve !== undefined && nextCurve !== undefined) {
+                    this.maxGap = Math.max(this.maxGap, curve.endPoint().distance(nextCurve.startPoint()));
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=GapSearchContext.js.map

package/lib/esm/curve/internalContexts/GapSearchContext.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GapSearchContext.js","sourceRoot":"","sources":["../../../../src/curve/internalContexts/GapSearchContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAE,UAAU,EAAmB,MAAM,oBAAoB,CAAC;AAEjE,OAAO,EAAE,gCAAgC,EAAE,MAAM,mBAAmB,CAAC;AAErE,qJAAqJ;AACrJ;;GAEG;AACH,MAAM,OAAO,gBAAiB,SAAQ,gCAAgC;IAEpE,gBAAgB,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,MAAM,CAAC,MAAuB;QAC1C,MAAM,OAAO,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACvC,MAAM,CAAC,wBAAwB,CAAC,OAAO,CAAC,CAAC;QACzC,OAAO,OAAO,CAAC,MAAM,CAAC;IACxB,CAAC;IACe,sBAAsB,CAAC,KAAqB,EAAE,cAAsB;QAClF,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnD,IAAI,MAAM,YAAY,UAAU,EAAE;gBAChC,MAAM,KAAK,GAAG,MAAM,CAAC;gBACrB,MAAM,SAAS,GAAG,KAAK,CAAC,oBAAoB,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;gBACjE,IAAI,KAAK,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE;oBAClD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;iBACxF;aACF;SACF;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\nimport { CurveChain, CurveCollection } from \"../CurveCollection\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { RecursiveCurveProcessorWithStack } from \"../CurveProcessor\";\r\n\r\n// import { SumLengthsContext, GapSearchContext, CountLinearPartsSearchContext, CloneCurvesContext, TransformInPlaceContext } from \"./CurveSearches\";\r\n/** Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.\r\n * @internal\r\n */\r\nexport class GapSearchContext extends RecursiveCurveProcessorWithStack {\r\n  public maxGap: number;\r\n  constructor() { super(); this.maxGap = 0.0; }\r\n  public static maxGap(target: CurveCollection): number {\r\n    const context = new GapSearchContext();\r\n    target.announceToCurveProcessor(context);\r\n    return context.maxGap;\r\n  }\r\n  public override announceCurvePrimitive(curve: CurvePrimitive, _indexInParent: number): void {\r\n    if (this._stack.length > 0) {\r\n      const parent = this._stack[this._stack.length - 1];\r\n      if (parent instanceof CurveChain) {\r\n        const chain = parent;\r\n        const nextCurve = chain.cyclicCurvePrimitive(_indexInParent + 1);\r\n        if (curve !== undefined && nextCurve !== undefined) {\r\n          this.maxGap = Math.max(this.maxGap, curve.endPoint().distance(nextCurve.startPoint()));\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,114 @@
+import { AnyCurve } from "../../curve/CurveChain";
+import { BagOfCurves } from "../../curve/CurveCollection";
+import { CurvePrimitive } from "../../curve/CurvePrimitive";
+import { GeometryQuery } from "../../curve/GeometryQuery";
+import { Loop } from "../../curve/Loop";
+import { Path } from "../../curve/Path";
+import { ChainTypes } from "../../curve/RegionOps";
+import { Range3d } from "../../geometry3d/Range";
+import { XYAndZ } from "../../geometry3d/XYZProps";
+/**
+ * Manage a growing array of arrays of curve primitives that are to be joined "head to tail" in paths.
+ * * The caller makes a sequence of calls to announce individual primitives.
+ * * This collector (unlike the simpler "ChainCollector") expects to have inputs arriving in random order, leaving multiple open chains in play at any time.
+ *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).
+ * * When all curves have been announced, the call to grab the paths option restructures the various active chains into Path and Loop objects.
+ * * Usage pattern is
+ *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`
+ *   * many times
+ *       * `   context.captureCurve (anyCurve, searchAllPaths)`
+ *       * `   context.captureCurvePrimitive (primitive, searchAllPaths)`
+ *   * end:        ` result = context.grabResults (formLoopsIfClosed)`
+ * @internal
+ */
+export declare class MultiChainCollector {
+    private _chains;
+    private static _staticPointA;
+    private static _staticPointB;
+    /** LOOSE tolerance for snap to end */
+    private _endPointShiftTolerance;
+    /** TIGHT tolerance for snap to end */
+    private _endPointHitTolerance;
+    /** tolerance for choosing Path or Loop.   If undefined, ALWAYS PATH */
+    private _planarityTolerance;
+    /** Initialize with an empty array of chains.
+     * @param endPointShiftTolerance tolerance for calling endpoints identical
+     * @param planeTolerance tolerance for considering a loop to be planar.  If undefined, only create Path.  If defined, create Loop curves are if within tolerance of a plane.
+     */
+    constructor(endPointShiftTolerance?: number, planeTolerance?: number | undefined);
+    private _xyzWork0?;
+    /**
+     * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz
+     * @param xyz
+     * @param tolerance
+     * @param exceptChainIndex index of chain to ignore.  Send -1 to consider all chains.
+     */
+    private findAnyChainToConnect;
+    private _xyzWork1?;
+    /**
+     * Insert a single curve primitive into the active chains.
+     * * The primitive is captured (not cloned)
+     * * The primitive may be reversed in place
+     * @param candidate
+     */
+    captureCurvePrimitive(candidate: CurvePrimitive): void;
+    /**
+     * Insert any curve into the collection.
+     * * This recurses into Path, Loop, BagOfCurves etc
+     * * The all primitives are captured, and may be reversed in place.
+     * @param candidate
+     */
+    captureCurve(candidate: GeometryQuery): void;
+    /** Announce a curve primitive
+     * * If a "nearby" connection is possible, insert the candidate in the chain and force endpoint match.
+     * * Otherwise start a new chain.
+     */
+    private attachPrimitiveToAnyChain;
+    /**
+     * * Move each primitive from chainB to the end of  chainA.
+     * * clear chainB.
+     * * move the final chain to chainB index.
+     * * reduce the _chain.length by 1.
+     */
+    private mergeChainsForwardForward;
+    private reverseChain;
+    private searchAndMergeChainIndex;
+    /** turn an array of curve primitives into the simplest possible strongly typed curve structure.
+     * * The input array is assumed to be connected appropriately to act as the curves of a Path.
+     * * When a path is created the curves array is CAPTURED.
+     */
+    private promoteArrayToCurves;
+    /** Return the collected results, structured as the simplest possible type. */
+    grabResult(makeLoopIfClosed?: boolean): CurvePrimitive | Path | BagOfCurves | Loop | undefined;
+}
+export declare class OffsetHelpers {
+    static sumLengths(data: any): number;
+    static extendRange(range: Range3d, data: any): Range3d;
+    static appendOffsets(data: AnyCurve | AnyCurve[] | undefined, offset: number, result: GeometryQuery[], skipOffsetOfLoop: boolean): number;
+    /**
+     * * Restructure curve fragments as chains and offsets
+     * * Return object with named chains, insideOffsets, outsideOffsets
+     * * BEWARE that if the input is not a loop the classification of outputs is suspect.
+     * @param fragments fragments to be chained
+     * @param offsetDistance offset distance.
+     */
+    static collectInsideAndOutsideOffsets(fragments: GeometryQuery[], offsetDistance: number, gapTolerance: number): {
+        insideOffsets: GeometryQuery[];
+        outsideOffsets: GeometryQuery[];
+        chains: ChainTypes;
+    };
+    /**
+     * * Restructure curve fragments as chains and offsets
+     * * Return object with named chains, insideOffsets, outsideOffsets
+     * * BEWARE that if the input is not a loop the classification of outputs is suspect.
+     * @param fragments fragments to be chained
+     * @param gapTolerance distance to be treated as "effectively zero" when joining head-to-tail.
+     */
+    static collectChains(fragments: GeometryQuery[], gapTolerance: number, planarTolerance?: number): ChainTypes;
+    /** If allowed by the geometry type, move an endpoint.
+     *
+     */
+    static simpleEndPointMove(g: CurvePrimitive, atEnd: boolean, to: XYAndZ): boolean;
+    static moveHeadOrTail(g0: CurvePrimitive, g1: CurvePrimitive, maxShift: number): boolean;
+}
+//# sourceMappingURL=MultiChainCollector.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MultiChainCollector.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAmB,MAAM,6BAA6B,CAAC;AAC3E,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAG1D,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACxC,OAAO,EAAE,UAAU,EAAa,MAAM,uBAAuB,CAAC;AAK9D,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAGnD;;;;;;;;;;;;;GAaG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,OAAO,CAAqB;IAEpC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IAEtC,sCAAsC;IACtC,OAAO,CAAC,uBAAuB,CAAS;IACxC,sCAAsC;IACtC,OAAO,CAAC,qBAAqB,CAAS;IACtC,uEAAuE;IACvE,OAAO,CAAC,mBAAmB,CAAqB;IAChD;;;OAGG;gBACgB,sBAAsB,SAA+B,EAAE,cAAc,GAAE,MAAM,GAAG,SAAwC;IAO3I,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAgB7B,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B;;;;;OAKG;IACI,qBAAqB,CAAC,SAAS,EAAE,cAAc;IAOtD;;;;;OAKG;IACI,YAAY,CAAC,SAAS,EAAE,aAAa;IAU5C;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IA4CjC;;;;;OAKG;IACH,OAAO,CAAC,yBAAyB;IAgBjC,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,wBAAwB;IAuBhC;;;OAGG;IACH,OAAO,CAAC,oBAAoB;IAiC5B,8EAA8E;IACvE,UAAU,CAAC,gBAAgB,GAAE,OAAe,GAAG,cAAc,GAAG,IAAI,GAAG,WAAW,GAAG,IAAI,GAAG,SAAS;CAa7G;AAED,qBAAa,aAAa;WAEV,UAAU,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM;WAa7B,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO;WAa/C,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,EAAE,EAAE,gBAAgB,EAAE,OAAO,GAAG,MAAM;IA4BhJ;;;;;;OAMG;WACW,8BAA8B,CAAC,SAAS,EAAE,aAAa,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,aAAa,EAAE,CAAC;QAAC,cAAc,EAAE,aAAa,EAAE,CAAC;QAAC,MAAM,EAAE,UAAU,CAAA;KAAE;IAgB/M;;;;;;OAMG;WACW,aAAa,CAAC,SAAS,EAAE,aAAa,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,eAAe,GAAE,MAAqC,GAAG,UAAU;IAQjJ;;OAEG;WACW,kBAAkB,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;WAgB1E,cAAc,CAAC,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;CA8BhG"}