nodes2ts 3.0.0 → 4.0.1

package/dist/S1Interval.js

@@ -1,398 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.S1Interval = void 0;
-const Interval_1 = require("./Interval");
-const S2_1 = require("./S2");
-const Platform_1 = require("./Platform");
-class S1Interval extends Interval_1.Interval {
-    constructor(lo, hi, checked = false) {
-        super(lo, hi);
-        if (!checked) {
-            if (this.lo == (-S2_1.S2.M_PI) && this.hi != (S2_1.S2.M_PI)) {
-                this.lo = (S2_1.S2.M_PI);
-            }
-            if (this.hi == (-S2_1.S2.M_PI) && this.lo != (S2_1.S2.M_PI)) {
-                this.hi = (S2_1.S2.M_PI);
-            }
-        }
-    }
-    /**
-     * An interval is valid if neither bound exceeds Pi in absolute value, and the
-     * value -Pi appears only in the Empty() and Full() intervals.
-     */
-    isValid() {
-        return Math.abs(this.lo) <= (S2_1.S2.M_PI) && Math.abs(this.hi) <= (S2_1.S2.M_PI)
-            && !(this.lo == (-S2_1.S2.M_PI) && this.hi != (S2_1.S2.M_PI))
-            && !(this.hi == (-S2_1.S2.M_PI) && this.lo != (S2_1.S2.M_PI));
-        // return (Math.abs(this.lo) <= S2.M_PI && Math.abs(this.hi) <= S2.M_PI
-        // && !(this.lo == -S2.M_PI && this.hi != S2.M_PI) && !(this.hi == -S2.M_PI && this.lo != S2.M_PI));
-    }
-    /** Return true if the interval contains all points on the unit circle. */
-    isFull() {
-        // console.log(this.hi - (this.lo) == (2 * S2.M_PI));
-        return this.hi - (this.lo) == (2 * S2_1.S2.M_PI);
-    }
-    /** Return true if the interval is empty, i.e. it contains no points. */
-    isEmpty() {
-        return this.lo - (this.hi) == (2 * S2_1.S2.M_PI);
-    }
-    /* Return true if this.lo > this.hi. (This is true for empty intervals.) */
-    isInverted() {
-        return this.lo > (this.hi);
-    }
-    /**
-     * Return the midpoint of the interval. For full and empty intervals, the
-     * result is arbitrary.
-     */
-    getCenter() {
-        const center = (this.lo + this.hi) / 2;
-        // let center = 0.5 * (this.lo + this.hi);
-        if (!this.isInverted()) {
-            return center;
-        }
-        // Return the center in the range (-Pi, Pi].
-        return (center <= (0)) ? (center + (S2_1.S2.M_PI)) : (center - (S2_1.S2.M_PI));
-    }
-    /**
-     * Return the length of the interval. The length of an empty interval is
-     * negative.
-     */
-    getLength() {
-        let length = this.hi - (this.lo);
-        if (length >= (0)) {
-            return length;
-        }
-        length = length + (2 * S2_1.S2.M_PI);
-        // Empty intervals have a negative length.
-        return (length > (0)) ? length : (-1);
-    }
-    /**
-     * Return the complement of the interior of the interval. An interval and its
-     * complement have the same boundary but do not share any interior values. The
-     * complement operator is not a bijection, since the complement of a singleton
-     * interval (containing a single value) is the same as the complement of an
-     * empty interval.
-     */
-    complement() {
-        if (this.lo == (this.hi)) {
-            return S1Interval.full(); // Singleton.
-        }
-        return new S1Interval(this.hi, this.lo, true); // Handles
-        // empty and
-        // full.
-    }
-    /** Return true if the interval (which is closed) contains the point 'p'. */
-    contains(_p) {
-        let p = (_p);
-        // Works for empty, full, and singleton intervals.
-        // assert (Math.abs(p) <= S2.M_PI);
-        if (p == (-S2_1.S2.M_PI)) {
-            p = (S2_1.S2.M_PI);
-        }
-        return this.fastContains(p);
-    }
-    /**
-     * Return true if the interval (which is closed) contains the point 'p'. Skips
-     * the normalization of 'p' from -Pi to Pi.
-     *
-     */
-    fastContains(_p) {
-        const p = (_p);
-        if (this.isInverted()) {
-            return (p >= (this.lo) || p <= (this.hi)) && !this.isEmpty();
-        }
-        else {
-            return p >= (this.lo) && p <= (this.hi);
-        }
-    }
-    /** Return true if the interior of the interval contains the point 'p'. */
-    interiorContains(_p) {
-        // Works for empty, full, and singleton intervals.
-        // assert (Math.abs(p) <= S2.M_PI);
-        let p = (_p);
-        if (p == (-S2_1.S2.M_PI)) {
-            p = (S2_1.S2.M_PI);
-        }
-        if (this.isInverted()) {
-            return p > (this.lo) || p < (this.hi);
-        }
-        else {
-            return (p > (this.lo) && p < (this.hi)) || this.isFull();
-        }
-    }
-    /**
-     * Return true if the interval contains the given interval 'y'. Works for
-     * empty, full, and singleton intervals.
-     */
-    containsI(y) {
-        // It might be helpful to compare the structure of these tests to
-        // the simpler Contains(number) method above.
-        if (this.isInverted()) {
-            if (y.isInverted()) {
-                return y.lo >= (this.lo) && y.hi <= (this.hi);
-            }
-            return (y.lo >= (this.lo) || y.hi <= (this.hi)) && !this.isEmpty();
-        }
-        else {
-            if (y.isInverted()) {
-                return this.isFull() || y.isEmpty();
-            }
-            return y.lo >= (this.lo) && y.hi <= (this.hi);
-        }
-    }
-    /**
-     * Returns true if the interior of this interval contains the entire interval
-     * 'y'. Note that x.InteriorContains(x) is true only when x is the empty or
-     * full interval, and x.InteriorContains(S1Interval(p,p)) is equivalent to
-     * x.InteriorContains(p).
-     */
-    interiorContainsI(y) {
-        if (this.isInverted()) {
-            if (!y.isInverted()) {
-                return this.lo > (this.lo) || y.hi < (this.hi);
-            }
-            return (y.lo > (this.lo) && y.hi < (this.hi)) || y.isEmpty();
-        }
-        else {
-            if (y.isInverted()) {
-                return this.isFull() || y.isEmpty();
-            }
-            return (y.lo > (this.lo) && y.hi < (this.hi)) || this.isFull();
-        }
-    }
-    /**
-     * Return true if the two intervals contain any points in common. Note that
-     * the point +/-Pi has two representations, so the intervals [-Pi,-3] and
-     * [2,Pi] intersect, for example.
-     */
-    intersects(y) {
-        if (this.isEmpty() || y.isEmpty()) {
-            return false;
-        }
-        if (this.isInverted()) {
-            // Every non-empty inverted interval contains Pi.
-            return y.isInverted() || y.lo <= (this.hi) || y.hi >= (this.lo);
-        }
-        else {
-            if (y.isInverted()) {
-                return y.lo <= (this.hi) || y.hi >= (this.lo);
-            }
-            return y.lo <= (this.hi) && y.hi >= (this.lo);
-        }
-    }
-    /**
-     * Return true if the interior of this interval contains any point of the
-     * interval 'y' (including its boundary). Works for empty, full, and singleton
-     * intervals.
-     */
-    interiorIntersects(y) {
-        if (this.isEmpty() || y.isEmpty() || this.lo == (this.hi)) {
-            return false;
-        }
-        if (this.isInverted()) {
-            return y.isInverted() || y.lo < (this.hi) || y.hi > (this.lo);
-        }
-        else {
-            if (y.isInverted()) {
-                return y.lo < (this.hi) || y.hi > (this.lo);
-            }
-            return (y.lo < (this.hi) && y.hi > (this.lo)) || this.isFull();
-        }
-    }
-    /**
-     * Expand the interval by the minimum amount necessary so that it contains the
-     * given point "p" (an angle in the range [-Pi, Pi]).
-     */
-    addPoint(_p) {
-        let p = (_p);
-        // assert (Math.abs(p) <= S2.M_PI);
-        if (p == (-S2_1.S2.M_PI)) {
-            p = (S2_1.S2.M_PI);
-        }
-        if (this.fastContains(p)) {
-            return new S1Interval(this.lo, this.hi);
-        }
-        if (this.isEmpty()) {
-            return S1Interval.fromPoint(p);
-        }
-        else {
-            // Compute distance from p to each endpoint.
-            const dlo = S1Interval.positiveDistance(p, this.lo);
-            const dhi = S1Interval.positiveDistance(this.hi, p);
-            if (dlo < (dhi)) {
-                return new S1Interval(p, this.hi);
-            }
-            else {
-                return new S1Interval(this.lo, p);
-            }
-            // Adding a point can never turn a non-full interval into a full one.
-        }
-    }
-    /**
-     * Return an interval that contains all points within a distance "radius" of
-     * a point in this interval. Note that the expansion of an empty interval is
-     * always empty. The radius must be non-negative.
-     */
-    expanded(radius) {
-        // assert (radius >= 0);
-        if (this.isEmpty()) {
-            return this;
-        }
-        // Check whether this interval will be full after expansion, allowing
-        // for a 1-bit rounding error when computing each endpoint.
-        if (this.getLength() + (radius * 2) >= (2 * S2_1.S2.M_PI - 1e-15)) {
-            return S1Interval.full();
-        }
-        // NOTE(dbeaumont): Should this remainder be 2 * M_PI or just M_PI ??
-        let lo = Platform_1.Platform.IEEEremainder(this.lo - (radius), 2 * S2_1.S2.M_PI);
-        const hi = Platform_1.Platform.IEEEremainder(this.hi + (radius), 2 * S2_1.S2.M_PI);
-        if (lo == (-S2_1.S2.M_PI)) {
-            lo = (S2_1.S2.M_PI);
-        }
-        return new S1Interval(lo, hi);
-    }
-    /**
-     * Return the smallest interval that contains this interval and the given
-     * interval "y".
-     */
-    union(y) {
-        // The y.is_full() case is handled correctly in all cases by the code
-        // below, but can follow three separate code paths depending on whether
-        // this interval is inverted, is non-inverted but contains Pi, or neither.
-        if (y.isEmpty()) {
-            return this;
-        }
-        if (this.fastContains(y.lo)) {
-            if (this.fastContains(y.hi)) {
-                // Either this interval contains y, or the union of the two
-                // intervals is the Full() interval.
-                if (this.containsI(y)) {
-                    return this; // is_full() code path
-                }
-                return S1Interval.full();
-            }
-            return new S1Interval(this.lo, this.hi, true);
-        }
-        if (this.fastContains(y.hi)) {
-            return new S1Interval(y.lo, this.hi, true);
-        }
-        // This interval contains neither endpoint of y. This means that either y
-        // contains all of this interval, or the two intervals are disjoint.
-        if (this.isEmpty() || y.fastContains(this.lo)) {
-            return y;
-        }
-        // Check which pair of endpoints are closer together.
-        const dlo = S1Interval.positiveDistance(y.hi, this.lo);
-        const dhi = S1Interval.positiveDistance(this.hi, y.lo);
-        if (dlo < dhi) {
-            return new S1Interval(y.lo, this.hi, true);
-        }
-        else {
-            return new S1Interval(this.lo, y.hi, true);
-        }
-    }
-    /**
-     * Return the smallest interval that contains the intersection of this
-     * interval with "y". Note that the region of intersection may consist of two
-     * disjoint intervals.
-     */
-    intersection(y) {
-        // The y.is_full() case is handled correctly in all cases by the code
-        // below, but can follow three separate code paths depending on whether
-        // this interval is inverted, is non-inverted but contains Pi, or neither.
-        if (y.isEmpty()) {
-            return S1Interval.empty();
-        }
-        if (this.fastContains(y.lo)) {
-            if (this.fastContains(y.hi)) {
-                // Either this interval contains y, or the region of intersection
-                // consists of two disjoint subintervals. In either case, we want
-                // to return the shorter of the two original intervals.
-                if (y.getLength() < (this.getLength())) {
-                    return y; // is_full() code path
-                }
-                return this;
-            }
-            return new S1Interval(y.lo, this.hi, true);
-        }
-        if (this.fastContains(y.hi)) {
-            return new S1Interval(this.lo, y.hi, true);
-        }
-        // This interval contains neither endpoint of y. This means that either y
-        // contains all of this interval, or the two intervals are disjoint.
-        if (y.fastContains(this.lo)) {
-            return this; // is_empty() okay here
-        }
-        // assert (!intersects(y));
-        return S1Interval.empty();
-    }
-    /**
-     * Return true if the length of the symmetric difference between the two
-     * intervals is at most the given tolerance.
-     */
-    approxEquals(y, maxError = 1e-9) {
-        if (this.isEmpty()) {
-            return y.getLength() <= (maxError);
-        }
-        if (y.isEmpty()) {
-            return this.getLength() <= (maxError);
-        }
-        return Math.abs(Platform_1.Platform.IEEEremainder(y.lo - (this.lo), 2 * S2_1.S2.M_PI))
-            + (Math.abs(Platform_1.Platform.IEEEremainder(y.hi - (this.hi), 2 * S2_1.S2.M_PI)))
-            <= (maxError);
-    }
-    static empty() {
-        return new S1Interval(S2_1.S2.M_PI, -S2_1.S2.M_PI, true);
-    }
-    static full() {
-        return new S1Interval(-S2_1.S2.M_PI, S2_1.S2.M_PI, true);
-    }
-    static fromPoint(_p) {
-        let p = (_p);
-        if (p == (-S2_1.S2.M_PI)) {
-            p = (S2_1.S2.M_PI);
-        }
-        return new S1Interval(p, p, true);
-    }
-    /**
-     * Convenience method to construct the minimal interval containing the two
-     * given points. This is equivalent to starting with an empty interval and
-     * calling AddPoint() twice, but it is more efficient.
-     */
-    static fromPointPair(_p1, _p2) {
-        // assert (Math.abs(p1) <= S2.M_PI && Math.abs(p2) <= S2.M_PI);
-        let p1 = (_p1);
-        let p2 = (_p2);
-        if (p1 == (-S2_1.S2.M_PI)) {
-            p1 = (S2_1.S2.M_PI);
-        }
-        if (p2 == (-S2_1.S2.M_PI)) {
-            p2 = (S2_1.S2.M_PI);
-        }
-        if (S1Interval.positiveDistance(p1, p2) <= (S2_1.S2.M_PI)) {
-            return new S1Interval(p1, p2, true);
-        }
-        else {
-            return new S1Interval(p2, p1, true);
-        }
-    }
-    /**
-     * Compute the distance from "a" to "b" in the range [0, 2*Pi). This is
-     * equivalent to (drem(b - a - S2.M_PI, 2 * S2.M_PI) + S2.M_PI), except that
-     * it is more numerically stable (it does not lose precision for very small
-     * positive distances).
-     */
-    static positiveDistance(_a, _b) {
-        const a = (_a);
-        const b = (_b);
-        const d = b - (a);
-        if (d >= (0)) {
-            return d;
-        }
-        // We want to ensure that if b == Pi and a == (-Pi + eps),
-        // the return result is approximately 2*Pi and not zero.
-        return b + (S2_1.S2.M_PI) - (a - (S2_1.S2.M_PI));
-    }
-}
-exports.S1Interval = S1Interval;
-//# sourceMappingURL=S1Interval.js.map

