nodes2ts 2.0.0 → 4.0.0

package/dist/S2Metric.d.ts

@@ -1,38 +0,0 @@
-/**
- * Defines an area or a length cell metric.
- */
-export declare class S2Metric {
-    private _dim;
-    private _deriv;
-    /**
-     * Defines a cell metric of the given dimension (1 == length, 2 == area).
-     */
-    constructor(_dim: number, _deriv: number);
-    deriv(): number;
-    dim(): number;
-    /** Return the value of a metric for cells at the given level. */
-    getValue(level: number): number;
-    /**
-     * Return the level at which the metric has approximately the given value.
-     * For example, S2::kAvgEdge.GetClosestLevel(0.1) returns the level at which
-     * the average cell edge length is approximately 0.1. The return value is
-     * always a valid level.
-     */
-    getClosestLevel(value: number): number;
-    /**
-     * Return the minimum level such that the metric is at most the given value,
-     * or S2CellId::kMaxLevel if there is no such level. For example,
-     * S2::kMaxDiag.GetMinLevel(0.1) returns the minimum level such that all
-     * cell diagonal lengths are 0.1 or smaller. The return value is always a
-     * valid level.
-     */
-    getMinLevel(value: number): number;
-    /**
-     * Return the maximum level such that the metric is at least the given
-     * value, or zero if there is no such level. For example,
-     * S2.kMinWidth.GetMaxLevel(0.1) returns the maximum level such that all
-     * cells have a minimum width of 0.1 or larger. The return value is always a
-     * valid level.
-     */
-    getMaxLevel(value: number): number;
-}

package/dist/S2Metric.js

@@ -1,75 +0,0 @@
-"use strict";
-var S2_1 = require("./S2");
-/**
- * Defines an area or a length cell metric.
- */
-var S2Metric = (function () {
-    /**
-     * Defines a cell metric of the given dimension (1 == length, 2 == area).
-     */
-    function S2Metric(_dim, _deriv) {
-        this._dim = _dim;
-        this._deriv = _deriv;
-    }
-    S2Metric.prototype.deriv = function () {
-        return this._deriv;
-    };
-    S2Metric.prototype.dim = function () {
-        return this._dim;
-    };
-    /** Return the value of a metric for cells at the given level. */
-    S2Metric.prototype.getValue = function (level) {
-        var scaleFactor = this.dim() * (1 - level);
-        return this.deriv() * (Math.pow(2, scaleFactor));
-    };
-    /**
-     * Return the level at which the metric has approximately the given value.
-     * For example, S2::kAvgEdge.GetClosestLevel(0.1) returns the level at which
-     * the average cell edge length is approximately 0.1. The return value is
-     * always a valid level.
-     */
-    S2Metric.prototype.getClosestLevel = function (/*double*/ value) {
-        return this.getMinLevel(S2_1.S2.M_SQRT2 * value);
-    };
-    /**
-     * Return the minimum level such that the metric is at most the given value,
-     * or S2CellId::kMaxLevel if there is no such level. For example,
-     * S2::kMaxDiag.GetMinLevel(0.1) returns the minimum level such that all
-     * cell diagonal lengths are 0.1 or smaller. The return value is always a
-     * valid level.
-     */
-    S2Metric.prototype.getMinLevel = function (value /*double*/) {
-        if (value <= 0) {
-            return S2_1.S2.MAX_LEVEL;
-        }
-        // This code is equivalent to computing a floating-point "level"
-        // value and rounding up.
-        var exponent = S2_1.S2.exp(value / ((1 << this.dim()) * this.deriv()));
-        var level = Math.max(0, Math.min(S2_1.S2.MAX_LEVEL, -((exponent - 1) >> (this.dim() - 1))));
-        // assert (level == S2CellId.MAX_LEVEL || getValue(level) <= value);
-        // assert (level == 0 || getValue(level - 1) > value);
-        return level;
-    };
-    /**
-     * Return the maximum level such that the metric is at least the given
-     * value, or zero if there is no such level. For example,
-     * S2.kMinWidth.GetMaxLevel(0.1) returns the maximum level such that all
-     * cells have a minimum width of 0.1 or larger. The return value is always a
-     * valid level.
-     */
-    S2Metric.prototype.getMaxLevel = function (value /*double*/) {
-        if (value <= 0) {
-            return S2_1.S2.MAX_LEVEL;
-        }
-        // This code is equivalent to computing a floating-point "level"
-        // value and rounding down.
-        var exponent = S2_1.S2.exp((1 << this.dim()) * this.deriv() / value);
-        var level = Math.max(0, Math.min(S2_1.S2.MAX_LEVEL, ((exponent - 1) >> (this.dim() - 1))));
-        // assert (level == 0 || getValue(level) >= value);
-        // assert (level == S2CellId.MAX_LEVEL || getValue(level + 1) < value);
-        return level;
-    };
-    return S2Metric;
-}());
-exports.S2Metric = S2Metric;
-//# sourceMappingURL=S2Metric.js.map

