nodes2ts 3.0.0 → 4.0.1

package/dist/S2Cap.js

@@ -1,399 +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.S2Cap = void 0;
-const S2_1 = require("./S2");
-const S2Point_1 = require("./S2Point");
-const S1Angle_1 = require("./S1Angle");
-const S2LatLngRect_1 = require("./S2LatLngRect");
-const S2LatLng_1 = require("./S2LatLng");
-const R1Interval_1 = require("./R1Interval");
-const S1Interval_1 = require("./S1Interval");
-const S1ChordAngle_1 = require("./S1ChordAngle");
-const Platform_1 = require("./Platform");
-const Long = require("long");
-/**
- * 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
- *
- */
-class 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.
-     */
-    constructor(axis, radius) {
-        this.axis = axis;
-        this.radius = radius;
-        // assert (isValid());
-    }
-    static fromAxisChord(center, radius) {
-        return new S2Cap(center, radius);
-    }
-    /**
-     * 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, height) {
-        // assert (S2.isUnitLength(axis));
-        return new S2Cap(axis, S1ChordAngle_1.S1ChordAngle.fromLength2(2 * height));
-    }
-    /**
-     * 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, angle) {
-        // The "min" calculation below is necessary to handle S1Angle.INFINITY.
-        // assert (S2.isUnitLength(axis));
-        return this.fromAxisChord(axis, S1ChordAngle_1.S1ChordAngle.fromS1Angle(S1Angle_1.S1Angle.radians(Math.min(angle.radians, S2_1.S2.M_PI))));
-    }
-    /**
-     * 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, area) {
-        // assert (S2.isUnitLength(axis));
-        return new S2Cap(axis, S1ChordAngle_1.S1ChordAngle.fromLength2(area / S2_1.S2.M_PI));
-    }
-    /** Return an empty cap, i.e. a cap that contains no points. */
-    static empty() {
-        return new S2Cap(S2Point_1.S2Point.X_POS, S1ChordAngle_1.S1ChordAngle.NEGATIVE);
-    }
-    /** Return a full cap, i.e. a cap that contains all points. */
-    static full() {
-        return new S2Cap(S2Point_1.S2Point.X_POS, S1ChordAngle_1.S1ChordAngle.STRAIGHT);
-    }
-    getCapBound() {
-        return this;
-    }
-    height() {
-        return 0.5 * this.radius.getLength2();
-    }
-    area() {
-        return 2 * S2_1.S2.M_PI * Math.max(0.0, this.height());
-    }
-    /**
-     * 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() {
-        return this.radius.toAngle();
-    }
-    /**
-     * 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() {
-        return S2_1.S2.isUnitLength(this.axis) && this.radius.getLength2() <= 4;
-    }
-    /** Return true if the cap is empty, i.e. it contains no points. */
-    isEmpty() {
-        return this.radius.isNegative();
-    }
-    /** Return true if the cap is full, i.e. it contains all points. */
-    isFull() {
-        return S1ChordAngle_1.S1ChordAngle.STRAIGHT.equals(this.radius);
-    }
-    /**
-     * 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() {
-        // The complement of a full cap is an empty cap, not a singleton.
-        // Also make sure that the complement of an empty cap is full.
-        if (this.isFull()) {
-            return S2Cap.empty();
-        }
-        if (this.isEmpty()) {
-            return S2Cap.full();
-        }
-        return S2Cap.fromAxisChord(S2Point_1.S2Point.neg(this.axis), S1ChordAngle_1.S1ChordAngle.fromLength2(4 - this.radius.getLength2()));
-    }
-    /**
-     * 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) {
-        if (this.isFull() || other.isEmpty()) {
-            return true;
-        }
-        else {
-            const axialDistance = S1ChordAngle_1.S1ChordAngle.fromS2Point(this.axis, other.axis);
-            return this.radius.compareTo(S1ChordAngle_1.S1ChordAngle.add(axialDistance, other.radius)) >= 0;
-        }
-    }
-    /**
-     * 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) {
-        // Interior(X) intersects Y if and only if Complement(Interior(X))
-        // does not contain Y.
-        return !this.complement().containsCap(other);
-    }
-    /**
-     * 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) {
-        // assert (S2.isUnitLength(p));
-        return this.isFull() || S1ChordAngle_1.S1ChordAngle.fromS2Point(this.axis, p).compareTo(this.radius) < 0;
-    }
-    /**
-     * 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) {
-        // assert (S2.isUnitLength(p));
-        if (this.isEmpty()) {
-            return new S2Cap(p, S1ChordAngle_1.S1ChordAngle.ZERO);
-        }
-        else {
-            // After adding p to this cap, we require that the result contains p. However we don't need to
-            // do anything special to achieve this because contains() does exactly the same distance
-            // calculation that we do here.
-            return new S2Cap(this.axis, S1ChordAngle_1.S1ChordAngle.fromLength2(Math.max(this.radius.getLength2(), this.axis.getDistance2(p))));
-        }
-    }
-    // Increase the cap height if necessary to include "other". If the current
-    // cap is empty it is set to the given other cap.
-    addCap(other) {
-        if (this.isEmpty()) {
-            return other;
-        }
-        else if (other.isEmpty()) {
-            return this;
-        }
-        else {
-            // We round up the distance to ensure that the cap is actually contained.
-            // TODO(user): Do some error analysis in order to guarantee this.
-            const dist = S1ChordAngle_1.S1ChordAngle.add(S1ChordAngle_1.S1ChordAngle.fromS2Point(this.axis, other.axis), other.radius);
-            const roundedUp = dist.plusError(S2_1.S2.DBL_EPSILON * dist.getLength2());
-            return new S2Cap(this.axis, S1ChordAngle_1.S1ChordAngle.max(this.radius, roundedUp));
-        }
-    }
-    // //////////////////////////////////////////////////////////////////////
-    // S2Region interface (see {@code S2Region} for details):
-    getRectBound() {
-        if (this.isEmpty()) {
-            return S2LatLngRect_1.S2LatLngRect.empty();
-        }
-        if (this.isFull()) {
-            return S2LatLngRect_1.S2LatLngRect.full();
-        }
-        // Convert the axis to a (lat,lng) pair, and compute the cap angle.
-        const axisLatLng = S2LatLng_1.S2LatLng.fromPoint(this.axis);
-        const capAngle = this.angle().radians;
-        let allLongitudes = false;
-        const lat = [];
-        const lng = [];
-        lng[0] = -S2_1.S2.M_PI;
-        lng[1] = S2_1.S2.M_PI;
-        // Check whether cap includes the south pole.
-        lat[0] = axisLatLng.lat().radians - capAngle;
-        if (lat[0] <= -S2_1.S2.M_PI_2) {
-            lat[0] = -S2_1.S2.M_PI_2;
-            allLongitudes = true;
-        }
-        // Check whether cap includes the north pole.
-        lat[1] = axisLatLng.lat().radians + capAngle;
-        if (lat[1] >= S2_1.S2.M_PI_2) {
-            lat[1] = S2_1.S2.M_PI_2;
-            allLongitudes = true;
-        }
-        if (!allLongitudes) {
-            // Compute the range of longitudes covered by the cap. We use the law
-            // of sines for spherical triangles. Consider the triangle ABC where
-            // A is the north pole, B is the center of the cap, and C is the point
-            // of tangency between the cap boundary and a line of longitude. Then
-            // C is a right angle, and letting a,b,c denote the sides opposite A,B,C,
-            // we have sin(a)/sin(A) = sin(c)/sin(C), or sin(A) = sin(a)/sin(c).
-            // Here "a" is the cap angle, and "c" is the colatitude (90 degrees
-            // minus the latitude). This formula also works for negative latitudes.
-            const sinA = S1ChordAngle_1.S1ChordAngle.sin(this.radius);
-            const sinC = Math.cos(axisLatLng.lat().radians);
-            if (sinA <= sinC) {
-                const angleA = Math.asin(sinA / sinC);
-                lng[0] = Platform_1.Platform.IEEEremainder(axisLatLng.lng().radians - angleA, 2 * S2_1.S2.M_PI);
-                lng[1] = Platform_1.Platform.IEEEremainder(axisLatLng.lng().radians + angleA, 2 * S2_1.S2.M_PI);
-            }
-        }
-        return new S2LatLngRect_1.S2LatLngRect(new R1Interval_1.R1Interval(lat[0], lat[1]), new S1Interval_1.S1Interval(lng[0], lng[1]));
-    }
-    // public mayIntersectC(cell:S2Cell):boolean {
-    //   const toRet = this._mayIntersectC(cell);
-    //   console.log("intersects? ",toRet, cell.id.pos().toString(16), cell.level);
-    //   return toRet;
-    // }
-    mayIntersectC(cell) {
-        // If the cap contains any cell vertex, return true.
-        const vertices = new Array(4);
-        for (let k = 0; k < 4; ++k) {
-            vertices[k] = cell.getVertex(k);
-            if (this.contains(vertices[k])) {
-                return true;
-            }
-        }
-        return this.intersects(cell, vertices);
-    }
-    /**
-     * Return true if the cap intersects 'cell', given that the cap vertices have
-     * alrady been checked.
-     */
-    intersects(cell, vertices) {
-        // Return true if this cap intersects any point of 'cell' excluding its
-        // vertices (which are assumed to already have been checked).
-        // If the cap is a hemisphere or larger, the cell and the complement of the
-        // cap are both convex. Therefore since no vertex of the cell is contained,
-        // no other interior point of the cell is contained either.
-        if (this.radius.compareTo(S1ChordAngle_1.S1ChordAngle.RIGHT) >= 0) {
-            return false;
-        }
-        // We need to check for empty caps due to the axis check just below.
-        if (this.isEmpty()) {
-            return false;
-        }
-        // Optimization: return true if the cell contains the cap axis. (This
-        // allows half of the edge checks below to be skipped.)
-        if (cell.contains(this.axis)) {
-            return true;
-        }
-        // At this point we know that the cell does not contain the cap axis,
-        // and the cap does not contain any cell vertex. The only way that they
-        // can intersect is if the cap intersects the interior of some edge.
-        const sin2Angle = S1ChordAngle_1.S1ChordAngle.sin2(this.radius);
-        for (let k = 0; k < 4; ++k) {
-            const edge = cell.getEdgeRaw(k);
-            const dot = this.axis.dotProd(edge);
-            if (dot > 0) {
-                // The axis is in the interior half-space defined by the edge. We don't
-                // need to consider these edges, since if the cap intersects this edge
-                // then it also intersects the edge on the opposite side of the cell
-                // (because we know the axis is not contained with the cell).
-                continue;
-            }
-            // The Norm2() factor is necessary because "edge" is not normalized.
-            if (dot * dot > sin2Angle * edge.norm2()) {
-                return false; // Entire cap is on the exterior side of this edge.
-            }
-            // Otherwise, the great circle containing this edge intersects
-            // the interior of the cap. We just need to check whether the point
-            // of closest approach occurs between the two edge endpoints.
-            const dir = S2Point_1.S2Point.crossProd(edge, this.axis);
-            if (dir.dotProd(vertices[k]) < 0 && dir.dotProd(vertices[(k + 1) & 3]) > 0) {
-                return true;
-            }
-        }
-        return false;
-    }
-    contains(p) {
-        // The point 'p' should be a unit-length vector.
-        // assert (S2.isUnitLength(p));
-        return S1ChordAngle_1.S1ChordAngle.fromS2Point(this.axis, p).compareTo(this.radius) <= 0;
-    }
-    containsC(cell) {
-        // If the cap does not contain all cell vertices, return false.
-        // We check the vertices before taking the Complement() because we can't
-        // accurately represent the complement of a very small cap (a height
-        // of 2-epsilon is rounded off to 2).
-        const vertices = [];
-        for (let k = 0; k < 4; ++k) {
-            vertices[k] = cell.getVertex(k);
-            if (!this.contains(vertices[k])) {
-                return false;
-            }
-        }
-        // Otherwise, return true if the complement of the cap does not intersect
-        // the cell. (This test is slightly conservative, because technically we
-        // want Complement().InteriorIntersects() here.)
-        return !this.complement().intersects(cell, vertices);
-    }
-    //
-    // /** Return true if two caps are identical. */
-    // public equals(that:Object ):boolean  {
-    //
-    //   if (!(that instanceof S2Cap)) {
-    //     return false;
-    //   }
-    //
-    //   S2Cap other = (S2Cap) that;
-    //   return (this.axis.equals(other.axis) && this.height == other.height)
-    //       || (isEmpty() && other.isEmpty()) || (isFull() && other.isFull());
-    //
-    // }
-    //
-    // @Override
-    // public int hashCode() {
-    //   if (isFull()) {
-    //     return 17;
-    //   } else if (isEmpty()) {
-    //     return 37;
-    //   }
-    //   int result = 17;
-    //   result = 37 * result + this.axis.hashCode();
-    //   long heightBits = Double.doubleToLongBits(this.height);
-    //   result = 37 * result + (int) ((heightBits >>> 32) ^ heightBits);
-    //   return result;
-    // }
-    // /////////////////////////////////////////////////////////////////////
-    // The following static methods are convenience functions for assertions
-    // and testing purposes only.
-    /**
-     * Return true if the cap axis and height differ by at most "max_error" from
-     * the given cap "other".
-     */
-    approxEquals(other, maxError = 1e-14) {
-        const r2 = this.radius.getLength2();
-        const otherR2 = other.radius.getLength2();
-        return (S2_1.S2.approxEqualsPointError(this.axis, other.axis, maxError) && Math.abs(r2 - otherR2) <= maxError)
-            || (this.isEmpty() && otherR2 <= maxError)
-            || (other.isEmpty() && r2 <= maxError)
-            || (this.isFull() && otherR2 >= 2 - maxError)
-            || (other.isFull() && r2 >= 2 - maxError);
-    }
-    toString() {
-        return "[Point = " + this.axis + " Radius = " + this.radius + "]";
-    }
-    toGEOJSON() {
-        return this.getRectBound().toGEOJSON();
-    }
-}
-exports.S2Cap = S2Cap;
-/**
- * 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.
- */
-S2Cap.ROUND_UP = 1 / new Long(1).shiftLeft(52).toNumber() + 1;
-//# sourceMappingURL=S2Cap.js.map

