nodes2ts 3.0.0 → 4.0.1

package/dist/S2LatLngRect.js

@@ -1,624 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.S2LatLngRect = void 0;
-const S1Interval_1 = require("./S1Interval");
-const R1Interval_1 = require("./R1Interval");
-const S2LatLng_1 = require("./S2LatLng");
-const S2_1 = require("./S2");
-const S2Point_1 = require("./S2Point");
-const S1Angle_1 = require("./S1Angle");
-const S2EdgeUtil_1 = require("./S2EdgeUtil");
-const S2Cap_1 = require("./S2Cap");
-const Platform_1 = require("./Platform");
-class S2LatLngRect {
-    constructor(lat, lng) {
-        this.lat = lat;
-        this.lng = lng;
-    }
-    static fromLatLng(lo, hi) {
-        return new S2LatLngRect(new R1Interval_1.R1Interval(lo.latRadians, hi.latRadians), new S1Interval_1.S1Interval(lo.lngRadians, hi.lngRadians));
-    }
-    /** The canonical empty rectangle */
-    static empty() {
-        return new S2LatLngRect(R1Interval_1.R1Interval.empty(), S1Interval_1.S1Interval.empty());
-    }
-    /** The canonical full rectangle. */
-    static full() {
-        return new S2LatLngRect(S2LatLngRect.fullLat(), S1Interval_1.S1Interval.full());
-    }
-    /** The full allowable range of latitudes. */
-    static fullLat() {
-        return new R1Interval_1.R1Interval(-S2_1.S2.M_PI_2, S2_1.S2.M_PI_2);
-    }
-    /**
-     * Construct a rectangle from a center point (in lat-lng space) and size in
-     * each dimension. If size.lng is greater than 360 degrees it is clamped,
-     * and latitudes greater than +/- 90 degrees are also clamped. So for example,
-     * FromCenterSize((80,170),(20,20)) -> (lo=(60,150),hi=(90,-170)).
-     */
-    static fromCenterSize(center, size) {
-        return S2LatLngRect.fromPoint(center).expanded(size.mul(0.5));
-    }
-    /** Convenience method to construct a rectangle containing a single point. */
-    static fromPoint(p) {
-        // assert (p.isValid());
-        return S2LatLngRect.fromLatLng(p, p);
-    }
-    /**
-     * Convenience method to construct the minimal bounding rectangle containing
-     * the two given points. This is equivalent to starting with an empty
-     * rectangle and calling AddPoint() twice. Note that it is different than the
-     * S2LatLngRect(lo, hi) constructor, where the first point is always used as
-     * the lower-left corner of the resulting rectangle.
-     */
-    static fromPointPair(p1, p2) {
-        // assert (p1.isValid() && p2.isValid());
-        return new S2LatLngRect(R1Interval_1.R1Interval.fromPointPair(p1.latRadians, p2
-            .latRadians), S1Interval_1.S1Interval.fromPointPair(p1.lngRadians, p2.lngRadians));
-    }
-    /**
-     * Return a latitude-longitude rectangle that contains the edge from "a" to
-     * "b". Both points must be unit-length. Note that the bounding rectangle of
-     * an edge can be larger than the bounding rectangle of its endpoints.
-     */
-    static fromEdge(a, b) {
-        // assert (S2.isUnitLength(a) && S2.isUnitLength(b));
-        const r = S2LatLngRect.fromPointPair(S2LatLng_1.S2LatLng.fromPoint(a), S2LatLng_1.S2LatLng.fromPoint(b));
-        // Check whether the min/max latitude occurs in the edge interior.
-        // We find the normal to the plane containing AB, and then a vector "dir" in
-        // this plane that also passes through the equator. We use RobustCrossProd
-        // to ensure that the edge normal is accurate even when the two points are
-        // very close together.
-        const ab = S2_1.S2.robustCrossProd(a, b);
-        const dir = S2Point_1.S2Point.crossProd(ab, new S2Point_1.S2Point(0, 0, 1));
-        const da = dir.dotProd(a);
-        const db = dir.dotProd(b);
-        if (da * db >= 0) {
-            // Minimum and maximum latitude are attained at the vertices.
-            return r;
-        }
-        // Minimum/maximum latitude occurs in the edge interior. This affects the
-        // latitude bounds but not the longitude bounds.
-        const absLat = Math.acos(ab.z / Math.abs(ab.norm()));
-        if (da < 0) {
-            return new S2LatLngRect(new R1Interval_1.R1Interval(r.lat.lo, absLat), r.lng);
-        }
-        else {
-            return new S2LatLngRect(new R1Interval_1.R1Interval(-absLat, r.lat.hi), r.lng);
-        }
-    }
-    /**
-     * Return true if the rectangle is valid, which essentially just means that
-     * the latitude bounds do not exceed Pi/2 in absolute value and the longitude
-     * bounds do not exceed Pi in absolute value.
-     *
-     */
-    isValid() {
-        // The lat/lng ranges must either be both empty or both non-empty.
-        return (Math.abs(this.lat.lo) <= S2_1.S2.M_PI_2 && Math.abs(this.lat.hi) <= (S2_1.S2.M_PI_2)
-            && this.lng.isValid() && this.lat.isEmpty() == this.lng.isEmpty());
-    }
-    lo() {
-        return new S2LatLng_1.S2LatLng(this.lat.lo, this.lng.lo);
-    }
-    hi() {
-        return new S2LatLng_1.S2LatLng(this.lat.hi, this.lng.hi);
-    }
-    latLo() {
-        return S1Angle_1.S1Angle.radians(this.lat.lo);
-    }
-    latHi() {
-        return S1Angle_1.S1Angle.radians(this.lat.hi);
-    }
-    lngLo() {
-        return S1Angle_1.S1Angle.radians(this.lng.lo);
-    }
-    lngHi() {
-        return S1Angle_1.S1Angle.radians(this.lng.hi);
-    }
-    /**
-     * Return true if the rectangle is empty, i.e. it contains no points at all.
-     */
-    isEmpty() {
-        return this.lat.isEmpty();
-    }
-    // Return true if the rectangle is full, i.e. it contains all points.
-    isFull() {
-        // console.log(this.lat.toString());
-        // console.log(S2LatLngRect.fullLat().toString());
-        return this.lat.equals(S2LatLngRect.fullLat()) && this.lng.isFull();
-    }
-    /**
-     * Return true if lng_.lo() > lng_.hi(), i.e. the rectangle crosses the 180
-     * degree latitude line.
-     */
-    isInverted() {
-        return this.lng.isInverted();
-    }
-    /** Return the k-th vertex of the rectangle (k = 0,1,2,3) in CCW order. */
-    getVertex(k) {
-        // Return the points in CCW order (SW, SE, NE, NW).
-        switch (k) {
-            case 0:
-                return this.lo();
-            case 1:
-                return new S2LatLng_1.S2LatLng(this.lat.lo, this.lng.hi);
-            case 2:
-                return this.hi();
-            case 3:
-                return new S2LatLng_1.S2LatLng(this.lat.hi, this.lng.lo);
-            default:
-                throw new Error("Invalid vertex index.");
-        }
-    }
-    /**
-     * Return the center of the rectangle in latitude-longitude space (in general
-     * this is not the center of the region on the sphere).
-     */
-    getCenter() {
-        return new S2LatLng_1.S2LatLng(this.lat.getCenter(), this.lng.getCenter());
-    }
-    /**
-     * Return the minimum distance (measured along the surface of the sphere)
-     * from a given point to the rectangle (both its boundary and its interior).
-     * The latLng must be valid.
-     */
-    getDistanceLL(p) {
-        // The algorithm here is the same as in getDistance(S2LagLngRect), only
-        // with simplified calculations.
-        if (this.isEmpty()) {
-            throw new Error();
-        }
-        if (!p.isValid()) {
-            throw new Error('point is not valid');
-        }
-        if (this.lng.contains(p.lngRadians)) {
-            return new S1Angle_1.S1Angle(Math.max(0.0, Math.max(p.latRadians - this.lat.hi, this.lat.lo - p.latRadians)));
-        }
-        const interval = new S1Interval_1.S1Interval(this.lng.hi, this.lng.complement().getCenter());
-        let aLng = this.lng.lo;
-        if (interval.contains(p.lngRadians)) {
-            aLng = this.lng.hi;
-        }
-        const lo = new S2LatLng_1.S2LatLng(this.lat.lo, aLng).toPoint();
-        const hi = new S2LatLng_1.S2LatLng(this.lat.hi, aLng).toPoint();
-        const loCrossHi = new S2LatLng_1.S2LatLng(0, aLng - S2_1.S2.M_PI_2).normalized().toPoint();
-        return S2EdgeUtil_1.S2EdgeUtil.getDistance(p.toPoint(), lo, hi, loCrossHi);
-    }
-    /**
-     * Return the minimum distance (measured along the surface of the sphere) to
-     * the given S2LatLngRect. Both S2LatLngRects must be non-empty.
-     */
-    getDistanceLLR(other) {
-        const b = other;
-        if (this.isEmpty()) {
-            throw new Error();
-        }
-        if (b.isEmpty()) {
-            throw new Error();
-        }
-        // First, handle the trivial cases where the longitude intervals overlap.
-        if (this.lng.intersects(b.lng)) {
-            if (this.lat.intersects(b.lat)) {
-                return new S1Angle_1.S1Angle(0); // Intersection between a and b.
-            }
-            // We found an overlap in the longitude interval, but not in the latitude
-            // interval. This means the shortest path travels along some line of
-            // longitude connecting the high-latitude of the lower rect with the
-            // low-latitude of the higher rect.
-            let lo, hi;
-            if (this.lat.lo > b.lat.hi) {
-                lo = b.lat.hi;
-                hi = this.lat.lo;
-            }
-            else {
-                lo = this.lat.hi;
-                hi = b.lat.lo;
-            }
-            return S1Angle_1.S1Angle.radians(hi.radians() - lo.radians());
-        }
-        // The longitude intervals don't overlap. In this case, the closest points
-        // occur somewhere on the pair of longitudinal edges which are nearest in
-        // longitude-space.
-        let aLng, bLng;
-        const loHi = S1Interval_1.S1Interval.fromPointPair(this.lng.lo, b.lng.hi);
-        const hiLo = S1Interval_1.S1Interval.fromPointPair(this.lng.hi, b.lng.lo);
-        if (loHi.getLength() < (hiLo.getLength())) {
-            aLng = this.lng.lo;
-            bLng = b.lng.hi;
-        }
-        else {
-            aLng = this.lng.hi;
-            bLng = b.lng.lo;
-        }
-        // The shortest distance between the two longitudinal segments will include
-        // at least one segment endpoint. We could probably narrow this down further
-        // to a single point-edge distance by comparing the relative latitudes of the
-        // endpoints, but for the sake of clarity, we'll do all four point-edge
-        // distance tests.
-        const aLo = new S2LatLng_1.S2LatLng(this.lat.lo, aLng).toPoint();
-        const aHi = new S2LatLng_1.S2LatLng(this.lat.hi, aLng).toPoint();
-        const aLoCrossHi = new S2LatLng_1.S2LatLng(0, aLng.radians().minus(S2_1.S2.M_PI_2)).normalized().toPoint();
-        const bLo = new S2LatLng_1.S2LatLng(b.lat.lo, bLng).toPoint();
-        const bHi = new S2LatLng_1.S2LatLng(b.lat.hi, bLng).toPoint();
-        const bLoCrossHi = new S2LatLng_1.S2LatLng(0, bLng.radians().minus(S2_1.S2.M_PI_2)).normalized().toPoint();
-        return S1Angle_1.S1Angle.min(S2EdgeUtil_1.S2EdgeUtil.getDistance(aLo, bLo, bHi, bLoCrossHi), S1Angle_1.S1Angle.min(S2EdgeUtil_1.S2EdgeUtil.getDistance(aHi, bLo, bHi, bLoCrossHi), S1Angle_1.S1Angle.min(S2EdgeUtil_1.S2EdgeUtil.getDistance(bLo, aLo, aHi, aLoCrossHi), S2EdgeUtil_1.S2EdgeUtil.getDistance(bHi, aLo, aHi, aLoCrossHi))));
-    }
-    /**
-     * Return the width and height of this rectangle in latitude-longitude space.
-     * Empty rectangles have a negative width and height.
-     */
-    getSize() {
-        return new S2LatLng_1.S2LatLng(this.lat.getLength(), this.lng.getLength());
-    }
-    /**
-     * More efficient version of Contains() that accepts a S2LatLng rather than an
-     * S2Point.
-     */
-    containsLL(ll) {
-        // assert (ll.isValid());
-        return (this.lat.contains(ll.latRadians) && this.lng.contains(ll.lngRadians));
-    }
-    /**
-     * Return true if and only if the given point is contained in the interior of
-     * the region (i.e. the region excluding its boundary). The point 'p' does not
-     * need to be normalized.
-     */
-    interiorContainsP(p) {
-        return this.interiorContainsLL(S2LatLng_1.S2LatLng.fromPoint(p));
-    }
-    /**
-     * More efficient version of InteriorContains() that accepts a S2LatLng rather
-     * than an S2Point.
-     */
-    interiorContainsLL(ll) {
-        // assert (ll.isValid());
-        return (this.lat.interiorContains(ll.latRadians) && this.lng
-            .interiorContains(ll.lngRadians));
-    }
-    /**
-     * Return true if and only if the rectangle contains the given other
-     * rectangle.
-     */
-    containsLLR(other) {
-        return this.lat.containsI(other.lat) && this.lng.containsI(other.lng);
-    }
-    /**
-     * Return true if and only if the interior of this rectangle contains all
-     * points of the given other rectangle (including its boundary).
-     */
-    interiorContainsLLR(other) {
-        return (this.lat.interiorContainsI(other.lat) && this.lng
-            .interiorContainsI(other.lng));
-    }
-    /** Return true if this rectangle and the given other rectangle have any
-     points in common. */
-    intersectsLLR(other) {
-        return this.lat.intersects(other.lat) && this.lng.intersects(other.lng);
-    }
-    /**
-     * Returns true if this rectangle intersects the given cell. (This is an exact
-     * test and may be fairly expensive, see also MayIntersect below.)
-     */
-    intersects(cell) {
-        // First we eliminate the cases where one region completely contains the
-        // other. Once these are disposed of, then the regions will intersect
-        // if and only if their boundaries intersect.
-        if (this.isEmpty()) {
-            return false;
-        }
-        if (this.containsP(cell.getCenterRaw())) {
-            return true;
-        }
-        if (cell.contains(this.getCenter().toPoint())) {
-            return true;
-        }
-        // Quick rejection test (not required for correctness).
-        if (!this.intersectsLLR(cell.getRectBound())) {
-            return false;
-        }
-        // Now check whether the boundaries intersect. Unfortunately, a
-        // latitude-longitude rectangle does not have straight edges -- two edges
-        // are curved, and at least one of them is concave.
-        // Precompute the cell vertices as points and latitude-longitudes.
-        const cellV = new Array(4);
-        const cellLl = new Array(4);
-        for (let i = 0; i < 4; ++i) {
-            cellV[i] = cell.getVertex(i); // Must be normalized.
-            cellLl[i] = S2LatLng_1.S2LatLng.fromPoint(cellV[i]);
-            if (this.containsLL(cellLl[i])) {
-                return true; // Quick acceptance test.
-            }
-        }
-        for (let i = 0; i < 4; ++i) {
-            const edgeLng = S1Interval_1.S1Interval.fromPointPair(cellLl[i].lngRadians, cellLl[(i + 1) & 3].lngRadians);
-            if (!this.lng.intersects(edgeLng)) {
-                continue;
-            }
-            const a = cellV[i];
-            const b = cellV[(i + 1) & 3];
-            if (edgeLng.contains(this.lng.lo)) {
-                if (S2LatLngRect.intersectsLngEdge(a, b, this.lat, this.lng.lo)) {
-                    return true;
-                }
-            }
-            if (edgeLng.contains(this.lng.hi)) {
-                if (S2LatLngRect.intersectsLngEdge(a, b, this.lat, this.lng.hi)) {
-                    return true;
-                }
-            }
-            if (S2LatLngRect.intersectsLatEdge(a, b, this.lat.lo, this.lng)) {
-                return true;
-            }
-            if (S2LatLngRect.intersectsLatEdge(a, b, this.lat.hi, this.lng)) {
-                return true;
-            }
-        }
-        return false;
-    }
-    /**
-     * Return true if and only if the interior of this rectangle intersects any
-     * point (including the boundary) of the given other rectangle.
-     */
-    interiorIntersects(other) {
-        return (this.lat.interiorIntersects(other.lat) && this.lng
-            .interiorIntersects(other.lng));
-    }
-    addPoint(p) {
-        return this.addPointLL(S2LatLng_1.S2LatLng.fromPoint(p));
-    }
-    // Increase the size of the bounding rectangle to include the given point.
-    // The rectangle is expanded by the minimum amount possible.
-    addPointLL(ll) {
-        const newLat = this.lat.addPoint(ll.latRadians);
-        const newLng = this.lng.addPoint(ll.lngRadians);
-        return new S2LatLngRect(newLat, newLng);
-    }
-    /**
-     * Return a rectangle that contains all points whose latitude distance from
-     * this rectangle is at most margin.lat, and whose longitude distance from
-     * this rectangle is at most margin.lng. In particular, latitudes are
-     * clamped while longitudes are wrapped. Note that any expansion of an empty
-     * interval remains empty, and both components of the given margin must be
-     * non-negative.
-     *
-     * NOTE: If you are trying to grow a rectangle by a certain *distance* on the
-     * sphere (e.g. 5km), use the ConvolveWithCap() method instead.
-     */
-    expanded(margin) {
-        // assert (margin.latRadians >= 0 && margin.lngRadians >= 0);
-        if (this.isEmpty()) {
-            return this;
-        }
-        return new S2LatLngRect(this.lat
-            .expanded(margin.latRadians)
-            .intersection(S2LatLngRect.fullLat()), this.lng.expanded(margin.lngRadians));
-    }
-    polarClosure() {
-        if (this.lat.lo == -S2_1.S2.M_PI_2 || this.lat.hi == S2_1.S2.M_PI_2) {
-            return new S2LatLngRect(this.lat, S1Interval_1.S1Interval.full());
-        }
-        else {
-            return this;
-        }
-    }
-    /**
-     * Return the smallest rectangle containing the union of this rectangle and
-     * the given rectangle.
-     */
-    union(other) {
-        return new S2LatLngRect(this.lat.union(other.lat), this.lng.union(other.lng));
-    }
-    /**
-     * Return the smallest rectangle containing the intersection of this rectangle
-     * and the given rectangle. Note that the region of intersection may consist
-     * of two disjoint rectangles, in which case a single rectangle spanning both
-     * of them is returned.
-     */
-    intersection(other) {
-        const intersectLat = this.lat.intersection(other.lat);
-        const intersectLng = this.lng.intersection(other.lng);
-        if (intersectLat.isEmpty() || intersectLng.isEmpty()) {
-            // The lat/lng ranges must either be both empty or both non-empty.
-            return S2LatLngRect.empty();
-        }
-        return new S2LatLngRect(intersectLat, intersectLng);
-    }
-    //
-    // /**
-    //  * Return a rectangle that contains the convolution of this rectangle with a
-    //  * cap of the given angle. This expands the rectangle by a fixed distance (as
-    //  * opposed to growing the rectangle in latitude-longitude space). The returned
-    //  * rectangle includes all points whose minimum distance to the original
-    //  * rectangle is at most the given angle.
-    //  */
-    // public S2LatLngRect convolveWithCap(/*S1Angle*/ angle) {
-    //   // The most straightforward approach is to build a cap centered on each
-    //   // vertex and take the union of all the bounding rectangles (including the
-    //   // original rectangle; this is necessary for very large rectangles).
-    //
-    //   // Optimization: convert the angle to a height exactly once.
-    //   S2Cap cap = S2Cap.fromAxisAngle(new S2Point(1, 0, 0), angle);
-    //
-    //   S2LatLngRect r = this;
-    //   for (int k = 0; k < 4; ++k) {
-    //     S2Cap vertexCap = S2Cap.fromAxisHeight(getVertex(k).toPoint(), cap
-    //         .height());
-    //     r = r.union(vertexCap.getRectBound());
-    //   }
-    //   return r;
-    // }
-    /** Return the surface area of this rectangle on the unit sphere. */
-    area() {
-        if (this.isEmpty()) {
-            return 0;
-        }
-        // This is the size difference of the two spherical caps, multiplied by
-        // the longitude ratio.
-        //TODO: check if this.lat.hi & this.lat.lo is radians.
-        return this.lng.getLength() * (Math.sin(this.lat.hi) - Math.abs(Math.sin(this.lat.lo)));
-    }
-    /** Return true if two rectangles contains the same set of points. */
-    equals(that) {
-        if (!(that instanceof S2LatLngRect)) {
-            return false;
-        }
-        return this.lat.equals(that.lat) && this.lng.equals(that.lng);
-    }
-    /**
-     * Return true if the latitude and longitude intervals of the two rectangles
-     * are the same up to the given tolerance (see r1interval.h and s1interval.h
-     * for details).
-     */
-    approxEquals(other, maxError = 1e-15) {
-        return (this.lat.approxEquals(other.lat, maxError) && this.lng.approxEquals(other.lng, maxError));
-    }
-    // //////////////////////////////////////////////////////////////////////
-    // S2Region interface (see {@code S2Region} for details):
-    clone() {
-        return new S2LatLngRect(this.lat, this.lng);
-    }
-    getCapBound() {
-        // We consider two possible bounding caps, one whose axis passes through the center of the
-        // lat-lng rectangle and one whose axis is the north or south pole. We return the smaller of the
-        // two caps.
-        if (this.isEmpty()) {
-            return S2Cap_1.S2Cap.empty();
-        }
-        let poleZ = 0;
-        let poleAngle = 0;
-        if (this.lat.lo + this.lat.hi < 0) {
-            // South pole axis yields smaller cap.
-            poleZ = -1;
-            poleAngle = S2_1.S2.M_PI_2 + this.lat.hi;
-        }
-        else {
-            poleZ = 1;
-            poleAngle = S2_1.S2.M_PI_2 - this.lat.lo;
-        }
-        const poleCap = S2Cap_1.S2Cap.fromAxisAngle(new S2Point_1.S2Point(0, 0, poleZ), S1Angle_1.S1Angle.radians(poleAngle));
-        // For bounding rectangles that span 180 degrees or less in longitude, the maximum cap size is
-        // achieved at one of the rectangle vertices. For rectangles that are larger than 180 degrees,
-        // we punt and always return a bounding cap centered at one of the two poles.
-        const lngSpan = this.lng.hi - this.lng.lo;
-        if (Platform_1.Platform.IEEEremainder(lngSpan, 2 * S2_1.S2.M_PI) >= 0) {
-            if (lngSpan < 2 * S2_1.S2.M_PI) {
-                let midCap = S2Cap_1.S2Cap.fromAxisAngle(this.getCenter().toPoint(), S1Angle_1.S1Angle.radians(0));
-                for (let k = 0; k < 4; ++k) {
-                    midCap = midCap.addPoint(this.getVertex(k).toPoint());
-                }
-                if (midCap.height() < poleCap.height()) {
-                    return midCap;
-                }
-            }
-        }
-        return poleCap;
-    }
-    getRectBound() {
-        return this;
-    }
-    containsC(cell) {
-        // A latitude-longitude rectangle contains a cell if and only if it contains
-        // the cell's bounding rectangle. (This is an exact test.)
-        return this.containsLLR(cell.getRectBound());
-    }
-    /**
-     * This test is cheap but is NOT exact. Use Intersects() if you want a more
-     * accurate and more expensive test. Note that when this method is used by an
-     * S2RegionCoverer, the accuracy isn't all that important since if a cell may
-     * intersect the region then it is subdivided, and the accuracy of this method
-     * goes up as the cells get smaller.
-     */
-    mayIntersectC(cell) {
-        // This test is cheap but is NOT exact (see s2latlngrect.h).
-        return this.intersectsLLR(cell.getRectBound());
-    }
-    /** The point 'p' does not need to be normalized. */
-    containsP(p) {
-        return this.containsLL(S2LatLng_1.S2LatLng.fromPoint(p));
-    }
-    /**
-     * Return true if the edge AB intersects the given edge of constant longitude.
-     */
-    static /*boolean*/ intersectsLngEdge(a, b, lat, lng) {
-        // Return true if the segment AB intersects the given edge of constant
-        // longitude. The nice thing about edges of constant longitude is that
-        // they are straight lines on the sphere (geodesics).
-        return S2_1.S2.simpleCrossing(a, b, new S2LatLng_1.S2LatLng(lat.lo, lng)
-            .toPoint(), new S2LatLng_1.S2LatLng(lat.hi, lng).toPoint());
-    }
-    /**
-     * Return true if the edge AB intersects the given edge of constant latitude.
-     */
-    static /*boolean*/ intersectsLatEdge(a, b, lat, lng) {
-        // Return true if the segment AB intersects the given edge of constant
-        // latitude. Unfortunately, lines of constant latitude are curves on
-        // the sphere. They can intersect a straight edge in 0, 1, or 2 points.
-        // assert (S2.isUnitLength(a) && S2.isUnitLength(b));
-        // First, compute the normal to the plane AB that points vaguely north.
-        let z = S2Point_1.S2Point.normalize(S2_1.S2.robustCrossProd(a, b));
-        if (z.z < (0)) {
-            z = S2Point_1.S2Point.neg(z);
-        }
-        // Extend this to an orthonormal frame (x,y,z) where x is the direction
-        // where the great circle through AB achieves its maximium latitude.
-        const y = S2Point_1.S2Point.normalize(S2_1.S2.robustCrossProd(z, new S2Point_1.S2Point(0, 0, 1)));
-        const x = S2Point_1.S2Point.crossProd(y, z);
-        // assert (S2.isUnitLength(x) && x.z >= 0);
-        // Compute the angle "theta" from the x-axis (in the x-y plane defined
-        // above) where the great circle intersects the given line of latitude.
-        const sinLat = Math.sin(lat);
-        if (Math.abs(sinLat) >= (x.z)) {
-            return false; // The great circle does not reach the given latitude.
-        }
-        // assert (x.z > 0);
-        const cosTheta = sinLat / x.z;
-        const sinTheta = Math.sqrt(1 - cosTheta * cosTheta);
-        const theta = Math.atan2(sinTheta, cosTheta);
-        // Math.atan2(sinTheta, cosTheta);
-        // The candidate intersection points are located +/- theta in the x-y
-        // plane. For an intersection to be valid, we need to check that the
-        // intersection point is contained in the interior of the edge AB and
-        // also that it is contained within the given longitude interval "lng".
-        // Compute the range of theta values spanned by the edge AB.
-        const abTheta = S1Interval_1.S1Interval.fromPointPair(Math.atan2(a.dotProd(y), a.dotProd(x)), Math.atan2(b.dotProd(y), b.dotProd(x)));
-        if (abTheta.contains(theta)) {
-            // Check if the intersection point is also in the given "lng" interval.
-            const isect = S2Point_1.S2Point.add(S2Point_1.S2Point.mul(x, cosTheta), S2Point_1.S2Point.mul(y, sinTheta));
-            if (lng.contains(Math.atan2(isect.y, isect.x))) {
-                return true;
-            }
-        }
-        if (abTheta.contains(theta * -1)) {
-            // Check if the intersection point is also in the given "lng" interval.
-            const intersection = S2Point_1.S2Point.sub(S2Point_1.S2Point.mul(x, cosTheta), S2Point_1.S2Point.mul(y, sinTheta));
-            if (lng.contains(Math.atan2(intersection.y, intersection.x))) {
-                return true;
-            }
-        }
-        return false;
-    }
-    allVertex() {
-        return [
-            this.getVertex(0),
-            this.getVertex(1),
-            this.getVertex(2),
-            this.getVertex(3)
-        ];
-    }
-    toGEOJSON() {
-        return {
-            type: 'Feature',
-            geometry: {
-                type: 'Polygon',
-                coordinates: [this.allVertex().concat(this.getVertex(0)).map(v => [parseFloat(v.lngDegrees.toFixed(5)), parseFloat(v.latDegrees.toFixed(5))])],
-            },
-            properties: {}
-        };
-    }
-    toString() {
-        return "[Lo=" + this.lo().toString() + ", Hi=" + this.hi().toString() + "]";
-    }
-}
-exports.S2LatLngRect = S2LatLngRect;
-//# sourceMappingURL=S2LatLngRect.js.map