package/dist/S1Interval.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S1Interval.js","sourceRoot":"","sources":["../src/S1Interval.ts"],"names":[],"mappings":";;;AAAA,yCAAoC;AACpC,6BAAwB;AACxB,yCAAsC;AACtC,MAAa,UAAW,SAAQ,mBAAQ;IAEtC,YAAY,EAAS,EAAE,EAAS,EAAE,OAAO,GAAG,KAAK;QAC/C,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACd,IAAI,CAAC,OAAO,EAAE;YACZ,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;gBACjD,IAAI,CAAC,EAAE,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;aACrB;YACD,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;gBACjD,IAAI,CAAC,EAAE,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;aACrB;SACF;IACH,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,OAAE,CAAC,IAAI,CAAC;eAChE,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;eAChD,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,uEAAuE;QACvE,oGAAoG;IACtG,CAAC;IAED,0EAA0E;IAC1E,MAAM;QACJ,qDAAqD;QACrD,OAAO,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAA;IAC7C,CAAC;IAGD,wEAAwE;IAChE,OAAO;QACb,OAAO,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IAGD,2EAA2E;IACpE,UAAU;QACf,OAAO,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAGD;;;OAGG;IACI,SAAS;QACd,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACvC,0CAA0C;QAC1C,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;YACtB,OAAO,MAAM,CAAC;SACf;QACD,4CAA4C;QAC5C,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACvE,CAAC;IAGD;;;OAGG;IACI,SAAS;QACd,IAAI,MAAM,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,MAAM,IAAI,CAAC,CAAC,CAAC,EAAE;YACjB,OAAO,MAAM,CAAC;SACf;QACD,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC;QAChC,0CAA0C;QAC1C,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;;;OAMG;IACI,UAAU;QACf,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACxB,OAAO,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa;SACxC;QACD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,UAAU;QACzD,YAAY;QACZ,QAAQ;IACV,CAAC;IAED,4EAA4E;IACrE,QAAQ,CAAC,EAAS;QACvB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,kDAAkD;QAClD,mCAAmC;QACnC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;YACnB,CAAC,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;SACf;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,EAAS;QAC3B,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACf,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACrB,OAAO,CAAC,CAAC,IAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;SAC7D;aAAM;YACL,OAAO,CAAC,IAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACxC;IACH,CAAC;IAED,0EAA0E;IACnE,gBAAgB,CAAC,EAAS;QAC/B,kDAAkD;QAClD,mCAAmC;QACnC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;YACnB,CAAC,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;SACf;QAED,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACvC;aAAM;YACL,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;SAC1D;IACH,CAAC;IAED;;;OAGG;IACI,SAAS,CAAC,CAAY;QAC3B,iEAAiE;QACjE,6CAA6C;QAE7C,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACrB,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,OAAO,CAAC,CAAC,EAAE,IAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC9C;YACD,OAAO,CAAC,CAAC,CAAC,EAAE,IAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;SACnE;aAAM;YACL,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;aACrC;YACD,OAAO,CAAC,CAAC,EAAE,IAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SAC9C;IACH,CAAC;IAED;;;;;OAKG;IACI,iBAAiB,CAAC,CAAY;QACnC,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACrB,IAAI,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE;gBACnB,OAAO,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAChD;YACD,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;SAC9D;aAAM;YACL,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;aACrC;YACD,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;SAChE;IACH,CAAC;IAED;;;;OAIG;IACI,UAAU,CAAC,CAAY;QAC5B,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACjC,OAAO,KAAK,CAAC;SACd;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACrB,iDAAiD;YACjD,OAAO,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SAChE;aAAM;YACL,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC9C;YACD,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,IAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SAC9C;IACH,CAAC;IAED;;;;OAIG;IACI,kBAAkB,CAAC,CAAY;QACpC,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACzD,OAAO,KAAK,CAAC;SACd;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;YACrB,OAAO,CAAC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SAC/D;aAAM;YACL,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC7C;YACD,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;SAChE;IACH,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,EAAS;QACvB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,mCAAmC;QACnC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;YACnB,CAAC,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;SACf;QAED,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE;YACxB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;SACzC;QAED,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SAChC;aAAM;YACL,4CAA4C;YAC5C,MAAM,GAAG,GAAG,UAAU,CAAC,gBAAgB,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YACpD,MAAM,GAAG,GAAG,UAAU,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACpD,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE;gBACf,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;aACnC;iBAAM;gBACL,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aACnC;YACD,qEAAqE;SACtE;IACH,CAAC;IAED;;;;OAIG;IACK,QAAQ,CAAC,MAAa;QAC5B,wBAAwB;QACxB,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,IAAI,CAAC;SACb;QAED,qEAAqE;QACrE,2DAA2D;QAC3D,IAAI,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,IAAG,CAAC,CAAC,GAAC,OAAE,CAAC,IAAI,GAAC,KAAK,CAAC,EAAE;YACvD,OAAO,UAAU,CAAC,IAAI,EAAE,CAAC;SAC1B;QAED,qEAAqE;QACrE,IAAI,EAAE,GAAG,mBAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC;QACjE,MAAM,EAAE,GAAG,mBAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC;QAEnE,IAAI,EAAE,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;YACpB,EAAE,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;SAChB;QACD,OAAO,IAAI,UAAU,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,CAAY;QACxB,qEAAqE;QACrE,uEAAuE;QACvE,0EAA0E;QAE1E,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACf,OAAO,IAAI,CAAC;SACb;QACD,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YAC3B,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;gBAC3B,2DAA2D;gBAC3D,oCAAoC;gBACpC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;oBACrB,OAAO,IAAI,CAAC,CAAC,sBAAsB;iBACpC;gBACD,OAAO,UAAU,CAAC,IAAI,EAAE,CAAC;aAC1B;YACD,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;SAC/C;QACD,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YAC3B,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;SAC5C;QAED,yEAAyE;QACzE,oEAAoE;QACpE,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAC7C,OAAO,CAAC,CAAC;SACV;QAED,qDAAqD;QACrD,MAAM,GAAG,GAAG,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACvD,MAAM,GAAG,GAAG,UAAU,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACvD,IAAI,GAAG,GAAG,GAAG,EAAE;YACb,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;SAC5C;aAAM;YACL,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;SAC5C;IACH,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,CAAY;QAC9B,qEAAqE;QACrE,uEAAuE;QACvE,0EAA0E;QAE1E,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACf,OAAO,UAAU,CAAC,KAAK,EAAE,CAAC;SAC3B;QACD,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YAC3B,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;gBAC3B,iEAAiE;gBACjE,iEAAiE;gBACjE,uDAAuD;gBACvD,IAAI,CAAC,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE;oBACtC,OAAO,CAAC,CAAC,CAAC,sBAAsB;iBACjC;gBACD,OAAO,IAAI,CAAC;aACb;YACD,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;SAC5C;QACD,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YAC3B,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;SAC5C;QAED,yEAAyE;QACzE,oEAAoE;QAEpE,IAAI,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YAC3B,OAAO,IAAI,CAAC,CAAC,uBAAuB;SACrC;QACD,2BAA2B;QAC3B,OAAO,UAAU,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,CAAY,EAAE,QAAQ,GAAC,IAAI;QAC7C,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;SACpC;QACD,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE;YACf,OAAO,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;SACvC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,mBAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC;cAC3D,CAAC,IAAI,CAAC,GAAG,CAAC,mBAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC;eAChE,CAAC,QAAQ,CAAC,CAAC;IACzB,CAAC;IAID,MAAM,CAAC,KAAK;QACV,OAAO,IAAI,UAAU,CAAC,OAAE,CAAC,IAAI,EAAE,CAAC,OAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IAED,MAAM,CAAC,IAAI;QACT,OAAO,IAAI,UAAU,CAAC,CAAC,OAAE,CAAC,IAAI,EAAE,OAAE,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IAED,MAAM,CAAC,SAAS,CAAC,EAAS;QACxB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACb,IAAI,CAAC,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;YACnB,CAAC,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;SACf;QACD,OAAO,IAAI,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACpC,CAAC;IAGD;;;;OAIG;IACH,MAAM,CAAC,aAAa,CAAC,GAAU,EAAE,GAAU;QACzC,+DAA+D;QAC/D,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACf,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACf,IAAI,EAAE,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;YACpB,EAAE,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;SAChB;QACD,IAAI,EAAE,IAAI,CAAC,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;YACpB,EAAE,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC;SAChB;QACD,IAAI,UAAU,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,OAAE,CAAC,IAAI,CAAC,EAAE;YACpD,OAAO,IAAI,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;SACrC;aAAM;YACL,OAAO,IAAI,UAAU,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;SACrC;IACH,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,gBAAgB,CAAC,EAAS,EAAE,EAAS;QACjD,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;YACZ,OAAO,CAAC,CAAC;SACV;QACD,0DAA0D;QAC1D,wDAAwD;QACxD,OAAO,CAAC,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACzC,CAAC;CAEF;AA1aD,gCA0aC"}

