@blackglory/structures 0.11.8 → 0.12.1

package/lib/es2018/hash-set.d.ts

@@ -1,13 +0,0 @@
-export declare class HashSet<V, Hash = unknown> implements Iterable<V> {
-    private hash;
-    private map;
-    get [Symbol.toStringTag](): string;
-    get size(): number;
-    [Symbol.iterator](): IterableIterator<V>;
-    constructor(hash: (value: V) => Hash);
-    add(value: V): this;
-    delete(value: V): boolean;
-    has(value: V): boolean;
-    clear(): void;
-    values(): IterableIterator<V>;
-}

package/lib/es2018/hash-set.js

@@ -1,36 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HashSet = void 0;
-class HashSet {
-    get [Symbol.toStringTag]() {
-        return this.constructor.name;
-    }
-    get size() {
-        return this.map.size;
-    }
-    [Symbol.iterator]() {
-        return this.map.values();
-    }
-    constructor(hash) {
-        this.hash = hash;
-        this.map = new Map();
-    }
-    add(value) {
-        this.map.set(this.hash(value), value);
-        return this;
-    }
-    delete(value) {
-        return this.map.delete(this.hash(value));
-    }
-    has(value) {
-        return this.map.has(this.hash(value));
-    }
-    clear() {
-        this.map.clear();
-    }
-    values() {
-        return this.map.values();
-    }
-}
-exports.HashSet = HashSet;
-//# sourceMappingURL=hash-set.js.map

package/lib/es2018/hash-set.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hash-set.js","sourceRoot":"","sources":["../../src/hash-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,OAAO;IAGlB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAA;IACtB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAA;IAC1B,CAAC;IAED,YAAoB,IAAwB;QAAxB,SAAI,GAAJ,IAAI,CAAoB;QAdpC,QAAG,GAAG,IAAI,GAAG,EAAW,CAAA;IAce,CAAC;IAEhD,GAAG,CAAC,KAAQ;QACV,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAA;QACrC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IACvC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAA;IAClB,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAA;IAC1B,CAAC;CACF;AArCD,0BAqCC"}

package/lib/es2018/index.d.ts

@@ -1,24 +0,0 @@
-export * from './box';
-export * from './cons';
-export * from './array';
-export * from './emitter';
-export * from './big-map';
-export * from './big-set';
-export * from './hash-map';
-export * from './hash-set';
-export * from './queue';
-export * from './lru-map';
-export * from './expirable-map';
-export * from './tlru-map';
-export * from './trie-map';
-export * from './string-trie-map';
-export { RadixTree } from './radix-tree';
-export { StringRadixTree } from './string-radix-tree';
-export * from './sparse-set';
-export * from './sparse-map';
-export * from './typed-sparse-map';
-export * from './typed-sparse-set';
-export { DynamicTypedArray } from './dynamic-typed-array';
-export * from './sorted-set';
-export * from './bit-set';
-export * from './typed-bit-set';

package/lib/es2018/index.js

@@ -1,45 +0,0 @@
-"use strict";
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DynamicTypedArray = exports.StringRadixTree = exports.RadixTree = void 0;
-__exportStar(require("./box"), exports);
-__exportStar(require("./cons"), exports);
-__exportStar(require("./array"), exports);
-__exportStar(require("./emitter"), exports);
-__exportStar(require("./big-map"), exports);
-__exportStar(require("./big-set"), exports);
-__exportStar(require("./hash-map"), exports);
-__exportStar(require("./hash-set"), exports);
-__exportStar(require("./queue"), exports);
-__exportStar(require("./lru-map"), exports);
-__exportStar(require("./expirable-map"), exports);
-__exportStar(require("./tlru-map"), exports);
-__exportStar(require("./trie-map"), exports);
-__exportStar(require("./string-trie-map"), exports);
-var radix_tree_1 = require("./radix-tree");
-Object.defineProperty(exports, "RadixTree", { enumerable: true, get: function () { return radix_tree_1.RadixTree; } });
-var string_radix_tree_1 = require("./string-radix-tree");
-Object.defineProperty(exports, "StringRadixTree", { enumerable: true, get: function () { return string_radix_tree_1.StringRadixTree; } });
-__exportStar(require("./sparse-set"), exports);
-__exportStar(require("./sparse-map"), exports);
-__exportStar(require("./typed-sparse-map"), exports);
-__exportStar(require("./typed-sparse-set"), exports);
-var dynamic_typed_array_1 = require("./dynamic-typed-array");
-Object.defineProperty(exports, "DynamicTypedArray", { enumerable: true, get: function () { return dynamic_typed_array_1.DynamicTypedArray; } });
-__exportStar(require("./sorted-set"), exports);
-__exportStar(require("./bit-set"), exports);
-__exportStar(require("./typed-bit-set"), exports);
-//# sourceMappingURL=index.js.map