package/dist/S2Metric.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2Metric.js","sourceRoot":"","sources":["../src/S2Metric.ts"],"names":[],"mappings":";AAAA,mBAAiB,MAAM,CAAC,CAAA;AACxB;;GAEG;AACH;IAII;;OAEG;IACH,kBAAmB,IAAW,EAAE,MAAa;QACzC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IAEzB,CAAC;IAED,wBAAK,GAAL;QACI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;IACvB,CAAC;IAED,sBAAG,GAAH;QACI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,iEAAiE;IAC1D,2BAAQ,GAAf,UAAgB,KAAY;QACxB,IAAI,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;;;;OAKG;IACI,kCAAe,GAAtB,UAAuB,UAAU,CAAA,KAAY;QACzC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,OAAE,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC;IAChD,CAAC;IAED;;;;;;OAMG;IACI,8BAAW,GAAlB,UAAmB,KAAY,CAAC,UAAU;QACtC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,OAAE,CAAC,SAAS,CAAC;QACxB,CAAC;QAED,gEAAgE;QAChE,yBAAyB;QACzB,IAAI,QAAQ,GAAG,OAAE,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAClE,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAClB,IAAI,CAAC,GAAG,CAAC,OAAE,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,oEAAoE;QACpE,sDAAsD;QACtD,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACI,8BAAW,GAAlB,UAAmB,KAAY,CAAC,UAAU;QACtC,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;YACb,MAAM,CAAC,OAAE,CAAC,SAAS,CAAC;QACxB,CAAC;QAED,gEAAgE;QAChE,2BAA2B;QAC3B,IAAI,QAAQ,GAAG,OAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC;QAChE,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAClB,IAAI,CAAC,GAAG,CAAC,OAAE,CAAC,SAAS,EAAE,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,mDAAmD;QACnD,uEAAuE;QACvE,MAAM,CAAC,KAAK,CAAC;IACjB,CAAC;IACL,eAAC;AAAD,CAAC,AAjFD,IAiFC;AAjFY,gBAAQ,WAiFpB,CAAA"}

package/dist/S2Point.d.ts

@@ -1,43 +0,0 @@
-import { R2Vector } from "./R2Vector";
-/**
- * An S2Point represents a point on the unit sphere as a 3D vector. Usually
- * points are normalized to be unit length, but some methods do not require
- * this.
- *
- */
-export declare class S2Point {
-    x: number;
-    y: number;
-    z: number;
-    constructor(x: number, y: number, z: number);
-    static minus(p1: S2Point, p2: S2Point): S2Point;
-    static neg(p: S2Point): S2Point;
-    norm2(): number;
-    norm(): number;
-    static crossProd(p1: S2Point, p2: S2Point): S2Point;
-    static add(p1: S2Point, p2: S2Point): S2Point;
-    static sub(p1: S2Point, p2: S2Point): S2Point;
-    dotProd(that: S2Point): number;
-    static mul(p: any, m: number): S2Point;
-    static div(p: S2Point, m: number): S2Point;
-    /** return a vector orthogonal to this one */
-    ortho(): S2Point;
-    /** Return the index of the largest component fabs */
-    largestAbsComponent(): number;
-    static fabs(p: S2Point): S2Point;
-    static normalize(p: S2Point): S2Point;
-    axis(axis: number): number;
-    /** Return the angle between two vectors in radians */
-    angle(va: any): number;
-    /**
-     * Compare two vectors, return true if all their components are within a
-     * difference of margin.
-     */
-    aequal(that: S2Point, margin: number): boolean;
-    equals(that: S2Point): boolean;
-    lessThan(vb: S2Point): boolean;
-    compareTo(other: S2Point): number;
-    toFace(): number;
-    toR2Vector(face?: number): R2Vector;
-    toString(): string;
-}

