nodes2ts 3.0.0 → 4.0.1

package/dist/S2CellUnion.js

@@ -1,523 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.S2CellUnion = void 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.
- */
-const Long = require("long");
-const S2CellId_1 = require("./S2CellId");
-const S2Cell_1 = require("./S2Cell");
-const S2Projections_1 = require("./S2Projections");
-const S2LatLngRect_1 = require("./S2LatLngRect");
-const S2Point_1 = require("./S2Point");
-const S2Cap_1 = require("./S2Cap");
-const S1ChordAngle_1 = require("./S1ChordAngle");
-/**
- * An S2CellUnion is a region consisting of cells of various sizes. Typically a
- * cell union is used to approximate some other shape. There is a tradeoff
- * between the accuracy of the approximation and how many cells are used. Unlike
- * polygons, cells have a fixed hierarchical structure. This makes them more
- * suitable for optimizations based on preprocessing.
- *
- */
-class S2CellUnion {
-    constructor() {
-        /** The CellIds that form the Union */
-        this.cellIds = [];
-    }
-    /**
-     * Populates a cell union with the given S2CellIds or 64-bit cells ids, and
-     * then calls Normalize(). The InitSwap() version takes ownership of the
-     * vector data without copying and clears the given vector. These methods may
-     * be called multiple times.
-     */
-    initFromIds(cellIds) {
-        this.initRawIds(cellIds);
-        this.normalize();
-    }
-    initFromCellIds(cellIds) {
-        this.initRawCellIds(cellIds);
-        this.normalize();
-    }
-    initSwap(cellIds) {
-        this.initRawSwap(cellIds);
-        this.normalize();
-    }
-    initRawCellIds(cellIds) {
-        this.cellIds = cellIds;
-    }
-    initRawIds(cellIds) {
-        const size = cellIds.length;
-        this.cellIds = [];
-        for (let i = 0; i < size; i++) {
-            this.cellIds.push(new S2CellId_1.S2CellId(cellIds[i]));
-        }
-    }
-    /**
-     * Like Init(), but does not call Normalize(). The cell union *must* be
-     * normalized before doing any calculations with it, so it is the caller's
-     * responsibility to make sure that the input is normalized. This method is
-     * useful when converting cell unions to another representation and back.
-     * These methods may be called multiple times.
-     */
-    initRawSwap(cellIds) {
-        this.cellIds = [].concat(cellIds);
-    }
-    size() {
-        return this.cellIds.length;
-    }
-    /** Convenience methods for accessing the individual cell ids. */
-    cellId(i) {
-        return this.cellIds[i];
-    }
-    getCellIds() {
-        return this.cellIds;
-    }
-    /**
-     * Replaces "output" with an expanded version of the cell union where any
-     * cells whose level is less than "min_level" or where (level - min_level) is
-     * not a multiple of "level_mod" are replaced by their children, until either
-     * both of these conditions are satisfied or the maximum level is reached.
-     *
-     *  This method allows a covering generated by S2RegionCoverer using
-     * min_level() or level_mod() constraints to be stored as a normalized cell
-     * union (which allows various geometric computations to be done) and then
-     * converted back to the original list of cell ids that satisfies the desired
-     * constraints.
-     */
-    denormalize(minLevel, levelMod) {
-        // assert (minLevel >= 0 && minLevel <= S2CellId.MAX_LEVEL);
-        // assert (levelMod >= 1 && levelMod <= 3);
-        const output = [];
-        for (let i = 0; i < this.cellIds.length; i++) {
-            const id = this.cellIds[i];
-            const level = id.level();
-            let newLevel = Math.max(minLevel, level);
-            if (levelMod > 1) {
-                // Round up so that (new_level - min_level) is a multiple of level_mod.
-                // (Note that S2CellId::kMaxLevel is a multiple of 1, 2, and 3.)
-                newLevel += (S2CellId_1.S2CellId.MAX_LEVEL - (newLevel - minLevel)) % levelMod;
-                newLevel = Math.min(S2CellId_1.S2CellId.MAX_LEVEL, newLevel);
-            }
-            if (newLevel == level) {
-                output.push(id);
-            }
-            else {
-                const end = id.childEndL(newLevel);
-                for (let iid = id.childBeginL(newLevel); !iid.equals(end); iid = iid.next()) {
-                    output.push(iid);
-                }
-            }
-        }
-        return output;
-    }
-    /**
-     * If there are more than "excess" elements of the cell_ids() vector that are
-     * allocated but unused, reallocate the array to eliminate the excess space.
-     * This reduces memory usage when many cell unions need to be held in memory
-     * at once.
-     */
-    pack() {
-        throw new Error('useless');
-        // this.cellIds.trimToSize();
-    }
-    containsC(cell) {
-        return this.containsCell(cell);
-    }
-    mayIntersectC(cell) {
-        return this.mayIntersectCell(cell);
-    }
-    /**
-     * Return true if the cell union contains the given cell id. Containment is
-     * defined with respect to regions, e.g. a cell contains its 4 children. This
-     * is a fast operation (logarithmic in the size of the cell union).
-     */
-    contains(id) {
-        // This function requires that Normalize has been called first.
-        //
-        // This is an exact test. Each cell occupies a linear span of the S2
-        // space-filling curve, and the cell id is simply the position at the center
-        // of this span. The cell union ids are sorted in increasing order along
-        // the space-filling curve. So we simply find the pair of cell ids that
-        // surround the given cell id (using binary search). There is containment
-        // if and only if one of these two cell ids contains this cell.
-        let pos = S2CellId_1.S2CellId.binarySearch(this.cellIds, id.id);
-        if (pos < 0) {
-            pos = -pos - 1;
-        }
-        if (pos < this.cellIds.length && this.cellIds[pos].rangeMin().lessOrEquals(id)) {
-            return true;
-        }
-        return pos != 0 && this.cellIds[pos - 1].rangeMax().greaterOrEquals(id);
-    }
-    /**
-     * Return true if the cell union intersects the given cell id. This is a fast
-     * operation (logarithmic in the size of the cell union).
-     */
-    intersects(id) {
-        // This function requires that Normalize has been called first.
-        // This is an exact test; see the comments for Contains() above.
-        let pos = S2CellId_1.S2CellId.binarySearch(this.cellIds, id.id);
-        if (pos < 0) {
-            pos = -pos - 1;
-        }
-        if (pos < this.cellIds.length && this.cellIds[pos].rangeMin().lessOrEquals(id.rangeMax())) {
-            return true;
-        }
-        return pos != 0 && this.cellIds[pos - 1].rangeMax().greaterOrEquals(id.rangeMin());
-    }
-    containsUnion(that) {
-        // A divide-and-conquer or alternating-skip-search approach
-        // may be significantly faster in both the average and worst case.
-        for (let i = 0; i < that.cellIds.length; i++) {
-            if (!this.contains(that.cellIds[i])) {
-                return false;
-            }
-        }
-        return true;
-    }
-    /** This is a fast operation (logarithmic in the size of the cell union). */
-    containsCell(cell) {
-        return this.contains(cell.id);
-    }
-    /**
-     * Return true if this cell union contain/intersects the given other cell
-     * union.
-     */
-    intersectsUnion(that) {
-        // A divide-and-conquer or alternating-skip-search approach
-        // may be significantly faster in both the average and worst case.
-        for (let i = 0; i < that.cellIds.length; i++) {
-            if (!this.intersects(that.cellIds[i])) {
-                return false;
-            }
-        }
-        return true;
-    }
-    getUnion(x, y) {
-        // assert (x != this && y != this);
-        this.cellIds = [].concat(x.cellIds).concat(y.cellIds);
-        this.normalize();
-    }
-    /**
-     * Specialized version of GetIntersection() that gets the intersection of a
-     * cell union with the given cell id. This can be useful for "splitting" a
-     * cell union into chunks.
-     */
-    getIntersection(x, id) {
-        // assert (x != this);
-        this.cellIds = [];
-        if (x.contains(id)) {
-            this.cellIds.push(id);
-        }
-        else {
-            let pos = S2CellId_1.S2CellId.binarySearch(x.cellIds, id.rangeMin().id);
-            if (pos < 0) {
-                pos = -pos - 1;
-            }
-            const idmax = id.rangeMax();
-            const size = x.cellIds.length;
-            while (pos < size && x.cellIds[pos].lessOrEquals(idmax)) {
-                this.cellIds.push(x.cellIds[(pos++)]);
-            }
-        }
-    }
-    /**
-     * Initialize this cell union to the union or intersection of the two given
-     * cell unions. Requires: x != this and y != this.
-     */
-    getIntersectionUU(x, y) {
-        // assert (x != this && y != this);
-        // This is a fairly efficient calculation that uses binary search to skip
-        // over sections of both input vectors. It takes constant time if all the
-        // cells of "x" come before or after all the cells of "y" in S2CellId order.
-        this.cellIds = [];
-        let i = 0;
-        let j = 0;
-        while (i < x.cellIds.length && j < y.cellIds.length) {
-            const imin = x.cellId(i).rangeMin();
-            const jmin = y.cellId(j).rangeMin();
-            if (imin.greaterThan(jmin)) {
-                // Either j->contains(*i) or the two cells are disjoint.
-                if (x.cellId(i).lessOrEquals(y.cellId(j).rangeMax())) {
-                    this.cellIds.push(x.cellId(i++));
-                }
-                else {
-                    // Advance "j" to the first cell possibly contained by *i.
-                    j = S2CellId_1.S2CellId.indexedBinarySearch(y.cellIds, imin, j + 1);
-                    // The previous cell *(j-1) may now contain *i.
-                    if (x.cellId(i).lessOrEquals(y.cellId(j - 1).rangeMax())) {
-                        --j;
-                    }
-                }
-            }
-            else if (jmin.greaterThan(imin)) {
-                // Identical to the code above with "i" and "j" reversed.
-                if (y.cellId(j).lessOrEquals(x.cellId(i).rangeMax())) {
-                    this.cellIds.push(y.cellId(j++));
-                }
-                else {
-                    i = S2CellId_1.S2CellId.indexedBinarySearch(x.cellIds, jmin, i + 1);
-                    if (y.cellId(j).lessOrEquals(x.cellId(i - 1).rangeMax())) {
-                        --i;
-                    }
-                }
-            }
-            else {
-                // "i" and "j" have the same range_min(), so one contains the other.
-                if (x.cellId(i).lessThan(y.cellId(j))) {
-                    this.cellIds.push(x.cellId(i++));
-                }
-                else {
-                    this.cellIds.push(y.cellId(j++));
-                }
-            }
-        }
-        // The output is generated in sorted order, and there should not be any
-        // cells that can be merged (provided that both inputs were normalized).
-        // assert (!normalize());
-    }
-    /**
-     * Expands the cell union such that it contains all cells of the given level
-     * that are adjacent to any cell of the original union. Two cells are defined
-     * as adjacent if their boundaries have any points in common, i.e. most cells
-     * have 8 adjacent cells (not counting the cell itself).
-     *
-     *  Note that the size of the output is exponential in "level". For example,
-     * if level == 20 and the input has a cell at level 10, there will be on the
-     * order of 4000 adjacent cells in the output. For most applications the
-     * Expand(min_fraction, min_distance) method below is easier to use.
-     */
-    expand(level) {
-        let output = [];
-        const levelLsb = S2CellId_1.S2CellId.lowestOnBitForLevel(level);
-        let i = this.size() - 1;
-        do {
-            let id = this.cellId(i);
-            if (id.lowestOnBit().lessThan(levelLsb)) {
-                id = id.parentL(level);
-                // Optimization: skip over any cells contained by this one. This is
-                // especially important when very small regions are being expanded.
-                while (i > 0 && id.contains(this.cellId(i - 1))) {
-                    --i;
-                }
-            }
-            output.push(id);
-            output = output.concat(id.getAllNeighbors(level));
-        } while (--i >= 0);
-        this.initSwap(output);
-    }
-    /**
-     * Expand the cell union such that it contains all points whose distance to
-     * the cell union is at most minRadius, but do not use cells that are more
-     * than maxLevelDiff levels higher than the largest cell in the input. The
-     * second parameter controls the tradeoff between accuracy and output size
-     * when a large region is being expanded by a small amount (e.g. expanding
-     * Canada by 1km).
-     *
-     *  For example, if maxLevelDiff == 4, the region will always be expanded by
-     * approximately 1/16 the width of its largest cell. Note that in the worst
-     * case, the number of cells in the output can be up to 4 * (1 + 2 **
-     * maxLevelDiff) times larger than the number of cells in the input.
-     */
-    expandA(minRadius, maxLevelDiff) {
-        let minLevel = S2CellId_1.S2CellId.MAX_LEVEL;
-        for (let i = 0; i < this.cellIds.length; i++) {
-            const id = this.cellId(i);
-            minLevel = Math.min(minLevel, id.level());
-        }
-        // Find the maximum level such that all cells are at least "min_radius"
-        // wide.
-        const radiusLevel = S2Projections_1.S2Projections.MIN_WIDTH.getMaxLevel(minRadius.radians);
-        if (radiusLevel == 0 && minRadius.radians > (S2Projections_1.S2Projections.MIN_WIDTH.getValue(0))) {
-            // The requested expansion is greater than the width of a face cell.
-            // The easiest way to handle this is to expand twice.
-            this.expand(0);
-        }
-        this.expand(Math.min(minLevel + maxLevelDiff, radiusLevel));
-    }
-    getCapBound() {
-        // Compute the approximate centroid of the region. This won't produce the
-        // bounding cap of minimal area, but it should be close enough.
-        if (this.cellIds.length == 0) {
-            return S2Cap_1.S2Cap.empty();
-        }
-        let centroid = new S2Point_1.S2Point(0, 0, 0);
-        this.cellIds.forEach(id => {
-            const area = S2Cell_1.S2Cell.averageArea(id.level());
-            centroid = S2Point_1.S2Point.add(centroid, S2Point_1.S2Point.mul(id.toPoint(), area));
-        });
-        if (centroid.equals(S2Point_1.S2Point.ORIGIN)) {
-            centroid = S2Point_1.S2Point.X_POS;
-        }
-        else {
-            centroid = S2Point_1.S2Point.normalize(centroid);
-        }
-        // Use the centroid as the cap axis, and expand the cap angle so that it
-        // contains the bounding caps of all the individual cells. Note that it is
-        // *not* sufficient to just bound all the cell vertices because the bounding
-        // cap may be concave (i.e. cover more than one hemisphere).
-        let cap = S2Cap_1.S2Cap.fromAxisChord(centroid, S1ChordAngle_1.S1ChordAngle.ZERO);
-        this.cellIds.forEach(id => {
-            cap = cap.addCap(new S2Cell_1.S2Cell(id).getCapBound());
-        });
-        return cap;
-    }
-    getRectBound() {
-        let bound = S2LatLngRect_1.S2LatLngRect.empty();
-        this.cellIds.forEach(id => {
-            bound = bound.union(new S2Cell_1.S2Cell(id).getRectBound());
-        });
-        return bound;
-    }
-    /** This is a fast operation (logarithmic in the size of the cell union). */
-    mayIntersectCell(cell) {
-        return this.intersects(cell.id);
-    }
-    /**
-     * The point 'p' does not need to be normalized. This is a fast operation
-     * (logarithmic in the size of the cell union).
-     */
-    containsPoint(p) {
-        return this.contains(S2CellId_1.S2CellId.fromPoint(p));
-    }
-    /**
-     * The number of leaf cells covered by the union.
-     * This will be no more than 6*2^60 for the whole sphere.
-     *
-     * @return the number of leaf cells covered by the union
-     */
-    leafCellsCovered() {
-        let numLeaves = new Long(0);
-        this.cellIds.forEach((id) => {
-            const invertedLevel = S2CellId_1.S2CellId.MAX_LEVEL - id.level();
-            numLeaves = numLeaves
-                .add(new Long(1).shiftLeft(invertedLevel << 1));
-        });
-        return numLeaves;
-    }
-    /**
-     * Approximate this cell union's area by summing the average area of
-     * each contained cell's average area, using {@link S2Cell#averageArea()}.
-     * This is equivalent to the number of leaves covered, multiplied by
-     * the average area of a leaf.
-     * Note that {@link S2Cell#averageArea()} does not take into account
-     * distortion of cell, and thus may be off by up to a factor of 1.7.
-     * NOTE: Since this is proportional to LeafCellsCovered(), it is
-     * always better to use the other function if all you care about is
-     * the relative average area between objects.
-     *
-     * @return the sum of the average area of each contained cell's average area
-     */
-    averageBasedArea() {
-        return this.leafCellsCovered().mul(S2Projections_1.S2Projections.AVG_AREA.getValue(S2CellId_1.S2CellId.MAX_LEVEL)).toNumber();
-    }
-    /**
-     * Calculates this cell union's area by summing the approximate area for each
-     * contained cell, using {@link S2Cell#approxArea()}.
-     *
-     * @return approximate area of the cell union
-     */
-    approxArea() {
-        let area = 0;
-        this.cellIds.forEach(id => {
-            area = area + (new S2Cell_1.S2Cell(id).approxArea());
-        });
-        return area;
-    }
-    /**
-     * Calculates this cell union's area by summing the exact area for each
-     * contained cell, using the {@link S2Cell#exactArea()}.
-     *
-     * @return the exact area of the cell union
-     */
-    exactArea() {
-        let area = 0;
-        this.cellIds.forEach(id => {
-            area = area + new S2Cell_1.S2Cell(id).exactArea();
-        });
-        return area;
-    }
-    /**
-     * Normalizes the cell union by discarding cells that are contained by other
-     * cells, replacing groups of 4 child cells by their parent cell whenever
-     * possible, and sorting all the cell ids in increasing order. Returns true if
-     * the number of cells was reduced.
-     *
-     *  This method *must* be called before doing any calculations on the cell
-     * union, such as Intersects() or Contains().
-     *
-     * @return true if the normalize operation had any effect on the cell union,
-     *         false if the union was already normalized
-     */
-    normalize() {
-        // Optimize the representation by looking for cases where all subcells
-        // of a parent cell are present.
-        const output = [];
-        // ArrayList<S2CellId> output = new ArrayList<>(this.cellIds.size());
-        // output.ensureCapacity(this.cellIds.size());
-        this.cellIds.sort((a, b) => a.compareTo(b));
-        // Collections.sort(this.cellIds);
-        this.cellIds.forEach(id => {
-            let size = output.length;
-            // Check whether this cell is contained by the previous cell.
-            if (output.length !== 0 && output[size - 1].contains(id)) {
-                return;
-            }
-            // Discard any previous cells contained by this cell.
-            while (output.length !== 0 && id.contains(output[output.length - 1])) {
-                output.splice(output.length - 1, 1);
-                // output.remove(output.size() - 1);
-            }
-            // Check whether the last 3 elements of "output" plus "id" can be
-            // collapsed into a single parent cell.
-            while (output.length >= 3) {
-                size = output.length;
-                // A necessary (but not sufficient) condition is that the XOR of the
-                // four cells must be zero. This is also very fast to test.
-                if ((output[size - 3].id.xor(output[size - 2].id).xor(output[size - 1].id)).notEquals(id.id)) {
-                    break;
-                }
-                // Now we do a slightly more expensive but exact test. First, compute a
-                // mask that blocks out the two bits that encode the child position of
-                // "id" with respect to its parent, then check that the other three
-                // children all agree with "mask.
-                let mask = id.lowestOnBit().shiftLeft(1);
-                mask = mask.add(mask.shiftLeft(1)).not();
-                // mask = ~(mask + (mask << 1));
-                const idMasked = id.id.and(mask);
-                if ((output[size - 3].id.and(mask)).notEquals(idMasked)
-                    || (output[size - 2].id.and(mask)).notEquals(idMasked)
-                    || (output[size - 1].id.and(mask)).notEquals(idMasked) || id.isFace()) {
-                    break;
-                }
-                // Replace four children by their parent cell.
-                output.splice(size - 3);
-                // output.remove(size - 1);
-                // output.remove(size - 2);
-                // output.remove(size - 3);
-                id = id.parent();
-            }
-            output.push(id);
-        });
-        if (output.length < this.size()) {
-            this.initRawSwap(output);
-            return true;
-        }
-        return false;
-    }
-}
-exports.S2CellUnion = S2CellUnion;
-//# sourceMappingURL=S2CellUnion.js.map