package/lib/es2018/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,wCAAqB;AACrB,yCAAsB;AACtB,0CAAuB;AACvB,4CAAyB;AACzB,4CAAyB;AACzB,4CAAyB;AACzB,6CAA0B;AAC1B,6CAA0B;AAC1B,0CAAuB;AACvB,4CAAyB;AACzB,kDAA+B;AAC/B,6CAA0B;AAC1B,6CAA0B;AAC1B,oDAAiC;AACjC,2CAAwC;AAA/B,uGAAA,SAAS,OAAA;AAClB,yDAAqD;AAA5C,oHAAA,eAAe,OAAA;AACxB,+CAA4B;AAC5B,+CAA4B;AAC5B,qDAAkC;AAClC,qDAAkC;AAClC,6DAAyD;AAAhD,wHAAA,iBAAiB,OAAA;AAC1B,+CAA4B;AAC5B,4CAAyB;AACzB,kDAA+B"}

package/lib/es2018/lru-map.d.ts

@@ -1,14 +0,0 @@
-export declare class LRUMap<K, V> {
-    private limit;
-    private map;
-    get [Symbol.toStringTag](): string;
-    get size(): number;
-    constructor(limit: number);
-    set(key: K, value: V): this;
-    has(key: K): boolean;
-    get(key: K): V | undefined;
-    delete(key: K): boolean;
-    clear(): void;
-    private updateItem;
-    private getColdestKey;
-}

package/lib/es2018/lru-map.js

@@ -1,56 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LRUMap = void 0;
-const errors_1 = require("@blackglory/errors");
-const iterable_operator_1 = require("iterable-operator");
-class LRUMap {
-    get [Symbol.toStringTag]() {
-        return this.constructor.name;
-    }
-    get size() {
-        return this.map.size;
-    }
-    constructor(limit) {
-        this.map = new Map();
-        (0, errors_1.assert)(Number.isInteger(limit), 'The parameter limit must be an integer');
-        (0, errors_1.assert)(limit > 0, 'The parameter limit must be a positive value');
-        this.limit = limit;
-    }
-    set(key, value) {
-        if (this.map.has(key)) {
-            this.updateItem(key, value);
-        }
-        else {
-            if (this.map.size === this.limit) {
-                this.map.delete(this.getColdestKey());
-            }
-            this.map.set(key, value);
-        }
-        return this;
-    }
-    has(key) {
-        return this.map.has(key);
-    }
-    get(key) {
-        if (!this.has(key))
-            return undefined;
-        const value = this.map.get(key);
-        this.updateItem(key, value);
-        return value;
-    }
-    delete(key) {
-        return this.map.delete(key);
-    }
-    clear() {
-        this.map.clear();
-    }
-    updateItem(key, value) {
-        this.map.delete(key);
-        this.map.set(key, value);
-    }
-    getColdestKey() {
-        return (0, iterable_operator_1.first)(this.map.keys());
-    }
-}
-exports.LRUMap = LRUMap;
-//# sourceMappingURL=lru-map.js.map

package/lib/es2018/lru-map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lru-map.js","sourceRoot":"","sources":["../../src/lru-map.ts"],"names":[],"mappings":";;;AAAA,+CAA2C;AAC3C,yDAAyC;AAEzC,MAAa,MAAM;IAIjB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAA;IACtB,CAAC;IAED,YAAY,KAAa;QAVjB,QAAG,GAAG,IAAI,GAAG,EAAQ,CAAA;QAW3B,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,wCAAwC,CAAC,CAAA;QACzE,IAAA,eAAM,EAAC,KAAK,GAAG,CAAC,EAAE,8CAA8C,CAAC,CAAA;QAEjE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACrB,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;SAC5B;aAAM;YACL,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBAChC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,EAAG,CAAC,CAAA;aACvC;YACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;SACzB;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAC1B,CAAC;IAED,GAAG,CAAC,GAAM;QACR,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,SAAS,CAAA;QAEpC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAE,CAAA;QAChC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC3B,OAAO,KAAK,CAAA;IACd,CAAC;IAED,MAAM,CAAC,GAAM;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IAC7B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAA;IAClB,CAAC;IAKO,UAAU,CAAC,GAAM,EAAE,KAAQ;QACjC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;QACpB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;IAC1B,CAAC;IAKO,aAAa;QACnB,OAAO,IAAA,yBAAK,EAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAA;IAC/B,CAAC;CACF;AAjED,wBAiEC"}

