nodes2ts 3.0.0 → 4.0.1

package/dist/S2Projections.js

@@ -1,331 +0,0 @@
-"use strict";
-/*
- * Copyright 2005 Google Inc.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.S2Projections = void 0;
-/**
- * This class specifies the details of how the cube faces are projected onto the
- * unit sphere. This includes getting the face ordering and orientation correct
- * so that sequentially increasing cell ids follow a continuous space-filling
- * curve over the entire sphere, and defining the transformation from cell-space
- * to cube-space (see s2.h) in order to make the cells more uniform in size.
- *
- *
- *  We have implemented three different projections from cell-space (s,t) to
- * cube-space (u,v): linear, quadratic, and tangent. They have the following
- * tradeoffs:
- *
- *  Linear - This is the fastest transformation, but also produces the least
- * uniform cell sizes. Cell areas vary by a factor of about 5.2, with the
- * largest cells at the center of each face and the smallest cells in the
- * corners.
- *
- *  Tangent - Transforming the coordinates via atan() makes the cell sizes more
- * uniform. The areas vary by a maximum ratio of 1.4 as opposed to a maximum
- * ratio of 5.2. However, each call to atan() is about as expensive as all of
- * the other calculations combined when converting from points to cell ids, i.e.
- * it reduces performance by a factor of 3.
- *
- *  Quadratic - This is an approximation of the tangent projection that is much
- * faster and produces cells that are almost as uniform in size. It is about 3
- * times faster than the tangent projection for converting cell ids to points,
- * and 2 times faster for converting points to cell ids. Cell areas vary by a
- * maximum ratio of about 2.1.
- *
- *  Here is a table comparing the cell uniformity using each projection. "Area
- * ratio" is the maximum ratio over all subdivision levels of the largest cell
- * area to the smallest cell area at that level, "edge ratio" is the maximum
- * ratio of the longest edge of any cell to the shortest edge of any cell at the
- * same level, and "diag ratio" is the ratio of the longest diagonal of any cell
- * to the shortest diagonal of any cell at the same level. "ToPoint" and
- * "FromPoint" are the times in microseconds required to convert cell ids to and
- * from points (unit vectors) respectively.
- *
- *  Area Edge Diag ToPoint FromPoint Ratio Ratio Ratio (microseconds)
- * ------------------------------------------------------- Linear: 5.200 2.117
- * 2.959 0.103 0.123 Tangent: 1.414 1.414 1.704 0.290 0.306 Quadratic: 2.082
- * 1.802 1.932 0.116 0.161
- *
- *  The worst-case cell aspect ratios are about the same with all three
- * projections. The maximum ratio of the longest edge to the shortest edge
- * within the same cell is about 1.4 and the maximum ratio of the diagonals
- * within the same cell is about 1.7.
- *
- * This data was produced using s2cell_unittest and s2cellid_unittest.
- *
- */
-const S2_1 = require("./S2");
-const S2CellId_1 = require("./S2CellId");
-const S2Point_1 = require("./S2Point");
-const R2Vector_1 = require("./R2Vector");
-const Long = require("long");
-var Projections;
-(function (Projections) {
-    Projections[Projections["S2_LINEAR_PROJECTION"] = 0] = "S2_LINEAR_PROJECTION";
-    Projections[Projections["S2_TAN_PROJECTION"] = 1] = "S2_TAN_PROJECTION";
-    Projections[Projections["S2_QUADRATIC_PROJECTION"] = 2] = "S2_QUADRATIC_PROJECTION";
-})(Projections || (Projections = {}));
-class S2Projections {
-    static getUNorm(face, u) {
-        switch (face) {
-            case 0:
-                return new S2Point_1.S2Point(u, -1, 0);
-            case 1:
-                return new S2Point_1.S2Point(1, u, 0);
-            case 2:
-                return new S2Point_1.S2Point(1, 0, u);
-            case 3:
-                return new S2Point_1.S2Point(-u, 0, 1);
-            case 4:
-                return new S2Point_1.S2Point(0, -u, 1);
-            default:
-                return new S2Point_1.S2Point(0, -1, -u);
-        }
-    }
-    static getVNorm(face, v) {
-        switch (face) {
-            case 0:
-                return new S2Point_1.S2Point(-v, 0, 1);
-            case 1:
-                return new S2Point_1.S2Point(0, -v, 1);
-            case 2:
-                return new S2Point_1.S2Point(0, -1, -v);
-            case 3:
-                return new S2Point_1.S2Point(v, -1, 0);
-            case 4:
-                return new S2Point_1.S2Point(1, v, 0);
-            default:
-                return new S2Point_1.S2Point(1, 0, v);
-        }
-    }
-    static getUAxis(face) {
-        return S2Projections.getUVWAxis(face, 0);
-    }
-    static getVAxis(face) {
-        return S2Projections.getUVWAxis(face, 1);
-    }
-    static getNorm(face) {
-        return S2Projections.getUVWAxis(face, 2);
-    }
-    /** Returns the given axis of the given face (u=0, v=1, w=2). */
-    static getUVWAxis(face, axis) {
-        return S2Projections.FACE_UVW_AXES[face][axis];
-    }
-    /**
-     * Convert (face, si, ti) coordinates (see s2.h) to a direction vector (not
-     * necessarily unit length).
-     */
-    static faceSiTiToXYZ(face, si, ti) {
-        const u = R2Vector_1.R2Vector.singleStTOUV(this.siTiToSt(si));
-        const v = R2Vector_1.R2Vector.singleStTOUV(this.siTiToSt(ti));
-        return this.faceUvToXyz(face, u, v);
-    }
-    static faceUvToXyz(face, u, v) {
-        const t = this.faceToXyzTransform(face);
-        return new S2Point_1.S2Point(t.uvToX(u, v), t.uvToY(u, v), t.uvToZ(u, v));
-    }
-    static faceXyzToUv(face, p) {
-        if (face < 3) {
-            if (p.get(face) <= 0) {
-                return null;
-            }
-        }
-        else {
-            if (p.get(face - 3) >= 0) {
-                return null;
-            }
-        }
-        return S2Projections.validFaceXyzToUv(face, p);
-    }
-    static validFaceXyzToUv(face, p) {
-        const t = S2Projections.faceToUvTransform(face);
-        return new R2Vector_1.R2Vector(t.xyzToU(p.x, p.y, p.z), t.xyzToV(p.x, p.y, p.z));
-    }
-    static ijToStMin(i) {
-        // assert (i >= 0 && i <= S2CellId.MAX_SIZE);
-        return (1.0 / S2CellId_1.S2CellId.MAX_SIZE) * i;
-    }
-    static stToIj(s) {
-        return Math.max(0, Math.min(S2CellId_1.S2CellId.MAX_SIZE - 1, Math.round(S2CellId_1.S2CellId.MAX_SIZE * s - 0.5)));
-    }
-    static siTiToSt(si) {
-        return 1.0 / this.MAX_SITI.toNumber() * si;
-    }
-    static ijToUV(ij, cellSize) {
-        return R2Vector_1.R2Vector.singleStTOUV(S2Projections.ijToStMin(ij & -cellSize));
-    }
-    static xyzToFaceP(p) {
-        return this.xyzToFace(p.x, p.y, p.z);
-    }
-    static xyzToFace(x, y, z) {
-        switch (S2Point_1.S2Point.largestAbsComponent(x, y, z)) {
-            case 0:
-                return (x < 0) ? 3 : 0;
-            case 1:
-                return (y < 0) ? 4 : 1;
-            default:
-                return (z < 0) ? 5 : 2;
-        }
-    }
-    static faceToUvTransform(face) {
-        return S2Projections.UV_TRANSFORMS[face];
-    }
-    static faceToXyzTransform(face) {
-        // We map illegal face indices to the largest face index to preserve legacy behavior, i.e., we
-        // do not (yet) want to throw an index out of bounds exception. Note that S2CellId.face() is
-        // guaranteed to return a non-negative face index even for invalid S2 cells, so it is sufficient
-        // to just map all face indices greater than 5 to a face index of 5.
-        //
-        // TODO(bjj): Remove this legacy behavior.
-        return S2Projections.XYZ_TRANSFORMS[Math.min(5, face)];
-    }
-}
-exports.S2Projections = S2Projections;
-S2Projections.MIN_WIDTH = new S2_1.S2Metric(1, 2 * S2_1.S2.M_SQRT2 / 3); // 0.943
-S2Projections.AVG_AREA = new S2_1.S2Metric(2, 4 * S2_1.S2.M_PI / 6); // ~2.094
-S2Projections.MAX_LEVEL = 30;
-S2Projections.FACE_UVW_AXES = [
-    [S2Point_1.S2Point.Y_POS, S2Point_1.S2Point.Z_POS, S2Point_1.S2Point.X_POS],
-    [S2Point_1.S2Point.X_NEG, S2Point_1.S2Point.Z_POS, S2Point_1.S2Point.Y_POS],
-    [S2Point_1.S2Point.X_NEG, S2Point_1.S2Point.Y_NEG, S2Point_1.S2Point.Z_POS],
-    [S2Point_1.S2Point.Z_NEG, S2Point_1.S2Point.Y_NEG, S2Point_1.S2Point.X_NEG],
-    [S2Point_1.S2Point.Z_NEG, S2Point_1.S2Point.X_POS, S2Point_1.S2Point.Y_NEG],
-    [S2Point_1.S2Point.Y_POS, S2Point_1.S2Point.X_POS, S2Point_1.S2Point.Z_NEG]
-];
-S2Projections.UV_TRANSFORMS = [
-    {
-        xyzToU: function xyzToU(x, y, z) {
-            return y / x;
-        },
-        xyzToV: function xyzToV(x, y, z) {
-            return z / x;
-        },
-    },
-    {
-        xyzToU: function xyzToU(x, y, z) {
-            return -x / y;
-        },
-        xyzToV: function xyzToV(x, y, z) {
-            return z / y;
-        },
-    },
-    {
-        xyzToU: function xyzToU(x, y, z) {
-            return -x / z;
-        },
-        xyzToV: function xyzToV(x, y, z) {
-            return -y / z;
-        },
-    },
-    {
-        xyzToU: function xyzToU(x, y, z) {
-            return z / x;
-        },
-        xyzToV: function xyzToV(x, y, z) {
-            return y / x;
-        },
-    },
-    {
-        xyzToU: function xyzToU(x, y, z) {
-            return z / y;
-        },
-        xyzToV: function xyzToV(x, y, z) {
-            return -x / y;
-        },
-    },
-    {
-        xyzToU: function xyzToU(x, y, z) {
-            return -y / z;
-        },
-        xyzToV: function xyzToV(x, y, z) {
-            return -x / z;
-        },
-    }
-];
-S2Projections.XYZ_TRANSFORMS = [
-    {
-        uvToX: function uvToX(u, v) {
-            return 1;
-        },
-        uvToY: function uvToY(u, v) {
-            return u;
-        },
-        uvToZ: function uvToZ(u, v) {
-            return v;
-        },
-    },
-    {
-        uvToX: function uvToX(u, v) {
-            return -u;
-        },
-        uvToY: function uvToY(u, v) {
-            return 1;
-        },
-        uvToZ: function uvToZ(u, v) {
-            return v;
-        },
-    },
-    {
-        uvToX: function uvToX(u, v) {
-            return -u;
-        },
-        uvToY: function uvToY(u, v) {
-            return -v;
-        },
-        uvToZ: function uvToZ(u, v) {
-            return 1;
-        },
-    },
-    {
-        uvToX: function uvToX(u, v) {
-            return -1;
-        },
-        uvToY: function uvToY(u, v) {
-            return -v;
-        },
-        uvToZ: function uvToZ(u, v) {
-            return -u;
-        },
-    },
-    {
-        uvToX: function uvToX(u, v) {
-            return v;
-        },
-        uvToY: function uvToY(u, v) {
-            return -1;
-        },
-        uvToZ: function uvToZ(u, v) {
-            return -u;
-        },
-    },
-    {
-        uvToX: function uvToX(u, v) {
-            return v;
-        },
-        uvToY: function uvToY(u, v) {
-            return u;
-        },
-        uvToZ: function uvToZ(u, v) {
-            return -1;
-        },
-    }
-];
-/**
- * The maximum value of an si- or ti-coordinate. The range of valid (si,ti) values is
- * [0..MAX_SiTi].
- */
-S2Projections.MAX_SITI = Long.fromInt(1).shiftLeft(S2Projections.MAX_LEVEL + 1);
-//# sourceMappingURL=S2Projections.js.map

