@libp2p/kad-dht 12.0.15 → 12.0.16

package/dist/src/routing-table/k-bucket.js

@@ -1,32 +1,9 @@
-/*
-index.js - Kademlia DHT K-bucket implementation as a binary tree.
-
-The MIT License (MIT)
-
-Copyright (c) 2013-2021 Tristan Slominski
-
-Permission is hereby granted, free of charge, to any person
-obtaining a copy of this software and associated documentation
-files (the "Software"), to deal in the Software without
-restriction, including without limitation the rights to use,
-copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the
-Software is furnished to do so, subject to the following
-conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
-OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
-HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
-WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
-OTHER DEALINGS IN THE SOFTWARE.
-*/
 import { TypedEventEmitter } from '@libp2p/interface';
+import map from 'it-map';
+import { toString as uint8ArrayToString } from 'uint8arrays/to-string';
+import { xor as uint8ArrayXor } from 'uint8arrays/xor';
+import { PeerDistanceList } from '../peer-list/peer-distance-list.js';
+import { KBUCKET_SIZE } from './index.js';
 function arrayEquals(array1, array2) {
     if (array1 === array2) {
         return true;
@@ -41,150 +18,96 @@ function arrayEquals(array1, array2) {
     }
     return true;
 }
-function createNode() {
-    // @ts-expect-error loose types
-    return { contacts: [], dontSplit: false, left: null, right: null };
-}
 function ensureInt8(name, val) {
     if (!(val instanceof Uint8Array)) {
         throw new TypeError(name + ' is not a Uint8Array');
     }
+    if (val.byteLength !== 32) {
+        throw new TypeError(name + ' had incorrect length');
+    }
+}
+export function isLeafBucket(obj) {
+    return Array.isArray(obj?.peers);
 }
 /**
- * Implementation of a Kademlia DHT k-bucket used for storing
- * contact (peer node) information.
+ * Implementation of a Kademlia DHT routing table as a prefix binary trie with
+ * configurable prefix length, bucket split threshold and size.
  */
 export class KBucket extends TypedEventEmitter {
-    localNodeId;
     root;
-    numberOfNodesPerKBucket;
+    localPeer;
+    prefixLength;
+    splitThreshold;
+    kBucketSize;
     numberOfNodesToPing;
-    distance;
-    arbiter;
     constructor(options) {
         super();
-        this.localNodeId = options.localNodeId;
-        this.numberOfNodesPerKBucket = options.numberOfNodesPerKBucket ?? 20;
+        this.localPeer = options.localPeer;
+        this.prefixLength = options.prefixLength;
+        this.kBucketSize = options.kBucketSize ?? KBUCKET_SIZE;
+        this.splitThreshold = options.splitThreshold ?? this.kBucketSize;
         this.numberOfNodesToPing = options.numberOfNodesToPing ?? 3;
-        this.distance = options.distance ?? KBucket.distance;
-        // use an arbiter from options or vectorClock arbiter by default
-        this.arbiter = options.arbiter ?? KBucket.arbiter;
-        ensureInt8('option.localNodeId as parameter 1', this.localNodeId);
-        this.root = createNode();
-    }
-    /**
-     * Default arbiter function for contacts with the same id. Uses
-     * contact.vectorClock to select which contact to update the k-bucket with.
-     * Contact with larger vectorClock field will be selected. If vectorClock is
-     * the same, candidate will be selected.
-     *
-     * @param {object} incumbent - Contact currently stored in the k-bucket.
-     * @param {object} candidate - Contact being added to the k-bucket.
-     * @returns {object} Contact to updated the k-bucket with.
-     */
-    static arbiter(incumbent, candidate) {
-        return (incumbent.vectorClock ?? 0) > (candidate.vectorClock ?? 0) ? incumbent : candidate;
-    }
-    /**
-     * Default distance function. Finds the XOR
-     * distance between firstId and secondId.
-     *
-     * @param  {Uint8Array} firstId -  Uint8Array containing first id.
-     * @param  {Uint8Array} secondId -  Uint8Array containing second id.
-     * @returns {number} Integer The XOR distance between firstId and secondId.
-     */
-    static distance(firstId, secondId) {
-        let distance = 0;
-        let i = 0;
-        const min = Math.min(firstId.length, secondId.length);
-        const max = Math.max(firstId.length, secondId.length);
-        for (; i < min; ++i) {
-            distance = distance * 256 + (firstId[i] ^ secondId[i]);
-        }
-        for (; i < max; ++i)
-            distance = distance * 256 + 255;
-        return distance;
+        ensureInt8('options.localPeer.kadId', options.localPeer.kadId);
+        this.root = {
+            prefix: '',
+            depth: 0,
+            peers: []
+        };
     }
     /**
      * Adds a contact to the k-bucket.
      *
-     * @param {object} contact - the contact object to add
+     * @param {Peer} peer - the contact object to add
      */
-    add(contact) {
-        ensureInt8('contact.id', contact?.id);
-        let bitIndex = 0;
-        let node = this.root;
-        while (node.contacts === null) {
-            // this is not a leaf node but an inner node with 'low' and 'high'
-            // branches; we will check the appropriate bit of the identifier and
-            // delegate to the appropriate node for further processing
-            node = this._determineNode(node, contact.id, bitIndex++);
-        }
+    add(peer) {
+        ensureInt8('peer.kadId', peer?.kadId);
+        const bucket = this._determineBucket(peer.kadId);
         // check if the contact already exists
-        const index = this._indexOf(node, contact.id);
-        if (index >= 0) {
-            this._update(node, index, contact);
-            return this;
+        if (this._indexOf(bucket, peer.kadId) > -1) {
+            return;
         }
-        if (node.contacts.length < this.numberOfNodesPerKBucket) {
-            node.contacts.push(contact);
-            this.safeDispatchEvent('added', { detail: contact });
-            return this;
+        // are there too many peers in the bucket and can we make the trie deeper?
+        if (bucket.peers.length === this.splitThreshold && bucket.depth < this.prefixLength) {
+            // split the bucket
+            this._split(bucket);
+            // try again
+            this.add(peer);
+            return;
         }
-        // the bucket is full
-        if (node.dontSplit) {
-            // we are not allowed to split the bucket
-            // we need to ping the first this.numberOfNodesToPing
-            // in order to determine if they are alive
-            // only if one of the pinged nodes does not respond, can the new contact
-            // be added (this prevents DoS flodding with new invalid contacts)
-            this.safeDispatchEvent('ping', {
-                detail: {
-                    oldContacts: node.contacts.slice(0, this.numberOfNodesToPing),
-                    newContact: contact
-                }
-            });
-            return this;
+        // is there space in the bucket?
+        if (bucket.peers.length < this.kBucketSize) {
+            bucket.peers.push(peer);
+            this.safeDispatchEvent('added', { detail: peer });
+            return;
         }
-        this._split(node, bitIndex);
-        return this.add(contact);
+        // we are at the bottom of the trie and the bucket is full so we can't add
+        // any more peers.
+        //
+        // instead ping the first this.numberOfNodesToPing in order to determine
+        // if they are still online.
+        //
+        // only add the new peer if one of the pinged nodes does not respond, this
+        // prevents DoS flooding with new invalid contacts.
+        this.safeDispatchEvent('ping', {
+            detail: {
+                oldContacts: bucket.peers.slice(0, this.numberOfNodesToPing),
+                newContact: peer
+            }
+        });
     }
     /**
-     * Get the n closest contacts to the provided node id. "Closest" here means:
+     * Get 0-n closest contacts to the provided node id. "Closest" here means:
      * closest according to the XOR metric of the contact node id.
      *
      * @param {Uint8Array} id - Contact node id
-     * @param {number} n - Integer (Default: Infinity) The maximum number of closest contacts to return
-     * @returns {Array} Array Maximum of n closest contacts to the node id
+     * @returns {Generator<Peer, void, undefined>} Array Maximum of n closest contacts to the node id
      */
-    closest(id, n = Infinity) {
-        ensureInt8('id', id);
-        if ((!Number.isInteger(n) && n !== Infinity) || n <= 0) {
-            throw new TypeError('n is not positive number');
-        }
-        let contacts = [];
-        for (let nodes = [this.root], bitIndex = 0; nodes.length > 0 && contacts.length < n;) {
-            const node = nodes.pop();
-            if (node == null) {
-                continue;
-            }
-            if (node.contacts === null) {
-                const detNode = this._determineNode(node, id, bitIndex++);
-                nodes.push(node.left === detNode ? node.right : node.left);
-                nodes.push(detNode);
-            }
-            else {
-                contacts = contacts.concat(node.contacts);
-            }
+    *closest(id, n = this.kBucketSize) {
+        const list = new PeerDistanceList(id, n);
+        for (const peer of this.toIterable()) {
+            list.addWitKadId({ id: peer.peerId, multiaddrs: [] }, peer.kadId);
         }
-        return contacts
-            .map(a => ({
-            distance: this.distance(a.id, id),
-            contact: a
-        }))
-            .sort((a, b) => a.distance - b.distance)
-            .slice(0, n)
-            .map(a => a.contact);
+        yield* map(list.peers, info => info.id);
     }
     /**
      * Counts the total number of contacts in the tree.
@@ -192,58 +115,20 @@ export class KBucket extends TypedEventEmitter {
      * @returns {number} The number of contacts held in the tree
      */
     count() {
-        // return this.toArray().length
-        let count = 0;
-        for (const nodes = [this.root]; nodes.length > 0;) {
-            const node = nodes.pop();
-            if (node == null) {
-                continue;
+        function countBucket(bucket) {
+            if (isLeafBucket(bucket)) {
+                return bucket.peers.length;
             }
-            if (node.contacts === null) {
-                nodes.push(node.right, node.left);
+            let count = 0;
+            if (bucket.left != null) {
+                count += countBucket(bucket.left);
             }
-            else {
-                count += node.contacts.length;
+            if (bucket.right != null) {
+                count += countBucket(bucket.right);
             }
+            return count;
         }
-        return count;
-    }
-    /**
-     * Determines whether the id at the bitIndex is 0 or 1.
-     * Return left leaf if `id` at `bitIndex` is 0, right leaf otherwise
-     *
-     * @param {object} node - internal object that has 2 leafs: left and right
-     * @param {Uint8Array} id - Id to compare localNodeId with.
-     * @param {number} bitIndex - Integer (Default: 0) The bit index to which bit to check in the id Uint8Array.
-     * @returns {object} left leaf if id at bitIndex is 0, right leaf otherwise.
-     */
-    _determineNode(node, id, bitIndex) {
-        // **NOTE** remember that id is a Uint8Array and has granularity of
-        // bytes (8 bits), whereas the bitIndex is the _bit_ index (not byte)
-        // id's that are too short are put in low bucket (1 byte = 8 bits)
-        // (bitIndex >> 3) finds how many bytes the bitIndex describes
-        // bitIndex % 8 checks if we have extra bits beyond byte multiples
-        // if number of bytes is <= no. of bytes described by bitIndex and there
-        // are extra bits to consider, this means id has less bits than what
-        // bitIndex describes, id therefore is too short, and will be put in low
-        // bucket
-        const bytesDescribedByBitIndex = bitIndex >> 3;
-        const bitIndexWithinByte = bitIndex % 8;
-        if ((id.length <= bytesDescribedByBitIndex) && (bitIndexWithinByte !== 0)) {
-            return node.left;
-        }
-        const byteUnderConsideration = id[bytesDescribedByBitIndex];
-        // byteUnderConsideration is an integer from 0 to 255 represented by 8 bits
-        // where 255 is 11111111 and 0 is 00000000
-        // in order to find out whether the bit at bitIndexWithinByte is set
-        // we construct (1 << (7 - bitIndexWithinByte)) which will consist
-        // of all bits being 0, with only one bit set to 1
-        // for example, if bitIndexWithinByte is 3, we will construct 00010000 by
-        // (1 << (7 - 3)) -> (1 << 4) -> 16
-        if ((byteUnderConsideration & (1 << (7 - bitIndexWithinByte))) !== 0) {
-            return node.right;
-        }
-        return node.left;
+        return countBucket(this.root);
     }
     /**
      * Get a contact by its exact ID.
@@ -251,157 +136,126 @@ export class KBucket extends TypedEventEmitter {
      * contact if we have it or null if not. If this is an inner node, determine
      * which branch of the tree to traverse and repeat.
      *
-     * @param {Uint8Array} id - The ID of the contact to fetch.
-     * @returns {object | null} The contact if available, otherwise null
+     * @param {Uint8Array} kadId - The ID of the contact to fetch.
+     * @returns {object | undefined} The contact if available, otherwise null
      */
-    get(id) {
-        ensureInt8('id', id);
-        let bitIndex = 0;
-        let node = this.root;
-        while (node.contacts === null) {
-            node = this._determineNode(node, id, bitIndex++);
-        }
-        // index of uses contact id for matching
-        const index = this._indexOf(node, id);
-        return index >= 0 ? node.contacts[index] : undefined;
+    get(kadId) {
+        const bucket = this._determineBucket(kadId);
+        const index = this._indexOf(bucket, kadId);
+        return bucket.peers[index];
     }
     /**
-     * Returns the index of the contact with provided
-     * id if it exists, returns -1 otherwise.
+     * Removes contact with the provided id.
      *
-     * @param {object} node - internal object that has 2 leafs: left and right
-     * @param {Uint8Array} id - Contact node id.
-     * @returns {number} Integer Index of contact with provided id if it exists, -1 otherwise.
+     * @param {Uint8Array} kadId - The ID of the contact to remove
      */
-    _indexOf(node, id) {
-        for (let i = 0; i < node.contacts.length; ++i) {
-            if (arrayEquals(node.contacts[i].id, id))
-                return i;
+    remove(kadId) {
+        const bucket = this._determineBucket(kadId);
+        const index = this._indexOf(bucket, kadId);
+        if (index > -1) {
+            const peer = bucket.peers.splice(index, 1)[0];
+            this.safeDispatchEvent('removed', {
+                detail: peer
+            });
         }
-        return -1;
     }
     /**
-     * Removes contact with the provided id.
+     * Similar to `toArray()` but instead of buffering everything up into an
+     * array before returning it, yields contacts as they are encountered while
+     * walking the tree.
      *
-     * @param {Uint8Array} id - The ID of the contact to remove
-     * @returns {object} The k-bucket itself
+     * @returns {Iterable} All of the contacts in the tree, as an iterable
      */
-    remove(id) {
-        ensureInt8('the id as parameter 1', id);
-        let bitIndex = 0;
-        let node = this.root;
-        while (node.contacts === null) {
-            node = this._determineNode(node, id, bitIndex++);
-        }
-        const index = this._indexOf(node, id);
-        if (index >= 0) {
-            const contact = node.contacts.splice(index, 1)[0];
-            this.safeDispatchEvent('removed', {
-                detail: contact
-            });
+    *toIterable() {
+        function* iterate(bucket) {
+            if (isLeafBucket(bucket)) {
+                yield* bucket.peers;
+                return;
+            }
+            yield* iterate(bucket.left);
+            yield* iterate(bucket.right);
         }
-        return this;
+        yield* iterate(this.root);
     }
     /**
-     * Splits the node, redistributes contacts to the new nodes, and marks the
-     * node that was split as an inner node of the binary tree of nodes by
-     * setting this.root.contacts = null
+     * Default distance function. Finds the XOR distance between firstId and
+     * secondId.
      *
-     * @param {object} node - node for splitting
-     * @param {number} bitIndex - the bitIndex to which byte to check in the Uint8Array for navigating the binary tree
+     * @param  {Uint8Array} firstId - Uint8Array containing first id.
+     * @param  {Uint8Array} secondId - Uint8Array containing second id.
+     * @returns {number} Integer The XOR distance between firstId and secondId.
      */
-    _split(node, bitIndex) {
-        node.left = createNode();
-        node.right = createNode();
-        // redistribute existing contacts amongst the two newly created nodes
-        for (const contact of node.contacts) {
-            this._determineNode(node, contact.id, bitIndex).contacts.push(contact);
-        }
-        // @ts-expect-error loose types
-        node.contacts = null; // mark as inner tree node
-        // don't split the "far away" node
-        // we check where the local node would end up and mark the other one as
-        // "dontSplit" (i.e. "far away")
-        const detNode = this._determineNode(node, this.localNodeId, bitIndex);
-        const otherNode = node.left === detNode ? node.right : node.left;
-        otherNode.dontSplit = true;
+    distance(firstId, secondId) {
+        return BigInt('0x' + uint8ArrayToString(uint8ArrayXor(firstId, secondId), 'base16'));
     }
     /**
-     * Returns all the contacts contained in the tree as an array.
-     * If this is a leaf, return a copy of the bucket. If this is not a leaf,
-     * return the union of the low and high branches (themselves also as arrays).
+     * Determines whether the id at the bitIndex is 0 or 1
+     * Return left leaf if `id` at `bitIndex` is 0, right leaf otherwise
      *
-     * @returns {Array} All of the contacts in the tree, as an array
+     * @param {Uint8Array} kadId - Id to compare localNodeId with
+     * @returns {LeafBucket} left leaf if id at bitIndex is 0, right leaf otherwise.
      */
-    toArray() {
-        let result = [];
-        for (const nodes = [this.root]; nodes.length > 0;) {
-            const node = nodes.pop();
-            if (node == null) {
-                continue;
-            }
-            if (node.contacts === null) {
-                nodes.push(node.right, node.left);
+    _determineBucket(kadId) {
+        const bitString = uint8ArrayToString(kadId, 'base2');
+        const prefix = bitString.substring(0, this.prefixLength);
+        function findBucket(bucket, bitIndex = 0) {
+            if (isLeafBucket(bucket)) {
+                return bucket;
             }
-            else {
-                result = result.concat(node.contacts);
+            const bit = prefix[bitIndex];
+            if (bit === '0') {
+                return findBucket(bucket.left, bitIndex + 1);
             }
+            return findBucket(bucket.right, bitIndex + 1);
         }
-        return result;
+        return findBucket(this.root);
     }
     /**
-     * Similar to `toArray()` but instead of buffering everything up into an
-     * array before returning it, yields contacts as they are encountered while
-     * walking the tree.
+     * Returns the index of the contact with provided
+     * id if it exists, returns -1 otherwise.
      *
-     * @returns {Iterable} All of the contacts in the tree, as an iterable
+     * @param {object} bucket - internal object that has 2 leafs: left and right
+     * @param {Uint8Array} kadId - KadId of peer
+     * @returns {number} Integer Index of contact with provided id if it exists, -1 otherwise.
      */
-    *toIterable() {
-        for (const nodes = [this.root]; nodes.length > 0;) {
-            const node = nodes.pop();
-            if (node == null) {
-                continue;
-            }
-            if (node.contacts === null) {
-                nodes.push(node.right, node.left);
-            }
-            else {
-                yield* node.contacts;
-            }
-        }
+    _indexOf(bucket, kadId) {
+        return bucket.peers.findIndex(peer => arrayEquals(peer.kadId, kadId));
     }
     /**
-     * Updates the contact selected by the arbiter.
-     * If the selection is our old contact and the candidate is some new contact
-     * then the new contact is abandoned (not added).
-     * If the selection is our old contact and the candidate is our old contact
-     * then we are refreshing the contact and it is marked as most recently
-     * contacted (by being moved to the right/end of the bucket array).
-     * If the selection is our new contact, the old contact is removed and the new
-     * contact is marked as most recently contacted.
+     * Modify the bucket, turn it from a leaf bucket to an internal bucket
      *
-     * @param {object} node - internal object that has 2 leafs: left and right
-     * @param {number} index - the index in the bucket where contact exists (index has already been computed in a previous calculation)
-     * @param {object} contact - The contact object to update
+     * @param {any} bucket - bucket for splitting
      */
-    _update(node, index, contact) {
-        // sanity check
-        if (!arrayEquals(node.contacts[index].id, contact.id)) {
-            throw new Error('wrong index for _update');
-        }
-        const incumbent = node.contacts[index];
-        const selection = this.arbiter(incumbent, contact);
-        // if the selection is our old contact and the candidate is some new
-        // contact, then there is nothing to do
-        if (selection === incumbent && incumbent !== contact)
-            return;
-        node.contacts.splice(index, 1); // remove old contact
-        node.contacts.push(selection); // add more recent contact version
-        this.safeDispatchEvent('updated', {
-            detail: {
-                incumbent, selection
+    _split(bucket) {
+        const depth = bucket.depth + 1;
+        // create child buckets
+        const left = {
+            prefix: '0',
+            depth,
+            peers: []
+        };
+        const right = {
+            prefix: '1',
+            depth,
+            peers: []
+        };
+        // redistribute peers
+        for (const peer of bucket.peers) {
+            const bitString = uint8ArrayToString(peer.kadId, 'base2');
+            if (bitString[depth] === '0') {
+                left.peers.push(peer);
             }
-        });
+            else {
+                right.peers.push(peer);
+            }
+        }
+        // convert leaf bucket to internal bucket
+        // @ts-expect-error peers is not a property of LeafBucket
+        delete bucket.peers;
+        // @ts-expect-error left is not a property of LeafBucket
+        bucket.left = left;
+        // @ts-expect-error right is not a property of LeafBucket
+        bucket.right = right;
     }
 }
 //# sourceMappingURL=k-bucket.js.map

package/dist/src/routing-table/k-bucket.js.map

@@ -1 +1 @@
-{"version":3,"file":"k-bucket.js","sourceRoot":"","sources":["../../../src/routing-table/k-bucket.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;EA2BE;AAEF,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AAGrD,SAAS,WAAW,CAAE,MAAkB,EAAE,MAAkB;IAC1D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACtB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QACpC,OAAO,KAAK,CAAA;IACd,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QACxD,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5B,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,UAAU;IACjB,+BAA+B;IAC/B,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;AACpE,CAAC;AAED,SAAS,UAAU,CAAE,IAAY,EAAE,GAAgB;IACjD,IAAI,CAAC,CAAC,GAAG,YAAY,UAAU,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,SAAS,CAAC,IAAI,GAAG,sBAAsB,CAAC,CAAA;IACpD,CAAC;AACH,CAAC;AAiED;;;GAGG;AACH,MAAM,OAAO,OAAQ,SAAQ,iBAAgC;IACpD,WAAW,CAAY;IACvB,IAAI,CAAQ;IACF,uBAAuB,CAAQ;IAC/B,mBAAmB,CAAQ;IAC3B,QAAQ,CAA0C;IAClD,OAAO,CAAqD;IAE7E,YAAa,OAAuB;QAClC,KAAK,EAAE,CAAA;QAEP,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,CAAC,uBAAuB,GAAG,OAAO,CAAC,uBAAuB,IAAI,EAAE,CAAA;QACpE,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAA;QAC3D,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,QAAQ,CAAA;QACpD,gEAAgE;QAChE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,OAAO,CAAA;QAEjD,UAAU,CAAC,mCAAmC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAA;QAEjE,IAAI,CAAC,IAAI,GAAG,UAAU,EAAE,CAAA;IAC1B,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,OAAO,CAAE,SAAkB,EAAE,SAAkB;QACpD,OAAO,CAAC,SAAS,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAA;IAC5F,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,QAAQ,CAAE,OAAmB,EAAE,QAAoB;QACxD,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,IAAI,CAAC,GAAG,CAAC,CAAA;QACT,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;QACrD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;QACrD,OAAO,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC;YACpB,QAAQ,GAAG,QAAQ,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;QACxD,CAAC;QACD,OAAO,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC;YAAE,QAAQ,GAAG,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAA;QACpD,OAAO,QAAQ,CAAA;IACjB,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAE,OAAgB;QACnB,UAAU,CAAC,YAAY,EAAE,OAAO,EAAE,EAAE,CAAC,CAAA;QAErC,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAEpB,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC9B,kEAAkE;YAClE,oEAAoE;YACpE,0DAA0D;YAC1D,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAA;QAC1D,CAAC;QAED,sCAAsC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC,CAAA;QAC7C,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAA;YAClC,OAAO,IAAI,CAAA;QACb,CAAC;QAED,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,uBAAuB,EAAE,CAAC;YACxD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YAC3B,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAA;YACpD,OAAO,IAAI,CAAA;QACb,CAAC;QAED,qBAAqB;QACrB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,yCAAyC;YACzC,qDAAqD;YACrD,0CAA0C;YAC1C,wEAAwE;YACxE,kEAAkE;YAClE,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE;gBAC7B,MAAM,EAAE;oBACN,WAAW,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC;oBAC7D,UAAU,EAAE,OAAO;iBACpB;aACF,CAAC,CAAA;YACF,OAAO,IAAI,CAAA;QACb,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QAC3B,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;IAC1B,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAE,EAAc,EAAE,CAAC,GAAG,QAAQ;QACnC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAEpB,IAAI,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACvD,MAAM,IAAI,SAAS,CAAC,0BAA0B,CAAC,CAAA;QACjD,CAAC;QAED,IAAI,QAAQ,GAAc,EAAE,CAAA;QAE5B,KAAK,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;YACrF,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;YAExB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACjB,SAAQ;YACV,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;gBAC3B,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAA;gBACzD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC1D,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;YACrB,CAAC;iBAAM,CAAC;gBACN,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;QAED,OAAO,QAAQ;aACZ,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;YACjC,OAAO,EAAE,CAAC;SACX,CAAC,CAAC;aACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;aACvC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;IACxB,CAAC;IAED;;;;OAIG;IACH,KAAK;QACH,+BAA+B;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,KAAK,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;YAClD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;YAExB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACjB,SAAQ;YACV,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;YACnC,CAAC;iBAAM,CAAC;gBACN,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAA;YAC/B,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;;;;;OAQG;IACH,cAAc,CAAE,IAAS,EAAE,EAAc,EAAE,QAAgB;QACzD,mEAAmE;QACnE,qEAAqE;QAErE,kEAAkE;QAClE,8DAA8D;QAC9D,kEAAkE;QAClE,wEAAwE;QACxE,oEAAoE;QACpE,wEAAwE;QACxE,SAAS;QACT,MAAM,wBAAwB,GAAG,QAAQ,IAAI,CAAC,CAAA;QAC9C,MAAM,kBAAkB,GAAG,QAAQ,GAAG,CAAC,CAAA;QACvC,IAAI,CAAC,EAAE,CAAC,MAAM,IAAI,wBAAwB,CAAC,IAAI,CAAC,kBAAkB,KAAK,CAAC,CAAC,EAAE,CAAC;YAC1E,OAAO,IAAI,CAAC,IAAI,CAAA;QAClB,CAAC;QAED,MAAM,sBAAsB,GAAG,EAAE,CAAC,wBAAwB,CAAC,CAAA;QAE3D,2EAA2E;QAC3E,0CAA0C;QAC1C,oEAAoE;QACpE,kEAAkE;QAClE,kDAAkD;QAClD,yEAAyE;QACzE,mCAAmC;QACnC,IAAI,CAAC,sBAAsB,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACrE,OAAO,IAAI,CAAC,KAAK,CAAA;QACnB,CAAC;QAED,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IAED;;;;;;;;OAQG;IACH,GAAG,CAAE,EAAc;QACjB,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QAEpB,IAAI,QAAQ,GAAG,CAAC,CAAA;QAEhB,IAAI,IAAI,GAAW,IAAI,CAAC,IAAI,CAAA;QAC5B,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC9B,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAA;QAClD,CAAC;QAED,wCAAwC;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QACrC,OAAO,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;IACtD,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CAAE,IAAY,EAAE,EAAc;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAC9C,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;gBAAE,OAAO,CAAC,CAAA;QACpD,CAAC;QAED,OAAO,CAAC,CAAC,CAAA;IACX,CAAC;IAED;;;;;OAKG;IACH,MAAM,CAAE,EAAc;QACpB,UAAU,CAAC,uBAAuB,EAAE,EAAE,CAAC,CAAA;QAEvC,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QAEpB,OAAO,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC9B,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAA;QAClD,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;QACrC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YACjD,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE;gBAChC,MAAM,EAAE,OAAO;aAChB,CAAC,CAAA;QACJ,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAE,IAAY,EAAE,QAAgB;QACpC,IAAI,CAAC,IAAI,GAAG,UAAU,EAAE,CAAA;QACxB,IAAI,CAAC,KAAK,GAAG,UAAU,EAAE,CAAA;QAEzB,qEAAqE;QACrE,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QACxE,CAAC;QAED,+BAA+B;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA,CAAC,0BAA0B;QAE/C,kCAAkC;QAClC,uEAAuE;QACvE,gCAAgC;QAChC,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAA;QACrE,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QAChE,SAAS,CAAC,SAAS,GAAG,IAAI,CAAA;IAC5B,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,IAAI,MAAM,GAAc,EAAE,CAAA;QAC1B,KAAK,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;YAClD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;YAExB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACjB,SAAQ;YACV,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;YACnC,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;;OAMG;IACH,CAAE,UAAU;QACV,KAAK,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC;YAClD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAA;YAExB,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;gBACjB,SAAQ;YACV,CAAC;YAED,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAA;YACnC,CAAC;iBAAM,CAAC;gBACN,KAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,OAAO,CAAE,IAAY,EAAE,KAAa,EAAE,OAAgB;QACpD,eAAe;QACf,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACtD,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAA;QAC5C,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;QAClD,oEAAoE;QACpE,uCAAuC;QACvC,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,OAAO;YAAE,OAAM;QAE5D,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA,CAAC,qBAAqB;QACpD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA,CAAC,kCAAkC;QAChE,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE;YAChC,MAAM,EAAE;gBACN,SAAS,EAAE,SAAS;aACrB;SACF,CAAC,CAAA;IACJ,CAAC;CACF"}
+{"version":3,"file":"k-bucket.js","sourceRoot":"","sources":["../../../src/routing-table/k-bucket.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AACrD,OAAO,GAAG,MAAM,QAAQ,CAAA;AACxB,OAAO,EAAE,QAAQ,IAAI,kBAAkB,EAAE,MAAM,uBAAuB,CAAA;AACtE,OAAO,EAAE,GAAG,IAAI,aAAa,EAAE,MAAM,iBAAiB,CAAA;AACtD,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAA;AACrE,OAAO,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAGzC,SAAS,WAAW,CAAE,MAAkB,EAAE,MAAkB;IAC1D,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;QACtB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QACpC,OAAO,KAAK,CAAA;IACd,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QACxD,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5B,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,UAAU,CAAE,IAAY,EAAE,GAAgB;IACjD,IAAI,CAAC,CAAC,GAAG,YAAY,UAAU,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,SAAS,CAAC,IAAI,GAAG,sBAAsB,CAAC,CAAA;IACpD,CAAC;IAED,IAAI,GAAG,CAAC,UAAU,KAAK,EAAE,EAAE,CAAC;QAC1B,MAAM,IAAI,SAAS,CAAC,IAAI,GAAG,uBAAuB,CAAC,CAAA;IACrD,CAAC;AACH,CAAC;AAuED,MAAM,UAAU,YAAY,CAAE,GAAQ;IACpC,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,OAAQ,SAAQ,iBAAgC;IACpD,IAAI,CAAQ;IACZ,SAAS,CAAM;IACL,YAAY,CAAQ;IACpB,cAAc,CAAQ;IACtB,WAAW,CAAQ;IACnB,mBAAmB,CAAQ;IAE5C,YAAa,OAAuB;QAClC,KAAK,EAAE,CAAA;QAEP,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAA;QAClC,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,CAAA;QACxC,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,YAAY,CAAA;QACtD,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,IAAI,CAAC,WAAW,CAAA;QAChE,IAAI,CAAC,mBAAmB,GAAG,OAAO,CAAC,mBAAmB,IAAI,CAAC,CAAA;QAE3D,UAAU,CAAC,yBAAyB,EAAE,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QAE9D,IAAI,CAAC,IAAI,GAAG;YACV,MAAM,EAAE,EAAE;YACV,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,EAAE;SACV,CAAA;IACH,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAE,IAAU;QACb,UAAU,CAAC,YAAY,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;QAErC,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAEhD,sCAAsC;QACtC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC3C,OAAM;QACR,CAAC;QAED,0EAA0E;QAC1E,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,cAAc,IAAI,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YACpF,mBAAmB;YACnB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YAEnB,YAAY;YACZ,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAEd,OAAM;QACR,CAAC;QAED,gCAAgC;QAChC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;YAC3C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACvB,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAA;YAEjD,OAAM;QACR,CAAC;QAED,0EAA0E;QAC1E,kBAAkB;QAClB,EAAE;QACF,wEAAwE;QACxE,4BAA4B;QAC5B,EAAE;QACF,0EAA0E;QAC1E,mDAAmD;QACnD,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE;YAC7B,MAAM,EAAE;gBACN,WAAW,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC;gBAC5D,UAAU,EAAE,IAAI;aACjB;SACF,CAAC,CAAA;IACJ,CAAC;IAED;;;;;;OAMG;IACH,CAAE,OAAO,CAAE,EAAc,EAAE,IAAY,IAAI,CAAC,WAAW;QACrD,MAAM,IAAI,GAAG,IAAI,gBAAgB,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;QAExC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAA;QACnE,CAAC;QAED,KAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAC1C,CAAC;IAED;;;;OAIG;IACH,KAAK;QACH,SAAS,WAAW,CAAE,MAAc;YAClC,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,CAAA;YAC5B,CAAC;YAED,IAAI,KAAK,GAAG,CAAC,CAAA;YAEb,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC;gBACxB,KAAK,IAAI,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACnC,CAAC;YAED,IAAI,MAAM,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,KAAK,IAAI,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YACpC,CAAC;YAED,OAAO,KAAK,CAAA;QACd,CAAC;QAED,OAAO,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC/B,CAAC;IAED;;;;;;;;OAQG;IACH,GAAG,CAAE,KAAiB;QACpB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QAE1C,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAC5B,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAE,KAAiB;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAA;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;QAE1C,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;YACf,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;YAC7C,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE;gBAChC,MAAM,EAAE,IAAI;aACb,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,CAAE,UAAU;QACV,QAAS,CAAC,CAAC,OAAO,CAAE,MAAc;YAChC,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,KAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAA;gBACpB,OAAM;YACR,CAAC;YAED,KAAM,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC5B,KAAM,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAC/B,CAAC;QAED,KAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC5B,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CAAE,OAAmB,EAAE,QAAoB;QACjD,OAAO,MAAM,CAAC,IAAI,GAAG,kBAAkB,CAAC,aAAa,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAA;IACtF,CAAC;IAED;;;;;;OAMG;IACK,gBAAgB,CAAE,KAAiB;QACzC,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;QACpD,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,CAAC,CAAA;QAExD,SAAS,UAAU,CAAE,MAAc,EAAE,WAAmB,CAAC;YACvD,IAAI,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,OAAO,MAAM,CAAA;YACf,CAAC;YAED,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAA;YAE5B,IAAI,GAAG,KAAK,GAAG,EAAE,CAAC;gBAChB,OAAO,UAAU,CAAC,MAAM,CAAC,IAAI,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAA;YAC9C,CAAC;YAED,OAAO,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAA;QAC/C,CAAC;QAED,OAAO,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAC9B,CAAC;IAED;;;;;;;OAOG;IACK,QAAQ,CAAE,MAAkB,EAAE,KAAiB;QACrD,OAAO,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAA;IACvE,CAAC;IAED;;;;OAIG;IACK,MAAM,CAAE,MAAkB;QAChC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAA;QAE9B,uBAAuB;QACvB,MAAM,IAAI,GAAe;YACvB,MAAM,EAAE,GAAG;YACX,KAAK;YACL,KAAK,EAAE,EAAE;SACV,CAAA;QACD,MAAM,KAAK,GAAe;YACxB,MAAM,EAAE,GAAG;YACX,KAAK;YACL,KAAK,EAAE,EAAE;SACV,CAAA;QAED,qBAAqB;QACrB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,MAAM,SAAS,GAAG,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAA;YAEzD,IAAI,SAAS,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACxB,CAAC;QACH,CAAC;QAED,yCAAyC;QACzC,yDAAyD;QACzD,OAAO,MAAM,CAAC,KAAK,CAAA;QACnB,wDAAwD;QACxD,MAAM,CAAC,IAAI,GAAG,IAAI,CAAA;QAClB,yDAAyD;QACzD,MAAM,CAAC,KAAK,GAAG,KAAK,CAAA;IACtB,CAAC;CACF"}

package/dist/src/routing-table/refresh.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"refresh.d.ts","sourceRoot":"","sources":["../../../src/routing-table/refresh.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAC9C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAA;AAC3D,OAAO,KAAK,EAAE,eAAe,EAAU,MAAM,EAAE,MAAM,mBAAmB,CAAA;AAOxE,MAAM,WAAW,6BAA6B;IAC5C,MAAM,EAAE,eAAe,CAAA;CACxB;AAED,MAAM,WAAW,uBAAuB;IACtC,WAAW,EAAE,WAAW,CAAA;IACxB,YAAY,EAAE,YAAY,CAAA;IAC1B,SAAS,EAAE,MAAM,CAAA;IACjB,eAAe,CAAC,EAAE,MAAM,CAAA;IACxB,mBAAmB,CAAC,EAAE,MAAM,CAAA;CAC7B;AAED;;;GAGG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAC5B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAa;IACzC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAc;IAC3C,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAQ;IACxC,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAQ;IAC5C,OAAO,CAAC,QAAQ,CAAC,6BAA6B,CAAQ;IACtD,OAAO,CAAC,gBAAgB,CAAC,CAA+B;gBAE3C,UAAU,EAAE,6BAA6B,EAAE,IAAI,EAAE,uBAAuB;IAY/E,UAAU,IAAK,OAAO,CAAC,IAAI,CAAC;IAK5B,IAAI,IAAK,OAAO,CAAC,IAAI,CAAC;IAM5B;;;;;OAKG;IACH,YAAY,CAAE,KAAK,GAAE,OAAe,GAAG,IAAI;IAyDrC,0BAA0B,CAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAiBhG,wCAAwC,CAAE,eAAe,EAAE,MAAM,GAAG,IAAI,EAAE;IAepE,qBAAqB,CAAE,wBAAwB,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAazE,WAAW,CAAE,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,EAAE,wBAAwB,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;IA8BvH;;;OAGG;IACH,gBAAgB,IAAK,MAAM;IAc3B;;OAEG;IACH,eAAe,CAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAY9C;;OAEG;IACD,cAAc,IAAK,SAAS,CAAC,MAAM,CAAC;CAoBvC"}
+{"version":3,"file":"refresh.d.ts","sourceRoot":"","sources":["../../../src/routing-table/refresh.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAC9C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAA;AAC3D,OAAO,KAAK,EAAE,eAAe,EAAU,MAAM,EAAE,MAAM,mBAAmB,CAAA;AAOxE,MAAM,WAAW,6BAA6B;IAC5C,MAAM,EAAE,eAAe,CAAA;CACxB;AAED,MAAM,WAAW,uBAAuB;IACtC,WAAW,EAAE,WAAW,CAAA;IACxB,YAAY,EAAE,YAAY,CAAA;IAC1B,SAAS,EAAE,MAAM,CAAA;IACjB,eAAe,CAAC,EAAE,MAAM,CAAA;IACxB,mBAAmB,CAAC,EAAE,MAAM,CAAA;CAC7B;AAED;;;GAGG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAQ;IAC5B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAa;IACzC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAc;IAC3C,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAQ;IACxC,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAQ;IAC5C,OAAO,CAAC,QAAQ,CAAC,6BAA6B,CAAQ;IACtD,OAAO,CAAC,gBAAgB,CAAC,CAA+B;gBAE3C,UAAU,EAAE,6BAA6B,EAAE,IAAI,EAAE,uBAAuB;IAY/E,UAAU,IAAK,OAAO,CAAC,IAAI,CAAC;IAK5B,IAAI,IAAK,OAAO,CAAC,IAAI,CAAC;IAM5B;;;;;OAKG;IACH,YAAY,CAAE,KAAK,GAAE,OAAe,GAAG,IAAI;IAyDrC,0BAA0B,CAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAsBhG,wCAAwC,CAAE,eAAe,EAAE,MAAM,GAAG,IAAI,EAAE;IAepE,qBAAqB,CAAE,wBAAwB,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAazE,WAAW,CAAE,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,EAAE,wBAAwB,EAAE,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC;IA8BvH;;;OAGG;IACH,gBAAgB,IAAK,MAAM;IAc3B;;OAEG;IACH,eAAe,CAAE,YAAY,EAAE,MAAM,GAAG,MAAM;IAY9C;;OAEG;IACD,cAAc,IAAK,SAAS,CAAC,MAAM,CAAC;CAoBvC"}