package/lib/es2018/queue.d.ts

@@ -1,9 +0,0 @@
-export declare class Queue<T> {
-    private items;
-    get [Symbol.toStringTag](): string;
-    get size(): number;
-    empty(): void;
-    enqueue(...items: T[]): void;
-    dequeue(): T | undefined;
-    remove(item: T): void;
-}

package/lib/es2018/queue.js

@@ -1,31 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Queue = void 0;
-class Queue {
-    constructor() {
-        this.items = [];
-    }
-    get [Symbol.toStringTag]() {
-        return this.constructor.name;
-    }
-    get size() {
-        return this.items.length;
-    }
-    empty() {
-        this.items.length = 0;
-    }
-    enqueue(...items) {
-        this.items.push(...items);
-    }
-    dequeue() {
-        return this.items.shift();
-    }
-    remove(item) {
-        let index;
-        while ((index = this.items.indexOf(item)) >= 0) {
-            this.items.splice(index, 1);
-        }
-    }
-}
-exports.Queue = Queue;
-//# sourceMappingURL=queue.js.map

package/lib/es2018/queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../src/queue.ts"],"names":[],"mappings":";;;AAAA,MAAa,KAAK;IAAlB;QACU,UAAK,GAAQ,EAAE,CAAA;IA4BzB,CAAC;IA1BC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAA;IAC1B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAA;IACvB,CAAC;IAED,OAAO,CAAC,GAAG,KAAU;QACnB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAA;IAC3B,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;IAC3B,CAAC;IAED,MAAM,CAAC,IAAO;QACZ,IAAI,KAAa,CAAA;QACjB,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE;YAC9C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;SAC5B;IACH,CAAC;CACF;AA7BD,sBA6BC"}

package/lib/es2018/radix-tree.d.ts

@@ -1,17 +0,0 @@
-export declare class RadixTree<K extends Iterable<T>, V, T = unknown> {
-    private root;
-    get [Symbol.toStringTag](): string;
-    entries(): IterableIterator<[key: T[], value: V]>;
-    keys(): IterableIterator<T[]>;
-    values(): IterableIterator<V>;
-    set(key: K, value: V): this;
-    has(key: K): boolean;
-    get(key: K): V | undefined;
-    delete(key: K): boolean;
-}
-export declare function matchPrefix<T>(prefixes: Iterable<T[]>, path: T[]): T[] | undefined;
-export declare function findCommonPrefix<T>(prefixes: Iterable<T[]>, path: T[]): {
-    prefix: T[];
-    commonPartLength: number;
-} | undefined;
-export declare function getCommonPrefix<T>(paths: T[][]): T[];

package/lib/es2018/radix-tree.js

