@itwin/core-geometry 5.14.0-dev.5 → 5.14.0-dev.8

package/lib/cjs/topology/Merging.d.ts

@@ -102,7 +102,7 @@ export declare class HalfEdgeGraphOps {
  * @internal
  */
 export declare class HalfEdgeGraphMerge {
-    static getCommonThetaEndIndex(clusters: ClusterableArray, order: Uint32Array, kA: number, kB: number): number;
+    static getCommonThetaEndIndex(clusters: ClusterableArray, order: Uint32Array, kA: number, kB: number, radianTol?: number): number;
     private static _announceVertexNeighborhoodFunction?;
     /**
      * public property setter for a function to be called with sorted edge data around a vertex.
@@ -112,6 +112,8 @@ export declare class HalfEdgeGraphMerge {
     private static secondarySortAroundVertex;
     /** Return the sort key for sorting by curvature.
      * * This is the signed distance from the curve at the edge start, to center of curvature.
+     * * ASSUME: edgeTag is a `CurveLocationDetail` whose fractions [f0,f1] define the detail.curve segment traversed
+     * by the edge. If sortData < 0, the edge traverses the curve segment in reverse order [f1,f0].
      * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.
      */
     static curvatureSortKey(node: HalfEdge): number;
@@ -133,7 +135,7 @@ export declare class HalfEdgeGraphMerge {
      * @param outboundRadiansFunction optional function to compute the sort angle of an edge at its start vertex
      * @param clusterTol optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
-    static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number, clusterTol?: number): void;
+    static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number, clusterTol?: number, radianTol?: number): void;
     private static buildVerticalSweepPriorityQueue;
     private static computeIntersectionFractionsOnEdges;
     /**

package/lib/cjs/topology/Merging.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Merging.d.ts","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAChF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAEhE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAOhE,qBAAa,cAAc;IAClB,SAAS,SAAK;IACd,mBAAmB,SAAK;IACxB,QAAQ,SAAK;IACb,SAAS,SAAK;IACd,OAAO,SAAK;IACZ,OAAO,SAAK;;CAGpB;AACD;;GAEG;AACH,qBAAa,0BAA0B;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,iBAAiB,EAAE,MAAM,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;gBACL,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,MAAM;CAMhF;AAED,8EAA8E;AAC9E,MAAM,MAAM,kCAAkC,GAAG,CAAC,IAAI,EAAE,0BAA0B,EAAE,KAAK,GAAG,CAAC;AAC7F;;;GAGG;AACH,qBAAa,gBAAgB;IAE3B,iFAAiF;WACnE,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ;IAgBvD,mIAAmI;WACrH,UAAU,CAAC,KAAK,EAAE,QAAQ;IAQxC;;;;OAIG;WACW,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;IAIjG,iDAAiD;WACnC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC,GAAG,OAAO;IAOjE,oDAAoD;WACtC,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC,GAAG,OAAO;IAQnE,gFAAgF;WAClE,wBAAwB,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,QAAQ,EAAE;IAwB7H;;;;;OAKG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa;IAMlD;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAmB7C;;;;;;;;OAQG;WACW,qCAAqC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,GAAE,YAAyC,GAAG,MAAM;IAqBzJ;;;;;;;OAOG;WACW,wCAAwC,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,GAAE,YAAyC,GAAG,QAAQ,EAAE,GAAG,SAAS;IAiBxJ;;;;;;;OAOG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,GAAE,YAAyC,GAAG,MAAM;IAWjH;;;;;OAKG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,GAAE,YAAoC,GAAG,OAAO;CAU5G;AAED;;;GAGG;AACH,qBAAa,kBAAkB;WAIf,sBAAsB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;IAYpH,OAAO,CAAC,MAAM,CAAC,mCAAmC,CAAC,CAAqC;IACxF;;OAEG;IACH,WAAkB,kCAAkC,CAAC,IAAI,EAAE,kCAAkC,GAAG,SAAS,EAAsD;IAC/J,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAqB3C,OAAO,CAAC,MAAM,CAAC,yBAAyB;IAqBxC;;;OAGG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IActD,4FAA4F;WAC9E,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAGjD;;;;;;;;;;;;;;;OAeG;WACW,sBAAsB,CAClC,KAAK,EAAE,aAAa,EACpB,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,KAAK,MAAM,EAClD,UAAU,GAAE,MAAqC;IA2HnD,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAW9C,OAAO,CAAC,MAAM,CAAC,mCAAmC;IAkClD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,WAAW,GAAE,MAAqC,EAAE,WAAW,GAAE,MAAe,GAAG,cAAc;IA4C5J;;;;;;;;OAQG;WACW,qBAAqB,CAAC,YAAY,EAAE,aAAa,EAAE,GAAG,aAAa;IASjF;;;;OAIG;WACW,mBAAmB,CAAC,MAAM,EAAE,0BAA0B,EAAE,UAAU,GAAE,OAAc,EAAE,IAAI,GAAE,YAAwC,GAAG,aAAa,GAAG,SAAS;CAiB7K"}
+{"version":3,"file":"Merging.d.ts","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAGvD,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAChF,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAEhE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAOhE,qBAAa,cAAc;IAClB,SAAS,SAAK;IACd,mBAAmB,SAAK;IACxB,QAAQ,SAAK;IACb,SAAS,SAAK;IACd,OAAO,SAAK;IACZ,OAAO,SAAK;;CAGpB;AACD;;GAEG;AACH,qBAAa,0BAA0B;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,iBAAiB,EAAE,MAAM,CAAC;IAC1B,IAAI,EAAE,QAAQ,CAAC;IACf,OAAO,CAAC,EAAE,MAAM,CAAC;gBACL,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,MAAM;CAMhF;AAED,8EAA8E;AAC9E,MAAM,MAAM,kCAAkC,GAAG,CAAC,IAAI,EAAE,0BAA0B,EAAE,KAAK,GAAG,CAAC;AAC7F;;;GAGG;AACH,qBAAa,gBAAgB;IAE3B,iFAAiF;WACnE,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ;IAgBvD,mIAAmI;WACrH,UAAU,CAAC,KAAK,EAAE,QAAQ;IAQxC;;;;OAIG;WACW,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;IAIjG,iDAAiD;WACnC,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC,GAAG,OAAO;IAOjE,oDAAoD;WACtC,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,aAAa,CAAC,GAAG,OAAO;IAQnE,gFAAgF;WAClE,wBAAwB,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,QAAQ,EAAE;IAwB7H;;;;;OAKG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa;IAMlD;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAmB7C;;;;;;;;OAQG;WACW,qCAAqC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,GAAE,YAAyC,GAAG,MAAM;IAqBzJ;;;;;;;OAOG;WACW,wCAAwC,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,GAAE,YAAyC,GAAG,QAAQ,EAAE,GAAG,SAAS;IAiBxJ;;;;;;;OAOG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,GAAE,YAAyC,GAAG,MAAM;IAWjH;;;;;OAKG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,GAAE,YAAoC,GAAG,OAAO;CAU5G;AAED;;;GAGG;AACH,qBAAa,kBAAkB;WAIf,sBAAsB,CAAC,QAAQ,EAAE,gBAAgB,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,GAAE,MAAmC,GAAG,MAAM;IAYpK,OAAO,CAAC,MAAM,CAAC,mCAAmC,CAAC,CAAqC;IACxF;;OAEG;IACH,WAAkB,kCAAkC,CAAC,IAAI,EAAE,kCAAkC,GAAG,SAAS,EAAsD;IAC/J,OAAO,CAAC,MAAM,CAAC,4BAA4B;IAqB3C,OAAO,CAAC,MAAM,CAAC,yBAAyB;IAqBxC;;;;;OAKG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM;IActD,4FAA4F;WAC9E,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,OAAO;IAGjD;;;;;;;;;;;;;;;OAeG;WACW,sBAAsB,CAClC,KAAK,EAAE,aAAa,EACpB,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,KAAK,MAAM,EAClD,UAAU,GAAE,MAAqC,EACjD,SAAS,GAAE,MAAmC;IA2HhD,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAW9C,OAAO,CAAC,MAAM,CAAC,mCAAmC;IAkClD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,WAAW,GAAE,MAAqC,EAAE,WAAW,GAAE,MAAe,GAAG,cAAc;IA4C5J;;;;;;;;OAQG;WACW,qBAAqB,CAAC,YAAY,EAAE,aAAa,EAAE,GAAG,aAAa;IASjF;;;;OAIG;WACW,mBAAmB,CAAC,MAAM,EAAE,0BAA0B,EAAE,UAAU,GAAE,OAAc,EAAE,IAAI,GAAE,YAAwC,GAAG,aAAa,GAAG,SAAS;CAiB7K"}

package/lib/cjs/topology/Merging.js

@@ -9,6 +9,7 @@ exports.HalfEdgeGraphMerge = exports.HalfEdgeGraphOps = exports.VertexNeighborho
  * @module Topology
  */
 const core_bentley_1 = require("@itwin/core-bentley");
+const CurveLocationDetail_1 = require("../curve/CurveLocationDetail");
 const LineSegment3d_1 = require("../curve/LineSegment3d");
 const Geometry_1 = require("../Geometry");
 const Angle_1 = require("../geometry3d/Angle");
@@ -252,12 +253,12 @@ class HalfEdgeGraphMerge {
     // return kC such that all angles k are equal, with kA <= k < kC <= kB.
     // * Assume: angles k are stored at extra data index 0.
     // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC
-    static getCommonThetaEndIndex(clusters, order, kA, kB) {
+    static getCommonThetaEndIndex(clusters, order, kA, kB, radianTol = Geometry_1.Geometry.smallAngleRadians) {
         let kC = kA + 1;
         const thetaA = clusters.getExtraData(order[kA], 0);
         while (kC < kB) {
             const thetaB = clusters.getExtraData(order[kC], 0);
-            if (!Angle_1.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {
+            if (!Angle_1.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB, radianTol)) {
                 return kC;
             }
             kC++;
@@ -289,10 +290,10 @@ class HalfEdgeGraphMerge {
     //   * only want to do anything here when curves are present.
     //   * k0<=k<k1 are around a vertex
     //   * These are sorted by theta.
-    static secondarySortAroundVertex(clusters, order, allNodes, k0, k1) {
+    static secondarySortAroundVertex(clusters, order, allNodes, k0, k1, radianTol = Geometry_1.Geometry.smallAngleRadians) {
         const sortData = [];
         for (let k = k0; k < k1;) {
-            const kB = this.getCommonThetaEndIndex(clusters, order, k, k1);
+            const kB = this.getCommonThetaEndIndex(clusters, order, k, k1, radianTol);
             if (k + 1 < kB) {
                 sortData.length = 0;
                 for (let kA = k; kA < kB; kA++) {
@@ -311,18 +312,20 @@ class HalfEdgeGraphMerge {
     }
     /** Return the sort key for sorting by curvature.
      * * This is the signed distance from the curve at the edge start, to center of curvature.
+     * * ASSUME: edgeTag is a `CurveLocationDetail` whose fractions [f0,f1] define the detail.curve segment traversed
+     * by the edge. If sortData < 0, the edge traverses the curve segment in reverse order [f1,f0].
      * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.
      */
     static curvatureSortKey(node) {
-        const cld = node.edgeTag;
-        if (cld !== undefined) {
-            const fraction = cld.fraction;
-            const curve = cld.curve;
-            if (curve) {
-                let radius = curve.fractionToSignedXYRadiusOfCurvature(fraction);
-                if (node.sortData !== undefined && node.sortData < 0)
-                    radius = -radius;
-                return radius;
+        if (node.edgeTag !== undefined) {
+            if (node.edgeTag instanceof CurveLocationDetail_1.CurveLocationDetail) {
+                const cld = node.edgeTag;
+                if (cld.curve !== undefined) {
+                    const reverse = node.sortData !== undefined && node.sortData < 0;
+                    const fraction = (reverse && cld.fraction1 !== undefined) ? cld.fraction1 : cld.fraction;
+                    const radius = cld.curve.fractionToSignedXYRadiusOfCurvature(fraction);
+                    return reverse ? -radius : radius;
+                }
             }
         }
         return 0.0;
@@ -347,11 +350,11 @@ class HalfEdgeGraphMerge {
      * @param outboundRadiansFunction optional function to compute the sort angle of an edge at its start vertex
      * @param clusterTol optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
-    static clusterAndMergeXYTheta(graph, outboundRadiansFunction, clusterTol = Geometry_1.Geometry.smallMetricDistance) {
+    static clusterAndMergeXYTheta(graph, outboundRadiansFunction, clusterTol = Geometry_1.Geometry.smallMetricDistance, radianTol = Geometry_1.Geometry.smallAngleRadians) {
         const allNodes = graph.allHalfEdges;
         const numNodes = allNodes.length;
         graph.clearMask(Graph_1.HalfEdgeMask.NULL_FACE);
-        const clusters = new ClusterableArray_1.ClusterableArray(2, 2, numNodes); // data order: x,y,theta,nodeIndex.  But theta is not set in first round.
+        const clusters = new ClusterableArray_1.ClusterableArray(2, 2, numNodes); // data block: dot,x,y,theta,nodeIndex --- dot and theta are set later
         for (let i = 0; i < numNodes; i++) {
             const nodeA = allNodes[i];
             const xA = nodeA.x;
@@ -359,7 +362,7 @@ class HalfEdgeGraphMerge {
             Graph_1.HalfEdge.pinch(nodeA, nodeA.vertexSuccessor); // pull it out of its current vertex loop.
             clusters.addDirect(xA, yA, 0.0, i);
         }
-        const order = clusters.clusterIndicesLexical(clusterTol);
+        const order = clusters.clusterIndicesLexical(clusterTol); // assign primary sort dot product
         let k0 = 0;
         const numK = order.length;
         for (let k1 = 0; k1 < numK; k1++) {
@@ -394,7 +397,7 @@ class HalfEdgeGraphMerge {
                         getPrecomputedRadians = undefined;
                 }
                 let radians = getPrecomputedRadians ? getPrecomputedRadians(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);
-                if (Angle_1.Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))
+                if (Angle_1.Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI, radianTol))
                     radians = Math.PI;
                 clusters.setExtraData(clusterTableIndex, 0, radians);
             }
@@ -406,10 +409,10 @@ class HalfEdgeGraphMerge {
         // now pinch each neighboring pair together
         for (let k1 = 0; k1 < numK; k1++) {
             if (order[k1] === ClusterableArray_1.ClusterableArray.clusterTerminator) {
-                // nodes identified in order[k0]..order[k1-1] are properly sorted around a vertex.
+                // nodes identified in order[k0]..order[k1-1] are tentatively sorted around a vertex by theta
                 if (k1 > k0) {
                     if (k1 > k0 + 1)
-                        this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1);
+                        this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1, radianTol); // finalize order by resolving ties via curvature
                     this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);
                     const iA = clusters.getExtraData(order[k0], 1);
                     thetaA = clusters.getExtraData(order[k0], 0);
@@ -444,7 +447,7 @@ class HalfEdgeGraphMerge {
                             //  * far vertex is clustered (exactly equal)
                             //  * near vertex curvatures are same (toleranced)
                             // Note that near vertex is already clustered.
-                            if (Angle_1.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {
+                            if (Angle_1.Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB, radianTol)) {
                                 const nodeA1 = nodeA.faceSuccessor;
                                 const nodeB1 = nodeB.edgeMate;
                                 if (nodeA1.isEqualXY(nodeB1)) {

package/lib/cjs/topology/Merging.js.map

@@ -1 +1 @@
-{"version":3,"file":"Merging.js","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAE7C,0DAAuD;AACvD,0CAAuC;AACvC,+CAA4C;AAE5C,+CAAuD;AAEvD,mEAAgE;AAChE,yDAAsD;AACtD,mCAAgE;AAChE,mEAAgF;AAChF,qDAAyD;AACzD,mDAA+C;AAE/C,mBAAmB;AAEnB,MAAa,cAAc;IAClB,SAAS,GAAG,CAAC,CAAC;IACd,mBAAmB,GAAG,CAAC,CAAC;IACxB,QAAQ,GAAG,CAAC,CAAC;IACb,SAAS,GAAG,CAAC,CAAC;IACd,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC,CAAC;IACnB;IACA,CAAC;CACF;AATD,wCASC;AACD;;GAEG;AACH,MAAa,0BAA0B;IAC9B,KAAK,CAAS;IACd,iBAAiB,CAAS;IAC1B,IAAI,CAAW;IACf,OAAO,CAAU;IACxB,YAAmB,KAAa,EAAE,GAAW,EAAE,IAAc,EAAE,OAAgB;QAC7E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,GAAG,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAXD,gEAWC;AAID;;;GAGG;AACH,MAAa,gBAAgB;IAE3B,iFAAiF;IAC1E,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QACrD,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mIAAmI;IAC5H,MAAM,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACvC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAc,EAAE,OAAiB,EAAE,OAAiB;QACtF,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,iDAAiD;IAC1C,MAAM,CAAC,UAAU,CAAC,KAA8B;QACrD,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,YAAY,CAAC,KAA8B;QACvD,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gFAAgF;IACzE,MAAM,CAAC,wBAAwB,CAAC,QAAyB,EAAE,WAA0B,EAAE,IAAkB;QAC9G,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,kFAAkF;QAClF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAE/B,MAAM,KAAK,GAAG,WAAW,CAAC,gBAAgB,CACxC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,EACV,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,GAAG,CAAC,CAAC,CAAC;YAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC7B,UAAU,IAAI,CAAC,CAAC;YAEhB,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAG,sDAAsD;YACvF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,MAAoB,EAAE,OAAqB,EAAE,gBAAwB,CAAC;QAClI,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,8DAA8D;YACjE,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC;QAC1B,CAAC,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,2DAA2D;YAC9D,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,iBAAiB,CAAC;QAC5B,CAAC,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,OAAO,gBAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QAC9I,IAAI,oBAAY,CAAC,SAAS,KAAK,IAAI;YACjC,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClE,gFAAgF;oBAChF,MAAM,aAAa,GAAG,mBAAQ,CAAC,0BAA0B,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;oBACrH,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;wBAChK,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBAC7B,EAAE,SAAS,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,wCAAwC,CAAC,KAAoB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QAC7H,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YACzE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QACtG,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACzF,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,GAAG,GAAG,KAAK,CAAC,kBAAkB,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9F,IAAA,qBAAM,EAAC,cAAc,KAAK,eAAe,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,QAAsB,oBAAY,CAAC,QAAQ;QAC/F,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAChC,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACtB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhND,4CAgNC;AAED;;;GAGG;AACH,MAAa,kBAAkB;IAC7B,uEAAuE;IACvE,uDAAuD;IACvD,+EAA+E;IACxE,MAAM,CAAC,sBAAsB,CAAC,QAA0B,EAAE,KAAkB,EAAE,EAAU,EAAE,EAAU;QACzG,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gBAChE,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACO,MAAM,CAAC,mCAAmC,CAAsC;IACxF;;OAEG;IACI,MAAM,KAAK,kCAAkC,CAAC,IAAoD,IAAI,IAAI,CAAC,mCAAmC,GAAG,IAAI,CAAC,CAAC,CAAC;IACvJ,MAAM,CAAC,4BAA4B,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACtI,IAAI,IAAI,CAAC,mCAAmC,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAiC,EAAE,CAAC;YAClD,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YACvF,CAAC;YACD,IAAI,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;QACrD,CAAC;IAEH,CAAC;IACD,mCAAmC;IACnC,yCAAyC;IACzC,gDAAgD;IAChD,6DAA6D;IAC7D,mCAAmC;IACnC,iCAAiC;IACzB,MAAM,CAAC,yBAAyB,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACnI,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAElD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/D,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;gBACf,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;oBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC;gBACjF,CAAC;gBACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAA6B,EAAE,CAA6B,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;gBAC7H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAAc;QAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,OAA8B,CAAC;QAChD,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC;YAC9B,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;YACxB,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,MAAM,GAAG,KAAK,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;gBACjE,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC;oBAClD,MAAM,GAAG,CAAC,MAAM,CAAC;gBACnB,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,4FAA4F;IACrF,MAAM,CAAC,UAAU,CAAC,IAAc;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC;IACrJ,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,sBAAsB,CAClC,KAAoB,EACpB,uBAAkD,EAClD,aAAqB,mBAAQ,CAAC,mBAAmB;QAEjD,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,mCAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,yEAAyE;QACjI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAE,0CAA0C;YACzF,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACzD,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,sFAAsF;gBACtF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACnB,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE,CAAC;YACtC,IAAI,iBAAiB,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBAC7D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,qBAAqB,GAAG,uBAAuB,CAAC;gBACpD,IAAI,qBAAqB,EAAE,CAAC;oBAC1B,4HAA4H;oBAC5H,MAAM,MAAM,GAAG,KAAK,CAAC,OAA8B,CAAC;oBACpD,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,YAAY,6BAAa;wBAC7F,qBAAqB,GAAG,SAAS,CAAC;gBACtC,CAAC;gBACD,IAAI,OAAO,GAAG,qBAAqB,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtH,IAAI,aAAK,CAAC,oCAAoC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/D,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,sBAAsB,GAAe,EAAE,CAAC;QAC9C,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,MAAM,EAAE,MAAM,CAAC;QAEnB,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,kFAAkF;gBAClF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;wBACb,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrE,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,MAAM,CAAC;oBACnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC5C,8DAA8D;4BAC9D,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BACnD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,6FAA6F;wBAC/F,CAAC;6BAAM,CAAC;4BACN,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAE7B,wCAAwC;4BACxC,wDAAwD;4BACxD,6CAA6C;4BAC7C,kDAAkD;4BAClD,8CAA8C;4BAC9C,IAAI,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gCAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;oCAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAE,kBAAkB;wCACtE,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;wCAC/B,KAAK,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;wCACtC,MAAM,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;wCACvC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oCACtC,CAAC;gCACH,CAAC;4BACH,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,+BAA+B,CAAC,KAAoB;QACjE,MAAM,SAAS,GAAG,IAAI,6DAAqC,EAAE,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YAEnC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,MAAM,CAAC,mCAAmC,CAAC,MAAgB,EAAE,MAAgB,EAAE,MAAc,mBAAQ,CAAC,mBAAmB;QAC/H,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;QAChE,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;QAChE,IAAI,SAAS,GAAG,yBAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAClG,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,qBAAqB,GAAG,CAAC,QAAgB,EAAE,QAAe,EAAE,MAAa,EAAU,EAAE;gBACzF,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC;oBAChE,OAAO,GAAG,CAAC;gBACb,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC5D,OAAO,GAAG,CAAC;gBACb,OAAO,QAAQ,CAAC;YAClB,CAAC,CAAC;YACF,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvE,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;gBACjB,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBACvE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACzE,CAAC;YACD,IAAI,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACvF,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,kEAAkE;YAC9F,IAAI,CAAC,CAAC,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1E,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;oBACjB,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,oEAAoE;oBACjG,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC;gBAC3B,CAAC;;oBACC,SAAS,GAAG,SAAS,CAAC,CAAC,gDAAgD;YAC3E,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB,EAAE,cAAsB,mBAAQ,CAAC,mBAAmB,EAAE,cAAsB,MAAM;QACzI,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,aAAa,GAAG,WAAW,CAAC;QAClC,MAAM,aAAa,GAAG,GAAG,GAAG,aAAa,CAAC;QAC1C,IAAI,CAAC,CAAC;QACN,IAAI,MAAM,CAAC;QACX,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;YAC9D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,SAAS,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;YAChE,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;gBAC9B,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;oBACrF,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;oBAC5F,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBACxF,IAAI,SAAS,EAAE,CAAC;wBACd,MAAM,YAAY,GAAG,CAAC,IAAc,EAAE,QAAiB,EAAQ,EAAE;4BAC/D,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,aAAa,IAAI,QAAQ,GAAG,aAAa,EAAE,CAAC;gCACnF,MAAM,OAAO,GAAG,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gCAC1D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,mCAAmC;gCAC3E,IAAI,CAAC,QAAQ,EAAE,CAAC;4BAClB,CAAC;wBACH,CAAC,CAAC;wBACF,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBACrC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACtC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBACrC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACtC,0EAA0E;oBAC5E,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qBAAqB,CAAC,YAA6B;QAC/D,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,gBAAgB,CAAC,wBAAwB,CAAC,YAAY,EAAE,KAAK,EAAE,oBAAY,CAAC,aAAa,CAAC,CAAC;QAC3F,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAkC,EAAE,aAAsB,IAAI,EAAE,OAAqB,oBAAY,CAAC,YAAY;QAC9I,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,4BAAY,CAAC,iCAAiC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,KAAK,MAAM,IAAI,IAAI,UAAU;YAC3B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF;AAzWD,gDAyWC","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 Topology\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\r\nimport { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\r\nimport { SmallSystem } from \"../numerics/SmallSystem\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { HalfEdgePriorityQueueWithPartnerArray } from \"./HalfEdgePriorityQueue\";\r\nimport { RegularizationContext } from \"./RegularizeFace\";\r\nimport { Triangulator } from \"./Triangulation\";\r\n\r\n// cspell:word XYUV\r\n\r\nexport class GraphSplitData {\r\n  public numUpEdge = 0;\r\n  public numIntersectionTest = 0;\r\n  public numSplit = 0;\r\n  public numPopOut = 0;\r\n  public numA0B0 = 0;\r\n  public numA0B1 = 0;\r\n  public constructor() {\r\n  }\r\n}\r\n/**\r\n * Structure for data used when sorting outbound edges \"around a node\"\r\n */\r\nexport class VertexNeighborhoodSortData {\r\n  public index: number;\r\n  public radiusOfCurvature: number;\r\n  public node: HalfEdge;\r\n  public radians?: number;\r\n  public constructor(index: number, key: number, node: HalfEdge, radians?: number) {\r\n    this.index = index;\r\n    this.radiusOfCurvature = key;\r\n    this.node = node;\r\n    this.radians = radians;\r\n  }\r\n}\r\n\r\n/** Function signature for announcing a vertex neighborhood during sorting. */\r\nexport type AnnounceVertexNeighborhoodSortData = (data: VertexNeighborhoodSortData[]) => any;\r\n/**\r\n * * Assorted methods used in algorithms on HalfEdgeGraph.\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphOps {\r\n\r\n  /** Compare function for sorting with primary y compare, secondary  x compare. */\r\n  public static compareNodesYXUp(a: HalfEdge, b: HalfEdge) {\r\n    // Check y's\r\n    // if (!Geometry.isSameCoordinate(a.y, b.y))\r\n    if (a.y < b.y)\r\n      return -1;\r\n    else if (a.y > b.y)\r\n      return 1;\r\n    // Check x's\r\n    // if (!Geometry.isSameCoordinate(a.x, b.x))\r\n    if (a.x < b.x)\r\n      return -1;\r\n    else if (a.x > b.x)\r\n      return 1;\r\n    return 0;\r\n  }\r\n\r\n  /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */\r\n  public static isDownPeak(nodeB: HalfEdge) {\r\n    const nodeA = nodeB.facePredecessor;\r\n    const nodeC = nodeB.faceSuccessor;\r\n    return this.compareNodesYXUp(nodeB, nodeA) < 0\r\n      && this.compareNodesYXUp(nodeB, nodeC) < 0\r\n      && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;\r\n  }\r\n\r\n  /** return the cross product of vectors from base to targetA and base to targetB\r\n   * @param base base vertex of both vectors.\r\n   * @param targetA target vertex of first vector\r\n   * @param targetB target vertex of second vector\r\n   */\r\n  public static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number {\r\n    return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);\r\n  }\r\n\r\n  /** Compute the range of the graph's vertices. */\r\n  public static graphRange(graph: Readonly<HalfEdgeGraph>): Range3d {\r\n    const range = Range3d.create();\r\n    for (const node of graph.allHalfEdges) {\r\n      range.extendXYZ(node.x, node.y, node.z);\r\n    }\r\n    return range;\r\n  }\r\n  /** Compute the xy-range of the graph's vertices. */\r\n  public static graphRangeXY(graph: Readonly<HalfEdgeGraph>): Range2d {\r\n    const range = Range2d.createNull();\r\n    for (const node of graph.allHalfEdges) {\r\n      range.extendXY(node.x, node.y);\r\n    }\r\n    return range;\r\n  }\r\n\r\n  /** Returns an array of all nodes (both ends) of edges created from segments. */\r\n  public static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[] {\r\n    const result = [];\r\n    let idxCounter = 0;\r\n\r\n    // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}\r\n    for (const segment of segments) {\r\n\r\n      const node0 = returnGraph.createEdgeXYZXYZ(\r\n        segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z,\r\n        idxCounter,\r\n        segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z,\r\n        idxCounter + 1);\r\n\r\n      const node1 = node0.edgeMate;\r\n      idxCounter += 2;\r\n\r\n      node0.setMaskAroundFace(mask);   // Original given coordinates must be part of boundary\r\n      result.push(node0);\r\n      result.push(node1);\r\n    }\r\n\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * Visit all nodes in `graph`.\r\n   * * invoke `pinch(node, vertexPredecessor)`\r\n   * * this leaves the graph as isolated edges.\r\n   * @param graph graph to modify\r\n   */\r\n  public static isolateAllEdges(graph: HalfEdgeGraph) {\r\n    for (const nodeA of graph.allHalfEdges) {\r\n      const nodeB = nodeA.vertexPredecessor;\r\n      HalfEdge.pinch(nodeA, nodeB);\r\n    }\r\n  }\r\n  /**\r\n   * Compute convexity of a sector of a super-face.\r\n   * @param base node whose edge is to be tested for removal\r\n   * @param ignore edges with this mask (on either side) are ignored for the purposes of computing convexity\r\n   * @param barrier edges with this mask (on either side) will not be removed\r\n   * @param signedAreaTol optional signed area tolerance to use in test for parallel vectors\r\n   * @return whether removing the edge at base would create a convex sector in the super-face\r\n   */\r\n  private static isSectorConvexAfterEdgeRemoval(base: HalfEdge, ignore: HalfEdgeMask, barrier: HalfEdgeMask, signedAreaTol: number = 0): boolean {\r\n    let vs = base;\r\n    do { // loop ccw around vertex looking for a super-face predecessor\r\n      if (vs.isMaskSet(barrier) || vs.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vs = vs.vertexSuccessor;\r\n    } while (vs !== base && vs.isMaskSet(ignore));\r\n    if (vs === base)\r\n      return false;\r\n    let vp = base;\r\n    do { // loop cw around vertex looking for a super-face successor\r\n      if (vp.isMaskSet(barrier) || vp.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vp = vp.vertexPredecessor;\r\n    } while (vp !== base && vp.isMaskSet(ignore));\r\n    if (vp === base)\r\n      return false;\r\n    return HalfEdge.isSectorConvex(vs.edgeMate, base, vp.faceSuccessor, signedAreaTol);\r\n  }\r\n  /**\r\n   * Mask edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine and mark\r\n   * @param mark the mask used to mark (both sides of) removable edges\r\n   * @param barrier edges with this mask (on either side) will not be marked. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges masked (half the number of HalfEdges masked)\r\n   */\r\n  public static markRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, mark: HalfEdgeMask, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    if (HalfEdgeMask.NULL_MASK === mark)\r\n      return 0;\r\n    const visit = graph.grabMask(true);\r\n    let numMarked = 0;\r\n    for (const node of graph.allHalfEdges) {\r\n      if (!node.isMaskSet(visit)) {\r\n        if (!node.isMaskSet(barrier) && !node.edgeMate.isMaskSet(barrier)) {\r\n          // tol based on areas of *original* faces on each side of the edge to be removed\r\n          const signedAreaTol = Geometry.smallMetricDistanceSquared * (node.signedFaceArea() + node.edgeMate.signedFaceArea());\r\n          if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier, signedAreaTol) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier, signedAreaTol)) {\r\n            node.setMaskAroundEdge(mark);\r\n            ++numMarked;\r\n          }\r\n        }\r\n      }\r\n      node.setMaskAroundEdge(visit);\r\n    }\r\n    graph.dropMask(visit);\r\n    return numMarked;\r\n  }\r\n  /**\r\n   * Collect edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine\r\n   * @param barrier edges with this mask (on either side) will not be collected. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return one HalfEdge per removable edge\r\n   */\r\n  public static collectRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): HalfEdge[] | undefined {\r\n    const removable: HalfEdge[] = [];\r\n    const mark = graph.grabMask(true);\r\n    if (0 < this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier)) {\r\n      const visited = graph.grabMask(true);\r\n      for (const node of graph.allHalfEdges) {\r\n        if (node.isMaskSet(mark) && !node.isMaskSet(visited)) {\r\n          node.setMaskAroundEdge(visited);\r\n          removable.push(node);\r\n        }\r\n      }\r\n      graph.dropMask(visited);\r\n    }\r\n    graph.dropMask(mark);\r\n    return removable;\r\n  }\r\n\r\n  /**\r\n   * Remove edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to modify\r\n   * @param barrier edges with this mask (on either side) will not be removed. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges deleted\r\n   */\r\n  public static expandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    const mark = graph.grabMask(true);\r\n    const numRemovedEdges = this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier);\r\n    if (numRemovedEdges > 0) {\r\n      const numYankedEdges = 0.5 * graph.yankAndDeleteEdges((node: HalfEdge) => node.getMask(mark));\r\n      assert(numYankedEdges === numRemovedEdges);\r\n    }\r\n    graph.dropMask(mark);\r\n    return numRemovedEdges;\r\n  }\r\n\r\n  /**\r\n   * Test desired faces for convexity.\r\n   * @param graph graph to examine\r\n   * @param avoid faces with this mask will not be examined. Defaults to HalfEdgeMask.EXTERIOR.\r\n   * @return whether every face in the graph is convex\r\n   */\r\n  public static isEveryFaceConvex(graph: HalfEdgeGraph, avoid: HalfEdgeMask = HalfEdgeMask.EXTERIOR): boolean {\r\n    const allFaces = graph.collectFaceLoops();\r\n    for (const node of allFaces) {\r\n      if (node.isMaskedAroundFace(avoid))\r\n        continue;\r\n      if (!node.isFaceConvex())\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n}\r\n\r\n/**\r\n * Note: this class uses hardcoded micrometer coordinate/cluster tolerance throughout.\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphMerge {\r\n  // return kC such that all angles k are equal, with kA <= k < kC <= kB.\r\n  // * Assume: angles k are stored at extra data index 0.\r\n  // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC\r\n  public static getCommonThetaEndIndex(clusters: ClusterableArray, order: Uint32Array, kA: number, kB: number): number {\r\n    let kC = kA + 1;\r\n    const thetaA = clusters.getExtraData(order[kA], 0);\r\n    while (kC < kB) {\r\n      const thetaB = clusters.getExtraData(order[kC], 0);\r\n      if (!Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\r\n        return kC;\r\n      }\r\n      kC++;\r\n    }\r\n    return kC;\r\n  }\r\n  private static _announceVertexNeighborhoodFunction?: AnnounceVertexNeighborhoodSortData;\r\n  /**\r\n   * public property setter for a function to be called with sorted edge data around a vertex.\r\n   */\r\n  public static set announceVertexNeighborhoodFunction(func: AnnounceVertexNeighborhoodSortData | undefined) { this._announceVertexNeighborhoodFunction = func; }\r\n  private static doAnnounceVertexNeighborhood(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    if (this._announceVertexNeighborhoodFunction) {\r\n      const sortData: VertexNeighborhoodSortData[] = [];\r\n      // build and share the entire vertex order\r\n      for (let k = k0; k < k1; k++) {\r\n        const index = clusters.getExtraData(order[k], 1);\r\n        const theta = clusters.getExtraData(order[k], 0);\r\n        const node = allNodes[index];\r\n        const signedDistance = this.curvatureSortKey(node);\r\n        sortData.push(new VertexNeighborhoodSortData(order[k], signedDistance, node, theta));\r\n      }\r\n      this._announceVertexNeighborhoodFunction(sortData);\r\n    }\r\n\r\n  }\r\n  // assumptions about cluster array:\r\n  //   * data order is: x,y,theta,nodeIndex\r\n  //   * theta and nodeIndex are the \"extra\" data.\r\n  //   * only want to do anything here when curves are present.\r\n  //   * k0<=k<k1 are around a vertex\r\n  //   * These are sorted by theta.\r\n  private static secondarySortAroundVertex(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    const sortData: VertexNeighborhoodSortData[] = [];\r\n\r\n    for (let k = k0; k < k1;) {\r\n      const kB = this.getCommonThetaEndIndex(clusters, order, k, k1);\r\n      if (k + 1 < kB) {\r\n        sortData.length = 0;\r\n        for (let kA = k; kA < kB; kA++) {\r\n          const index = clusters.getExtraData(order[kA], 1);\r\n          const node = allNodes[index];\r\n          const signedDistance = this.curvatureSortKey(node);\r\n          sortData.push(new VertexNeighborhoodSortData(order[kA], signedDistance, node));\r\n        }\r\n        sortData.sort((a: VertexNeighborhoodSortData, b: VertexNeighborhoodSortData) => (a.radiusOfCurvature - b.radiusOfCurvature));\r\n        for (let i = 0; i < sortData.length; i++) {\r\n          order[k + i] = sortData[i].index;\r\n        }\r\n      }\r\n      k = kB;\r\n    }\r\n  }\r\n  /** Return the sort key for sorting by curvature.\r\n   * * This is the signed distance from the curve at the edge start, to center of curvature.\r\n   * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.\r\n   */\r\n  public static curvatureSortKey(node: HalfEdge): number {\r\n    const cld = node.edgeTag as CurveLocationDetail;\r\n    if (cld !== undefined) {\r\n      const fraction = cld.fraction;\r\n      const curve = cld.curve;\r\n      if (curve) {\r\n        let radius = curve.fractionToSignedXYRadiusOfCurvature(fraction);\r\n        if (node.sortData !== undefined && node.sortData < 0)\r\n          radius = -radius;\r\n        return radius;\r\n      }\r\n    }\r\n    return 0.0;\r\n  }\r\n  /** Whether the HalfEdge is part of a null face, as marked by [[clusterAndMergeXYTheta]]. */\r\n  public static isNullFace(node: HalfEdge): boolean {\r\n    return node.isMaskSet(HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;\r\n  }\r\n  /**\r\n   * Cluster the HalfEdges so that xy-coordinates within `mergeTolerance` are equated.\r\n   * * Note that any additional data (e.g., edgeTag, faceTag) on the HalfEdges are ignored. In particular,\r\n   * [[CurveLocationDetail]]s attached to clustered HalfEdges do *not* get their points adjusted.\r\n   * * This is a simple merge algorithm:\r\n   *   * untwist all edges from the vertex loops\r\n   *   * collect array of (x,y,theta) at all nodes\r\n   *   * lexical sort of the array\r\n   *   * twist all edges together in sort order around each vertex\r\n   *   * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.\r\n   *   * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.\r\n   *   * [[HalfEdgeMask.NULL_FACE]] is cleared throughout and applied within null faces.\r\n   * @param graph input graph\r\n   * @param outboundRadiansFunction optional function to compute the sort angle of an edge at its start vertex\r\n   * @param clusterTol optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].\r\n   */\r\n  public static clusterAndMergeXYTheta(\r\n    graph: HalfEdgeGraph,\r\n    outboundRadiansFunction?: (he: HalfEdge) => number,\r\n    clusterTol: number = Geometry.smallMetricDistance,\r\n  ) {\r\n    const allNodes = graph.allHalfEdges;\r\n    const numNodes = allNodes.length;\r\n    graph.clearMask(HalfEdgeMask.NULL_FACE);\r\n    const clusters = new ClusterableArray(2, 2, numNodes);  // data order: x,y,theta,nodeIndex.  But theta is not set in first round.\r\n    for (let i = 0; i < numNodes; i++) {\r\n      const nodeA = allNodes[i];\r\n      const xA = nodeA.x;\r\n      const yA = nodeA.y;\r\n      HalfEdge.pinch(nodeA, nodeA.vertexSuccessor);  // pull it out of its current vertex loop.\r\n      clusters.addDirect(xA, yA, 0.0, i);\r\n    }\r\n    const order = clusters.clusterIndicesLexical(clusterTol);\r\n    let k0 = 0;\r\n    const numK = order.length;\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1-1] are at a vertex cluster; equate their xy\r\n        if (k1 > k0) {\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          const nodeA0 = allNodes[iA];\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            const nodeB = allNodes[iB];\r\n            nodeB.x = nodeA0.x;\r\n            nodeB.y = nodeA0.y;\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n    // NOW\r\n    //  1) There are identical coordinates at all nodes around each vertex loop.\r\n    //  2) Hence ready do sort (at each vertex) by theta.\r\n\r\n    // insert theta as extra data in the sort table . . .\r\n    for (const clusterTableIndex of order) {\r\n      if (clusterTableIndex !== ClusterableArray.clusterTerminator) {\r\n        const nodeA = allNodes[clusterTableIndex];\r\n        const nodeB = nodeA.faceSuccessor;\r\n        let getPrecomputedRadians = outboundRadiansFunction;\r\n        if (getPrecomputedRadians) {\r\n          // Recompute theta when edge geometry is completely determined by the vertices, which may have been perturbed by clustering.\r\n          const detail = nodeA.edgeTag as CurveLocationDetail;\r\n          if (undefined === detail || undefined === detail.curve || detail.curve instanceof LineSegment3d)\r\n            getPrecomputedRadians = undefined;\r\n        }\r\n        let radians = getPrecomputedRadians ? getPrecomputedRadians(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);\r\n        if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))\r\n          radians = Math.PI;\r\n        clusters.setExtraData(clusterTableIndex, 0, radians);\r\n      }\r\n    }\r\n    clusters.sortSubsetsBySingleKey(order, 2);\r\n    const unmatchedNullFaceNodes: HalfEdge[] = [];\r\n    k0 = 0;\r\n    let thetaA, thetaB;\r\n\r\n    // now pinch each neighboring pair together\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1-1] are properly sorted around a vertex.\r\n        if (k1 > k0) {\r\n          if (k1 > k0 + 1)\r\n            this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1);\r\n          this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          thetaA = clusters.getExtraData(order[k0], 0);\r\n          const nodeA0 = allNodes[iA];\r\n          let nodeA = nodeA0;\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            thetaB = clusters.getExtraData(order[k], 0);\r\n            const nodeB = allNodes[iB];\r\n            if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              // nope, this edge was flagged and pinched from the other end.\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            } else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeB === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.\r\n            } else {\r\n              HalfEdge.pinch(nodeA, nodeB);\r\n\r\n              // Detect null face using the heuristic:\r\n              //  * near vertex angles are same (periodic, toleranced)\r\n              //  * far vertex is clustered (exactly equal)\r\n              //  * near vertex curvatures are same (toleranced)\r\n              // Note that near vertex is already clustered.\r\n              if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\r\n                const nodeA1 = nodeA.faceSuccessor;\r\n                const nodeB1 = nodeB.edgeMate;\r\n                if (nodeA1.isEqualXY(nodeB1)) {\r\n                  const cA = this.curvatureSortKey(nodeA);\r\n                  const cB = this.curvatureSortKey(nodeB);\r\n                  if (Geometry.isSameCoordinate(cA, cB, clusterTol)) {  // rule out banana\r\n                    HalfEdge.pinch(nodeA1, nodeB1);\r\n                    nodeA.setMask(HalfEdgeMask.NULL_FACE);\r\n                    nodeB1.setMask(HalfEdgeMask.NULL_FACE);\r\n                    unmatchedNullFaceNodes.push(nodeB1);\r\n                  }\r\n                }\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            }\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n  }\r\n\r\n  private static buildVerticalSweepPriorityQueue(graph: HalfEdgeGraph): HalfEdgePriorityQueueWithPartnerArray {\r\n    const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();\r\n    for (const p of graph.allHalfEdges) {\r\n\r\n      if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {\r\n        sweepHeap.priorityQueue.push(p);\r\n      }\r\n    }\r\n    return sweepHeap;\r\n  }\r\n\r\n  private static computeIntersectionFractionsOnEdges(nodeA0: HalfEdge, nodeB0: HalfEdge, tol: number = Geometry.smallMetricDistance): { f0: XAndY, f1?: XAndY} | undefined {\r\n    const nodeA1 = nodeA0.faceSuccessor;\r\n    const aDir = { x: nodeA1.x - nodeA0.x, y: nodeA1.y - nodeA0.y };\r\n    const nodeB1 = nodeB0.faceSuccessor;\r\n    const bDir = { x: nodeB1.x - nodeB0.x, y: nodeB1.y - nodeB0.y };\r\n    let fractions = SmallSystem.lineSegmentXYUVIntersectionUnbounded(nodeA0, aDir, nodeB0, bDir, tol);\r\n    if (fractions) {\r\n      const snapFractionToSegment = (fraction: number, segStart: XAndY, segEnd: XAndY): number => {\r\n        const x = Geometry.interpolate(segStart.x, fraction, segEnd.x);\r\n        const y = Geometry.interpolate(segStart.y, fraction, segEnd.y);\r\n        if (Geometry.isSameCoordinateXY(x, y, segStart.x, segStart.y, tol))\r\n          return 0.0;\r\n        if (Geometry.isSameCoordinateXY(x, y, segEnd.x, segEnd.y, tol))\r\n          return 1.0;\r\n        return fraction;\r\n      };\r\n      fractions.f0.x = snapFractionToSegment(fractions.f0.x, nodeA0, nodeA1);\r\n      fractions.f0.y = snapFractionToSegment(fractions.f0.y, nodeB0, nodeB1);\r\n      if (fractions.f1) {\r\n        fractions.f1.x = snapFractionToSegment(fractions.f1.x, nodeA0, nodeA1);\r\n        fractions.f1.y = snapFractionToSegment(fractions.f1.y, nodeB0, nodeB1);\r\n      }\r\n      if (fractions.f1 && !(Geometry.isIn01(fractions.f1.x) && Geometry.isIn01(fractions.f1.y)))\r\n        fractions.f1 = undefined; // overlap ends beyond a segment; downgrade to simple intersection\r\n      if (!(Geometry.isIn01(fractions.f0.x) && Geometry.isIn01(fractions.f0.y))) {\r\n        if (fractions.f1) {\r\n          fractions.f0 = fractions.f1; // overlap starts beyond a segment; downgrade to simple intersection\r\n          fractions.f1 = undefined;\r\n        } else\r\n          fractions = undefined; // intersection/overlap is outside both segments\r\n      }\r\n    }\r\n    return fractions;\r\n  }\r\n  /**\r\n   * Split edges at intersections.\r\n   * * This is a large operation.\r\n   * @param graph\r\n   */\r\n  public static splitIntersectingEdges(graph: HalfEdgeGraph, distanceTol: number = Geometry.smallMetricDistance, fractionTol: number = 1.0e-8): GraphSplitData {\r\n    const data = new GraphSplitData();\r\n    const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);\r\n    let nodeA0, nodeB1;\r\n    const smallFraction = fractionTol;\r\n    const largeFraction = 1.0 - smallFraction;\r\n    let i;\r\n    let nodeB0;\r\n    while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {\r\n      data.numUpEdge++;\r\n      const n0 = sweepHeap.activeEdges.length;\r\n      sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - distanceTol);\r\n      data.numPopOut += n0 - sweepHeap.activeEdges.length;\r\n      for (i = 0; i < sweepHeap.activeEdges.length; i++) {\r\n        nodeB0 = sweepHeap.activeEdges[i];\r\n        nodeB1 = nodeB0.faceSuccessor;\r\n        if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y, distanceTol)) {\r\n          data.numA0B0++;\r\n        } else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y, distanceTol)) {\r\n          data.numA0B1++;\r\n        } else {\r\n          data.numIntersectionTest++;\r\n          const fractions = this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, distanceTol);\r\n          if (fractions) {\r\n            const splitAndPush = (node: HalfEdge, fraction?: number): void => {\r\n              if (fraction !== undefined && fraction > smallFraction && fraction < largeFraction) {\r\n                const newNode = graph.splitEdgeAtFraction(node, fraction);\r\n                sweepHeap.priorityQueue.push(newNode);  // will be popped as a nodeA0 later\r\n                data.numSplit++;\r\n              }\r\n            };\r\n            splitAndPush(nodeA0, fractions.f0.x);\r\n            splitAndPush(nodeA0, fractions.f1?.x);\r\n            splitAndPush(nodeB0, fractions.f0.y);\r\n            splitAndPush(nodeB0, fractions.f1?.y);\r\n            // existing nodeA0 and its shortened edge remain for further intersections\r\n          }\r\n        }\r\n      }\r\n      sweepHeap.activeEdges.push(nodeA0);\r\n    }\r\n    return data;\r\n  }\r\n\r\n  /**\r\n   * Returns a graph structure formed from the given LineSegment array\r\n   *\r\n   * *  Find all intersections among segments, and split them if necessary\r\n   * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up\r\n   *      vertices.\r\n   * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face\r\n   *      loops\r\n   */\r\n  public static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph {\r\n    // Structure of an index of the array: { xyTheta: Point3d, node: Node }\r\n    const graph = new HalfEdgeGraph();\r\n    HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * * Input is random linestrings, not necessarily loops\r\n   * * Graph gets full splitEdges, regularize (optional), and triangulate.\r\n   * @returns graph, or undefined if bad data.\r\n   */\r\n  public static formGraphFromChains(chains: MultiLineStringDataVariant, regularize: boolean = true, mask: HalfEdgeMask = HalfEdgeMask.PRIMARY_EDGE): HalfEdgeGraph | undefined {\r\n    if (chains.length < 1)\r\n      return undefined;\r\n    const graph = new HalfEdgeGraph();\r\n    const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);\r\n    for (const seed of chainSeeds)\r\n      seed.setMaskAroundFace(mask);\r\n\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n    if (regularize) {\r\n      const context = new RegularizationContext(graph);\r\n      context.regularizeGraph(true, true);\r\n    }\r\n    return graph;\r\n  }\r\n\r\n}\r\n"]}
+{"version":3,"file":"Merging.js","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAC7C,sEAAmE;AACnE,0DAAuD;AACvD,0CAAuC;AACvC,+CAA4C;AAE5C,+CAAuD;AAEvD,mEAAgE;AAChE,yDAAsD;AACtD,mCAAgE;AAChE,mEAAgF;AAChF,qDAAyD;AACzD,mDAA+C;AAE/C,mBAAmB;AAEnB,MAAa,cAAc;IAClB,SAAS,GAAG,CAAC,CAAC;IACd,mBAAmB,GAAG,CAAC,CAAC;IACxB,QAAQ,GAAG,CAAC,CAAC;IACb,SAAS,GAAG,CAAC,CAAC;IACd,OAAO,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,CAAC,CAAC;IACnB;IACA,CAAC;CACF;AATD,wCASC;AACD;;GAEG;AACH,MAAa,0BAA0B;IAC9B,KAAK,CAAS;IACd,iBAAiB,CAAS;IAC1B,IAAI,CAAW;IACf,OAAO,CAAU;IACxB,YAAmB,KAAa,EAAE,GAAW,EAAE,IAAc,EAAE,OAAgB;QAC7E,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,GAAG,CAAC;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;CACF;AAXD,gEAWC;AAID;;;GAGG;AACH,MAAa,gBAAgB;IAE3B,iFAAiF;IAC1E,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QACrD,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mIAAmI;IAC5H,MAAM,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACvC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAc,EAAE,OAAiB,EAAE,OAAiB;QACtF,OAAO,mBAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,iDAAiD;IAC1C,MAAM,CAAC,UAAU,CAAC,KAA8B;QACrD,MAAM,KAAK,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,oDAAoD;IAC7C,MAAM,CAAC,YAAY,CAAC,KAA8B;QACvD,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gFAAgF;IACzE,MAAM,CAAC,wBAAwB,CAAC,QAAyB,EAAE,WAA0B,EAAE,IAAkB;QAC9G,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,kFAAkF;QAClF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAE/B,MAAM,KAAK,GAAG,WAAW,CAAC,gBAAgB,CACxC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,EACV,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,GAAG,CAAC,CAAC,CAAC;YAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC7B,UAAU,IAAI,CAAC,CAAC;YAEhB,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAG,sDAAsD;YACvF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,MAAoB,EAAE,OAAqB,EAAE,gBAAwB,CAAC;QAClI,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,8DAA8D;YACjE,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC;QAC1B,CAAC,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,GAAG,CAAC,CAAC,2DAA2D;YAC9D,IAAI,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC;gBACzD,MAAM;YACR,EAAE,GAAG,EAAE,CAAC,iBAAiB,CAAC;QAC5B,CAAC,QAAQ,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE;QAC9C,IAAI,EAAE,KAAK,IAAI;YACb,OAAO,KAAK,CAAC;QACf,OAAO,gBAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IACrF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,qCAAqC,CAAC,KAAoB,EAAE,IAAkB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QAC9I,IAAI,oBAAY,CAAC,SAAS,KAAK,IAAI;YACjC,OAAO,CAAC,CAAC;QACX,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBAClE,gFAAgF;oBAChF,MAAM,aAAa,GAAG,mBAAQ,CAAC,0BAA0B,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC;oBACrH,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,EAAE,CAAC;wBAChK,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBAC7B,EAAE,SAAS,CAAC;oBACd,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,wCAAwC,CAAC,KAAoB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QAC7H,MAAM,SAAS,GAAe,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;YACzE,MAAM,OAAO,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;gBACtC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;oBACrD,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;oBAChC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,UAAwB,oBAAY,CAAC,aAAa;QACtG,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,qCAAqC,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACzF,IAAI,eAAe,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,cAAc,GAAG,GAAG,GAAG,KAAK,CAAC,kBAAkB,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9F,IAAA,qBAAM,EAAC,cAAc,KAAK,eAAe,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrB,OAAO,eAAe,CAAC;IACzB,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB,EAAE,QAAsB,oBAAY,CAAC,QAAQ;QAC/F,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC;gBAChC,SAAS;YACX,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE;gBACtB,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhND,4CAgNC;AAED;;;GAGG;AACH,MAAa,kBAAkB;IAC7B,uEAAuE;IACvE,uDAAuD;IACvD,+EAA+E;IACxE,MAAM,CAAC,sBAAsB,CAAC,QAA0B,EAAE,KAAkB,EAAE,EAAU,EAAE,EAAU,EAAE,YAAoB,mBAAQ,CAAC,iBAAiB;QACzJ,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QAChB,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,IAAI,CAAC,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC;gBAC3E,OAAO,EAAE,CAAC;YACZ,CAAC;YACD,EAAE,EAAE,CAAC;QACP,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACO,MAAM,CAAC,mCAAmC,CAAsC;IACxF;;OAEG;IACI,MAAM,KAAK,kCAAkC,CAAC,IAAoD,IAAI,IAAI,CAAC,mCAAmC,GAAG,IAAI,CAAC,CAAC,CAAC;IACvJ,MAAM,CAAC,4BAA4B,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU;QACtI,IAAI,IAAI,CAAC,mCAAmC,EAAE,CAAC;YAC7C,MAAM,QAAQ,GAAiC,EAAE,CAAC;YAClD,0CAA0C;YAC1C,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;gBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YACvF,CAAC;YACD,IAAI,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;QACrD,CAAC;IAEH,CAAC;IACD,mCAAmC;IACnC,yCAAyC;IACzC,gDAAgD;IAChD,6DAA6D;IAC7D,mCAAmC;IACnC,iCAAiC;IACzB,MAAM,CAAC,yBAAyB,CAAC,QAA0B,EAAE,KAAkB,EAAE,QAAoB,EAAE,EAAU,EAAE,EAAU,EAAE,YAAoB,mBAAQ,CAAC,iBAAiB;QACnL,MAAM,QAAQ,GAAiC,EAAE,CAAC;QAElD,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,sBAAsB,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;YAC1E,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC;gBACf,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAClD,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;oBAC7B,MAAM,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;oBACnD,QAAQ,CAAC,IAAI,CAAC,IAAI,0BAA0B,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC;gBACjF,CAAC;gBACD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAA6B,EAAE,CAA6B,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC;gBAC7H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACnC,CAAC;YACH,CAAC;YACD,CAAC,GAAG,EAAE,CAAC;QACT,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAAc;QAC3C,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;YAC/B,IAAI,IAAI,CAAC,OAAO,YAAY,yCAAmB,EAAE,CAAC;gBAChD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC;gBACzB,IAAI,GAAG,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;oBAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;oBACjE,MAAM,QAAQ,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;oBACzF,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,mCAAmC,CAAC,QAAQ,CAAC,CAAC;oBACvE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,4FAA4F;IACrF,MAAM,CAAC,UAAU,CAAC,IAAc;QACrC,OAAO,IAAI,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,IAAI,IAAI,KAAK,IAAI,CAAC,aAAa,CAAC,aAAa,CAAC;IACrJ,CAAC;IACD;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,sBAAsB,CAClC,KAAoB,EACpB,uBAAkD,EAClD,aAAqB,mBAAQ,CAAC,mBAAmB,EACjD,YAAoB,mBAAQ,CAAC,iBAAiB;QAE9C,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,mCAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,sEAAsE;QAC9H,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAE,0CAA0C;YACzF,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC,CAAC,kCAAkC;QAC5F,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,sFAAsF;gBACtF,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACnB,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE,CAAC;YACtC,IAAI,iBAAiB,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBAC7D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,qBAAqB,GAAG,uBAAuB,CAAC;gBACpD,IAAI,qBAAqB,EAAE,CAAC;oBAC1B,4HAA4H;oBAC5H,MAAM,MAAM,GAAG,KAAK,CAAC,OAA8B,CAAC;oBACpD,IAAI,SAAS,KAAK,MAAM,IAAI,SAAS,KAAK,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,YAAY,6BAAa;wBAC7F,qBAAqB,GAAG,SAAS,CAAC;gBACtC,CAAC;gBACD,IAAI,OAAO,GAAG,qBAAqB,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtH,IAAI,aAAK,CAAC,oCAAoC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC;oBAC1E,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QACD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,sBAAsB,GAAe,EAAE,CAAC;QAC9C,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,MAAM,EAAE,MAAM,CAAC;QAEnB,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,mCAAgB,CAAC,iBAAiB,EAAE,CAAC;gBACrD,6FAA6F;gBAC7F,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;oBACZ,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;wBACb,IAAI,CAAC,yBAAyB,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC,iDAAiD;oBACjI,IAAI,CAAC,4BAA4B,CAAC,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;oBACrE,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,MAAM,CAAC;oBACnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;wBACjC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BAC5C,8DAA8D;4BAC9D,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,oBAAY,CAAC,SAAS,CAAC,EAAE,CAAC;4BACnD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gCACX,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;4BAC/B,CAAC;4BACD,6FAA6F;wBAC/F,CAAC;6BAAM,CAAC;4BACN,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAE7B,wCAAwC;4BACxC,wDAAwD;4BACxD,6CAA6C;4BAC7C,kDAAkD;4BAClD,8CAA8C;4BAC9C,IAAI,aAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC;gCAC1E,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;oCAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,MAAM,EAAE,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;oCACxC,IAAI,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,UAAU,CAAC,EAAE,CAAC,CAAE,kBAAkB;wCACtE,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;wCAC/B,KAAK,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;wCACtC,MAAM,CAAC,OAAO,CAAC,oBAAY,CAAC,SAAS,CAAC,CAAC;wCACvC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oCACtC,CAAC;gCACH,CAAC;4BACH,CAAC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;wBAClB,CAAC;oBACH,CAAC;gBACH,CAAC;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,+BAA+B,CAAC,KAAoB;QACjE,MAAM,SAAS,GAAG,IAAI,6DAAqC,EAAE,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YAEnC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAEO,MAAM,CAAC,mCAAmC,CAAC,MAAgB,EAAE,MAAgB,EAAE,MAAc,mBAAQ,CAAC,mBAAmB;QAC/H,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;QAChE,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,IAAI,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,EAAE,CAAC;QAChE,IAAI,SAAS,GAAG,yBAAW,CAAC,oCAAoC,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAClG,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,qBAAqB,GAAG,CAAC,QAAgB,EAAE,QAAe,EAAE,MAAa,EAAU,EAAE;gBACzF,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,MAAM,CAAC,GAAG,mBAAQ,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;gBAC/D,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC;oBAChE,OAAO,GAAG,CAAC;gBACb,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC5D,OAAO,GAAG,CAAC;gBACb,OAAO,QAAQ,CAAC;YAClB,CAAC,CAAC;YACF,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACvE,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;gBACjB,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;gBACvE,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,qBAAqB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACzE,CAAC;YACD,IAAI,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACvF,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,CAAC,kEAAkE;YAC9F,IAAI,CAAC,CAAC,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,mBAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1E,IAAI,SAAS,CAAC,EAAE,EAAE,CAAC;oBACjB,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC,oEAAoE;oBACjG,SAAS,CAAC,EAAE,GAAG,SAAS,CAAC;gBAC3B,CAAC;;oBACC,SAAS,GAAG,SAAS,CAAC,CAAC,gDAAgD;YAC3E,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB,EAAE,cAAsB,mBAAQ,CAAC,mBAAmB,EAAE,cAAsB,MAAM;QACzI,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,aAAa,GAAG,WAAW,CAAC;QAClC,MAAM,aAAa,GAAG,GAAG,GAAG,aAAa,CAAC;QAC1C,IAAI,CAAC,CAAC;QACN,IAAI,MAAM,CAAC;QACX,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;YAC9D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,SAAS,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC;YAChE,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;gBAC9B,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;oBACrF,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,IAAI,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;oBAC5F,IAAI,CAAC,OAAO,EAAE,CAAC;gBACjB,CAAC;qBAAM,CAAC;oBACN,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,MAAM,SAAS,GAAG,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;oBACxF,IAAI,SAAS,EAAE,CAAC;wBACd,MAAM,YAAY,GAAG,CAAC,IAAc,EAAE,QAAiB,EAAQ,EAAE;4BAC/D,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,aAAa,IAAI,QAAQ,GAAG,aAAa,EAAE,CAAC;gCACnF,MAAM,OAAO,GAAG,KAAK,CAAC,mBAAmB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gCAC1D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,mCAAmC;gCAC3E,IAAI,CAAC,QAAQ,EAAE,CAAC;4BAClB,CAAC;wBACH,CAAC,CAAC;wBACF,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBACrC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACtC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;wBACrC,YAAY,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACtC,0EAA0E;oBAC5E,CAAC;gBACH,CAAC;YACH,CAAC;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qBAAqB,CAAC,YAA6B;QAC/D,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,gBAAgB,CAAC,wBAAwB,CAAC,YAAY,EAAE,KAAK,EAAE,oBAAY,CAAC,aAAa,CAAC,CAAC;QAC3F,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAkC,EAAE,aAAsB,IAAI,EAAE,OAAqB,oBAAY,CAAC,YAAY;QAC9I,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,4BAAY,CAAC,iCAAiC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,KAAK,MAAM,IAAI,IAAI,UAAU;YAC3B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,sCAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF;AA5WD,gDA4WC","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 Topology\r\n */\r\n\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { CurveLocationDetail } from \"../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Range2d, Range3d } from \"../geometry3d/Range\";\r\nimport { XAndY } from \"../geometry3d/XYZProps\";\r\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\r\nimport { SmallSystem } from \"../numerics/SmallSystem\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { HalfEdgePriorityQueueWithPartnerArray } from \"./HalfEdgePriorityQueue\";\r\nimport { RegularizationContext } from \"./RegularizeFace\";\r\nimport { Triangulator } from \"./Triangulation\";\r\n\r\n// cspell:word XYUV\r\n\r\nexport class GraphSplitData {\r\n  public numUpEdge = 0;\r\n  public numIntersectionTest = 0;\r\n  public numSplit = 0;\r\n  public numPopOut = 0;\r\n  public numA0B0 = 0;\r\n  public numA0B1 = 0;\r\n  public constructor() {\r\n  }\r\n}\r\n/**\r\n * Structure for data used when sorting outbound edges \"around a node\"\r\n */\r\nexport class VertexNeighborhoodSortData {\r\n  public index: number;\r\n  public radiusOfCurvature: number;\r\n  public node: HalfEdge;\r\n  public radians?: number;\r\n  public constructor(index: number, key: number, node: HalfEdge, radians?: number) {\r\n    this.index = index;\r\n    this.radiusOfCurvature = key;\r\n    this.node = node;\r\n    this.radians = radians;\r\n  }\r\n}\r\n\r\n/** Function signature for announcing a vertex neighborhood during sorting. */\r\nexport type AnnounceVertexNeighborhoodSortData = (data: VertexNeighborhoodSortData[]) => any;\r\n/**\r\n * * Assorted methods used in algorithms on HalfEdgeGraph.\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphOps {\r\n\r\n  /** Compare function for sorting with primary y compare, secondary  x compare. */\r\n  public static compareNodesYXUp(a: HalfEdge, b: HalfEdge) {\r\n    // Check y's\r\n    // if (!Geometry.isSameCoordinate(a.y, b.y))\r\n    if (a.y < b.y)\r\n      return -1;\r\n    else if (a.y > b.y)\r\n      return 1;\r\n    // Check x's\r\n    // if (!Geometry.isSameCoordinate(a.x, b.x))\r\n    if (a.x < b.x)\r\n      return -1;\r\n    else if (a.x > b.x)\r\n      return 1;\r\n    return 0;\r\n  }\r\n\r\n  /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */\r\n  public static isDownPeak(nodeB: HalfEdge) {\r\n    const nodeA = nodeB.facePredecessor;\r\n    const nodeC = nodeB.faceSuccessor;\r\n    return this.compareNodesYXUp(nodeB, nodeA) < 0\r\n      && this.compareNodesYXUp(nodeB, nodeC) < 0\r\n      && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;\r\n  }\r\n\r\n  /** return the cross product of vectors from base to targetA and base to targetB\r\n   * @param base base vertex of both vectors.\r\n   * @param targetA target vertex of first vector\r\n   * @param targetB target vertex of second vector\r\n   */\r\n  public static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number {\r\n    return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);\r\n  }\r\n\r\n  /** Compute the range of the graph's vertices. */\r\n  public static graphRange(graph: Readonly<HalfEdgeGraph>): Range3d {\r\n    const range = Range3d.create();\r\n    for (const node of graph.allHalfEdges) {\r\n      range.extendXYZ(node.x, node.y, node.z);\r\n    }\r\n    return range;\r\n  }\r\n  /** Compute the xy-range of the graph's vertices. */\r\n  public static graphRangeXY(graph: Readonly<HalfEdgeGraph>): Range2d {\r\n    const range = Range2d.createNull();\r\n    for (const node of graph.allHalfEdges) {\r\n      range.extendXY(node.x, node.y);\r\n    }\r\n    return range;\r\n  }\r\n\r\n  /** Returns an array of all nodes (both ends) of edges created from segments. */\r\n  public static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[] {\r\n    const result = [];\r\n    let idxCounter = 0;\r\n\r\n    // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}\r\n    for (const segment of segments) {\r\n\r\n      const node0 = returnGraph.createEdgeXYZXYZ(\r\n        segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z,\r\n        idxCounter,\r\n        segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z,\r\n        idxCounter + 1);\r\n\r\n      const node1 = node0.edgeMate;\r\n      idxCounter += 2;\r\n\r\n      node0.setMaskAroundFace(mask);   // Original given coordinates must be part of boundary\r\n      result.push(node0);\r\n      result.push(node1);\r\n    }\r\n\r\n    return result;\r\n  }\r\n\r\n  /**\r\n   * * Visit all nodes in `graph`.\r\n   * * invoke `pinch(node, vertexPredecessor)`\r\n   * * this leaves the graph as isolated edges.\r\n   * @param graph graph to modify\r\n   */\r\n  public static isolateAllEdges(graph: HalfEdgeGraph) {\r\n    for (const nodeA of graph.allHalfEdges) {\r\n      const nodeB = nodeA.vertexPredecessor;\r\n      HalfEdge.pinch(nodeA, nodeB);\r\n    }\r\n  }\r\n  /**\r\n   * Compute convexity of a sector of a super-face.\r\n   * @param base node whose edge is to be tested for removal\r\n   * @param ignore edges with this mask (on either side) are ignored for the purposes of computing convexity\r\n   * @param barrier edges with this mask (on either side) will not be removed\r\n   * @param signedAreaTol optional signed area tolerance to use in test for parallel vectors\r\n   * @return whether removing the edge at base would create a convex sector in the super-face\r\n   */\r\n  private static isSectorConvexAfterEdgeRemoval(base: HalfEdge, ignore: HalfEdgeMask, barrier: HalfEdgeMask, signedAreaTol: number = 0): boolean {\r\n    let vs = base;\r\n    do { // loop ccw around vertex looking for a super-face predecessor\r\n      if (vs.isMaskSet(barrier) || vs.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vs = vs.vertexSuccessor;\r\n    } while (vs !== base && vs.isMaskSet(ignore));\r\n    if (vs === base)\r\n      return false;\r\n    let vp = base;\r\n    do { // loop cw around vertex looking for a super-face successor\r\n      if (vp.isMaskSet(barrier) || vp.edgeMate.isMaskSet(barrier))\r\n        break;\r\n      vp = vp.vertexPredecessor;\r\n    } while (vp !== base && vp.isMaskSet(ignore));\r\n    if (vp === base)\r\n      return false;\r\n    return HalfEdge.isSectorConvex(vs.edgeMate, base, vp.faceSuccessor, signedAreaTol);\r\n  }\r\n  /**\r\n   * Mask edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine and mark\r\n   * @param mark the mask used to mark (both sides of) removable edges\r\n   * @param barrier edges with this mask (on either side) will not be marked. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges masked (half the number of HalfEdges masked)\r\n   */\r\n  public static markRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, mark: HalfEdgeMask, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    if (HalfEdgeMask.NULL_MASK === mark)\r\n      return 0;\r\n    const visit = graph.grabMask(true);\r\n    let numMarked = 0;\r\n    for (const node of graph.allHalfEdges) {\r\n      if (!node.isMaskSet(visit)) {\r\n        if (!node.isMaskSet(barrier) && !node.edgeMate.isMaskSet(barrier)) {\r\n          // tol based on areas of *original* faces on each side of the edge to be removed\r\n          const signedAreaTol = Geometry.smallMetricDistanceSquared * (node.signedFaceArea() + node.edgeMate.signedFaceArea());\r\n          if (this.isSectorConvexAfterEdgeRemoval(node, mark, barrier, signedAreaTol) && this.isSectorConvexAfterEdgeRemoval(node.edgeMate, mark, barrier, signedAreaTol)) {\r\n            node.setMaskAroundEdge(mark);\r\n            ++numMarked;\r\n          }\r\n        }\r\n      }\r\n      node.setMaskAroundEdge(visit);\r\n    }\r\n    graph.dropMask(visit);\r\n    return numMarked;\r\n  }\r\n  /**\r\n   * Collect edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to examine\r\n   * @param barrier edges with this mask (on either side) will not be collected. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return one HalfEdge per removable edge\r\n   */\r\n  public static collectRemovableEdgesToExpandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): HalfEdge[] | undefined {\r\n    const removable: HalfEdge[] = [];\r\n    const mark = graph.grabMask(true);\r\n    if (0 < this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier)) {\r\n      const visited = graph.grabMask(true);\r\n      for (const node of graph.allHalfEdges) {\r\n        if (node.isMaskSet(mark) && !node.isMaskSet(visited)) {\r\n          node.setMaskAroundEdge(visited);\r\n          removable.push(node);\r\n        }\r\n      }\r\n      graph.dropMask(visited);\r\n    }\r\n    graph.dropMask(mark);\r\n    return removable;\r\n  }\r\n\r\n  /**\r\n   * Remove edges between faces if the union of the faces is convex.\r\n   * Uses a greedy algorithm with no regard to quality of resulting convex faces.\r\n   * Best results when input faces are convex.\r\n   * @param graph graph to modify\r\n   * @param barrier edges with this mask (on either side) will not be removed. Defaults to HalfEdgeMask.BOUNDARY_EDGE.\r\n   * @return number of edges deleted\r\n   */\r\n  public static expandConvexFaces(graph: HalfEdgeGraph, barrier: HalfEdgeMask = HalfEdgeMask.BOUNDARY_EDGE): number {\r\n    const mark = graph.grabMask(true);\r\n    const numRemovedEdges = this.markRemovableEdgesToExpandConvexFaces(graph, mark, barrier);\r\n    if (numRemovedEdges > 0) {\r\n      const numYankedEdges = 0.5 * graph.yankAndDeleteEdges((node: HalfEdge) => node.getMask(mark));\r\n      assert(numYankedEdges === numRemovedEdges);\r\n    }\r\n    graph.dropMask(mark);\r\n    return numRemovedEdges;\r\n  }\r\n\r\n  /**\r\n   * Test desired faces for convexity.\r\n   * @param graph graph to examine\r\n   * @param avoid faces with this mask will not be examined. Defaults to HalfEdgeMask.EXTERIOR.\r\n   * @return whether every face in the graph is convex\r\n   */\r\n  public static isEveryFaceConvex(graph: HalfEdgeGraph, avoid: HalfEdgeMask = HalfEdgeMask.EXTERIOR): boolean {\r\n    const allFaces = graph.collectFaceLoops();\r\n    for (const node of allFaces) {\r\n      if (node.isMaskedAroundFace(avoid))\r\n        continue;\r\n      if (!node.isFaceConvex())\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n}\r\n\r\n/**\r\n * Note: this class uses hardcoded micrometer coordinate/cluster tolerance throughout.\r\n * @internal\r\n */\r\nexport class HalfEdgeGraphMerge {\r\n  // return kC such that all angles k are equal, with kA <= k < kC <= kB.\r\n  // * Assume: angles k are stored at extra data index 0.\r\n  // * Note that the usual case (when angle at kA is not repeated) is kA+1 === kC\r\n  public static getCommonThetaEndIndex(clusters: ClusterableArray, order: Uint32Array, kA: number, kB: number, radianTol: number = Geometry.smallAngleRadians): number {\r\n    let kC = kA + 1;\r\n    const thetaA = clusters.getExtraData(order[kA], 0);\r\n    while (kC < kB) {\r\n      const thetaB = clusters.getExtraData(order[kC], 0);\r\n      if (!Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB, radianTol)) {\r\n        return kC;\r\n      }\r\n      kC++;\r\n    }\r\n    return kC;\r\n  }\r\n  private static _announceVertexNeighborhoodFunction?: AnnounceVertexNeighborhoodSortData;\r\n  /**\r\n   * public property setter for a function to be called with sorted edge data around a vertex.\r\n   */\r\n  public static set announceVertexNeighborhoodFunction(func: AnnounceVertexNeighborhoodSortData | undefined) { this._announceVertexNeighborhoodFunction = func; }\r\n  private static doAnnounceVertexNeighborhood(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number) {\r\n    if (this._announceVertexNeighborhoodFunction) {\r\n      const sortData: VertexNeighborhoodSortData[] = [];\r\n      // build and share the entire vertex order\r\n      for (let k = k0; k < k1; k++) {\r\n        const index = clusters.getExtraData(order[k], 1);\r\n        const theta = clusters.getExtraData(order[k], 0);\r\n        const node = allNodes[index];\r\n        const signedDistance = this.curvatureSortKey(node);\r\n        sortData.push(new VertexNeighborhoodSortData(order[k], signedDistance, node, theta));\r\n      }\r\n      this._announceVertexNeighborhoodFunction(sortData);\r\n    }\r\n\r\n  }\r\n  // assumptions about cluster array:\r\n  //   * data order is: x,y,theta,nodeIndex\r\n  //   * theta and nodeIndex are the \"extra\" data.\r\n  //   * only want to do anything here when curves are present.\r\n  //   * k0<=k<k1 are around a vertex\r\n  //   * These are sorted by theta.\r\n  private static secondarySortAroundVertex(clusters: ClusterableArray, order: Uint32Array, allNodes: HalfEdge[], k0: number, k1: number, radianTol: number = Geometry.smallAngleRadians) {\r\n    const sortData: VertexNeighborhoodSortData[] = [];\r\n\r\n    for (let k = k0; k < k1;) {\r\n      const kB = this.getCommonThetaEndIndex(clusters, order, k, k1, radianTol);\r\n      if (k + 1 < kB) {\r\n        sortData.length = 0;\r\n        for (let kA = k; kA < kB; kA++) {\r\n          const index = clusters.getExtraData(order[kA], 1);\r\n          const node = allNodes[index];\r\n          const signedDistance = this.curvatureSortKey(node);\r\n          sortData.push(new VertexNeighborhoodSortData(order[kA], signedDistance, node));\r\n        }\r\n        sortData.sort((a: VertexNeighborhoodSortData, b: VertexNeighborhoodSortData) => (a.radiusOfCurvature - b.radiusOfCurvature));\r\n        for (let i = 0; i < sortData.length; i++) {\r\n          order[k + i] = sortData[i].index;\r\n        }\r\n      }\r\n      k = kB;\r\n    }\r\n  }\r\n  /** Return the sort key for sorting by curvature.\r\n   * * This is the signed distance from the curve at the edge start, to center of curvature.\r\n   * * ASSUME: edgeTag is a `CurveLocationDetail` whose fractions [f0,f1] define the detail.curve segment traversed\r\n   * by the edge. If sortData < 0, the edge traverses the curve segment in reverse order [f1,f0].\r\n   * * NOTE: Currently does not account for higher derivatives in the case of higher-than-tangent match.\r\n   */\r\n  public static curvatureSortKey(node: HalfEdge): number {\r\n    if (node.edgeTag !== undefined) {\r\n      if (node.edgeTag instanceof CurveLocationDetail) {\r\n        const cld = node.edgeTag;\r\n        if (cld.curve !== undefined) {\r\n          const reverse = node.sortData !== undefined && node.sortData < 0;\r\n          const fraction = (reverse && cld.fraction1 !== undefined) ? cld.fraction1 : cld.fraction;\r\n          const radius = cld.curve.fractionToSignedXYRadiusOfCurvature(fraction);\r\n          return reverse ? -radius : radius;\r\n        }\r\n      }\r\n    }\r\n    return 0.0;\r\n  }\r\n  /** Whether the HalfEdge is part of a null face, as marked by [[clusterAndMergeXYTheta]]. */\r\n  public static isNullFace(node: HalfEdge): boolean {\r\n    return node.isMaskSet(HalfEdgeMask.NULL_FACE) && node.faceSuccessor.isMaskSet(HalfEdgeMask.NULL_FACE) && node === node.faceSuccessor.faceSuccessor;\r\n  }\r\n  /**\r\n   * Cluster the HalfEdges so that xy-coordinates within `mergeTolerance` are equated.\r\n   * * Note that any additional data (e.g., edgeTag, faceTag) on the HalfEdges are ignored. In particular,\r\n   * [[CurveLocationDetail]]s attached to clustered HalfEdges do *not* get their points adjusted.\r\n   * * This is a simple merge algorithm:\r\n   *   * untwist all edges from the vertex loops\r\n   *   * collect array of (x,y,theta) at all nodes\r\n   *   * lexical sort of the array\r\n   *   * twist all edges together in sort order around each vertex\r\n   *   * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.\r\n   *   * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.\r\n   *   * [[HalfEdgeMask.NULL_FACE]] is cleared throughout and applied within null faces.\r\n   * @param graph input graph\r\n   * @param outboundRadiansFunction optional function to compute the sort angle of an edge at its start vertex\r\n   * @param clusterTol optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].\r\n   */\r\n  public static clusterAndMergeXYTheta(\r\n    graph: HalfEdgeGraph,\r\n    outboundRadiansFunction?: (he: HalfEdge) => number,\r\n    clusterTol: number = Geometry.smallMetricDistance,\r\n    radianTol: number = Geometry.smallAngleRadians,\r\n  ) {\r\n    const allNodes = graph.allHalfEdges;\r\n    const numNodes = allNodes.length;\r\n    graph.clearMask(HalfEdgeMask.NULL_FACE);\r\n    const clusters = new ClusterableArray(2, 2, numNodes);  // data block: dot,x,y,theta,nodeIndex --- dot and theta are set later\r\n    for (let i = 0; i < numNodes; i++) {\r\n      const nodeA = allNodes[i];\r\n      const xA = nodeA.x;\r\n      const yA = nodeA.y;\r\n      HalfEdge.pinch(nodeA, nodeA.vertexSuccessor);  // pull it out of its current vertex loop.\r\n      clusters.addDirect(xA, yA, 0.0, i);\r\n    }\r\n    const order = clusters.clusterIndicesLexical(clusterTol); // assign primary sort dot product\r\n    let k0 = 0;\r\n    const numK = order.length;\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1-1] are at a vertex cluster; equate their xy\r\n        if (k1 > k0) {\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          const nodeA0 = allNodes[iA];\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            const nodeB = allNodes[iB];\r\n            nodeB.x = nodeA0.x;\r\n            nodeB.y = nodeA0.y;\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n    // NOW\r\n    //  1) There are identical coordinates at all nodes around each vertex loop.\r\n    //  2) Hence ready do sort (at each vertex) by theta.\r\n\r\n    // insert theta as extra data in the sort table . . .\r\n    for (const clusterTableIndex of order) {\r\n      if (clusterTableIndex !== ClusterableArray.clusterTerminator) {\r\n        const nodeA = allNodes[clusterTableIndex];\r\n        const nodeB = nodeA.faceSuccessor;\r\n        let getPrecomputedRadians = outboundRadiansFunction;\r\n        if (getPrecomputedRadians) {\r\n          // Recompute theta when edge geometry is completely determined by the vertices, which may have been perturbed by clustering.\r\n          const detail = nodeA.edgeTag as CurveLocationDetail;\r\n          if (undefined === detail || undefined === detail.curve || detail.curve instanceof LineSegment3d)\r\n            getPrecomputedRadians = undefined;\r\n        }\r\n        let radians = getPrecomputedRadians ? getPrecomputedRadians(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);\r\n        if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI, radianTol))\r\n          radians = Math.PI;\r\n        clusters.setExtraData(clusterTableIndex, 0, radians);\r\n      }\r\n    }\r\n    clusters.sortSubsetsBySingleKey(order, 2);\r\n    const unmatchedNullFaceNodes: HalfEdge[] = [];\r\n    k0 = 0;\r\n    let thetaA, thetaB;\r\n\r\n    // now pinch each neighboring pair together\r\n    for (let k1 = 0; k1 < numK; k1++) {\r\n      if (order[k1] === ClusterableArray.clusterTerminator) {\r\n        // nodes identified in order[k0]..order[k1-1] are tentatively sorted around a vertex by theta\r\n        if (k1 > k0) {\r\n          if (k1 > k0 + 1)\r\n            this.secondarySortAroundVertex(clusters, order, allNodes, k0, k1, radianTol); // finalize order by resolving ties via curvature\r\n          this.doAnnounceVertexNeighborhood(clusters, order, allNodes, k0, k1);\r\n          const iA = clusters.getExtraData(order[k0], 1);\r\n          thetaA = clusters.getExtraData(order[k0], 0);\r\n          const nodeA0 = allNodes[iA];\r\n          let nodeA = nodeA0;\r\n          for (let k = k0 + 1; k < k1; k++) {\r\n            const iB = clusters.getExtraData(order[k], 1);\r\n            thetaB = clusters.getExtraData(order[k], 0);\r\n            const nodeB = allNodes[iB];\r\n            if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              // nope, this edge was flagged and pinched from the other end.\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            } else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {\r\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeB === node);\r\n              if (j >= 0) {\r\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\r\n                unmatchedNullFaceNodes.pop();\r\n              }\r\n              // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.\r\n            } else {\r\n              HalfEdge.pinch(nodeA, nodeB);\r\n\r\n              // Detect null face using the heuristic:\r\n              //  * near vertex angles are same (periodic, toleranced)\r\n              //  * far vertex is clustered (exactly equal)\r\n              //  * near vertex curvatures are same (toleranced)\r\n              // Note that near vertex is already clustered.\r\n              if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB, radianTol)) {\r\n                const nodeA1 = nodeA.faceSuccessor;\r\n                const nodeB1 = nodeB.edgeMate;\r\n                if (nodeA1.isEqualXY(nodeB1)) {\r\n                  const cA = this.curvatureSortKey(nodeA);\r\n                  const cB = this.curvatureSortKey(nodeB);\r\n                  if (Geometry.isSameCoordinate(cA, cB, clusterTol)) {  // rule out banana\r\n                    HalfEdge.pinch(nodeA1, nodeB1);\r\n                    nodeA.setMask(HalfEdgeMask.NULL_FACE);\r\n                    nodeB1.setMask(HalfEdgeMask.NULL_FACE);\r\n                    unmatchedNullFaceNodes.push(nodeB1);\r\n                  }\r\n                }\r\n              }\r\n              nodeA = nodeB;\r\n              thetaA = thetaB;\r\n            }\r\n          }\r\n        }\r\n        k0 = k1 + 1;\r\n      }\r\n    }\r\n  }\r\n\r\n  private static buildVerticalSweepPriorityQueue(graph: HalfEdgeGraph): HalfEdgePriorityQueueWithPartnerArray {\r\n    const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();\r\n    for (const p of graph.allHalfEdges) {\r\n\r\n      if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {\r\n        sweepHeap.priorityQueue.push(p);\r\n      }\r\n    }\r\n    return sweepHeap;\r\n  }\r\n\r\n  private static computeIntersectionFractionsOnEdges(nodeA0: HalfEdge, nodeB0: HalfEdge, tol: number = Geometry.smallMetricDistance): { f0: XAndY, f1?: XAndY} | undefined {\r\n    const nodeA1 = nodeA0.faceSuccessor;\r\n    const aDir = { x: nodeA1.x - nodeA0.x, y: nodeA1.y - nodeA0.y };\r\n    const nodeB1 = nodeB0.faceSuccessor;\r\n    const bDir = { x: nodeB1.x - nodeB0.x, y: nodeB1.y - nodeB0.y };\r\n    let fractions = SmallSystem.lineSegmentXYUVIntersectionUnbounded(nodeA0, aDir, nodeB0, bDir, tol);\r\n    if (fractions) {\r\n      const snapFractionToSegment = (fraction: number, segStart: XAndY, segEnd: XAndY): number => {\r\n        const x = Geometry.interpolate(segStart.x, fraction, segEnd.x);\r\n        const y = Geometry.interpolate(segStart.y, fraction, segEnd.y);\r\n        if (Geometry.isSameCoordinateXY(x, y, segStart.x, segStart.y, tol))\r\n          return 0.0;\r\n        if (Geometry.isSameCoordinateXY(x, y, segEnd.x, segEnd.y, tol))\r\n          return 1.0;\r\n        return fraction;\r\n      };\r\n      fractions.f0.x = snapFractionToSegment(fractions.f0.x, nodeA0, nodeA1);\r\n      fractions.f0.y = snapFractionToSegment(fractions.f0.y, nodeB0, nodeB1);\r\n      if (fractions.f1) {\r\n        fractions.f1.x = snapFractionToSegment(fractions.f1.x, nodeA0, nodeA1);\r\n        fractions.f1.y = snapFractionToSegment(fractions.f1.y, nodeB0, nodeB1);\r\n      }\r\n      if (fractions.f1 && !(Geometry.isIn01(fractions.f1.x) && Geometry.isIn01(fractions.f1.y)))\r\n        fractions.f1 = undefined; // overlap ends beyond a segment; downgrade to simple intersection\r\n      if (!(Geometry.isIn01(fractions.f0.x) && Geometry.isIn01(fractions.f0.y))) {\r\n        if (fractions.f1) {\r\n          fractions.f0 = fractions.f1; // overlap starts beyond a segment; downgrade to simple intersection\r\n          fractions.f1 = undefined;\r\n        } else\r\n          fractions = undefined; // intersection/overlap is outside both segments\r\n      }\r\n    }\r\n    return fractions;\r\n  }\r\n  /**\r\n   * Split edges at intersections.\r\n   * * This is a large operation.\r\n   * @param graph\r\n   */\r\n  public static splitIntersectingEdges(graph: HalfEdgeGraph, distanceTol: number = Geometry.smallMetricDistance, fractionTol: number = 1.0e-8): GraphSplitData {\r\n    const data = new GraphSplitData();\r\n    const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);\r\n    let nodeA0, nodeB1;\r\n    const smallFraction = fractionTol;\r\n    const largeFraction = 1.0 - smallFraction;\r\n    let i;\r\n    let nodeB0;\r\n    while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {\r\n      data.numUpEdge++;\r\n      const n0 = sweepHeap.activeEdges.length;\r\n      sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - distanceTol);\r\n      data.numPopOut += n0 - sweepHeap.activeEdges.length;\r\n      for (i = 0; i < sweepHeap.activeEdges.length; i++) {\r\n        nodeB0 = sweepHeap.activeEdges[i];\r\n        nodeB1 = nodeB0.faceSuccessor;\r\n        if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y, distanceTol)) {\r\n          data.numA0B0++;\r\n        } else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y, distanceTol)) {\r\n          data.numA0B1++;\r\n        } else {\r\n          data.numIntersectionTest++;\r\n          const fractions = this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, distanceTol);\r\n          if (fractions) {\r\n            const splitAndPush = (node: HalfEdge, fraction?: number): void => {\r\n              if (fraction !== undefined && fraction > smallFraction && fraction < largeFraction) {\r\n                const newNode = graph.splitEdgeAtFraction(node, fraction);\r\n                sweepHeap.priorityQueue.push(newNode);  // will be popped as a nodeA0 later\r\n                data.numSplit++;\r\n              }\r\n            };\r\n            splitAndPush(nodeA0, fractions.f0.x);\r\n            splitAndPush(nodeA0, fractions.f1?.x);\r\n            splitAndPush(nodeB0, fractions.f0.y);\r\n            splitAndPush(nodeB0, fractions.f1?.y);\r\n            // existing nodeA0 and its shortened edge remain for further intersections\r\n          }\r\n        }\r\n      }\r\n      sweepHeap.activeEdges.push(nodeA0);\r\n    }\r\n    return data;\r\n  }\r\n\r\n  /**\r\n   * Returns a graph structure formed from the given LineSegment array\r\n   *\r\n   * *  Find all intersections among segments, and split them if necessary\r\n   * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up\r\n   *      vertices.\r\n   * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face\r\n   *      loops\r\n   */\r\n  public static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph {\r\n    // Structure of an index of the array: { xyTheta: Point3d, node: Node }\r\n    const graph = new HalfEdgeGraph();\r\n    HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * * Input is random linestrings, not necessarily loops\r\n   * * Graph gets full splitEdges, regularize (optional), and triangulate.\r\n   * @returns graph, or undefined if bad data.\r\n   */\r\n  public static formGraphFromChains(chains: MultiLineStringDataVariant, regularize: boolean = true, mask: HalfEdgeMask = HalfEdgeMask.PRIMARY_EDGE): HalfEdgeGraph | undefined {\r\n    if (chains.length < 1)\r\n      return undefined;\r\n    const graph = new HalfEdgeGraph();\r\n    const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);\r\n    for (const seed of chainSeeds)\r\n      seed.setMaskAroundFace(mask);\r\n\r\n    this.splitIntersectingEdges(graph);\r\n    this.clusterAndMergeXYTheta(graph);\r\n    if (regularize) {\r\n      const context = new RegularizationContext(graph);\r\n      context.regularizeGraph(true, true);\r\n    }\r\n    return graph;\r\n  }\r\n\r\n}\r\n"]}

package/lib/esm/bspline/AkimaCurve3d.d.ts

@@ -11,24 +11,26 @@ import { Transform } from "../geometry3d/Transform";
 import { XYZProps } from "../geometry3d/XYZProps";
 import { BSplineCurve3d } from "./BSplineCurve";
 /**
- * fitPoints  [[AkimaCurve3d]]
- * * This is a "json compatible" version of the serializer-friendly [[AkimaCurve3dOptions]]
+ * * This is a "json compatible" version of the serializer-friendly [[AkimaCurve3dOptions]].
  * @public
  */
 export interface AkimaCurve3dProps {
-    /** Points that the curve must pass through */
+    /** Points that the curve must pass through. */
     fitPoints: XYZProps[];
 }
 /**
- * fitPoints and end condition data for [[AkimaCurve3d]]
+ * Data for an [[AkimaCurve3d]]
  * * This is a "typed object" version of the serializer-friendly [[AkimaCurve3dProps]]
- * * Typical use cases rarely require all parameters, so the constructor does not itemize them as parameters.
  * @public
  */
 export declare class AkimaCurve3dOptions {
+    /**
+     * Points that the curve must pass through.
+     * * Traditional DGN-style Akima curves interpret the first two and last two fit points as end tangent conditions,
+     * however as the current implementation uses another interpolation algorithm, there is no such interpretation here.
+     */
     fitPoints: Point3d[];
     /**
-     *
      * @param fitPoints points to CAPTURE
      * @param knots array to CAPTURE
      */
@@ -37,32 +39,34 @@ export declare class AkimaCurve3dOptions {
      * First and last 2 points are "beyond the end" for control of end slope.
     fitPoints: Point3d[];
    
-   /** Clone with strongly typed members reduced to simple json. */
+     /** Clone with strongly typed members reduced to simple json. */
     cloneAsAkimaCurve3dProps(): AkimaCurve3dProps;
     /** Clone with strongly typed members reduced to simple json. */
     clone(): AkimaCurve3dOptions;
     /** Clone with strongly typed members reduced to simple json. */
     static create(source: AkimaCurve3dProps): AkimaCurve3dOptions;
+    /** Whether the two options are equivalent or both undefined. */
     static areAlmostEqual(dataA: AkimaCurve3dOptions | undefined, dataB: AkimaCurve3dOptions | undefined): boolean;
 }
 /**
- * Interpolating curve.
+ * Interpolating curve using the Akima formulation.
  * * Derive from [[ProxyCurve]]
  * * Use a [[BSplineCurve3d]] as the proxy
- * *
+ * * Currently the Akima formulation is replaced with a Greville interpolation.
  * @public
  */
 export declare class AkimaCurve3d extends ProxyCurve {
-    readonly curvePrimitiveType = "interpolationCurve";
+    /** String name for schema properties. */
+    readonly curvePrimitiveType = "akimaCurve";
     private _options;
     /** CAPTURE properties and proxy curve. */
     private constructor();
     /** Second step of double dispatch: call `handler.handleAkimaCurve3d(this)` */
     dispatchToGeometryHandler(handler: GeometryHandler): any;
     /**
-     * Create an [[AkimaCurve3d]] based on points, knots, and other properties in the [[AkimaCurve3dProps]] or [[AkimaCurve3dOptions]].
+     * Create an [[AkimaCurve3d]] based on an [[AkimaCurve3dProps]] or [[AkimaCurve3dOptions]].
      * * This saves a COPY OF the options or props.
-     * * Use createCapture () if the options or props can be used without copy
+     * * Use createCapture() if the options or props can be used without copy
      */
     static create(options: AkimaCurve3dOptions | AkimaCurve3dProps): AkimaCurve3d | undefined;
     /**
@@ -101,9 +105,10 @@ export declare class AkimaCurve3d extends ProxyCurve {
     /** Return a deep clone */
     clone(): AkimaCurve3d;
     /** Return a transformed clone. */
-    cloneTransformed(transform: Transform): AkimaCurve3d | undefined;
+    cloneTransformed(transform: Transform): AkimaCurve3d;
     /** Test if `other` is also an [[AkimaCurve3d]] */
     isSameGeometryClass(other: GeometryQuery): boolean;
+    /** Test if this [[AkimaCurve3d]] is almost equal to another GeometryQuery object. */
     isAlmostEqual(other: GeometryQuery): boolean;
 }
 //# sourceMappingURL=AkimaCurve3d.d.ts.map

package/lib/esm/bspline/AkimaCurve3d.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"AkimaCurve3d.d.ts","sourceRoot":"","sources":["../../../src/bspline/AkimaCurve3d.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,kCAAkC,EAAkB,MAAM,yBAAyB,CAAC;AAC7F,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD;;;;GAIG;AACF,MAAM,WAAW,iBAAiB;IAClC,8CAA8C;IAC9C,SAAS,EAAE,QAAQ,EAAE,CAAC;CACtB;AAED;;;;;GAKG;AACH,qBAAa,mBAAmB;IACvB,SAAS,EAAE,OAAO,EAAE,CAAC;IAC5B;;;;OAIG;gBACgB,SAAS,CAAC,EAAE,OAAO,EAAE;IAIzC;;;;mEAI+D;IACvD,wBAAwB,IAAI,iBAAiB;IAMtD,gEAAgE;IACvD,KAAK,IAAI,mBAAmB;IAKrC,gEAAgE;WAClD,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,mBAAmB;WAKpD,cAAc,CAAC,KAAK,EAAE,mBAAmB,GAAG,SAAS,EAAE,KAAK,EAAE,mBAAmB,GAAG,SAAS,GAAG,OAAO;CAQtH;AAED;;;;;;GAMG;AACH,qBAAa,YAAa,SAAQ,UAAU;IAC1C,SAAgB,kBAAkB,wBAAwB;IAC1D,OAAO,CAAC,QAAQ,CAAsB;IACtC,0CAA0C;IAC1C,OAAO;IAIP,8EAA8E;IAC9D,yBAAyB,CAAC,OAAO,EAAE,eAAe;IAMpE;;;;OAIG;WACa,MAAM,CAAC,OAAO,EAAE,mBAAmB,GAAG,iBAAiB,GAAG,YAAY,GAAG,SAAS;IAShG;;;OAGG;WACW,aAAa,CAAC,OAAO,EAAE,mBAAmB,GAAG,YAAY,GAAG,SAAS;IAMnF,wDAAwD;IACxD,IAAoB,UAAU,IAAI,cAAc,CAE/C;IACD,uEAAuE;IAChE,yBAAyB,IAAI,YAAY;IAIhD;;;OAGG;IACI,MAAM,IAAI,GAAG;IAGpB,2EAA2E;IACpE,UAAU,IAAI,iBAAiB;IAItC;;;OAGG;IACI,cAAc,IAAI,IAAI;IAI7B;;OAEG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAOzD;;;;;;OAMG;IACa,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAG/G,0BAA0B;IACV,KAAK,IAAI,YAAY;IAGrC,kCAAkC;IAClB,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,YAAY,GAAG,SAAS;IAIhF,kDAAkD;IAC3C,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAEzC,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;CAM7D"}
+{"version":3,"file":"AkimaCurve3d.d.ts","sourceRoot":"","sources":["../../../src/bspline/AkimaCurve3d.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,kCAAkC,EAAkB,MAAM,yBAAyB,CAAC;AAC7F,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD;;;GAGG;AACF,MAAM,WAAW,iBAAiB;IAClC,+CAA+C;IAC/C,SAAS,EAAE,QAAQ,EAAE,CAAC;CACtB;AAED;;;;GAIG;AACH,qBAAa,mBAAmB;IAC9B;;;;OAIG;IACI,SAAS,EAAE,OAAO,EAAE,CAAC;IAE5B;;;OAGG;gBACgB,SAAS,CAAC,EAAE,OAAO,EAAE;IAIzC;;;;qEAIiE;IACzD,wBAAwB,IAAI,iBAAiB;IAMpD,gEAAgE;IACzD,KAAK,IAAI,mBAAmB;IAKnC,gEAAgE;WAClD,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,mBAAmB;IAKpE,gEAAgE;WAClD,cAAc,CAAC,KAAK,EAAE,mBAAmB,GAAG,SAAS,EAAE,KAAK,EAAE,mBAAmB,GAAG,SAAS,GAAG,OAAO;CAOtH;AAED;;;;;;GAMG;AACH,qBAAa,YAAa,SAAQ,UAAU;IAC1C,yCAAyC;IACzC,SAAgB,kBAAkB,gBAAgB;IAClD,OAAO,CAAC,QAAQ,CAAsB;IACtC,0CAA0C;IAC1C,OAAO;IAIP,8EAA8E;IAC9D,yBAAyB,CAAC,OAAO,EAAE,eAAe;IAMlE;;;;OAIG;WACW,MAAM,CAAC,OAAO,EAAE,mBAAmB,GAAG,iBAAiB,GAAG,YAAY,GAAG,SAAS;IAShG;;;OAGG;WACW,aAAa,CAAC,OAAO,EAAE,mBAAmB,GAAG,YAAY,GAAG,SAAS;IAMnF,wDAAwD;IACxD,IAAoB,UAAU,IAAI,cAAc,CAE/C;IACD,uEAAuE;IAChE,yBAAyB,IAAI,YAAY;IAIhD;;;OAGG;IACI,MAAM,IAAI,GAAG;IAGpB,2EAA2E;IACpE,UAAU,IAAI,iBAAiB;IAItC;;;OAGG;IACI,cAAc,IAAI,IAAI;IAI7B;;OAEG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAKzD;;;;;;OAMG;IACa,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAG/G,0BAA0B;IACV,KAAK,IAAI,YAAY;IAGrC,kCAAkC;IAClB,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,YAAY;IAIpE,kDAAkD;IAC3C,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAEzD,qFAAqF;IACrE,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;CAM7D"}

package/lib/esm/bspline/AkimaCurve3d.js

@@ -10,15 +10,18 @@ import { Geometry } from "../Geometry";
 import { Point3dArray } from "../geometry3d/PointHelpers";
 import { BSplineCurve3d } from "./BSplineCurve";
 /**
- * fitPoints and end condition data for [[AkimaCurve3d]]
+ * Data for an [[AkimaCurve3d]]
  * * This is a "typed object" version of the serializer-friendly [[AkimaCurve3dProps]]
- * * Typical use cases rarely require all parameters, so the constructor does not itemize them as parameters.
  * @public
  */
 export class AkimaCurve3dOptions {
+    /**
+     * Points that the curve must pass through.
+     * * Traditional DGN-style Akima curves interpret the first two and last two fit points as end tangent conditions,
+     * however as the current implementation uses another interpolation algorithm, there is no such interpretation here.
+     */
     fitPoints;
     /**
-     *
      * @param fitPoints points to CAPTURE
      * @param knots array to CAPTURE
      */
@@ -29,7 +32,7 @@ export class AkimaCurve3dOptions {
      * First and last 2 points are "beyond the end" for control of end slope.
     fitPoints: Point3d[];
    
-   /** Clone with strongly typed members reduced to simple json. */
+     /** Clone with strongly typed members reduced to simple json. */
     cloneAsAkimaCurve3dProps() {
         const props = {
             fitPoints: Point3dArray.cloneDeepJSONNumberArrays(this.fitPoints),
@@ -46,24 +49,25 @@ export class AkimaCurve3dOptions {
         const result = new AkimaCurve3dOptions(Point3dArray.clonePoint3dArray(source.fitPoints));
         return result;
     }
+    /** Whether the two options are equivalent or both undefined. */
     static areAlmostEqual(dataA, dataB) {
         if (dataA === undefined && dataB === undefined)
             return true;
-        if (dataA !== undefined && dataB !== undefined) {
+        if (dataA !== undefined && dataB !== undefined)
             return Geometry.almostEqualArrays(dataA.fitPoints, dataB.fitPoints, (a, b) => a.isAlmostEqual(b));
-        }
         return false;
     }
 }
 /**
- * Interpolating curve.
+ * Interpolating curve using the Akima formulation.
  * * Derive from [[ProxyCurve]]
  * * Use a [[BSplineCurve3d]] as the proxy
- * *
+ * * Currently the Akima formulation is replaced with a Greville interpolation.
  * @public
  */
 export class AkimaCurve3d extends ProxyCurve {
-    curvePrimitiveType = "interpolationCurve";
+    /** String name for schema properties. */
+    curvePrimitiveType = "akimaCurve";
     _options;
     /** CAPTURE properties and proxy curve. */
     constructor(properties, proxyCurve) {
@@ -78,9 +82,9 @@ export class AkimaCurve3d extends ProxyCurve {
         return result;
     }
     /**
-     * Create an [[AkimaCurve3d]] based on points, knots, and other properties in the [[AkimaCurve3dProps]] or [[AkimaCurve3dOptions]].
+     * Create an [[AkimaCurve3d]] based on an [[AkimaCurve3dProps]] or [[AkimaCurve3dOptions]].
      * * This saves a COPY OF the options or props.
-     * * Use createCapture () if the options or props can be used without copy
+     * * Use createCapture() if the options or props can be used without copy
      */
     static create(options) {
         let optionsCopy;
@@ -133,11 +137,9 @@ export class AkimaCurve3d extends ProxyCurve {
      * Transform this [[AkimaCurve3d]] and its defining data in place
      */
     tryTransformInPlace(transform) {
-        const proxyOk = this._proxyCurve.tryTransformInPlace(transform);
-        if (proxyOk) {
-            transform.multiplyPoint3dArray(this._options.fitPoints);
-        }
-        return proxyOk;
+        this._proxyCurve.tryTransformInPlace(transform);
+        transform.multiplyPoint3dArray(this._options.fitPoints);
+        return true; // we know this succeeds
     }
     /**
      * Find intervals of this CurvePrimitive that are interior to a clipper.
@@ -159,6 +161,7 @@ export class AkimaCurve3d extends ProxyCurve {
     }
     /** Test if `other` is also an [[AkimaCurve3d]] */
     isSameGeometryClass(other) { return other instanceof AkimaCurve3d; }
+    /** Test if this [[AkimaCurve3d]] is almost equal to another GeometryQuery object. */
     isAlmostEqual(other) {
         if (other instanceof AkimaCurve3d) {
             return AkimaCurve3dOptions.areAlmostEqual(this._options, other._options);