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

package/lib/esm/curve/Query/PlanarSubdivision.d.ts

@@ -0,0 +1,16 @@
+import { HalfEdge, HalfEdgeGraph } from "../../topology/Graph";
+import { CurveLocationDetailPair } from "../CurveLocationDetail";
+import { CurvePrimitive } from "../CurvePrimitive";
+import { Loop, SignedLoops } from "../Loop";
+/**
+ * @internal
+ */
+export declare class PlanarSubdivision {
+    static assembleHalfEdgeGraph(_primitives: CurvePrimitive[], allPairs: CurveLocationDetailPair[]): HalfEdgeGraph;
+    static collectSignedLoop(loop: Loop, signedAreas: SignedLoops, zeroAreaTolerance?: number): number;
+    static createLoopInFace(faceSeed: HalfEdge, announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void): Loop;
+    private static isNullFace;
+    private static nonNullEdgeMate;
+    static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance?: number): SignedLoops[];
+}
+//# sourceMappingURL=PlanarSubdivision.d.ts.map

package/lib/esm/curve/Query/PlanarSubdivision.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAG/D,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAqDhE;;GAEG;AACH,qBAAa,iBAAiB;WACd,qBAAqB,CAAC,WAAW,EAAE,cAAc,EAAE,EAAE,QAAQ,EAAE,uBAAuB,EAAE,GAAG,aAAa;WA4CxG,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,iBAAiB,GAAE,MAAgB,GAAG,MAAM;WAepG,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,EAC/C,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI;IAuB7E,OAAO,CAAC,MAAM,CAAC,UAAU;IAIzB,OAAO,CAAC,MAAM,CAAC,eAAe;WAWhB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,iBAAiB,GAAE,MAAgB,GAAG,WAAW,EAAE;CAmC7H"}

package/lib/esm/curve/Query/PlanarSubdivision.js