@@ -1,221 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getCommonPrefix = exports.findCommonPrefix = exports.matchPrefix = exports.RadixTree = void 0;
-const iterable_operator_1 = require("iterable-operator");
-const extra_utils_1 = require("extra-utils");
-class TreeNode {
-    constructor(value) {
-        this.value = value;
-        this.children = new Map();
-    }
-}
-class RadixTree {
-    constructor() {
-        this.root = new TreeNode();
-    }
-    get [Symbol.toStringTag]() {
-        return this.constructor.name;
-    }
-    entries() {
-        return dfs(this.root, []);
-        function* dfs(node, path) {
-            for (const [prefix, childNode] of node.children) {
-                const newPath = [...path, ...prefix];
-                if ((0, extra_utils_1.isntUndefined)(childNode.value)) {
-                    yield [newPath, childNode.value];
-                }
-                yield* dfs(childNode, newPath);
-            }
-        }
-    }
-    keys() {
-        return (0, iterable_operator_1.map)(this.entries(), ([key]) => key);
-    }
-    values() {
-        return (0, iterable_operator_1.map)(this.entries(), ([, value]) => value);
-    }
-    set(key, value) {
-        set((0, iterable_operator_1.toArray)(key), value, this.root);
-        return this;
-        function set(key, value, node) {
-            const commonPrefix = findCommonPrefix(node.children.keys(), key);
-            if ((0, extra_utils_1.isntUndefined)(commonPrefix)) {
-                const { prefix, commonPartLength } = commonPrefix;
-                if (prefix.length === commonPartLength) {
-                    const prefixNode = node.children.get(prefix);
-                    if (key.length === prefix.length) {
-                        prefixNode.value = value;
-                    }
-                    else {
-                        const newKey = key.slice(prefix.length);
-                        set(newKey, value, prefixNode);
-                    }
-                }
-                else {
-                    const oldPrefixNode = node.children.get(prefix);
-                    const commonPrefix = prefix.slice(0, commonPartLength);
-                    const newPrefixNode = new TreeNode();
-                    node.children.set(commonPrefix, newPrefixNode);
-                    newPrefixNode.children.set(prefix.slice(commonPartLength), oldPrefixNode);
-                    newPrefixNode.children.set(key.slice(commonPartLength), new TreeNode(value));
-                    node.children.delete(prefix);
-                }
-            }
-            else {
-                node.children.set(key, new TreeNode(value));
-            }
-        }
-    }
-    has(key) {
-        return has((0, iterable_operator_1.toArray)(key), this.root);
-        function has(key, node) {
-            const matchedPrefix = matchPrefix(node.children.keys(), key);
-            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
-                const restKey = key.slice(matchedPrefix.length);
-                if (restKey.length === 0) {
-                    return true;
-                }
-                else {
-                    return has(restKey, node.children.get(matchedPrefix));
-                }
-            }
-            else {
-                return false;
-            }
-        }
-    }
-    get(key) {
-        return get((0, iterable_operator_1.toArray)(key), this.root);
-        function get(key, node) {
-            const matchedPrefix = matchPrefix(node.children.keys(), key);
-            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
-                const restKey = key.slice(matchedPrefix.length);
-                const nextNode = node.children.get(matchedPrefix);
-                if (restKey.length === 0) {
-                    return nextNode.value;
-                }
-                else {
-                    return get(restKey, nextNode);
-                }
-            }
-            else {
-                return undefined;
-            }
-        }
-    }
-    delete(key) {
-        return _delete((0, iterable_operator_1.toArray)(key), this.root);
-        function _delete(key, node) {
-            const matchedPrefix = matchPrefix(node.children.keys(), key);
-            if ((0, extra_utils_1.isntUndefined)(matchedPrefix)) {
-                if (key.length === matchedPrefix.length) {
-                    const targetNode = node.children.get(matchedPrefix);
-                    if (targetNode.children.size === 0) {
-                        node.children.delete(matchedPrefix);
-                    }
-                    else {
-                        delete node.value;
-                        if (targetNode.children.size === 1) {
-                            const [key, value] = (0, iterable_operator_1.first)(targetNode.children.entries());
-                            node.children.set([...matchedPrefix, ...key], value);
-                            node.children.delete(matchedPrefix);
-                        }
-                    }
-                    return true;
-                }
-                else {
-                    const nextNode = node.children.get(matchedPrefix);
-                    const nextKey = key.slice(matchedPrefix.length);
-                    const deleted = _delete(nextKey, nextNode);
-                    if (deleted) {
-                        if (!('value' in nextNode)) {
-                            switch (nextNode.children.size) {
-                                case 0: {
-                                    node.children.delete(matchedPrefix);
-                                    break;
-                                }
-                                case 1: {
-                                    const [key, value] = (0, iterable_operator_1.first)(nextNode.children.entries());
-                                    node.children.set([...matchedPrefix, ...key], value);
-                                    node.children.delete(matchedPrefix);
-                                    break;
-                                }
-                                default: {
-                                    const entries = (0, iterable_operator_1.toArray)(nextNode.children.entries());
-                                    const keys = entries.map(([key]) => key);
-                                    const commonPrefix = getCommonPrefix(keys);
-                                    if (commonPrefix) {
-                                        const newPrefix = [...matchedPrefix, ...commonPrefix];
-                                        const childNode = new TreeNode();
-                                        for (const [key, value] of entries) {
-                                            childNode.children.set(key.slice(commonPrefix.length), value);
-                                        }
-                                        node.children.set(newPrefix, childNode);
-                                        node.children.delete(matchedPrefix);
-                                    }
-                                }
-                            }
-                        }
-                        return true;
-                    }
-                    else {
-                        return false;
-                    }
-                }
-            }
-            else {
-                return false;
-            }
-        }
-    }
-}
-exports.RadixTree = RadixTree;
-function matchPrefix(prefixes, path) {
-    return (0, iterable_operator_1.find)(prefixes, prefix => path[0] === prefix[0]);
-}
-exports.matchPrefix = matchPrefix;
-function findCommonPrefix(prefixes, path) {
-    for (const prefix of prefixes) {
-        let commonPartLength = 0;
-        for (let i = 0; i < prefix.length; i++) {
-            if (path[i] === prefix[i]) {
-                commonPartLength++;
-            }
-            else {
-                if (commonPartLength > 0) {
-                    return { prefix, commonPartLength };
-                }
-            }
-        }
-        if (commonPartLength > 0) {
-            return { prefix, commonPartLength };
-        }
-    }
-}
-exports.findCommonPrefix = findCommonPrefix;
-function getCommonPrefix(paths) {
-    if (paths.length > 0) {
-        const commonPrefix = [];
-        loop: for (let elementIndex = 0, firstPathLength = paths[0].length; elementIndex < firstPathLength; elementIndex++) {
-            const element = paths[0][elementIndex];
-            for (let pathIndex = 1; pathIndex < paths.length; pathIndex++) {
-                const path = paths[pathIndex];
-                if (elementIndex < path.length) {
-                    if (path[elementIndex] !== element) {
-                        break loop;
-                    }
-                }
-                else {
-                    break loop;
-                }
-            }
-            commonPrefix.push(element);
-        }
-        return commonPrefix;
-    }
-    else {
-        return [];
-    }
-}
-exports.getCommonPrefix = getCommonPrefix;
-//# sourceMappingURL=radix-tree.js.map

