nodes2ts 3.0.0 → 4.0.1

package/dist/S2Cell.js

@@ -1,358 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.S2Cell = void 0;
-const Long = require("long");
-const S2CellId_1 = require("./S2CellId");
-const S2Point_1 = require("./S2Point");
-const S2LatLng_1 = require("./S2LatLng");
-const S2Projections_1 = require("./S2Projections");
-const S2_1 = require("./S2");
-const S2LatLngRect_1 = require("./S2LatLngRect");
-const R1Interval_1 = require("./R1Interval");
-const S1Interval_1 = require("./S1Interval");
-const S2Cap_1 = require("./S2Cap");
-class S2Cell {
-    constructor(cellID) {
-        this.cellID = cellID;
-        if (cellID != null) {
-            this.init(cellID);
-        }
-    }
-    get id() {
-        return this.cellID;
-    }
-    static fromFace(face) {
-        return new S2Cell(S2CellId_1.S2CellId.fromFace(face));
-    }
-    // This is a static method in order to provide named parameters.
-    static fromFacePosLevel(face, pos, level) {
-        return new S2Cell(S2CellId_1.S2CellId.fromFacePosLevel(face, new Long(pos), level));
-    }
-    // Convenience methods.
-    static fromPoint(p) {
-        return new S2Cell(S2CellId_1.S2CellId.fromPoint(p));
-    }
-    static fromLatLng(ll) {
-        return new S2Cell(S2CellId_1.S2CellId.fromPoint(ll.toPoint()));
-    }
-    isLeaf() {
-        return this._level == S2CellId_1.S2CellId.MAX_LEVEL;
-    }
-    getVertex(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.
-     */
-    getVertexRaw(k) {
-        // Vertices are returned in the order SW, SE, NE, NW.
-        return S2Projections_1.S2Projections.faceUvToXyz(this._face, ((k >> 1) ^ (k & 1)) == 0 ? this.uMin : this.uMax, (k >> 1) == 0 ? this.vMin : this.vMax);
-    }
-    getEdge(k) {
-        return S2Point_1.S2Point.normalize(this.getEdgeRaw(k));
-    }
-    getEdgeRaw(k) {
-        switch (k) {
-            case 0:
-                return S2Projections_1.S2Projections.getVNorm(this._face, this.vMin); // South
-            case 1:
-                return S2Projections_1.S2Projections.getUNorm(this._face, this.uMax); // East
-            case 2:
-                return S2Point_1.S2Point.neg(S2Projections_1.S2Projections.getVNorm(this._face, this.vMax)); // North
-            default:
-                return S2Point_1.S2Point.neg(S2Projections_1.S2Projections.getUNorm(this._face, this.uMin)); // 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.
-     */
-    subdivide() {
-        // 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.id.isLeaf()) {
-            return null;
-        }
-        const children = new Array(4);
-        for (let i = 0; i < 4; ++i) {
-            children[i] = new S2Cell();
-        }
-        // Create four children with the appropriate bounds.
-        let id = this.id.childBegin();
-        const mid = this.getCenterUV();
-        const uMid = mid.x;
-        const vMid = mid.y;
-        for (let pos = 0; pos < 4; ++pos, id = id.next()) {
-            const child = children[pos];
-            child._face = this.face;
-            child._level = this.level + 1;
-            child._orientation = this.orientation ^ S2_1.S2.POS_TO_ORIENTATION[pos];
-            child.cellID = id;
-            // We want to split the cell in half in "u" and "v".  To decide which
-            // side to set equal to the midpoint value, we look at cell's (i,j)
-            // position within its parent.  The index for "i" is in bit 1 of ij.
-            const ij = S2_1.S2.POS_TO_IJ[this.orientation][pos];
-            // The dimension 0 index (i/u) is in bit 1 of ij.
-            if ((ij & 0x2) != 0) {
-                child.uMin = uMid;
-                child.uMax = this.uMax;
-            }
-            else {
-                child.uMin = this.uMin;
-                child.uMax = uMid;
-            }
-            // The dimension 1 index (j/v) is in bit 0 of ij.
-            if ((ij & 0x1) != 0) {
-                child.vMin = vMid;
-                child.vMax = this.vMax;
-            }
-            else {
-                child.vMin = this.vMin;
-                child.vMax = vMid;
-            }
-        }
-        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.
-     */
-    getCenter() {
-        return S2Point_1.S2Point.normalize(this.getCenterRaw());
-    }
-    getCenterRaw() {
-        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
-     */
-    getCenterUV() {
-        return this.cellID.getCenterUV();
-    }
-    /**
-     * 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.
-     */
-    static averageArea(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.
-     */
-    averageArea() {
-        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.
-     */
-    approxArea() {
-        // 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.
-        const 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).
-    //  */
-    exactArea() {
-        const v0 = this.getVertex(0);
-        const v1 = this.getVertex(1);
-        const v2 = this.getVertex(2);
-        const 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):
-    getCapBound() {
-        // 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).
-        const uv = this.getCenterUV();
-        const center = S2Point_1.S2Point.normalize(S2Projections_1.S2Projections.faceUvToXyz(this._face, uv.x, uv.y));
-        let cap = S2Cap_1.S2Cap.fromAxisHeight(center, 0);
-        for (let k = 0; k < 4; ++k) {
-            cap = cap.addPoint(this.getVertex(k));
-        }
-        return cap;
-    }
-    // 35.26 degrees
-    getPoint(i, j) {
-        return S2Projections_1.S2Projections.faceUvToXyz(this._face, i == 0 ? this.uMin : this.uMax, j == 0 ? this.vMin : this.vMax);
-    }
-    getRectBound() {
-        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.
-            const u = this.uMin + this.uMax;
-            const v = this.vMin + this.vMax;
-            const i = S2Projections_1.S2Projections.getUAxis(this._face).z == 0 ? (u < 0 ? 1 : 0) : (u > 0 ? 1 : 0);
-            const j = S2Projections_1.S2Projections.getVAxis(this._face).z == 0 ? (v < 0 ? 1 : 0) : (v > 0 ? 1 : 0);
-            const lat = R1Interval_1.R1Interval.fromPointPair(S2LatLng_1.S2LatLng.latitude(this.getPoint(i, j)).radians, S2LatLng_1.S2LatLng.latitude(this.getPoint(1 - i, 1 - j)).radians);
-            const lng = S1Interval_1.S1Interval.fromPointPair(S2LatLng_1.S2LatLng.longitude(this.getPoint(i, 1 - j)).radians, S2LatLng_1.S2LatLng.longitude(this.getPoint(1 - i, j)).radians);
-            // DBL_EPSILON
-            return new S2LatLngRect_1.S2LatLngRect(lat, lng)
-                .expanded(S2LatLng_1.S2LatLng.fromRadians(S2_1.S2.DBL_EPSILON, S2_1.S2.DBL_EPSILON))
-                .polarClosure();
-        }
-        // 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));
-        }
-    }
-    mayIntersectC(cell) {
-        return this.cellID.intersects(cell.cellID);
-    }
-    contains(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.
-        const uvPoint = S2Projections_1.S2Projections.faceXyzToUv(this._face, p);
-        if (uvPoint == null) {
-            return false;
-        }
-        return (uvPoint.x >= this.uMin
-            && uvPoint.x <= this.uMax
-            && uvPoint.y >= this.vMin
-            && uvPoint.y <= this.vMax);
-    }
-    // The point 'p' does not need to be normalized.
-    containsC(cell) {
-        return this.cellID.contains(cell.cellID);
-    }
-    init(id) {
-        this.cellID = id;
-        this._face = id.face;
-        const ijo = id.toIJOrientation();
-        this._orientation = S2CellId_1.S2CellId.getOrientation(ijo);
-        this._level = id.level();
-        const i = S2CellId_1.S2CellId.getI(ijo);
-        const j = S2CellId_1.S2CellId.getJ(ijo);
-        const cellSize = id.getSizeIJ();
-        this.uMin = S2Projections_1.S2Projections.ijToUV(i, cellSize);
-        this.uMax = S2Projections_1.S2Projections.ijToUV(i + cellSize, cellSize);
-        this.vMin = S2Projections_1.S2Projections.ijToUV(j, cellSize);
-        this.vMax = S2Projections_1.S2Projections.ijToUV(j + cellSize, cellSize);
-        // for (let d = 0; d < 2; ++d) {
-        //   // Compute the cell bounds in scaled (i,j) coordinates.
-        //   const sijLo = (ij[d].val & -cellSize) * 2 - S2Cell.MAX_CELL_SIZE;
-        //   const sijHi = sijLo + cellSize * 2;
-        //   const s = 1/S2Cell.MAX_CELL_SIZE;
-        //   this._uv[d][0] = R2Vector.singleStTOUV(s * (sijLo))
-        //   //S2Projections.stToUV((1.0 / S2Cell.MAX_CELL_SIZE) * sijLo);
-        //   this._uv[d][1] = R2Vector.singleStTOUV(s * (sijHi));
-        //   //S2Projections.stToUV((1.0 / S2Cell.MAX_CELL_SIZE) * sijHi);
-        // }
-    }
-    get face() {
-        return this._face;
-    }
-    get orientation() {
-        return this._orientation;
-    }
-    get level() {
-        return this._level;
-    }
-    // Return the latitude or longitude of the cell vertex given by (i,j),
-    // where "i" and "j" are either 0 or 1.
-    toString() {
-        return "[" + this._face + ", " + this._level + ", " + this.orientation + ", " + this.cellID + "]";
-    }
-    toGEOJSON() {
-        const coords = [this.getVertex(0), this.getVertex(1), this.getVertex(2), this.getVertex(3), this.getVertex(0)]
-            .map(v => S2LatLng_1.S2LatLng.fromPoint(v))
-            .map(v => ([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;
-    }
-}
-exports.S2Cell = S2Cell;
-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;
-//# 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,6BAA8B;AAC9B,yCAAoC;AACpC,uCAAkC;AAClC,yCAAoC;AACpC,mDAA8C;AAE9C,6BAAwB;AACxB,iDAA4C;AAC5C,6CAAwC;AACxC,6CAAwC;AACxC,mCAA8B;AAC9B,MAAa,MAAM;IAYjB,YAAoB,MAAgB;QAAhB,WAAM,GAAN,MAAM,CAAU;QAClC,IAAI,MAAM,IAAI,IAAI,EAAE;YAClB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;SAClB;IACH,CAAC;IAED,IAAI,EAAE;QACJ,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAGM,MAAM,CAAC,QAAQ,CAAC,IAAY;QACjC,OAAO,IAAI,MAAM,CAAC,mBAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7C,CAAC;IAEH,gEAAgE;IACvD,MAAM,CAAC,gBAAgB,CAAC,IAAW,EAAE,GAAU,EAAE,KAAY;QAClE,OAAO,IAAI,MAAM,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC3E,CAAC;IAEH,uBAAuB;IACd,MAAM,CAAC,SAAS,CAAC,CAAS;QAC/B,OAAO,IAAI,MAAM,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC;IAEM,MAAM,CAAC,UAAU,CAAC,EAAW;QAClC,OAAO,IAAI,MAAM,CAAC,mBAAQ,CAAC,SAAS,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IACtD,CAAC;IAGM,MAAM;QACX,OAAO,IAAI,CAAC,MAAM,IAAI,mBAAQ,CAAC,SAAS,CAAC;IAC3C,CAAC;IAEM,SAAS,CAAC,CAAQ;QACvB,OAAO,iBAAO,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,CAAQ;QAC1B,qDAAqD;QACrD,OAAO,6BAAa,CAAC,WAAW,CAC9B,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1G,CAAC;IAEM,OAAO,CAAC,CAAQ;QACrB,OAAO,iBAAO,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEM,UAAU,CAAC,CAAQ;QACxB,QAAQ,CAAC,EAAE;YACT,KAAK,CAAC;gBACJ,OAAO,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ;YAChE,KAAK,CAAC;gBACJ,OAAO,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO;YAC/D,KAAK,CAAC;gBACJ,OAAO,iBAAO,CAAC,GAAG,CAAC,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ;YAC7E;gBACE,OAAO,iBAAO,CAAC,GAAG,CAAC,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO;SAC7E;IACH,CAAC;IAGD;;;;;;;;;;;;;OAaG;IACI,SAAS;QACd,wEAAwE;QACxE,wEAAwE;QAExE,IAAI,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE;YACpB,OAAO,IAAI,CAAC;SACb;QAED,MAAM,QAAQ,GAAY,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,MAAM,EAAE,CAAC;SAC5B;QAED,oDAAoD;QACpD,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,UAAU,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;QACnB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;QAEnB,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,EAAE;YAChD,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC5B,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC9B,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,GAAG,OAAE,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YACnE,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC;YAClB,qEAAqE;YACrE,mEAAmE;YACnE,oEAAoE;YACpE,MAAM,EAAE,GAAG,OAAE,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC;YAC/C,iDAAiD;YACjD,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE;gBACnB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;gBAClB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;aACxB;iBAAM;gBACL,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACvB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;aACnB;YACD,iDAAiD;YACjD,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE;gBACnB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;gBAClB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;aACxB;iBAAM;gBACL,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACvB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;aACnB;SACF;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;;;OAMG;IACI,SAAS;QACd,OAAO,iBAAO,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IAChD,CAAC;IAEM,YAAY;QACjB,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;IAClC,CAAC;IAED;;;;;OAKG;IACI,WAAW;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;IACnC,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,WAAW,CAAC,KAAK;QAC7B,OAAO,6BAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACI,WAAW;QAChB,OAAO,6BAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtD,CAAC;IAED;;;;;OAKG;IACK,UAAU;QAEhB,wDAAwD;QACxD,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YACnB,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;SAC3B;QAED,iEAAiE;QACjE,wEAAwE;QACxE,wEAAwE;QACxE,MAAM,QAAQ,GAAG,iBAAO,CAAC,SAAS,CAC9B,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,OAAO,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,SAAS;QACd,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7B,OAAO,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,WAAW;QAChB,qEAAqE;QACrE,wEAAwE;QACxE,sEAAsE;QACtE,yBAAyB;QACzB,EAAE;QACF,qEAAqE;QACrE,mEAAmE;QACnE,iCAAiC;QACjC,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,iBAAO,CAAC,SAAS,CAAC,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpF,IAAI,GAAG,GAAG,aAAK,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;SACvC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAeH,gBAAgB;IAGN,QAAQ,CAAC,CAAS,EAAE,CAAS;QACnC,OAAO,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/G,CAAC;IAEM,YAAY;QACjB,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;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,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAChC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAChC,MAAM,CAAC,GAAG,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACxF,MAAM,CAAC,GAAG,6BAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAExF,MAAM,GAAG,GAAG,uBAAU,CAAC,aAAa,CAChC,mBAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAC9C,mBAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAE5D,MAAM,GAAG,GAAG,uBAAU,CAAC,aAAa,CAC5B,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,EACnD,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAG7D,cAAc;YACd,OAAO,IAAI,2BAAY,CAAC,GAAG,EAAE,GAAG,CAAC;iBAC5B,QAAQ,CAAC,mBAAQ,CAAC,WAAW,CAAC,OAAE,CAAC,WAAW,EAAE,OAAE,CAAC,WAAW,CAAC,CAAC;iBAC9D,YAAY,EAAE,CAAC;SACrB;QAGD,sEAAsE;QACtE,+EAA+E;QAC/E,QAAQ,IAAI,CAAC,KAAK,EAAE;YAClB,KAAK,CAAC;gBACJ,OAAO,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,OAAO,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,OAAO,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,OAAO,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,OAAO,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,OAAO,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;SAC5F;IAEH,CAAC;IAGM,aAAa,CAAC,IAAW;QAC9B,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;IAEM,QAAQ,CAAC,CAAS;QACvB,qEAAqE;QACrE,sEAAsE;QACtE,gCAAgC;QAEhC,MAAM,OAAO,GAAG,6BAAa,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACzD,IAAI,OAAO,IAAI,IAAI,EAAE;YACnB,OAAO,KAAK,CAAC;SACd;QACD,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI;eACvB,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI;eACtB,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI;eACtB,OAAO,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAEH,gDAAgD;IAEvC,SAAS,CAAC,IAAW;QAC1B,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAEO,IAAI,CAAC,EAAW;QACtB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,IAAI,CAAA;QAEpB,MAAM,GAAG,GAAG,EAAE,CAAC,eAAe,EAAE,CAAC;QAEjC,IAAI,CAAC,YAAY,GAAG,mBAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;QAEzB,MAAM,CAAC,GAAG,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,CAAC,GAAG,mBAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,EAAE,CAAC,SAAS,EAAE,CAAC;QAEhC,IAAI,CAAC,IAAI,GAAG,6BAAa,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,GAAG,6BAAa,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACzD,IAAI,CAAC,IAAI,GAAG,6BAAa,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,GAAG,6BAAa,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEzD,gCAAgC;QAChC,4DAA4D;QAC5D,sEAAsE;QACtE,wCAAwC;QAExC,sCAAsC;QACtC,wDAAwD;QACxD,kEAAkE;QAClE,yDAAyD;QACzD,kEAAkE;QAClE,IAAI;IACN,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAGH,sEAAsE;IACtE,uCAAuC;IAE9B,QAAQ;QACb,OAAO,GAAG,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;IACpG,CAAC;IAEM,SAAS;QACd,MAAM,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,CAAC,CAAC,EAAE,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;aAC/B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QAE7C,oDAAoD;QACpD,OAAO;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,SAAS,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,SAAS,IAAI,CAAC,MAAM,EAAE;SACxD,CAAC;QACF,iDAAiD;QACjD,mBAAmB;IACrB,CAAC;;AA1aH,wBA4aC;AA3agB,oBAAa,GAAG,CAAC,IAAI,mBAAQ,CAAC,SAAS,CAAC;AA4PzD,uEAAuE;AACvE,uEAAuE;AACvE,uEAAuE;AACvE,wEAAwE;AACxE,gHAAgH;AAC/F,gBAAS,GAAG,CAAC,GAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;AAEpE,yEAAyE;AACzE,sEAAsE;AACtE,2DAA2D;AAC3D,2EAA2E;AAC3E,kBAAkB;AACD,mBAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,SAAS,CAAC"}

package/dist/S2CellId.d.ts

@@ -1,290 +0,0 @@
-import * as Long from 'long';
-import { S2Point } from "./S2Point";
-import { R2Vector } from "./R2Vector";
-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.Long;
-    static LOOKUP_BITS: number;
-    private static SWAP_MASK;
-    private static INVERT_MASK;
-    private static I_SHIFT;
-    private static J_SHIFT;
-    private static J_MASK;
-    private static SI_SHIFT;
-    private static ORIENTATION_MASK;
-    private static TI_MASK;
-    static LOOKUP_POS: Long.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. */
-    get face(): number;
-    /** Return the lowest-numbered bit that is on for cells at the given level. */
-    lowestOnBit(): Long;
-    static lowestOnBit(id: Long): 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;
-    static lowestOnBitForLevel(level: number): Long;
-    /**
-     * @deprecated use `toIJOrientation` instead
-     * 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;
-    toIJOrientation(): Long;
-    getI(): number;
-    static getI(ijo: Long): number;
-    getJ(): number;
-    static getJ(ijo: Long): number;
-    static getOrientation(ijo: Long): 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 fromFace(face: number): S2CellId;
-    static fromPoint(p: S2Point): S2CellId;
-    getCenterUV(): R2Vector;
-    toPoint(): S2Point;
-    getCenterSiTi(): Long;
-    static getSi(center: Long): number;
-    static getTi(center: Long): number;
-    /**
-     * 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;
-    getSizeIJ(): number;
-    static getSizeIJ(level: number): number;
-    getSizeST(): number;
-    static getSizeST(level: number): 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;
-    private static childBeginAsLong;
-    private static childBeginAsLongL;
-    private static childEndAsLong;
-    private static childEndAsLongL;
-    private static fromFaceAsLong;
-    /**
-     * 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;
-    /**
-     * 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;
-    /**
-     * Return the i- or j-index of the leaf cell containing the given s- or
-     * t-value.
-     */
-    private static stToIJ;
-    /**
-     * 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;
-    /**
-     * 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;
-}