package/dist/S2Projections.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2Projections.js","sourceRoot":"","sources":["../src/S2Projections.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;AAGH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkDG;AACH,6BAAoC;AACpC,yCAAsC;AACtC,uCAAoC;AACpC,yCAAsC;AAEtC,6BAA8B;AAE9B,IAAK,WAEJ;AAFD,WAAK,WAAW;IACd,6EAAoB,CAAA;IAAE,uEAAiB,CAAA;IAAE,mFAAuB,CAAA;AAClE,CAAC,EAFI,WAAW,KAAX,WAAW,QAEf;AAgBD,MAAa,aAAa;IAgLjB,MAAM,CAAC,QAAQ,CAAC,IAAY,EAAE,CAAS;QAC5C,QAAQ,IAAI,EAAE;YACZ,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B;gBACE,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SACjC;IACH,CAAC;IAEM,MAAM,CAAC,QAAQ,CAAC,IAAY,EAAE,CAAS;QAC5C,QAAQ,IAAI,EAAE;YACZ,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B;gBACE,OAAO,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;SAC/B;IACH,CAAC;IAEM,MAAM,CAAC,QAAQ,CAAC,IAAY;QACjC,OAAO,aAAa,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC;IAEM,MAAM,CAAC,QAAQ,CAAC,IAAY;QACjC,OAAO,aAAa,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC;IAEM,MAAM,CAAC,OAAO,CAAC,IAAY;QAChC,OAAO,aAAa,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,gEAAgE;IAChE,MAAM,CAAC,UAAU,CAAC,IAAY,EAAE,IAAY;QAC1C,OAAO,aAAa,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;IACjD,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,aAAa,CAAC,IAAY,EAAE,EAAU,EAAE,EAAU;QAC9D,MAAM,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,GAAG,mBAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnD,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACrC,CAAC;IAEM,MAAM,CAAC,WAAW,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS;QAC1D,MAAM,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAA;QACvC,OAAO,IAAI,iBAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;IAEM,MAAM,CAAC,WAAW,CAAC,IAAY,EAAE,CAAU;QAChD,IAAI,IAAI,GAAG,CAAC,EAAE;YACZ,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBACpB,OAAO,IAAI,CAAC;aACb;SACF;aAAM;YACL,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE;gBACxB,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,aAAa,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC;IAEM,MAAM,CAAC,gBAAgB,CAAC,IAAY,EAAE,CAAU;QACrD,MAAM,CAAC,GAAG,aAAa,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAChD,OAAO,IAAI,mBAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IAEM,MAAM,CAAC,SAAS,CAAC,CAAS;QAC/B,6CAA6C;QAC7C,OAAO,CAAC,GAAG,GAAG,mBAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACvC,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,CAAS;QAC5B,OAAO,IAAI,CAAC,GAAG,CACb,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAQ,CAAC,QAAQ,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,mBAAQ,CAAC,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjF,CAAC;IAEM,MAAM,CAAC,QAAQ,CAAC,EAAU;QAC/B,OAAO,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC;IAC7C,CAAC;IAEM,MAAM,CAAC,MAAM,CAAC,EAAU,EAAE,QAAgB;QAC/C,OAAO,mBAAQ,CAAC,YAAY,CAAC,aAAa,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,MAAM,CAAC,UAAU,CAAC,CAAU;QAC1B,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IACtC,CAAC;IAED,MAAM,CAAC,SAAS,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAC9C,QAAQ,iBAAO,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;YAC5C,KAAK,CAAC;gBACJ,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,CAAC;gBACJ,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB;gBACE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC1B;IACH,CAAC;IAEM,MAAM,CAAC,iBAAiB,CAAC,IAAY;QAC1C,OAAO,aAAa,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAEM,MAAM,CAAC,kBAAkB,CAAC,IAAY;QAC3C,8FAA8F;QAC9F,4FAA4F;QAC5F,gGAAgG;QAChG,oEAAoE;QACpE,EAAE;QACF,0CAA0C;QAC1C,OAAO,aAAa,CAAC,cAAc,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACzD,CAAC;;AAlTH,sCAmTC;AAjTe,uBAAS,GAAG,IAAI,aAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,OAAE,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ;AACzD,sBAAQ,GAAG,IAAI,aAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,OAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;AACtD,uBAAS,GAAG,EAAE,CAAC;AAEd,2BAAa,GAAgB;IAC1C,CAAC,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,CAAC;IAC7C,CAAC,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,CAAC;IAC7C,CAAC,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,CAAC;IAC7C,CAAC,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,CAAC;IAC7C,CAAC,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,CAAC;IAC7C,CAAC,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,EAAE,iBAAO,CAAC,KAAK,CAAC;CAC9C,CAAC;AAEa,2BAAa,GAAkB;IAC5C;QACE,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QAED,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;KACF;IAED;QACE,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QAED,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;KACF;IAED;QACE,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QAED,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;KACF;IAED;QACE,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QAED,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;KACF;IAED;QACE,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QAED,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;KACF;IAED;QACE,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;QAED,MAAM,EAAE,SAAS,MAAM,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;YACrD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;QAChB,CAAC;KACF;CACF,CAAC;AAEa,4BAAc,GAAmB;IAC9C;QACE,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;KACF;IACD;QACE,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;KACF;IACD;QACE,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;KACF;IACD;QACE,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;KACF;IACD;QACE,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;KACF;IACD;QACE,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC;QACX,CAAC;QAGD,KAAK,EAAE,SAAS,KAAK,CAAC,CAAS,EAAE,CAAS;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;KACF;CACF,CAAC;AAEF;;;GAGG;AACW,sBAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,SAAS,GAAG,CAAC,CAAC,CAAA"}