package/lib/es2018/radix-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"radix-tree.js","sourceRoot":"","sources":["../../src/radix-tree.ts"],"names":[],"mappings":";;;AAAA,yDAA6D;AAC7D,6CAA2C;AAE3C,MAAM,QAAQ;IAGZ,YAAmB,KAAS;QAAT,UAAK,GAAL,KAAK,CAAI;QAF5B,aAAQ,GAAG,IAAI,GAAG,EAAuB,CAAA;IAEV,CAAC;CACjC;AAED,MAAa,SAAS;IAAtB;QACU,SAAI,GAAG,IAAI,QAAQ,EAAQ,CAAA;IAyLrC,CAAC;IAvLC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,OAAO;QACL,OAAO,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAEzB,QAAQ,CAAC,CAAC,GAAG,CACX,IAAoB,EACpB,IAAS;YAET,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC/C,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,MAAM,CAAC,CAAA;gBACpC,IAAI,IAAA,2BAAa,EAAC,SAAS,CAAC,KAAK,CAAC,EAAE;oBAClC,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,CAAC,CAAA;iBACjC;gBAED,KAAK,CAAC,CAAC,GAAG,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;aAC/B;QACH,CAAC;IACH,CAAC;IAED,IAAI;QACF,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;IAC5C,CAAC;IAED,MAAM;QACJ,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAA;IAClD,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,GAAG,CAAC,IAAA,2BAAO,EAAC,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QACnC,OAAO,IAAI,CAAA;QAEX,SAAS,GAAG,CAAC,GAAQ,EAAE,KAAQ,EAAE,IAAoB;YACnD,MAAM,YAAY,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;YAChE,IAAI,IAAA,2BAAa,EAAC,YAAY,CAAC,EAAE;gBAC/B,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,GAAG,YAAY,CAAA;gBACjD,IAAI,MAAM,CAAC,MAAM,KAAK,gBAAgB,EAAE;oBAEtC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA;oBAE7C,IAAI,GAAG,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE;wBAEhC,UAAU,CAAC,KAAK,GAAG,KAAK,CAAA;qBACzB;yBAAM;wBAEL,MAAM,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;wBACvC,GAAG,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,CAAC,CAAA;qBAC/B;iBACF;qBAAM;oBAGL,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAE,CAAA;oBAChD,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAA;oBACtD,MAAM,aAAa,GAAG,IAAI,QAAQ,EAAQ,CAAA;oBAC1C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE,aAAa,CAAC,CAAA;oBAC9C,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,aAAa,CAAC,CAAA;oBACzE,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,IAAI,QAAQ,CAAO,KAAK,CAAC,CAAC,CAAA;oBAClF,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;iBAC7B;aACF;iBAAM;gBACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAA;aAC5C;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,GAAG,CAAC,IAAA,2BAAO,EAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnC,SAAS,GAAG,CAAC,GAAQ,EAAE,IAAoB;YACzC,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;YAC5D,IAAI,IAAA,2BAAa,EAAC,aAAa,CAAC,EAAE;gBAChC,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;gBAC/C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;oBACxB,OAAO,IAAI,CAAA;iBACZ;qBAAM;oBACL,OAAO,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAE,CAAC,CAAA;iBACvD;aACF;iBAAM;gBACL,OAAO,KAAK,CAAA;aACb;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,GAAG,CAAC,IAAA,2BAAO,EAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnC,SAAS,GAAG,CAAC,GAAQ,EAAE,IAAoB;YACzC,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;YAC5D,IAAI,IAAA,2BAAa,EAAC,aAAa,CAAC,EAAE;gBAChC,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;gBAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAE,CAAA;gBAClD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE;oBACxB,OAAO,QAAQ,CAAC,KAAK,CAAA;iBACtB;qBAAM;oBACL,OAAO,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;iBAC9B;aACF;iBAAM;gBACL,OAAO,SAAS,CAAA;aACjB;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,GAAM;QACX,OAAO,OAAO,CAAC,IAAA,2BAAO,EAAC,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;QAEvC,SAAS,OAAO,CAAC,GAAQ,EAAE,IAAoB;YAC7C,MAAM,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,CAAA;YAC5D,IAAI,IAAA,2BAAa,EAAC,aAAa,CAAC,EAAE;gBAChC,IAAI,GAAG,CAAC,MAAM,KAAK,aAAa,CAAC,MAAM,EAAE;oBAEvC,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAE,CAAA;oBACpD,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE;wBAGlC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;qBACpC;yBAAM;wBAEL,OAAO,IAAI,CAAC,KAAK,CAAA;wBACjB,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE;4BAGlC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAA,yBAAK,EAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAE,CAAA;4BAC1D,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;4BACpD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;yBACpC;qBACF;oBACD,OAAO,IAAI,CAAA;iBACZ;qBAAM;oBAEL,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,aAAa,CAAE,CAAA;oBAClD,MAAM,OAAO,GAAG,GAAG,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAA;oBAC/C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAA;oBAC1C,IAAI,OAAO,EAAE;wBAEX,IAAI,CAAC,CAAC,OAAO,IAAI,QAAQ,CAAC,EAAE;4BAE1B,QAAQ,QAAQ,CAAC,QAAQ,CAAC,IAAI,EAAE;gCAC9B,KAAK,CAAC,CAAC,CAAC;oCAEN,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;oCACnC,MAAK;iCACN;gCACD,KAAK,CAAC,CAAC,CAAC;oCAIN,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,IAAA,yBAAK,EAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAE,CAAA;oCACxD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,EAAE,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;oCACpD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;oCACnC,MAAK;iCACN;gCACD,OAAO,CAAC,CAAC;oCAIP,MAAM,OAAO,GAAG,IAAA,2BAAO,EAAC,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAA;oCACpD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAA;oCACxC,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,CAAC,CAAA;oCAC1C,IAAI,YAAY,EAAE;wCAChB,MAAM,SAAS,GAAG,CAAC,GAAG,aAAa,EAAE,GAAG,YAAY,CAAC,CAAA;wCACrD,MAAM,SAAS,GAAG,IAAI,QAAQ,EAAQ,CAAA;wCACtC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,OAAO,EAAE;4CAClC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAA;yCAC9D;wCACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;wCACvC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;qCACpC;iCACF;6BACF;yBACF;wBACD,OAAO,IAAI,CAAA;qBACZ;yBAAM;wBAEL,OAAO,KAAK,CAAA;qBACb;iBACF;aACF;iBAAM;gBACL,OAAO,KAAK,CAAA;aACb;QACH,CAAC;IACH,CAAC;CACF;AA1LD,8BA0LC;AAOD,SAAgB,WAAW,CAAI,QAAuB,EAAE,IAAS;IAC/D,OAAO,IAAA,wBAAI,EAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AACxD,CAAC;AAFD,kCAEC;AAOD,SAAgB,gBAAgB,CAAI,QAAuB,EAAE,IAAS;IAIpE,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;QAC7B,IAAI,gBAAgB,GAAG,CAAC,CAAA;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE;gBACzB,gBAAgB,EAAE,CAAA;aACnB;iBAAM;gBACL,IAAI,gBAAgB,GAAG,CAAC,EAAE;oBACxB,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAA;iBACpC;aACF;SACF;QACD,IAAI,gBAAgB,GAAG,CAAC,EAAE;YACxB,OAAO,EAAE,MAAM,EAAE,gBAAgB,EAAE,CAAA;SACpC;KACF;AACH,CAAC;AAnBD,4CAmBC;AAMD,SAAgB,eAAe,CAAI,KAAY;IAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;QACpB,MAAM,YAAY,GAAQ,EAAE,CAAA;QAE5B,IAAI,EAAE,KACJ,IAAI,YAAY,GAAG,CAAC,EAAE,eAAe,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EACvD,YAAY,GAAG,eAAe,EAC9B,YAAY,EAAE,EACd;YACA,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAA;YACtC,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE;gBAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,SAAS,CAAC,CAAA;gBAC7B,IAAI,YAAY,GAAG,IAAI,CAAC,MAAM,EAAE;oBAC9B,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,OAAO,EAAE;wBAClC,MAAM,IAAI,CAAA;qBACX;iBACF;qBAAM;oBACL,MAAM,IAAI,CAAA;iBACX;aACF;YACD,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;SAC3B;QAED,OAAO,YAAY,CAAA;KACpB;SAAM;QACL,OAAO,EAAE,CAAA;KACV;AACH,CAAC;AA3BD,0CA2BC"}

