@itwin/core-geometry 5.1.0-dev.4 → 5.1.0-dev.41

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

@@ -23,13 +23,13 @@ import { GraphCheckPointFunction, RegionBinaryOpType } from "./RegionOps";
  * @internal
  */
 declare abstract class RegionOpsFaceToFaceSearchCallbacks {
-    /** Announce a representative node on the outer face of a component */
+    /** Announce a representative node on the outer face of a component. */
     startComponent(_node: HalfEdge): boolean;
-    /** Announce return to outer face */
+    /** Announce return to outer face. */
     finishComponent(_node: HalfEdge): boolean;
-    /** Announce face entry */
+    /** Announce face entry. */
     enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean;
-    /** Announce face exit */
+    /** Announce face exit. */
     leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean;
 }
 /** Function signature ot announce classification of a face.
@@ -45,14 +45,14 @@ type AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceTyp
  */
 export declare class RegionOpsFaceToFaceSearch {
     /**
-     * run a DFS with face-to-face step announcements.
+     * Run a DFS with face-to-face step announcements.
      * * false return from any function terminates search immediately.
      * * all reachable nodes assumed to have both visit masks clear.
      * @param graph containing graph.
      * @param seed first node to visit.
      * @param faceHasBeenVisited mask marking faces that have been seen.
      * @param nodeHasBeenVisited mask marking node-to-node step around face.
-     *
+     * @param callbacks callbacks.
      */
     static faceToFaceSearchFromOuterLoop(_graph: HalfEdgeGraph, seed: HalfEdge, faceHasBeenVisited: HalfEdgeMask, nodeHasBeenVisited: HalfEdgeMask, callbacks: RegionOpsFaceToFaceSearchCallbacks): void;
     /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.
@@ -126,8 +126,7 @@ export declare class RegionGroup {
     /** deep clear of state data -- group header plus all members */
     clearState(): void;
     range(): Range3d;
-    /** Ask if the current _numIn count qualifies as an "in" for this operation type.
-     */
+    /** Ask if the current _numIn count qualifies as an "in" for this operation type. */
     getInOut(): boolean;
     addMember(data: AnyRegion | AnyRegion[] | LineSegment3d | undefined, allowLineSegment?: boolean): void;
     recordMemberStateChange(oldState: number, newState: number): void;
@@ -135,28 +134,29 @@ export declare class RegionGroup {
 /**
  * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.
  * * In the binary operation OP (union, intersection, parity, difference), the left and right operands
- *     are each a composite union, difference, or parity among multiple inputs, i.e.
+ * are each a composite union, difference, or parity among multiple inputs, i.e.,
  *   * (operationA among Ai) OP (operationB among Bi)
  *   * where the Ai are one set of regions, being combined by operationA
- *   * and the Bi are the another set of regions, being combined by operationB
- * * Each group of Ai and Bi is a `RegionGroup`
+ *   * and the Bi are the another set of regions, being combined by operationB.
+ * * Each group of Ai and Bi is a `RegionGroup`.
  * * This is an extremely delicate structure.
  * * Members are public because of the unique variety of queries, but should only be used for queries.
  * * The graph and curves in the booleans are connected by an extended pointer chain:
- *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail
- *    * (CurveLocationDetail).curve points to a curve
- *    * (Curve).parent points to RegionGroupMember
- *    * (RegionGroupMember) points to RegionGroup
- *    * (RegionGroup) points to RegionBooleanBinaryContext
- * * So..when a graph sweep crosses an edge,
- *    * the chain leads to a parity count in the RegionGroupMember
- *    * that can change the number of members active in the RegionGroup
+ *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail.
+ *    * (CurveLocationDetail).curve points to a curve.
+ *    * (Curve).parent points to RegionGroupMember.
+ *    * (RegionGroupMember) points to RegionGroup.
+ *    * (RegionGroup) points to RegionBooleanBinaryContext.
+ * * So when a graph sweep crosses an edge
+ *    * the chain leads to a parity count in the RegionGroupMember.
+ *    * that can change the number of members active in the RegionGroup.
  *    * which can change the state of the context.
  * @internal
  */
 export declare class RegionBooleanContext implements RegionOpsFaceToFaceSearchCallbacks {
     groupA: RegionGroup;
     groupB: RegionGroup;
+    /** bridge edges */
     extraGeometry: RegionGroup;
     graph: HalfEdgeGraph;
     faceAreaFunction: NodeToNumberFunction;
@@ -214,11 +214,12 @@ export declare class RegionBooleanContext implements RegionOpsFaceToFaceSearchCa
      * @param delta
      */
     private recordTransitionAcrossEdge;
-    /** Announce a representative node on the outer face of a component */
+    /** Announce a representative node on the outer face of a component. */
     startComponent(outerFaceNode: HalfEdge): boolean;
-    /** Announce return to outer face */
+    /** Announce return to outer face. */
     finishComponent(_node: HalfEdge): boolean;
-    /** Announce entry to a graph face.
+    /**
+     * Announce entry to a graph face.
      * * Both both sides of a graph edge are from the same RegionGroupMember.
      * * Hence "crossing that edge" changes the parity count for the RegionGroupMember that owns that edge by 1.
      * * The parity count for other RegionGroupMembers are never affected by this crossing.
@@ -229,7 +230,7 @@ export declare class RegionBooleanContext implements RegionOpsFaceToFaceSearchCa
     leaveFace(_facePathStack: HalfEdge[], oldFaceNode: HalfEdge): boolean;
 }
 /**
- * Function to accumulate area under edges
+ * Function to accumulate area under edges.
  * Array of nodes representing faces in a subset of a graph.
  * @internal
  */
@@ -244,14 +245,14 @@ export declare class GraphComponent {
     range: Range2d;
     constructor(faces: HalfEdge[]);
     /**
-     * visit all vertices and edges in the component to build face area array and composite range.
-     *
+     * Visit all vertices and edges in the component to build face area array and composite range.
      * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.
      * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.
      */
     buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined): void;
 }
-/** build and hold an array of component data for a HalfEdgeGraph.
+/**
+ * Build and hold an array of component data for a HalfEdgeGraph.
  * @internal
  */
 export declare class GraphComponentArray {

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

@@ -1 +1 @@
-{"version":3,"file":"RegionOpsClassificationSweeps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAEhF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAGvD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAC;AAOhG,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAGzC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EAAE,uBAAuB,EAAE,kBAAkB,EAAa,MAAM,aAAa,CAAC;AAGrF;;;;;;;;;;;;;;GAcG;AACH,uBAAe,kCAAkC;IAC/C,sEAAsE;IAC/D,cAAc,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAC/C,oCAAoC;IAC7B,eAAe,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAChD,0BAA0B;IACnB,SAAS,CAAC,cAAc,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,QAAQ,GAAG,OAAO;IAC7E,yBAAyB;IAClB,SAAS,CAAC,cAAc,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,QAAQ,GAAG,OAAO;CAC9E;AAKD;;;;;GAKG;AACH,KAAK,sBAAsB,GAAG,CAAC,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC;AAwDrH;;;GAGG;AACH,qBAAa,yBAAyB;IACpC;;;;;;;;;OASG;WACW,6BAA6B,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,QAAQ,EAAE,kBAAkB,EAAE,YAAY,EAAE,kBAAkB,EAAE,YAAY,EAAE,SAAS,EAAE,kCAAkC;IAyDpM;;;;;;;;;;OAUG;WACW,gBAAgB,CAAC,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,kBAAkB,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,KAAK,OAAO,EAAE,eAAe,CAAC,EAAE,uBAAuB,GAAG,aAAa,GAAG,SAAS;IAwCzO;;;;;;;;;;;;;;;OAeG;WACW,qCAAqC,CACjD,KAAK,EAAE,0BAA0B,EAAE,EACnC,GAAG,EAAE,iBAAiB,EACtB,QAAQ,EAAE,kBAAkB,EAC5B,KAAK,EAAE,0BAA0B,EAAE,EACnC,GAAG,EAAE,iBAAiB,EACtB,wBAAwB,EAAE,OAAO,GAChC,aAAa,GAAG,SAAS;CAgC7B;AAED;;;GAGG;AACH,oBAAY,iBAAiB;IAC3B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,WAAW,KAAK;CACjB;AACD;;;;;;GAMG;AACH,cAAM,iBAAiB;IACd,MAAM,EAAE,IAAI,GAAG,YAAY,GAAG,cAAc,GAAG,0BAA0B,CAAC;IAC1E,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,WAAW,CAAC;gBACb,MAAM,EAAE,IAAI,GAAG,YAAY,GAAG,cAAc,GAAG,0BAA0B,EAAE,WAAW,EAAE,WAAW;IAK/G,UAAU;CAClB;AACD;;;;;;;GAOG;AACH,qBAAa,WAAW;IACf,OAAO,EAAE,iBAAiB,EAAE,CAAC;IAC7B,WAAW,EAAE,iBAAiB,CAAC;IAC/B,MAAM,EAAE,oBAAoB,CAAC;IACpC,OAAO,CAAC,MAAM,CAAS;gBACJ,MAAM,EAAE,oBAAoB,EAAE,WAAW,EAAE,iBAAiB;IAM/E,gEAAgE;IACzD,UAAU;IAKV,KAAK,IAAI,OAAO;IAYvB;OACG;IACI,QAAQ,IAAI,OAAO;IAanB,SAAS,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,aAAa,GAAG,SAAS,EAAE,gBAAgB,GAAE,OAAe;IAmBtG,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;CAQlE;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,oBAAqB,YAAW,kCAAkC;IACtE,MAAM,EAAG,WAAW,CAAC;IACrB,MAAM,EAAG,WAAW,CAAC;IACrB,aAAa,EAAG,WAAW,CAAC;IAC5B,KAAK,EAAG,aAAa,CAAC;IACtB,gBAAgB,EAAG,oBAAoB,CAAC;IACxC,QAAQ,EAAE,kBAAkB,CAAC;IAEpC,OAAO;IAMP;;;;;OAKG;WACW,MAAM,CAAC,UAAU,EAAE,iBAAiB,EAAE,UAAU,EAAE,iBAAiB,GAAG,oBAAoB;IAGjG,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAAE,KAAK,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS;IAQxG,OAAO,CAAC,YAAY,CAAC,CAAgB;IACrC,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAsD;IACrF;;;;;;;OAOG;IACI,cAAc;IA8CrB;;;;;;;OAOG;IACI,6BAA6B,CAAC,cAAc,GAAE,MAAqC;IAmB1F,OAAO,CAAC,qBAAqB,CAAC,CAAyB;IACvD;;;;;;;OAOG;IACI,sBAAsB,CAC3B,QAAQ,EAAE,kBAAkB,EAC5B,oBAAoB,CAAC,EAAE,sBAAsB;IA2BxC,qBAAqB,CAAC,IAAI,EAAE,MAAM;IAazC,OAAO,CAAC,QAAQ;IAahB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,0BAA0B;IAyBlC,sEAAsE;IAC/D,cAAc,CAAC,aAAa,EAAE,QAAQ,GAAG,OAAO;IAMvD,oCAAoC;IAC7B,eAAe,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAGhD;;;;;OAKG;IACI,SAAS,CAAC,cAAc,EAAE,QAAQ,EAAE,EAAE,WAAW,EAAE,QAAQ,GAAG,OAAO;IAS5E,yBAAyB;IAClB,SAAS,CAAC,cAAc,EAAE,QAAQ,EAAE,EAAE,WAAW,EAAE,QAAQ,GAAG,OAAO;CAI7E;AAiCD;;;;GAIG;AACH,MAAM,MAAM,oBAAoB,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;AAC5E;;;GAGG;AACH,qBAAa,cAAc;IAClB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,KAAK,EAAE,OAAO,CAAC;gBACH,KAAK,EAAE,QAAQ,EAAE;IAKpC;;;;;OAKG;IACI,aAAa,CAAC,kBAAkB,EAAE,oBAAoB,GAAG,SAAS,EAAE,gBAAgB,EAAE,oBAAoB,GAAG,SAAS;CAmB9H;AACD;;GAEG;AACH,qBAAa,mBAAmB;IACvB,UAAU,EAAE,cAAc,EAAE,CAAC;IAC7B,KAAK,EAAE,aAAa,CAAC;IAC5B,OAAO;WAIO,MAAM,CAAC,KAAK,EAAE,aAAa,EAAE,kBAAkB,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,KAAK,IAAI,GAAG,mBAAmB;CAU/H"}
+{"version":3,"file":"RegionOpsClassificationSweeps.d.ts","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAEhF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAGvD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,mBAAmB,CAAC;AAOhG,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAIzC,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C,OAAO,EAAE,uBAAuB,EAAE,kBAAkB,EAAa,MAAM,aAAa,CAAC;AAGrF;;;;;;;;;;;;;;GAcG;AACH,uBAAe,kCAAkC;IAC/C,uEAAuE;IAChE,cAAc,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAG/C,qCAAqC;IAC9B,eAAe,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAGhD,2BAA2B;IACpB,SAAS,CAAC,cAAc,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,QAAQ,GAAG,OAAO;IAG7E,0BAA0B;IACnB,SAAS,CAAC,cAAc,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,QAAQ,GAAG,OAAO;CAG9E;AAKD;;;;;GAKG;AACH,KAAK,sBAAsB,GAAG,CAAC,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,MAAM,KAAK,IAAI,CAAC;AAwDrH;;;GAGG;AACH,qBAAa,yBAAyB;IACpC;;;;;;;;;OASG;WACW,6BAA6B,CACzC,MAAM,EAAE,aAAa,EACrB,IAAI,EAAE,QAAQ,EACd,kBAAkB,EAAE,YAAY,EAChC,kBAAkB,EAAE,YAAY,EAChC,SAAS,EAAE,kCAAkC,GAC5C,IAAI;IAyDP;;;;;;;;;;OAUG;WACW,gBAAgB,CAAC,MAAM,EAAE,0BAA0B,EAAE,MAAM,EAAE,0BAA0B,EAAE,kBAAkB,EAAE,CAAC,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,KAAK,OAAO,EAAE,eAAe,CAAC,EAAE,uBAAuB,GAAG,aAAa,GAAG,SAAS;IAuCzO;;;;;;;;;;;;;;;OAeG;WACW,qCAAqC,CACjD,KAAK,EAAE,0BAA0B,EAAE,EACnC,GAAG,EAAE,iBAAiB,EACtB,QAAQ,EAAE,kBAAkB,EAC5B,KAAK,EAAE,0BAA0B,EAAE,EACnC,GAAG,EAAE,iBAAiB,EACtB,wBAAwB,EAAE,OAAO,GAChC,aAAa,GAAG,SAAS;CAgC7B;AAED;;;GAGG;AACH,oBAAY,iBAAiB;IAC3B,KAAK,IAAI;IACT,MAAM,IAAI;IACV,YAAY,IAAI;IAChB,WAAW,KAAK;CACjB;AAED;;;;;;GAMG;AACH,cAAM,iBAAiB;IACd,MAAM,EAAE,IAAI,GAAG,YAAY,GAAG,cAAc,GAAG,0BAA0B,CAAC;IAC1E,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,WAAW,CAAC;gBACb,MAAM,EAAE,IAAI,GAAG,YAAY,GAAG,cAAc,GAAG,0BAA0B,EAAE,WAAW,EAAE,WAAW;IAK/G,UAAU;CAGlB;AAED;;;;;;;GAOG;AACH,qBAAa,WAAW;IACf,OAAO,EAAE,iBAAiB,EAAE,CAAC;IAC7B,WAAW,EAAE,iBAAiB,CAAC;IAC/B,MAAM,EAAE,oBAAoB,CAAC;IACpC,OAAO,CAAC,MAAM,CAAS;gBACJ,MAAM,EAAE,oBAAoB,EAAE,WAAW,EAAE,iBAAiB;IAM/E,gEAAgE;IACzD,UAAU;IAKV,KAAK,IAAI,OAAO;IAYvB,oFAAoF;IAC7E,QAAQ,IAAI,OAAO;IAanB,SAAS,CAAC,IAAI,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,aAAa,GAAG,SAAS,EAAE,gBAAgB,GAAE,OAAe;IAmBtG,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM;CAQlE;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,qBAAa,oBAAqB,YAAW,kCAAkC;IACtE,MAAM,EAAG,WAAW,CAAC;IACrB,MAAM,EAAG,WAAW,CAAC;IAC5B,mBAAmB;IACZ,aAAa,EAAG,WAAW,CAAC;IAC5B,KAAK,EAAG,aAAa,CAAC;IACtB,gBAAgB,EAAG,oBAAoB,CAAC;IACxC,QAAQ,EAAE,kBAAkB,CAAC;IACpC,OAAO;IAMP;;;;;OAKG;WACW,MAAM,CAAC,UAAU,EAAE,iBAAiB,EAAE,UAAU,EAAE,iBAAiB,GAAG,oBAAoB;IAGjG,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS,EAAE,KAAK,EAAE,SAAS,GAAG,SAAS,EAAE,GAAG,SAAS;IAKxG,OAAO,CAAC,YAAY,CAAC,CAAgB;IACrC,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAsD;IACrF;;;;;;;OAOG;IACI,cAAc;IA0CrB;;;;;;;OAOG;IACI,6BAA6B,CAAC,cAAc,GAAE,MAAqC;IAkB1F,OAAO,CAAC,qBAAqB,CAAC,CAAyB;IACvD;;;;;;;OAOG;IACI,sBAAsB,CAAC,QAAQ,EAAE,kBAAkB,EAAE,oBAAoB,CAAC,EAAE,sBAAsB,GAAG,IAAI;IA4BzG,qBAAqB,CAAC,IAAI,EAAE,MAAM;IAazC,OAAO,CAAC,QAAQ;IAahB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,0BAA0B;IAyBlC,uEAAuE;IAChE,cAAc,CAAC,aAAa,EAAE,QAAQ,GAAG,OAAO;IAMvD,qCAAqC;IAC9B,eAAe,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAGhD;;;;;;OAMG;IACI,SAAS,CAAC,cAAc,EAAE,QAAQ,EAAE,EAAE,WAAW,EAAE,QAAQ,GAAG,OAAO;IAS5E,yBAAyB;IAClB,SAAS,CAAC,cAAc,EAAE,QAAQ,EAAE,EAAE,WAAW,EAAE,QAAQ,GAAG,OAAO;CAI7E;AAwCD;;;;GAIG;AACH,MAAM,MAAM,oBAAoB,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,KAAK,IAAI,CAAC;AAC5E;;;GAGG;AACH,qBAAa,cAAc;IAClB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,KAAK,EAAE,OAAO,CAAC;gBACH,KAAK,EAAE,QAAQ,EAAE;IAKpC;;;;OAIG;IACI,aAAa,CAAC,kBAAkB,EAAE,oBAAoB,GAAG,SAAS,EAAE,gBAAgB,EAAE,oBAAoB,GAAG,SAAS;CAmB9H;AACD;;;GAGG;AACH,qBAAa,mBAAmB;IACvB,UAAU,EAAE,cAAc,EAAE,CAAC;IAC7B,KAAK,EAAE,aAAa,CAAC;IAC5B,OAAO;WAIO,MAAM,CAClB,KAAK,EAAE,aAAa,EAAE,kBAAkB,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,KAAK,IAAI,GAClF,mBAAmB;CAUvB"}

package/lib/cjs/curve/RegionOpsClassificationSweeps.js

@@ -21,6 +21,7 @@ const CurveCurve_1 = require("./CurveCurve");
 const CurveLocationDetail_1 = require("./CurveLocationDetail");
 const GeometryQuery_1 = require("./GeometryQuery");
 const PlaneAltitudeRangeContext_1 = require("./internalContexts/PlaneAltitudeRangeContext");
+const TransferWithSplitArcs_1 = require("./internalContexts/TransferWithSplitArcs");
 const LineSegment3d_1 = require("./LineSegment3d");
 const Loop_1 = require("./Loop");
 const ParityRegion_1 = require("./ParityRegion");
@@ -43,14 +44,22 @@ const UnionRegion_1 = require("./UnionRegion");
  * @internal
  */
 class RegionOpsFaceToFaceSearchCallbacks {
-    /** Announce a representative node on the outer face of a component */
-    startComponent(_node) { return true; }
-    /** Announce return to outer face */
-    finishComponent(_node) { return true; }
-    /** Announce face entry */
-    enterFace(_facePathStack, _newFaceNode) { return true; }
-    /** Announce face exit */
-    leaveFace(_facePathStack, _newFaceNode) { return true; }
+    /** Announce a representative node on the outer face of a component. */
+    startComponent(_node) {
+        return true;
+    }
+    /** Announce return to outer face. */
+    finishComponent(_node) {
+        return true;
+    }
+    /** Announce face entry. */
+    enterFace(_facePathStack, _newFaceNode) {
+        return true;
+    }
+    /** Announce face exit. */
+    leaveFace(_facePathStack, _newFaceNode) {
+        return true;
+    }
 }
 /**
  * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.
@@ -113,14 +122,14 @@ class RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCall
  */
 class RegionOpsFaceToFaceSearch {
     /**
-     * run a DFS with face-to-face step announcements.
+     * Run a DFS with face-to-face step announcements.
      * * false return from any function terminates search immediately.
      * * all reachable nodes assumed to have both visit masks clear.
      * @param graph containing graph.
      * @param seed first node to visit.
      * @param faceHasBeenVisited mask marking faces that have been seen.
      * @param nodeHasBeenVisited mask marking node-to-node step around face.
-     *
+     * @param callbacks callbacks.
      */
     static faceToFaceSearchFromOuterLoop(_graph, seed, faceHasBeenVisited, nodeHasBeenVisited, callbacks) {
         if (seed.isMaskSet(faceHasBeenVisited))
@@ -134,10 +143,10 @@ class RegionOpsFaceToFaceSearch {
             let entryNode = faceWalker;
             let mate = faceWalker.edgeMate;
             if (!mate.isMaskSet(faceHasBeenVisited)) {
-                // the faceWalker seed is always on the base of the stack.
-                // the stack then contains even-odd pairs of (entryNode, currentNode)
-                // * entryNode is the node where a face was entered.
-                // * faceNode is another node around that face.
+                // The faceWalker seed is always on the base of the stack.
+                // The stack then contains even-odd pairs of (entryNode, faceNode).
+                // entryNode is the node where a face was entered.
+                // faceNode is another node around that face.
                 facePathStack.push(faceWalker);
                 facePathStack.push(mate);
                 let faceNode = mate.faceSuccessor;
@@ -168,13 +177,13 @@ class RegionOpsFaceToFaceSearch {
                             entryNode = facePathStack[facePathStack.length - 1];
                         }
                         if (faceNode.isMaskSet(nodeHasBeenVisited)) {
-                            // this is disaster !!!
+                            // this is disaster
                             return;
                         }
                     }
                 }
             }
-            // continue at outermost level .....
+            // continue at outermost level
             faceWalker = faceWalker.faceSuccessor;
         } while (faceWalker !== seed);
         callbacks.finishComponent(seed);
@@ -305,7 +314,9 @@ class RegionGroupMember {
         this.parentGroup = parentGroup;
         this.sweepState = 0;
     }
-    clearState() { this.sweepState = 0; }
+    clearState() {
+        this.sweepState = 0;
+    }
 }
 /**
  * A `RegionGroup` is
@@ -344,8 +355,7 @@ class RegionGroup {
         }
         return range;
     }
-    /** Ask if the current _numIn count qualifies as an "in" for this operation type.
-     */
+    /** Ask if the current _numIn count qualifies as an "in" for this operation type. */
     getInOut() {
         // UNION is true if one or more members are IN
         if (this.groupOpType === RegionGroupOpType.Union)
@@ -361,8 +371,9 @@ class RegionGroup {
     // push new members into the group.
     addMember(data, allowLineSegment = false) {
         if (data instanceof Loop_1.Loop || data instanceof ParityRegion_1.ParityRegion) {
-            const cleanerData = data.clone();
+            let cleanerData = data.clone();
             RegionOps_1.RegionOps.consolidateAdjacentPrimitives(cleanerData);
+            cleanerData = TransferWithSplitArcs_1.TransferWithSplitArcs.clone(cleanerData);
             this.members.push(new RegionGroupMember(cleanerData, this));
         }
         else if (data instanceof UnionRegion_1.UnionRegion) {
@@ -393,28 +404,29 @@ exports.RegionGroup = RegionGroup;
 /**
  * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.
  * * In the binary operation OP (union, intersection, parity, difference), the left and right operands
- *     are each a composite union, difference, or parity among multiple inputs, i.e.
+ * are each a composite union, difference, or parity among multiple inputs, i.e.,
  *   * (operationA among Ai) OP (operationB among Bi)
  *   * where the Ai are one set of regions, being combined by operationA
- *   * and the Bi are the another set of regions, being combined by operationB
- * * Each group of Ai and Bi is a `RegionGroup`
+ *   * and the Bi are the another set of regions, being combined by operationB.
+ * * Each group of Ai and Bi is a `RegionGroup`.
  * * This is an extremely delicate structure.
  * * Members are public because of the unique variety of queries, but should only be used for queries.
  * * The graph and curves in the booleans are connected by an extended pointer chain:
- *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail
- *    * (CurveLocationDetail).curve points to a curve
- *    * (Curve).parent points to RegionGroupMember
- *    * (RegionGroupMember) points to RegionGroup
- *    * (RegionGroup) points to RegionBooleanBinaryContext
- * * So..when a graph sweep crosses an edge,
- *    * the chain leads to a parity count in the RegionGroupMember
- *    * that can change the number of members active in the RegionGroup
+ *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail.
+ *    * (CurveLocationDetail).curve points to a curve.
+ *    * (Curve).parent points to RegionGroupMember.
+ *    * (RegionGroupMember) points to RegionGroup.
+ *    * (RegionGroup) points to RegionBooleanBinaryContext.
+ * * So when a graph sweep crosses an edge
+ *    * the chain leads to a parity count in the RegionGroupMember.
+ *    * that can change the number of members active in the RegionGroup.
  *    * which can change the state of the context.
  * @internal
  */
 class RegionBooleanContext {
     groupA;
     groupB;
+    /** bridge edges */
     extraGeometry;
     graph;
     faceAreaFunction;
@@ -423,7 +435,7 @@ class RegionBooleanContext {
         this.groupA = new RegionGroup(this, groupTypeA);
         this.groupB = new RegionGroup(this, groupTypeB);
         this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);
-        this.binaryOp = RegionOps_1.RegionBinaryOpType.Union; // it will be revised on can calls.
+        this.binaryOp = RegionOps_1.RegionBinaryOpType.Union; // revised in runClassificationSweep
     }
     /**
      * Create a context with both A and B groups empty.
@@ -437,8 +449,6 @@ class RegionBooleanContext {
     addMembers(dataA, dataB) {
         this.groupA.addMember(dataA);
         this.groupB.addMember(dataB);
-        // const doConnectives = 1;
-        // if (doConnectives !== 0)
         this.addConnectives();
     }
     _workSegment;
@@ -482,12 +492,12 @@ class RegionBooleanContext {
         }
         const ray = Ray3d_1.Ray3d.createZero();
         for (const p of maxPoints) {
-            // Make a line from...
-            //  1) exactly the max point of the loops to
-            //  2) a point clearly outside the big range
-            // If p came from some inner loop this will...
-            //  1) create a bridge from the inner loop through any containing loops (always)
-            //  2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)
+            // Make a line from
+            //    1) exactly the max point of the loops to
+            //    2) a point clearly outside the big range
+            // If p came from some inner loop this will
+            //    1) create a bridge from the inner loop through any containing loops (always)
+            //    2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)
             const bridgeLength = margin + Ray3d_1.Ray3d.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;
             const outside = Point3dVector3d_1.Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);
             const bridgeLine = LineSegment3d_1.LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);
@@ -504,7 +514,7 @@ class RegionBooleanContext {
      */
     annotateAndMergeCurvesInGraph(mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
         const allPrimitives = [];
-        // ASSUME loops have fine-grained types -- no linestrings !!
+        // ASSUME loops have fine-grained types (no linestrings)
         for (const group of [this.groupA, this.groupB, this.extraGeometry]) {
             for (const member of group.members) {
                 let k = allPrimitives.length;
@@ -515,7 +525,6 @@ class RegionBooleanContext {
                 }
             }
         }
-        //    const range = RegionOps.curveArrayRange(allPrimitives);
         const intersections = CurveCurve_1.CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);
         const graph = PlanarSubdivision_1.PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);
         this.graph = graph;
@@ -534,9 +543,8 @@ class RegionBooleanContext {
         this._announceFaceFunction = announceFaceFunction;
         this.binaryOp = binaryOp;
         this.graph.clearMask(Graph_1.HalfEdgeMask.EXTERIOR);
-        for (const group of [this.groupA, this.groupB]) {
+        for (const group of [this.groupA, this.groupB])
             group.clearState();
-        }
         const faceHasBeenVisitedMask = this.graph.grabMask();
         const nodeHasBeenVisitedMask = this.graph.grabMask();
         const componentArray = GraphComponentArray.create(this.graph);
@@ -617,18 +625,19 @@ class RegionBooleanContext {
         return undefined;
     }
     // obligations to act as sweep callback ...
-    /** Announce a representative node on the outer face of a component */
+    /** Announce a representative node on the outer face of a component. */
     startComponent(outerFaceNode) {
         outerFaceNode.setMaskAroundFace(Graph_1.HalfEdgeMask.EXTERIOR);
         if (this._announceFaceFunction)
             this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));
         return true;
     }
-    /** Announce return to outer face */
+    /** Announce return to outer face. */
     finishComponent(_node) {
         return true;
     }
-    /** Announce entry to a graph face.
+    /**
+     * Announce entry to a graph face.
      * * Both both sides of a graph edge are from the same RegionGroupMember.
      * * Hence "crossing that edge" changes the parity count for the RegionGroupMember that owns that edge by 1.
      * * The parity count for other RegionGroupMembers are never affected by this crossing.
@@ -650,8 +659,9 @@ class RegionBooleanContext {
     }
 }
 exports.RegionBooleanContext = RegionBooleanContext;
-/** return xy area between a (part of a) curve and the x axis through a reference point.
- * If detail is undefined or does not have both start and end fractions, just do trapezoid area
+/**
+ * Return xy area between (part of) a curve and the x axis through a reference point.
+ * If detail is undefined or does not have both start and end fractions, just do trapezoid area.
  */
 function areaUnderPartialCurveXY(detail, xyStart, xyEnd, referencePoint) {
     // area between trapezoid and axis
@@ -665,15 +675,21 @@ function areaUnderPartialCurveXY(detail, xyStart, xyEnd, referencePoint) {
     let areaToChord = 0.0;
     if (detail && detail.curve && detail.hasFraction1) {
         if (detail.curve instanceof LineSegment3d_1.LineSegment3d) {
-            // ah .. nothing to do for a line segment
+            // nothing to do for a line segment
         }
         else if (detail.curve instanceof Arc3d_1.Arc3d) {
             areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1);
         }
+        else {
+            const partial = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1);
+            areaToChord = partial ?
+                RegionOps_1.RegionOps.computeXYArea(Loop_1.Loop.create(partial, LineSegment3d_1.LineSegment3d.create(detail.point1, detail.point))) ?? 0
+                : 0;
+        }
     }
     return trapezoidArea + areaToChord;
 }
-/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves */
+/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves. */
 function faceAreaFromCurvedEdgeData(faceSeed) {
     let area = 0.0;
     let edge = faceSeed;
@@ -696,8 +712,7 @@ class GraphComponent {
         this.faceAreas = [];
     }
     /**
-     * visit all vertices and edges in the component to build face area array and composite range.
-     *
+     * Visit all vertices and edges in the component to build face area array and composite range.
      * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.
      * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.
      */
@@ -722,7 +737,8 @@ class GraphComponent {
     }
 }
 exports.GraphComponent = GraphComponent;
-/** build and hold an array of component data for a HalfEdgeGraph.
+/**
+ * Build and hold an array of component data for a HalfEdgeGraph.
  * @internal
  */
 class GraphComponentArray {