nodes2ts 2.0.0 → 4.0.0

package/dist/S2RegionCoverer.d.ts

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

package/dist/S2RegionCoverer.js

@@ -1,435 +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";
-var S2Cell_1 = require("./S2Cell");
-var S2CellId_1 = require("./S2CellId");
-var S2CellUnion_1 = require("./S2CellUnion");
-var S2Projections_1 = require("./S2Projections");
-/**
- * An S2RegionCoverer is a class that allows arbitrary regions to be
- * approximated as unions of cells (S2CellUnion). This is useful for
- * implementing various sorts of search and precomputation operations.
- *
- * Typical usage: {@code S2RegionCoverer coverer; coverer.setMaxCells(5); S2Cap
- * cap = S2Cap.fromAxisAngle(...); S2CellUnion covering;
- * coverer.getCovering(cap, covering); * }
- *
- * This yields a cell union of at most 5 cells that is guaranteed to cover the
- * given cap (a disc-shaped region on the sphere).
- *
- *  The approximation algorithm is not optimal but does a pretty good job in
- * practice. The output does not always use the maximum number of cells allowed,
- * both because this would not always yield a better approximation, and because
- * max_cells() is a limit on how much work is done exploring the possible
- * covering as well as a limit on the final output size.
- *
- *  One can also generate interior coverings, which are sets of cells which are
- * entirely contained within a region. Interior coverings can be empty, even for
- * non-empty regions, if there are no cells that satisfy the provided
- * constraints and are contained by the region. Note that for performance
- * reasons, it is wise to specify a max_level when computing interior coverings
- * - otherwise for regions with small or zero area, the algorithm may spend a
- * lot of time subdividing cells all the way to leaf level to try to find
- * contained cells.
- *
- *  This class is thread-unsafe. Simultaneous calls to any of the getCovering
- * methods will conflict and produce unpredictable results.
- *
- */
-var S2RegionCoverer = (function () {
-    /**
-     * Default constructor, sets all fields to default values.
-     */
-    function S2RegionCoverer() {
-        this.minLevel = 0;
-        this.maxLevel = S2CellId_1.S2CellId.MAX_LEVEL;
-        this.levelMod = 1;
-        this.maxCells = S2RegionCoverer.DEFAULT_MAX_CELLS;
-        this.region = null;
-        this.result = [];
-        this.candidateQueue = new PriorityQueue();
-    }
-    // Set the minimum and maximum cell level to be used. The default is to use
-    // all cell levels. Requires: max_level() >= min_level().
-    //
-    // To find the cell level corresponding to a given physical distance, use
-    // the S2Cell metrics defined in s2.h. For example, to find the cell
-    // level that corresponds to an average edge length of 10km, use:
-    //
-    // int level = S2::kAvgEdge.GetClosestLevel(
-    // geostore::S2Earth::KmToRadians(length_km));
-    //
-    // Note: min_level() takes priority over max_cells(), i.e. cells below the
-    // given level will never be used even if this causes a large number of
-    // cells to be returned.
-    /**
-     * Sets the minimum level to be used.
-     */
-    S2RegionCoverer.prototype.setMinLevel = function (minLevel) {
-        // assert (minLevel >= 0 && minLevel <= S2CellId.MAX_LEVEL);
-        this.minLevel = Math.max(0, Math.min(S2CellId_1.S2CellId.MAX_LEVEL, minLevel));
-        return this;
-    };
-    /**
-     * Sets the maximum level to be used.
-     */
-    S2RegionCoverer.prototype.setMaxLevel = function (maxLevel) {
-        // assert (maxLevel >= 0 && maxLevel <= S2CellId.MAX_LEVEL);
-        this.maxLevel = Math.max(0, Math.min(S2CellId_1.S2CellId.MAX_LEVEL, maxLevel));
-        return this;
-    };
-    /**
-     * If specified, then only cells where (level - min_level) is a multiple of
-     * "level_mod" will be used (default 1). This effectively allows the branching
-     * factor of the S2CellId hierarchy to be increased. Currently the only
-     * parameter values allowed are 1, 2, or 3, corresponding to branching factors
-     * of 4, 16, and 64 respectively.
-     */
-    S2RegionCoverer.prototype.setLevelMod = function (levelMod) {
-        // assert (levelMod >= 1 && levelMod <= 3);
-        this.levelMod = Math.max(1, Math.min(3, levelMod));
-        return this;
-    };
-    /**
-     * Sets the maximum desired number of cells in the approximation (defaults to
-     * kDefaultMaxCells). Note the following:
-     *
-     * <ul>
-     * <li>For any setting of max_cells(), up to 6 cells may be returned if that
-     * is the minimum number of cells required (e.g. if the region intersects all
-     * six face cells). Up to 3 cells may be returned even for very tiny convex
-     * regions if they happen to be located at the intersection of three cube
-     * faces.
-     *
-     * <li>For any setting of max_cells(), an arbitrary number of cells may be
-     * returned if min_level() is too high for the region being approximated.
-     *
-     * <li>If max_cells() is less than 4, the area of the covering may be
-     * arbitrarily large compared to the area of the original region even if the
-     * region is convex (e.g. an S2Cap or S2LatLngRect).
-     * </ul>
-     *
-     * Accuracy is measured by dividing the area of the covering by the area of
-     * the original region. The following table shows the median and worst case
-     * values for this area ratio on a test case consisting of 100,000 spherical
-     * caps of random size (generated using s2regioncoverer_unittest):
-     *
-     * <pre>
-     * max_cells: 3 4 5 6 8 12 20 100 1000
-     * median ratio: 5.33 3.32 2.73 2.34 1.98 1.66 1.42 1.11 1.01
-     * worst case: 215518 14.41 9.72 5.26 3.91 2.75 1.92 1.20 1.02
-     * </pre>
-     */
-    S2RegionCoverer.prototype.setMaxCells = function (maxCells) {
-        this.maxCells = maxCells;
-        return this;
-    };
-    /**
-     * Computes a list of cell ids that covers the given region and satisfies the
-     * various restrictions specified above.
-     *
-     * @param region The region to cover
-     * @param covering The list filled in by this method
-     */
-    S2RegionCoverer.prototype.getCoveringCells = function (region) {
-        // Rather than just returning the raw list of cell ids generated by
-        // GetCoveringInternal(), we construct a cell union and then denormalize it.
-        // This has the effect of replacing four child cells with their parent
-        // whenever this does not violate the covering parameters specified
-        // (min_level, level_mod, etc). This strategy significantly reduces the
-        // number of cells returned in many cases, and it is cheap compared to
-        // computing the covering in the first place.
-        var tmp = this.getCoveringUnion(region);
-        return tmp.denormalize(this.minLevel, this.levelMod);
-    };
-    /**
-     * Computes a list of cell ids that is contained within the given region and
-     * satisfies the various restrictions specified above.
-     *
-     * @param region The region to fill
-     * @param interior The list filled in by this method
-     */
-    S2RegionCoverer.prototype.getInteriorCoveringCells = function (region) {
-        var tmp = this.getInteriorCoveringUnion(region);
-        return tmp.denormalize(this.minLevel, this.levelMod);
-    };
-    /**
-     * Return a normalized cell union that covers the given region and satisfies
-     * the restrictions *EXCEPT* for min_level() and level_mod(). These criteria
-     * cannot be satisfied using a cell union because cell unions are
-     * automatically normalized by replacing four child cells with their parent
-     * whenever possible. (Note that the list of cell ids passed to the cell union
-     * constructor does in fact satisfy all the given restrictions.)
-     */
-    S2RegionCoverer.prototype.getCoveringUnion = function (region, covering) {
-        if (covering === void 0) { covering = new S2CellUnion_1.S2CellUnion(); }
-        this.interiorCovering = false;
-        this.getCoveringInternal(region);
-        covering.initSwap(this.result);
-        return covering;
-    };
-    /**
-     * Return a normalized cell union that is contained within the given region
-     * and satisfies the restrictions *EXCEPT* for min_level() and level_mod().
-     */
-    S2RegionCoverer.prototype.getInteriorCoveringUnion = function (region, covering) {
-        if (covering === void 0) { covering = new S2CellUnion_1.S2CellUnion(); }
-        this.interiorCovering = true;
-        this.getCoveringInternal(region);
-        covering.initSwap(this.result);
-        return covering;
-    };
-    // /**
-    //  * Given a connected region and a starting point, return a set of cells at the
-    //  * given level that cover the region.
-    //  */
-    // public static getSimpleCovering(
-    //     region:S2Region , start:S2Point , level:number):S2CellId[] {
-    //   S2RegionCoverer.floodFill(region, S2CellId.fromPoint(start).parentL(level));
-    // }
-    /**
-     * If the cell intersects the given region, return a new candidate with no
-     * children, otherwise return null. Also marks the candidate as "terminal" if
-     * it should not be expanded further.
-     */
-    S2RegionCoverer.prototype.newCandidate = function (cell) {
-        if (!this.region.mayIntersectC(cell)) {
-            // console.log("NOT INTERSECTING",this.region);
-            return null;
-        }
-        var isTerminal = false;
-        if (cell.level >= this.minLevel) {
-            if (this.interiorCovering) {
-                if (this.region.containsC(cell)) {
-                    isTerminal = true;
-                }
-                else if (cell.level + this.levelMod > this.maxLevel) {
-                    return null;
-                }
-            }
-            else {
-                if (cell.level + this.levelMod > this.maxLevel || this.region.containsC(cell)) {
-                    isTerminal = true;
-                }
-            }
-        }
-        var candidate = new Candidate();
-        candidate.cell = cell;
-        candidate.isTerminal = isTerminal;
-        candidate.numChildren = 0;
-        if (!isTerminal) {
-            candidate.children = Array.apply(null, new Array(1 << this.maxChildrenShift()));
-        }
-        this.candidatesCreatedCounter++;
-        return candidate;
-    };
-    /** Return the log base 2 of the maximum number of children of a candidate. */
-    S2RegionCoverer.prototype.maxChildrenShift = function () {
-        return 2 * this.levelMod;
-    };
-    /**
-     * Process a candidate by either adding it to the result list or expanding its
-     * children and inserting it into the priority queue. Passing an argument of
-     * NULL does nothing.
-     */
-    S2RegionCoverer.prototype.addCandidate = function (candidate) {
-        if (candidate == null) {
-            return;
-        }
-        if (candidate.isTerminal) {
-            this.result.push(candidate.cell.id);
-            return;
-        }
-        // assert (candidate.numChildren == 0);
-        // Expand one level at a time until we hit min_level_ to ensure that
-        // we don't skip over it.
-        var numLevels = (candidate.cell.level < this.minLevel) ? 1 : this.levelMod;
-        var numTerminals = this.expandChildren(candidate, candidate.cell, numLevels);
-        if (candidate.numChildren == 0) {
-        }
-        else if (!this.interiorCovering && numTerminals == 1 << this.maxChildrenShift()
-            && candidate.cell.level >= this.minLevel) {
-            // Optimization: add the parent cell rather than all of its children.
-            // We can't do this for interior coverings, since the children just
-            // intersect the region, but may not be contained by it - we need to
-            // subdivide them further.
-            candidate.isTerminal = true;
-            this.addCandidate(candidate);
-        }
-        else {
-            // We negate the priority so that smaller absolute priorities are returned
-            // first. The heuristic is designed to refine the largest cells first,
-            // since those are where we have the largest potential gain. Among cells
-            // at the same level, we prefer the cells with the smallest number of
-            // intersecting children. Finally, we prefer cells that have the smallest
-            // number of children that cannot be refined any further.
-            var priority = -((((candidate.cell.level << this.maxChildrenShift()) + candidate.numChildren)
-                << this.maxChildrenShift()) + numTerminals);
-            this.candidateQueue.add(new QueueEntry(priority, candidate));
-        }
-    };
-    /**
-     * Populate the children of "candidate" by expanding the given number of
-     * levels from the given cell. Returns the number of children that were marked
-     * "terminal".
-     */
-    S2RegionCoverer.prototype.expandChildren = function (candidate, cell, numLevels) {
-        numLevels--;
-        var childCells = cell.subdivide();
-        var numTerminals = 0;
-        for (var i = 0; i < 4; ++i) {
-            if (numLevels > 0) {
-                if (this.region.mayIntersectC(childCells[i])) {
-                    numTerminals += this.expandChildren(candidate, childCells[i], numLevels);
-                }
-                continue;
-            }
-            var child = this.newCandidate(childCells[i]);
-            if (child != null) {
-                candidate.children[candidate.numChildren++] = child;
-                if (child.isTerminal) {
-                    ++numTerminals;
-                }
-            }
-        }
-        return numTerminals;
-    };
-    /** Computes a set of initial candidates that cover the given region. */
-    S2RegionCoverer.prototype.getInitialCandidates = function () {
-        // Optimization: if at least 4 cells are desired (the normal case),
-        // start with a 4-cell covering of the region's bounding cap. This
-        // lets us skip quite a few levels of refinement when the region to
-        // be covered is relatively small.
-        if (this.maxCells >= 4) {
-            // Find the maximum level such that the bounding cap contains at most one
-            // cell vertex at that level.
-            var cap = this.region.getCapBound();
-            var level = Math.min(S2Projections_1.S2Projections.MIN_WIDTH.getMaxLevel(cap.angle().radians * 2), Math.min(this.maxLevel, S2CellId_1.S2CellId.MAX_LEVEL - 1));
-            if (this.levelMod > 1 && level > this.minLevel) {
-                level -= (level - this.minLevel) % this.levelMod;
-            }
-            // We don't bother trying to optimize the level == 0 case, since more than
-            // four face cells may be required.
-            if (level > 0) {
-                // Find the leaf cell containing the cap axis, and determine which
-                // subcell of the parent cell contains it.
-                // ArrayList<S2CellId> base = new ArrayList<>(4);
-                var id = S2CellId_1.S2CellId.fromPoint(cap.axis);
-                var base = id.getVertexNeighbors(level);
-                for (var i = 0; i < base.length; ++i) {
-                    this.addCandidate(this.newCandidate(new S2Cell_1.S2Cell(base[i])));
-                }
-                return;
-            }
-        }
-        // Default: start with all six cube faces.
-        for (var face = 0; face < 6; ++face) {
-            this.addCandidate(this.newCandidate(S2RegionCoverer.FACE_CELLS[face]));
-        }
-    };
-    /** Generates a covering and stores it in result. */
-    S2RegionCoverer.prototype.getCoveringInternal = function (region) {
-        // Strategy: Start with the 6 faces of the cube. Discard any
-        // that do not intersect the shape. Then repeatedly choose the
-        // largest cell that intersects the shape and subdivide it.
-        //
-        // result contains the cells that will be part of the output, while the
-        // priority queue contains cells that we may still subdivide further. Cells
-        // that are entirely contained within the region are immediately added to
-        // the output, while cells that do not intersect the region are immediately
-        // discarded.
-        // Therefore pq_ only contains cells that partially intersect the region.
-        // Candidates are prioritized first according to cell size (larger cells
-        // first), then by the number of intersecting children they have (fewest
-        // children first), and then by the number of fully contained children
-        // (fewest children first).
-        if (!(this.candidateQueue.size() == 0 && this.result.length == 0)) {
-            throw new Error('preconditions are not satisfied');
-        }
-        // Preconditions.checkState(this.candidateQueue.isEmpty() && this.result.isEmpty());
-        this.region = region;
-        this.candidatesCreatedCounter = 0;
-        this.getInitialCandidates();
-        while (this.candidateQueue.size() !== 0 && (!this.interiorCovering || this.result.length < this.maxCells)) {
-            var candidate = this.candidateQueue.poll().candidate;
-            // logger.info("Pop: " + candidate.cell.id());
-            if (candidate.cell.level < this.minLevel || candidate.numChildren == 1
-                || this.result.length + (this.interiorCovering ? 0 : this.candidateQueue.size()) + candidate.numChildren
-                    <= this.maxCells) {
-                // Expand this candidate into its children.
-                for (var i = 0; i < candidate.numChildren; ++i) {
-                    this.addCandidate(candidate.children[i]);
-                }
-            }
-            else if (this.interiorCovering) {
-            }
-            else {
-                candidate.isTerminal = true;
-                this.addCandidate(candidate);
-            }
-        }
-        this.candidateQueue.clear();
-        this.region = null;
-    };
-    /**
-     * By default, the covering uses at most 8 cells at any level. This gives a
-     * reasonable tradeoff between the number of cells used and the accuracy of
-     * the approximation (see table below).
-     */
-    S2RegionCoverer.DEFAULT_MAX_CELLS = 8;
-    S2RegionCoverer.FACE_CELLS = [0, 1, 2, 3, 4, 5].map(function (face) { return S2Cell_1.S2Cell.fromFacePosLevel(face, 0, 0); });
-    return S2RegionCoverer;
-}());
-exports.S2RegionCoverer = S2RegionCoverer;
-var Candidate = (function () {
-    function Candidate() {
-    }
-    // elements.
-    Candidate.prototype.toString = function () {
-        return "isTermina: " + this.isTerminal + " - Cell: " + this.cell.toString();
-    };
-    return Candidate;
-}());
-var PriorityQueue = (function () {
-    function PriorityQueue() {
-        this.clear();
-    }
-    PriorityQueue.prototype.add = function (item) {
-        this.items.push(item);
-        this.items.sort(function (a, b) { return a.compare(b); });
-    };
-    PriorityQueue.prototype.clear = function () {
-        this.items = [];
-    };
-    PriorityQueue.prototype.size = function () {
-        return this.items.length;
-    };
-    PriorityQueue.prototype.poll = function () {
-        return this.items.splice(0, 1)[0];
-    };
-    return PriorityQueue;
-}());
-var QueueEntry = (function () {
-    function QueueEntry(id, candidate) {
-        this.id = id;
-        this.candidate = candidate;
-    }
-    QueueEntry.prototype.compare = function (other) {
-        return this.id < other.id ? 1 : (this.id > other.id ? -1 : 0);
-    };
-    return QueueEntry;
-}());
-//# sourceMappingURL=S2RegionCoverer.js.map