@@ -0,0 +1,220 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { HalfEdgeGraph } from "../../topology/Graph";
+import { HalfEdgeGraphSearch } from "../../topology/HalfEdgeGraphSearch";
+import { HalfEdgeGraphMerge } from "../../topology/Merging";
+import { CurveLocationDetail } from "../CurveLocationDetail";
+import { Loop, LoopCurveLoopCurve } from "../Loop";
+import { RegionOps } from "../RegionOps";
+/** @packageDocumentation
+ * @module Curve
+ */
+class MapCurvePrimitiveToCurveLocatioNDetailPairArray {
+    constructor() {
+        this.primitiveToPair = new Map();
+        // index assigned to this primitive for this calculation.
+        this.primitiveToIndex = new Map();
+        this._numIndexedPrimitives = 0;
+    }
+    assignPrimitiveIndex(primitive) {
+        if (primitive !== undefined) {
+            const index = this.primitiveToIndex.get(primitive);
+            if (index === undefined) {
+                this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);
+            }
+        }
+    }
+    insertPrimitiveToPair(primitive, pair) {
+        if (primitive) {
+            const priorPairs = this.primitiveToPair.get(primitive);
+            this.assignPrimitiveIndex(primitive);
+            if (!priorPairs) {
+                this.primitiveToPair.set(primitive, [pair]);
+            }
+            else {
+                priorPairs.push(pair);
+            }
+        }
+    }
+    insertPair(pair) {
+        const primitiveA = pair.detailA.curve;
+        if (primitiveA)
+            this.insertPrimitiveToPair(primitiveA, pair);
+        const primitiveB = pair.detailB.curve;
+        if (primitiveB)
+            this.insertPrimitiveToPair(primitiveB, pair);
+    }
+}
+/*
+  function getDetailString(detail: CurveLocationDetail | undefined): string {
+    if (!detail)
+      return "{}";
+    else return tagString("primitive", this.primitiveToIndex.get(detail.curve!)) + tagString("f0", detail.fraction) + tagString("f1", detail.fraction1);
+  }
+}
+function tagString(name: string, value: number | undefined): string {
+  if (value !== undefined)
+    return "(" + name + " " + value + ")";
+  return "";
+}
+*/
+/**
+ * @internal
+ */
+export class PlanarSubdivision {
+    static assembleHalfEdgeGraph(_primitives, allPairs) {
+        const detailByPrimitive = new MapCurvePrimitiveToCurveLocatioNDetailPairArray(); // map from key CurvePrimitive to CurveLocationDetailPair.
+        for (const p of _primitives)
+            detailByPrimitive.assignPrimitiveIndex(p);
+        for (const pair of allPairs) {
+            detailByPrimitive.insertPair(pair);
+        }
+        const graph = new HalfEdgeGraph();
+        for (const entry of detailByPrimitive.primitiveToPair.entries()) {
+            const p = entry[0];
+            const details = entry[1];
+            details.sort((pairA, pairB) => {
+                const fractionA = getFractionOnCurve(pairA, p);
+                const fractionB = getFractionOnCurve(pairB, p);
+                if (fractionA === undefined || fractionB === undefined)
+                    return -1000.0;
+                return fractionA - fractionB;
+            });
+            let detail0 = getDetailOnCurve(details[0], p);
+            for (let i = 1; i < details.length; i++) {
+                // create (both sides of) a graph edge . . .
+                const detail1 = getDetailOnCurve(details[i], p);
+                if (detail0.point.isAlmostEqual(detail1.point)) {
+                }
+                else {
+                    const halfEdge = graph.createEdgeXYAndZ(detail0.point, 0, detail1.point, 0);
+                    const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, detail0.fraction, detail1.fraction);
+                    const mate = halfEdge.edgeMate;
+                    halfEdge.edgeTag = detail01;
+                    halfEdge.sortData = 1.0;
+                    mate.edgeTag = detail01;
+                    mate.sortData = -1.0;
+                    halfEdge.sortAngle = sortAngle(detail01.curve, detail01.fraction, false);
+                    mate.sortAngle = sortAngle(detail01.curve, detail01.fraction1, true);
+                }
+                detail0 = detail1;
+            }
+        }
+        HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle);
+        return graph;
+    }
+    // based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative, or sliver loops.
+    // return the area (forced to zero if within tolerance)
+    static collectSignedLoop(loop, signedAreas, zeroAreaTolerance = 1.0e-10) {
+        let area = RegionOps.computeXYArea(loop);
+        if (area === undefined)
+            area = 0;
+        if (Math.abs(area) < zeroAreaTolerance)
+            area = 0.0;
+        loop.computedAreaInPlanarSubdivision = area;
+        if (area > 0)
+            signedAreas.positiveAreaLoops.push(loop);
+        else if (area < 0)
+            signedAreas.negativeAreaLoops.push(loop);
+        else
+            signedAreas.slivers.push(loop);
+        return area;
+    }
+    static createLoopInFace(faceSeed, announce) {
+        let he = faceSeed;
+        const loop = Loop.create();
+        do {
+            const detail = he.edgeTag;
+            if (detail) {
+                let curve;
+                if (he.sortData > 0)
+                    curve = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1);
+                else
+                    curve = detail.curve.clonePartialCurve(detail.fraction1, detail.fraction);
+                if (curve) {
+                    if (announce !== undefined)
+                        announce(he, curve, loop);
+                    loop.tryAddChild(curve);
+                }
+            }
+            he = he.faceSuccessor;
+        } while (he !== faceSeed);
+        return loop;
+    }
+    // return true if there are only two edges.
+    // In a line-only graph, this is a null-area face.
+    static isNullFace(he) {
+        return he.faceSuccessor.faceSuccessor === he;
+    }
+    // Look  across edge mates (possibly several) for a nonnull mate face.
+    static nonNullEdgeMate(_graph, e) {
+        if (this.isNullFace(e))
+            return undefined;
+        let e1 = e.edgeMate;
+        while (this.isNullFace(e1)) {
+            e1 = e1.faceSuccessor.edgeMate;
+            if (e1 === e)
+                return undefined;
+        }
+        return e1;
+    }
+    static collectSignedLoopSetsInHalfEdgeGraph(graph, zeroAreaTolerance = 1.0e-10) {
+        const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);
+        const result = [];
+        const edgeMap = new Map();
+        for (const faceSeeds of q) {
+            const componentAreas = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };
+            const edges = [];
+            for (const faceSeed of faceSeeds) {
+                const loop = this.createLoopInFace(faceSeed, (he, curveC, loopC) => {
+                    if (this.isNullFace(he)) {
+                        // Ignore all edges of null faces.
+                    }
+                    else {
+                        const mate = this.nonNullEdgeMate(graph, he);
+                        if (mate !== undefined) {
+                            const e = edgeMap.get(mate);
+                            if (e === undefined) {
+                                // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge
+                                const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
+                                edgeMap.set(he, e1);
+                            }
+                            else if (e instanceof LoopCurveLoopCurve) {
+                                e.setB(loopC, curveC);
+                                edges.push(e);
+                                edgeMap.delete(mate);
+                            }
+                        }
+                    }
+                });
+                this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance);
+            }
+            componentAreas.edges = edges;
+            result.push(componentAreas);
+            edgeMap.clear();
+        }
+        return result;
+    }
+}
+function sortAngle(curve, fraction, reverse) {
+    const ray = curve.fractionToPointAndDerivative(fraction);
+    const s = reverse ? -1.0 : 1.0;
+    return Math.atan2(s * ray.direction.y, s * ray.direction.x);
+}
+function getFractionOnCurve(pair, curve) {
+    if (pair.detailA.curve === curve)
+        return pair.detailA.fraction;
+    if (pair.detailB.curve === curve)
+        return pair.detailB.fraction;
+    return undefined;
+}
+function getDetailOnCurve(pair, curve) {
+    if (pair.detailA.curve === curve)
+        return pair.detailA;
+    if (pair.detailB.curve === curve)
+        return pair.detailB;
+    return undefined;
+}
+//# sourceMappingURL=PlanarSubdivision.js.map