package/lib/es2018/sorted-set.d.ts

@@ -1,10 +0,0 @@
-export declare class SortedSet<T> implements Iterable<T> {
-    private skipList;
-    get [Symbol.toStringTag](): string;
-    [Symbol.iterator](): IterableIterator<T>;
-    constructor(compare: (a: T, b: T) => number);
-    values(): IterableIterator<T>;
-    has(value: T): boolean;
-    add(value: T): void;
-    delete(value: T): void;
-}

package/lib/es2018/sorted-set.js

@@ -1,30 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SortedSet = void 0;
-const skip_list_1 = require("./utils/skip-list");
-const iterable_operator_1 = require("iterable-operator");
-class SortedSet {
-    get [Symbol.toStringTag]() {
-        return this.constructor.name;
-    }
-    [Symbol.iterator]() {
-        return this.values();
-    }
-    constructor(compare) {
-        this.skipList = new skip_list_1.SkipList(compare);
-    }
-    values() {
-        return (0, iterable_operator_1.map)(this.skipList.elements(), node => node.value);
-    }
-    has(value) {
-        return this.skipList.has(value);
-    }
-    add(value) {
-        this.skipList.add(value);
-    }
-    delete(value) {
-        this.skipList.delete(value);
-    }
-}
-exports.SortedSet = SortedSet;
-//# sourceMappingURL=sorted-set.js.map