package/dist/S2Point.js

@@ -1,200 +0,0 @@
-/*
- * Copyright 2006 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.
- */
-"use strict";
-var R2Vector_1 = require("./R2Vector");
-///re
-/**
- * An S2Point represents a point on the unit sphere as a 3D vector. Usually
- * points are normalized to be unit length, but some methods do not require
- * this.
- *
- */
-var S2Point = (function () {
-    function S2Point(x, y, z) {
-        this.x = (x);
-        this.y = (y);
-        this.z = (z);
-        // this.y = typeof(y) === 'number'?new Decimal(y):y as Decimal;
-        // this.z = typeof(z) === 'number'?new Decimal(z):z as Decimal;
-    }
-    S2Point.minus = function (p1, p2) {
-        return S2Point.sub(p1, p2);
-    };
-    S2Point.neg = function (p) {
-        return new S2Point(p.x * -1, p.y * -1, p.z * -1);
-    };
-    S2Point.prototype.norm2 = function () {
-        return Math.pow(this.x, 2) + Math.pow(this.y, 2) + Math.pow(this.z, 2);
-    };
-    S2Point.prototype.norm = function () {
-        return Math.sqrt(this.norm2());
-    };
-    S2Point.crossProd = function (p1, p2) {
-        return new S2Point(p1.y * (p2.z) - (p1.z * (p2.y)), p1.z * (p2.x) - (p1.x * (p2.z)), 
-        // p1.z * p2.x - p1.x * p2.z,
-        p1.x * (p2.y) - (p1.y * (p2.x)));
-    };
-    S2Point.add = function (p1, p2) {
-        return new S2Point(p1.x + p2.x, p1.y + p2.y, p1.z + p2.z);
-    };
-    S2Point.sub = function (p1, p2) {
-        return new S2Point(p1.x - p2.x, p1.y - p2.y, p1.z - p2.z);
-    };
-    S2Point.prototype.dotProd = function (that) {
-        return this.x * (that.x) + (this.y * that.y) + (this.z * (that.z));
-    };
-    S2Point.mul = function (p, m) {
-        return new S2Point(m * (p.x), m * (p.y), m * (p.z));
-    };
-    S2Point.div = function (p, m) {
-        return new S2Point(p.x / (m), p.y / (m), p.z / (m));
-    };
-    /** return a vector orthogonal to this one */
-    S2Point.prototype.ortho = function () {
-        var k = this.largestAbsComponent();
-        var temp;
-        if (k == 1) {
-            temp = new S2Point(1, 0, 0);
-        }
-        else if (k == 2) {
-            temp = new S2Point(0, 1, 0);
-        }
-        else {
-            temp = new S2Point(0, 0, 1);
-        }
-        return S2Point.normalize(S2Point.crossProd(this, temp));
-    };
-    /** Return the index of the largest component fabs */
-    S2Point.prototype.largestAbsComponent = function () {
-        var temp = S2Point.fabs(this);
-        if (temp.x > (temp.y)) {
-            if (temp.x > (temp.z)) {
-                return 0;
-            }
-            else {
-                return 2;
-            }
-        }
-        else {
-            if (temp.y > (temp.z)) {
-                return 1;
-            }
-            else {
-                return 2;
-            }
-        }
-    };
-    S2Point.fabs = function (p) {
-        return new S2Point(Math.abs(p.x), Math.abs(p.y), Math.abs(p.z));
-    };
-    S2Point.normalize = function (p) {
-        var norm = p.norm();
-        if (norm != (0)) {
-            norm = 1 / norm;
-        }
-        return S2Point.mul(p, norm);
-    };
-    S2Point.prototype.axis = function (axis) {
-        return (axis == 0) ? this.x : (axis == 1) ? this.y : this.z;
-    };
-    /** Return the angle between two vectors in radians */
-    S2Point.prototype.angle = function (va) {
-        return Math.atan2(S2Point.crossProd(this, va).norm(), this.dotProd(va));
-    };
-    /**
-     * Compare two vectors, return true if all their components are within a
-     * difference of margin.
-     */
-    S2Point.prototype.aequal = function (that, margin) {
-        return this.x - Math.abs(that.x) < (margin) &&
-            this.y - Math.abs(that.y) < (margin) &&
-            this.z - Math.abs(that.z) < (margin);
-    };
-    S2Point.prototype.equals = function (that) {
-        if (!(that instanceof S2Point)) {
-            return false;
-        }
-        return this.x == (that.x) && this.y == (that.y) && this.z == (that.z);
-    };
-    S2Point.prototype.lessThan = function (vb) {
-        if (this.x < (vb.x)) {
-            return true;
-        }
-        if (vb.x < (this.x)) {
-            return false;
-        }
-        if (this.y < (vb.y)) {
-            return true;
-        }
-        if (vb.y < (this.y)) {
-            return false;
-        }
-        if (this.z < (vb.z)) {
-            return true;
-        }
-        return false;
-    };
-    S2Point.prototype.compareTo = function (other) {
-        return (this.lessThan(other) ? -1 : (this.equals(other) ? 0 : 1));
-    };
-    S2Point.prototype.toFace = function () {
-        var face = this.largestAbsComponent();
-        if (this.axis(face) < (0)) {
-            face += 3;
-        }
-        return face;
-    };
-    S2Point.prototype.toR2Vector = function (face) {
-        if (face === void 0) { face = this.toFace(); }
-        var u;
-        var v;
-        switch (face) {
-            case 0:
-                u = this.y / (this.x);
-                v = this.z / (this.x);
-                break;
-            case 1:
-                u = (this.x * -1) / (this.y);
-                v = this.z / (this.y);
-                break;
-            case 2:
-                u = (this.x * -1) / (this.z);
-                v = (this.y * -1) / (this.z);
-                break;
-            case 3:
-                u = this.z / (this.x);
-                v = this.y / (this.x);
-                break;
-            case 4:
-                u = this.z / (this.y);
-                v = (this.x * -1) / (this.y);
-                break;
-            case 5:
-                u = (this.y * -1) / (this.z);
-                v = (this.x * -1) / (this.z);
-                break;
-            default:
-                throw new Error('Invalid face');
-        }
-        return new R2Vector_1.R2Vector(u, v);
-    };
-    S2Point.prototype.toString = function () {
-        return "Point(" + this.x + ", " + this.y + ", " + this.z + ")";
-    };
-    return S2Point;
-}());
-exports.S2Point = S2Point;
-//# sourceMappingURL=S2Point.js.map