package/lib/esm/curve/Query/PlanarSubdivision.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PlanarSubdivision.js","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAY,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAC/D,OAAO,EAAE,mBAAmB,EAAE,MAAM,oCAAoC,CAAC;AACzE,OAAO,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAA2B,MAAM,wBAAwB,CAAC;AAEtF,OAAO,EAAE,IAAI,EAAE,kBAAkB,EAAe,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,SAAS,EAAE,MAAM,cAAc,CAAC;AAEzC;;GAEG;AAEH,MAAM,+CAA+C;IAArD;QACS,oBAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;QAC9E,yDAAyD;QAClD,qBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;QACpD,0BAAqB,GAAW,CAAC,CAAC;IA4B5C,CAAC;IA3BQ,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;aACpE;SACF;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE;YACb,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,EAAE;gBACf,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;aAC7C;iBAAM;gBACL,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACvB;SACF;IACH,CAAC;IACM,UAAU,CAAC,IAA6B;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;CACF;AACD;;;;;;;;;;;;EAYE;AACF;;GAEG;AACH,MAAM,OAAO,iBAAiB;IACrB,MAAM,CAAC,qBAAqB,CAAC,WAA6B,EAAE,QAAmC;QACpG,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC,CAAG,0DAA0D;QAC7I,KAAK,MAAM,CAAC,IAAI,WAAW;YACzB,iBAAiB,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;QAC5C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SACpC;QACD,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE;YAC/D,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE;gBAC9E,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC/C,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBAC/C,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS;oBACpD,OAAO,CAAC,MAAM,CAAC;gBACjB,OAAO,SAAS,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;YACH,IAAI,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;YAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACvC,4CAA4C;gBAC5C,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAE,CAAC;gBACjD,IAAI,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;iBAE/C;qBAAM;oBACL,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;oBAC5E,MAAM,QAAQ,GAAG,mBAAmB,CAAC,oCAAoC,CAAC,CAAC,EAAE,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACjH,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;oBAC/B,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC;oBAC5B,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;oBACxB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;oBACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC;oBACrB,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAM,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;oBAC1E,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,QAAQ,CAAC,KAAM,EAAE,QAAQ,CAAC,SAAU,EAAE,IAAI,CAAC,CAAC;iBACxE;gBACD,OAAO,GAAG,OAAO,CAAC;aACnB;SACF;QACD,kBAAkB,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAU,CAAC,CAAC;QAClF,OAAO,KAAK,CAAC;IACf,CAAC;IAED,sIAAsI;IACtI,uDAAuD;IAChD,MAAM,CAAC,iBAAiB,CAAC,IAAU,EAAE,WAAwB,EAAE,oBAA4B,OAAO;QACvG,IAAI,IAAI,GAAG,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,iBAAiB;YACpC,IAAI,GAAG,GAAG,CAAC;QACZ,IAAY,CAAC,+BAA+B,GAAG,IAAI,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC;YACV,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACtC,IAAI,IAAI,GAAG,CAAC;YACf,WAAW,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEzC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IACM,MAAM,CAAC,gBAAgB,CAAC,QAAkB,EAC/C,QAAoE;QACpE,IAAI,EAAE,GAAG,QAAQ,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,GAAG;YACD,MAAM,MAAM,GAAG,EAAE,CAAC,OAA8B,CAAC;YACjD,IAAI,MAAM,EAAE;gBACV,IAAI,KAAK,CAAC;gBACV,IAAI,EAAE,CAAC,QAAS,GAAG,CAAC;oBAClB,KAAK,GAAG,MAAM,CAAC,KAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,SAAU,CAAC,CAAC;;oBAE5E,KAAK,GAAG,MAAM,CAAC,KAAM,CAAC,iBAAiB,CAAC,MAAM,CAAC,SAAU,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;gBAC9E,IAAI,KAAK,EAAE;oBACT,IAAI,QAAQ,KAAK,SAAS;wBACxB,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;oBAC5B,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;iBACzB;aACF;YACD,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC;SACvB,QAAQ,EAAE,KAAK,QAAQ,EAAE;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACH,2CAA2C;IACzC,kDAAkD;IAC1C,MAAM,CAAC,UAAU,CAAC,EAAY;QACpC,OAAO,EAAE,CAAC,aAAa,CAAC,aAAa,KAAK,EAAE,CAAC;IAC/C,CAAC;IACD,sEAAsE;IAC9D,MAAM,CAAC,eAAe,CAAC,MAAqB,EAAE,CAAW;QAC/D,IAAI,IAAI,CAAC,UAAU,CAAE,CAAC,CAAC;YACrB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAC;YACzB,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;SACpB;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,oCAAoC,CAAC,KAAoB,EAAE,oBAA4B,OAAO;QAC1G,MAAM,CAAC,GAAG,mBAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAClG,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;QACxD,KAAK,MAAM,SAAS,IAAI,CAAC,EAAE;YACzB,MAAM,cAAc,GAAgB,EAAE,iBAAiB,EAAE,EAAE,EAAE,iBAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAClG,MAAM,KAAK,GAAyB,EAAE,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;gBAChC,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC,EAAY,EAAE,MAAsB,EAAE,KAAW,EAAE,EAAE;oBACjG,IAAI,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE;wBACvB,kCAAkC;qBACnC;yBAAM;wBACL,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;wBAC3C,IAAI,IAAI,KAAK,SAAS,EAAC;4BACrB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;4BAC5B,IAAI,CAAC,KAAK,SAAS,EAAE;gCACnB,oGAAoG;gCACpG,MAAM,EAAE,GAAG,IAAI,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;gCACvE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;6BACrB;iCAAM,IAAI,CAAC,YAAY,kBAAkB,EAAE;gCAC1C,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gCACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gCACd,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;6BACtB;yBACJ;qBACF;gBACH,CAAC,CAAC,CAAC;gBACH,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,iBAAiB,CAAC,CAAC;aACjE;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;SACjB;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAED,SAAS,SAAS,CAAC,KAAqB,EAAE,QAAgB,EAAE,OAAgB;IAC1E,MAAM,GAAG,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACzD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,kBAAkB,CAAC,IAA6B,EAAE,KAAqB;IAC9E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,OAAO,SAAS,CAAC;AACnB,CAAC;AACD,SAAS,gBAAgB,CAAC,IAA6B,EAAE,KAAqB;IAC5E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,OAAO,SAAS,CAAC;AACnB,CAAC","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\nimport { HalfEdge, HalfEdgeGraph } from \"../../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\r\nimport { RegionOps } from \"../RegionOps\";\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nclass MapCurvePrimitiveToCurveLocatioNDetailPairArray {\r\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\r\n  // index assigned to this primitive for this calculation.\r\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\r\n  private _numIndexedPrimitives: number = 0;\r\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\r\n    if (primitive !== undefined) {\r\n      const index = this.primitiveToIndex.get(primitive);\r\n      if (index === undefined) {\r\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\r\n      }\r\n    }\r\n  }\r\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\r\n    if (primitive) {\r\n      const priorPairs = this.primitiveToPair.get(primitive);\r\n      this.assignPrimitiveIndex(primitive);\r\n      if (!priorPairs) {\r\n        this.primitiveToPair.set(primitive, [pair]);\r\n      } else {\r\n        priorPairs.push(pair);\r\n      }\r\n    }\r\n  }\r\n  public insertPair(pair: CurveLocationDetailPair) {\r\n    const primitiveA = pair.detailA.curve;\r\n    if (primitiveA)\r\n      this.insertPrimitiveToPair(primitiveA, pair);\r\n    const primitiveB = pair.detailB.curve;\r\n    if (primitiveB)\r\n      this.insertPrimitiveToPair(primitiveB, pair);\r\n  }\r\n}\r\n/*\r\n  function getDetailString(detail: CurveLocationDetail | undefined): string {\r\n    if (!detail)\r\n      return \"{}\";\r\n    else return tagString(\"primitive\", this.primitiveToIndex.get(detail.curve!)) + tagString(\"f0\", detail.fraction) + tagString(\"f1\", detail.fraction1);\r\n  }\r\n}\r\nfunction tagString(name: string, value: number | undefined): string {\r\n  if (value !== undefined)\r\n    return \"(\" + name + \" \" + value + \")\";\r\n  return \"\";\r\n}\r\n*/\r\n/**\r\n * @internal\r\n */\r\nexport class PlanarSubdivision {\r\n  public static assembleHalfEdgeGraph(_primitives: CurvePrimitive[], allPairs: CurveLocationDetailPair[]): HalfEdgeGraph {\r\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocatioNDetailPairArray();   // map from key CurvePrimitive to CurveLocationDetailPair.\r\n    for (const p of _primitives)\r\n      detailByPrimitive.assignPrimitiveIndex(p);\r\n    for (const pair of allPairs) {\r\n      detailByPrimitive.insertPair(pair);\r\n    }\r\n    const graph = new HalfEdgeGraph();\r\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\r\n      const p = entry[0];\r\n      const details = entry[1];\r\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\r\n        const fractionA = getFractionOnCurve(pairA, p);\r\n        const fractionB = getFractionOnCurve(pairB, p);\r\n        if (fractionA === undefined || fractionB === undefined)\r\n          return -1000.0;\r\n        return fractionA - fractionB;\r\n      });\r\n      let detail0 = getDetailOnCurve(details[0], p)!;\r\n      for (let i = 1; i < details.length; i++) {\r\n        // create (both sides of) a graph edge . . .\r\n        const detail1 = getDetailOnCurve(details[i], p)!;\r\n        if (detail0.point.isAlmostEqual(detail1.point)) {\r\n\r\n        } else {\r\n          const halfEdge = graph.createEdgeXYAndZ(detail0.point, 0, detail1.point, 0);\r\n          const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, detail0.fraction, detail1.fraction);\r\n          const mate = halfEdge.edgeMate;\r\n          halfEdge.edgeTag = detail01;\r\n          halfEdge.sortData = 1.0;\r\n          mate.edgeTag = detail01;\r\n          mate.sortData = -1.0;\r\n          halfEdge.sortAngle = sortAngle(detail01.curve!, detail01.fraction, false);\r\n          mate.sortAngle = sortAngle(detail01.curve!, detail01.fraction1!, true);\r\n        }\r\n        detail0 = detail1;\r\n      }\r\n    }\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle!);\r\n    return graph;\r\n  }\r\n\r\n  // based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative, or sliver loops.\r\n  // return the area (forced to zero if within tolerance)\r\n  public static collectSignedLoop(loop: Loop, signedAreas: SignedLoops, zeroAreaTolerance: number = 1.0e-10): number{\r\n    let area = RegionOps.computeXYArea(loop);\r\n    if (area === undefined)\r\n      area = 0;\r\n    if (Math.abs(area) < zeroAreaTolerance)\r\n      area = 0.0;\r\n    (loop as any).computedAreaInPlanarSubdivision = area;\r\n    if (area > 0)\r\n      signedAreas.positiveAreaLoops.push(loop);\r\n    else if (area < 0)\r\n      signedAreas.negativeAreaLoops.push(loop);\r\n    else\r\n      signedAreas.slivers.push(loop);\r\n    return area;\r\n  }\r\n  public static createLoopInFace(faceSeed: HalfEdge,\r\n    announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void): Loop {\r\n    let he = faceSeed;\r\n    const loop = Loop.create();\r\n    do {\r\n      const detail = he.edgeTag as CurveLocationDetail;\r\n      if (detail) {\r\n        let curve;\r\n        if (he.sortData! > 0)\r\n          curve = detail.curve!.clonePartialCurve(detail.fraction, detail.fraction1!);\r\n        else\r\n          curve = detail.curve!.clonePartialCurve(detail.fraction1!, detail.fraction);\r\n        if (curve) {\r\n          if (announce !== undefined)\r\n            announce(he, curve, loop);\r\n          loop.tryAddChild(curve);\r\n        }\r\n      }\r\n      he = he.faceSuccessor;\r\n    } while (he !== faceSeed);\r\n    return loop;\r\n  }\r\n// return true if there are only two edges.\r\n  // In a line-only graph, this is a null-area face.\r\n  private static isNullFace(he: HalfEdge): boolean {\r\n    return he.faceSuccessor.faceSuccessor === he;\r\n  }\r\n  // Look  across edge mates (possibly several) for a nonnull mate face.\r\n  private static nonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\r\n    if (this.isNullFace (e))\r\n      return undefined;\r\n    let e1 = e.edgeMate;\r\n    while (this.isNullFace(e1)){\r\n      e1 = e1.faceSuccessor.edgeMate;\r\n      if (e1 === e)\r\n        return undefined;\r\n    }\r\n    return e1;\r\n  }\r\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance: number = 1.0e-10): SignedLoops[] {\r\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    const result: SignedLoops[] = [];\r\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\r\n    for (const faceSeeds of q) {\r\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\r\n      const edges: LoopCurveLoopCurve[] = [];\r\n      for (const faceSeed of faceSeeds) {\r\n        const loop = this.createLoopInFace(faceSeed, (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\r\n          if (this.isNullFace(he)) {\r\n            // Ignore all edges of null faces.\r\n          } else {\r\n            const mate = this.nonNullEdgeMate(graph, he);\r\n              if (mate !== undefined){\r\n                const e = edgeMap.get(mate);\r\n                if (e === undefined) {\r\n                  // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\r\n                  const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\r\n                  edgeMap.set(he, e1);\r\n                } else if (e instanceof LoopCurveLoopCurve) {\r\n                  e.setB(loopC, curveC);\r\n                  edges.push(e);\r\n                  edgeMap.delete(mate);\r\n                }\r\n            }\r\n          }\r\n        });\r\n        this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance);\r\n      }\r\n      componentAreas.edges = edges;\r\n      result.push(componentAreas);\r\n      edgeMap.clear();\r\n    }\r\n    return result;\r\n  }\r\n}\r\n\r\nfunction sortAngle(curve: CurvePrimitive, fraction: number, reverse: boolean): number {\r\n  const ray = curve.fractionToPointAndDerivative(fraction);\r\n  const s = reverse ? -1.0 : 1.0;\r\n  return Math.atan2(s * ray.direction.y, s * ray.direction.x);\r\n}\r\n\r\nfunction getFractionOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): number | undefined {\r\n  if (pair.detailA.curve === curve)\r\n    return pair.detailA.fraction;\r\n  if (pair.detailB.curve === curve)\r\n    return pair.detailB.fraction;\r\n  return undefined;\r\n}\r\nfunction getDetailOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail | undefined {\r\n  if (pair.detailA.curve === curve)\r\n    return pair.detailA;\r\n  if (pair.detailB.curve === curve)\r\n    return pair.detailB;\r\n  return undefined;\r\n}\r\n"]}