package/dist/S2CellUnion.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"S2CellUnion.js","sourceRoot":"","sources":["../src/S2CellUnion.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;GAcG;AACH,6BAA6B;AAE7B,yCAAoC;AACpC,qCAAgC;AAEhC,mDAA8C;AAC9C,iDAA4C;AAC5C,uCAAkC;AAClC,mCAA8B;AAC9B,iDAA8C;AAC9C;;;;;;;GAOG;AACH,MAAa,WAAW;IAAxB;QAGE,sCAAsC;QAC9B,YAAO,GAAc,EAAE,CAAC;IAuhBlC,CAAC;IArhBC;;;;;OAKG;IACI,WAAW,CAAC,OAAuB;QACxC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzB,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAEM,eAAe,CAAC,OAAkB;QACvC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAEM,QAAQ,CAAC,OAAkB;QAChC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1B,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAEM,cAAc,CAAC,OAAkB;QACtC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAEM,UAAU,CAAC,OAAuB;QACvC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC;QAC5B,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE;YAC7B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,mBAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7C;IACH,CAAC;IAED;;;;;;OAMG;IACI,WAAW,CAAC,OAAkB;QACnC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,IAAI;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,iEAAiE;IAC1D,MAAM,CAAC,CAAQ;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IAEM,UAAU;QACf,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAGD;;;;;;;;;;;OAWG;IACI,WAAW,CAAC,QAAe,EAAE,QAAe;QACjD,4DAA4D;QAC5D,2CAA2C;QAC3C,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;YACzB,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YACzC,IAAI,QAAQ,GAAG,CAAC,EAAE;gBAChB,uEAAuE;gBACvE,gEAAgE;gBAChE,QAAQ,IAAI,CAAC,mBAAQ,CAAC,SAAS,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC;gBACpE,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,mBAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;aACnD;YACD,IAAI,QAAQ,IAAI,KAAK,EAAE;gBACrB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACjB;iBAAM;gBACL,MAAM,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;gBACnC,KAAK,IAAI,GAAG,GAAG,EAAE,CAAC,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE,EAAE;oBAC3E,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;iBAClB;aACF;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACI,IAAI;QACT,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;QAC3B,6BAA6B;IAC/B,CAAC;IACD,SAAS,CAAC,IAAW;QACnB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,aAAa,CAAC,IAAW;QACvB,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;;OAIG;IACI,QAAQ,CAAC,EAAW;QACzB,+DAA+D;QAC/D,EAAE;QACF,oEAAoE;QACpE,4EAA4E;QAC5E,wEAAwE;QACxE,uEAAuE;QACvE,yEAAyE;QACzE,+DAA+D;QAE/D,IAAI,GAAG,GAAG,mBAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QACrD,IAAI,GAAG,GAAG,CAAC,EAAE;YACX,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;SAChB;QACD,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE;YAC9E,OAAO,IAAI,CAAC;SACb;QACD,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,EAAW;QAC3B,+DAA+D;QAC/D,gEAAgE;QAChE,IAAI,GAAG,GAAG,mBAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAErD,IAAI,GAAG,GAAG,CAAC,EAAE;YACX,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;SAChB;QAGD,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE;YACzF,OAAO,IAAI,CAAC;SACb;QACD,OAAO,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;IACrF,CAAC;IAEM,aAAa,CAAC,IAAgB;QACnC,2DAA2D;QAC3D,kEAAkE;QAClE,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAC,CAAC,EAAE,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE;gBACnC,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,4EAA4E;IACrE,YAAY,CAAC,IAAW;QAC7B,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED;;;OAGG;IACI,eAAe,CAAC,IAAgB;QACrC,2DAA2D;QAC3D,kEAAkE;QAClE,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAC,CAAC,EAAE,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE;gBACrC,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IAEd,CAAC;IAEM,QAAQ,CAAC,CAAa,EAAE,CAAa;QAC1C,mCAAmC;QACnC,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACtD,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,CAAa,EAAE,EAAW;QAChD,sBAAsB;QACtB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;YAClB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;SACvB;aAAM;YACL,IAAI,GAAG,GAAG,mBAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;YAE7D,IAAI,GAAG,GAAG,CAAC,EAAE;gBACX,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;aAChB;YAED,MAAM,KAAK,GAAG,EAAE,CAAC,QAAQ,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;YAC9B,OAAO,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE;gBACvD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;aACvC;SACF;IACH,CAAC;IAED;;;OAGG;IACI,iBAAiB,CAAC,CAAa,EAAE,CAAa;QACnD,mCAAmC;QAEnC,yEAAyE;QACzE,yEAAyE;QACzE,4EAA4E;QAE5E,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAElB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE;YAEnD,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YAEpC,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;gBAC1B,wDAAwD;gBACxD,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE;oBACpD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBAClC;qBAAM;oBACL,0DAA0D;oBAC1D,CAAC,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzD,+CAA+C;oBAC/C,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE;wBACxD,EAAE,CAAC,CAAC;qBACL;iBACF;aACF;iBAAM,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;gBACjC,yDAAyD;gBACzD,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE;oBACpD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBAClC;qBAAM;oBACL,CAAC,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzD,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,EAAE;wBACxD,EAAE,CAAC,CAAC;qBACL;iBACF;aACF;iBAAM;gBACL,oEAAoE;gBACpE,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;oBACrC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBAClC;qBAAM;oBACL,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBAClC;aACF;SACF;QACD,uEAAuE;QACvE,wEAAwE;QACxE,yBAAyB;IAC3B,CAAC;IAGD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,KAAY;QACxB,IAAI,MAAM,GAAc,EAAE,CAAC;QAE3B,MAAM,QAAQ,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QACrD,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACxB,GAAG;YACD,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE;gBACvC,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBACvB,mEAAmE;gBACnE,mEAAmE;gBACnE,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;oBAC/C,EAAE,CAAC,CAAC;iBACL;aACF;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC;SACnD,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE;QACnB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACxB,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,OAAO,CAAC,SAAiB,EAAE,YAAmB;QACnD,IAAI,QAAQ,GAAG,mBAAQ,CAAC,SAAS,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC1B,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;SAC3C;QACD,uEAAuE;QACvE,QAAQ;QACR,MAAM,WAAW,GAAG,6BAAa,CAAC,SAAS,CAAC,WAAW,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC3E,IAAI,WAAW,IAAI,CAAC,IAAI,SAAS,CAAC,OAAO,GAAG,CAAC,6BAAa,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;YACjF,oEAAoE;YACpE,qDAAqD;YACrD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SAChB;QACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,YAAY,EAAE,WAAW,CAAC,CAAC,CAAC;IAC9D,CAAC;IAGK,WAAW;QACjB,yEAAyE;QACzE,+DAA+D;QAC/D,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE;YAC5B,OAAO,aAAK,CAAC,KAAK,EAAE,CAAC;SACtB;QACD,IAAI,QAAQ,GAAG,IAAI,iBAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACxB,MAAM,IAAI,GAAG,eAAM,CAAC,WAAW,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;YAC5C,QAAQ,GAAG,iBAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,iBAAO,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;QAEH,IAAI,QAAQ,CAAC,MAAM,CAAC,iBAAO,CAAC,MAAM,CAAC,EAAE;YACnC,QAAQ,GAAG,iBAAO,CAAC,KAAK,CAAC;SAC1B;aAAM;YACL,QAAQ,GAAG,iBAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;SACxC;QAED,wEAAwE;QACxE,0EAA0E;QAC1E,4EAA4E;QAC5E,4DAA4D;QAC5D,IAAI,GAAG,GAAG,aAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,2BAAY,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACxB,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,eAAM,CAAC,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC;IACb,CAAC;IAEQ,YAAY;QACjB,IAAI,KAAK,GAAG,2BAAY,CAAC,KAAK,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACxB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,eAAM,CAAC,EAAE,CAAC,CAAC,YAAY,EAAE,CAAC,CAAA;QACpD,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;IAGD,4EAA4E;IACrE,gBAAgB,CAAC,IAAW;QACjC,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACK,aAAa,CAAC,CAAS;QAC7B,OAAO,IAAI,CAAC,QAAQ,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9C,CAAC;IAED;;;;;OAKG;IACI,gBAAgB;QACrB,IAAI,SAAS,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,EAAW,EAAE,EAAE;YACnC,MAAM,aAAa,GAAG,mBAAQ,CAAC,SAAS,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;YACtD,SAAS,GAAG,SAAS;iBAChB,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,aAAa,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC;QACH,OAAO,SAAS,CAAC;IACnB,CAAC;IAGD;;;;;;;;;;;;OAYG;IACI,gBAAgB;QACrB,OAAO,IAAI,CAAC,gBAAgB,EAAE,CAAC,GAAG,CAAC,6BAAa,CAAC,QAAQ,CAAC,QAAQ,CAAC,mBAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACrG,CAAC;IAED;;;;;OAKG;IACI,UAAU;QACf,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACxB,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,eAAM,CAAC,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACI,SAAS;QACd,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACxB,IAAI,GAAG,IAAI,GAAG,IAAI,eAAM,CAAC,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC;QAC3C,CAAC,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAGD;;;;;;;;;;;OAWG;IACI,SAAS;QACd,sEAAsE;QACtE,gCAAgC;QAChC,MAAM,MAAM,GAAc,EAAE,CAAC;QAC7B,qEAAqE;QACrE,8CAA8C;QAE9C,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,kCAAkC;QAElC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACxB,IAAI,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;YACzB,6DAA6D;YAC7D,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE;gBACxD,OAAO;aACR;YAED,qDAAqD;YACrD,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE;gBACpE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpC,oCAAoC;aACrC;YAED,iEAAiE;YACjE,uCAAuC;YACvC,OAAO,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE;gBACzB,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;gBACrB,oEAAoE;gBACpE,2DAA2D;gBAC3D,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;oBAC5F,MAAM;iBACP;gBAED,uEAAuE;gBACvE,sEAAsE;gBACtE,mEAAmE;gBACnE,iCAAiC;gBACjC,IAAI,IAAI,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAE;gBAC1C,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;gBACzC,gCAAgC;gBAChC,MAAM,QAAQ,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACjC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC;uBAChD,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC;uBACnD,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,MAAM,EAAE,EAAE;oBACzE,MAAM;iBACP;gBAED,8CAA8C;gBAC9C,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;gBACxB,2BAA2B;gBAC3B,2BAA2B;gBAC3B,2BAA2B;gBAC3B,EAAE,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC;aAClB;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC,CAAC,CAAC;QAEH,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE;YAC/B,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACzB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AA3hBD,kCA2hBC"}

package/dist/S2EdgeUtil.d.ts

@@ -1,17 +0,0 @@
-import { S2Point } from "./S2Point";
-import { S1Angle } from "./S1Angle";
-/**
- * This class contains various utility functions related to edges. It collects
- * together common code that is needed to implement polygonal geometry such as
- * polylines, loops, and general polygons.
- *
- */
-export declare class S2EdgeUtil {
-    /**
-     * A slightly more efficient version of getDistance() where the cross product
-     * of the two endpoints has been precomputed. The cross product does not need
-     * to be normalized, but should be computed using S2.robustCrossProd() for the
-     * most accurate results.
-     */
-    static getDistance(x: S2Point, a: S2Point, b: S2Point, aCrossB?: S2Point): S1Angle;
-}