package/dist/S2Cap.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2Cap.js","sourceRoot":"","sources":["../src/S2Cap.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;AAIH,6BAAwB;AACxB,uCAAkC;AAClC,uCAAkC;AAClC,iDAA4C;AAC5C,yCAAoC;AACpC,6CAAwC;AACxC,6CAAwC;AAExC,iDAA4C;AAC5C,yCAAsC;AACtC,6BAA8B;AAC9B;;;;;;;;;;;;;GAaG;AACH,MAAa,KAAK;IAchB;;;;OAIG;IACH,YAAY,IAAY,EAAE,MAAoB;QAC5C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,sBAAsB;IACxB,CAAC;IAEM,MAAM,CAAC,aAAa,CAAC,MAAe,EAAE,MAAoB;QAC/D,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,cAAc,CAAC,IAAa,EAAE,MAAc;QACxD,kCAAkC;QAClC,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE,2BAAY,CAAC,WAAW,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,aAAa,CAAC,IAAY,EAAE,KAAa;QACrD,uEAAuE;QACvE,kCAAkC;QAElC,OAAO,IAAI,CAAC,aAAa,CACvB,IAAI,EAAE,2BAAY,CAAC,WAAW,CAAC,iBAAO,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,YAAY,CAAC,IAAY,EAAE,IAAW;QAClD,kCAAkC;QAClC,OAAO,IAAI,KAAK,CAAC,IAAI,EAAE,2BAAY,CAAC,WAAW,CAAC,IAAI,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IACnE,CAAC;IAED,+DAA+D;IACxD,MAAM,CAAC,KAAK;QACjB,OAAO,IAAI,KAAK,CAAC,iBAAO,CAAC,KAAK,EAAE,2BAAY,CAAC,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED,8DAA8D;IACvD,MAAM,CAAC,IAAI;QAChB,OAAO,IAAI,KAAK,CAAC,iBAAO,CAAC,KAAK,EAAE,2BAAY,CAAC,QAAQ,CAAC,CAAC;IACzD,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,MAAM;QACX,OAAO,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;IACxC,CAAC;IAEM,IAAI;QACT,OAAO,CAAC,GAAG,OAAE,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACI,KAAK;QACV,OAAO,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED;;;;OAIG;IACI,OAAO;QACZ,OAAO,OAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACrE,CAAC;IAED,mEAAmE;IAC5D,OAAO;QACZ,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;IAClC,CAAC;IAED,mEAAmE;IAC5D,MAAM;QACX,OAAO,2BAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC;IAED;;;;;OAKG;IACI,UAAU;QACf,iEAAiE;QACjE,8DAA8D;QAC9D,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACjB,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;SACtB;QACD,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC;SACrB;QACD,OAAO,KAAK,CAAC,aAAa,CAAC,iBAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,2BAAY,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IAE7G,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,KAAW;QAC5B,IAAI,IAAI,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;YACpC,OAAO,IAAI,CAAC;SACb;aAAM;YACL,MAAM,aAAa,GAAG,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YACtE,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,2BAAY,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;SAClF;IACH,CAAC;IAED;;;OAGG;IACI,kBAAkB,CAAC,KAAW;QACnC,kEAAkE;QAClE,sBAAsB;QACtB,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACI,gBAAgB,CAAC,CAAS;QAC/B,+BAA+B;QAC/B,OAAO,IAAI,CAAC,MAAM,EAAE,IAAI,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC5F,CAAC;IAED;;;;;OAKG;IACI,QAAQ,CAAC,CAAS;QACvB,+BAA+B;QAC/B,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,IAAI,KAAK,CAAC,CAAC,EAAE,2BAAY,CAAC,IAAI,CAAC,CAAC;SACxC;aAAM;YACL,8FAA8F;YAC9F,wFAAwF;YACxF,+BAA+B;YAC/B,OAAO,IAAI,KAAK,CACZ,IAAI,CAAC,IAAI,EAAE,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACzG;IACH,CAAC;IAEH,0EAA0E;IAC1E,iDAAiD;IACxC,MAAM,CAAC,KAAW;QACvB,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,KAAK,CAAC;SACd;aAAM,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;YAC1B,OAAO,IAAI,CAAC;SACb;aAAM;YACL,yEAAyE;YACzE,iEAAiE;YACjE,MAAM,IAAI,GAAG,2BAAY,CAAC,GAAG,CAAC,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;YAC7F,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,OAAE,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YACrE,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,2BAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;SACvE;IACH,CAAC;IAEH,yEAAyE;IACzE,yDAAyD;IAChD,YAAY;QACjB,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,2BAAY,CAAC,KAAK,EAAE,CAAC;SAC7B;QACD,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;YACjB,OAAO,2BAAY,CAAC,IAAI,EAAE,CAAC;SAC5B;QAED,mEAAmE;QACnE,MAAM,UAAU,GAAG,mBAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC;QAEtC,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,MAAM,GAAG,GAAG,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,EAAE,CAAC;QACf,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,OAAE,CAAC,IAAI,CAAC;QAClB,GAAG,CAAC,CAAC,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC;QAEjB,6CAA6C;QAC7C,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,GAAG,QAAQ,CAAC;QAC7C,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,OAAE,CAAC,MAAM,EAAE;YACxB,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,OAAE,CAAC,MAAM,CAAC;YACpB,aAAa,GAAG,IAAI,CAAC;SACtB;QACD,6CAA6C;QAC7C,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,GAAG,QAAQ,CAAC;QAC7C,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,OAAE,CAAC,MAAM,EAAE;YACvB,GAAG,CAAC,CAAC,CAAC,GAAG,OAAE,CAAC,MAAM,CAAC;YACnB,aAAa,GAAG,IAAI,CAAC;SACtB;QACD,IAAI,CAAC,aAAa,EAAE;YAClB,qEAAqE;YACrE,oEAAoE;YACpE,sEAAsE;YACtE,qEAAqE;YACrE,yEAAyE;YACzE,oEAAoE;YACpE,mEAAmE;YACnE,uEAAuE;YACvE,MAAM,IAAI,GAAG,2BAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,IAAI,IAAI,IAAI,EAAE;gBAChB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;gBACtC,GAAG,CAAC,CAAC,CAAC,GAAG,mBAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,GAAG,MAAM,EAAE,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC;gBAChF,GAAG,CAAC,CAAC,CAAC,GAAG,mBAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,GAAG,MAAM,EAAE,CAAC,GAAG,OAAE,CAAC,IAAI,CAAC,CAAC;aACjF;SACF;QACD,OAAO,IAAI,2BAAY,CAAC,IAAI,uBAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,uBAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1F,CAAC;IAED,8CAA8C;IAC9C,6CAA6C;IAC7C,+EAA+E;IAC/E,kBAAkB;IAClB,IAAI;IACG,aAAa,CAAC,IAAW;QAC9B,oDAAoD;QACpD,MAAM,QAAQ,GAAa,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC9B,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACzC,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,IAAW,EAAE,QAAkB;QAC/C,uEAAuE;QACvE,6DAA6D;QAE7D,2EAA2E;QAC3E,2EAA2E;QAC3E,2DAA2D;QAC3D,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,2BAAY,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;YAClD,OAAO,KAAK,CAAC;SACd;QAED,oEAAoE;QACpE,IAAI,IAAI,CAAC,OAAO,EAAE,EAAE;YAClB,OAAO,KAAK,CAAC;SACd;QAED,qEAAqE;QACrE,uDAAuD;QACvD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC5B,OAAO,IAAI,CAAC;SACb;QAED,qEAAqE;QACrE,uEAAuE;QACvE,oEAAoE;QAEpE,MAAM,SAAS,GAAG,2BAAY,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,GAAG,GAAG,CAAC,EAAE;gBACX,uEAAuE;gBACvE,sEAAsE;gBACtE,oEAAoE;gBACpE,6DAA6D;gBAC7D,SAAS;aACV;YACD,oEAAoE;YACpE,IAAI,GAAG,GAAG,GAAG,GAAG,SAAS,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE;gBACxC,OAAO,KAAK,CAAC,CAAC,mDAAmD;aAClE;YACD,8DAA8D;YAC9D,mEAAmE;YACnE,6DAA6D;YAC7D,MAAM,GAAG,GAAG,iBAAO,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/C,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;gBAC1E,OAAO,IAAI,CAAC;aACb;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEM,QAAQ,CAAC,CAAS;QACvB,gDAAgD;QAChD,+BAA+B;QAC/B,OAAO,2BAAY,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC;IAEM,SAAS,CAAC,IAAY;QAC3B,+DAA+D;QAC/D,wEAAwE;QACxE,oEAAoE;QACpE,qCAAqC;QACrC,MAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;gBAC/B,OAAO,KAAK,CAAC;aACd;SACF;QACD,yEAAyE;QACzE,wEAAwE;QACxE,gDAAgD;QAChD,OAAO,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IACvD,CAAC;IAEH,EAAE;IACF,gDAAgD;IAChD,yCAAyC;IACzC,EAAE;IACF,oCAAoC;IACpC,oBAAoB;IACpB,MAAM;IACN,EAAE;IACF,gCAAgC;IAChC,yEAAyE;IACzE,2EAA2E;IAC3E,EAAE;IACF,IAAI;IACJ,EAAE;IACF,YAAY;IACZ,0BAA0B;IAC1B,oBAAoB;IACpB,iBAAiB;IACjB,4BAA4B;IAC5B,iBAAiB;IACjB,MAAM;IACN,qBAAqB;IACrB,iDAAiD;IACjD,4DAA4D;IAC5D,qEAAqE;IACrE,mBAAmB;IACnB,IAAI;IAEJ,wEAAwE;IACxE,wEAAwE;IACxE,6BAA6B;IAE3B;;;OAGG;IACI,YAAY,CAAC,KAAW,EAAE,QAAQ,GAAG,KAAK;QAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;QACpC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;QAE1C,OAAO,CAAC,OAAE,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,QAAQ,CAAC;eAClG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,OAAO,IAAI,QAAQ,CAAC;eACvC,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,QAAQ,CAAC;eACnC,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,OAAO,IAAI,CAAC,GAAG,QAAQ,CAAC;eAC1C,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;IAChD,CAAC;IAEM,QAAQ;QACb,OAAO,WAAW,GAAG,IAAI,CAAC,IAAI,GAAG,YAAY,GAAG,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC;IACpE,CAAC;IAEM,SAAS;QACd,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC,SAAS,EAAE,CAAC;IACzC,CAAC;;AA9YH,sBA+YC;AA5YC;;;;GAIG;AACa,cAAQ,GAAG,CAAC,GAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC"}