package/lib/es2018/sorted-set.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted-set.js","sourceRoot":"","sources":["../../src/sorted-set.ts"],"names":[],"mappings":";;;AAAA,gDAA2C;AAC3C,yDAAuC;AAEvC,MAAa,SAAS;IAGpB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,MAAM,EAAE,CAAA;IACtB,CAAC;IAED,YAAY,OAA+B;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,oBAAQ,CAAC,OAAO,CAAC,CAAA;IACvC,CAAC;IAED,MAAM;QACJ,OAAO,IAAA,uBAAG,EAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,KAAM,CAAC,CAAA;IAC3D,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACjC,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAC1B,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;IAC7B,CAAC;CACF;AA9BD,8BA8BC"}

package/lib/es2018/sparse-map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sparse-map.js","sourceRoot":"","sources":["../../src/sparse-map.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAAtB;QACU,eAAU,GAA8B,EAAE,CAAA;QAC1C,eAAU,GAAa,EAAE,CAAA;QACzB,iBAAY,GAAQ,EAAE,CAAA;IAyEhC,CAAC;IAvEC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAA;IAC/B,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,YAAY,CAAA;IAC1B,CAAC;IAED,CAAE,OAAO;QACP,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC/C,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;SACjD;IACH,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAA;IACjC,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAA;IACnC,CAAC;IAED,qBAAqB,CAAC,GAAW;QAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;IAC7B,CAAC;IAED,GAAG,CAAC,GAAW;QAEb,OAAO,GAAG,IAAI,IAAI,CAAC,UAAU,CAAA;IAC/B,CAAC;IAED,GAAG,CAAC,GAAW;QACb,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAE,CAAA;YACnC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;SAChC;aAAM;YACL,OAAO,SAAS,CAAA;SACjB;IACH,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,KAAQ;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAE,CAAA;YACnC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;SACjC;aAAM;YACL,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAA;YACpC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACzB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAA;SAC7B;IACH,CAAC;IAED,MAAM,CAAC,GAAW;QAChB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE;YACjB,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,EAAG,CAAA;YACtC,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAG,CAAA;YAC1C,IAAI,GAAG,KAAK,OAAO,EAAE;gBACnB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;aAC5B;iBAAM;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAE,CAAA;gBACnC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,OAAO,CAAA;gBAChC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;gBACpC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,KAAK,CAAA;gBAChC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;aAC5B;SACF;IACH,CAAC;CACF;AA5ED,8BA4EC"}

