nodes2ts 3.0.0 → 4.0.1

package/dist/S2.js

@@ -1,231 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.S2Metric = exports.S2 = void 0;
-const S2Point_1 = require("./S2Point");
-const S2Metric_1 = require("./S2Metric");
-Object.defineProperty(exports, "S2Metric", { enumerable: true, get: function () { return S2Metric_1.S2Metric; } });
-const Platform_1 = require("./Platform");
-const Long = require("long");
-class S2 {
-    static IEEEremainder(f1, f2) {
-        return Platform_1.Platform.IEEEremainder(f1, f2);
-    }
-    /**
-     * Return true if the given point is approximately unit length (this is mainly
-     * useful for assertions).
-     */
-    static isUnitLength(p) {
-        return Math.abs(p.norm2() - 1) <= (1e-15);
-    }
-    /**
-     * If v is non-zero, return an integer {@code exp} such that
-     * {@code (0.5 <= |v|*2^(-exp) < 1)}. If v is zero, return 0.
-     *
-     * <p>Note that this arguably a bad definition of exponent because it makes
-     * {@code exp(9) == 4}. In decimal this would be like saying that the
-     * exponent of 1234 is 4, when in scientific 'exponent' notation 1234 is
-     * {@code 1.234 x 10^3}.
-     *
-     * TODO(dbeaumont): Replace this with "DoubleUtils.getExponent(v) - 1" ?
-     */
-    static exp(v /*double*/) {
-        return Platform_1.Platform.getExponent(v);
-    }
-    /**
-     * Return a vector "c" that is orthogonal to the given unit-length vectors "a"
-     * and "b". This function is similar to a.CrossProd(b) except that it does a
-     * better job of ensuring orthogonality when "a" is nearly parallel to "b",
-     * and it returns a non-zero result even when a == b or a == -b.
-     *
-     *  It satisfies the following properties (RCP == RobustCrossProd):
-     *
-     *  (1) RCP(a,b) != 0 for all a, b (2) RCP(b,a) == -RCP(a,b) unless a == b or
-     * a == -b (3) RCP(-a,b) == -RCP(a,b) unless a == b or a == -b (4) RCP(a,-b)
-     * == -RCP(a,b) unless a == b or a == -b
-     */
-    static robustCrossProd(a, b) {
-        // The direction of a.CrossProd(b) becomes unstable as (a + b) or (a - b)
-        // approaches zero. This leads to situations where a.CrossProd(b) is not
-        // very orthogonal to "a" and/or "b". We could fix this using Gram-Schmidt,
-        // but we also want b.RobustCrossProd(a) == -b.RobustCrossProd(a).
-        //
-        // The easiest fix is to just compute the cross product of (b+a) and (b-a).
-        // Given that "a" and "b" are unit-length, this has good orthogonality to
-        // "a" and "b" even if they differ only in the lowest bit of one component.
-        // assert (isUnitLength(a) && isUnitLength(b));
-        const x = S2Point_1.S2Point.crossProd(S2Point_1.S2Point.add(b, a), S2Point_1.S2Point.sub(b, a));
-        if (!x.equals(new S2Point_1.S2Point(0, 0, 0))) {
-            return x;
-        }
-        // The only result that makes sense mathematically is to return zero, but
-        // we find it more convenient to return an arbitrary orthogonal vector.
-        return a.ortho();
-    }
-    /**
-     * Return the area of triangle ABC. The method used is about twice as
-     * expensive as Girard's formula, but it is numerically stable for both large
-     * and very small triangles. The points do not need to be normalized. The area
-     * is always positive.
-     *
-     *  The triangle area is undefined if it contains two antipodal points, and
-     * becomes numerically unstable as the length of any edge approaches 180
-     * degrees.
-     */
-    static area(a, b, c) {
-        // This method is based on l'Huilier's theorem,
-        //
-        // tan(E/4) = sqrt(tan(s/2) tan((s-a)/2) tan((s-b)/2) tan((s-c)/2))
-        //
-        // where E is the spherical excess of the triangle (i.e. its area),
-        // a, b, c, are the side lengths, and
-        // s is the semiperimeter (a + b + c) / 2 .
-        //
-        // The only significant source of error using l'Huilier's method is the
-        // cancellation error of the terms (s-a), (s-b), (s-c). This leads to a
-        // *relative* error of about 1e-16 * s / min(s-a, s-b, s-c). This compares
-        // to a relative error of about 1e-15 / E using Girard's formula, where E is
-        // the true area of the triangle. Girard's formula can be even worse than
-        // this for very small triangles, e.g. a triangle with a true area of 1e-30
-        // might evaluate to 1e-5.
-        //
-        // So, we prefer l'Huilier's formula unless dmin < s * (0.1 * E), where
-        // dmin = min(s-a, s-b, s-c). This basically includes all triangles
-        // except for extremely long and skinny ones.
-        //
-        // Since we don't know E, we would like a conservative upper bound on
-        // the triangle area in terms of s and dmin. It's possible to show that
-        // E <= k1 * s * sqrt(s * dmin), where k1 = 2*sqrt(3)/Pi (about 1).
-        // Using this, it's easy to show that we should always use l'Huilier's
-        // method if dmin >= k2 * s^5, where k2 is about 1e-2. Furthermore,
-        // if dmin < k2 * s^5, the triangle area is at most k3 * s^4, where
-        // k3 is about 0.1. Since the best case error using Girard's formula
-        // is about 1e-15, this means that we shouldn't even consider it unless
-        // s >= 3e-4 or so.
-        // We use volatile doubles to force the compiler to truncate all of these
-        // quantities to 64 bits. Otherwise it may compute a value of dmin > 0
-        // simply because it chose to spill one of the intermediate values to
-        // memory but not one of the others.
-        const sa = b.angle(c);
-        const sb = c.angle(a);
-        const sc = a.angle(b);
-        const s = sa + (sb) + (sc) * (0.5);
-        // 0.5 * (sa + sb + sc);
-        if (s >= (3e-4)) {
-            // Consider whether Girard's formula might be more accurate.
-            const s2 = s * 2;
-            const dmin = s - Math.max(sa, sb, sc);
-            if (dmin < (s2 * s2 * (s) * (1e-2))) {
-                // This triangle is skinny enough to consider Girard's formula.
-                const area = S2.girardArea(a, b, c);
-                if (dmin < (s * (area * (0.1)))) {
-                    return area;
-                }
-            }
-        }
-        // Use l'Huilier's formula.
-        return 4 * (Math.atan(Math.sqrt(Math.max(0.0, Math.tan(s * (0.5))
-            * (Math.tan(s - (sa) * (0.5)))
-            * (Math.tan(s - (sb) * (0.5)))
-            * (Math.tan(s - (sc) * (0.5)))))));
-    }
-    /**
-     * Return the area of the triangle computed using Girard's formula. This is
-     * slightly faster than the Area() method above is not accurate for very small
-     * triangles.
-     */
-    static girardArea(a, b, c) {
-        // This is equivalent to the usual Girard's formula but is slightly
-        // more accurate, faster to compute, and handles a == b == c without
-        // a special case.
-        const ab = S2Point_1.S2Point.crossProd(a, b);
-        const bc = S2Point_1.S2Point.crossProd(b, c);
-        const ac = S2Point_1.S2Point.crossProd(a, c);
-        return Math.max(0, ab.angle(ac) - ab.angle(bc) + bc.angle(ac));
-    }
-    /**
-     * Return true if the points A, B, C are strictly counterclockwise. Return
-     * false if the points are clockwise or colinear (i.e. if they are all
-     * contained on some great circle).
-     *
-     *  Due to numerical errors, situations may arise that are mathematically
-     * impossible, e.g. ABC may be considered strictly CCW while BCA is not.
-     * However, the implementation guarantees the following:
-     *
-     *  If SimpleCCW(a,b,c), then !SimpleCCW(c,b,a) for all a,b,c.
-     *
-     * In other words, ABC and CBA are guaranteed not to be both CCW
-     */
-    static simpleCCW(a, b, c) {
-        // We compute the signed volume of the parallelepiped ABC. The usual
-        // formula for this is (AxB).C, but we compute it here using (CxA).B
-        // in order to ensure that ABC and CBA are not both CCW. This follows
-        // from the following identities (which are true numerically, not just
-        // mathematically):
-        //
-        // (1) x.CrossProd(y) == -(y.CrossProd(x))
-        // (2) (-x).DotProd(y) == -(x.DotProd(y))
-        return S2Point_1.S2Point.crossProd(c, a).dotProd(b) > 0;
-    }
-    /**
-     *
-     * Return true if edge AB crosses CD at a point that is interior to both
-     * edges. Properties:
-     *
-     *  (1) SimpleCrossing(b,a,c,d) == SimpleCrossing(a,b,c,d) (2)
-     * SimpleCrossing(c,d,a,b) == SimpleCrossing(a,b,c,d)
-     */
-    static simpleCrossing(a, b, c, d) {
-        // We compute SimpleCCW() for triangles ACB, CBD, BDA, and DAC. All
-        // of these triangles need to have the same orientation (CW or CCW)
-        // for an intersection to exist. Note that this is slightly more
-        // restrictive than the corresponding definition for planar edges,
-        // since we need to exclude pairs of line segments that would
-        // otherwise "intersect" by crossing two antipodal points.
-        const ab = S2Point_1.S2Point.crossProd(a, b);
-        const cd = S2Point_1.S2Point.crossProd(c, d);
-        const acb = ab.dotProd(c) * -1;
-        const cbd = cd.dotProd(b) * -1;
-        const bda = ab.dotProd(d);
-        const dac = cd.dotProd(a);
-        return (acb * (cbd) > (0)) && (cbd * (bda) > (0)) && (bda * (dac) > (0));
-    }
-    static approxEqualsPointError(a, b, maxError) {
-        return a.angle(b) <= maxError;
-    }
-    static approxEqualsPoint(a, b) {
-        return this.approxEqualsPointError(a, b, 1e-15);
-    }
-    static approxEqualsNumberError(a, b, maxError) {
-        return Math.abs(a - b) <= maxError;
-    }
-    static approxEqualsNumber(a, b) {
-        return this.approxEqualsNumberError(a, b, 1e-15);
-    }
-}
-exports.S2 = S2;
-S2.M_PI = Math.PI;
-S2.M_1_PI = 1.0 / Math.PI;
-S2.M_PI_2 = Math.PI / 2.0;
-S2.M_PI_4 = Math.PI / 4.0;
-S2.M_SQRT2 = Math.sqrt(2);
-S2.M_E = Math.E;
-// the axis directions are reversed).
-S2.SWAP_MASK = 0x01;
-S2.INVERT_MASK = 0x02;
-// Number of bits in the mantissa of a double.
-S2.EXPONENT_SHIFT = 52;
-// Mask to extract the exponent from a double.
-S2.EXPONENT_MASK = Long.fromString('0x7ff0000000000000', true, 16);
-/** Mapping from cell orientation + Hilbert traversal to IJ-index. */
-S2.POS_TO_ORIENTATION = [S2.SWAP_MASK, 0, 0, S2.INVERT_MASK + S2.SWAP_MASK];
-S2.DBL_EPSILON = 2 * Number.EPSILON;
-S2.POS_TO_IJ = [
-    // 0 1 2 3
-    [0, 1, 3, 2],
-    [0, 2, 3, 1],
-    [3, 2, 0, 1],
-    [3, 1, 0, 2], // swapped & inverted: (1,1), (0,1), (0,0), (1,0)
-];
-S2.MAX_LEVEL = 30;
-S2.Metric = S2Metric_1.S2Metric;
-//# sourceMappingURL=S2.js.map