package/dist/S2Point.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2Point.js","sourceRoot":"","sources":["../src/S2Point.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;;AAEH,yBAAuB,YAAY,CAAC,CAAA;AAEpC,KAAK;AACL;;;;;GAKG;AACH;IAIE,iBAAY,CAAQ,EAAE,CAAQ,EAAE,CAAQ;QACtC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACb,+DAA+D;QAC/D,+DAA+D;IACjE,CAAC;IAEM,aAAK,GAAZ,UAAa,EAAU,EAAE,EAAU;QACjC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAEM,WAAG,GAAV,UAAW,CAAU;QACnB,MAAM,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC;IAEM,uBAAK,GAAZ;QACE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzE,CAAC;IAEM,sBAAI,GAAX;QACE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;IACjC,CAAC;IAGM,iBAAS,GAAhB,UAAiB,EAAU,EAAE,EAAU;QACrC,MAAM,CAAC,IAAI,OAAO,CACd,EAAE,CAAC,CAAC,GAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAC7B,EAAE,CAAC,CAAC,GAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7B,6BAA6B;QAC7B,EAAE,CAAC,CAAC,GAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAEhC,CAAC;IACJ,CAAC;IAEM,WAAG,GAAV,UAAW,EAAU,EAAE,EAAU;QAC/B,MAAM,CAAC,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAEM,WAAG,GAAV,UAAW,EAAU,EAAE,EAAU;QAC/B,MAAM,CAAC,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAEM,yBAAO,GAAd,UAAe,IAAY;QACzB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IAEa,WAAG,GAAjB,UAAkB,CAAC,EAAE,CAAS;QAC5B,MAAM,CAAC,IAAI,OAAO,CAAC,CAAC,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAG,CAAC,GAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IAEa,WAAG,GAAjB,UAAkB,CAAS,EAAE,CAAQ;QACnC,MAAM,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,6CAA6C;IACtC,uBAAK,GAAZ;QACE,IAAI,CAAC,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC;QACT,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACX,IAAI,GAAG,IAAI,OAAO,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,IAAI,GAAG,IAAI,OAAO,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QAAC,IAAI,CAAC,CAAC;YACN,IAAI,GAAG,IAAI,OAAO,CAAC,CAAC,EAAC,CAAC,EAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAC1D,CAAC;IAED,qDAAqD;IAC9C,qCAAmB,GAA1B;QACE,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACtB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,CAAC,CAAC,CAAC;YACX,CAAC;YAAC,IAAI,CAAC,CAAC;gBACN,MAAM,CAAC,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QAAC,IAAI,CAAC,CAAC;YACN,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtB,MAAM,CAAC,CAAC,CAAC;YACX,CAAC;YAAC,IAAI,CAAC,CAAC;gBACN,MAAM,CAAC,CAAC,CAAC;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAEa,YAAI,GAAlB,UAAmB,CAAS;QAC1B,MAAM,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;IAEa,iBAAS,GAAvB,UAAwB,CAAS;QAC/B,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAEpB,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,IAAI,GAAG,CAAC,GAAC,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,sBAAI,GAAJ,UAAK,IAAW;QACd,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,sDAAsD;IAC/C,uBAAK,GAAZ,UAAa,EAAE;QACb,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;;OAGG;IACH,wBAAM,GAAN,UAAO,IAAY,EAAE,MAAa;QAChC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;YACnC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;YACpC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/C,CAAC;IAED,wBAAM,GAAN,UAAO,IAAY;QACjB,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,YAAY,OAAO,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,KAAK,CAAC;QACf,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;IAEM,0BAAQ,GAAf,UAAgB,EAAU;QACxB,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;QACd,CAAC;QACD,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC;QACf,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;QACd,CAAC;QACD,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC;QACf,CAAC;QACD,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;QACd,CAAC;QACD,MAAM,CAAC,KAAK,CAAC;IACf,CAAC;IAEM,2BAAS,GAAhB,UAAiB,KAAa;QAC5B,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpE,CAAC;IAGD,wBAAM,GAAN;QACE,IAAI,IAAI,GAAG,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACtC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,IAAI,CAAC,CAAC;QACZ,CAAC;QACD,MAAM,CAAC,IAAI,CAAC;IACd,CAAC;IAED,4BAAU,GAAV,UAAW,IAA2B;QAA3B,oBAA2B,GAA3B,OAAc,IAAI,CAAC,MAAM,EAAE;QACpC,IAAI,CAAC,CAAC;QACN,IAAI,CAAC,CAAC;QACN,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,KAAK,CAAC;gBACJ,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtB,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtB,KAAK,CAAC;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtB,KAAK,CAAC;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,KAAK,CAAC;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtB,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtB,KAAK,CAAC;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACtB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,KAAK,CAAC;YACR,KAAK,CAAC;gBACJ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC7B,KAAK,CAAC;YACR;gBACE,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;QACpC,CAAC;QACD,MAAM,CAAC,IAAI,mBAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,CAAC;IAGD,0BAAQ,GAAR;QACE,MAAM,CAAC,WAAS,IAAI,CAAC,CAAC,UAAK,IAAI,CAAC,CAAC,UAAK,IAAI,CAAC,CAAC,MAAG,CAAC;IAClD,CAAC;IACH,cAAC;AAAD,CAAC,AAxMD,IAwMC;AAxMY,eAAO,UAwMnB,CAAA"}