package/dist/S2RegionCoverer.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2RegionCoverer.js","sourceRoot":"","sources":["../src/S2RegionCoverer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;;AAEH,uBAAqB,UAAU,CAAC,CAAA;AAEhC,yBAAuB,YAAY,CAAC,CAAA;AACpC,4BAA0B,eAAe,CAAC,CAAA;AAC1C,8BAA4B,iBAAiB,CAAC,CAAA;AAC9C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH;IA4CE;;OAEG;IACH;QACE,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,QAAQ,GAAG,eAAe,CAAC,iBAAiB,CAAC;QAClD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,cAAc,GAAG,IAAI,aAAa,EAAc,CAAC;IACxD,CAAC;IAEH,2EAA2E;IAC3E,yDAAyD;IACzD,EAAE;IACF,yEAAyE;IACzE,oEAAoE;IACpE,iEAAiE;IACjE,EAAE;IACF,4CAA4C;IAC5C,8CAA8C;IAC9C,EAAE;IACF,0EAA0E;IAC1E,uEAAuE;IACvE,wBAAwB;IAEtB;;OAEG;IACI,qCAAW,GAAlB,UAAmB,QAAe;QAChC,4DAA4D;QAC5D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,qCAAW,GAAlB,UAAmB,QAAe;QAChC,4DAA4D;QAC5D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,mBAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;QACpE,MAAM,CAAC,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACI,qCAAW,GAAlB,UAAmB,QAAe;QAChC,2CAA2C;QAC3C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACI,qCAAW,GAAlB,UAAmB,QAAe;QAChC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACI,0CAAgB,GAAvB,UAAwB,MAAe;QACrC,mEAAmE;QACnE,4EAA4E;QAC5E,sEAAsE;QACtE,mEAAmE;QACnE,uEAAuE;QACvE,sEAAsE;QACtE,6CAA6C;QAC7C,IAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACI,kDAAwB,GAA/B,UAAgC,MAAe;QAC7C,IAAM,GAAG,GAAG,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IAED;;;;;;;OAOG;IACI,0CAAgB,GAAvB,UAAwB,MAAe,EAAE,QAAwC;QAAxC,wBAAwC,GAAxC,eAA2B,yBAAW,EAAE;QAC/E,IAAI,CAAC,gBAAgB,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QACjC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,CAAC,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,kDAAwB,GAA/B,UAAgC,MAAe,EAAE,QAAsC;QAAtC,wBAAsC,GAAtC,eAAyB,yBAAW,EAAE;QACrF,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC;QAC7B,IAAI,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QACjC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,CAAC,QAAQ,CAAC;IAClB,CAAC;IAEH,MAAM;IACN,iFAAiF;IACjF,wCAAwC;IACxC,MAAM;IACN,mCAAmC;IACnC,mEAAmE;IACnE,iFAAiF;IACjF,IAAI;IAEF;;;;OAIG;IACK,sCAAY,GAApB,UAAqB,IAAW;QAC9B,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACrC,+CAA+C;YAC/C,MAAM,CAAC,IAAI,CAAC;QACd,CAAC;QAED,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAChC,EAAE,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;gBAC1B,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAChC,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;gBAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;oBACtD,MAAM,CAAC,IAAI,CAAC;gBACd,CAAC;YACH,CAAC;YAAC,IAAI,CAAC,CAAC;gBACN,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAC9E,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAM,SAAS,GAAG,IAAI,SAAS,EAAE,CAAC;QAClC,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC;QACtB,SAAS,CAAC,UAAU,GAAG,UAAU,CAAC;QAClC,SAAS,CAAC,WAAW,GAAG,CAAC,CAAC;QAC1B,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;YAChB,SAAS,CAAC,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,KAAK,CAAC,CAAC,IAAE,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;QAEhF,CAAC;QACD,IAAI,CAAC,wBAAwB,EAAE,CAAC;QAChC,MAAM,CAAC,SAAS,CAAC;IACnB,CAAC;IAED,8EAA8E;IACtE,0CAAgB,GAAxB;QACE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACK,sCAAY,GAApB,UAAqB,SAAmB;QAEtC,EAAE,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC;QACT,CAAC;QAED,EAAE,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,MAAM,CAAC;QACT,CAAC;QACD,uCAAuC;QAEvC,oEAAoE;QACpE,yBAAyB;QACzB,IAAM,SAAS,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;QAE7E,IAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAE/E,EAAE,CAAC,CAAC,SAAS,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC;QAEjC,CAAC;QAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,gBAAgB,IAAI,YAAY,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;eAC1E,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAC7C,qEAAqE;YACrE,mEAAmE;YACnE,oEAAoE;YACpE,0BAA0B;YAC1B,SAAS,CAAC,UAAU,GAAG,IAAI,CAAC;YAC5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QAE/B,CAAC;QAAC,IAAI,CAAC,CAAC;YACN,0EAA0E;YAC1E,sEAAsE;YACtE,wEAAwE;YACxE,qEAAqE;YACrE,yEAAyE;YACzE,yDAAyD;YACzD,IAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC;mBAC5F,IAAI,CAAC,gBAAgB,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC;YAE5C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC;QAE/D,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,wCAAc,GAAtB,UAAuB,SAAmB,EAAE,IAAW,EAAE,SAAgB;QACvE,SAAS,EAAE,CAAC;QAGZ,IAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAGpC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAC3B,EAAE,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;gBAClB,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC7C,YAAY,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBAC3E,CAAC;gBACD,QAAQ,CAAC;YACX,CAAC;YACD,IAAI,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAE7C,EAAE,CAAC,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC;gBAClB,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC;gBACpD,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC;oBACrB,EAAE,YAAY,CAAC;gBACjB,CAAC;YACH,CAAC;QACH,CAAC;QAGD,MAAM,CAAC,YAAY,CAAC;IACtB,CAAC;IAED,wEAAwE;IAChE,8CAAoB,GAA5B;QACE,mEAAmE;QACnE,kEAAkE;QAClE,mEAAmE;QACnE,kCAAkC;QAClC,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC;YACvB,yEAAyE;YACzE,6BAA6B;YAC7B,IAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YACtC,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAChB,6BAAa,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,GAAG,CAAC,CAAC,EAC5D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,mBAAQ,CAAC,SAAS,GAAG,CAAC,CAAC,CAClD,CAAC;YACF,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAC/C,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;YACnD,CAAC;YACD,0EAA0E;YAC1E,mCAAmC;YACnC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;gBACd,kEAAkE;gBAClE,0CAA0C;gBAC1C,iDAAiD;gBACjD,IAAM,EAAE,GAAG,mBAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACxC,IAAM,IAAI,GAAG,EAAE,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;gBAC1C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;oBACrC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,eAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5D,CAAC;gBACD,MAAM,CAAC;YACT,CAAC;QACH,CAAC;QACD,0CAA0C;QAC1C,GAAG,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC;YACpC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzE,CAAC;IACH,CAAC;IAED,oDAAoD;IAC5C,6CAAmB,GAA3B,UAA4B,MAAe;QACzC,4DAA4D;QAC5D,8DAA8D;QAC9D,2DAA2D;QAC3D,EAAE;QACF,uEAAuE;QACvE,2EAA2E;QAC3E,yEAAyE;QACzE,2EAA2E;QAC3E,aAAa;QACb,yEAAyE;QACzE,wEAAwE;QACxE,wEAAwE;QACxE,sEAAsE;QACtE,2BAA2B;QAE3B,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YAClE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAA;QACpD,CAAC;QACD,oFAAoF;QAEpF,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,wBAAwB,GAAG,CAAC,CAAC;QAElC,IAAI,CAAC,oBAAoB,EAAE,CAAC;QAE5B,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1G,IAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC;YACvD,8CAA8C;YAC9C,EAAE,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,WAAW,IAAI,CAAC;mBAC/D,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,gBAAgB,GAAG,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW;uBACrG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACrB,2CAA2C;gBAC3C,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC;oBAC/C,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAEnC,CAAC;YAAC,IAAI,CAAC,CAAC;gBACN,SAAS,CAAC,UAAU,GAAG,IAAI,CAAC;gBAC5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IACrB,CAAC;IA3ZD;;;;OAIG;IACW,iCAAiB,GAAG,CAAC,CAAC;IAErB,0BAAU,GAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,UAAA,IAAI,IAAI,OAAA,eAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAnC,CAAmC,CAAC,CAAC;IAsb3G,sBAAC;AAAD,CAAC,AA/bD,IA+bC;AA/bY,uBAAe,kBA+b3B,CAAA;AAGD;IAAA;IAUA,CAAC;IALC,YAAY;IAEL,4BAAQ,GAAf;QACE,MAAM,CAAC,gBAAc,IAAI,CAAC,UAAU,iBAAY,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAI,CAAC;IACzE,CAAC;IACH,gBAAC;AAAD,CAAC,AAVD,IAUC;AAKD;IAGE;QACE,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,2BAAG,GAAH,UAAI,IAAM;QACR,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAZ,CAAY,CAAC,CAAC;IAC1C,CAAC;IAED,6BAAK,GAAL;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,4BAAI,GAAJ;QACE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,4BAAI,GAAJ;QACE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACH,oBAAC;AAAD,CAAC,AAvBD,IAuBC;AAED;IAKE,oBAA0B,EAAS,EAAS,SAAmB;QAArC,OAAE,GAAF,EAAE,CAAO;QAAS,cAAS,GAAT,SAAS,CAAU;IAE/D,CAAC;IAND,4BAAO,GAAP,UAAQ,KAAgB;QACtB,MAAM,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChE,CAAC;IAKH,iBAAC;AAAD,CAAC,AARD,IAQC"}