package/lib/es2018/sparse-set.d.ts

@@ -1,11 +0,0 @@
-export declare class SparseSet implements Iterable<number> {
-    private indexToValue;
-    private valueToIndex;
-    get [Symbol.toStringTag](): string;
-    [Symbol.iterator](): IterableIterator<number>;
-    constructor(array?: number[]);
-    values(): IterableIterator<number>;
-    has(value: number): boolean;
-    add(value: number): void;
-    delete(value: number): boolean;
-}

package/lib/es2018/sparse-set.js

@@ -1,54 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SparseSet = void 0;
-class SparseSet {
-    get [Symbol.toStringTag]() {
-        return this.constructor.name;
-    }
-    [Symbol.iterator]() {
-        return this.indexToValue[Symbol.iterator]();
-    }
-    constructor(array = []) {
-        this.indexToValue = [];
-        const valueToIndex = [];
-        if (array.length > 0) {
-            for (const [index, value] of array.entries()) {
-                valueToIndex[value] = index;
-            }
-        }
-        this.valueToIndex = valueToIndex;
-    }
-    values() {
-        return this.indexToValue[Symbol.iterator]();
-    }
-    has(value) {
-        return value in this.valueToIndex;
-    }
-    add(value) {
-        if (!this.has(value)) {
-            const index = this.indexToValue.length;
-            this.indexToValue.push(value);
-            this.valueToIndex[value] = index;
-        }
-    }
-    delete(value) {
-        if (this.has(value)) {
-            const lastValue = this.indexToValue.pop();
-            if (value === lastValue) {
-                delete this.valueToIndex[value];
-            }
-            else {
-                const index = this.valueToIndex[value];
-                this.indexToValue[index] = lastValue;
-                this.valueToIndex[lastValue] = index;
-                delete this.valueToIndex[value];
-            }
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-}
-exports.SparseSet = SparseSet;
-//# sourceMappingURL=sparse-set.js.map

package/lib/es2018/sparse-set.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sparse-set.js","sourceRoot":"","sources":["../../src/sparse-set.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;IAIpB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAA;IAC9B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,YAAY,QAAkB,EAAE;QAXxB,iBAAY,GAAa,EAAE,CAAA;QAYjC,MAAM,YAAY,GAA8B,EAAE,CAAA;QAClD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACpB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;gBAC5C,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;aAC5B;SACF;QAED,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;IAClC,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IAED,GAAG,CAAC,KAAa;QAEf,OAAO,KAAK,IAAI,IAAI,CAAC,YAAY,CAAA;IACnC,CAAC;IAED,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;YACtC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC7B,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,KAAK,CAAA;SACjC;IACH,CAAC;IAED,MAAM,CAAC,KAAa;QAClB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACnB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAG,CAAA;YAC1C,IAAI,KAAK,KAAK,SAAS,EAAE;gBACvB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;iBAAM;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAE,CAAA;gBACvC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,SAAS,CAAA;gBACpC,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,KAAK,CAAA;gBAEpC,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;aAChC;YACD,OAAO,IAAI,CAAA;SACZ;aAAM;YACL,OAAO,KAAK,CAAA;SACb;IACH,CAAC;CACF;AAzDD,8BAyDC"}

package/lib/es2018/string-radix-tree.d.ts

@@ -1,17 +0,0 @@
-export declare class StringRadixTree<T> {
-    private root;
-    get [Symbol.toStringTag](): string;
-    entries(): IterableIterator<[key: string, value: T]>;
-    keys(): IterableIterator<string>;
-    values(): IterableIterator<T>;
-    set(key: string, value: T): this;
-    has(key: string): boolean;
-    get(key: string): T | undefined;
-    delete(key: string): boolean;
-}
-export declare function matchPrefix(prefixes: Iterable<string>, path: string): string | undefined;
-export declare function findCommonPrefix(prefixes: Iterable<string>, path: string): {
-    prefix: string;
-    commonPartLength: number;
-} | undefined;
-export declare function getCommonPrefix(paths: string[]): string;