package/lib/esm/curve/Query/StrokeCountChain.d.ts

@@ -0,0 +1,186 @@
+/** @packageDocumentation
+ * @module Curve
+ */
+import { Range1d } from "../../geometry3d/Range";
+import { AnyCurve } from "../CurveChain";
+import { CurveChain, CurveCollection } from "../CurveCollection";
+import { LineString3d } from "../LineString3d";
+import { StrokeOptions } from "../StrokeOptions";
+import { StrokeCountMap } from "./StrokeCountMap";
+/**
+ * abstract methods for callbacks during sweeps of collections of StrokeCount Structures.
+ * * A set of StrokeCountMaps are to be visited multiple times.
+ * * The logic that controls the sweep is as below.
+ * * The callback object controls the number of sweeps and can adapt its action to the respective sweeps.
+ * * Note that a "false" from cb.startPass() terminates passes for this chainIndex and primitiveIndex, but all others exit the whole sequence.
+ * * This logic occurs 2 or three levels deep
+ *   * outer level is "chains".   Simple swept path or loops have only one outer; parity regions have one outer per loop of the parity region
+ *   * second level is primitive within chain.
+ *     * If the primitives in a set are "single component", second level is lowest.
+ *        * startSweep() and endSweep() calls are two parameters, with undefined componentIndex
+ *     * If the primitives in a set are multi-component, there is a third level looping through corresponding components.
+ * `
+ *    if (!cb.startSweeps (chainIndex, primitiveIndex, componentIndex))
+ *      return false;
+ *    for (let pass = 0;cb.startPass (pass); pass++){
+ *      for (each map in working set)
+ *            if (!cb.visit (pass, map)) return false;
+ *       if (!cb.endPass ()) return false;
+ *        }
+ *      }
+ * if (!cb.endSweeps (chainIndex, primitiveIndex, componentIndex)) return false;
+ * return true;
+ * `
+ * @internal
+ */
+export declare abstract class StrokeCountMapMultipassVisitor {
+    /**
+     * called to announce the beginning of one or more sweeps through related StrokeCountMap's
+     * @param chainIndex index of loop or path within the various contours.
+     * @param primitiveIndex index of primitive within the loop or path.
+     * @param componentIndex optional component index.
+     * @returns the number of sweeps to perform.
+     */
+    startSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean;
+    /**
+     * announce the beginning of a sweep pass.
+     * @param pass the index (0,1...) for this sweep pass.
+     * @return true to execute this pass.  false to break from the pass loop (next method called is endSweeps)
+     */
+    abstract startPass(pass: number): boolean;
+    abstract visit(pass: number, map: StrokeCountMap): boolean;
+    /**
+     * announce the end of a pass
+     * @param pass the index (0,1...) for this sweep pass.
+     * @return true to continue the sweeps.
+     */
+    abstract endPass(pass: number): boolean;
+    /**
+     * announce the end of handling for particular chainIndex and primitiveIndex;
+     * @return true to continue outer loops.
+     */
+    endSweeps(_chainIndex: number, _primitiveIndex: number, _componentIndex?: number): boolean;
+}
+/**
+ * * pass 1: determine max numStroke
+ * * pass 2: impose max numStroke
+ * @internal
+ */
+export declare class StrokeCountMapVisitorApplyMaxCount extends StrokeCountMapMultipassVisitor {
+    myMap: StrokeCountMap;
+    constructor();
+    /** set up for a pass through corresponding maps. */
+    startPass(pass: number): boolean;
+    /** visit one of the set of corresponding maps. */
+    visit(pass: number, map: StrokeCountMap): boolean;
+    endPass(_pass: number): boolean;
+}
+/**
+ * * pass 1: determine max curveLength among maps presented.
+ * * pass 2: set the a0 and a1 values to 0 and that max distance
+ * @internal
+ */
+export declare class StrokeCountMapVisitorApplyMaxCurveLength extends StrokeCountMapMultipassVisitor {
+    maxCurveLength: number;
+    constructor();
+    /** set up for a pass through corresponding maps. */
+    startPass(pass: number): boolean;
+    /** visit one of the set of corresponding maps. */
+    visit(pass: number, map: StrokeCountMap): boolean;
+    endPass(_pass: number): boolean;
+}
+/**
+ * class `StrokeCountChain` contains:
+ * * `maps` = an array of `StrokeCountMap`
+ * * `parent` = parent CurveCollection.
+ *
+ * An instance is normally created with either a `Path` or `Loop` as the parent.
+ */
+export declare class StrokeCountChain {
+    maps: StrokeCountMap[];
+    parent?: CurveCollection;
+    /**
+     * options are used (with different purposes) at two times:
+     * * When the StrokeCountChain is created, the options affect the stroke counts.  This is just creating markup, not actual strokes.
+     * * When actual stroking happens, the options control creation of parameters and tangents.
+     */
+    options?: StrokeOptions;
+    private constructor();
+    static createForCurveChain(chain: CurveChain, options?: StrokeOptions): StrokeCountChain;
+    getStrokes(): LineString3d;
+    /** internal form of  */
+    private static applySummed01LimitsWithinArray;
+    /**
+     * walk the maps in the array.
+     * * in maps with no component data
+     *   * increment map.a0 and map.a1 by the incoming distance a0
+     * * in maps with component data:
+     *   * recurse through the component array.
+     *   * increment map.a0 by the incoming a0.
+     *   * returned a1 from the componentData array becomes a1
+     * @returns upper value of a1 in final map.
+     * @param maps
+     * @param incomingSum lower value to add to a0 for first map.
+     */
+    applySummed01Limits(incomingSum: number): number;
+}
+/**
+ * class `StrokeCountSection`\
+ * * contains an array of `StrokeCountChain`.
+ * * Hence it is the internal node level of a (1-level-deep) tree of `StrokeCountChain`
+ * @internal
+ */
+export declare class StrokeCountSection {
+    chains: StrokeCountChain[];
+    parent?: CurveCollection;
+    private constructor();
+    /**
+     * construct array of arrays of `StrokeCountMap`s
+     * @param parent
+     */
+    static createForParityRegionOrChain(parent: CurveCollection, options?: StrokeOptions): StrokeCountSection;
+    /** test if all sections have the same structure. */
+    static areSectionsCompatible(sections: StrokeCountSection[], enforceCounts: boolean): boolean;
+    /** Within each section, sweep accumulate curveLength field, recording entry and exit sum in each map.
+     * * In expected use, (a0,a1) are (0,a) where a is the (previously computed) max length among corresponding maps up and down the section arrays.
+     */
+    static remapa0a1WithinEachChain(sections: StrokeCountSection[]): void;
+    private static applyMultipassVisitorCallbackNoComponents;
+    /**
+     * Walk through the sections, emitting callbacks delimiting groups of corresponding primitives.
+     * @param sections array of sections (possibly a single path or loop at each section, or possibly a set of parity loops.)
+     * @param callback object to be notified during the traversal
+     */
+    static runMultiPassVisitorAtCorrespondingPrimitives(sections: StrokeCountSection[], callback: StrokeCountMapMultipassVisitor): boolean;
+    /**
+     * * Confirm that all sections in the array have the same structure.
+     * * Within each corresponding set of entries, apply the max count to all.
+     * @param sections array of per-section stroke count entries
+     */
+    static enforceStrokeCountCompatibility(sections: StrokeCountSection[]): boolean;
+    /**
+     * * Confirm that all sections in the array have the same structure.
+     * * Within each corresponding set of entries up and down the sections, set curveLength as the maximum of the respective curve lengths.
+     * * Along each section, sum curveLengths (which were just reset) to get consistent along-chain parameters
+     * @param sections array of per-section stroke count entries
+     */
+    static enforceCompatibleDistanceSums(sections: StrokeCountSection[]): boolean;
+    /**
+     * Return stroked form of the section.
+     */
+    getStrokes(): AnyCurve;
+    /**
+     * Given two compatible stroke sets (as returned by getStrokes) extend a range
+     * with the distances between corresponding points.
+     * * Each set of strokes may be:
+     *   * linestring
+     *   * ParityRegion
+     *   * CurveChain (Loop or Path)
+     * @param strokeA first set of strokes
+     * @param strokeB second set of strokes
+     * @param rangeToExtend caller-allocated range to be extended.
+     * @returns true if structures are compatible.
+     */
+    static extendDistanceRangeBetweenStrokes(strokeA: AnyCurve, strokeB: AnyCurve, rangeToExtend: Range1d): boolean;
+}
+//# sourceMappingURL=StrokeCountChain.d.ts.map