package/dist/S2Projections.d.ts

@@ -1,67 +0,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.
- *
- */
-import { S2Metric } from "./S2";
-import { S2Point } from "./S2Point";
-export declare enum Projections {
-    S2_LINEAR_PROJECTION = 0,
-    S2_TAN_PROJECTION = 1,
-    S2_QUADRATIC_PROJECTION = 2,
-}
-export declare class S2Projections {
-    static MIN_WIDTH: S2Metric;
-    static AVG_AREA: S2Metric;
-    static getUNorm(face: number, u: number): S2Point;
-    static getVNorm(face: number, v: number): S2Point;
-    static getUAxis(face: number): S2Point;
-    static getVAxis(face: number): S2Point;
-    static faceUvToXyz(face: number, u: number, v: number): S2Point;
-}

package/dist/S2Projections.js

@@ -1,152 +0,0 @@
-/*
- * 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.
- */
-"use strict";
-/**
- * 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.
- *
- */
-var S2_1 = require("./S2");
-var S2Point_1 = require("./S2Point");
-var R2Vector_1 = require("./R2Vector");
-(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";
-})(exports.Projections || (exports.Projections = {}));
-var Projections = exports.Projections;
-var S2Projections = (function () {
-    function S2Projections() {
-    }
-    S2Projections.getUNorm = function (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);
-        }
-    };
-    S2Projections.getVNorm = function (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);
-        }
-    };
-    S2Projections.getUAxis = function (face) {
-        switch (face) {
-            case 0:
-                return new S2Point_1.S2Point(0, 1, 0);
-            case 1:
-                return new S2Point_1.S2Point(-1, 0, 0);
-            case 2:
-                return new S2Point_1.S2Point(-1, 0, 0);
-            case 3:
-                return new S2Point_1.S2Point(0, 0, -1);
-            case 4:
-                return new S2Point_1.S2Point(0, 0, -1);
-            default:
-                return new S2Point_1.S2Point(0, 1, 0);
-        }
-    };
-    S2Projections.getVAxis = function (face) {
-        switch (face) {
-            case 0:
-                return new S2Point_1.S2Point(0, 0, 1);
-            case 1:
-                return new S2Point_1.S2Point(0, 0, 1);
-            case 2:
-                return new S2Point_1.S2Point(0, -1, 0);
-            case 3:
-                return new S2Point_1.S2Point(0, -1, 0);
-            case 4:
-                return new S2Point_1.S2Point(1, 0, 0);
-            default:
-                return new S2Point_1.S2Point(1, 0, 0);
-        }
-    };
-    S2Projections.faceUvToXyz = function (face, u, v) {
-        return new R2Vector_1.R2Vector(u, v).toPoint(face);
-    };
-    S2Projections.MIN_WIDTH = new S2_1.S2Metric(1, S2_1.S2.M_SQRT2 / 3);
-    S2Projections.AVG_AREA = new S2_1.S2Metric(2, S2_1.S2.M_PI / 6); // 0.524)
-    return S2Projections;
-}());
-exports.S2Projections = S2Projections;
-//# 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,mBAA2B,MAAM,CAAC,CAAA;AAClC,wBAAsB,WAAW,CAAC,CAAA;AAClC,yBAAuB,YAAY,CAAC,CAAA;AACpC,WAAY,WAAW;IACrB,6EAAoB,CAAA;IAAE,uEAAiB,CAAA;IAAE,mFAAuB,CAAA;AAClE,CAAC,EAFW,mBAAW,KAAX,mBAAW,QAEtB;AAFD,IAAY,WAAW,GAAX,mBAEX,CAAA;AACD;IAAA;IA6EA,CAAC;IAxEe,sBAAQ,GAAtB,UAAuB,IAAW,EAAE,CAAS;QAC3C,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B;gBACE,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAEa,sBAAQ,GAAtB,UAAuB,IAAW,EAAE,CAAQ;QAC1C,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAChC,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B;gBACE,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAGc,sBAAQ,GAAvB,UAAwB,IAAW;QACjC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YAC/B;gBACE,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAEa,sBAAQ,GAAtB,UAAuB,IAAW;QAChC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC/B,KAAK,CAAC;gBACJ,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B;gBACE,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAEa,yBAAW,GAAzB,UAA0B,IAAY,EAAE,CAAQ,EAAE,CAAQ;QACxD,MAAM,CAAC,IAAI,mBAAQ,CAAC,CAAC,EAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IA1Ea,uBAAS,GAAE,IAAI,aAAQ,CAAC,CAAC,EAAC,OAAE,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;IAC1C,sBAAQ,GAAG,IAAI,aAAQ,CAAC,CAAC,EAAE,OAAE,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;IA0ElE,oBAAC;AAAD,CAAC,AA7ED,IA6EC;AA7EY,qBAAa,gBA6EzB,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,17 +0,0 @@
-/*
- * 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.
- */
-"use strict";
-//# 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"}