package/dist/S2.d.ts

@@ -1,96 +0,0 @@
-import { S2Point } from "./S2Point";
-import { S2Metric } from "./S2Metric";
-export declare class S2 {
-    static M_PI: number;
-    static M_1_PI: number;
-    static M_PI_2: number;
-    static M_PI_4: number;
-    static M_SQRT2: number;
-    static M_E: number;
-    static SWAP_MASK: number;
-    static INVERT_MASK: number;
-    private static EXPONENT_SHIFT;
-    private static EXPONENT_MASK;
-    /** Mapping from cell orientation + Hilbert traversal to IJ-index. */
-    static POS_TO_ORIENTATION: number[];
-    static DBL_EPSILON: number;
-    static POS_TO_IJ: number[][];
-    static MAX_LEVEL: number;
-    static IEEEremainder(f1: number, f2: number): number;
-    /**
-     * Return true if the given point is approximately unit length (this is mainly
-     * useful for assertions).
-     */
-    static isUnitLength(p: S2Point): boolean;
-    /**
-     * 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: number): number;
-    /**
-     * 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: S2Point, b: S2Point): S2Point;
-    /**
-     * 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: S2Point, b: S2Point, c: S2Point): number;
-    /**
-     * 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: S2Point, b: S2Point, c: S2Point): number;
-    /**
-     * 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: S2Point, b: S2Point, c: S2Point): boolean;
-    /**
-     *
-     * 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: S2Point, b: S2Point, c: S2Point, d: S2Point): boolean;
-    static approxEqualsPointError(a: S2Point, b: S2Point, maxError: number): boolean;
-    static approxEqualsPoint(a: S2Point, b: S2Point): boolean;
-    static approxEqualsNumberError(a: number, b: number, maxError: number): boolean;
-    static approxEqualsNumber(a: number, b: number): boolean;
-    static Metric: typeof S2Metric;
-}
-export { S2Metric };