@mdfriday/foundry 0.1.0

package/dist/pkg/radix/radix.js

@@ -0,0 +1,488 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Tree = void 0;
+exports.createTree = createTree;
+exports.createTreeFromMap = createTreeFromMap;
+// leafNode is used to represent a value
+class LeafNode {
+    constructor(key, val) {
+        this.key = key;
+        this.val = val;
+    }
+}
+// edge is used to represent an edge node
+class Edge {
+    constructor(label, node) {
+        this.label = label;
+        this.node = node;
+    }
+}
+class Node {
+    constructor() {
+        // leaf is used to store possible leaf
+        this.leaf = null;
+        // prefix is the common prefix we ignore
+        this.prefix = '';
+        // Edges should be stored in-order for iteration.
+        // We avoid a fully materialized slice to save memory,
+        // since in most cases we expect to be sparse
+        this.edges = [];
+    }
+    isLeaf() {
+        return this.leaf !== null;
+    }
+    addEdge(e) {
+        const num = this.edges.length;
+        let idx = 0;
+        // Binary search to find insertion point
+        while (idx < num && this.edges[idx].label < e.label) {
+            idx++;
+        }
+        this.edges.splice(idx, 0, e);
+    }
+    updateEdge(label, node) {
+        const num = this.edges.length;
+        let idx = 0;
+        // Binary search
+        while (idx < num && this.edges[idx].label < label) {
+            idx++;
+        }
+        if (idx < num && this.edges[idx].label === label) {
+            this.edges[idx].node = node;
+            return;
+        }
+        throw new Error("replacing missing edge");
+    }
+    getEdge(label) {
+        const num = this.edges.length;
+        let idx = 0;
+        // Binary search
+        while (idx < num && this.edges[idx].label < label) {
+            idx++;
+        }
+        if (idx < num && this.edges[idx].label === label) {
+            return this.edges[idx].node;
+        }
+        return null;
+    }
+    delEdge(label) {
+        const num = this.edges.length;
+        let idx = 0;
+        // Binary search
+        while (idx < num && this.edges[idx].label < label) {
+            idx++;
+        }
+        if (idx < num && this.edges[idx].label === label) {
+            this.edges.splice(idx, 1);
+        }
+    }
+    mergeChild() {
+        const e = this.edges[0];
+        const child = e.node;
+        this.prefix = this.prefix + child.prefix;
+        this.leaf = child.leaf;
+        this.edges = child.edges;
+    }
+}
+// longestPrefix finds the length of the shared prefix
+// of two strings
+function longestPrefix(k1, k2) {
+    const max = Math.min(k1.length, k2.length);
+    let i = 0;
+    for (i = 0; i < max; i++) {
+        if (k1[i] !== k2[i]) {
+            break;
+        }
+    }
+    return i;
+}
+// Tree implements a radix tree. This can be treated as a
+// Dictionary abstract data type. The main advantage over
+// a standard hash map is prefix-based lookups and
+// ordered iteration,
+class Tree {
+    constructor() {
+        this.root = new Node();
+        this.size = 0;
+    }
+    // NewFromMap returns a new tree containing the keys
+    // from an existing map
+    static newFromMap(m) {
+        const t = new Tree();
+        if (m) {
+            if (m instanceof Map) {
+                m.forEach((v, k) => {
+                    t.insert(k, v);
+                });
+            }
+            else {
+                for (const [k, v] of Object.entries(m)) {
+                    t.insert(k, v);
+                }
+            }
+        }
+        return t;
+    }
+    // Len is used to return the number of elements in the tree
+    len() {
+        return this.size;
+    }
+    // Insert is used to add a newentry or update
+    // an existing entry. Returns [previousValue, wasUpdated]
+    insert(s, v) {
+        let parent = null;
+        let n = this.root;
+        let search = s;
+        while (true) {
+            // Handle key exhaustion
+            if (search.length === 0) {
+                if (n.isLeaf()) {
+                    const old = n.leaf.val;
+                    n.leaf.val = v;
+                    return [old, true];
+                }
+                n.leaf = new LeafNode(s, v);
+                this.size++;
+                return [undefined, false];
+            }
+            // Look for the edge
+            parent = n;
+            n = n.getEdge(search.charCodeAt(0));
+            // No edge, create one
+            if (n === null) {
+                const e = new Edge(search.charCodeAt(0), new Node());
+                e.node.leaf = new LeafNode(s, v);
+                e.node.prefix = search;
+                parent.addEdge(e);
+                this.size++;
+                return [undefined, false];
+            }
+            // Determine longest prefix of the search key on match
+            const commonPrefix = longestPrefix(search, n.prefix);
+            if (commonPrefix === n.prefix.length) {
+                search = search.substring(commonPrefix);
+                continue;
+            }
+            // Split the node
+            this.size++;
+            const child = new Node();
+            child.prefix = search.substring(0, commonPrefix);
+            parent.updateEdge(search.charCodeAt(0), child);
+            // Restore the existing node
+            child.addEdge(new Edge(n.prefix.charCodeAt(commonPrefix), n));
+            n.prefix = n.prefix.substring(commonPrefix);
+            // Create a new leaf node
+            const leaf = new LeafNode(s, v);
+            // If the new key is a subset, add to this node
+            search = search.substring(commonPrefix);
+            if (search.length === 0) {
+                child.leaf = leaf;
+                return [undefined, false];
+            }
+            // Create a new edge for the node
+            const newNode = new Node();
+            newNode.leaf = leaf;
+            newNode.prefix = search;
+            child.addEdge(new Edge(search.charCodeAt(0), newNode));
+            return [undefined, false];
+        }
+    }
+    // Delete is used to delete a key, returning the previous
+    // value and if it was deleted
+    delete(s) {
+        let parent = null;
+        let label = 0;
+        let n = this.root;
+        let search = s;
+        while (true) {
+            // Check for key exhaustion
+            if (search.length === 0) {
+                if (!n.isLeaf()) {
+                    break;
+                }
+                // DELETE
+                const leaf = n.leaf;
+                n.leaf = null;
+                this.size--;
+                // Check if we should delete this node from the parent
+                if (parent !== null && n.edges.length === 0) {
+                    parent.delEdge(label);
+                }
+                // Check if we should merge this node
+                if (n !== this.root && n.edges.length === 1) {
+                    n.mergeChild();
+                }
+                // Check if we should merge the parent's other child
+                if (parent !== null && parent !== this.root &&
+                    parent.edges.length === 1 && !parent.isLeaf()) {
+                    parent.mergeChild();
+                }
+                return [leaf.val, true];
+            }
+            // Look for an edge
+            parent = n;
+            label = search.charCodeAt(0);
+            n = n.getEdge(label);
+            if (n === null) {
+                break;
+            }
+            // Consume the search prefix
+            if (search.startsWith(n.prefix)) {
+                search = search.substring(n.prefix.length);
+            }
+            else {
+                break;
+            }
+        }
+        return [undefined, false];
+    }
+    // DeletePrefix is used to delete the subtree under a prefix
+    // Returns how many nodes were deleted
+    // Use this to delete large subtrees efficiently
+    async deletePrefix(s) {
+        return await this._deletePrefix(null, this.root, s);
+    }
+    // _deletePrefix does a recursive deletion
+    async _deletePrefix(parent, n, prefix) {
+        // Check for key exhaustion
+        if (prefix.length === 0) {
+            // Remove the leaf node
+            let subTreeSize = 0;
+            // recursively walk from all edges of the node to be deleted
+            await recursiveWalk(n, (s, v) => {
+                subTreeSize++;
+                return Promise.resolve(false);
+            });
+            if (n.isLeaf()) {
+                n.leaf = null;
+            }
+            n.edges = []; // deletes the entire subtree
+            // Check if we should merge the parent's other child
+            if (parent !== null && parent !== this.root &&
+                parent.edges.length === 1 && !parent.isLeaf()) {
+                parent.mergeChild();
+            }
+            this.size -= subTreeSize;
+            return subTreeSize;
+        }
+        // Look for an edge
+        const label = prefix.charCodeAt(0);
+        const child = n.getEdge(label);
+        if (child === null ||
+            (!child.prefix.startsWith(prefix) && !prefix.startsWith(child.prefix))) {
+            return 0;
+        }
+        // Consume the search prefix
+        if (child.prefix.length > prefix.length) {
+            prefix = prefix.substring(prefix.length);
+        }
+        else {
+            prefix = prefix.substring(child.prefix.length);
+        }
+        return this._deletePrefix(n, child, prefix);
+    }
+    // Get is used to lookup a specific key, returning
+    // the value and if it was found
+    get(s) {
+        let n = this.root;
+        let search = s;
+        while (true) {
+            // Check for key exhaustion
+            if (search.length === 0) {
+                if (n.isLeaf()) {
+                    return [n.leaf.val, true];
+                }
+                break;
+            }
+            // Look for an edge
+            n = n.getEdge(search.charCodeAt(0));
+            if (n === null) {
+                break;
+            }
+            // Consume the search prefix
+            if (search.startsWith(n.prefix)) {
+                search = search.substring(n.prefix.length);
+            }
+            else {
+                break;
+            }
+        }
+        return [undefined, false];
+    }
+    // LongestPrefix is like Get, but instead of an
+    // exact match, it will return the longest prefix match.
+    longestPrefix(s) {
+        let last = null;
+        let n = this.root;
+        let search = s;
+        while (true) {
+            // Look for a leaf node
+            if (n.isLeaf()) {
+                last = n.leaf;
+            }
+            // Check for key exhaustion
+            if (search.length === 0) {
+                break;
+            }
+            // Look for an edge
+            n = n.getEdge(search.charCodeAt(0));
+            if (n === null) {
+                break;
+            }
+            // Consume the search prefix
+            if (search.startsWith(n.prefix)) {
+                search = search.substring(n.prefix.length);
+            }
+            else {
+                break;
+            }
+        }
+        if (last !== null) {
+            return [last.key, last.val, true];
+        }
+        return ['', undefined, false];
+    }
+    // Minimum is used to return the minimum value in the tree
+    minimum() {
+        let n = this.root;
+        while (true) {
+            if (n.isLeaf()) {
+                return [n.leaf.key, n.leaf.val, true];
+            }
+            if (n.edges.length > 0) {
+                n = n.edges[0].node;
+            }
+            else {
+                break;
+            }
+        }
+        return ['', undefined, false];
+    }
+    // Maximum is used to return the maximum value in the tree
+    maximum() {
+        let n = this.root;
+        while (true) {
+            const num = n.edges.length;
+            if (num > 0) {
+                n = n.edges[num - 1].node;
+                continue;
+            }
+            if (n.isLeaf()) {
+                return [n.leaf.key, n.leaf.val, true];
+            }
+            break;
+        }
+        return ['', undefined, false];
+    }
+    // Walk is used to walk the tree
+    async walk(fn) {
+        await recursiveWalk(this.root, fn);
+    }
+    // WalkPrefix is used to walk the tree under a prefix
+    async walkPrefix(prefix, fn) {
+        let n = this.root;
+        let search = prefix;
+        while (true) {
+            // Check for key exhaustion
+            if (search.length === 0) {
+                await recursiveWalk(n, fn);
+                return;
+            }
+            // Look for an edge
+            n = n.getEdge(search.charCodeAt(0));
+            if (n === null) {
+                return;
+            }
+            // Consume the search prefix
+            if (search.startsWith(n.prefix)) {
+                search = search.substring(n.prefix.length);
+                continue;
+            }
+            if (n.prefix.startsWith(search)) {
+                // Child may be under our search prefix
+                await recursiveWalk(n, fn);
+            }
+            return;
+        }
+    }
+    // WalkPath is used to walk the tree, but only visiting nodes
+    // from the root down to a given leaf. Where WalkPrefix walks
+    // all the entries *under* the given prefix, this walks the
+    // entries *above* the given prefix.
+    async walkPath(path, fn) {
+        let n = this.root;
+        let search = path;
+        while (true) {
+            // Visit the leaf values if any
+            if (n.leaf !== null && await fn(n.leaf.key, n.leaf.val)) {
+                return;
+            }
+            // Check for key exhaustion
+            if (search.length === 0) {
+                return;
+            }
+            // Look for an edge
+            n = n.getEdge(search.charCodeAt(0));
+            if (n === null) {
+                return;
+            }
+            // Consume the search prefix
+            if (search.startsWith(n.prefix)) {
+                search = search.substring(n.prefix.length);
+            }
+            else {
+                break;
+            }
+        }
+    }
+    // ToMap is used to walk the tree and convert it into a map
+    async toMap() {
+        const out = {};
+        await this.walk((k, v) => {
+            out[k] = v;
+            return Promise.resolve(false);
+        });
+        return out;
+    }
+}
+exports.Tree = Tree;
+// recursiveWalk is used to do a pre-order walk of a node
+// recursively. Returns true if the walk should be aborted
+async function recursiveWalk(n, fn) {
+    // Visit the leaf values if any
+    if (n.leaf !== null && await fn(n.leaf.key, n.leaf.val)) {
+        return true;
+    }
+    // Recurse on the children
+    let i = 0;
+    let k = n.edges.length; // keeps track of number of edges in previous iteration
+    while (i < k) {
+        const e = n.edges[i];
+        if (await recursiveWalk(e.node, fn)) {
+            return true;
+        }
+        // It is a possibility that the WalkFn modified the node we are
+        // iterating on. If there are no more edges, mergeChild happened,
+        // so the last edge became the current node n, on which we'll
+        // iterate one last time.
+        if (n.edges.length === 0) {
+            return recursiveWalk(n, fn);
+        }
+        // If there are now less edges than in the previous iteration,
+        // then do not increment the loop index, since the current index
+        // points to a new edge. Otherwise, get to the next index.
+        if (n.edges.length >= k) {
+            i++;
+        }
+        k = n.edges.length;
+    }
+    return false;
+}
+// Factory functions for convenience
+function createTree() {
+    return new Tree();
+}
+function createTreeFromMap(m) {
+    return Tree.newFromMap(m);
+}
+//# sourceMappingURL=radix.js.map

