nodes2ts 2.0.0 → 4.0.0

package/dist/S2Cell.js

@@ -1,361 +0,0 @@
-"use strict";
-var Long = require('long');
-var S2CellId_1 = require("./S2CellId");
-var S2Point_1 = require("./S2Point");
-var S2LatLng_1 = require("./S2LatLng");
-var S2Projections_1 = require("./S2Projections");
-var R2Vector_1 = require("./R2Vector");
-var MutableInteger_1 = require("./MutableInteger");
-var S2_1 = require("./S2");
-var S2LatLngRect_1 = require("./S2LatLngRect");
-var R1Interval_1 = require("./R1Interval");
-var S1Interval_1 = require("./S1Interval");
-var S2Cap_1 = require("./S2Cap");
-var S2Cell = (function () {
-    function S2Cell(cellID) {
-        this.cellID = cellID;
-        this._uv = [];
-        this._uv.push([]);
-        this._uv.push([]);
-        this.init(cellID);
-    }
-    Object.defineProperty(S2Cell.prototype, "id", {
-        get: function () {
-            return this.cellID;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(S2Cell.prototype, "face", {
-        get: function () {
-            return this._face;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(S2Cell.prototype, "level", {
-        get: function () {
-            return this._level;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(S2Cell.prototype, "orientation", {
-        get: function () {
-            return this._orientation;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    // This is a static method in order to provide named parameters.
-    S2Cell.fromFacePosLevel = function (face, pos, level) {
-        return new S2Cell(S2CellId_1.S2CellId.fromFacePosLevel(face, new Long(pos), level));
-    };
-    // Convenience methods.
-    S2Cell.fromPoint = function (p) {
-        return new S2Cell(S2CellId_1.S2CellId.fromPoint(p));
-    };
-    S2Cell.fromLatLng = function (ll) {
-        return new S2Cell(S2CellId_1.S2CellId.fromPoint(ll.toPoint()));
-    };
-    S2Cell.prototype.isLeaf = function () {
-        return this.level == S2CellId_1.S2CellId.MAX_LEVEL;
-    };
-    S2Cell.prototype.getVertex = function (k) {
-        return S2Point_1.S2Point.normalize(this.getVertexRaw(k));
-    };
-    /**
-     * Return the k-th vertex of the cell (k = 0,1,2,3). Vertices are returned in
-     * CCW order. The points returned by GetVertexRaw are not necessarily unit
-     * length.
-     */
-    S2Cell.prototype.getVertexRaw = function (k) {
-        // Vertices are returned in the order SW, SE, NE, NW.
-        return new R2Vector_1.R2Vector(this._uv[0][(k >> 1) ^ (k & 1)], this._uv[1][k >> 1])
-            .toPoint(this.face);
-        // return S2Projections.faceUvToXyz(this.face, );
-    };
-    S2Cell.prototype.getEdge = function (k) {
-        return S2Point_1.S2Point.normalize(this.getEdgeRaw(k));
-    };
-    S2Cell.prototype.getEdgeRaw = function (k) {
-        switch (k) {
-            case 0:
-                return S2Projections_1.S2Projections.getVNorm(this.face, this._uv[1][0]); // South
-            case 1:
-                return S2Projections_1.S2Projections.getUNorm(this.face, this._uv[0][1]); // East
-            case 2:
-                return S2Point_1.S2Point.neg(S2Projections_1.S2Projections.getVNorm(this.face, this._uv[1][1])); // North
-            default:
-                return S2Point_1.S2Point.neg(S2Projections_1.S2Projections.getUNorm(this.face, this._uv[0][0])); // West
-        }
-    };
-    /**
-     * Return the inward-facing normal of the great circle passing through the
-     * edge from vertex k to vertex k+1 (mod 4). The normals returned by
-     * GetEdgeRaw are not necessarily unit length.
-     *
-     *  If this is not a leaf cell, set children[0..3] to the four children of
-     * this cell (in traversal order) and return true. Otherwise returns false.
-     * This method is equivalent to the following:
-     *
-     *  for (pos=0, id=child_begin(); id != child_end(); id = id.next(), ++pos)
-     * children[i] = S2Cell(id);
-     *
-     * except that it is more than two times faster.
-     */
-    S2Cell.prototype.subdivide = function () {
-        // This function is equivalent to just iterating over the child cell ids
-        // and calling the S2Cell constructor, but it is about 2.5 times faster.
-        if (this.isLeaf()) {
-            return null;
-        }
-        // Compute the cell midpoint in uv-space.
-        // const uvMid = this.getCenterUV();
-        var children = new Array(4);
-        // Create four children with the appropriate bounds.
-        var id = this.cellID.childBegin();
-        for (var pos = 0; pos < 4; ++pos, id = id.next()) {
-            children[pos] = new S2Cell(id);
-        }
-        return children;
-    };
-    /**
-     * Return the direction vector corresponding to the center in (s,t)-space of
-     * the given cell. This is the point at which the cell is divided into four
-     * subcells; it is not necessarily the centroid of the cell in (u,v)-space or
-     * (x,y,z)-space. The point returned by GetCenterRaw is not necessarily unit
-     * length.
-     */
-    S2Cell.prototype.getCenter = function () {
-        return S2Point_1.S2Point.normalize(this.getCenterRaw());
-    };
-    S2Cell.prototype.getCenterRaw = function () {
-        return this.cellID.toPointRaw();
-    };
-    /**
-     * Return the center of the cell in (u,v) coordinates (see {@code
-     * S2Projections}). Note that the center of the cell is defined as the point
-     * at which it is recursively subdivided into four children; in general, it is
-     * not at the midpoint of the (u,v) rectangle covered by the cell
-     */
-    S2Cell.prototype.getCenterUV = function () {
-        var i = new MutableInteger_1.MutableInteger(0);
-        var j = new MutableInteger_1.MutableInteger(0);
-        this.cellID.toFaceIJOrientation(i, j, null);
-        var cellSize = 1 << (S2CellId_1.S2CellId.MAX_LEVEL - this.level);
-        // TODO(dbeaumont): Figure out a better naming of the variables here (and elsewhere).
-        var si = (i.val & -cellSize) * 2 + cellSize - S2Cell.MAX_CELL_SIZE;
-        var x = R2Vector_1.R2Vector.singleStTOUV(1 / S2Cell.MAX_CELL_SIZE * si);
-        // let x = S2Projections.stToUV((1.0 / S2Cell.MAX_CELL_SIZE) * si);
-        var sj = (j.val & -cellSize) * 2 + cellSize - S2Cell.MAX_CELL_SIZE;
-        var y = R2Vector_1.R2Vector.singleStTOUV(1 / S2Cell.MAX_CELL_SIZE * sj);
-        // double y = S2Projections.stToUV((1.0 / S2Cell.MAX_CELL_SIZE) * sj);
-        return new R2Vector_1.R2Vector(x, y);
-    };
-    /**
-     * Return the average area of cells at this level. This is accurate to within
-     * a factor of 1.7 (for S2_QUADRATIC_PROJECTION) and is extremely cheap to
-     * compute.
-     */
-    S2Cell.averageArea = function (level) {
-        return S2Projections_1.S2Projections.AVG_AREA.getValue(level);
-    };
-    /**
-     * Return the average area of cells at this level. This is accurate to within
-     * a factor of 1.7 (for S2_QUADRATIC_PROJECTION) and is extremely cheap to
-     * compute.
-     */
-    S2Cell.prototype.averageArea = function () {
-        return S2Projections_1.S2Projections.AVG_AREA.getValue(this.level);
-    };
-    /**
-     * Return the approximate area of this cell. This method is accurate to within
-     * 3% percent for all cell sizes and accurate to within 0.1% for cells at
-     * level 5 or higher (i.e. 300km square or smaller). It is moderately cheap to
-     * compute.
-     */
-    S2Cell.prototype.approxArea = function () {
-        // All cells at the first two levels have the same area.
-        if (this.level < 2) {
-            return this.averageArea();
-        }
-        // First, compute the approximate area of the cell when projected
-        // perpendicular to its normal. The cross product of its diagonals gives
-        // the normal, and the length of the normal is twice the projected area.
-        var flatArea = S2Point_1.S2Point.crossProd(S2Point_1.S2Point.sub(this.getVertex(2), this.getVertex(0)), S2Point_1.S2Point.sub(this.getVertex(3), this.getVertex(1))).norm() * 0.5;
-        // double flatArea = 0.5 * S2Point.crossProd(
-        //         S2Point.sub(getVertex(2), getVertex(0)), S2Point.sub(getVertex(3), getVertex(1))).norm();
-        // Now, compensate for the curvature of the cell surface by pretending
-        // that the cell is shaped like a spherical cap. The ratio of the
-        // area of a spherical cap to the area of its projected disc turns out
-        // to be 2 / (1 + sqrt(1 - r*r)) where "r" is the radius of the disc.
-        // For example, when r=0 the ratio is 1, and when r=1 the ratio is 2.
-        // Here we set Pi*r*r == flat_area to find the equivalent disc.
-        return flatArea * 2 / (Math.sqrt((Math.min(flatArea * S2_1.S2.M_1_PI, 1) * -1) + 1) + 1);
-    };
-    //
-    // /**
-    //  * Return the area of this cell as accurately as possible. This method is more
-    //  * expensive but it is accurate to 6 digits of precision even for leaf cells
-    //  * (whose area is approximately 1e-18).
-    //  */
-    S2Cell.prototype.exactArea = function () {
-        var v0 = this.getVertex(0);
-        var v1 = this.getVertex(1);
-        var v2 = this.getVertex(2);
-        var v3 = this.getVertex(3);
-        return S2_1.S2.area(v0, v1, v2) + (S2_1.S2.area(v0, v2, v3));
-    };
-    // //////////////////////////////////////////////////////////////////////
-    // S2Region interface (see {@code S2Region} for details):
-    S2Cell.prototype.getCapBound = function () {
-        // Use the cell center in (u,v)-space as the cap axis. This vector is
-        // very close to GetCenter() and faster to compute. Neither one of these
-        // vectors yields the bounding cap with minimal surface area, but they
-        // are both pretty close.
-        //
-        // It's possible to show that the two vertices that are furthest from
-        // the (u,v)-origin never determine the maximum cap size (this is a
-        // possible future optimization).
-        var u = this._uv[0][0] + (this._uv[0][1]) * (0.5);
-        var v = this._uv[1][0] + (this._uv[1][1]) * (0.5);
-        var cap = new S2Cap_1.S2Cap(S2Point_1.S2Point.normalize(S2Projections_1.S2Projections.faceUvToXyz(this.face, u, v)), 0);
-        for (var k = 0; k < 4; ++k) {
-            cap = cap.addPoint(this.getVertex(k));
-        }
-        return cap;
-    };
-    // 35.26 degrees
-    S2Cell.prototype.getRectBound = function () {
-        if (this.level > 0) {
-            // Except for cells at level 0, the latitude and longitude extremes are
-            // attained at the vertices. Furthermore, the latitude range is
-            // determined by one pair of diagonally opposite vertices and the
-            // longitude range is determined by the other pair.
-            //
-            // We first determine which corner (i,j) of the cell has the largest
-            // absolute latitude. To maximize latitude, we want to find the point in
-            // the cell that has the largest absolute z-coordinate and the smallest
-            // absolute x- and y-coordinates. To do this we look at each coordinate
-            // (u and v), and determine whether we want to minimize or maximize that
-            // coordinate based on the axis direction and the cell's (u,v) quadrant.
-            var u = this._uv[0][0] + (this._uv[0][1]);
-            var v = this._uv[1][0] + (this._uv[1][1]);
-            var i = S2Projections_1.S2Projections.getUAxis(this.face).z == 0 ? (u < 0 ? 1 : 0) : (u > 0 ? 1 : 0);
-            var j = S2Projections_1.S2Projections.getVAxis(this.face).z == 0 ? (v < 0 ? 1 : 0) : (v > 0 ? 1 : 0);
-            var lat = R1Interval_1.R1Interval.fromPointPair(this.getLatitude(i, j), this.getLatitude(1 - i, 1 - j));
-            lat = lat.expanded(S2Cell.MAX_ERROR).intersection(S2LatLngRect_1.S2LatLngRect.fullLat());
-            if (lat.lo == (-S2_1.S2.M_PI_2) || lat.hi == (S2_1.S2.M_PI_2)) {
-                return new S2LatLngRect_1.S2LatLngRect(lat, S1Interval_1.S1Interval.full());
-            }
-            var lng = S1Interval_1.S1Interval.fromPointPair(this.getLongitude(i, 1 - j), this.getLongitude(1 - i, j));
-            return new S2LatLngRect_1.S2LatLngRect(lat, lng.expanded(S2Cell.MAX_ERROR));
-        }
-        // The face centers are the +X, +Y, +Z, -X, -Y, -Z axes in that order.
-        // assert (S2Projections.getNorm(face).get(face % 3) == ((face < 3) ? 1 : -1));
-        switch (this.face) {
-            case 0:
-                return new S2LatLngRect_1.S2LatLngRect(new R1Interval_1.R1Interval(-S2_1.S2.M_PI_4, S2_1.S2.M_PI_4), new S1Interval_1.S1Interval(-S2_1.S2.M_PI_4, S2_1.S2.M_PI_4));
-            case 1:
-                return new S2LatLngRect_1.S2LatLngRect(new R1Interval_1.R1Interval(-S2_1.S2.M_PI_4, S2_1.S2.M_PI_4), new S1Interval_1.S1Interval(S2_1.S2.M_PI_4, 3 * S2_1.S2.M_PI_4));
-            case 2:
-                return new S2LatLngRect_1.S2LatLngRect(new R1Interval_1.R1Interval(S2Cell.POLE_MIN_LAT, S2_1.S2.M_PI_2), new S1Interval_1.S1Interval(-S2_1.S2.M_PI, S2_1.S2.M_PI));
-            case 3:
-                return new S2LatLngRect_1.S2LatLngRect(new R1Interval_1.R1Interval(-S2_1.S2.M_PI_4, S2_1.S2.M_PI_4), new S1Interval_1.S1Interval(3 * S2_1.S2.M_PI_4, -3 * S2_1.S2.M_PI_4));
-            case 4:
-                return new S2LatLngRect_1.S2LatLngRect(new R1Interval_1.R1Interval(-S2_1.S2.M_PI_4, S2_1.S2.M_PI_4), new S1Interval_1.S1Interval(-3 * S2_1.S2.M_PI_4, -S2_1.S2.M_PI_4));
-            default:
-                return new S2LatLngRect_1.S2LatLngRect(new R1Interval_1.R1Interval(-S2_1.S2.M_PI_2, -S2Cell.POLE_MIN_LAT), new S1Interval_1.S1Interval(-S2_1.S2.M_PI, S2_1.S2.M_PI));
-        }
-    };
-    S2Cell.prototype.mayIntersect = function (cell) {
-        return this.cellID.intersects(cell.cellID);
-    };
-    S2Cell.prototype.contains = function (p) {
-        // We can't just call XYZtoFaceUV, because for points that lie on the
-        // boundary between two faces (i.e. u or v is +1/-1) we need to return
-        // true for both adjacent cells.
-        var uvPoint = p.toR2Vector(this.face);
-        // S2Projections.faceXyzToUv(this.face, p);
-        if (uvPoint == null) {
-            return false;
-        }
-        return (uvPoint.x >= (this._uv[0][0]) && uvPoint.x <= (this._uv[0][1])
-            && uvPoint.y >= (this._uv[1][0]) && uvPoint.y <= (this._uv[1][1]));
-    };
-    // The point 'p' does not need to be normalized.
-    S2Cell.prototype.containsC = function (cell) {
-        return this.cellID.contains(cell.cellID);
-    };
-    S2Cell.prototype.init = function (id) {
-        this.cellID = id;
-        var ij = [];
-        var mOrientation = new MutableInteger_1.MutableInteger(0);
-        for (var d = 0; d < 2; ++d) {
-            ij[d] = new MutableInteger_1.MutableInteger(0);
-        }
-        this._face = id.toFaceIJOrientation(ij[0], ij[1], mOrientation);
-        this._orientation = mOrientation.val; // Compress int to a byte.
-        this._level = id.level();
-        var cellSize = 1 << (S2CellId_1.S2CellId.MAX_LEVEL - this.level);
-        for (var d = 0; d < 2; ++d) {
-            // Compute the cell bounds in scaled (i,j) coordinates.
-            var sijLo = (ij[d].val & -cellSize) * 2 - S2Cell.MAX_CELL_SIZE;
-            var sijHi = sijLo + cellSize * 2;
-            var s = 1 / S2Cell.MAX_CELL_SIZE;
-            this._uv[d][0] = R2Vector_1.R2Vector.singleStTOUV(s * (sijLo));
-            //S2Projections.stToUV((1.0 / S2Cell.MAX_CELL_SIZE) * sijLo);
-            this._uv[d][1] = R2Vector_1.R2Vector.singleStTOUV(s * (sijHi));
-        }
-    };
-    // Internal method that does the actual work in the constructors.
-    S2Cell.prototype.getLatitude = function (i, j) {
-        var p = S2Projections_1.S2Projections.faceUvToXyz(this.face, this._uv[0][i], this._uv[1][j]);
-        return Math.atan2(p.z, Math.sqrt(p.x * p.x + p.y * p.y));
-        // return Math.atan2(p.z, Math.sqrt(p.x * p.x + p.y * p.y));
-    };
-    S2Cell.prototype.getLongitude = function (i, j) {
-        var p = S2Projections_1.S2Projections.faceUvToXyz(this.face, this._uv[0][i], this._uv[1][j]);
-        return Math.atan2(p.y, p.x);
-        // Math.atan2(p.y, p.x);
-    };
-    // Return the latitude or longitude of the cell vertex given by (i,j),
-    // where "i" and "j" are either 0 or 1.
-    S2Cell.prototype.toString = function () {
-        return "[" + this._face + ", " + this._level + ", " + this._orientation + ", " + this.cellID.toToken() + "]";
-    };
-    S2Cell.prototype.toGEOJSON = function () {
-        var coords = [this.getVertex(0), this.getVertex(1), this.getVertex(2), this.getVertex(3), this.getVertex(0)]
-            .map(function (v) { return S2LatLng_1.S2LatLng.fromPoint(v); })
-            .map(function (v) { return ([v.lngDegrees, v.latDegrees]); });
-        // const rectJSON = this.getRectBound().toGEOJSON();
-        return {
-            type: 'Feature',
-            geometry: {
-                type: 'Polygon',
-                coordinates: [coords]
-            },
-            properties: {},
-            title: "Cell: " + this.id.toToken() + " lvl: " + this.level
-        };
-        // rectJSON.title = `Cell: ${this.id.toToken()}`;
-        // return rectJSON;
-    };
-    S2Cell.MAX_CELL_SIZE = 1 << S2CellId_1.S2CellId.MAX_LEVEL;
-    // We grow the bounds slightly to make sure that the bounding rectangle
-    // also contains the normalized versions of the vertices. Note that the
-    // maximum result magnitude is Pi, with a floating-point exponent of 1.
-    // Therefore adding or subtracting 2**-51 will always change the result.
-    //   private static MAX_ERROR = S2.toDecimal(1.0).dividedBy(S2.toDecimal(new Long(1).shiftLeft(51).toString()));
-    S2Cell.MAX_ERROR = 1 / new Long(1).shiftLeft(51).toNumber();
-    // The 4 cells around the equator extend to +/-45 degrees latitude at the
-    // midpoints of their top and bottom edges. The two cells covering the
-    // poles extend down to +/-35.26 degrees at their vertices.
-    // adding kMaxError (as opposed to the C version) because of asin and atan2
-    // roundoff errors
-    S2Cell.POLE_MIN_LAT = Math.asin(Math.sqrt(1 / 3)) - S2Cell.MAX_ERROR;
-    return S2Cell;
-}());
-exports.S2Cell = S2Cell;
-//# sourceMappingURL=S2Cell.js.map

package/dist/S2Cell.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2Cell.js","sourceRoot":"","sources":["../src/S2Cell.ts"],"names":[],"mappings":";AAAA,IAAO,IAAI,WAAW,MAAM,CAAC,CAAC;AAC9B,yBAAuB,YAAY,CAAC,CAAA;AACpC,wBAAsB,WAAW,CAAC,CAAA;AAClC,yBAAuB,YAAY,CAAC,CAAA;AACpC,8BAA4B,iBAAiB,CAAC,CAAA;AAC9C,yBAAuB,YAAY,CAAC,CAAA;AACpC,+BAA6B,kBAAkB,CAAC,CAAA;AAChD,mBAAiB,MAAM,CAAC,CAAA;AACxB,6BAA2B,gBAAgB,CAAC,CAAA;AAC5C,2BAAyB,cAAc,CAAC,CAAA;AACxC,2BAAyB,cAAc,CAAC,CAAA;AACxC,sBAAoB,SAAS,CAAC,CAAA;AAC9B;IAQE,gBAAoB,MAAe;QAAf,WAAM,GAAN,MAAM,CAAS;QACjC,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACnB,CAAC;IAED,sBAAI,sBAAE;aAAN;YACE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;;;OAAA;IAED,sBAAI,wBAAI;aAAR;YACE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;;;OAAA;IAED,sBAAI,yBAAK;aAAT;YACE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;;;OAAA;IAED,sBAAI,+BAAW;aAAf;YACE,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC;QAC3B,CAAC;;;OAAA;IAIH,gEAAgE;IAChD,uBAAgB,GAA9B,UAA+B,IAAW,EAAE,GAAU,EAAE,KAAY;QAClE,MAAM,CAAC,IAAI,MAAM,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC3E,CAAC;IAEH,uBAAuB;IACP,gBAAS,GAAvB,UAAwB,CAAS;QAC/B,MAAM,CAAC,IAAI,MAAM,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC;IAEa,iBAAU,GAAxB,UAAyB,EAAW;QAClC,MAAM,CAAC,IAAI,MAAM,CAAC,mBAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACtD,CAAC;IAGM,uBAAM,GAAb;QACE,MAAM,CAAC,IAAI,CAAC,KAAK,IAAI,mBAAQ,CAAC,SAAS,CAAC;IAC1C,CAAC;IAEM,0BAAS,GAAhB,UAAiB,CAAQ;QACvB,MAAM,CAAC,iBAAO,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACI,6BAAY,GAAnB,UAAoB,CAAQ;QAC1B,qDAAqD;QAErD,MAAM,CAAC,IAAI,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;aACpE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,iDAAiD;IACnD,CAAC;IAEM,wBAAO,GAAd,UAAe,CAAQ;QACrB,MAAM,CAAC,iBAAO,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEM,2BAAU,GAAjB,UAAkB,CAAQ;QACxB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACV,KAAK,CAAC;gBACJ,MAAM,CAAC,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ;YACpE,KAAK,CAAC;gBACJ,MAAM,CAAC,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;YACnE,KAAK,CAAC;gBACJ,MAAM,CAAC,iBAAO,CAAC,GAAG,CAAC,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ;YACjF;gBACE,MAAM,CAAC,iBAAO,CAAC,GAAG,CAAC,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO;QAClF,CAAC;IACH,CAAC;IAGD;;;;;;;;;;;;;OAaG;IACI,0BAAS,GAAhB;QACE,wEAAwE;QACxE,wEAAwE;QAExE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;QACd,CAAC;QAED,yCAAyC;QACzC,oCAAoC;QACpC,IAAM,QAAQ,GAAY,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QACvC,oDAAoD;QACpD,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;QAClC,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC;QAajC,CAAC;QACD,MAAM,CAAC,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACI,0BAAS,GAAhB;QACE,MAAM,CAAC,iBAAO,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IAChD,CAAC;IAEM,6BAAY,GAAnB;QACE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;IAClC,CAAC;IAED;;;;;OAKG;IACI,4BAAW,GAAlB;QACE,IAAM,CAAC,GAAG,IAAI,+BAAc,CAAC,CAAC,CAAC,CAAC;QAChC,IAAM,CAAC,GAAG,IAAI,+BAAc,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC5C,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,mBAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QAEtD,qFAAqF;QACrF,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,aAAa,CAAC;QACnE,IAAI,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,GAAC,MAAM,CAAC,aAAa,GAAG,EAAE,CAAC,CAAA;QAC1D,mEAAmE;QAEnE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,aAAa,CAAC;QACnE,IAAI,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,GAAC,MAAM,CAAC,aAAa,GAAG,EAAE,CAAC,CAAA;QAC1D,sEAAsE;QAEtE,MAAM,CAAC,IAAI,mBAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACW,kBAAW,GAAzB,UAA0B,KAAK;QAC7B,MAAM,CAAC,6BAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,4BAAW,GAAlB;QACE,MAAM,CAAC,6BAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrD,CAAC;IAED;;;;;OAKG;IACK,2BAAU,GAAlB;QAEE,wDAAwD;QACxD,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5B,CAAC;QAED,iEAAiE;QACjE,wEAAwE;QACxE,wEAAwE;QACxE,IAAI,QAAQ,GAAG,iBAAO,CAAC,SAAS,CAC5B,iBAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EACjD,iBAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CACpD,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC;QACf,6CAA6C;QAC7C,oGAAoG;QAEpG,sEAAsE;QACtE,iEAAiE;QACjE,sEAAsE;QACtE,qEAAqE;QACrE,qEAAqE;QACrE,+DAA+D;QAC/D,MAAM,CAAC,QAAQ,GAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,OAAE,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC;IACjF,CAAC;IAEH,EAAE;IACF,MAAM;IACN,iFAAiF;IACjF,+EAA+E;IAC/E,0CAA0C;IAC1C,MAAM;IACG,0BAAS,GAAhB;QACE,IAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IAEH,yEAAyE;IACzE,yDAAyD;IAGhD,4BAAW,GAAlB;QACE,qEAAqE;QACrE,wEAAwE;QACxE,sEAAsE;QACtE,yBAAyB;QACzB,EAAE;QACF,qEAAqE;QACrE,mEAAmE;QACnE,iCAAiC;QAEjC,IAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpD,IAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEpD,IAAI,GAAG,GAAG,IAAI,aAAK,CAAC,iBAAO,CAAC,SAAS,CAAC,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtF,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAC3B,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,MAAM,CAAC,GAAG,CAAC;IACb,CAAC;IAeH,gBAAgB;IAGP,6BAAY,GAAnB;QACE,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YACnB,uEAAuE;YACvE,+DAA+D;YAC/D,iEAAiE;YACjE,mDAAmD;YACnD,EAAE;YACF,oEAAoE;YACpE,wEAAwE;YACxE,uEAAuE;YACvE,uEAAuE;YACvE,wEAAwE;YACxE,wEAAwE;YACxE,IAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,IAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC5C,IAAM,CAAC,GAAG,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACvF,IAAM,CAAC,GAAG,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YAEvF,IAAI,GAAG,GAAG,uBAAU,CAAC,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3F,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,YAAY,CAAC,2BAAY,CAAC,OAAO,EAAE,CAAC,CAAC;YAC1E,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,OAAE,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE,IAAK,CAAC,OAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACrD,MAAM,CAAC,IAAI,2BAAY,CAAC,GAAG,EAAE,uBAAU,CAAC,IAAI,EAAE,CAAC,CAAC;YAClD,CAAC;YACD,IAAI,GAAG,GAAG,uBAAU,CAAC,aAAa,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC7F,MAAM,CAAC,IAAI,2BAAY,CAAC,GAAG,EAAE,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAC/D,CAAC;QAGD,sEAAsE;QACtE,+EAA+E;QAC/E,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAClB,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,2BAAY,CACnB,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,MAAM,EAAE,OAAE,CAAC,MAAM,CAAC,EAAE,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,MAAM,EAAE,OAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YACpF,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,2BAAY,CACnB,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,MAAM,EAAE,OAAE,CAAC,MAAM,CAAC,EAAE,IAAI,uBAAU,CAAC,OAAE,CAAC,MAAM,EAAE,CAAC,GAAG,OAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YACvF,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,2BAAY,CACnB,IAAI,uBAAU,CAAC,MAAM,CAAC,YAAY,EAAE,OAAE,CAAC,MAAM,CAAC,EAAE,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,IAAI,EAAE,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YACzF,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,2BAAY,CACnB,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,MAAM,EAAE,OAAE,CAAC,MAAM,CAAC,EAAE,IAAI,uBAAU,CAAC,CAAC,GAAG,OAAE,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,OAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YAC5F,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,2BAAY,CACnB,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,MAAM,EAAE,OAAE,CAAC,MAAM,CAAC,EAAE,IAAI,uBAAU,CAAC,CAAC,CAAC,GAAG,OAAE,CAAC,MAAM,EAAE,CAAC,OAAE,CAAC,MAAM,CAAC,CAAC,CAAC;YACzF;gBACE,MAAM,CAAC,IAAI,2BAAY,CACnB,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,uBAAU,CAAC,CAAC,OAAE,CAAC,IAAI,EAAE,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC7F,CAAC;IAEH,CAAC;IAGM,6BAAY,GAAnB,UAAoB,IAAW;QAC7B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAEM,yBAAQ,GAAf,UAAgB,CAAS;QACvB,qEAAqE;QACrE,sEAAsE;QACtE,gCAAgC;QAEhC,IAAM,OAAO,GAAG,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,2CAA2C;QAC3C,EAAE,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC;QACf,CAAC;QACD,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;eACnE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrE,CAAC;IAEH,gDAAgD;IAEvC,0BAAS,GAAhB,UAAiB,IAAW;QAC1B,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAEO,qBAAI,GAAZ,UAAa,EAAW;QACtB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAM,EAAE,GAAoB,EAAE,CAAC;QAC/B,IAAM,YAAY,GAAG,IAAI,+BAAc,CAAC,CAAC,CAAC,CAAC;QAE3C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAC3B,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,+BAAc,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QAChE,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,0BAA0B;QAChE,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;QACzB,IAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,mBAAQ,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;QACxD,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAC3B,uDAAuD;YACvD,IAAM,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC;YACjE,IAAM,KAAK,GAAG,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC;YAEnC,IAAM,CAAC,GAAG,CAAC,GAAC,MAAM,CAAC,aAAa,CAAC;YACjC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;YACnD,6DAA6D;YAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAEtD,CAAC;IACH,CAAC;IAGH,iEAAiE;IAEvD,4BAAW,GAAnB,UAAoB,CAAQ,EAAE,CAAQ;QAEpC,IAAM,CAAC,GAAG,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,CAAC,IAAI,CAAC,KAAK,CACb,CAAC,CAAC,CAAC,EACH,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACnC,CAAC;QACF,4DAA4D;IAC9D,CAAC;IAEO,6BAAY,GAApB,UAAqB,CAAQ,EAAE,CAAQ;QACrC,IAAM,CAAC,GAAG,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,CAAC,IAAI,CAAC,KAAK,CACb,CAAC,CAAC,CAAC,EACH,CAAC,CAAC,CAAC,CACN,CAAC;QACF,wBAAwB;IAC1B,CAAC;IAEH,sEAAsE;IACtE,uCAAuC;IAE7B,yBAAQ,GAAhB;QACE,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,GAAG,CAAC;IAC/G,CAAC;IAEM,0BAAS,GAAhB;QACE,IAAM,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;aACrG,GAAG,CAAC,UAAA,CAAC,IAAI,OAAA,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,EAArB,CAAqB,CAAC;aAC/B,GAAG,CAAC,UAAA,CAAC,IAAI,OAAA,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,EAA9B,CAA8B,CAAC,CAAA;QAE7C,oDAAoD;QACpD,MAAM,CAAC;YACL,IAAI,EAAE,SAAS;YACf,QAAQ,EAAE;gBACR,IAAI,EAAC,SAAS;gBACd,WAAW,EAAE,CAAC,MAAM,CAAC;aACtB;YACD,UAAU,EAAE,EAAE;YACd,KAAK,EAAE,WAAS,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,cAAS,IAAI,CAAC,KAAO;SACvD,CAAC;QACF,iDAAiD;QACjD,mBAAmB;IACrB,CAAC;IAxac,oBAAa,GAAG,CAAC,IAAI,mBAAQ,CAAC,SAAS,CAAC;IAkQzD,uEAAuE;IACvE,uEAAuE;IACvE,uEAAuE;IACvE,wEAAwE;IACxE,gHAAgH;IAC/F,gBAAS,GAAG,CAAC,GAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;IAEpE,yEAAyE;IACzE,sEAAsE;IACtE,2DAA2D;IAC3D,2EAA2E;IAC3E,kBAAkB;IACD,mBAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC;IA4J7E,aAAC;AAAD,CAAC,AA3aD,IA2aC;AA3aY,cAAM,SA2alB,CAAA"}

package/dist/S2CellId.d.ts

@@ -1,267 +0,0 @@
-/// <reference types="long" />
-import * as Long from 'long';
-import { S2Point } from "./S2Point";
-import { MutableInteger } from "./MutableInteger";
-import { S2LatLng } from "./S2LatLng";
-/**
- * An S2CellId is a 64-bit unsigned integer that uniquely identifies a cell in
- * the S2 cell decomposition. It has the following format:
- *
- * <pre>
- * id = [face][face_pos]
- * </pre>
- *
- * face: a 3-bit number (range 0..5) encoding the cube face.
- *
- * face_pos: a 61-bit number encoding the position of the center of this cell
- * along the Hilbert curve over this face (see the Wiki pages for details).
- *
- * Sequentially increasing cell ids follow a continuous space-filling curve over
- * the entire sphere. They have the following properties:
- *  - The id of a cell at level k consists of a 3-bit face number followed by k
- * bit pairs that recursively select one of the four children of each cell. The
- * next bit is always 1, and all other bits are 0. Therefore, the level of a
- * cell is determined by the position of its lowest-numbered bit that is turned
- * on (for a cell at level k, this position is 2 * (MAX_LEVEL - k).)
- *  - The id of a parent cell is at the midpoint of the range of ids spanned by
- * its children (or by its descendants at any level).
- *
- * Leaf cells are often used to represent points on the unit sphere, and this
- * class provides methods for converting directly between these two
- * representations. For cells that represent 2D regions rather than discrete
- * point, it is better to use the S2Cell class.
- *
- *
- */
-export declare class S2CellId {
-    static FACE_BITS: number;
-    static NUM_FACES: number;
-    static MAX_LEVEL: number;
-    static POS_BITS: number;
-    static MAX_SIZE: number;
-    private static maxValueDivs;
-    private static maxValueMods;
-    static MAX_UNSIGNED: Long;
-    static LOOKUP_BITS: number;
-    private static SWAP_MASK;
-    private static INVERT_MASK;
-    static LOOKUP_POS: Long[];
-    static LOOKUP_IJ: number[];
-    /**
-     * This is the offset required to wrap around from the beginning of the
-     * Hilbert curve to the end or vice versa; see next_wrap() and prev_wrap().
-     */
-    private static WRAP_OFFSET;
-    id: Long;
-    constructor(id: Long | string);
-    /** Which cube face this cell belongs to, in the range 0..5. */
-    readonly face: number;
-    /** Return the lowest-numbered bit that is on for cells at the given level. */
-    lowestOnBit(): Long;
-    /** The default constructor returns an invalid cell id. */
-    static none(): S2CellId;
-    /**
-     * Returns an invalid cell id guaranteed to be larger than any valid cell id.
-     * Useful for creating indexes.
-     */
-    static sentinel(): S2CellId;
-    private getBits1(i, j, k, bits);
-    /**
-     * Convert (face, si, ti) coordinates (see s2.h) to a direction vector (not
-     * necessarily unit length).
-     */
-    private faceSiTiToXYZ(face, si, ti);
-    static lowestOnBitForLevel(level: number): Long;
-    /**
-     * Return the (face, i, j) coordinates for the leaf cell corresponding to this
-     * cell id. Since cells are represented by the Hilbert curve position at the
-     * center of the cell, the returned (i,j) for non-leaf cells will be a leaf
-     * cell adjacent to the cell center. If "orientation" is non-NULL, also return
-     * the Hilbert curve orientation for the current cell.
-     */
-    toFaceIJOrientation(pi: MutableInteger, pj: MutableInteger, orientation: MutableInteger): number;
-    /**
-     * Return true if this is a leaf cell (more efficient than checking whether
-     * level() == MAX_LEVEL).
-     */
-    isLeaf(): boolean;
-    /**
-     * Return the cell at the previous level or at the given level (which must be
-     * less than or equal to the current level).
-     */
-    parentL(level: number): S2CellId;
-    parent(): S2CellId;
-    /**
-     * Return a cell given its face (range 0..5), 61-bit Hilbert curve position
-     * within that face, and level (range 0..MAX_LEVEL). The given position will
-     * be modified to correspond to the Hilbert curve position at the center of
-     * the returned cell. This is a static function rather than a constructor in
-     * order to give names to the arguments.
-     */
-    static fromFacePosLevel(face: number, pos: Long, level: number): S2CellId;
-    static fromPoint(p: S2Point): S2CellId;
-    toPoint(): S2Point;
-    /**
-     * Return the direction vector corresponding to the center of the given cell.
-     * The vector returned by ToPointRaw is not necessarily unit length.
-     */
-    toPointRaw(): S2Point;
-    /** Return the S2LatLng corresponding to the center of the given cell. */
-    toLatLng(): S2LatLng;
-    /** Return true if id() represents a valid cell. */
-    isValid(): boolean;
-    /**
-     * The position of the cell center along the Hilbert curve over this face, in
-     * the range 0..(2**kPosBits-1).
-     */
-    pos(): Long;
-    /** Return the subdivision level of the cell (range 0..MAX_LEVEL). */
-    level(): number;
-    /**
-     * Return true if this is a top-level face cell (more efficient than checking
-     * whether level() == 0).
-     */
-    isFace(): boolean;
-    /**
-     * Return the child position (0..3) of this cell's ancestor at the given
-     * level, relative to its parent. The argument should be in the range
-     * 1..MAX_LEVEL. For example, child_position(1) returns the position of this
-     * cell's level-1 ancestor within its top-level face cell.
-     */
-    childPosition(level: number): number;
-    rangeMin(): S2CellId;
-    rangeMax(): S2CellId;
-    /** Return true if the given cell is contained within this one. */
-    contains(other: S2CellId): boolean;
-    /** Return true if the given cell intersects this one. */
-    intersects(other: S2CellId): boolean;
-    childBegin(): S2CellId;
-    childBeginL(level: number): S2CellId;
-    childEnd(): S2CellId;
-    childEndL(level: number): S2CellId;
-    /**
-     * Return the next cell at the same level along the Hilbert curve. Works
-     * correctly when advancing from one face to the next, but does *not* wrap
-     * around from the last face to the first or vice versa.
-     */
-    next(): S2CellId;
-    /**
-     * Return the previous cell at the same level along the Hilbert curve. Works
-     * correctly when advancing from one face to the next, but does *not* wrap
-     * around from the last face to the first or vice versa.
-     */
-    prev(): S2CellId;
-    /**
-     * Like next(), but wraps around from the last face to the first and vice
-     * versa. Should *not* be used for iteration in conjunction with
-     * child_begin(), child_end(), Begin(), or End().
-     */
-    nextWrap(): S2CellId;
-    /**
-     * Like prev(), but wraps around from the last face to the first and vice
-     * versa. Should *not* be used for iteration in conjunction with
-     * child_begin(), child_end(), Begin(), or End().
-     */
-    prevWrap(): S2CellId;
-    static begin(level: number): S2CellId;
-    static end(level: number): S2CellId;
-    /**
-     * Decodes the cell id from a compact text string suitable for display or
-     * indexing. Cells at lower levels (i.e. larger cells) are encoded into
-     * fewer characters. The maximum token length is 16.
-     *
-     * @param token the token to decode
-     * @return the S2CellId for that token
-     * @throws NumberFormatException if the token is not formatted correctly
-     */
-    static fromToken(token: string): S2CellId;
-    /**
-     * Encodes the cell id to compact text strings suitable for display or indexing.
-     * Cells at lower levels (i.e. larger cells) are encoded into fewer characters.
-     * The maximum token length is 16.
-     *
-     * Simple implementation: convert the id to hex and strip trailing zeros. We
-     * could use base-32 or base-64, but assuming the cells used for indexing
-     * regions are at least 100 meters across (level 16 or less), the savings
-     * would be at most 3 bytes (9 bytes hex vs. 6 bytes base-64).
-     *
-     * @return the encoded cell id
-     */
-    toToken(): string;
-    /**
-     * Returns true if (current * radix) + digit is a number too large to be
-     * represented by an unsigned long.  This is useful for detecting overflow
-     * while parsing a string representation of a number.
-     * Does not verify whether supplied radix is valid, passing an invalid radix
-     * will give undefined results or an ArrayIndexOutOfBoundsException.
-     */
-    private static overflowInParse(current, digit, radix?);
-    /**
-     * Return the four cells that are adjacent across the cell's four edges.
-     * Neighbors are returned in the order defined by S2Cell::GetEdge. All
-     * neighbors are guaranteed to be distinct.
-     */
-    getEdgeNeighbors(): S2CellId[];
-    /**
-     * Return the neighbors of closest vertex to this cell at the given level, by
-     * appending them to "output". Normally there are four neighbors, but the
-     * closest vertex may only have three neighbors if it is one of the 8 cube
-     * vertices.
-     *
-     * Requires: level < this.evel(), so that we can determine which vertex is
-     * closest (in particular, level == MAX_LEVEL is not allowed).
-     */
-    getVertexNeighbors(level: number): S2CellId[];
-    /**
-     * Append all neighbors of this cell at the given level to "output". Two cells
-     * X and Y are neighbors if their boundaries intersect but their interiors do
-     * not. In particular, two cells that intersect at a single point are
-     * neighbors.
-     *
-     * Requires: nbr_level >= this->level(). Note that for cells adjacent to a
-     * face vertex, the same neighbor may be appended more than once.
-     */
-    getAllNeighbors(nbrLevel: number): S2CellId[];
-    /**
-     * Return a leaf cell given its cube face (range 0..5) and i- and
-     * j-coordinates (see s2.h).
-     */
-    static fromFaceIJ(face: number, i: number, j: number): S2CellId;
-    private static getBits(n, i, j, k, bits);
-    /**
-     * Return the i- or j-index of the leaf cell containing the given s- or
-     * t-value.
-     */
-    private static stToIJ(s);
-    /**
-     * Given (i, j) coordinates that may be out of bounds, normalize them by
-     * returning the corresponding neighbor cell on an adjacent face.
-     */
-    private static fromFaceIJWrap(face, i, j);
-    /**
-     * Public helper function that calls FromFaceIJ if sameFace is true, or
-     * FromFaceIJWrap if sameFace is false.
-     */
-    static fromFaceIJSame(face: number, i: number, j: number, sameFace: boolean): S2CellId;
-    /**
-     * Returns true if x1 < x2, when both values are treated as unsigned.
-     */
-    static unsignedLongLessThan(x1: Long, x2: Long): boolean;
-    /**
-     * Returns true if x1 > x2, when both values are treated as unsigned.
-     */
-    static unsignedLongGreaterThan(x1: Long, x2: Long): boolean;
-    lessThan(x: S2CellId): boolean;
-    greaterThan(x: S2CellId): boolean;
-    lessOrEquals(x: S2CellId): boolean;
-    greaterOrEquals(x: S2CellId): boolean;
-    toString(): string;
-    compareTo(that: S2CellId): number;
-    equals(that: S2CellId): boolean;
-    /**
-     * Returns the position of the id within the given list or a negative value with
-     * the position of the index wher eit should be entered if the id was present
-     */
-    static binarySearch(ids: S2CellId[], _id: Long | string | S2CellId, low?: number): number;
-    static indexedBinarySearch(ids: S2CellId[], id: Long | string | S2CellId, low?: number): number;
-}