@itwin/core-geometry 5.1.0-dev.3 → 5.1.0-dev.32

package/lib/esm/curve/RegionOpsClassificationSweeps.js

@@ -18,6 +18,7 @@ import { CurveCurve } from "./CurveCurve";
 import { CurveLocationDetail } from "./CurveLocationDetail";
 import { GeometryQuery } from "./GeometryQuery";
 import { PlaneAltitudeRangeContext } from "./internalContexts/PlaneAltitudeRangeContext";
+import { TransferWithSplitArcs } from "./internalContexts/TransferWithSplitArcs";
 import { LineSegment3d } from "./LineSegment3d";
 import { Loop } from "./Loop";
 import { ParityRegion } from "./ParityRegion";
@@ -40,14 +41,22 @@ import { UnionRegion } from "./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.
@@ -110,14 +119,14 @@ class RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCall
  */
 export 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))
@@ -131,10 +140,10 @@ export 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;
@@ -165,13 +174,13 @@ export 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);
@@ -301,7 +310,9 @@ class RegionGroupMember {
         this.parentGroup = parentGroup;
         this.sweepState = 0;
     }
-    clearState() { this.sweepState = 0; }
+    clearState() {
+        this.sweepState = 0;
+    }
 }
 /**
  * A `RegionGroup` is
@@ -340,8 +351,7 @@ export 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)
@@ -357,8 +367,9 @@ export class RegionGroup {
     // push new members into the group.
     addMember(data, allowLineSegment = false) {
         if (data instanceof Loop || data instanceof ParityRegion) {
-            const cleanerData = data.clone();
+            let cleanerData = data.clone();
             RegionOps.consolidateAdjacentPrimitives(cleanerData);
+            cleanerData = TransferWithSplitArcs.clone(cleanerData);
             this.members.push(new RegionGroupMember(cleanerData, this));
         }
         else if (data instanceof UnionRegion) {
@@ -388,28 +399,29 @@ export 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 class RegionBooleanContext {
     groupA;
     groupB;
+    /** bridge edges */
     extraGeometry;
     graph;
     faceAreaFunction;
@@ -418,7 +430,7 @@ export class RegionBooleanContext {
         this.groupA = new RegionGroup(this, groupTypeA);
         this.groupB = new RegionGroup(this, groupTypeB);
         this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);
-        this.binaryOp = RegionBinaryOpType.Union; // it will be revised on can calls.
+        this.binaryOp = RegionBinaryOpType.Union; // revised in runClassificationSweep
     }
     /**
      * Create a context with both A and B groups empty.
@@ -432,8 +444,6 @@ export class RegionBooleanContext {
     addMembers(dataA, dataB) {
         this.groupA.addMember(dataA);
         this.groupB.addMember(dataB);
-        // const doConnectives = 1;
-        // if (doConnectives !== 0)
         this.addConnectives();
     }
     _workSegment;
@@ -477,12 +487,12 @@ export class RegionBooleanContext {
         }
         const ray = 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.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;
             const outside = Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);
             const bridgeLine = LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);
@@ -499,7 +509,7 @@ export class RegionBooleanContext {
      */
     annotateAndMergeCurvesInGraph(mergeTolerance = 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;
@@ -510,7 +520,6 @@ export class RegionBooleanContext {
                 }
             }
         }
-        //    const range = RegionOps.curveArrayRange(allPrimitives);
         const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);
         const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);
         this.graph = graph;
@@ -529,9 +538,8 @@ export class RegionBooleanContext {
         this._announceFaceFunction = announceFaceFunction;
         this.binaryOp = binaryOp;
         this.graph.clearMask(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);
@@ -612,18 +620,19 @@ export 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(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.
@@ -644,8 +653,9 @@ export class RegionBooleanContext {
         return true;
     }
 }
-/** 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
@@ -659,15 +669,21 @@ function areaUnderPartialCurveXY(detail, xyStart, xyEnd, referencePoint) {
     let areaToChord = 0.0;
     if (detail && detail.curve && detail.hasFraction1) {
         if (detail.curve instanceof LineSegment3d) {
-            // ah .. nothing to do for a line segment
+            // nothing to do for a line segment
         }
         else if (detail.curve instanceof Arc3d) {
             areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1);
         }
+        else {
+            const partial = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1);
+            areaToChord = partial ?
+                RegionOps.computeXYArea(Loop.create(partial, 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;
@@ -690,8 +706,7 @@ export 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.
      */
@@ -715,7 +730,8 @@ export class GraphComponent {
         }
     }
 }
