nodes2ts 2.0.0 → 3.0.0

package/dist/S1ChordAngle.js

@@ -0,0 +1,318 @@
+"use strict";
+/*
+ * Copyright 2014 Google Inc.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.S1ChordAngle = void 0;
+/**
+ * S1ChordAngle represents the angle subtended by a chord (i.e., the straight 3D Cartesian line
+ * segment connecting two points on the unit sphere). Its representation makes it very efficient for
+ * computing and comparing distances, but unlike S1Angle it is only capable of representing angles
+ * between 0 and Pi radians. Generally, S1ChordAngle should only be used in loops where many angles
+ * need to be calculated and compared. Otherwise it is simpler to use S1Angle.
+ *
+ * <p>S1ChordAngle also loses some accuracy as the angle approaches Pi radians. Specifically, the
+ * representation of (Pi - x) radians can be expected to have an error of about (1e-15 / x), with a
+ * maximum error of about 1e-7.
+ */
+const S1Angle_1 = require("./S1Angle");
+const S2_1 = require("./S2");
+const preconditions_1 = require("./utils/preconditions");
+class S1ChordAngle {
+    /**
+     * S1ChordAngles are represented by the squared chord length, which can range from 0 to {@code
+     * MAX_LENGTH2}. {@link #INFINITY} uses an infinite squared length.
+     */
+    constructor(length2) {
+        this.length2 = length2;
+        (0, preconditions_1.checkArgument)(this.isValid());
+    }
+    /**
+     * Constructs the S1ChordAngle corresponding to the distance between the two given points. The
+     * points must be unit length.
+     */
+    static fromS2Point(x, y) {
+        (0, preconditions_1.checkArgument)(S2_1.S2.isUnitLength(x));
+        (0, preconditions_1.checkArgument)(S2_1.S2.isUnitLength(y));
+        // The distance may slightly exceed 4.0 due to roundoff errors.
+        const length2 = Math.min(S1ChordAngle.MAX_LENGTH2, x.getDistance2(y));
+        return new S1ChordAngle(length2);
+    }
+    /**
+     * Returns a new chord angle approximated from {@code angle} (see {@link
+     * #getS1AngleConstructorMaxError()} for the max magnitude of the error).
+     *
+     * <p>Angles outside the range [0, Pi] are handled as follows:
+     *
+     * <ul>
+     *   <li>{@link S1Angle#INFINITY} is mapped to {@link #INFINITY}
+     *   <li>negative angles are mapped to {@link #NEGATIVE}
+     *   <li>finite angles larger than Pi are mapped to {@link #STRAIGHT}
+     * </ul>
+     *
+     * <p>Note that this operation is relatively expensive and should be avoided. To use {@link
+     * S1ChordAngle} effectively, you should structure your code so that input arguments are converted
+     * to S1ChordAngles at the beginning of your algorithm, and results are converted back to {@link
+     * S1Angle}s only at the end.
+     */
+    static fromS1Angle(angle) {
+        if (angle.radians < 0) {
+            return S1ChordAngle.NEGATIVE;
+        }
+        else if (angle.equals(S1Angle_1.S1Angle.INFINITY)) {
+            return S1ChordAngle.INFINITY;
+        }
+        else {
+            // The chord length is 2 * sin(angle / 2).
+            const length = 2 * Math.sin(0.5 * Math.min(Math.PI, angle.radians));
+            return new S1ChordAngle(length * length);
+        }
+    }
+    /**
+     * Construct an S1ChordAngle from the squared chord length. Note that the argument is
+     * automatically clamped to a maximum of {@code MAX_LENGTH2} to handle possible roundoff errors.
+     * The argument must be non-negative.
+     */
+    static fromLength2(length2) {
+        return new S1ChordAngle(Math.min(S1ChordAngle.MAX_LENGTH2, length2));
+    }
+    /** Returns whether the chord distance is exactly 0. */
+    isZero() {
+        return this.length2 == 0;
+    }
+    /** Returns whether the chord distance is negative. */
+    isNegative() {
+        return this.length2 < 0;
+    }
+    /** Returns whether the chord distance is exactly (positive) infinity. */
+    isInfinity() {
+        return this.length2 == Number.POSITIVE_INFINITY;
+    }
+    /** Returns true if the angle is negative or infinity. */
+    isSpecial() {
+        return this.isNegative() || this.isInfinity();
+    }
+    /**
+     * Returns true if getLength2() is within the normal range of 0 to 4 (inclusive) or the angle is
+     * special.
+     */
+    isValid() {
+        return (this.length2 >= 0 && this.length2 <= S1ChordAngle.MAX_LENGTH2) || this.isNegative() || this.isInfinity();
+    }
+    /**
+     * Convert the chord angle to an {@link S1Angle}. {@link #INFINITY} is converted to {@link
+     * S1Angle#INFINITY}, and {@link #NEGATIVE} is converted to a negative {@link S1Angle}. This
+     * operation is relatively expensive.
+     */
+    toAngle() {
+        if (this.isNegative()) {
+            return S1Angle_1.S1Angle.radians(-1);
+        }
+        else if (this.isInfinity()) {
+            return S1Angle_1.S1Angle.INFINITY;
+        }
+        else {
+            return S1Angle_1.S1Angle.radians(2 * Math.asin(0.5 * Math.sqrt(this.length2)));
+        }
+    }
+    /** The squared length of the chord. (Most clients will not need this.) */
+    getLength2() {
+        return this.length2;
+    }
+    /**
+     * Returns the smallest representable S1ChordAngle larger than this object. This can be used to
+     * convert a "<" comparison to a "<=" comparison.
+     *
+     * <p>Note the following special cases:
+     *
+     * <ul>
+     *   <li>NEGATIVE.successor() == ZERO
+     *   <li>STRAIGHT.successor() == INFINITY
+     *   <li>INFINITY.Successor() == INFINITY
+     * </ul>
+     */
+    //   public successor(): S1ChordAngle {
+    //     if (this.length2 >= S1ChordAngle.MAX_LENGTH2) {
+    //       return S1ChordAngle.INFINITY;
+    //     }
+    //     if (this.length2 < 0.0) {
+    //       return S1ChordAngle.ZERO;
+    //     }
+    //     return new S1ChordAngle(Platform.nextAfter(this.length2, 10.0));
+    //   }
+    /**
+     * As {@link #successor}, but returns the largest representable S1ChordAngle less than this
+     * object.
+     *
+     * <p>Note the following special cases:
+     *
+     * <ul>
+     *   <li>INFINITY.predecessor() == STRAIGHT
+     *   <li>ZERO.predecessor() == NEGATIVE
+     *   <li>NEGATIVE.predecessor() == NEGATIVE
+     * </ul>
+     */
+    //   public predecessor(): S1ChordAngle {
+    //     if (this.length2 <= 0.0) {
+    //       return S1ChordAngle.NEGATIVE;
+    //     }
+    //     if (this.length2 > S1ChordAngle.MAX_LENGTH2) {
+    //       return S1ChordAngle.STRAIGHT;
+    //     }
+    //     return new S1ChordAngle(Platform.nextAfter(this.length2, -10.0));
+    //   }
+    /**
+     * Returns a new S1ChordAngle whose chord distance represents the sum of the angular distances
+     * represented by the 'a' and 'b' chord angles.
+     *
+     * <p>Note that this method is much more efficient than converting the chord angles to S1Angles
+     * and adding those. It requires only one square root plus a few additions and multiplications.
+     */
+    static add(a, b) {
+        (0, preconditions_1.checkArgument)(!a.isSpecial());
+        (0, preconditions_1.checkArgument)(!b.isSpecial());
+        // Optimization for the common case where "b" is an error tolerance parameter that happens to be
+        // set to zero.
+        const a2 = a.length2;
+        const b2 = b.length2;
+        if (b2 == 0) {
+            return a;
+        }
+        // Clamp the angle sum to at most 180 degrees.
+        if (a2 + b2 >= S1ChordAngle.MAX_LENGTH2) {
+            return S1ChordAngle.STRAIGHT;
+        }
+        // Let "a" and "b" be the (non-squared) chord lengths, and let c = a+b.
+        // Let A, B, and C be the corresponding half-angles (a = 2*sin(A), etc).
+        // Then the formula below can be derived from c = 2 * sin(A+B) and the relationships
+        //   sin(A+B) = sin(A)*cos(B) + sin(B)*cos(A)
+        //   cos(X) = sqrt(1 - sin^2(X)) .
+        const x = a2 * (1 - 0.25 * b2); // isValid() => non-negative
+        const y = b2 * (1 - 0.25 * a2); // isValid() => non-negative
+        return new S1ChordAngle(Math.min(S1ChordAngle.MAX_LENGTH2, x + y + 2 * Math.sqrt(x * y)));
+    }
+    /**
+     * Subtract one S1ChordAngle from another.
+     *
+     * <p>Note that this method is much more efficient than converting the chord angles to S1Angles
+     * and adding those. It requires only one square root plus a few additions and multiplications.
+     */
+    static sub(a, b) {
+        // See comments in add(S1ChordAngle, S1ChordAngle).
+        (0, preconditions_1.checkArgument)(!a.isSpecial());
+        (0, preconditions_1.checkArgument)(!b.isSpecial());
+        const a2 = a.length2;
+        const b2 = b.length2;
+        if (b2 == 0) {
+            return a;
+        }
+        if (a2 <= b2) {
+            return S1ChordAngle.ZERO;
+        }
+        const x = a2 * (1 - 0.25 * b2);
+        const y = b2 * (1 - 0.25 * a2);
+        return new S1ChordAngle(Math.max(0.0, x + y - 2 * Math.sqrt(x * y)));
+    }
+    /** Returns the smaller of the given instances. */
+    static min(a, b) {
+        return a.length2 <= b.length2 ? a : b;
+    }
+    /** Returns the larger of the given instances. */
+    static max(a, b) {
+        return a.length2 > b.length2 ? a : b;
+    }
+    /** Returns the square of Math.sin(toAngle().radians()), but computed more efficiently. */
+    static sin2(a) {
+        (0, preconditions_1.checkArgument)(!a.isSpecial());
+        // Let "a" be the (non-squared) chord length, and let A be the corresponding half-angle
+        // (a = 2*sin(A)). The formula below can be derived from:
+        //   sin(2*A) = 2 * sin(A) * cos(A)
+        //   cos^2(A) = 1 - sin^2(A)
+        // This is much faster than converting to an angle and computing its sine.
+        return a.length2 * (1 - 0.25 * a.length2);
+    }
+    /** Returns Math.sin(toAngle().radians()), but computed more efficiently. */
+    static sin(a) {
+        return Math.sqrt(this.sin2(a));
+    }
+    /** Returns Math.cos(toAngle().radians()), but computed more efficiently. */
+    static cos(a) {
+        // cos(2*A) = cos^2(A) - sin^2(A) = 1 - 2*sin^2(A)
+        (0, preconditions_1.checkArgument)(!a.isSpecial());
+        return 1 - 0.5 * a.length2;
+    }
+    /** Returns Math.tan(toAngle().radians()), but computed more efficiently. */
+    static tan(a) {
+        return this.sin(a) / this.cos(a);
+    }
+    /**
+     * Returns a new S1ChordAngle that has been adjusted by the given error bound (which can be
+     * positive or negative). {@code error} should be the value returned by one of the error bound
+     * methods below. For example:
+     *
+     * <pre>
+     *    {@code S1ChordAngle a = new S1ChordAngle(x, y);}
+     *    {@code S1ChordAngle a1 = a.plusError(a.getS2PointConstructorMaxError());}
+     * </pre>
+     *
+     * <p>If this {@link #isSpecial}, we return {@code this}.
+     */
+    plusError(error) {
+        return this.isSpecial() ? this : S1ChordAngle.fromLength2(Math.max(0.0, Math.min(S1ChordAngle.MAX_LENGTH2, this.length2 + error)));
+    }
+    /** Returns the error in {@link #fromS1Angle}. */
+    getS1AngleConstructorMaxError() {
+        return S2_1.S2.DBL_EPSILON * this.length2;
+    }
+    /**
+     * There is a relative error of {@code 2.5 * DBL_EPSILON} when computing the squared distance,
+     * plus a relative error of {@code 2 * DBL_EPSILON} and an absolute error of {@code 16 *
+     * DBL_EPSILON^2} because the lengths of the input points may differ from 1 by up to {@code 2 *
+     * DBL_EPSILON} each. (This is the maximum length error in {@link S2Point#normalize}).
+     */
+    getS2PointConstructorMaxError() {
+        return (4.5 * S2_1.S2.DBL_EPSILON * this.length2) + (16 * S2_1.S2.DBL_EPSILON * S2_1.S2.DBL_EPSILON);
+    }
+    /** Returns the string of the closest {@link S1Angle} to this chord distance. */
+    toString() {
+        return this.toAngle().toString();
+    }
+    compareTo(that) {
+        return this.length2 - that.length2;
+    }
+    equals(that) {
+        return this.compareTo(that) === 0;
+    }
+}
+exports.S1ChordAngle = S1ChordAngle;
+/** Max value that can be returned from {@link #getLength2()}. */
+S1ChordAngle.MAX_LENGTH2 = 4.0;
+/** The zero chord angle. */
+S1ChordAngle.ZERO = new S1ChordAngle(0);
+/** The chord angle of 90 degrees (a "right angle"). */
+S1ChordAngle.RIGHT = new S1ChordAngle(2);
+/** The chord angle of 180 degrees (a "straight angle"). This is the max finite chord angle. */
+S1ChordAngle.STRAIGHT = new S1ChordAngle(S1ChordAngle.MAX_LENGTH2);
+/**
+ * A chord angle larger than any finite chord angle. The only valid operations on {@code INFINITY}
+ * are comparisons and {@link S1Angle} conversions.
+ */
+S1ChordAngle.INFINITY = new S1ChordAngle(Number.POSITIVE_INFINITY);
+/**
+ * A chord angle smaller than {@link #ZERO}. The only valid operations on {@code NEGATIVE} are
+ * comparisons and {@link S1Angle} conversions.
+ */
+S1ChordAngle.NEGATIVE = new S1ChordAngle(-1);
+//# sourceMappingURL=S1ChordAngle.js.map

