nodes2ts 3.0.0 → 4.0.1

package/dist/S2RegionCoverer.js

@@ -1,471 +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.S2RegionCoverer = void 0;
-const S2Cell_1 = require("./S2Cell");
-const S2CellId_1 = require("./S2CellId");
-const S2CellUnion_1 = require("./S2CellUnion");
-const 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.
- *
- */
-class S2RegionCoverer {
-    /**
-     * Default constructor, sets all fields to default values.
-     */
-    constructor() {
-        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.
-     */
-    setMinLevel(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.
-     */
-    setMaxLevel(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.
-     */
-    setLevelMod(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>
-     */
-    setMaxCells(maxCells) {
-        this.maxCells = maxCells;
-        return this;
-    }
-    getMinLevel() {
-        return this.minLevel;
-    }
-    getMaxLevel() {
-        return this.maxLevel;
-    }
-    getMaxCells() {
-        return this.maxCells;
-    }
-    getLevelMod() {
-        return this.levelMod;
-    }
-    /**
-     * 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) {
-        // 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.
-        const 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
-     */
-    getInteriorCoveringCells(region) {
-        const 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.)
-     */
-    getCoveringUnion(region, covering = new S2CellUnion_1.S2CellUnion()) {
-        this.interiorCovering = false;
-        this.getCoveringInternal(region);
-        covering.initSwap(this.result);
-        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().
-     */
-    getInteriorCoveringUnion(region, covering = new S2CellUnion_1.S2CellUnion()) {
-        this.interiorCovering = true;
-        this.getCoveringInternal(region);
-        covering.initSwap(this.result);
-        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.
-     */
-    static getSimpleCovering(region, start, level) {
-        return this.floodFill(region, S2CellId_1.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.
-     */
-    newCandidate(cell) {
-        if (!this.region.mayIntersectC(cell)) {
-            return null;
-        }
-        let 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;
-                }
-            }
-        }
-        const candidate = new Candidate();
-        candidate.cell = cell;
-        candidate.isTerminal = isTerminal;
-        candidate.numChildren = 0;
-        if (!isTerminal) {
-            candidate.children = [];
-            const numOfChildren = 1 << this.maxChildrenShift();
-            for (let i = 0; i < numOfChildren; i++) {
-                candidate.children.push(new Candidate());
-            }
-        }
-        this.candidatesCreatedCounter++;
-        return candidate;
-    }
-    /** Return the log base 2 of the maximum number of children of a candidate. */
-    maxChildrenShift() {
-        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.
-     */
-    addCandidate(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.
-        const numLevels = (candidate.cell.level < this.minLevel) ? 1 : this.levelMod;
-        const numTerminals = this.expandChildren(candidate, candidate.cell, numLevels);
-        if (candidate.numChildren == 0) {
-            // Do nothing
-        }
-        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.
-            const priority = -((((candidate.cell.level << this.maxChildrenShift()) + candidate.numChildren)
-                << this.maxChildrenShift()) + numTerminals);
-            this.candidateQueue.add(new QueueEntry(priority, candidate));
-            // logger.info("Push: " + candidate.cell.id() + " (" + priority + ") ");
-        }
-    }
-    /**
-     * 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".
-     */
-    expandChildren(candidate, cell, numLevels) {
-        numLevels--;
-        const childCells = cell.subdivide();
-        let numTerminals = 0;
-        for (let i = 0; i < 4; ++i) {
-            if (numLevels > 0) {
-                if (this.region.mayIntersectC(childCells[i])) {
-                    numTerminals += this.expandChildren(candidate, childCells[i], numLevels);
-                }
-                continue;
-            }
-            const 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. */
-    getInitialCandidates() {
-        // 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.
-            const cap = this.region.getCapBound();
-            let level = Math.min(S2Projections_1.S2Projections.MIN_WIDTH.getMaxLevel(2 * cap.angle().radians), 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.
-                const id = S2CellId_1.S2CellId.fromPoint(cap.axis);
-                const base = id.getVertexNeighbors(level);
-                for (let 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 (let face = 0; face < 6; ++face) {
-            this.addCandidate(this.newCandidate(S2RegionCoverer.FACE_CELLS[face]));
-        }
-    }
-    /** Generates a covering and stores it in result. */
-    getCoveringInternal(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)) {
-            const candidate = this.candidateQueue.poll().candidate;
-            if (this.interiorCovering || candidate.cell.level < this.minLevel || candidate.numChildren == 1
-                || this.result.length + this.candidateQueue.size() + candidate.numChildren <= this.maxCells) {
-                // Expand this candidate into its children.
-                for (let i = 0; i < candidate.numChildren; ++i) {
-                    if (!this.interiorCovering || this.result.length < this.maxCells) {
-                        this.addCandidate(candidate.children[i]);
-                    }
-                }
-            }
-            else {
-                candidate.isTerminal = true;
-                this.addCandidate(candidate);
-            }
-        }
-        this.candidateQueue.clear();
-        this.region = null;
-    }
-    /**
-     * Given a region and a starting cell, return the set of all the edge-connected cells at the same
-     * level that intersect "region". The output cells are returned in arbitrary order.
-     */
-    static floodFill(region, start) {
-        const all = new Set();
-        const frontier = [];
-        const output = [];
-        all.add(start.toToken());
-        frontier.push(start);
-        while (frontier.length !== 0) {
-            const id = frontier.pop();
-            if (!region.mayIntersectC(new S2Cell_1.S2Cell(id))) {
-                continue;
-            }
-            output.push(id);
-            const neighbors = id.getEdgeNeighbors();
-            for (let edge = 0; edge < 4; ++edge) {
-                const nbr = neighbors[edge];
-                if (!all.has(nbr.toToken())) {
-                    frontier.push(nbr);
-                    all.add(nbr.toToken());
-                }
-            }
-        }
-        return output;
-    }
-}
-exports.S2RegionCoverer = 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).
- */
-S2RegionCoverer.DEFAULT_MAX_CELLS = 8;
-S2RegionCoverer.FACE_CELLS = [0, 1, 2, 3, 4, 5].map(face => S2Cell_1.S2Cell.fromFace(face));
-class Candidate {
-    // elements.
-    toString() {
-        return `isTerminal: ${this.isTerminal} - Cell: ${this.cell.toString()}`;
-    }
-}
-class PriorityQueue {
-    constructor() {
-        this.clear();
-    }
-    add(item) {
-        this.items.push(item);
-        this.items.sort((a, b) => a.compare(b));
-    }
-    clear() {
-        this.items = [];
-    }
-    size() {
-        return this.items.length;
-    }
-    poll() {
-        return this.items.splice(0, 1)[0];
-    }
-}
-class QueueEntry {
-    constructor(id, candidate) {
-        this.id = id;
-        this.candidate = candidate;
-    }
-    compare(other) {
-        return this.id < other.id ? 1 : (this.id > other.id ? -1 : 0);
-    }
-}
-//# 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,qCAAgC;AAEhC,yCAAoC;AACpC,+CAA0C;AAC1C,mDAA8C;AAE9C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAa,eAAe;IA4C1B;;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,WAAW,CAAC,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,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,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,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACI,WAAW,CAAC,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,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA6BG;IACI,WAAW,CAAC,QAAe;QAChC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,WAAW;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAEM,WAAW;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAEM,WAAW;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAEM,WAAW;QAChB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED;;;;;;OAMG;IACI,gBAAgB,CAAC,MAAe;QACrC,mEAAmE;QACnE,4EAA4E;QAC5E,sEAAsE;QACtE,mEAAmE;QACnE,uEAAuE;QACvE,sEAAsE;QACtE,6CAA6C;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;QAC1C,OAAO,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACI,wBAAwB,CAAC,MAAe;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,wBAAwB,CAAC,MAAM,CAAC,CAAC;QAClD,OAAO,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACvD,CAAC;IAED;;;;;;;OAOG;IACI,gBAAgB,CAAC,MAAe,EAAE,WAAuB,IAAI,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,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,wBAAwB,CAAC,MAAe,EAAE,WAAqB,IAAI,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,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAgB,EAAE,KAAc,EAAE,KAAa;QAC7E,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,mBAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,IAAW;QAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;YACpC,OAAO,IAAI,CAAC;SACb;QAED,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC/B,IAAI,IAAI,CAAC,gBAAgB,EAAE;gBACzB,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBAC/B,UAAU,GAAG,IAAI,CAAC;iBACnB;qBAAM,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,EAAE;oBACrD,OAAO,IAAI,CAAC;iBACb;aACF;iBAAM;gBACL,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE;oBAC7E,UAAU,GAAG,IAAI,CAAC;iBACnB;aACF;SACF;QAED,MAAM,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,IAAI,CAAC,UAAU,EAAE;YACf,SAAS,CAAC,QAAQ,GAAG,EAAE,CAAC;YACxB,MAAM,aAAa,GAAG,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,EAAE,CAAC,EAAE,EAAE;gBACtC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC,CAAA;aACzC;SACF;QACD,IAAI,CAAC,wBAAwB,EAAE,CAAC;QAChC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,8EAA8E;IACtE,gBAAgB;QACtB,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,SAAmB;QACtC,IAAI,SAAS,IAAI,IAAI,EAAE;YACrB,OAAO;SACR;QAED,IAAI,SAAS,CAAC,UAAU,EAAE;YACxB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,OAAO;SACR;QACD,uCAAuC;QAEvC,oEAAoE;QACpE,yBAAyB;QACzB,MAAM,SAAS,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;QAE7E,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAE/E,IAAI,SAAS,CAAC,WAAW,IAAI,CAAC,EAAE;YAC9B,aAAa;SACd;aAAM,IAAI,CAAC,IAAI,CAAC,gBAAgB,IAAI,YAAY,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;eAC1E,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC5C,qEAAqE;YACrE,mEAAmE;YACnE,oEAAoE;YACpE,0BAA0B;YAC1B,SAAS,CAAC,UAAU,GAAG,IAAI,CAAC;YAC5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;SAE9B;aAAM;YACL,0EAA0E;YAC1E,sEAAsE;YACtE,wEAAwE;YACxE,qEAAqE;YACrE,yEAAyE;YACzE,yDAAyD;YACzD,MAAM,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;YAC7D,wEAAwE;SACzE;IACH,CAAC;IAED;;;;OAIG;IACK,cAAc,CAAC,SAAmB,EAAE,IAAW,EAAE,SAAgB;QACvE,SAAS,EAAE,CAAC;QAEZ,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAEpC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE;YAC1B,IAAI,SAAS,GAAG,CAAC,EAAE;gBACjB,IAAI,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE;oBAC5C,YAAY,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;iBAC1E;gBACD,SAAS;aACV;YACD,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAE/C,IAAI,KAAK,IAAI,IAAI,EAAE;gBACjB,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC;gBACpD,IAAI,KAAK,CAAC,UAAU,EAAE;oBACpB,EAAE,YAAY,CAAC;iBAChB;aACF;SACF;QAGD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,wEAAwE;IAChE,oBAAoB;QAC1B,mEAAmE;QACnE,kEAAkE;QAClE,mEAAmE;QACnE,kCAAkC;QAClC,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE;YACtB,yEAAyE;YACzE,6BAA6B;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YACtC,IAAI,KAAK,GACL,IAAI,CAAC,GAAG,CACJ,6BAAa,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,EAC5D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,mBAAQ,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;YACzD,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE;gBAC9C,KAAK,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;aAClD;YAED,0EAA0E;YAC1E,mCAAmC;YACnC,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,kEAAkE;gBAClE,0CAA0C;gBAE1C,MAAM,EAAE,GAAG,mBAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACxC,MAAM,IAAI,GAAG,EAAE,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;gBAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;oBACpC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,eAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC3D;gBACD,OAAO;aACR;SACF;QACD,0CAA0C;QAC1C,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE;YACnC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;SACxE;IACH,CAAC;IAED,oDAAoD;IAC5C,mBAAmB,CAAC,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,IAAI,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE;YACjE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAA;SACnD;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;YACzG,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC;YACvD,IAAI,IAAI,CAAC,gBAAgB,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC,WAAW,IAAI,CAAC;mBACxF,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC/F,2CAA2C;gBAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,EAAE,EAAE,CAAC,EAAE;oBAC9C,IAAI,CAAC,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE;wBAChE,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;qBAC1C;iBACF;aACF;iBAAM;gBACL,SAAS,CAAC,UAAU,GAAG,IAAI,CAAC;gBAC5B,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;aAC9B;SACF;QAED,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IACrB,CAAC;IAED;;;OAGG;IACK,MAAM,CAAC,SAAS,CAAC,MAAgB,EAAE,KAAe;QACxD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;QAC9B,MAAM,QAAQ,GAAe,EAAE,CAAC;QAChC,MAAM,MAAM,GAAe,EAAE,CAAC;QAE9B,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QACzB,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,OAAO,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE;YAC5B,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,eAAM,CAAC,EAAE,CAAC,CAAC,EAAE;gBACzC,SAAS;aACV;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEhB,MAAM,SAAS,GAAe,EAAE,CAAC,gBAAgB,EAAE,CAAC;YACpD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE;gBACnC,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;gBAC5B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE;oBAC3B,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACnB,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;iBACxB;aACF;SACF;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;;AA3cH,0CA4cC;AA1cC;;;;GAIG;AACW,iCAAiB,GAAG,CAAC,CAAC;AAErB,0BAAU,GAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,eAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;AAsc7F,MAAM,SAAS;IAKb,YAAY;IAEL,QAAQ;QACb,OAAO,eAAe,IAAI,CAAC,UAAU,YAAY,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC;IAC1E,CAAC;CACF;AAKD,MAAM,aAAa;IAGjB;QACE,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,GAAG,CAAC,IAAM;QACR,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IAClB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;CACF;AAED,MAAM,UAAU;IAKd,YAA0B,EAAS,EAAS,SAAmB;QAArC,OAAE,GAAF,EAAE,CAAO;QAAS,cAAS,GAAT,SAAS,CAAU;IAE/D,CAAC;IAND,OAAO,CAAC,KAAgB;QACtB,OAAO,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;CAKF"}

package/dist/utils/preconditions.d.ts

@@ -1,2 +0,0 @@
-export declare function checkArgument(condition: boolean, message?: string): void;
-export declare function checkState(condition: boolean, message?: string): void;

package/dist/utils/preconditions.js

@@ -1,16 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.checkState = exports.checkArgument = void 0;
-function checkArgument(condition, message) {
-    if (!condition) {
-        throw Error('IllegalArgumentException: ' + (message || ''));
-    }
-}
-exports.checkArgument = checkArgument;
-function checkState(condition, message) {
-    if (!condition) {
-        throw Error('IllegalStateException: ' + (message || ''));
-    }
-}
-exports.checkState = checkState;
-//# sourceMappingURL=preconditions.js.map

package/dist/utils/preconditions.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"preconditions.js","sourceRoot":"","sources":["../../src/utils/preconditions.ts"],"names":[],"mappings":";;;AAAA,SAAgB,aAAa,CAAC,SAAkB,EAAE,OAAgB;IAChE,IAAI,CAAC,SAAS,EAAE;QACd,MAAM,KAAK,CAAC,4BAA4B,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC;KAC7D;AACH,CAAC;AAJD,sCAIC;AAED,SAAgB,UAAU,CAAC,SAAkB,EAAE,OAAgB;IAC7D,IAAI,CAAC,SAAS,EAAE;QACd,MAAM,KAAK,CAAC,yBAAyB,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC;KAC1D;AACH,CAAC;AAJD,gCAIC"}