@itwin/core-geometry 4.1.0-dev.7 → 4.1.0-dev.70

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

@@ -11,11 +11,15 @@ exports.GapSearchContext = void 0;
 const CurveCollection_1 = require("../CurveCollection");
 const CurveProcessor_1 = require("../CurveProcessor");
 // import { SumLengthsContext, GapSearchContext, CountLinearPartsSearchContext, CloneCurvesContext, TransformInPlaceContext } from "./CurveSearches";
-/** Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
+/**
+ * Algorithmic class: Accumulate maximum gap between adjacent primitives of CurveChain.
  * @internal
  */
 class GapSearchContext extends CurveProcessor_1.RecursiveCurveProcessorWithStack {
-    constructor() { super(); this.maxGap = 0.0; }
+    constructor() {
+        super();
+        this.maxGap = 0.0;
+    }
     static maxGap(target) {
         const context = new GapSearchContext();
         target.announceToCurveProcessor(context);

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

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

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

@@ -1,114 +1,103 @@
-import { AnyCurve } from "../../curve/CurveChain";
-import { CurvePrimitive } from "../../curve/CurvePrimitive";
-import { GeometryQuery } from "../../curve/GeometryQuery";
-import { LineString3d } from "../../curve/LineString3d";
-import { ChainTypes } from "../../curve/RegionOps";
-import { Range3d } from "../../geometry3d/Range";
-import { XYAndZ } from "../../geometry3d/XYZProps";
+import { AnyCurve } from "../CurveChain";
+import { CurvePrimitive } from "../CurvePrimitive";
+import { LineString3d } from "../LineString3d";
+import { ChainTypes } from "../RegionOps";
+import { StrokeOptions } from "../StrokeOptions";
 /**
  * Manage a growing array of arrays of curve primitives that are to be joined "head to tail" in paths.
  * * The caller makes a sequence of calls to announce individual primitives.
- * * This collector (unlike the simpler "ChainCollector") expects to have inputs arriving in random order, leaving multiple open chains in play at any time.
- *    * chainCollector.announceCurvePrimitive (curve, searchAllPaths).
- * * When all curves have been announced, the call to grab the paths option restructures the various active chains into Path and Loop objects.
+ * * This collector (unlike the simpler [[ChainCollectorContext]]) expects to have inputs arriving in random order, leaving multiple open chains in play at any time.
+ * * When all curves have been announced, the call to `grabResults` restructures the various active chains into Paths (and optionally, Loops).
+ * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.
  * * Usage pattern is
- *   * initialization: `context = new ChainCollectorContext (makeClones: boolean)`
- *   * many times
- *       * `   context.captureCurve (anyCurve, searchAllPaths)`
- *       * `   context.captureCurvePrimitive (primitive, searchAllPaths)`
- *   * end:        ` result = context.grabResult (formLoopsIfClosed)`
+ *   * initialization: `context = new MultiChainCollector(gapTol, planeTol)`
+ *   * many times:
+ *       * `context.captureCurve(anyCurve)`
+ *       * `context.captureCurvePrimitive(primitive)`
+ *   * end: `result = context.grabResult(makeLoopIfClosed)`
  * @internal
  */
 export declare class MultiChainCollector {
+    /** accumulated chains */
     private _chains;
+    /** largest gap distance to close */
+    private _gapTolerance;
+    /** end point snap tolerance (assumed to be as tight or tighter than gapTolerance) */
+    private _snapTolerance;
+    /** tolerance for choosing Path or Loop. If undefined, always Path. */
+    private _planeTolerance;
     private static _staticPointA;
     private static _staticPointB;
-    /** LOOSE tolerance for snap to end */
-    private _endPointShiftTolerance;
-    /** TIGHT tolerance for snap to end */
-    private _endPointHitTolerance;
-    /** tolerance for choosing Path or Loop.   If undefined, ALWAYS PATH */
-    private _planarityTolerance;
+    private _xyzWork0?;
+    private _xyzWork1?;
     /** Initialize with an empty array of chains.
-     * @param endPointShiftTolerance tolerance for calling endpoints identical
-     * @param planeTolerance tolerance for considering a loop to be planar.  If undefined, only create Path.  If defined, create Loop curves are if within tolerance of a plane.
+     * @param gapTolerance tolerance for calling endpoints identical
+     * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.
      */
-    constructor(endPointShiftTolerance?: number, planeTolerance?: number | undefined);
-    private _xyzWork0?;
+    constructor(gapTolerance?: number, planeTolerance?: number | undefined);
     /**
      * Find a chain (with index _other than_ exceptChainIndex) that starts or ends at xyz
-     * @param xyz
-     * @param tolerance
-     * @param exceptChainIndex index of chain to ignore.  Send -1 to consider all chains.
+     * @param xyz endpoint to check
+     * @param tolerance absolute distance tolerance for equating endpoints
+     * @param exceptChainIndex index of chain to ignore. Send -1 to consider all chains.
      */
     private findAnyChainToConnect;
-    private _xyzWork1?;
     /**
      * Insert a single curve primitive into the active chains.
      * * The primitive is captured (not cloned)
      * * The primitive may be reversed in place
-     * @param candidate
+     * @param candidate curve to add to the context
      */
     captureCurvePrimitive(candidate: CurvePrimitive): void;
     /**
      * Insert any curve into the collection.
      * * This recurses into Path, Loop, BagOfCurves etc
-     * * The all primitives are captured, and may be reversed in place.
-     * @param candidate
+     * * All primitives are captured, and may be reversed in place.
+     * @param candidate curve to add to the context
      */
-    captureCurve(candidate: GeometryQuery): void;
+    captureCurve(candidate: AnyCurve): void;
+    /** If allowed by the geometry type, move an endpoint. */
+    private static simpleEndPointMove;
+    /**
+     * Try to move the end of curve0 and/or the start of curve1 to a common point.
+     * * All z-coordinates are ignored.
+     * @param curve0 first curve, assumed to end close to the start of curve1
+     * @param curve1 second curve, assumed to start close to the end of curve0
+     * @param gapTolerance max distance to move a curve start/end point
+     * @returns whether curve start/end point(s) moved
+     */
+    private static moveHeadOrTail;
     /** Announce a curve primitive
      * * If a "nearby" connection is possible, insert the candidate in the chain and force endpoint match.
      * * Otherwise start a new chain.
      */
     private attachPrimitiveToAnyChain;
     /**
-     * * Move each primitive from chainB to the end of  chainA.
-     * * clear chainB.
-     * * move the final chain to chainB index.
-     * * reduce the _chain.length by 1.
+     * Merge two entries in the chain array.
+     * * Move each primitive from chainB to the end of chainA.
+     * * Clear chainB.
+     * * Move the final chain to chainB index.
+     * * Decrement the array length.
+     * @param chainIndexA index of chainA
+     * @param chainIndexB index of chainB
      */
     private mergeChainsForwardForward;
+    /** Reverse the curve chain in place. */
     private reverseChain;
+    /** See if the head or tail of chainIndex matches any existing chain. If so, merge the two chains. */
     private searchAndMergeChainIndex;
-    /** turn an array of curve primitives into the simplest possible strongly typed curve structure.
-     * * The input array is assumed to be connected appropriately to act as the curves of a Path.
-     * * When a path is created the curves array is CAPTURED.
+    /**
+     * Convert an array of curve primitives into the simplest possible strongly typed curve structure.
+     * @param curves input array, assembled correctly into a single contiguous path, captured by returned object
+     * @param makeLoopIfClosed whether to return a Loop from physically closed curves array, otherwise Path
+     * @return Loop or Path if multiple curves; the primitive if only one curve; undefined if no curves
      */
     private promoteArrayToCurves;
+    /** Stroke the curve chain to a line string, de-duplicate the points. */
     private chainToLineString3d;
     /** Return the collected results, structured as the simplest possible type. */
     grabResult(makeLoopIfClosed?: boolean): ChainTypes;
     /** Return chains as individual calls to announceChain. */
-    announceChainsAsLineString3d(announceChain: (ls: LineString3d) => void): void;
-}
-export declare class OffsetHelpers {
-    static sumLengths(data: any): number;
-    static extendRange(range: Range3d, data: any): Range3d;
-    static appendOffsets(data: AnyCurve | AnyCurve[] | undefined, offset: number, result: AnyCurve[]): number;
-    /**
-     * * Restructure curve fragments as chains and offsets
-     * * Return object with named chains, insideOffsets, outsideOffsets
-     * * BEWARE that if the input is not a loop the classification of outputs is suspect.
-     * @param fragments fragments to be chained
-     * @param offsetDistance offset distance.
-     */
-    static collectInsideAndOutsideOffsets(fragments: AnyCurve[], offsetDistance: number, gapTolerance: number): {
-        insideOffsets: AnyCurve[];
-        outsideOffsets: AnyCurve[];
-        chains: ChainTypes;
-    };
-    /**
-     * * Restructure curve fragments as chains and offsets
-     * * BEWARE that if the input is not a loop the classification of outputs is suspect.
-     * @param fragments fragments to be chained
-     * @param gapTolerance distance to be treated as "effectively zero" when joining head-to-tail.
-     */
-    static collectChains(fragments: AnyCurve[], gapTolerance: number, planarTolerance?: number): ChainTypes;
-    /** If allowed by the geometry type, move an endpoint.
-     *
-     */
-    static simpleEndPointMove(g: CurvePrimitive, atEnd: boolean, to: XYAndZ): boolean;
-    static moveHeadOrTail(g0: CurvePrimitive, g1: CurvePrimitive, maxShift: number): boolean;
+    announceChainsAsLineString3d(announceChain: (ls: LineString3d) => void, options?: StrokeOptions): void;
 }
 //# sourceMappingURL=MultiChainCollector.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"MultiChainCollector.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":"AASA,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAE1D,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAGxD,OAAO,EAAE,UAAU,EAAa,MAAM,uBAAuB,CAAC;AAK9D,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,MAAM,EAAE,MAAM,2BAA2B,CAAC;AAGnD;;;;;;;;;;;;;GAaG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,OAAO,CAAqB;IAEpC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IAEtC,sCAAsC;IACtC,OAAO,CAAC,uBAAuB,CAAS;IACxC,sCAAsC;IACtC,OAAO,CAAC,qBAAqB,CAAS;IACtC,uEAAuE;IACvE,OAAO,CAAC,mBAAmB,CAAqB;IAChD;;;OAGG;gBACgB,sBAAsB,SAA+B,EAAE,cAAc,GAAE,MAAM,GAAG,SAAwC;IAO3I,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAgB7B,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B;;;;;OAKG;IACI,qBAAqB,CAAC,SAAS,EAAE,cAAc;IAOtD;;;;;OAKG;IACI,YAAY,CAAC,SAAS,EAAE,aAAa;IAU5C;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IA4CjC;;;;;OAKG;IACH,OAAO,CAAC,yBAAyB;IAgBjC,OAAO,CAAC,YAAY;IAOpB,OAAO,CAAC,wBAAwB;IAuBhC;;;OAGG;IACH,OAAO,CAAC,oBAAoB;IAiC5B,OAAO,CAAC,mBAAmB;IAW3B,8EAA8E;IACvE,UAAU,CAAC,gBAAgB,GAAE,OAAe,GAAG,UAAU;IAalE,0DAA0D;IACnD,4BAA4B,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,YAAY,KAAK,IAAI,GAAG,IAAI;CAcnF;AAED,qBAAa,aAAa;WAEV,UAAU,CAAC,IAAI,EAAE,GAAG,GAAG,MAAM;WAa7B,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,GAAG,OAAO;WAa/C,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM;IAwBhH;;;;;;OAMG;WACW,8BAA8B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,EAAE,UAAU,CAAA;KAAE;IAgBhM;;;;;OAKG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,EAAE,MAAM,EAAE,eAAe,GAAE,MAAqC,GAAG,UAAU;IAQ5I;;OAEG;WACW,kBAAkB,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;WAgB1E,cAAc,CAAC,EAAE,EAAE,cAAc,EAAE,EAAE,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;CA8BhG"}
+{"version":3,"file":"MultiChainCollector.d.ts","sourceRoot":"","sources":["../../../../src/curve/internalContexts/MultiChainCollector.ts"],"names":[],"mappings":"AAcA,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAGzC,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAEnD,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAG/C,OAAO,EAAE,UAAU,EAAa,MAAM,cAAc,CAAC;AACrD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD;;;;;;;;;;;;;GAaG;AACH,qBAAa,mBAAmB;IAC9B,yBAAyB;IACzB,OAAO,CAAC,OAAO,CAAqB;IACpC,oCAAoC;IACpC,OAAO,CAAC,aAAa,CAAS;IAC9B,qFAAqF;IACrF,OAAO,CAAC,cAAc,CAAS;IAC/B,sEAAsE;IACtE,OAAO,CAAC,eAAe,CAAqB;IAE5C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAU;IACtC,OAAO,CAAC,SAAS,CAAC,CAAU;IAC5B,OAAO,CAAC,SAAS,CAAC,CAAU;IAE5B;;;OAGG;gBACgB,YAAY,SAA+B,EAAE,cAAc,GAAE,MAAM,GAAG,SAAwC;IAMjI;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAc7B;;;;;OAKG;IACI,qBAAqB,CAAC,SAAS,EAAE,cAAc;IAStD;;;;;OAKG;IACI,YAAY,CAAC,SAAS,EAAE,QAAQ;IASvC,yDAAyD;IACzD,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAejC;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAiC7B;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IA4CjC;;;;;;;;OAQG;IACH,OAAO,CAAC,yBAAyB;IAYjC,wCAAwC;IACxC,OAAO,CAAC,YAAY;IAMpB,qGAAqG;IACrG,OAAO,CAAC,wBAAwB;IAuBhC;;;;;OAKG;IACH,OAAO,CAAC,oBAAoB;IA+B5B,wEAAwE;IACxE,OAAO,CAAC,mBAAmB;IAS3B,8EAA8E;IACvE,UAAU,CAAC,gBAAgB,GAAE,OAAe,GAAG,UAAU;IAahE,0DAA0D;IACnD,4BAA4B,CAAC,aAAa,EAAE,CAAC,EAAE,EAAE,YAAY,KAAK,IAAI,EAAE,OAAO,CAAC,EAAE,aAAa,GAAG,IAAI;CAc9G"}