package/dist/S1ChordAngle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"S1ChordAngle.js","sourceRoot":"","sources":["../src/S1ChordAngle.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;AAGH;;;;;;;;;;GAUG;AAEH,uCAAoC;AACpC,6BAA0B;AAE1B,yDAAsD;AAEtD,MAAa,YAAY;IA4BvB;;;OAGG;IACH,YAAmB,OAAe;QAChC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAA,6BAAa,EAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,WAAW,CAAC,CAAU,EAAE,CAAU;QAC9C,IAAA,6BAAa,EAAC,OAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,IAAA,6BAAa,EAAC,OAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,+DAA+D;QAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,OAAO,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACI,MAAM,CAAC,WAAW,CAAC,KAAc;QACtC,IAAI,KAAK,CAAC,OAAO,GAAG,CAAC,EAAE;YACrB,OAAO,YAAY,CAAC,QAAQ,CAAC;SAC9B;aAAM,IAAI,KAAK,CAAC,MAAM,CAAC,iBAAO,CAAC,QAAQ,CAAC,EAAE;YACzC,OAAO,YAAY,CAAC,QAAQ,CAAC;SAC9B;aAAM;YACL,0CAA0C;YAC1C,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YACpE,OAAO,IAAI,YAAY,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;SAC1C;IACH,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,WAAW,CAAC,OAAe;QACvC,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,uDAAuD;IAChD,MAAM;QACX,OAAO,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED,sDAAsD;IAC/C,UAAU;QACf,OAAO,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,yEAAyE;IAClE,UAAU;QACf,OAAO,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC,iBAAiB,CAAC;IAClD,CAAC;IAED,yDAAyD;IAClD,SAAS;QACd,OAAO,IAAI,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;IAChD,CAAC;IAED;;;OAGG;IACI,OAAO;QACZ,OAAO,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,IAAI,YAAY,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;IACnH,CAAC;IAED;;;;OAIG;IACI,OAAO;QACZ,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACrB,OAAO,iBAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;aAAM,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YAC5B,OAAO,iBAAO,CAAC,QAAQ,CAAC;SACzB;aAAM;YACL,OAAO,iBAAO,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SACtE;IACH,CAAC;IAED,0EAA0E;IACnE,UAAU;QACf,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;;;;;;;;;;;OAWG;IACL,uCAAuC;IACvC,sDAAsD;IACtD,sCAAsC;IACtC,QAAQ;IACR,gCAAgC;IAChC,kCAAkC;IAClC,QAAQ;IACR,uEAAuE;IACvE,MAAM;IAEJ;;;;;;;;;;;OAWG;IACL,yCAAyC;IACzC,iCAAiC;IACjC,sCAAsC;IACtC,QAAQ;IACR,qDAAqD;IACrD,sCAAsC;IACtC,QAAQ;IACR,wEAAwE;IACxE,MAAM;IAEJ;;;;;;OAMG;IACI,MAAM,CAAC,GAAG,CAAC,CAAe,EAAE,CAAe;QAChD,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9B,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QAE9B,gGAAgG;QAChG,eAAe;QACf,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC;QACrB,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC;QACrB,IAAI,EAAE,IAAI,CAAC,EAAE;YACX,OAAO,CAAC,CAAC;SACV;QAED,8CAA8C;QAC9C,IAAI,EAAE,GAAG,EAAE,IAAI,YAAY,CAAC,WAAW,EAAE;YACvC,OAAO,YAAY,CAAC,QAAQ,CAAC;SAC9B;QAED,uEAAuE;QACvE,wEAAwE;QACxE,oFAAoF;QACpF,6CAA6C;QAC7C,kCAAkC;QAClC,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,4BAA4B;QAC5D,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,4BAA4B;QAC5D,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5F,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,GAAG,CAAC,CAAe,EAAE,CAAe;QAChD,mDAAmD;QACnD,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9B,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC;QACrB,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC;QACrB,IAAI,EAAE,IAAI,CAAC,EAAE;YACX,OAAO,CAAC,CAAC;SACV;QACD,IAAI,EAAE,IAAI,EAAE,EAAE;YACZ,OAAO,YAAY,CAAC,IAAI,CAAC;SAC1B;QACD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC;QAC/B,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,kDAAkD;IAC3C,MAAM,CAAC,GAAG,CAAC,CAAe,EAAE,CAAe;QAChD,OAAO,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,iDAAiD;IAC1C,MAAM,CAAC,GAAG,CAAC,CAAe,EAAE,CAAe;QAChD,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,0FAA0F;IACnF,MAAM,CAAC,IAAI,CAAC,CAAe;QAChC,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9B,uFAAuF;QACvF,yDAAyD;QACzD,mCAAmC;QACnC,4BAA4B;QAC5B,0EAA0E;QAC1E,OAAO,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC;IAED,4EAA4E;IACrE,MAAM,CAAC,GAAG,CAAC,CAAe;QAC/B,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,4EAA4E;IACrE,MAAM,CAAC,GAAG,CAAC,CAAe;QAC/B,kDAAkD;QAClD,IAAA,6BAAa,EAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC;QAC9B,OAAO,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC;IAC7B,CAAC;IAED,4EAA4E;IACrE,MAAM,CAAC,GAAG,CAAC,CAAe;QAC/B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC;IAED;;;;;;;;;;;OAWG;IACI,SAAS,CAAC,KAAa;QAC5B,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,WAAW,EAAE,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACrI,CAAC;IAED,iDAAiD;IAC1C,6BAA6B;QAClC,OAAO,OAAE,CAAC,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC;IACvC,CAAC;IAED;;;;;OAKG;IACI,6BAA6B;QAClC,OAAO,CAAC,GAAG,GAAG,OAAE,CAAC,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,GAAG,OAAE,CAAC,WAAW,GAAG,OAAE,CAAC,WAAW,CAAC,CAAC;IACxF,CAAC;IAED,gFAAgF;IAEzE,QAAQ;QACb,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC;IACnC,CAAC;IAEM,SAAS,CAAC,IAAkB;QACjC,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;IACpC,CAAC;IAEM,MAAM,CAAC,IAAkB;QAC9B,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;;AA7TH,oCA8TC;AA5TC,iEAAiE;AACnD,wBAAW,GAAG,GAAG,CAAC;AAEhC,4BAA4B;AACd,iBAAI,GAAiB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;AAEvD,uDAAuD;AACzC,kBAAK,GAAiB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC;AAExD,+FAA+F;AACjF,qBAAQ,GAAiB,IAAI,YAAY,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;AAElF;;;GAGG;AACW,qBAAQ,GAAiB,IAAI,YAAY,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC;AAElF;;;GAGG;AACW,qBAAQ,GAAiB,IAAI,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC"}