package/dist/pkg/radix/radix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"radix.js","sourceRoot":"","sources":["../../../pkg/radix/radix.ts"],"names":[],"mappings":";;;AA6iBA,gCAEC;AAED,8CAEC;AA9iBD,wCAAwC;AACxC,MAAM,QAAQ;IAIV,YAAY,GAAW,EAAE,GAAQ;QAC7B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACnB,CAAC;CACJ;AAED,yCAAyC;AACzC,MAAM,IAAI;IAIN,YAAY,KAAa,EAAE,IAAU;QACjC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACrB,CAAC;CACJ;AAED,MAAM,IAAI;IAAV;QACI,sCAAsC;QACtC,SAAI,GAAoB,IAAI,CAAC;QAE7B,wCAAwC;QACxC,WAAM,GAAW,EAAE,CAAC;QAEpB,iDAAiD;QACjD,sDAAsD;QACtD,6CAA6C;QAC7C,UAAK,GAAW,EAAE,CAAC;IAsEvB,CAAC;IApEG,MAAM;QACF,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IAC9B,CAAC;IAED,OAAO,CAAC,CAAO;QACX,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,wCAAwC;QACxC,OAAO,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC;YAClD,GAAG,EAAE,CAAC;QACV,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,UAAU,CAAC,KAAa,EAAE,IAAU;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,gBAAgB;QAChB,OAAO,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YAChD,GAAG,EAAE,CAAC;QACV,CAAC;QAED,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;YAC5B,OAAO;QACX,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,CAAC,KAAa;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,gBAAgB;QAChB,OAAO,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YAChD,GAAG,EAAE,CAAC;QACV,CAAC;QAED,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;YAC/C,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,OAAO,CAAC,KAAa;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC9B,IAAI,GAAG,GAAG,CAAC,CAAC;QAEZ,gBAAgB;QAChB,OAAO,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,KAAK,EAAE,CAAC;YAChD,GAAG,EAAE,CAAC;QACV,CAAC;QAED,IAAI,GAAG,GAAG,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,UAAU;QACN,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QACzC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC7B,CAAC;CACJ;AAED,sDAAsD;AACtD,iBAAiB;AACjB,SAAS,aAAa,CAAC,EAAU,EAAE,EAAU;IACzC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC;IAC3C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACvB,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAClB,MAAM;QACV,CAAC;IACL,CAAC;IACD,OAAO,CAAC,CAAC;AACb,CAAC;AAED,yDAAyD;AACzD,yDAAyD;AACzD,kDAAkD;AAClD,qBAAqB;AACrB,MAAa,IAAI;IAIb;QACI,IAAI,CAAC,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,oDAAoD;IACpD,uBAAuB;IACvB,MAAM,CAAC,UAAU,CAAC,CAAmD;QACjE,MAAM,CAAC,GAAG,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,EAAE,CAAC;YACJ,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;gBACnB,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBACf,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnB,CAAC,CAAC,CAAC;YACP,CAAC;iBAAM,CAAC;gBACJ,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBACrC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACnB,CAAC;YACL,CAAC;QACL,CAAC;QACD,OAAO,CAAC,CAAC;IACb,CAAC;IAED,2DAA2D;IAC3D,GAAG;QACC,OAAO,IAAI,CAAC,IAAI,CAAC;IACrB,CAAC;IAED,6CAA6C;IAC7C,yDAAyD;IACzD,MAAM,CAAC,CAAS,EAAE,CAAM;QACpB,IAAI,MAAM,GAAgB,IAAI,CAAC;QAC/B,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,OAAO,IAAI,EAAE,CAAC;YACV,wBAAwB;YACxB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;oBACb,MAAM,GAAG,GAAG,CAAC,CAAC,IAAK,CAAC,GAAG,CAAC;oBACxB,CAAC,CAAC,IAAK,CAAC,GAAG,GAAG,CAAC,CAAC;oBAChB,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACvB,CAAC;gBAED,CAAC,CAAC,IAAI,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACZ,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC9B,CAAC;YAED,oBAAoB;YACpB,MAAM,GAAG,CAAC,CAAC;YACX,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAS,CAAC;YAE5C,sBAAsB;YACtB,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACb,MAAM,CAAC,GAAG,IAAI,IAAI,CACd,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EACpB,IAAI,IAAI,EAAE,CACb,CAAC;gBACF,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;gBACvB,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,IAAI,EAAE,CAAC;gBACZ,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC9B,CAAC;YAED,sDAAsD;YACtD,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;YACrD,IAAI,YAAY,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBACnC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;gBACxC,SAAS;YACb,CAAC;YAED,iBAAiB;YACjB,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,MAAM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAC;YACzB,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;YACjD,MAAO,CAAC,UAAU,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YAEhD,4BAA4B;YAC5B,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,CAClB,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,EACjC,CAAC,CACJ,CAAC,CAAC;YACH,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YAE5C,yBAAyB;YACzB,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAEhC,+CAA+C;YAC/C,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YACxC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;gBAClB,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC9B,CAAC;YAED,iCAAiC;YACjC,MAAM,OAAO,GAAG,IAAI,IAAI,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;YACpB,OAAO,CAAC,MAAM,GAAG,MAAM,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YACvD,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,yDAAyD;IACzD,8BAA8B;IAC9B,MAAM,CAAC,CAAS;QACZ,IAAI,MAAM,GAAgB,IAAI,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,OAAO,IAAI,EAAE,CAAC;YACV,2BAA2B;YAC3B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;oBACd,MAAM;gBACV,CAAC;gBACD,SAAS;gBACT,MAAM,IAAI,GAAG,CAAC,CAAC,IAAK,CAAC;gBACrB,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;gBACd,IAAI,CAAC,IAAI,EAAE,CAAC;gBAEZ,sDAAsD;gBACtD,IAAI,MAAM,KAAK,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1C,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC1B,CAAC;gBAED,qCAAqC;gBACrC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC1C,CAAC,CAAC,UAAU,EAAE,CAAC;gBACnB,CAAC;gBAED,oDAAoD;gBACpD,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,CAAC,IAAI;oBACvC,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;oBAChD,MAAM,CAAC,UAAU,EAAE,CAAC;gBACxB,CAAC;gBAED,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC5B,CAAC;YAED,mBAAmB;YACnB,MAAM,GAAG,CAAC,CAAC;YACX,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAS,CAAC;YAC7B,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACb,MAAM;YACV,CAAC;YAED,4BAA4B;YAC5B,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;QACD,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,4DAA4D;IAC5D,sCAAsC;IACtC,gDAAgD;IAChD,KAAK,CAAC,YAAY,CAAC,CAAS;QACxB,OAAO,MAAM,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,0CAA0C;IAC1C,KAAK,CAAC,aAAa,CAAC,MAAmB,EAAE,CAAO,EAAE,MAAc;QAC5D,2BAA2B;QAC3B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,uBAAuB;YACvB,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,4DAA4D;YAC5D,MAAM,aAAa,CAAC,CAAC,EAAE,CAAC,CAAS,EAAE,CAAM,EAAoB,EAAE;gBAC3D,WAAW,EAAE,CAAC;gBACd,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAClC,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;gBACb,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,6BAA6B;YAE3C,oDAAoD;YACpD,IAAI,MAAM,KAAK,IAAI,IAAI,MAAM,KAAK,IAAI,CAAC,IAAI;gBACvC,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;gBAChD,MAAM,CAAC,UAAU,EAAE,CAAC;YACxB,CAAC;YACD,IAAI,CAAC,IAAI,IAAI,WAAW,CAAC;YACzB,OAAO,WAAW,CAAC;QACvB,CAAC;QAED,mBAAmB;QACnB,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,IAAI;YACd,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;YACzE,OAAO,CAAC,CAAC;QACb,CAAC;QAED,4BAA4B;QAC5B,IAAI,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YACtC,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,CAAC;aAAM,CAAC;YACJ,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAChD,CAAC;IAED,kDAAkD;IAClD,gCAAgC;IAChC,GAAG,CAAC,CAAS;QACT,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,OAAO,IAAI,EAAE,CAAC;YACV,2BAA2B;YAC3B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;oBACb,OAAO,CAAC,CAAC,CAAC,IAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAC/B,CAAC;gBACD,MAAM;YACV,CAAC;YAED,mBAAmB;YACnB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAS,CAAC;YAC5C,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACb,MAAM;YACV,CAAC;YAED,4BAA4B;YAC5B,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;QACD,OAAO,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,+CAA+C;IAC/C,wDAAwD;IACxD,aAAa,CAAC,CAAS;QACnB,IAAI,IAAI,GAAoB,IAAI,CAAC;QACjC,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,OAAO,IAAI,EAAE,CAAC;YACV,uBAAuB;YACvB,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;gBACb,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;YAClB,CAAC;YAED,2BAA2B;YAC3B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM;YACV,CAAC;YAED,mBAAmB;YACnB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAS,CAAC;YAC5C,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACb,MAAM;YACV,CAAC;YAED,4BAA4B;YAC5B,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;QACD,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,0DAA0D;IAC1D,OAAO;QACH,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;gBACb,OAAO,CAAC,CAAC,CAAC,IAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC5C,CAAC;YACD,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;QACD,OAAO,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,0DAA0D;IAC1D,OAAO;QACH,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,IAAI,EAAE,CAAC;YACV,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;YAC3B,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;gBACV,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC1B,SAAS;YACb,CAAC;YACD,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC;gBACb,OAAO,CAAC,CAAC,CAAC,IAAK,CAAC,GAAG,EAAE,CAAC,CAAC,IAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC5C,CAAC;YACD,MAAM;QACV,CAAC;QACD,OAAO,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,gCAAgC;IAChC,KAAK,CAAC,IAAI,CAAC,EAAU;QACjB,MAAM,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACvC,CAAC;IAED,qDAAqD;IACrD,KAAK,CAAC,UAAU,CAAC,MAAc,EAAE,EAAU;QACvC,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,MAAM,GAAG,MAAM,CAAC;QAEpB,OAAO,IAAI,EAAE,CAAC;YACV,2BAA2B;YAC3B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,MAAM,aAAa,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC3B,OAAO;YACX,CAAC;YAED,mBAAmB;YACnB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAS,CAAC;YAC5C,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACb,OAAO;YACX,CAAC;YAED,4BAA4B;YAC5B,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBAC3C,SAAS;YACb,CAAC;YACD,IAAI,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,uCAAuC;gBACvC,MAAM,aAAa,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/B,CAAC;YACD,OAAO;QACX,CAAC;IACL,CAAC;IAED,6DAA6D;IAC7D,6DAA6D;IAC7D,2DAA2D;IAC3D,oCAAoC;IACpC,KAAK,CAAC,QAAQ,CAAC,IAAY,EAAE,EAAU;QACnC,IAAI,CAAC,GAAS,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,MAAM,GAAG,IAAI,CAAC;QAElB,OAAO,IAAI,EAAE,CAAC;YACV,+BAA+B;YAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtD,OAAO;YACX,CAAC;YAED,2BAA2B;YAC3B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtB,OAAO;YACX,CAAC;YAED,mBAAmB;YACnB,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAS,CAAC;YAC5C,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBACb,OAAO;YACX,CAAC;YAED,4BAA4B;YAC5B,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9B,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAED,2DAA2D;IAC3D,KAAK,CAAC,KAAK;QACP,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC,CAAS,EAAE,CAAM,EAAoB,EAAE;YACpD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACX,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QACH,OAAO,GAAG,CAAC;IACf,CAAC;CACJ;AA1YD,oBA0YC;AAED,yDAAyD;AACzD,0DAA0D;AAC1D,KAAK,UAAU,aAAa,CAAC,CAAO,EAAE,EAAU;IAC5C,+BAA+B;IAC/B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,0BAA0B;IAC1B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,uDAAuD;IAC/E,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACX,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,MAAM,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;YAClC,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,+DAA+D;QAC/D,iEAAiE;QACjE,6DAA6D;QAC7D,yBAAyB;QACzB,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,aAAa,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChC,CAAC;QACD,8DAA8D;QAC9D,gEAAgE;QAChE,0DAA0D;QAC1D,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACtB,CAAC,EAAE,CAAC;QACR,CAAC;QACD,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IACvB,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED,oCAAoC;AACpC,SAAgB,UAAU;IACtB,OAAO,IAAI,IAAI,EAAE,CAAC;AACtB,CAAC;AAED,SAAgB,iBAAiB,CAAC,CAAmD;IACjF,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC9B,CAAC"}

package/dist/pkg/radix/radix.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=radix.test.d.ts.map

package/dist/pkg/radix/radix.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"radix.test.d.ts","sourceRoot":"","sources":["../../../pkg/radix/radix.test.ts"],"names":[],"mappings":""}