-/** build and hold an array of component data for a HalfEdgeGraph.
+/**
+ * Build and hold an array of component data for a HalfEdgeGraph.
  * @internal
  */
 export class GraphComponentArray {

package/lib/esm/curve/RegionOpsClassificationSweeps.js.map

@@ -1 +1 @@
-{"version":3,"file":"RegionOpsClassificationSweeps.js","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAY,aAAa,EAAE,YAAY,EAAwB,MAAM,mBAAmB,CAAC;AAChG,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AACnE,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAG5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,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,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAA2B,kBAAkB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C;;;;;;;;;;;;;;GAcG;AACH,MAAe,kCAAkC;IAC/C,sEAAsE;IAC/D,cAAc,CAAC,KAAe,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAChE,oCAAoC;IAC7B,eAAe,CAAC,KAAe,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IACjE,0BAA0B;IACnB,SAAS,CAAC,cAA0B,EAAE,YAAsB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;IAC9F,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,YAAsB,IAAa,OAAO,IAAI,CAAC,CAAC,CAAC;CAC/F;AAYD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,oCAAqC,SAAQ,kCAAkC;IAC3E,mBAAmB,CAA8B;IACjD,YAAY,CAAY;IACxB,aAAa,CAAe;IACpC,YAAmB,kBAA+C,EAAE,YAA0B;QAC5F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,2BAA2B;QACtE,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC;IAChD,CAAC;IACD,iCAAiC;IACjB,cAAc,CAAC,IAAc,IAAa,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IACpH;;;OAGG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IACpC;;;;;;;;;OASG;IACI,MAAM,CAAC,6BAA6B,CAAC,MAAqB,EAAE,IAAc,EAAE,kBAAgC,EAAE,kBAAgC,EAAE,SAA6C;QAClM,IAAI,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC;YACpC,OAAO;QACT,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC;YACjC,OAAO;QACT,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;QAC3C,IAAI,UAAU,GAAG,IAAI,CAAC;QACtB,GAAG,CAAC;YACF,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBACxC,0DAA0D;gBAC1D,qEAAqE;gBACrE,oDAAoD;gBACpD,+CAA+C;gBAC/C,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC/B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;gBAClC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;gBAC3C,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC7C,SAAU,CAAC;wBACT,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;wBACzB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;4BACxC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;4BAC3C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC;gCAC3C,OAAO;4BACT,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;4BAC7B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACzB,QAAQ,GAAG,IAAI,CAAC;4BAChB,SAAS,GAAG,IAAI,CAAC;wBACnB,CAAC;wBACD,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;wBACrC,QAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC;wBAClC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;4BAC3B,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;4BAC7C,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gCAC9B,MAAM;4BACR,CAAC;4BACD,aAAa,CAAC,GAAG,EAAE,CAAC;4BACpB,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;4BACnD,aAAa,CAAC,GAAG,EAAE,CAAC;4BACpB,SAAS,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBACtD,CAAC;wBACD,IAAI,QAAQ,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;4BAC3C,uBAAuB;4BACvB,OAAO;wBACT,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,oCAAoC;YACpC,UAAU,GAAG,UAAU,CAAC,aAAa,CAAC;QACxC,CAAC,QAAQ,UAAU,KAAK,IAAI,EAAE;QAC9B,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAAC,MAAkC,EAAE,MAAkC,EAAE,kBAA2D,EAAE,eAAyC;QAC3M,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,eAAe;YACjB,eAAe,CAAC,gBAAgB,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACnB,qCAAqC;YACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,eAAe;gBACjB,eAAe,CAAC,kBAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,gBAAgB,KAAK,SAAS;gBAChC,OAAO,SAAS,CAAC;YACnB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC;YACzE,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,oCAAoC,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC7F,IAAI,CAAC,6BAA6B,CAAC,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YACzG,IAAI,eAAe;gBACjB,eAAe,CAAC,qCAAqC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACvE,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,qCAAqC,CACjD,KAAmC,EACnC,GAAsB,EACtB,QAA4B,EAC5B,KAAmC,EACnC,GAAsB,EACtB,wBAAiC;QAEjC,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACxB,SAAS,CAAC,gBAAgB,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAEhF,mCAAmC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,qCAAqC;QACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,SAAS,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,wBAAwB;YAC1B,SAAS,CAAC,qBAAqB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,KAAjB,iBAAiB,QAK5B;AACD;;;;;;GAMG;AACH,MAAM,iBAAiB;IACd,MAAM,CAAoE;IAC1E,UAAU,CAAS;IACnB,WAAW,CAAc;IAChC,YAAmB,MAAyE,EAAE,WAAwB;QACpH,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;IACM,UAAU,KAAK,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC;CAC7C;AACD;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IACf,OAAO,CAAsB;IAC7B,WAAW,CAAoB;IAC/B,MAAM,CAAuB;IAC5B,MAAM,CAAS;IACvB,YAAmB,MAA4B,EAAE,WAA8B;QAC7E,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,gEAAgE;IACzD,UAAU;QACf,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAC/B,MAAM,CAAC,UAAU,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACM,KAAK;QACV,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,aAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB,CAAC;gBACJ,MAAM,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACvD,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;OACG;IACI,QAAQ;QACb,8CAA8C;QAC9C,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,KAAK;YAC9C,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,oDAAoD;QACpD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,MAAM;YAC/C,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,iDAAiD;QACjD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,YAAY;YACrD,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mCAAmC;IAC5B,SAAS,CAAC,IAAyD,EAAE,mBAA4B,KAAK;QAC3G,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,YAAY,EAAE,CAAC;YACzD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YAC1D,SAAS,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;YACrD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;YACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,gBAAgB,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;YAC7D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAEvD,CAAC;IACH,CAAC;IACD,uGAAuG;IAChG,uBAAuB,CAAC,QAAgB,EAAE,QAAgB;QAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;aACX,IAAI,KAAK,IAAI,CAAC,KAAK;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;CACF;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,oBAAoB;IACxB,MAAM,CAAe;IACrB,MAAM,CAAe;IACrB,aAAa,CAAe;IAC5B,KAAK,CAAiB;IACtB,gBAAgB,CAAwB;IACxC,QAAQ,CAAqB;IAEpC,YAAoB,UAA6B,EAAE,UAA6B;QAC9E,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,mCAAmC;IAC/E,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,UAA6B,EAAE,UAA6B;QAC/E,OAAO,IAAI,oBAAoB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAC1D,CAAC;IACM,UAAU,CAAC,KAA0C,EAAE,KAA0C;QACtG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,2BAA2B;QAC3B,2BAA2B;QAC3B,IAAI,CAAC,cAAc,EAAE,CAAC;IACxB,CAAC;IAEO,YAAY,CAAiB;IAC7B,MAAM,CAAC,gBAAgB,GAAG,QAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAE,CAAC,CAAC,+CAA+C;IACrI;;;;;;;OAOG;IACI,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACxJ,IAAI,IAAI,CAAC,YAAY;YACnB,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAE,6CAA6C;QAE/H,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAChD,OAAO,CAAG,+BAA+B;YAC3C,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,MAAM,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7I,IAAI,IAAI,CAAC,YAAY;gBACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC;QAEF,KAAK,MAAM,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YACtE,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,IAAI,EAAE,CAAC;oBAC7B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACpC,CAAC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,YAAY,EAAE,CAAC;oBAC5C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ;wBAClC,uBAAuB,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,sBAAsB;YACtB,4CAA4C;YAC5C,4CAA4C;YAC5C,8CAA8C;YAC9C,gFAAgF;YAChF,yGAAyG;YACzG,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED;;;;;;;OAOG;IACI,6BAA6B,CAAC,iBAAyB,QAAQ,CAAC,mBAAmB;QACxF,MAAM,aAAa,GAAqB,EAAE,CAAC;QAC3C,4DAA4D;QAC5D,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YACnE,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACnC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;gBAC7B,IAAI,MAAM,CAAC,MAAM,YAAY,aAAa,EAAE,CAAC;oBAC3C,SAAS,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC3E,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;wBAClC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QACD,6DAA6D;QAC7D,MAAM,aAAa,GAAG,UAAU,CAAC,iCAAiC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,aAAa,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QACpG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC;IACrD,CAAC;IACO,qBAAqB,CAA0B;IACvD;;;;;;;OAOG;IACI,sBAAsB,CAC3B,QAA4B,EAC5B,oBAA6C;QAC7C,IAAI,CAAC,qBAAqB,GAAG,oBAAoB,CAAC;QAClD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,KAAK,CAAC,UAAU,EAAE,CAAC;QACrB,CAAC;QACD,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrD,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrD,MAAM,cAAc,GAAG,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9D,KAAK,MAAM,SAAS,IAAI,cAAc,CAAC,UAAU,EAAE,CAAC;YAClD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACzG,IAAI,gBAAgB,EAAE,CAAC;gBACrB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;gBAC3C,MAAM,eAAe,GAAG,YAAY,GAAG,sBAAsB,GAAG,sBAAsB,CAAC;gBACvF,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;gBACtC,yBAAyB,CAAC,6BAA6B,CAAC,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,IAAI,CAAC,CAAC;YAC9I,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IAC9C,CAAC;IACD,kCAAkC;IAClC,qBAAqB;IACrB,0BAA0B;IAC1B,wCAAwC;IACxC,qBAAqB;IACd,qBAAqB,CAAC,IAAY;QACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,CAAC,aAAa,KAAK,KAAK,EAAE,CAAC;gBAClC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;wBACnE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBACtB,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACO,QAAQ;QACd,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,MAAM;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,IAAc,EAAE,KAAa;QAC9D,MAAM,4BAA4B,GAAG,CAAC,MAAyB,EAAqB,EAAE;YACpF,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iBAAiB,CAAC,WAAW;gBAClE,OAAO,MAAM,CAAC,CAAE,qCAAqC;YACvD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC;gBACxC,MAAM,CAAC,UAAU,IAAI,KAAK,CAAC;gBAC3B,MAAM,CAAC,WAAW,CAAC,uBAAuB,CAAC,aAAa,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAC/E,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,IAAI,YAAY,iBAAiB;YACnC,OAAO,4BAA4B,CAAC,IAAI,CAAC,CAAC;QAE5C,IAAI,IAAI,YAAY,mBAAmB,EAAE,CAAC;YACxC,kHAAkH;YAClH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC,MAAM,CAAC;YAClC,IAAI,MAAM,YAAY,iBAAiB;gBACrC,OAAO,4BAA4B,CAAC,MAAM,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,2CAA2C;IAC3C,sEAAsE;IAC/D,cAAc,CAAC,aAAuB;QAC3C,aAAa,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,oCAAoC;IAC7B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;OAKG;IACI,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK;YACR,WAAW,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;;AAEH;;GAEG;AACH,SAAS,uBAAuB,CAAC,MAAuC,EAAE,OAAc,EAAE,KAAY,EAAE,cAAqB;IAC3H,kCAAkC;IAClC,IAAI,aAAa,CAAC;IAClB,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IACtH,CAAC;SAAM,CAAC;QACN,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,WAAW,GAAG,GAAG,CAAC;IACtB,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QAElD,IAAI,MAAM,CAAC,KAAK,YAAY,aAAa,EAAE,CAAC;YAC1C,yCAAyC;QAC3C,CAAC;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,KAAK,EAAE,CAAC;YACzC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IACD,OAAO,aAAa,GAAG,WAAW,CAAC;AACrC,CAAC;AACD,iHAAiH;AACjH,SAAS,0BAA0B,CAAC,QAAkB;IACpD,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,GAAG,CAAC;QACF,IAAI,IAAK,IAAI,CAAC,QAAmB,GAAG,uBAAuB,CAAE,IAAI,CAAC,OAA+B,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IACzI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,EAAE;IACnD,OAAO,IAAI,CAAC;AACd,CAAC;AAQD;;;GAGG;AACH,MAAM,OAAO,cAAc;IAClB,KAAK,CAAa;IAClB,SAAS,CAAW;IACpB,KAAK,CAAU;IACtB,YAAmB,KAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;;OAKG;IACI,aAAa,CAAC,kBAAoD,EAAE,gBAAkD;QAC3H,MAAM,cAAc,GAAG,CAAC,IAAc,EAAE,EAAE;YACxC,IAAI,kBAAkB;gBACpB,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;;gBAErC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,CAAC,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;CACF;AACD;;GAEG;AACH,MAAM,OAAO,mBAAmB;IACvB,UAAU,CAAmB;IAC7B,KAAK,CAAgB;IAC5B,YAAoB,KAAoB;QACtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,KAAoB,EAAE,kBAA6D;QACtG,MAAM,MAAM,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,eAAe,GAAG,mBAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAChH,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,IAAI,cAAc,CAAC,cAAc,CAAC,CAAC;YACrD,SAAS,CAAC,aAAa,CAAC,kBAAkB,EAAE,0BAA0B,CAAC,CAAC;YACxE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Curve\n */\n\nimport { Geometry } from \"../Geometry\";\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, NodeToNumberFunction } from \"../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphMerge } from \"../topology/Merging\";\nimport { RegularizationContext } from \"../topology/RegularizeFace\";\nimport { Arc3d } from \"./Arc3d\";\nimport { CurveCurve } from \"./CurveCurve\";\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\nimport { CurvePrimitive } from \"./CurvePrimitive\";\nimport { AnyRegion } from \"./CurveTypes\";\nimport { GeometryQuery } from \"./GeometryQuery\";\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\nimport { LineSegment3d } from \"./LineSegment3d\";\nimport { Loop } from \"./Loop\";\nimport { ParityRegion } from \"./ParityRegion\";\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\nimport { GraphCheckPointFunction, RegionBinaryOpType, RegionOps } from \"./RegionOps\";\nimport { UnionRegion } from \"./UnionRegion\";\n\n/**\n * base class for callbacks during region sweeps.\n * * At start of a component, `startComponent(node)` is called announcing a representative node on the outermost face.\n *   * A Component in this usage is a component that is edge connected when ignoring \"exterior bridge edges\".\n * * As each face is entered, `enterFace(facePathStack, newFaceNode)` is called\n *   * facePathStack[0] is the outermost node of the path from the outer face.\n *   * facePathStack[1] is its inside mate.\n *   * facePathStack[2k] is the outside node at crossing to face at depth k.\n *   * facePathStack[2k+1] is the node where face at depth k was entered.\n *   * newFaceNode is the entry node (redundant of stack tip)\n *  * On retreat from a face, `leaveFace(facePathStack, faceNode)` is called.\n *  * At end of component, `finishComponent (node)` is called.\n * * The base class is fully implemented to do nothing during the sweep.\n * @internal\n */\nabstract class RegionOpsFaceToFaceSearchCallbacks {\n  /** Announce a representative node on the outer face of a component */\n  public startComponent(_node: HalfEdge): boolean { return true; }\n  /** Announce return to outer face */\n  public finishComponent(_node: HalfEdge): boolean { return true; }\n  /** Announce face entry */\n  public enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\n  /** Announce face exit */\n  public leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean { return true; }\n}\n/** Function signature to test if a pair of boolean states is to be accepted by area booleans (during face-to-face sweeps)\n * @internal\n */\ntype BinaryBooleanAcceptFunction = (stateA: boolean, stateB: boolean) => boolean;\n/** Function signature ot announce classification of a face.\n * The `faceType` parameters are\n * * -1 for a fully exterior face.  This is a negative area face.\n * * 0 for a positive area face classified as \"out\" for the boolean.\n * * 1 for a positive area face classified as \"in\" for the boolean.\n */\ntype AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceType: -1 | 0 | 1, area: number) => void;\n/**\n * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.\n * * For this linear-boundary case the boundary geometry is carried entirely from the coordinates in the half edges.\n * * This assumes the each node in the graph has edgeTag set to:\n *   * `edgeTag === undefined` if the edge crossing does not change classification.\n *     * for example, an edge added by regularization\n *   * `edgeTag === 1` if this is a boundary for the first of the boolean input regions\n *   * `edgeTag === 2` if this is a boundary for the second of the boolean input regions\n * * constructor\n *    * takes caller-supplied function to decide whether to accept a face given its state relative to the two boolean terms.\n *    * sets the in/out status of both terms to false.\n * * `startComponent` marks the entire outer face as `EXTERIOR`\n * * `enterFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n *    * ask the faceAcceptFunction if the current term states combine to in/out for the result\n *    * if out, set the `EXTERIOR` mask around the face.\n * * `leaveFace`\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\n * * `finishComponent` is not reimplemented.\n * @internal\n */\nclass RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCallbacks {\n  private _faceSelectFunction: BinaryBooleanAcceptFunction;\n  private _inComponent: boolean[];\n  private _exteriorMask: HalfEdgeMask;\n  public constructor(acceptFaceFunction: BinaryBooleanAcceptFunction, exteriorMask: HalfEdgeMask) {\n    super();\n    this._inComponent = [false, false, false]; // entry 0 is never reused.\n    this._exteriorMask = exteriorMask;\n    this._faceSelectFunction = acceptFaceFunction;\n  }\n  /** Mark this face as exterior */\n  public override startComponent(node: HalfEdge): boolean { node.setMaskAroundFace(this._exteriorMask); return true; }\n  /**\n   * * If necessary, toggle a term state.\n   * * if indicated, mark this face exterior.\n   */\n  public override enterFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    if (!this._faceSelectFunction(this._inComponent[1], this._inComponent[2]))\n      node.setMaskAroundFace(this._exteriorMask);\n    return true;\n  }\n  /**\n   * * If necessary, toggle a term state.\n   */\n  public override leaveFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\n    const thisFaceIndex = node.edgeTag;\n    if (node.edgeTag === 1 || node.edgeTag === 2)\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\n    return true;\n  }\n}\n/**\n * Low level graph search for face classification.\n * @internal\n */\nexport class RegionOpsFaceToFaceSearch {\n  /**\n   * run a DFS with face-to-face step announcements.\n   * * false return from any function terminates search immediately.\n   * * all reachable nodes assumed to have both visit masks clear.\n   * @param graph containing graph.\n   * @param seed first node to visit.\n   * @param faceHasBeenVisited mask marking faces that have been seen.\n   * @param nodeHasBeenVisited mask marking node-to-node step around face.\n   *\n   */\n  public static faceToFaceSearchFromOuterLoop(_graph: HalfEdgeGraph, seed: HalfEdge, faceHasBeenVisited: HalfEdgeMask, nodeHasBeenVisited: HalfEdgeMask, callbacks: RegionOpsFaceToFaceSearchCallbacks) {\n    if (seed.isMaskSet(faceHasBeenVisited))\n      return;\n    if (!callbacks.startComponent(seed))\n      return;\n    const facePathStack = [];\n    seed.setMaskAroundFace(faceHasBeenVisited);\n    let faceWalker = seed;\n    do {\n      let entryNode = faceWalker;\n      let mate = faceWalker.edgeMate;\n      if (!mate.isMaskSet(faceHasBeenVisited)) {\n        // the faceWalker seed is always on the base of the stack.\n        // the stack then contains even-odd pairs of (entryNode, currentNode)\n        // * entryNode is the node where a face was entered.\n        // * faceNode is another node around that face.\n        facePathStack.push(faceWalker);\n        facePathStack.push(mate);\n        let faceNode = mate.faceSuccessor;\n        mate.setMaskAroundFace(faceHasBeenVisited);\n        entryNode = mate;\n        if (callbacks.enterFace(facePathStack, mate)) {\n          for (; ;) {\n            mate = faceNode.edgeMate;\n            if (!mate.isMaskSet(faceHasBeenVisited)) {\n              mate.setMaskAroundFace(faceHasBeenVisited);\n              if (!callbacks.enterFace(facePathStack, mate))\n                return;\n              facePathStack.push(faceNode);\n              facePathStack.push(mate);\n              faceNode = mate;\n              entryNode = mate;\n            }\n            faceNode.setMask(nodeHasBeenVisited);\n            faceNode = faceNode.faceSuccessor;\n            if (faceNode === entryNode) {\n              callbacks.leaveFace(facePathStack, faceNode);\n              if (facePathStack.length <= 2) {\n                break;\n              }\n              facePathStack.pop();\n              faceNode = facePathStack[facePathStack.length - 1];\n              facePathStack.pop();\n              entryNode = facePathStack[facePathStack.length - 1];\n            }\n            if (faceNode.isMaskSet(nodeHasBeenVisited)) {\n              // this is disaster !!!\n              return;\n            }\n          }\n        }\n      }\n      // continue at outermost level .....\n      faceWalker = faceWalker.faceSuccessor;\n    } while (faceWalker !== seed);\n    callbacks.finishComponent(seed);\n  }\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\n   * * Each of the binary input terms is a collection of loops\n   *   * Within the binary term, in/out is determined by edge-crossing parity rules.\n   * * Processing steps are\n   *   * Build the loops for each set.\n   *      * Each edge labeled with 1 or 2 as binary term identifier.\n   *   * find crossings among the edges.\n   *      * Edges are split as needed, but split preserves the edgeTag\n   *   * sort edges around vertices\n   *   * add regularization edges so holes are connected to their parent.\n   */\n  public static doPolygonBoolean(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, faceSelectFunction: (inA: boolean, inB: boolean) => boolean, graphCheckPoint?: GraphCheckPointFunction): HalfEdgeGraph | undefined {\n    const graph = new HalfEdgeGraph();\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\n    const seedA = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsA, baseMask, 1);\n    const seedB = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsB, baseMask, 2);\n    if (graphCheckPoint)\n      graphCheckPoint(\"unmerged loops\", graph, \"U\");\n    if (seedA || seedB) {\n      // split edges where they cross . . .\n      HalfEdgeGraphMerge.splitIntersectingEdges(graph);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After splitIntersectingEdges\", graph, \"S\");\n      // sort radially around vertices.\n      HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After clusterAndMergeXYTheta\", graph, \"M\");\n      // add edges to connect various components  (e.g. holes!!!)\n      const context = new RegularizationContext(graph);\n      context.regularizeGraph(true, true);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After regularize\", graph, \"MR\");\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(graph);\n      if (exteriorHalfEdge === undefined)\n        return undefined;\n      const exteriorMask = HalfEdgeMask.EXTERIOR;\n      const faceVisitedMask = graph.grabMask();\n      const nodeVisitedMask = graph.grabMask();\n      const allMasksToClear = exteriorMask | faceVisitedMask | nodeVisitedMask;\n      graph.clearMask(allMasksToClear);\n      const callbacks = new RegionOpsBinaryBooleanSweepCallbacks(faceSelectFunction, exteriorMask);\n      this.faceToFaceSearchFromOuterLoop(graph, exteriorHalfEdge, faceVisitedMask, nodeVisitedMask, callbacks);\n      if (graphCheckPoint)\n        graphCheckPoint(\"After faceToFaceSearchFromOuterLoop\", graph, \"MRX\");\n      graph.dropMask(faceVisitedMask);\n      graph.dropMask(nodeVisitedMask);\n      return graph;\n    }\n    return undefined;\n  }\n\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\n   * * the manyLoopsAndParitySets input is an array.\n   * * Each entry is one or more loops.\n   * * An entry that is \"just points\" is a simple loop.\n   * * An entry that is itself an array of arrays of points is a set of loops with \"parity\" -- relation:\n   *    * typically the first is an outer loop an others are holes.\n   *    * but if there is self intersection or multiple outer loops, parity rules are applied to decide inner and outer.\n   * * Processing steps are\n   *   * Build the loops for each set.\n   *      * Each edge labeled with index to the outer array.\n   *   * find crossings among the edges.\n   *      * Edges are split as needed, but split preserves the edgeTag\n   *   * sort edges around vertices\n   *   * add regularization edges so holes are connected to their parent.\n   *   * assign inside/outside by parity within each set and overall union.\n   */\n  public static doBinaryBooleanBetweenMultiLoopInputs(\n    dataA: MultiLineStringDataVariant[],\n    opA: RegionGroupOpType,\n    binaryOp: RegionBinaryOpType,\n    dataB: MultiLineStringDataVariant[],\n    opB: RegionGroupOpType,\n    purgeSliverExteriorFaces: boolean,\n  ): HalfEdgeGraph | undefined {\n    const graph = new HalfEdgeGraph();\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\n    const callbacks = RegionBooleanContext.create(opA, opB);\n    callbacks.graph = graph;\n    callbacks.faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);\n\n    // Add all the members in groupA ..\n    for (const data of dataA) {\n      if (data.length > 2) {\n        const member = new RegionGroupMember(data, callbacks.groupA);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    for (const data of dataB) {\n      if (data.length > 2) {\n        const member = new RegionGroupMember(data, callbacks.groupB);\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\n      }\n    }\n    // split edges where they cross . . .\n    HalfEdgeGraphMerge.splitIntersectingEdges(graph);\n    // sort radially around vertices.\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\n    // add edges to connect various components  (e.g. holes!!!)\n    const context = new RegularizationContext(graph);\n    context.regularizeGraph(true, true);\n    callbacks.runClassificationSweep(binaryOp);\n    if (purgeSliverExteriorFaces)\n      callbacks.unmaskMaskedNullFaces(HalfEdgeMask.EXTERIOR);\n    return graph;\n  }\n}\n\n/**\n * Enumeration of operation types \"within a group operand\" for a `RegionBooleanContext`.\n * @internal\n */\nexport enum RegionGroupOpType {\n  Union = 0,\n  Parity = 1,\n  Intersection = 2,\n  NonBounding = -1,\n}\n/**\n * Each loop or parity region in a `RegionBooleanContext` is recorded as a `RegionGroupMember`, which carries\n * * the Loop or parityRegion object\n * * a numeric indication of the sweep state (parity) during the classification search.\n * * a reference to the parent group (which in turn leads back to the `RegionBooleanContext`)\n * @internal\n */\nclass RegionGroupMember {\n  public region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant;\n  public sweepState: number;\n  public parentGroup: RegionGroup;\n  public constructor(region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant, parentGroup: RegionGroup) {\n    this.region = region;\n    this.parentGroup = parentGroup;\n    this.sweepState = 0;\n  }\n  public clearState() { this.sweepState = 0; }\n}\n/**\n * A `RegionGroup` is\n * * An array of `RegionGroupMembers`, carrying the regions of the Ai or Bi part of the boolean expression.\n * * The `RegionGroupOpType` to be applied among those members.\n * * Pointer to the containing context\n * * The count of number of regions known to be \"in\" as the search progresses.\n * @internal\n */\nexport class RegionGroup {\n  public members: RegionGroupMember[];\n  public groupOpType: RegionGroupOpType;\n  public parent: RegionBooleanContext;\n  private _numIn: number;\n  public constructor(parent: RegionBooleanContext, groupOpType: RegionGroupOpType) {\n    this.members = [];\n    this.parent = parent;\n    this.groupOpType = groupOpType;\n    this._numIn = 0;\n  }\n  /** deep clear of state data -- group header plus all members */\n  public clearState() {\n    for (const member of this.members)\n      member.clearState();\n    this._numIn = 0;\n  }\n  public range(): Range3d {\n    const range = Range3d.createNull();\n    for (const m of this.members) {\n      if (m.region instanceof GeometryQuery)\n        m.region.extendRange(range);\n      else {\n        const range1 = Range3d.createFromVariantData(m.region);\n        range.extendRange(range1);\n      }\n    }\n    return range;\n  }\n  /** Ask if the current _numIn count qualifies as an \"in\" for this operation type.\n   */\n  public getInOut(): boolean {\n    // UNION is true if one or more members are IN\n    if (this.groupOpType === RegionGroupOpType.Union)\n      return this._numIn > 0;\n    // PARITY is true if an odd number of regions are IN\n    if (this.groupOpType === RegionGroupOpType.Parity)\n      return Geometry.isOdd(this._numIn);\n    // INTERSECTION is true if ALL the regions are IN\n    if (this.groupOpType === RegionGroupOpType.Intersection)\n      return this._numIn === this.members.length;\n    return false;\n  }\n  // push new members into the group.\n  public addMember(data: AnyRegion | AnyRegion[] | LineSegment3d | undefined, allowLineSegment: boolean = false) {\n    if (data instanceof Loop || data instanceof ParityRegion) {\n      const cleanerData = data.clone() as (ParityRegion | Loop);\n      RegionOps.consolidateAdjacentPrimitives(cleanerData);\n      this.members.push(new RegionGroupMember(cleanerData, this));\n    } else if (data instanceof UnionRegion) {\n      for (const child of data.children) {\n        this.addMember(child);\n      }\n    } else if (Array.isArray(data)) {\n      for (const item of data) {\n        this.addMember(item);\n      }\n    } else if (allowLineSegment && data instanceof LineSegment3d) {\n      this.members.push(new RegionGroupMember(data, this));\n\n    }\n  }\n  // update the \"in\" count _numIn according to old and new states (parity counts) for some member region.\n  public recordMemberStateChange(oldState: number, newState: number) {\n    const oldIn = Geometry.isOdd(oldState);\n    const newIn = Geometry.isOdd(newState);\n    if (!oldIn && newIn)\n      this._numIn++;\n    else if (oldIn && !newIn)\n      this._numIn--;\n  }\n}\n/**\n * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.\n * * In the binary operation OP (union, intersection, parity, difference), the left and right operands\n *     are each a composite union, difference, or parity among multiple inputs, i.e.\n *   * (operationA among Ai) OP (operationB among Bi)\n *   * where the Ai are one set of regions, being combined by operationA\n *   * and the Bi are the another set of regions, being combined by operationB\n * * Each group of Ai and Bi is a `RegionGroup`\n * * This is an extremely delicate structure.\n * * Members are public because of the unique variety of queries, but should only be used for queries.\n * * The graph and curves in the booleans are connected by an extended pointer chain:\n *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail\n *    * (CurveLocationDetail).curve points to a curve\n *    * (Curve).parent points to RegionGroupMember\n *    * (RegionGroupMember) points to RegionGroup\n *    * (RegionGroup) points to RegionBooleanBinaryContext\n * * So..when a graph sweep crosses an edge,\n *    * the chain leads to a parity count in the RegionGroupMember\n *    * that can change the number of members active in the RegionGroup\n *    * which can change the state of the context.\n * @internal\n */\nexport class RegionBooleanContext implements RegionOpsFaceToFaceSearchCallbacks {\n  public groupA!: RegionGroup;\n  public groupB!: RegionGroup;\n  public extraGeometry!: RegionGroup;\n  public graph!: HalfEdgeGraph;\n  public faceAreaFunction!: NodeToNumberFunction;\n  public binaryOp: RegionBinaryOpType;\n\n  private constructor(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType) {\n    this.groupA = new RegionGroup(this, groupTypeA);\n    this.groupB = new RegionGroup(this, groupTypeB);\n    this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);\n    this.binaryOp = RegionBinaryOpType.Union; // it will be revised on can calls.\n  }\n  /**\n   * Create a context with both A and B groups empty.\n   * * Caller follows up by calls to `context.groupA.addMember (loopOrParityRegion)` or `context.groupB.addMember (loopOrParityRegion)`\n   * @param groupTypeA\n   * @param groupTypeB\n   */\n  public static create(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType): RegionBooleanContext {\n    return new RegionBooleanContext(groupTypeA, groupTypeB);\n  }\n  public addMembers(dataA: AnyRegion | AnyRegion[] | undefined, dataB: AnyRegion | AnyRegion[] | undefined) {\n    this.groupA.addMember(dataA);\n    this.groupB.addMember(dataB);\n    // const doConnectives = 1;\n    // if (doConnectives !== 0)\n    this.addConnectives();\n  }\n\n  private _workSegment?: LineSegment3d;\n  private static _bridgeDirection = Vector3d.createNormalized(1.0, -0.12328974132467)!; // magic unit direction to minimize vertex hits\n  /**\n   * The sweep operations require access to all geometry by edge crossings and face walk.\n   * If input loops are non-overlapping, there may be disconnected islands not reachable.\n   * This method:\n   * * finds the total range\n   * * creates parallel rays from the extreme point of each loop and extending beyond the overall range\n   * * places those lines in the extraGeometry group\n   */\n  public addConnectives() {\n    const rangeA = this.groupA.range();\n    const rangeB = this.groupB.range();\n    const rangeAB = rangeA.union(rangeB);\n    const areaTol = RegionOps.computeXYAreaTolerance(rangeAB);\n    let margin = 0.1;\n    this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(rangeAB.corners(), RegionBooleanContext._bridgeDirection, this._workSegment);\n    if (this._workSegment)\n      margin *= this._workSegment.point0Ref.distanceXY(this._workSegment.point1Ref);  // how much further to extend each bridge ray\n\n    const maxPoints: Point3d[] = [];\n    const findExtremePointsInLoop = (region: Loop) => {\n      const area = RegionOps.computeXYArea(region);\n      if (area === undefined || Math.abs(area) < areaTol)\n        return;   // avoid bridging trivial faces\n      this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(region, RegionBooleanContext._bridgeDirection, this._workSegment);\n      if (this._workSegment)\n        maxPoints.push(this._workSegment.point1Ref);\n    };\n\n    for (const groupMembers of [this.groupA.members, this.groupB.members]) {\n      for (const m of groupMembers) {\n        if (m.region instanceof Loop) {\n          findExtremePointsInLoop(m.region);\n        } else if (m.region instanceof ParityRegion) {\n          for (const loop of m.region.children)\n            findExtremePointsInLoop(loop);\n        }\n      }\n    }\n\n    const ray = Ray3d.createZero();\n    for (const p of maxPoints) {\n      // Make a line from...\n      //  1) exactly the max point of the loops to\n      //  2) a point clearly outside the big range\n      // If p came from some inner loop this will...\n      //  1) create a bridge from the inner loop through any containing loops (always)\n      //  2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)\n      const bridgeLength = margin + Ray3d.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;\n      const outside = Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);\n      const bridgeLine = LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);\n      this.extraGeometry.addMember(bridgeLine, true);\n    }\n  }\n\n  /**\n   * Markup and assembly steps for geometry in the RegionGroups.\n   * * Annotate connection from group to curves.\n   *    * groups with point data but no curves get no further annotation.\n   * * compute intersections.\n   * * assemble and merge the HalfEdgeGraph.\n   * @param mergeTolerance absolute distance tolerance for merging loops\n   */\n  public annotateAndMergeCurvesInGraph(mergeTolerance: number = Geometry.smallMetricDistance) {\n    const allPrimitives: CurvePrimitive[] = [];\n    // ASSUME loops have fine-grained types -- no linestrings !!\n    for (const group of [this.groupA, this.groupB, this.extraGeometry]) {\n      for (const member of group.members) {\n        let k = allPrimitives.length;\n        if (member.region instanceof GeometryQuery) {\n          RegionOps.collectCurvePrimitives(member.region, allPrimitives, true, true);\n          for (; k < allPrimitives.length; k++)\n            allPrimitives[k].parent = member;\n        }\n      }\n    }\n    //    const range = RegionOps.curveArrayRange(allPrimitives);\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);\n    this.graph = graph;\n    this.faceAreaFunction = faceAreaFromCurvedEdgeData;\n  }\n  private _announceFaceFunction?: AnnounceClassifiedFace;\n  /**\n   * Sweep through the graph to assign in/out classifications to all faces.\n   * * the classification is announced in two ways:\n   *   * the EXTERNAL mask is set on all half edges that are NOT interior faces.\n   *   * the announceFaceFunction is called once for each face.\n   * @param binaryOp\n   * @param announceFaceFunction\n   */\n  public runClassificationSweep(\n    binaryOp: RegionBinaryOpType,\n    announceFaceFunction?: AnnounceClassifiedFace) {\n    this._announceFaceFunction = announceFaceFunction;\n    this.binaryOp = binaryOp;\n    this.graph.clearMask(HalfEdgeMask.EXTERIOR);\n    for (const group of [this.groupA, this.groupB]) {\n      group.clearState();\n    }\n    const faceHasBeenVisitedMask = this.graph.grabMask();\n    const nodeHasBeenVisitedMask = this.graph.grabMask();\n    const componentArray = GraphComponentArray.create(this.graph);\n    for (const component of componentArray.components) {\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(component.faces, this.faceAreaFunction);\n      if (exteriorHalfEdge) {\n        const exteriorMask = HalfEdgeMask.EXTERIOR;\n        const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;\n        this.graph.clearMask(allMasksToClear);\n        RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this);\n      }\n    }\n    this.graph.dropMask(faceHasBeenVisitedMask);\n    this.graph.dropMask(nodeHasBeenVisitedMask);\n  }\n  // search the graph for faces with\n  // .. exactly 2 edges\n  // .. both with given mask\n  // .. at least one mate is not exterior.\n  // .. clear that mark\n  public unmaskMaskedNullFaces(mask: number) {\n    for (const nodeA of this.graph.allHalfEdges) {\n      const nodeB = nodeA.faceSuccessor;\n      if (nodeB.faceSuccessor === nodeA) {\n        if (nodeA.getMask(mask) && nodeB.getMask(mask)) {\n          if (!nodeA.edgeMate.getMask(mask) || !nodeB.edgeMate.getMask(mask)) {\n            nodeA.clearMask(mask);\n            nodeB.clearMask(mask);\n          }\n        }\n      }\n    }\n  }\n  private getInOut(): boolean {\n    if (this.binaryOp === RegionBinaryOpType.Union)\n      return this.groupA.getInOut() || this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Intersection)\n      return this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.AMinusB)\n      return this.groupA.getInOut() && !this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.BMinusA)\n      return !this.groupA.getInOut() && this.groupB.getInOut();\n    if (this.binaryOp === RegionBinaryOpType.Parity)\n      return this.groupA.getInOut() !== this.groupB.getInOut();\n    return false;\n  }\n  /**\n   * Record transition across an edge as entry or exit from a RegionGroup.\n   * * Work backward from the node to a RegionGroup.  This path can be:\n   *   * If the node points to a CurveLocationDetail of a (possibly partial) curve, the path is (take a deep breath)\n   *      * node points to CurveLocation Detail\n   *      * CurveLocationDetail points to curve\n   *      * curve points to RegionGroupMember\n   *  * If the node points directly to a RegionGroup, it's ready to go!!!\n   * @param node\n   * @param delta\n   */\n  private recordTransitionAcrossEdge(node: HalfEdge, delta: number): RegionGroupMember | undefined {\n    const updateRegionGroupMemberState = (member: RegionGroupMember): RegionGroupMember => {\n      if (member.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\n        return member;  // no transition across a bridge edge\n      if (delta !== 0) {\n        const oldSweepState = member.sweepState;\n        member.sweepState += delta;\n        member.parentGroup.recordMemberStateChange(oldSweepState, member.sweepState);\n      }\n      return member;\n    };\n\n    const data = node.edgeTag;\n    if (data instanceof RegionGroupMember)\n      return updateRegionGroupMemberState(data);\n\n    if (data instanceof CurveLocationDetail) {\n      // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.\n      const member = data.curve!.parent;\n      if (member instanceof RegionGroupMember)\n        return updateRegionGroupMemberState(member);\n    }\n    return undefined;\n  }\n  // obligations to act as sweep callback ...\n  /** Announce a representative node on the outer face of a component */\n  public startComponent(outerFaceNode: HalfEdge): boolean {\n    outerFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\n    if (this._announceFaceFunction)\n      this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));\n    return true;\n  }\n  /** Announce return to outer face */\n  public finishComponent(_node: HalfEdge): boolean {\n    return true;\n  }\n  /** Announce entry to a graph face.\n   * * Both both sides of a graph edge are from the same RegionGroupMember.\n   * * Hence \"crossing that edge\" changes the parity count for the RegionGroupMember that owns that edge by 1.\n   * * The parity count for other RegionGroupMembers are never affected by this crossing.\n   * * Crossing a bridge edge does not change the parity count.\n   */\n  public enterFace(_facePathStack: HalfEdge[], newFaceNode: HalfEdge): boolean {\n    this.recordTransitionAcrossEdge(newFaceNode, 1);\n    const state = this.getInOut();\n    if (!state)\n      newFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\n    if (this._announceFaceFunction)\n      this._announceFaceFunction(this.graph, newFaceNode, state ? 1 : 0, faceAreaFromCurvedEdgeData(newFaceNode));\n    return true;\n  }\n  /** Announce face exit */\n  public leaveFace(_facePathStack: HalfEdge[], oldFaceNode: HalfEdge): boolean {\n    this.recordTransitionAcrossEdge(oldFaceNode, -1);\n    return true;\n  }\n}\n/** return xy area between a (part of a) curve and the x axis through a reference point.\n * If detail is undefined or does not have both start and end fractions, just do trapezoid area\n */\nfunction areaUnderPartialCurveXY(detail: CurveLocationDetail | undefined, xyStart: XAndY, xyEnd: XAndY, referencePoint: XAndY): number {\n  // area between trapezoid and axis\n  let trapezoidArea;\n  if (detail && detail.point1) {\n    trapezoidArea = -(detail.point1.x - detail.point.x) * (0.5 * (detail.point.y + detail.point1.y) - referencePoint.y);\n  } else {\n    trapezoidArea = -(xyEnd.x - xyStart.x) * (0.5 * (xyStart.y + xyEnd.y) - referencePoint.y);\n  }\n  let areaToChord = 0.0;\n  if (detail && detail.curve && detail.hasFraction1) {\n\n    if (detail.curve instanceof LineSegment3d) {\n      // ah .. nothing to do for a line segment\n    } else if (detail.curve instanceof Arc3d) {\n      areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1!);\n    }\n  }\n  return trapezoidArea + areaToChord;\n}\n/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves */\nfunction faceAreaFromCurvedEdgeData(faceSeed: HalfEdge): number {\n  let area = 0.0;\n  let edge = faceSeed;\n  do {\n    area += (edge.sortData as number) * areaUnderPartialCurveXY((edge.edgeTag as CurveLocationDetail), edge, edge.faceSuccessor, faceSeed);\n  } while ((edge = edge.faceSuccessor) !== faceSeed);\n  return area;\n}\n\n/**\n * Function to accumulate area under edges\n * Array of nodes representing faces in a subset of a graph.\n * @internal\n */\nexport type NodeAndRangeFunction = (edge: HalfEdge, range: Range2d) => void;\n/**\n * Array of nodes representing faces in a subset of a graph.\n * @internal\n */\nexport class GraphComponent {\n  public faces: HalfEdge[];\n  public faceAreas: number[];\n  public range: Range2d;\n  public constructor(faces: HalfEdge[]) {\n    this.faces = faces;\n    this.range = Range2d.createNull();\n    this.faceAreas = [];\n  }\n  /**\n   * visit all vertices and edges in the component to build face area array and composite range.\n   *\n   * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.\n   * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.\n   */\n  public buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined) {\n    const vertexFunction = (node: HalfEdge) => {\n      if (extendRangeForEdge)\n        extendRangeForEdge(node, this.range);\n      else\n        this.range.extendXY(node.x, node.y);\n      return 0;\n    };\n    this.range.setNull();\n    for (const f of this.faces) {\n      f.sumAroundFace(vertexFunction);\n    }\n    this.faceAreas.length = 0;\n    if (!faceAreaFunction)\n      faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);\n    for (const f of this.faces) {\n      this.faceAreas.push(faceAreaFunction(f));\n    }\n  }\n}\n/** build and hold an array of component data for a HalfEdgeGraph.\n * @internal\n */\nexport class GraphComponentArray {\n  public components: GraphComponent[];\n  public graph: HalfEdgeGraph;\n  private constructor(graph: HalfEdgeGraph) {\n    this.graph = graph;\n    this.components = [];\n  }\n  public static create(graph: HalfEdgeGraph, extendRangeForEdge?: (edge: HalfEdge, range: Range2d) => void): GraphComponentArray {\n    const result = new GraphComponentArray(graph);\n    const componentArrays = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\n    for (const componentFaces of componentArrays) {\n      const component = new GraphComponent(componentFaces);\n      component.buildFaceData(extendRangeForEdge, faceAreaFromCurvedEdgeData);\n      result.components.push(component);\n    }\n    return result;\n  }\n}\n"]}
+{"version":3,"file":"RegionOpsClassificationSweeps.js","sourceRoot":"","sources":["../../../src/curve/RegionOpsClassificationSweeps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAY,aAAa,EAAE,YAAY,EAAwB,MAAM,mBAAmB,CAAC;AAChG,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,kBAAkB,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,4BAA4B,CAAC;AACnE,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC1C,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAG5D,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,yBAAyB,EAAE,MAAM,8CAA8C,CAAC;AACzF,OAAO,EAAE,qBAAqB,EAAE,MAAM,0CAA0C,CAAC;AACjF,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,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAA2B,kBAAkB,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AACrF,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAE5C;;;;;;;;;;;;;;GAcG;AACH,MAAe,kCAAkC;IAC/C,uEAAuE;IAChE,cAAc,CAAC,KAAe;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qCAAqC;IAC9B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD,2BAA2B;IACpB,SAAS,CAAC,cAA0B,EAAE,YAAsB;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,0BAA0B;IACnB,SAAS,CAAC,cAA0B,EAAE,YAAsB;QACjE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAYD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,oCAAqC,SAAQ,kCAAkC;IAC3E,mBAAmB,CAA8B;IACjD,YAAY,CAAY;IACxB,aAAa,CAAe;IACpC,YAAmB,kBAA+C,EAAE,YAA0B;QAC5F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,YAAY,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,2BAA2B;QACtE,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,mBAAmB,GAAG,kBAAkB,CAAC;IAChD,CAAC;IACD,iCAAiC;IACjB,cAAc,CAAC,IAAc,IAAa,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;IACpH;;;OAGG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACa,SAAS,CAAC,cAA0B,EAAE,IAAc;QAClE,MAAM,aAAa,GAAG,IAAI,CAAC,OAAO,CAAC;QACnC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IACpC;;;;;;;;;OASG;IACI,MAAM,CAAC,6BAA6B,CACzC,MAAqB,EACrB,IAAc,EACd,kBAAgC,EAChC,kBAAgC,EAChC,SAA6C;QAE7C,IAAI,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC;YACpC,OAAO;QACT,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC;YACjC,OAAO;QACT,MAAM,aAAa,GAAG,EAAE,CAAC;QACzB,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;QAC3C,IAAI,UAAU,GAAG,IAAI,CAAC;QACtB,GAAG,CAAC;YACF,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBACxC,0DAA0D;gBAC1D,mEAAmE;gBACnE,kDAAkD;gBAClD,6CAA6C;gBAC7C,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC/B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;gBAClC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;gBAC3C,SAAS,GAAG,IAAI,CAAC;gBACjB,IAAI,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC7C,SAAU,CAAC;wBACT,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;wBACzB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;4BACxC,IAAI,CAAC,iBAAiB,CAAC,kBAAkB,CAAC,CAAC;4BAC3C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,IAAI,CAAC;gCAC3C,OAAO;4BACT,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;4BAC7B,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACzB,QAAQ,GAAG,IAAI,CAAC;4BAChB,SAAS,GAAG,IAAI,CAAC;wBACnB,CAAC;wBACD,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;wBACrC,QAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC;wBAClC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;4BAC3B,SAAS,CAAC,SAAS,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;4BAC7C,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gCAC9B,MAAM;4BACR,CAAC;4BACD,aAAa,CAAC,GAAG,EAAE,CAAC;4BACpB,QAAQ,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;4BACnD,aAAa,CAAC,GAAG,EAAE,CAAC;4BACpB,SAAS,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;wBACtD,CAAC;wBACD,IAAI,QAAQ,CAAC,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC;4BAC3C,mBAAmB;4BACnB,OAAO;wBACT,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,8BAA8B;YAC9B,UAAU,GAAG,UAAU,CAAC,aAAa,CAAC;QACxC,CAAC,QAAQ,UAAU,KAAK,IAAI,EAAE;QAC9B,SAAS,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,gBAAgB,CAAC,MAAkC,EAAE,MAAkC,EAAE,kBAA2D,EAAE,eAAyC;QAC3M,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC/E,IAAI,eAAe;YACjB,eAAe,CAAC,gBAAgB,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAChD,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;YACnB,qCAAqC;YACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,iCAAiC;YACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,eAAe;gBACjB,eAAe,CAAC,8BAA8B,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAC9D,2DAA2D;YAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpC,IAAI,eAAe;gBACjB,eAAe,CAAC,kBAAkB,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACxE,IAAI,gBAAgB,KAAK,SAAS;gBAChC,OAAO,SAAS,CAAC;YACnB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;YAC3C,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,EAAE,CAAC;YACzC,MAAM,eAAe,GAAG,YAAY,GAAG,eAAe,GAAG,eAAe,CAAC;YACzE,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;YACjC,MAAM,SAAS,GAAG,IAAI,oCAAoC,CAAC,kBAAkB,EAAE,YAAY,CAAC,CAAC;YAC7F,IAAI,CAAC,6BAA6B,CAAC,KAAK,EAAE,gBAAgB,EAAE,eAAe,EAAE,eAAe,EAAE,SAAS,CAAC,CAAC;YACzG,IAAI,eAAe;gBACjB,eAAe,CAAC,qCAAqC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACvE,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,KAAK,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC;YAChC,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,qCAAqC,CACjD,KAAmC,EACnC,GAAsB,EACtB,QAA4B,EAC5B,KAAmC,EACnC,GAAsB,EACtB,wBAAiC;QAEjC,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,GAAG,YAAY,CAAC,YAAY,CAAC;QACxE,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACxD,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;QACxB,SAAS,CAAC,gBAAgB,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAEhF,mCAAmC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,iBAAiB,CAAC,IAAI,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC7D,SAAS,CAAC,0BAA0B,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,qCAAqC;QACrC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,iCAAiC;QACjC,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACjD,2DAA2D;QAC3D,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,SAAS,CAAC,sBAAsB,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,wBAAwB;YAC1B,SAAS,CAAC,qBAAqB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,CAAN,IAAY,iBAKX;AALD,WAAY,iBAAiB;IAC3B,2DAAS,CAAA;IACT,6DAAU,CAAA;IACV,yEAAgB,CAAA;IAChB,wEAAgB,CAAA;AAClB,CAAC,EALW,iBAAiB,KAAjB,iBAAiB,QAK5B;AAED;;;;;;GAMG;AACH,MAAM,iBAAiB;IACd,MAAM,CAAoE;IAC1E,UAAU,CAAS;IACnB,WAAW,CAAc;IAChC,YAAmB,MAAyE,EAAE,WAAwB;QACpH,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;IACM,UAAU;QACf,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,WAAW;IACf,OAAO,CAAsB;IAC7B,WAAW,CAAoB;IAC/B,MAAM,CAAuB;IAC5B,MAAM,CAAS;IACvB,YAAmB,MAA4B,EAAE,WAA8B;QAC7E,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACD,gEAAgE;IACzD,UAAU;QACf,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,OAAO;YAC/B,MAAM,CAAC,UAAU,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IACM,KAAK;QACV,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,aAAa;gBACnC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB,CAAC;gBACJ,MAAM,MAAM,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACvD,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oFAAoF;IAC7E,QAAQ;QACb,8CAA8C;QAC9C,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,KAAK;YAC9C,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,oDAAoD;QACpD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,MAAM;YAC/C,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,iDAAiD;QACjD,IAAI,IAAI,CAAC,WAAW,KAAK,iBAAiB,CAAC,YAAY;YACrD,OAAO,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mCAAmC;IAC5B,SAAS,CAAC,IAAyD,EAAE,mBAA4B,KAAK;QAC3G,IAAI,IAAI,YAAY,IAAI,IAAI,IAAI,YAAY,YAAY,EAAE,CAAC;YACzD,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,EAA2B,CAAC;YACxD,SAAS,CAAC,6BAA6B,CAAC,WAAW,CAAC,CAAC;YACrD,WAAW,GAAG,qBAAqB,CAAC,KAAK,CAAC,WAAW,CAA0B,CAAC;YAChF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9D,CAAC;aAAM,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;YACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,gBAAgB,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;YAC7D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,uGAAuG;IAChG,uBAAuB,CAAC,QAAgB,EAAE,QAAgB;QAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,IAAI,KAAK;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;aACX,IAAI,KAAK,IAAI,CAAC,KAAK;YACtB,IAAI,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;CACF;AACD;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,OAAO,oBAAoB;IACxB,MAAM,CAAe;IACrB,MAAM,CAAe;IAC5B,mBAAmB;IACZ,aAAa,CAAe;IAC5B,KAAK,CAAiB;IACtB,gBAAgB,CAAwB;IACxC,QAAQ,CAAqB;IACpC,YAAoB,UAA6B,EAAE,UAA6B;QAC9E,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,CAAC,aAAa,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,oCAAoC;IAChF,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,UAA6B,EAAE,UAA6B;QAC/E,OAAO,IAAI,oBAAoB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAC1D,CAAC;IACM,UAAU,CAAC,KAA0C,EAAE,KAA0C;QACtG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,cAAc,EAAE,CAAC;IACxB,CAAC;IACO,YAAY,CAAiB;IAC7B,MAAM,CAAC,gBAAgB,GAAG,QAAQ,CAAC,gBAAgB,CAAC,GAAG,EAAE,CAAC,gBAAgB,CAAE,CAAC,CAAC,+CAA+C;IACrI;;;;;;;OAOG;IACI,cAAc;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,OAAO,GAAG,SAAS,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;QAC1D,IAAI,MAAM,GAAG,GAAG,CAAC;QACjB,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACxJ,IAAI,IAAI,CAAC,YAAY;YACnB,MAAM,IAAI,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAE,6CAA6C;QAC/H,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,MAAM,uBAAuB,GAAG,CAAC,MAAY,EAAE,EAAE;YAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7C,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO;gBAChD,OAAO,CAAG,+BAA+B;YAC3C,IAAI,CAAC,YAAY,GAAG,yBAAyB,CAAC,4BAA4B,CAAC,MAAM,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7I,IAAI,IAAI,CAAC,YAAY;gBACnB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC;QACF,KAAK,MAAM,YAAY,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;YACtE,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;gBAC7B,IAAI,CAAC,CAAC,MAAM,YAAY,IAAI,EAAE,CAAC;oBAC7B,uBAAuB,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBACpC,CAAC;qBAAM,IAAI,CAAC,CAAC,MAAM,YAAY,YAAY,EAAE,CAAC;oBAC5C,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC,QAAQ;wBAClC,uBAAuB,CAAC,IAAI,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,mBAAmB;YACnB,8CAA8C;YAC9C,8CAA8C;YAC9C,2CAA2C;YAC3C,kFAAkF;YAClF,2GAA2G;YAC3G,MAAM,YAAY,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC,uBAAuB,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;YAChI,MAAM,OAAO,GAAG,OAAO,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,oBAAoB,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;YACtG,MAAM,UAAU,GAAG,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACI,6BAA6B,CAAC,iBAAyB,QAAQ,CAAC,mBAAmB;QACxF,MAAM,aAAa,GAAqB,EAAE,CAAC;QAC3C,wDAAwD;QACxD,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YACnE,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACnC,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,CAAC;gBAC7B,IAAI,MAAM,CAAC,MAAM,YAAY,aAAa,EAAE,CAAC;oBAC3C,SAAS,CAAC,sBAAsB,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;oBAC3E,OAAO,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;wBAClC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;gBACrC,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,aAAa,GAAG,UAAU,CAAC,iCAAiC,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;QAClG,MAAM,KAAK,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,aAAa,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QACpG,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,gBAAgB,GAAG,0BAA0B,CAAC;IACrD,CAAC;IACO,qBAAqB,CAA0B;IACvD;;;;;;;OAOG;IACI,sBAAsB,CAAC,QAA4B,EAAE,oBAA6C;QACvG,IAAI,CAAC,qBAAqB,GAAG,oBAAoB,CAAC;QAClD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC;YAC5C,KAAK,CAAC,UAAU,EAAE,CAAC;QACrB,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrD,MAAM,sBAAsB,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;QACrD,MAAM,cAAc,GAAG,mBAAmB,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC9D,KAAK,MAAM,SAAS,IAAI,cAAc,CAAC,UAAU,EAAE,CAAC;YAClD,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,mBAAmB,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;YACzG,IAAI,gBAAgB,EAAE,CAAC;gBACrB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC;gBAC3C,MAAM,eAAe,GAAG,YAAY,GAAG,sBAAsB,GAAG,sBAAsB,CAAC;gBACvF,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,eAAe,CAAC,CAAC;gBACtC,yBAAyB,CAAC,6BAA6B,CACrD,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,sBAAsB,EAAE,sBAAsB,EAAE,IAAI,CACnF,CAAC;YACJ,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,sBAAsB,CAAC,CAAC;IAC9C,CAAC;IACD,kCAAkC;IAClC,qBAAqB;IACrB,0BAA0B;IAC1B,wCAAwC;IACxC,qBAAqB;IACd,qBAAqB,CAAC,IAAY;QACvC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,IAAI,KAAK,CAAC,aAAa,KAAK,KAAK,EAAE,CAAC;gBAClC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/C,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;wBACnE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;wBACtB,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACO,QAAQ;QACd,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,KAAK;YAC5C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,YAAY;YACnD,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC1D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,OAAO;YAC9C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,kBAAkB,CAAC,MAAM;YAC7C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3D,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,0BAA0B,CAAC,IAAc,EAAE,KAAa;QAC9D,MAAM,4BAA4B,GAAG,CAAC,MAAyB,EAAqB,EAAE;YACpF,IAAI,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iBAAiB,CAAC,WAAW;gBAClE,OAAO,MAAM,CAAC,CAAE,qCAAqC;YACvD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,aAAa,GAAG,MAAM,CAAC,UAAU,CAAC;gBACxC,MAAM,CAAC,UAAU,IAAI,KAAK,CAAC;gBAC3B,MAAM,CAAC,WAAW,CAAC,uBAAuB,CAAC,aAAa,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YAC/E,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,IAAI,IAAI,YAAY,iBAAiB;YACnC,OAAO,4BAA4B,CAAC,IAAI,CAAC,CAAC;QAE5C,IAAI,IAAI,YAAY,mBAAmB,EAAE,CAAC;YACxC,kHAAkH;YAClH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAM,CAAC,MAAM,CAAC;YAClC,IAAI,MAAM,YAAY,iBAAiB;gBACrC,OAAO,4BAA4B,CAAC,MAAM,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,2CAA2C;IAC3C,uEAAuE;IAChE,cAAc,CAAC,aAAuB;QAC3C,aAAa,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,aAAa,EAAE,CAAC,CAAC,EAAE,0BAA0B,CAAC,aAAa,CAAC,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACd,CAAC;IACD,qCAAqC;IAC9B,eAAe,CAAC,KAAe;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;OAMG;IACI,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK;YACR,WAAW,CAAC,iBAAiB,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,qBAAqB;YAC5B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,0BAA0B,CAAC,WAAW,CAAC,CAAC,CAAC;QAC9G,OAAO,IAAI,CAAC;IACd,CAAC;IACD,yBAAyB;IAClB,SAAS,CAAC,cAA0B,EAAE,WAAqB;QAChE,IAAI,CAAC,0BAA0B,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,IAAI,CAAC;IACd,CAAC;;AAEH;;;GAGG;AACH,SAAS,uBAAuB,CAC9B,MAAuC,EAAE,OAAc,EAAE,KAAY,EAAE,cAAqB;IAE5F,kCAAkC;IAClC,IAAI,aAAa,CAAC;IAClB,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;QAC5B,aAAa,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IACtH,CAAC;SAAM,CAAC;QACN,aAAa,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;IAC5F,CAAC;IACD,IAAI,WAAW,GAAG,GAAG,CAAC;IACtB,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QAClD,IAAI,MAAM,CAAC,KAAK,YAAY,aAAa,EAAE,CAAC;YAC1C,mCAAmC;QACrC,CAAC;aAAM,IAAI,MAAM,CAAC,KAAK,YAAY,KAAK,EAAE,CAAC;YACzC,WAAW,GAAG,MAAM,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;QAC/E,CAAC;aAAM,CAAC;YACN,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;YACnF,WAAW,GAAG,OAAO,CAAC,CAAC;gBACrB,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,MAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;gBACtG,CAAC,CAAC,CAAC,CAAC;QACR,CAAC;IACH,CAAC;IACD,OAAO,aAAa,GAAG,WAAW,CAAC;AACrC,CAAC;AACD,kHAAkH;AAClH,SAAS,0BAA0B,CAAC,QAAkB;IACpD,IAAI,IAAI,GAAG,GAAG,CAAC;IACf,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,GAAG,CAAC;QACF,IAAI,IAAK,IAAI,CAAC,QAAmB,GAAG,uBAAuB,CAAE,IAAI,CAAC,OAA+B,EAAE,IAAI,EAAE,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IACzI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,QAAQ,EAAE;IACnD,OAAO,IAAI,CAAC;AACd,CAAC;AAQD;;;GAGG;AACH,MAAM,OAAO,cAAc;IAClB,KAAK,CAAa;IAClB,SAAS,CAAW;IACpB,KAAK,CAAU;IACtB,YAAmB,KAAiB;QAClC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACtB,CAAC;IACD;;;;OAIG;IACI,aAAa,CAAC,kBAAoD,EAAE,gBAAkD;QAC3H,MAAM,cAAc,GAAG,CAAC,IAAc,EAAE,EAAE;YACxC,IAAI,kBAAkB;gBACpB,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;;gBAErC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACtC,OAAO,CAAC,CAAC;QACX,CAAC,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACrB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,CAAC,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,gBAAgB;YACnB,gBAAgB,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,mBAAmB,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,mBAAmB;IACvB,UAAU,CAAmB;IAC7B,KAAK,CAAgB;IAC5B,YAAoB,KAAoB;QACtC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;IACvB,CAAC;IACM,MAAM,CAAC,MAAM,CAClB,KAAoB,EAAE,kBAA6D;QAEnF,MAAM,MAAM,GAAG,IAAI,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC9C,MAAM,eAAe,GAAG,mBAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAChH,KAAK,MAAM,cAAc,IAAI,eAAe,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,IAAI,cAAc,CAAC,cAAc,CAAC,CAAC;YACrD,SAAS,CAAC,aAAa,CAAC,kBAAkB,EAAE,0BAA0B,CAAC,CAAC;YACxE,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,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 { Geometry } from \"../Geometry\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask, NodeToNumberFunction } from \"../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../topology/Merging\";\r\nimport { RegularizationContext } from \"../topology/RegularizeFace\";\r\nimport { Arc3d } from \"./Arc3d\";\r\nimport { CurveCurve } from \"./CurveCurve\";\r\nimport { CurveLocationDetail } from \"./CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyRegion } from \"./CurveTypes\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { PlaneAltitudeRangeContext } from \"./internalContexts/PlaneAltitudeRangeContext\";\r\nimport { TransferWithSplitArcs } from \"./internalContexts/TransferWithSplitArcs\";\r\nimport { LineSegment3d } from \"./LineSegment3d\";\r\nimport { Loop } from \"./Loop\";\r\nimport { ParityRegion } from \"./ParityRegion\";\r\nimport { PlanarSubdivision } from \"./Query/PlanarSubdivision\";\r\nimport { GraphCheckPointFunction, RegionBinaryOpType, RegionOps } from \"./RegionOps\";\r\nimport { UnionRegion } from \"./UnionRegion\";\r\n\r\n/**\r\n * base class for callbacks during region sweeps.\r\n * * At start of a component, `startComponent(node)` is called announcing a representative node on the outermost face.\r\n *   * A Component in this usage is a component that is edge connected when ignoring \"exterior bridge edges\".\r\n * * As each face is entered, `enterFace(facePathStack, newFaceNode)` is called\r\n *   * facePathStack[0] is the outermost node of the path from the outer face.\r\n *   * facePathStack[1] is its inside mate.\r\n *   * facePathStack[2k] is the outside node at crossing to face at depth k.\r\n *   * facePathStack[2k+1] is the node where face at depth k was entered.\r\n *   * newFaceNode is the entry node (redundant of stack tip)\r\n *  * On retreat from a face, `leaveFace(facePathStack, faceNode)` is called.\r\n *  * At end of component, `finishComponent (node)` is called.\r\n * * The base class is fully implemented to do nothing during the sweep.\r\n * @internal\r\n */\r\nabstract class RegionOpsFaceToFaceSearchCallbacks {\r\n  /** Announce a representative node on the outer face of a component. */\r\n  public startComponent(_node: HalfEdge): boolean {\r\n    return true;\r\n  }\r\n  /** Announce return to outer face. */\r\n  public finishComponent(_node: HalfEdge): boolean {\r\n    return true;\r\n  }\r\n  /** Announce face entry. */\r\n  public enterFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean {\r\n    return true;\r\n  }\r\n  /** Announce face exit. */\r\n  public leaveFace(_facePathStack: HalfEdge[], _newFaceNode: HalfEdge): boolean {\r\n    return true;\r\n  }\r\n}\r\n/** Function signature to test if a pair of boolean states is to be accepted by area booleans (during face-to-face sweeps)\r\n * @internal\r\n */\r\ntype BinaryBooleanAcceptFunction = (stateA: boolean, stateB: boolean) => boolean;\r\n/** Function signature ot announce classification of a face.\r\n * The `faceType` parameters are\r\n * * -1 for a fully exterior face.  This is a negative area face.\r\n * * 0 for a positive area face classified as \"out\" for the boolean.\r\n * * 1 for a positive area face classified as \"in\" for the boolean.\r\n */\r\ntype AnnounceClassifiedFace = (graph: HalfEdgeGraph, faceSeed: HalfEdge, faceType: -1 | 0 | 1, area: number) => void;\r\n/**\r\n * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.\r\n * * For this linear-boundary case the boundary geometry is carried entirely from the coordinates in the half edges.\r\n * * This assumes the each node in the graph has edgeTag set to:\r\n *   * `edgeTag === undefined` if the edge crossing does not change classification.\r\n *     * for example, an edge added by regularization\r\n *   * `edgeTag === 1` if this is a boundary for the first of the boolean input regions\r\n *   * `edgeTag === 2` if this is a boundary for the second of the boolean input regions\r\n * * constructor\r\n *    * takes caller-supplied function to decide whether to accept a face given its state relative to the two boolean terms.\r\n *    * sets the in/out status of both terms to false.\r\n * * `startComponent` marks the entire outer face as `EXTERIOR`\r\n * * `enterFace`\r\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\r\n *    * ask the faceAcceptFunction if the current term states combine to in/out for the result\r\n *    * if out, set the `EXTERIOR` mask around the face.\r\n * * `leaveFace`\r\n *    * if this is a bounding edge (according to `node.faceTag`) toggle the in/out status if this boolean term.\r\n * * `finishComponent` is not reimplemented.\r\n * @internal\r\n */\r\nclass RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCallbacks {\r\n  private _faceSelectFunction: BinaryBooleanAcceptFunction;\r\n  private _inComponent: boolean[];\r\n  private _exteriorMask: HalfEdgeMask;\r\n  public constructor(acceptFaceFunction: BinaryBooleanAcceptFunction, exteriorMask: HalfEdgeMask) {\r\n    super();\r\n    this._inComponent = [false, false, false]; // entry 0 is never reused.\r\n    this._exteriorMask = exteriorMask;\r\n    this._faceSelectFunction = acceptFaceFunction;\r\n  }\r\n  /** Mark this face as exterior */\r\n  public override startComponent(node: HalfEdge): boolean { node.setMaskAroundFace(this._exteriorMask); return true; }\r\n  /**\r\n   * * If necessary, toggle a term state.\r\n   * * if indicated, mark this face exterior.\r\n   */\r\n  public override enterFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\r\n    const thisFaceIndex = node.edgeTag;\r\n    if (node.edgeTag === 1 || node.edgeTag === 2)\r\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\r\n    if (!this._faceSelectFunction(this._inComponent[1], this._inComponent[2]))\r\n      node.setMaskAroundFace(this._exteriorMask);\r\n    return true;\r\n  }\r\n  /**\r\n   * * If necessary, toggle a term state.\r\n   */\r\n  public override leaveFace(_facePathStack: HalfEdge[], node: HalfEdge): boolean {\r\n    const thisFaceIndex = node.edgeTag;\r\n    if (node.edgeTag === 1 || node.edgeTag === 2)\r\n      this._inComponent[thisFaceIndex] = !this._inComponent[thisFaceIndex];\r\n    return true;\r\n  }\r\n}\r\n/**\r\n * Low level graph search for face classification.\r\n * @internal\r\n */\r\nexport class RegionOpsFaceToFaceSearch {\r\n  /**\r\n   * Run a DFS with face-to-face step announcements.\r\n   * * false return from any function terminates search immediately.\r\n   * * all reachable nodes assumed to have both visit masks clear.\r\n   * @param graph containing graph.\r\n   * @param seed first node to visit.\r\n   * @param faceHasBeenVisited mask marking faces that have been seen.\r\n   * @param nodeHasBeenVisited mask marking node-to-node step around face.\r\n   * @param callbacks callbacks.\r\n   */\r\n  public static faceToFaceSearchFromOuterLoop(\r\n    _graph: HalfEdgeGraph,\r\n    seed: HalfEdge,\r\n    faceHasBeenVisited: HalfEdgeMask,\r\n    nodeHasBeenVisited: HalfEdgeMask,\r\n    callbacks: RegionOpsFaceToFaceSearchCallbacks,\r\n  ): void {\r\n    if (seed.isMaskSet(faceHasBeenVisited))\r\n      return;\r\n    if (!callbacks.startComponent(seed))\r\n      return;\r\n    const facePathStack = [];\r\n    seed.setMaskAroundFace(faceHasBeenVisited);\r\n    let faceWalker = seed;\r\n    do {\r\n      let entryNode = faceWalker;\r\n      let mate = faceWalker.edgeMate;\r\n      if (!mate.isMaskSet(faceHasBeenVisited)) {\r\n        // The faceWalker seed is always on the base of the stack.\r\n        // The stack then contains even-odd pairs of (entryNode, faceNode).\r\n        // entryNode is the node where a face was entered.\r\n        // faceNode is another node around that face.\r\n        facePathStack.push(faceWalker);\r\n        facePathStack.push(mate);\r\n        let faceNode = mate.faceSuccessor;\r\n        mate.setMaskAroundFace(faceHasBeenVisited);\r\n        entryNode = mate;\r\n        if (callbacks.enterFace(facePathStack, mate)) {\r\n          for (; ;) {\r\n            mate = faceNode.edgeMate;\r\n            if (!mate.isMaskSet(faceHasBeenVisited)) {\r\n              mate.setMaskAroundFace(faceHasBeenVisited);\r\n              if (!callbacks.enterFace(facePathStack, mate))\r\n                return;\r\n              facePathStack.push(faceNode);\r\n              facePathStack.push(mate);\r\n              faceNode = mate;\r\n              entryNode = mate;\r\n            }\r\n            faceNode.setMask(nodeHasBeenVisited);\r\n            faceNode = faceNode.faceSuccessor;\r\n            if (faceNode === entryNode) {\r\n              callbacks.leaveFace(facePathStack, faceNode);\r\n              if (facePathStack.length <= 2) {\r\n                break;\r\n              }\r\n              facePathStack.pop();\r\n              faceNode = facePathStack[facePathStack.length - 1];\r\n              facePathStack.pop();\r\n              entryNode = facePathStack[facePathStack.length - 1];\r\n            }\r\n            if (faceNode.isMaskSet(nodeHasBeenVisited)) {\r\n              // this is disaster\r\n              return;\r\n            }\r\n          }\r\n        }\r\n      }\r\n      // continue at outermost level\r\n      faceWalker = faceWalker.faceSuccessor;\r\n    } while (faceWalker !== seed);\r\n    callbacks.finishComponent(seed);\r\n  }\r\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\r\n   * * Each of the binary input terms is a collection of loops\r\n   *   * Within the binary term, in/out is determined by edge-crossing parity rules.\r\n   * * Processing steps are\r\n   *   * Build the loops for each set.\r\n   *      * Each edge labeled with 1 or 2 as binary term identifier.\r\n   *   * find crossings among the edges.\r\n   *      * Edges are split as needed, but split preserves the edgeTag\r\n   *   * sort edges around vertices\r\n   *   * add regularization edges so holes are connected to their parent.\r\n   */\r\n  public static doPolygonBoolean(loopsA: MultiLineStringDataVariant, loopsB: MultiLineStringDataVariant, faceSelectFunction: (inA: boolean, inB: boolean) => boolean, graphCheckPoint?: GraphCheckPointFunction): HalfEdgeGraph | undefined {\r\n    const graph = new HalfEdgeGraph();\r\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\r\n    const seedA = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsA, baseMask, 1);\r\n    const seedB = RegionOps.addLoopsWithEdgeTagToGraph(graph, loopsB, baseMask, 2);\r\n    if (graphCheckPoint)\r\n      graphCheckPoint(\"unmerged loops\", graph, \"U\");\r\n    if (seedA || seedB) {\r\n      // split edges where they cross . . .\r\n      HalfEdgeGraphMerge.splitIntersectingEdges(graph);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After splitIntersectingEdges\", graph, \"S\");\r\n      // sort radially around vertices.\r\n      HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After clusterAndMergeXYTheta\", graph, \"M\");\r\n      // add edges to connect various components  (e.g. holes!!!)\r\n      const context = new RegularizationContext(graph);\r\n      context.regularizeGraph(true, true);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After regularize\", graph, \"MR\");\r\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(graph);\r\n      if (exteriorHalfEdge === undefined)\r\n        return undefined;\r\n      const exteriorMask = HalfEdgeMask.EXTERIOR;\r\n      const faceVisitedMask = graph.grabMask();\r\n      const nodeVisitedMask = graph.grabMask();\r\n      const allMasksToClear = exteriorMask | faceVisitedMask | nodeVisitedMask;\r\n      graph.clearMask(allMasksToClear);\r\n      const callbacks = new RegionOpsBinaryBooleanSweepCallbacks(faceSelectFunction, exteriorMask);\r\n      this.faceToFaceSearchFromOuterLoop(graph, exteriorHalfEdge, faceVisitedMask, nodeVisitedMask, callbacks);\r\n      if (graphCheckPoint)\r\n        graphCheckPoint(\"After faceToFaceSearchFromOuterLoop\", graph, \"MRX\");\r\n      graph.dropMask(faceVisitedMask);\r\n      graph.dropMask(nodeVisitedMask);\r\n      return graph;\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Complete multi-step process for polygon binary booleans starting with arrays of coordinates.\r\n   * * the manyLoopsAndParitySets input is an array.\r\n   * * Each entry is one or more loops.\r\n   * * An entry that is \"just points\" is a simple loop.\r\n   * * An entry that is itself an array of arrays of points is a set of loops with \"parity\" -- relation:\r\n   *    * typically the first is an outer loop an others are holes.\r\n   *    * but if there is self intersection or multiple outer loops, parity rules are applied to decide inner and outer.\r\n   * * Processing steps are\r\n   *   * Build the loops for each set.\r\n   *      * Each edge labeled with index to the outer array.\r\n   *   * find crossings among the edges.\r\n   *      * Edges are split as needed, but split preserves the edgeTag\r\n   *   * sort edges around vertices\r\n   *   * add regularization edges so holes are connected to their parent.\r\n   *   * assign inside/outside by parity within each set and overall union.\r\n   */\r\n  public static doBinaryBooleanBetweenMultiLoopInputs(\r\n    dataA: MultiLineStringDataVariant[],\r\n    opA: RegionGroupOpType,\r\n    binaryOp: RegionBinaryOpType,\r\n    dataB: MultiLineStringDataVariant[],\r\n    opB: RegionGroupOpType,\r\n    purgeSliverExteriorFaces: boolean,\r\n  ): HalfEdgeGraph | undefined {\r\n    const graph = new HalfEdgeGraph();\r\n    const baseMask = HalfEdgeMask.BOUNDARY_EDGE | HalfEdgeMask.PRIMARY_EDGE;\r\n    const callbacks = RegionBooleanContext.create(opA, opB);\r\n    callbacks.graph = graph;\r\n    callbacks.faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);\r\n\r\n    // Add all the members in groupA ..\r\n    for (const data of dataA) {\r\n      if (data.length > 2) {\r\n        const member = new RegionGroupMember(data, callbacks.groupA);\r\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\r\n      }\r\n    }\r\n    for (const data of dataB) {\r\n      if (data.length > 2) {\r\n        const member = new RegionGroupMember(data, callbacks.groupB);\r\n        RegionOps.addLoopsWithEdgeTagToGraph(graph, data, baseMask, member);\r\n      }\r\n    }\r\n    // split edges where they cross . . .\r\n    HalfEdgeGraphMerge.splitIntersectingEdges(graph);\r\n    // sort radially around vertices.\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph);\r\n    // add edges to connect various components  (e.g. holes!!!)\r\n    const context = new RegularizationContext(graph);\r\n    context.regularizeGraph(true, true);\r\n    callbacks.runClassificationSweep(binaryOp);\r\n    if (purgeSliverExteriorFaces)\r\n      callbacks.unmaskMaskedNullFaces(HalfEdgeMask.EXTERIOR);\r\n    return graph;\r\n  }\r\n}\r\n\r\n/**\r\n * Enumeration of operation types \"within a group operand\" for a `RegionBooleanContext`.\r\n * @internal\r\n */\r\nexport enum RegionGroupOpType {\r\n  Union = 0,\r\n  Parity = 1,\r\n  Intersection = 2,\r\n  NonBounding = -1,\r\n}\r\n\r\n/**\r\n * Each loop or parity region in a `RegionBooleanContext` is recorded as a `RegionGroupMember`, which carries\r\n * * the Loop or parityRegion object\r\n * * a numeric indication of the sweep state (parity) during the classification search.\r\n * * a reference to the parent group (which in turn leads back to the `RegionBooleanContext`)\r\n * @internal\r\n */\r\nclass RegionGroupMember {\r\n  public region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant;\r\n  public sweepState: number;\r\n  public parentGroup: RegionGroup;\r\n  public constructor(region: Loop | ParityRegion | CurvePrimitive | MultiLineStringDataVariant, parentGroup: RegionGroup) {\r\n    this.region = region;\r\n    this.parentGroup = parentGroup;\r\n    this.sweepState = 0;\r\n  }\r\n  public clearState() {\r\n    this.sweepState = 0;\r\n  }\r\n}\r\n\r\n/**\r\n * A `RegionGroup` is\r\n * * An array of `RegionGroupMembers`, carrying the regions of the Ai or Bi part of the boolean expression.\r\n * * The `RegionGroupOpType` to be applied among those members.\r\n * * Pointer to the containing context\r\n * * The count of number of regions known to be \"in\" as the search progresses.\r\n * @internal\r\n */\r\nexport class RegionGroup {\r\n  public members: RegionGroupMember[];\r\n  public groupOpType: RegionGroupOpType;\r\n  public parent: RegionBooleanContext;\r\n  private _numIn: number;\r\n  public constructor(parent: RegionBooleanContext, groupOpType: RegionGroupOpType) {\r\n    this.members = [];\r\n    this.parent = parent;\r\n    this.groupOpType = groupOpType;\r\n    this._numIn = 0;\r\n  }\r\n  /** deep clear of state data -- group header plus all members */\r\n  public clearState() {\r\n    for (const member of this.members)\r\n      member.clearState();\r\n    this._numIn = 0;\r\n  }\r\n  public range(): Range3d {\r\n    const range = Range3d.createNull();\r\n    for (const m of this.members) {\r\n      if (m.region instanceof GeometryQuery)\r\n        m.region.extendRange(range);\r\n      else {\r\n        const range1 = Range3d.createFromVariantData(m.region);\r\n        range.extendRange(range1);\r\n      }\r\n    }\r\n    return range;\r\n  }\r\n  /** Ask if the current _numIn count qualifies as an \"in\" for this operation type. */\r\n  public getInOut(): boolean {\r\n    // UNION is true if one or more members are IN\r\n    if (this.groupOpType === RegionGroupOpType.Union)\r\n      return this._numIn > 0;\r\n    // PARITY is true if an odd number of regions are IN\r\n    if (this.groupOpType === RegionGroupOpType.Parity)\r\n      return Geometry.isOdd(this._numIn);\r\n    // INTERSECTION is true if ALL the regions are IN\r\n    if (this.groupOpType === RegionGroupOpType.Intersection)\r\n      return this._numIn === this.members.length;\r\n    return false;\r\n  }\r\n  // push new members into the group.\r\n  public addMember(data: AnyRegion | AnyRegion[] | LineSegment3d | undefined, allowLineSegment: boolean = false) {\r\n    if (data instanceof Loop || data instanceof ParityRegion) {\r\n      let cleanerData = data.clone() as (ParityRegion | Loop);\r\n      RegionOps.consolidateAdjacentPrimitives(cleanerData);\r\n      cleanerData = TransferWithSplitArcs.clone(cleanerData) as (ParityRegion | Loop);\r\n      this.members.push(new RegionGroupMember(cleanerData, this));\r\n    } else if (data instanceof UnionRegion) {\r\n      for (const child of data.children) {\r\n        this.addMember(child);\r\n      }\r\n    } else if (Array.isArray(data)) {\r\n      for (const item of data) {\r\n        this.addMember(item);\r\n      }\r\n    } else if (allowLineSegment && data instanceof LineSegment3d) {\r\n      this.members.push(new RegionGroupMember(data, this));\r\n    }\r\n  }\r\n  // update the \"in\" count _numIn according to old and new states (parity counts) for some member region.\r\n  public recordMemberStateChange(oldState: number, newState: number) {\r\n    const oldIn = Geometry.isOdd(oldState);\r\n    const newIn = Geometry.isOdd(newState);\r\n    if (!oldIn && newIn)\r\n      this._numIn++;\r\n    else if (oldIn && !newIn)\r\n      this._numIn--;\r\n  }\r\n}\r\n/**\r\n * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.\r\n * * In the binary operation OP (union, intersection, parity, difference), the left and right operands\r\n * are each a composite union, difference, or parity among multiple inputs, i.e.,\r\n *   * (operationA among Ai) OP (operationB among Bi)\r\n *   * where the Ai are one set of regions, being combined by operationA\r\n *   * and the Bi are the another set of regions, being combined by operationB.\r\n * * Each group of Ai and Bi is a `RegionGroup`.\r\n * * This is an extremely delicate structure.\r\n * * Members are public because of the unique variety of queries, but should only be used for queries.\r\n * * The graph and curves in the booleans are connected by an extended pointer chain:\r\n *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail.\r\n *    * (CurveLocationDetail).curve points to a curve.\r\n *    * (Curve).parent points to RegionGroupMember.\r\n *    * (RegionGroupMember) points to RegionGroup.\r\n *    * (RegionGroup) points to RegionBooleanBinaryContext.\r\n * * So when a graph sweep crosses an edge\r\n *    * the chain leads to a parity count in the RegionGroupMember.\r\n *    * that can change the number of members active in the RegionGroup.\r\n *    * which can change the state of the context.\r\n * @internal\r\n */\r\nexport class RegionBooleanContext implements RegionOpsFaceToFaceSearchCallbacks {\r\n  public groupA!: RegionGroup;\r\n  public groupB!: RegionGroup;\r\n  /** bridge edges */\r\n  public extraGeometry!: RegionGroup;\r\n  public graph!: HalfEdgeGraph;\r\n  public faceAreaFunction!: NodeToNumberFunction;\r\n  public binaryOp: RegionBinaryOpType;\r\n  private constructor(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType) {\r\n    this.groupA = new RegionGroup(this, groupTypeA);\r\n    this.groupB = new RegionGroup(this, groupTypeB);\r\n    this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);\r\n    this.binaryOp = RegionBinaryOpType.Union; // revised in runClassificationSweep\r\n  }\r\n  /**\r\n   * Create a context with both A and B groups empty.\r\n   * * Caller follows up by calls to `context.groupA.addMember (loopOrParityRegion)` or `context.groupB.addMember (loopOrParityRegion)`\r\n   * @param groupTypeA\r\n   * @param groupTypeB\r\n   */\r\n  public static create(groupTypeA: RegionGroupOpType, groupTypeB: RegionGroupOpType): RegionBooleanContext {\r\n    return new RegionBooleanContext(groupTypeA, groupTypeB);\r\n  }\r\n  public addMembers(dataA: AnyRegion | AnyRegion[] | undefined, dataB: AnyRegion | AnyRegion[] | undefined) {\r\n    this.groupA.addMember(dataA);\r\n    this.groupB.addMember(dataB);\r\n    this.addConnectives();\r\n  }\r\n  private _workSegment?: LineSegment3d;\r\n  private static _bridgeDirection = Vector3d.createNormalized(1.0, -0.12328974132467)!; // magic unit direction to minimize vertex hits\r\n  /**\r\n   * The sweep operations require access to all geometry by edge crossings and face walk.\r\n   * If input loops are non-overlapping, there may be disconnected islands not reachable.\r\n   * This method:\r\n   * * finds the total range\r\n   * * creates parallel rays from the extreme point of each loop and extending beyond the overall range\r\n   * * places those lines in the extraGeometry group\r\n   */\r\n  public addConnectives() {\r\n    const rangeA = this.groupA.range();\r\n    const rangeB = this.groupB.range();\r\n    const rangeAB = rangeA.union(rangeB);\r\n    const areaTol = RegionOps.computeXYAreaTolerance(rangeAB);\r\n    let margin = 0.1;\r\n    this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(rangeAB.corners(), RegionBooleanContext._bridgeDirection, this._workSegment);\r\n    if (this._workSegment)\r\n      margin *= this._workSegment.point0Ref.distanceXY(this._workSegment.point1Ref);  // how much further to extend each bridge ray\r\n    const maxPoints: Point3d[] = [];\r\n    const findExtremePointsInLoop = (region: Loop) => {\r\n      const area = RegionOps.computeXYArea(region);\r\n      if (area === undefined || Math.abs(area) < areaTol)\r\n        return;   // avoid bridging trivial faces\r\n      this._workSegment = PlaneAltitudeRangeContext.findExtremePointsInDirection(region, RegionBooleanContext._bridgeDirection, this._workSegment);\r\n      if (this._workSegment)\r\n        maxPoints.push(this._workSegment.point1Ref);\r\n    };\r\n    for (const groupMembers of [this.groupA.members, this.groupB.members]) {\r\n      for (const m of groupMembers) {\r\n        if (m.region instanceof Loop) {\r\n          findExtremePointsInLoop(m.region);\r\n        } else if (m.region instanceof ParityRegion) {\r\n          for (const loop of m.region.children)\r\n            findExtremePointsInLoop(loop);\r\n        }\r\n      }\r\n    }\r\n    const ray = Ray3d.createZero();\r\n    for (const p of maxPoints) {\r\n      // Make a line from\r\n      //    1) exactly the max point of the loops to\r\n      //    2) a point clearly outside the big range\r\n      // If p came from some inner loop this will\r\n      //    1) create a bridge from the inner loop through any containing loops (always)\r\n      //    2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)\r\n      const bridgeLength = margin + Ray3d.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;\r\n      const outside = Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);\r\n      const bridgeLine = LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);\r\n      this.extraGeometry.addMember(bridgeLine, true);\r\n    }\r\n  }\r\n  /**\r\n   * Markup and assembly steps for geometry in the RegionGroups.\r\n   * * Annotate connection from group to curves.\r\n   *    * groups with point data but no curves get no further annotation.\r\n   * * compute intersections.\r\n   * * assemble and merge the HalfEdgeGraph.\r\n   * @param mergeTolerance absolute distance tolerance for merging loops\r\n   */\r\n  public annotateAndMergeCurvesInGraph(mergeTolerance: number = Geometry.smallMetricDistance) {\r\n    const allPrimitives: CurvePrimitive[] = [];\r\n    // ASSUME loops have fine-grained types (no linestrings)\r\n    for (const group of [this.groupA, this.groupB, this.extraGeometry]) {\r\n      for (const member of group.members) {\r\n        let k = allPrimitives.length;\r\n        if (member.region instanceof GeometryQuery) {\r\n          RegionOps.collectCurvePrimitives(member.region, allPrimitives, true, true);\r\n          for (; k < allPrimitives.length; k++)\r\n            allPrimitives[k].parent = member;\r\n        }\r\n      }\r\n    }\r\n    const intersections = CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);\r\n    const graph = PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);\r\n    this.graph = graph;\r\n    this.faceAreaFunction = faceAreaFromCurvedEdgeData;\r\n  }\r\n  private _announceFaceFunction?: AnnounceClassifiedFace;\r\n  /**\r\n   * Sweep through the graph to assign in/out classifications to all faces.\r\n   * * the classification is announced in two ways:\r\n   *   * the EXTERNAL mask is set on all half edges that are NOT interior faces.\r\n   *   * the announceFaceFunction is called once for each face.\r\n   * @param binaryOp\r\n   * @param announceFaceFunction\r\n   */\r\n  public runClassificationSweep(binaryOp: RegionBinaryOpType, announceFaceFunction?: AnnounceClassifiedFace): void {\r\n    this._announceFaceFunction = announceFaceFunction;\r\n    this.binaryOp = binaryOp;\r\n    this.graph.clearMask(HalfEdgeMask.EXTERIOR);\r\n    for (const group of [this.groupA, this.groupB])\r\n      group.clearState();\r\n    const faceHasBeenVisitedMask = this.graph.grabMask();\r\n    const nodeHasBeenVisitedMask = this.graph.grabMask();\r\n    const componentArray = GraphComponentArray.create(this.graph);\r\n    for (const component of componentArray.components) {\r\n      const exteriorHalfEdge = HalfEdgeGraphSearch.findMinimumAreaFace(component.faces, this.faceAreaFunction);\r\n      if (exteriorHalfEdge) {\r\n        const exteriorMask = HalfEdgeMask.EXTERIOR;\r\n        const allMasksToClear = exteriorMask | faceHasBeenVisitedMask | nodeHasBeenVisitedMask;\r\n        this.graph.clearMask(allMasksToClear);\r\n        RegionOpsFaceToFaceSearch.faceToFaceSearchFromOuterLoop(\r\n          this.graph, exteriorHalfEdge, faceHasBeenVisitedMask, nodeHasBeenVisitedMask, this,\r\n        );\r\n      }\r\n    }\r\n    this.graph.dropMask(faceHasBeenVisitedMask);\r\n    this.graph.dropMask(nodeHasBeenVisitedMask);\r\n  }\r\n  // search the graph for faces with\r\n  // .. exactly 2 edges\r\n  // .. both with given mask\r\n  // .. at least one mate is not exterior.\r\n  // .. clear that mark\r\n  public unmaskMaskedNullFaces(mask: number) {\r\n    for (const nodeA of this.graph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      if (nodeB.faceSuccessor === nodeA) {\r\n        if (nodeA.getMask(mask) && nodeB.getMask(mask)) {\r\n          if (!nodeA.edgeMate.getMask(mask) || !nodeB.edgeMate.getMask(mask)) {\r\n            nodeA.clearMask(mask);\r\n            nodeB.clearMask(mask);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n  private getInOut(): boolean {\r\n    if (this.binaryOp === RegionBinaryOpType.Union)\r\n      return this.groupA.getInOut() || this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.Intersection)\r\n      return this.groupA.getInOut() && this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.AMinusB)\r\n      return this.groupA.getInOut() && !this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.BMinusA)\r\n      return !this.groupA.getInOut() && this.groupB.getInOut();\r\n    if (this.binaryOp === RegionBinaryOpType.Parity)\r\n      return this.groupA.getInOut() !== this.groupB.getInOut();\r\n    return false;\r\n  }\r\n  /**\r\n   * Record transition across an edge as entry or exit from a RegionGroup.\r\n   * * Work backward from the node to a RegionGroup.  This path can be:\r\n   *   * If the node points to a CurveLocationDetail of a (possibly partial) curve, the path is (take a deep breath)\r\n   *      * node points to CurveLocation Detail\r\n   *      * CurveLocationDetail points to curve\r\n   *      * curve points to RegionGroupMember\r\n   *  * If the node points directly to a RegionGroup, it's ready to go!!!\r\n   * @param node\r\n   * @param delta\r\n   */\r\n  private recordTransitionAcrossEdge(node: HalfEdge, delta: number): RegionGroupMember | undefined {\r\n    const updateRegionGroupMemberState = (member: RegionGroupMember): RegionGroupMember => {\r\n      if (member.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\r\n        return member;  // no transition across a bridge edge\r\n      if (delta !== 0) {\r\n        const oldSweepState = member.sweepState;\r\n        member.sweepState += delta;\r\n        member.parentGroup.recordMemberStateChange(oldSweepState, member.sweepState);\r\n      }\r\n      return member;\r\n    };\r\n\r\n    const data = node.edgeTag;\r\n    if (data instanceof RegionGroupMember)\r\n      return updateRegionGroupMemberState(data);\r\n\r\n    if (data instanceof CurveLocationDetail) {\r\n      // We trust that the caller has linked from the graph node to a curve which has a RegionGroupMember as its parent.\r\n      const member = data.curve!.parent;\r\n      if (member instanceof RegionGroupMember)\r\n        return updateRegionGroupMemberState(member);\r\n    }\r\n    return undefined;\r\n  }\r\n  // obligations to act as sweep callback ...\r\n  /** Announce a representative node on the outer face of a component. */\r\n  public startComponent(outerFaceNode: HalfEdge): boolean {\r\n    outerFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\r\n    if (this._announceFaceFunction)\r\n      this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));\r\n    return true;\r\n  }\r\n  /** Announce return to outer face. */\r\n  public finishComponent(_node: HalfEdge): boolean {\r\n    return true;\r\n  }\r\n  /**\r\n   * Announce entry to a graph face.\r\n   * * Both both sides of a graph edge are from the same RegionGroupMember.\r\n   * * Hence \"crossing that edge\" changes the parity count for the RegionGroupMember that owns that edge by 1.\r\n   * * The parity count for other RegionGroupMembers are never affected by this crossing.\r\n   * * Crossing a bridge edge does not change the parity count.\r\n   */\r\n  public enterFace(_facePathStack: HalfEdge[], newFaceNode: HalfEdge): boolean {\r\n    this.recordTransitionAcrossEdge(newFaceNode, 1);\r\n    const state = this.getInOut();\r\n    if (!state)\r\n      newFaceNode.setMaskAroundFace(HalfEdgeMask.EXTERIOR);\r\n    if (this._announceFaceFunction)\r\n      this._announceFaceFunction(this.graph, newFaceNode, state ? 1 : 0, faceAreaFromCurvedEdgeData(newFaceNode));\r\n    return true;\r\n  }\r\n  /** Announce face exit */\r\n  public leaveFace(_facePathStack: HalfEdge[], oldFaceNode: HalfEdge): boolean {\r\n    this.recordTransitionAcrossEdge(oldFaceNode, -1);\r\n    return true;\r\n  }\r\n}\r\n/**\r\n * Return xy area between (part of) a curve and the x axis through a reference point.\r\n * If detail is undefined or does not have both start and end fractions, just do trapezoid area.\r\n */\r\nfunction areaUnderPartialCurveXY(\r\n  detail: CurveLocationDetail | undefined, xyStart: XAndY, xyEnd: XAndY, referencePoint: XAndY,\r\n): number {\r\n  // area between trapezoid and axis\r\n  let trapezoidArea;\r\n  if (detail && detail.point1) {\r\n    trapezoidArea = -(detail.point1.x - detail.point.x) * (0.5 * (detail.point.y + detail.point1.y) - referencePoint.y);\r\n  } else {\r\n    trapezoidArea = -(xyEnd.x - xyStart.x) * (0.5 * (xyStart.y + xyEnd.y) - referencePoint.y);\r\n  }\r\n  let areaToChord = 0.0;\r\n  if (detail && detail.curve && detail.hasFraction1) {\r\n    if (detail.curve instanceof LineSegment3d) {\r\n      // nothing to do for a line segment\r\n    } else if (detail.curve instanceof Arc3d) {\r\n      areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1!);\r\n    } else {\r\n      const partial = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1!);\r\n      areaToChord = partial ?\r\n        RegionOps.computeXYArea(Loop.create(partial, LineSegment3d.create(detail.point1!, detail.point))) ?? 0\r\n        : 0;\r\n    }\r\n  }\r\n  return trapezoidArea + areaToChord;\r\n}\r\n/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves. */\r\nfunction faceAreaFromCurvedEdgeData(faceSeed: HalfEdge): number {\r\n  let area = 0.0;\r\n  let edge = faceSeed;\r\n  do {\r\n    area += (edge.sortData as number) * areaUnderPartialCurveXY((edge.edgeTag as CurveLocationDetail), edge, edge.faceSuccessor, faceSeed);\r\n  } while ((edge = edge.faceSuccessor) !== faceSeed);\r\n  return area;\r\n}\r\n\r\n/**\r\n * Function to accumulate area under edges.\r\n * Array of nodes representing faces in a subset of a graph.\r\n * @internal\r\n */\r\nexport type NodeAndRangeFunction = (edge: HalfEdge, range: Range2d) => void;\r\n/**\r\n * Array of nodes representing faces in a subset of a graph.\r\n * @internal\r\n */\r\nexport class GraphComponent {\r\n  public faces: HalfEdge[];\r\n  public faceAreas: number[];\r\n  public range: Range2d;\r\n  public constructor(faces: HalfEdge[]) {\r\n    this.faces = faces;\r\n    this.range = Range2d.createNull();\r\n    this.faceAreas = [];\r\n  }\r\n  /**\r\n   * Visit all vertices and edges in the component to build face area array and composite range.\r\n   * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.\r\n   * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.\r\n   */\r\n  public buildFaceData(extendRangeForEdge: NodeAndRangeFunction | undefined, faceAreaFunction: NodeToNumberFunction | undefined) {\r\n    const vertexFunction = (node: HalfEdge) => {\r\n      if (extendRangeForEdge)\r\n        extendRangeForEdge(node, this.range);\r\n      else\r\n        this.range.extendXY(node.x, node.y);\r\n      return 0;\r\n    };\r\n    this.range.setNull();\r\n    for (const f of this.faces) {\r\n      f.sumAroundFace(vertexFunction);\r\n    }\r\n    this.faceAreas.length = 0;\r\n    if (!faceAreaFunction)\r\n      faceAreaFunction = (node) => HalfEdgeGraphSearch.signedFaceArea(node);\r\n    for (const f of this.faces) {\r\n      this.faceAreas.push(faceAreaFunction(f));\r\n    }\r\n  }\r\n}\r\n/**\r\n * Build and hold an array of component data for a HalfEdgeGraph.\r\n * @internal\r\n */\r\nexport class GraphComponentArray {\r\n  public components: GraphComponent[];\r\n  public graph: HalfEdgeGraph;\r\n  private constructor(graph: HalfEdgeGraph) {\r\n    this.graph = graph;\r\n    this.components = [];\r\n  }\r\n  public static create(\r\n    graph: HalfEdgeGraph, extendRangeForEdge?: (edge: HalfEdge, range: Range2d) => void,\r\n  ): GraphComponentArray {\r\n    const result = new GraphComponentArray(graph);\r\n    const componentArrays = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    for (const componentFaces of componentArrays) {\r\n      const component = new GraphComponent(componentFaces);\r\n      component.buildFaceData(extendRangeForEdge, faceAreaFromCurvedEdgeData);\r\n      result.components.push(component);\r\n    }\r\n    return result;\r\n  }\r\n}\r\n"]}