package/dist/S2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2.js","sourceRoot":"","sources":["../src/S2.ts"],"names":[],"mappings":";;;AAAA,uCAAkC;AAClC,yCAAoC;AA2Q3B,yFA3QD,mBAAQ,OA2QC;AA1QjB,yCAAsC;AAEtC,6BAA8B;AAG9B,MAAa,EAAE;IA6BN,MAAM,CAAC,aAAa,CAAC,EAAS,EAAE,EAAS;QAC9C,OAAO,mBAAQ,CAAC,aAAa,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,YAAY,CAAC,CAAS;QAClC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;;;;;OAUG;IACH,MAAM,CAAC,GAAG,CAAC,CAAQ,CAAC,UAAU;QAC5B,OAAO,mBAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,eAAe,CAAC,CAAS,EAAE,CAAS;QACzC,yEAAyE;QACzE,wEAAwE;QACxE,2EAA2E;QAC3E,kEAAkE;QAClE,EAAE;QACF,2EAA2E;QAC3E,yEAAyE;QACzE,2EAA2E;QAE3E,+CAA+C;QAC/C,MAAM,CAAC,GAAG,iBAAO,CAAC,SAAS,CAAC,iBAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,iBAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YACnC,OAAO,CAAC,CAAC;SACV;QACD,yEAAyE;QACzE,uEAAuE;QACvE,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC;IACnB,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,IAAI,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACzC,+CAA+C;QAC/C,EAAE;QACF,mEAAmE;QACnE,EAAE;QACF,mEAAmE;QACnE,qCAAqC;QACrC,2CAA2C;QAC3C,EAAE;QACF,uEAAuE;QACvE,uEAAuE;QACvE,0EAA0E;QAC1E,4EAA4E;QAC5E,yEAAyE;QACzE,2EAA2E;QAC3E,0BAA0B;QAC1B,EAAE;QACF,uEAAuE;QACvE,mEAAmE;QACnE,6CAA6C;QAC7C,EAAE;QACF,qEAAqE;QACrE,uEAAuE;QACvE,mEAAmE;QACnE,sEAAsE;QACtE,mEAAmE;QACnE,mEAAmE;QACnE,oEAAoE;QACpE,uEAAuE;QACvE,mBAAmB;QAEnB,yEAAyE;QACzE,sEAAsE;QACtE,qEAAqE;QACrE,oCAAoC;QACpC,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,EAAE,GAAE,CAAC,EAAE,CAAC,GAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,wBAAwB;QACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YACf,4DAA4D;YAC5D,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CACjB,EAAE,EACF,EAAE,EACF,EAAE,CACL,CAAC;YACN,IAAI,IAAI,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE;gBACnC,+DAA+D;gBAC/D,MAAM,IAAI,GAAG,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpC,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;oBAC/B,OAAO,IAAI,CAAC;iBACb;aACF;SACF;QACD,2BAA2B;QAC3B,OAAO,CAAC,GAAG,CACH,IAAI,CAAC,IAAI,CACL,IAAI,CAAC,IAAI,CACL,IAAI,CAAC,GAAG,CACJ,GAAG,EACH,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;cACZ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;cAC5B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;cAC5B,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CACtC,CACJ,CACJ,CACJ,CAAA;IACP,CAAC;IAGD;;;;OAIG;IACH,MAAM,CAAC,UAAU,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QAC/C,mEAAmE;QACnE,oEAAoE;QACpE,kBAAkB;QAElB,MAAM,EAAE,GAAG,iBAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,iBAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,iBAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC,GAAG,CACX,CAAC,EACD,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAC7C,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,SAAS,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;QACrD,oEAAoE;QACpE,oEAAoE;QACpE,qEAAqE;QACrE,sEAAsE;QACtE,mBAAmB;QACnB,EAAE;QACF,0CAA0C;QAC1C,yCAAyC;QAEzC,OAAO,iBAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChD,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAE,cAAc,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS;QACtE,mEAAmE;QACnE,mEAAmE;QACnE,gEAAgE;QAChE,kEAAkE;QAClE,6DAA6D;QAC7D,0DAA0D;QAE1D,MAAM,EAAE,GAAG,iBAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnC,MAAM,EAAE,GAAG,iBAAO,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/B,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAE1B,OAAO,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;IAEM,MAAM,CAAC,sBAAsB,CAAC,CAAU,EAAE,CAAU,EAAE,QAAgB;QAC3E,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC;IAChC,CAAC;IAEM,MAAM,CAAC,iBAAiB,CAAC,CAAU,EAAE,CAAU;QACpD,OAAO,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAClD,CAAC;IAEM,MAAM,CAAC,uBAAuB,CAAC,CAAS,EAAE,CAAS,EAAE,QAAgB;QAC1E,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC;IACrC,CAAC;IAEM,MAAM,CAAC,kBAAkB,CAAC,CAAS,EAAE,CAAS;QACnD,OAAO,IAAI,CAAC,uBAAuB,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IACnD,CAAC;;AAhQH,gBAmQC;AAjQe,OAAI,GAAG,IAAI,CAAC,EAAE,CAAC;AACf,SAAM,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;AACvB,SAAM,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;AACvB,SAAM,GAAG,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC;AACvB,UAAO,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AACvB,MAAG,GAAG,IAAI,CAAC,CAAC,CAAC;AAC3B,qCAAqC;AACvB,YAAS,GAAG,IAAI,CAAC;AACjB,cAAW,GAAG,IAAI,CAAC;AAEjC,8CAA8C;AAC/B,iBAAc,GAAG,EAAE,CAAC;AACnC,8CAA8C;AAC/B,gBAAa,GAAG,IAAI,CAAC,UAAU,CAAC,oBAAoB,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;AAC/E,qEAAqE;AACvD,qBAAkB,GAAG,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,WAAW,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;AACzE,cAAW,GAAG,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC;AAEjC,YAAS,GAAG;IACxB,UAAU;IACV,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,iDAAiD;CAChE,CAAC;AACK,YAAS,GAAG,EAAE,CAAC;AAuOf,SAAM,GAAG,mBAAQ,CAAA"}