package/dist/S2Region.d.ts

@@ -1,31 +0,0 @@
-import { S2Cell } from "./S2Cell";
-import { S2Cap } from "./S2Cap";
-/**
- * An S2Region represents a two-dimensional region over the unit sphere. It is
- * an abstract interface with various concrete subtypes.
- *
- *  The main purpose of this interface is to allow complex regions to be
- * approximated as simpler regions. So rather than having a wide variety of
- * virtual methods that are implemented by all subtypes, the interface is
- * restricted to methods that are useful for computing approximations.
- *
- *
- */
-export interface S2Region {
-    /** Return a bounding spherical cap. */
-    getCapBound(): S2Cap;
-    /** Return a bounding latitude-longitude rectangle. */
-    getRectBound(): any;
-    /**
-     * If this method returns true, the region completely contains the given cell.
-     * Otherwise, either the region does not contain the cell or the containment
-     * relationship could not be determined.
-     */
-    containsC(cell: S2Cell): boolean;
-    /**
-     * If this method returns false, the region does not intersect the given cell.
-     * Otherwise, either region intersects the cell, or the intersection
-     * relationship could not be determined.
-     */
-    mayIntersectC(cell: S2Cell): boolean;
-}

package/dist/S2Region.js

@@ -1,18 +0,0 @@
-"use strict";
-/*
- * Copyright 2005 Google Inc.
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=S2Region.js.map

package/dist/S2Region.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2Region.js","sourceRoot":"","sources":["../src/S2Region.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG"}

package/dist/S2RegionCoverer.d.ts

@@ -1,186 +0,0 @@
-import { S2Region } from "./S2Region";
-import { S2CellId } from "./S2CellId";
-import { S2CellUnion } from "./S2CellUnion";
-import { S2Point } from "./S2Point";
-/**
- * An S2RegionCoverer is a class that allows arbitrary regions to be
- * approximated as unions of cells (S2CellUnion). This is useful for
- * implementing various sorts of search and precomputation operations.
- *
- * Typical usage: {@code S2RegionCoverer coverer; coverer.setMaxCells(5); S2Cap
- * cap = S2Cap.fromAxisAngle(...); S2CellUnion covering;
- * coverer.getCovering(cap, covering); * }
- *
- * This yields a cell union of at most 5 cells that is guaranteed to cover the
- * given cap (a disc-shaped region on the sphere).
- *
- *  The approximation algorithm is not optimal but does a pretty good job in
- * practice. The output does not always use the maximum number of cells allowed,
- * both because this would not always yield a better approximation, and because
- * max_cells() is a limit on how much work is done exploring the possible
- * covering as well as a limit on the final output size.
- *
- *  One can also generate interior coverings, which are sets of cells which are
- * entirely contained within a region. Interior coverings can be empty, even for
- * non-empty regions, if there are no cells that satisfy the provided
- * constraints and are contained by the region. Note that for performance
- * reasons, it is wise to specify a max_level when computing interior coverings
- * - otherwise for regions with small or zero area, the algorithm may spend a
- * lot of time subdividing cells all the way to leaf level to try to find
- * contained cells.
- *
- *  This class is thread-unsafe. Simultaneous calls to any of the getCovering
- * methods will conflict and produce unpredictable results.
- *
- */
-export declare class S2RegionCoverer {
-    /**
-     * By default, the covering uses at most 8 cells at any level. This gives a
-     * reasonable tradeoff between the number of cells used and the accuracy of
-     * the approximation (see table below).
-     */
-    static DEFAULT_MAX_CELLS: number;
-    private static FACE_CELLS;
-    private minLevel;
-    private maxLevel;
-    private levelMod;
-    private maxCells;
-    private interiorCovering;
-    private candidatesCreatedCounter;
-    /**
-     * We save a temporary copy of the pointer passed to GetCovering() in order to
-     * avoid passing this parameter around internally. It is only used (and only
-     * valid) for the duration of a single GetCovering() call.
-     */
-    protected region: S2Region;
-    /**
-     * A temporary variable used by GetCovering() that holds the cell ids that
-     * have been added to the covering so far.
-     */
-    protected result: S2CellId[];
-    /**
-     * We keep the candidates in a priority queue. We specify a vector to hold the
-     * queue entries since for some reason priority_queue<> uses a deque by
-     * default.
-     */
-    private candidateQueue;
-    /**
-     * Default constructor, sets all fields to default values.
-     */
-    constructor();
-    /**
-     * Sets the minimum level to be used.
-     */
-    setMinLevel(minLevel: number): S2RegionCoverer;
-    /**
-     * Sets the maximum level to be used.
-     */
-    setMaxLevel(maxLevel: number): S2RegionCoverer;
-    /**
-     * If specified, then only cells where (level - min_level) is a multiple of
-     * "level_mod" will be used (default 1). This effectively allows the branching
-     * factor of the S2CellId hierarchy to be increased. Currently the only
-     * parameter values allowed are 1, 2, or 3, corresponding to branching factors
-     * of 4, 16, and 64 respectively.
-     */
-    setLevelMod(levelMod: number): S2RegionCoverer;
-    /**
-     * Sets the maximum desired number of cells in the approximation (defaults to
-     * kDefaultMaxCells). Note the following:
-     *
-     * <ul>
-     * <li>For any setting of max_cells(), up to 6 cells may be returned if that
-     * is the minimum number of cells required (e.g. if the region intersects all
-     * six face cells). Up to 3 cells may be returned even for very tiny convex
-     * regions if they happen to be located at the intersection of three cube
-     * faces.
-     *
-     * <li>For any setting of max_cells(), an arbitrary number of cells may be
-     * returned if min_level() is too high for the region being approximated.
-     *
-     * <li>If max_cells() is less than 4, the area of the covering may be
-     * arbitrarily large compared to the area of the original region even if the
-     * region is convex (e.g. an S2Cap or S2LatLngRect).
-     * </ul>
-     *
-     * Accuracy is measured by dividing the area of the covering by the area of
-     * the original region. The following table shows the median and worst case
-     * values for this area ratio on a test case consisting of 100,000 spherical
-     * caps of random size (generated using s2regioncoverer_unittest):
-     *
-     * <pre>
-     * max_cells: 3 4 5 6 8 12 20 100 1000
-     * median ratio: 5.33 3.32 2.73 2.34 1.98 1.66 1.42 1.11 1.01
-     * worst case: 215518 14.41 9.72 5.26 3.91 2.75 1.92 1.20 1.02
-     * </pre>
-     */
-    setMaxCells(maxCells: number): S2RegionCoverer;
-    getMinLevel(): number;
-    getMaxLevel(): number;
-    getMaxCells(): number;
-    getLevelMod(): number;
-    /**
-     * Computes a list of cell ids that covers the given region and satisfies the
-     * various restrictions specified above.
-     *
-     * @param region The region to cover
-     * @param covering The list filled in by this method
-     */
-    getCoveringCells(region: S2Region): S2CellId[];
-    /**
-     * Computes a list of cell ids that is contained within the given region and
-     * satisfies the various restrictions specified above.
-     *
-     * @param region The region to fill
-     * @param interior The list filled in by this method
-     */
-    getInteriorCoveringCells(region: S2Region): S2CellId[];
-    /**
-     * Return a normalized cell union that covers the given region and satisfies
-     * the restrictions *EXCEPT* for min_level() and level_mod(). These criteria
-     * cannot be satisfied using a cell union because cell unions are
-     * automatically normalized by replacing four child cells with their parent
-     * whenever possible. (Note that the list of cell ids passed to the cell union
-     * constructor does in fact satisfy all the given restrictions.)
-     */
-    getCoveringUnion(region: S2Region, covering?: S2CellUnion): S2CellUnion;
-    /**
-     * Return a normalized cell union that is contained within the given region
-     * and satisfies the restrictions *EXCEPT* for min_level() and level_mod().
-     */
-    getInteriorCoveringUnion(region: S2Region, covering?: S2CellUnion): S2CellUnion;
-    /**
-     * Given a connected region and a starting point, return a set of cells at the given level that
-     * cover the region.
-     */
-    static getSimpleCovering(region: S2Region, start: S2Point, level: number): S2CellId[];
-    /**
-     * If the cell intersects the given region, return a new candidate with no
-     * children, otherwise return null. Also marks the candidate as "terminal" if
-     * it should not be expanded further.
-     */
-    private newCandidate;
-    /** Return the log base 2 of the maximum number of children of a candidate. */
-    private maxChildrenShift;
-    /**
-     * Process a candidate by either adding it to the result list or expanding its
-     * children and inserting it into the priority queue. Passing an argument of
-     * NULL does nothing.
-     */
-    private addCandidate;
-    /**
-     * Populate the children of "candidate" by expanding the given number of
-     * levels from the given cell. Returns the number of children that were marked
-     * "terminal".
-     */
-    private expandChildren;
-    /** Computes a set of initial candidates that cover the given region. */
-    private getInitialCandidates;
-    /** Generates a covering and stores it in result. */
-    private getCoveringInternal;
-    /**
-     * Given a region and a starting cell, return the set of all the edge-connected cells at the same
-     * level that intersect "region". The output cells are returned in arbitrary order.
-     */
-    private static floodFill;
-}