package/dist/S2LatLngRect.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2LatLngRect.js","sourceRoot":"","sources":["../src/S2LatLngRect.ts"],"names":[],"mappings":";;;AAAA,6CAAwC;AACxC,6CAAwC;AACxC,yCAAoC;AAEpC,6BAAwB;AACxB,uCAAkC;AAClC,uCAAkC;AAElC,6CAAwC;AACxC,mCAA8B;AAC9B,yCAAsC;AAEtC,MAAa,YAAY;IACvB,YAAmB,GAAc,EAAS,GAAc;QAArC,QAAG,GAAH,GAAG,CAAW;QAAS,QAAG,GAAH,GAAG,CAAW;IAExD,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,EAAW,EAAE,EAAW;QACxC,OAAO,IAAI,YAAY,CACnB,IAAI,uBAAU,CACV,EAAE,CAAC,UAAU,EACb,EAAE,CAAC,UAAU,CAChB,EACD,IAAI,uBAAU,CACV,EAAE,CAAC,UAAU,EACb,EAAE,CAAC,UAAU,CAChB,CACJ,CAAC;IACJ,CAAC;IAGD,oCAAoC;IAC7B,MAAM,CAAE,KAAK;QAClB,OAAO,IAAI,YAAY,CAAC,uBAAU,CAAC,KAAK,EAAE,EAAE,uBAAU,CAAC,KAAK,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,oCAAoC;IAC7B,MAAM,CAAE,IAAI;QACjB,OAAO,IAAI,YAAY,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,uBAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IACrE,CAAC;IAED,6CAA6C;IACtC,MAAM,CAAC,OAAO;QACnB,OAAO,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,MAAM,EAAE,OAAE,CAAC,MAAM,CAAC,CAAC;IAC/C,CAAC;IAGD;;;;;OAKG;IACI,MAAM,CAAE,cAAc,CAAC,MAAe,EAAE,IAAa;QAC1D,OAAO,YAAY,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,6EAA6E;IACtE,MAAM,CAAE,SAAS,CAAC,CAAU;QACjC,wBAAwB;QACxB,OAAO,YAAY,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,aAAa,CAAC,EAAW,EAAE,EAAW;QAClD,yCAAyC;QACzC,OAAO,IAAI,YAAY,CAAC,uBAAU,CAAC,aAAa,CAAC,EAAE,CAAC,UAAU,EAAE,EAAE;aAC7D,UAAU,CAAC,EAAE,uBAAU,CAAC,aAAa,CAAC,EAAE,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;IAC5E,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAE,QAAQ,CAAC,CAAS,EAAE,CAAS;QAC1C,qDAAqD;QACrD,MAAM,CAAC,GAAG,YAAY,CAAC,aAAa,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnF,kEAAkE;QAClE,4EAA4E;QAC5E,0EAA0E;QAC1E,0EAA0E;QAC1E,uBAAuB;QACvB,MAAM,EAAE,GAAG,OAAE,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,GAAG,GAAG,iBAAO,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE;YAChB,6DAA6D;YAC7D,OAAO,CAAC,CAAC;SACV;QACD,yEAAyE;QACzE,gDAAgD;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACrD,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,OAAO,IAAI,YAAY,CAAC,IAAI,uBAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SAClE;aAAM;YACL,OAAO,IAAI,YAAY,CAAC,IAAI,uBAAU,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SACnE;IACH,CAAC;IAED;;;;;OAKG;IACI,OAAO;QACZ,kEAAkE;QAClE,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAE,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,OAAE,CAAC,MAAM,CAAC;eAC/E,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;IACrE,CAAC;IAEM,EAAE;QACP,OAAO,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChD,CAAC;IAEM,EAAE;QACP,OAAO,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAChD,CAAC;IAEM,KAAK;QACV,OAAO,iBAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK;QACV,OAAO,iBAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK;QACV,OAAO,iBAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IAEM,KAAK;QACV,OAAO,iBAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;IAC5B,CAAC;IAEH,qEAAqE;IAC5D,MAAM;QACX,oCAAoC;QACpC,kDAAkD;QAClD,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;IACtE,CAAC;IAED;;;OAGG;IACK,UAAU;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC;IAC/B,CAAC;IAED,0EAA0E;IAClE,SAAS,CAAC,CAAQ;QACxB,mDAAmD;QACnD,QAAQ,CAAC,EAAE;YACT,KAAK,CAAC;gBACJ,OAAO,IAAI,CAAC,EAAE,EAAE,CAAC;YACnB,KAAK,CAAC;gBACJ,OAAO,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChD,KAAK,CAAC;gBACJ,OAAO,IAAI,CAAC,EAAE,EAAE,CAAC;YACnB,KAAK,CAAC;gBACJ,OAAO,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChD;gBACE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;SAC5C;IACH,CAAC;IAED;;;OAGG;IACK,SAAS;QACf,OAAO,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;IAClE,CAAC;IAED;;;;OAIG;IACI,aAAa,CAAC,CAAU;QAC7B,uEAAuE;QACvE,gCAAgC;QAChC,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,MAAM,IAAI,KAAK,EAAE,CAAC;SACnB;QACD,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE;YAChB,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;SACvC;QAGD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE;YACnC,OAAO,IAAI,iBAAO,CACd,IAAI,CAAC,GAAG,CACJ,GAAG,EACH,IAAI,CAAC,GAAG,CACJ,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAC1B,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,UAAU,CAC7B,CACJ,CACJ,CAAC;SACH;QAED,MAAM,QAAQ,GAAG,IAAI,uBAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC;QAChF,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACvB,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE;YACnC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;SACpB;QAED,MAAM,EAAE,GAAG,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACrD,MAAM,EAAE,GAAG,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACrD,MAAM,SAAS,GAAG,IAAI,mBAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,OAAE,CAAC,MAAM,CAAC,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,CAAC;QAC3E,OAAO,uBAAU,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IAChE,CAAC;IAED;;;OAGG;IACK,cAAc,CAAC,KAAkB;QACvC,MAAM,CAAC,GAAG,KAAK,CAAC;QAChB,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,MAAM,IAAI,KAAK,EAAE,CAAC;SACnB;QACD,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACf,MAAM,IAAI,KAAK,EAAE,CAAC;SACnB;QAGD,yEAAyE;QACzE,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;YAC9B,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;gBAC9B,OAAO,IAAI,iBAAO,CAAC,CAAC,CAAC,CAAC,CAAE,gCAAgC;aACzD;YAED,yEAAyE;YACzE,oEAAoE;YACpE,oEAAoE;YACpE,mCAAmC;YACnC,IAAI,EAAE,EAAE,EAAE,CAAC;YACX,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE;gBAC1B,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACd,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;aAClB;iBAAM;gBACL,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACjB,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;aACf;YACD,OAAO,iBAAO,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;SACrD;QAED,0EAA0E;QAC1E,yEAAyE;QACzE,mBAAmB;QACnB,IAAI,IAAI,EAAE,IAAI,CAAC;QACf,MAAM,IAAI,GAAG,uBAAU,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,uBAAU,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAI,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE;YACzC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;SACjB;aAAM;YACL,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACnB,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;SACjB;QAED,2EAA2E;QAC3E,4EAA4E;QAC5E,6EAA6E;QAC7E,uEAAuE;QACvE,kBAAkB;QAClB,MAAM,GAAG,GAAG,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACtD,MAAM,GAAG,GAAG,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,mBAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,OAAE,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,CAAC;QAC3F,MAAM,GAAG,GAAG,IAAI,mBAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACnD,MAAM,GAAG,GAAG,IAAI,mBAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;QACnD,MAAM,UAAU,GAAG,IAAI,mBAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,OAAE,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,OAAO,EAAE,CAAC;QAE3F,OAAO,iBAAO,CAAC,GAAG,CAAC,uBAAU,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,CAAC,EAChE,iBAAO,CAAC,GAAG,CAAC,uBAAU,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,CAAC,EACzD,iBAAO,CAAC,GAAG,CAAC,uBAAU,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,CAAC,EACzD,uBAAU,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;;OAGG;IACK,OAAO;QACb,OAAO,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC;IAClE,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,EAAW;QAC3B,yBAAyB;QACzB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;IAEhF,CAAC;IAED;;;;OAIG;IACI,iBAAiB,CAAC,CAAS;QAChC,OAAO,IAAI,CAAC,kBAAkB,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED;;;OAGG;IACI,kBAAkB,CAAC,EAAW;QACnC,yBAAyB;QACzB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,GAAG;aACvD,gBAAgB,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,KAAkB;QACnC,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACxE,CAAC;IAED;;;OAGG;IACI,mBAAmB,CAAC,KAAkB;QAC3C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG;aACpD,iBAAiB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IAED;yBACqB;IACd,aAAa,CAAC,KAAkB;QACrC,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC1E,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,IAAW;QAC3B,wEAAwE;QACxE,qEAAqE;QACrE,6CAA6C;QAE7C,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,KAAK,CAAC;SACd;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,EAAE;YACvC,OAAO,IAAI,CAAC;SACb;QACD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE;YAC7C,OAAO,IAAI,CAAC;SACb;QAED,uDAAuD;QACvD,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,EAAE;YAC5C,OAAO,KAAK,CAAC;SACd;QAED,+DAA+D;QAC/D,yEAAyE;QACzE,mDAAmD;QAEnD,kEAAkE;QAClE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAU,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAW,CAAC,CAAC,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB;YACpD,MAAM,CAAC,CAAC,CAAC,GAAG,mBAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC9B,OAAO,IAAI,CAAC,CAAC,yBAAyB;aACvC;SACF;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,MAAM,OAAO,GAAG,uBAAU,CAAC,aAAa,CACpC,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAC1D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE;gBACjC,SAAS;aACV;YAED,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACjC,IAAI,YAAY,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAC/D,OAAO,IAAI,CAAC;iBACb;aACF;YACD,IAAI,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBACjC,IAAI,YAAY,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;oBAC/D,OAAO,IAAI,CAAC;iBACb;aACF;YACD,IAAI,YAAY,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE;gBAC/D,OAAO,IAAI,CAAC;aACb;YACD,IAAI,YAAY,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE;gBAC/D,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACK,kBAAkB,CAAC,KAAkB;QAC3C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,kBAAkB,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG;aACrD,kBAAkB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAEM,QAAQ,CAAC,CAAS;QACvB,OAAO,IAAI,CAAC,UAAU,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAEH,0EAA0E;IAC1E,4DAA4D;IAClD,UAAU,CAAC,EAAW;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;QAChD,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;;;;;;OAUG;IACK,QAAQ,CAAC,MAAe;QAC9B,6DAA6D;QAC7D,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,IAAI,YAAY,CACnB,IAAI,CAAC,GAAG;aACH,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC;aAC3B,YAAY,CACT,YAAY,CAAC,OAAO,EAAE,CACzB,EACL,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CACvC,CAAC;IACJ,CAAC;IAEM,YAAY;QACjB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,OAAE,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,OAAE,CAAC,MAAM,EAAE;YACzD,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,uBAAU,CAAC,IAAI,EAAE,CAAC,CAAC;SACtD;aAAM;YACL,OAAO,IAAI,CAAC;SACb;IACH,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,KAAkB;QAC7B,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAChF,CAAC;IAED;;;;;OAKG;IACK,YAAY,CAAC,KAAkB;QACrC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtD,IAAI,YAAY,CAAC,OAAO,EAAE,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE;YACpD,kEAAkE;YAClE,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC;SAC7B;QACD,OAAO,IAAI,YAAY,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;IACtD,CAAC;IAEH,EAAE;IACF,MAAM;IACN,+EAA+E;IAC/E,gFAAgF;IAChF,iFAAiF;IACjF,0EAA0E;IAC1E,2CAA2C;IAC3C,MAAM;IACN,2DAA2D;IAC3D,4EAA4E;IAC5E,+EAA+E;IAC/E,yEAAyE;IACzE,EAAE;IACF,iEAAiE;IACjE,kEAAkE;IAClE,EAAE;IACF,2BAA2B;IAC3B,kCAAkC;IAClC,yEAAyE;IACzE,sBAAsB;IACtB,6CAA6C;IAC7C,MAAM;IACN,cAAc;IACd,IAAI;IAEF,oEAAoE;IAC7D,IAAI;QACT,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,CAAC,CAAC;SACV;QAED,uEAAuE;QACvE,uBAAuB;QACvB,sDAAsD;QAEtD,OAAO,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1F,CAAC;IAED,qEAAqE;IAE9D,MAAM,CAAC,IAAQ;QACpB,IAAI,CAAC,CAAC,IAAI,YAAY,YAAY,CAAC,EAAE;YACnC,OAAO,KAAK,CAAC;SACd;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChE,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,KAAkB,EAAE,QAAQ,GAAE,KAAK;QACrD,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,YAAY,CACvE,KAAK,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC5B,CAAC;IAEH,yEAAyE;IACzE,yDAAyD;IAGhD,KAAK;QACV,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9C,CAAC;IAGM,WAAW;QAChB,0FAA0F;QAC1F,gGAAgG;QAChG,YAAY;QACZ,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,aAAK,CAAC,KAAK,EAAE,CAAC;SACtB;QAED,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE;YACjC,sCAAsC;YACtC,KAAK,GAAG,CAAC,CAAC,CAAC;YACX,SAAS,GAAG,OAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;SACrC;aAAM;YACL,KAAK,GAAG,CAAC,CAAC;YACV,SAAS,GAAG,OAAE,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;SACrC;QACD,MAAM,OAAO,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,iBAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;QAE1F,8FAA8F;QAC9F,8FAA8F;QAC9F,6EAA6E;QAC7E,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAC1C,IAAI,mBAAQ,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACrD,IAAI,OAAO,GAAG,CAAC,GAAG,OAAE,CAAC,IAAI,EAAE;gBACzB,IAAI,MAAM,GAAG,aAAK,CAAC,aAAa,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,EAAE,iBAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBACjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;oBAC1B,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;iBACvD;gBACD,IAAI,MAAM,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE;oBACtC,OAAO,MAAM,CAAC;iBACf;aACF;SACF;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAGM,YAAY;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAGkB,SAAS,CAAC,IAAW;QACtC,4EAA4E;QAC5E,0DAA0D;QAC1D,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED;;;;;;OAMG;IAEgB,aAAa,CAAC,IAAW;QAC1C,4DAA4D;QAC5D,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,oDAAoD;IACjC,SAAS,CAAC,CAAS;QACpC,OAAO,IAAI,CAAC,UAAU,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAS,EAAE,CAAS,EACpB,GAAc,EAAE,GAAU;QACrE,sEAAsE;QACtE,sEAAsE;QACtE,qDAAqD;QAGrD,OAAO,OAAE,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,mBAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC;aACnD,OAAO,EAAE,EAAE,IAAI,mBAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;IACvD,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAS,EAAE,CAAS,EAAE,GAAU,EAChC,GAAc;QACzD,sEAAsE;QACtE,oEAAoE;QACpE,uEAAuE;QACvE,qDAAqD;QAErD,uEAAuE;QACvE,IAAI,CAAC,GAAG,iBAAO,CAAC,SAAS,CAAC,OAAE,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;YACb,CAAC,GAAG,iBAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;SACpB;QAED,uEAAuE;QACvE,oEAAoE;QACpE,MAAM,CAAC,GAAG,iBAAO,CAAC,SAAS,CAAC,OAAE,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,CAAC,GAAG,iBAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,2CAA2C;QAE3C,sEAAsE;QACtE,uEAAuE;QACvE,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;YAC7B,OAAO,KAAK,CAAC,CAAC,sDAAsD;SACrE;QACD,oBAAoB;QACpB,MAAM,QAAQ,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,GAAG,QAAQ,CAAC,CAAC;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC7C,kCAAkC;QAElC,qEAAqE;QACrE,oEAAoE;QACpE,qEAAqE;QACrE,uEAAuE;QAEvE,4DAA4D;QAC5D,MAAM,OAAO,GAAG,uBAAU,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAC/C,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEzE,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE;YAC3B,uEAAuE;YACvE,MAAM,KAAK,GAAG,iBAAO,CAAC,GAAG,CAAC,iBAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,iBAAO,CAAC,GAAG,CAAC,CAAC,EAC7D,QAAQ,CAAC,CAAC,CAAC;YACf,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC9C,OAAO,IAAI,CAAC;aACb;SACF;QACD,IAAI,OAAO,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE;YAChC,uEAAuE;YACvE,MAAM,YAAY,GAAG,iBAAO,CAAC,GAAG,CAAC,iBAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,iBAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;YACrF,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC5D,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IAEf,CAAC;IAEM,SAAS;QACd,OAAO;YACL,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YACjB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YACjB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;YACjB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;SAClB,CAAA;IACH,CAAC;IAEM,SAAS;QACd,OAAO;YACL,IAAI,EAAE,SAAS;YACf,QAAQ,EAAE;gBACR,IAAI,EAAE,SAAS;gBACf,WAAW,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC/I;YACD,UAAU,EAAE,EAAE;SAEf,CAAA;IACH,CAAC;IAEM,QAAQ;QACb,OAAO,MAAM,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,EAAE,GAAG,OAAO,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC;IAC9E,CAAC;CAGF;AAztBD,oCAytBC"}