package/dist/S2Cap.d.ts

@@ -1,122 +0,0 @@
-import { S2Region } from "./S2Region";
-import { S2Point } from "./S2Point";
-import { S1Angle } from "./S1Angle";
-import { S2LatLngRect } from "./S2LatLngRect";
-import { S2Cell } from "./S2Cell";
-import { S1ChordAngle } from "./S1ChordAngle";
-/**
- * This class represents a spherical cap, i.e. a portion of a sphere cut off by
- * a plane. The cap is defined by its axis and height. This representation has
- * good numerical accuracy for very small caps (unlike the (axis,
- * min-distance-from-origin) representation), and is also efficient for
- * containment tests (unlike the (axis, angle) representation).
- *
- * Here are some useful relationships between the cap height (h), the cap
- * opening angle (theta), the maximum chord length from the cap's center (d),
- * and the radius of cap's base (a). All formulas assume a unit radius.
- *
- * h = 1 - cos(theta) = 2 sin^2(theta/2) d^2 = 2 h = a^2 + h^2
- *
- */
-export declare class S2Cap implements S2Region {
-    /**
-     * Multiply a positive number by this constant to ensure that the result of a
-     * floating point operation is at least as large as the true
-     * infinite-precision result.
-     */
-    private static ROUND_UP;
-    axis: S2Point;
-    radius: S1ChordAngle;
-    /**
-     * Create a cap given its axis and the cap height, i.e. the maximum projected
-     * distance along the cap axis from the cap center. 'axis' should be a
-     * unit-length vector.
-     */
-    constructor(axis: S2Point, radius: S1ChordAngle);
-    static fromAxisChord(center: S2Point, radius: S1ChordAngle): S2Cap;
-    /**
-     * Create a cap given its axis and the cap height, i.e. the maximum projected distance along the
-     * cap axis from the cap center. 'axis' should be a unit-length vector.
-     */
-    static fromAxisHeight(axis: S2Point, height: number): S2Cap;
-    /**
-     * Create a cap given its axis and the cap opening angle, i.e. maximum angle
-     * between the axis and a point on the cap. 'axis' should be a unit-length
-     * vector, and 'angle' should be between 0 and 180 degrees.
-     */
-    static fromAxisAngle(axis: S2Point, angle: S1Angle): S2Cap;
-    /**
-     * Create a cap given its axis and its area in steradians. 'axis' should be a unit-length vector,
-     * and 'area' should be between 0 and 4 * M_PI.
-     */
-    static fromAxisArea(axis: S2Point, area: number): S2Cap;
-    /** Return an empty cap, i.e. a cap that contains no points. */
-    static empty(): S2Cap;
-    /** Return a full cap, i.e. a cap that contains all points. */
-    static full(): S2Cap;
-    getCapBound(): S2Cap;
-    height(): number;
-    area(): number;
-    /**
-     * Returns the cap radius as an S1Angle. Since the cap angle is stored internally as an
-     * S1ChordAngle, this method requires a trigonometric operation and may yield a slightly different
-     * result than the value passed to {@link #fromAxisAngle(S2Point, S1Angle)}.
-     */
-    angle(): S1Angle;
-    /**
-     * Returns true if the axis is {@link S2#isUnitLength unit length}, and the angle is less than Pi.
-     *
-     * <p>Negative angles or heights are valid, and represent empty caps.
-     */
-    isValid(): boolean;
-    /** Return true if the cap is empty, i.e. it contains no points. */
-    isEmpty(): boolean;
-    /** Return true if the cap is full, i.e. it contains all points. */
-    isFull(): boolean;
-    /**
-     * Return the complement of the interior of the cap. A cap and its complement have the same
-     * boundary but do not share any interior points. The complement operator is not a bijection,
-     * since the complement of a singleton cap (containing a single point) is the same as the
-     * complement of an empty cap.
-     */
-    complement(): S2Cap;
-    /**
-     * Return true if and only if this cap contains the given other cap (in a set
-     * containment sense, e.g. every cap contains the empty cap).
-     */
-    containsCap(other: S2Cap): boolean;
-    /**
-     * Return true if and only if the interior of this cap intersects the given other cap. (This
-     * relationship is not symmetric, since only the interior of this cap is used.)
-     */
-    interiorIntersects(other: S2Cap): boolean;
-    /**
-     * Return true if and only if the given point is contained in the interior of the region (i.e. the
-     * region excluding its boundary). 'p' should be a unit-length vector.
-     */
-    interiorContains(p: S2Point): boolean;
-    /**
-     * Increase the cap radius if necessary to include the given point. If the cap is empty the axis
-     * is set to the given point, but otherwise it is left unchanged.
-     *
-     * @param p must be {@link S2#isUnitLength unit length}
-     */
-    addPoint(p: S2Point): S2Cap;
-    addCap(other: S2Cap): S2Cap;
-    getRectBound(): S2LatLngRect;
-    mayIntersectC(cell: S2Cell): boolean;
-    /**
-     * Return true if the cap intersects 'cell', given that the cap vertices have
-     * alrady been checked.
-     */
-    intersects(cell: S2Cell, vertices: S2Point[]): boolean;
-    contains(p: S2Point): boolean;
-    containsC(cell: S2Cell): boolean;
-    /**
-     * Return true if the cap axis and height differ by at most "max_error" from
-     * the given cap "other".
-     */
-    approxEquals(other: S2Cap, maxError?: number): boolean;
-    toString(): string;
-    toGEOJSON(): any;
-}