package/dist/S2Cell.d.ts

@@ -1,106 +0,0 @@
-import { S2CellId } from "./S2CellId";
-import { S2Point } from "./S2Point";
-import { S2LatLng } from "./S2LatLng";
-import { R2Vector } from "./R2Vector";
-import { S2LatLngRect } from "./S2LatLngRect";
-import { S2Cap } from "./S2Cap";
-export declare class S2Cell {
-    private cellID?;
-    private static MAX_CELL_SIZE;
-    private _face;
-    private _level;
-    private _orientation;
-    private uMin;
-    private uMax;
-    private vMin;
-    private vMax;
-    constructor(cellID?: S2CellId);
-    get id(): S2CellId;
-    static fromFace(face: number): S2Cell;
-    static fromFacePosLevel(face: number, pos: number, level: number): S2Cell;
-    static fromPoint(p: S2Point): S2Cell;
-    static fromLatLng(ll: S2LatLng): S2Cell;
-    isLeaf(): boolean;
-    getVertex(k: number): S2Point;
-    /**
-     * Return the k-th vertex of the cell (k = 0,1,2,3). Vertices are returned in
-     * CCW order. The points returned by GetVertexRaw are not necessarily unit
-     * length.
-     */
-    getVertexRaw(k: number): S2Point;
-    getEdge(k: number): S2Point;
-    getEdgeRaw(k: number): S2Point;
-    /**
-     * Return the inward-facing normal of the great circle passing through the
-     * edge from vertex k to vertex k+1 (mod 4). The normals returned by
-     * GetEdgeRaw are not necessarily unit length.
-     *
-     *  If this is not a leaf cell, set children[0..3] to the four children of
-     * this cell (in traversal order) and return true. Otherwise returns false.
-     * This method is equivalent to the following:
-     *
-     *  for (pos=0, id=child_begin(); id != child_end(); id = id.next(), ++pos)
-     * children[i] = S2Cell(id);
-     *
-     * except that it is more than two times faster.
-     */
-    subdivide(): S2Cell[];
-    /**
-     * Return the direction vector corresponding to the center in (s,t)-space of
-     * the given cell. This is the point at which the cell is divided into four
-     * subcells; it is not necessarily the centroid of the cell in (u,v)-space or
-     * (x,y,z)-space. The point returned by GetCenterRaw is not necessarily unit
-     * length.
-     */
-    getCenter(): S2Point;
-    getCenterRaw(): S2Point;
-    /**
-     * Return the center of the cell in (u,v) coordinates (see {@code
-     * S2Projections}). Note that the center of the cell is defined as the point
-     * at which it is recursively subdivided into four children; in general, it is
-     * not at the midpoint of the (u,v) rectangle covered by the cell
-     */
-    getCenterUV(): R2Vector;
-    /**
-     * Return the average area of cells at this level. This is accurate to within
-     * a factor of 1.7 (for S2_QUADRATIC_PROJECTION) and is extremely cheap to
-     * compute.
-     */
-    static averageArea(level: any): number;
-    /**
-     * Return the average area of cells at this level. This is accurate to within
-     * a factor of 1.7 (for S2_QUADRATIC_PROJECTION) and is extremely cheap to
-     * compute.
-     */
-    averageArea(): number;
-    /**
-     * Return the approximate area of this cell. This method is accurate to within
-     * 3% percent for all cell sizes and accurate to within 0.1% for cells at
-     * level 5 or higher (i.e. 300km square or smaller). It is moderately cheap to
-     * compute.
-     */
-    approxArea(): number;
-    exactArea(): number;
-    getCapBound(): S2Cap;
-    private static MAX_ERROR;
-    private static POLE_MIN_LAT;
-    private getPoint;
-    getRectBound(): S2LatLngRect;
-    mayIntersectC(cell: S2Cell): boolean;
-    contains(p: S2Point): boolean;
-    containsC(cell: S2Cell): boolean;
-    private init;
-    get face(): number;
-    get orientation(): number;
-    get level(): number;
-    toString(): string;
-    toGEOJSON(): {
-        type: string;
-        geometry: {
-            type: string;
-            coordinates: number[][][];
-        };
-        properties: {};
-        title: string;
-    };
-}