package/lib/esm/curve/Query/StrokeCountChain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"StrokeCountChain.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/StrokeCountChain.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AACjE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG/C,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,8BAAsB,8BAA8B;IAClD;;;;;;OAMG;IACI,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,OAAO;IACnG;;;;OAIG;aACa,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;aAChC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IACjE;;;;OAIG;aAEa,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAC9C;;;OAGG;IACI,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,eAAe,CAAC,EAAE,MAAM,GAAG,OAAO;CAElG;AACD;;;;GAIG;AACH,qBAAa,kCAAmC,SAAQ,8BAA8B;IAC7E,KAAK,EAAE,cAAc,CAAC;;IAK7B,oDAAoD;IAC7C,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAWvC,kDAAkD;IAC3C,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IAcjD,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CACvC;AACD;;;;GAIG;AACH,qBAAa,wCAAyC,SAAQ,8BAA8B;IACnF,cAAc,EAAE,MAAM,CAAC;;IAK9B,oDAAoD;IAC7C,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAWvC,kDAAkD;IAC3C,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,cAAc,GAAG,OAAO;IAcjD,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CACvC;AACD;;;;;;GAMG;AACH,qBAAa,gBAAgB;IACpB,IAAI,EAAE,cAAc,EAAE,CAAC;IACvB,MAAM,CAAC,EAAE,eAAe,CAAC;IAChC;;;;OAIG;IACI,OAAO,CAAC,EAAE,aAAa,CAAC;IAE/B,OAAO;WAKO,mBAAmB,CAAC,KAAK,EAAE,UAAU,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,gBAAgB;IAWxF,UAAU,IAAI,YAAY;IAgBjC,wBAAwB;IACxB,OAAO,CAAC,MAAM,CAAC,8BAA8B;IAa7C;;;;;;;;;;;OAWG;IACI,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM;CAGxD;AAED;;;;;GAKG;AACH,qBAAa,kBAAkB;IACtB,MAAM,EAAE,gBAAgB,EAAE,CAAC;IAC3B,MAAM,CAAC,EAAE,eAAe,CAAC;IAChC,OAAO;IACP;;;OAGG;WACW,4BAA4B,CAAC,MAAM,EAAE,eAAe,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,kBAAkB;IAYhH,oDAAoD;WACtC,qBAAqB,CAAC,QAAQ,EAAE,kBAAkB,EAAE,EAAE,aAAa,EAAE,OAAO,GAAG,OAAO;IAuBpG;;OAEG;WACW,wBAAwB,CAAC,QAAQ,EAAE,kBAAkB,EAAE;IAQrE,OAAO,CAAC,MAAM,CAAC,yCAAyC;IAiCxD;;;;OAIG;WACW,4CAA4C,CAAC,QAAQ,EAAE,kBAAkB,EAAE,EAAE,QAAQ,EAAE,8BAA8B,GAAG,OAAO;IAoB7I;;;;OAIG;WACW,+BAA+B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,GAAG,OAAO;IAWtF;;;;;OAKG;WACW,6BAA6B,CAAC,QAAQ,EAAE,kBAAkB,EAAE,GAAG,OAAO;IAapF;;OAEG;IACI,UAAU,IAAI,QAAQ;IAa7B;;;;;;;;;;;OAWG;WACW,iCAAiC,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,OAAO,GAAG,OAAO;CA+CvH"}