@peerbit/stream 1.0.20 → 2.0.2

package/lib/esm/routes.js

@@ -1,227 +1,249 @@
-import Graphs from "graphology";
-import { dijkstra, unweighted } from "graphology-shortest-path";
-import { logger } from "./logger.js";
+export const MAX_ROUTE_DISTANCE = Number.MAX_SAFE_INTEGER;
 export class Routes {
-    graph;
-    peerId;
-    constructor(peerId) {
-        this.peerId = peerId;
-        this.graph = new Graphs.UndirectedGraph();
+    me;
+    // END receiver -> Neighbour
+    routes = new Map();
+    pendingRoutes = new Map();
+    latestSession;
+    constructor(me) {
+        this.me = me;
+        this.latestSession = 0;
     }
-    get linksCount() {
-        return this.graph.edges().length;
-    }
-    get nodeCount() {
-        return this.graph.nodes().length;
+    clear() {
+        this.routes.clear();
+        this.pendingRoutes.clear();
     }
-    /**
-     *
-     * @param from
-     * @param to
-     * @returns new nodes
-     */
-    addLink(from, to, weight, origin = this.peerId) {
-        const linkExisted = this.hasLink(from, to);
-        const newReachableNodesFromOrigin = [];
-        if (!linkExisted) {
-            const currentTime = +new Date();
-            const fromWasReachable = origin == from ||
-                this.getPath(origin, from, { unweighted: true }).length;
-            const toWasReachable = origin === to || this.getPath(origin, to, { unweighted: true }).length;
-            const fromIsNowReachable = toWasReachable;
-            const toIsNowReachable = fromWasReachable;
-            const visited = new Set();
-            const newReachableNodes = [];
-            if (fromIsNowReachable) {
-                newReachableNodes.push(from);
+    add(from, neighbour, target, distance, session) {
+        let fromMap = this.routes.get(from);
+        if (!fromMap) {
+            fromMap = new Map();
+            this.routes.set(from, fromMap);
+        }
+        let prev = fromMap.get(target) || {
+            session: session ?? +new Date(),
+            list: []
+        };
+        this.latestSession = Math.max(this.latestSession, session);
+        if (session != null) {
+            // this condition means that when we add new routes in a session that is newer
+            if (prev.session < session) {
+                prev = { session, list: [] }; // reset route info how to reach this target
             }
-            if (toIsNowReachable) {
-                newReachableNodes.push(to);
+            else if (prev.session > session) {
+                return; // new routing information superseedes this
             }
-            if (fromWasReachable) {
-                visited.add(from);
+        }
+        if (from === this.me && neighbour === target) {
+            // force distance to neighbour as targets to always favor directly sending to them
+            // i.e. if target is our neighbour, always assume the shortest path to them is the direct path
+            distance = -1;
+        }
+        for (const route of prev.list) {
+            if (route.hash === neighbour) {
+                route.distance = Math.min(route.distance, distance);
+                prev.list.sort((a, b) => a.distance - b.distance);
+                return;
             }
-            if (toWasReachable) {
-                visited.add(to);
+        }
+        prev.list.push({ distance, hash: neighbour });
+        prev.list.sort((a, b) => a.distance - b.distance);
+        fromMap.set(target, prev);
+    }
+    removeTarget(target) {
+        this.routes.delete(target);
+        for (const [fromMapKey, fromMap] of this.routes) {
+            // delete target
+            fromMap.delete(target);
+            if (fromMap.size === 0) {
+                this.routes.delete(fromMapKey);
             }
-            if (!this.graph.hasNode(from)) {
-                this.graph.addNode(from);
+        }
+        return [target];
+    }
+    removeNeighbour(target) {
+        this.routes.delete(target);
+        const maybeUnreachable = new Set([target]);
+        for (const [fromMapKey, fromMap] of this.routes) {
+            // delete target
+            fromMap.delete(target);
+            // delete this as neighbour
+            for (const [remote, neighbours] of fromMap) {
+                neighbours.list = neighbours.list.filter((x) => x.hash !== target);
+                if (neighbours.list.length === 0) {
+                    fromMap.delete(remote);
+                    maybeUnreachable.add(remote);
+                }
             }
-            if (!this.graph.hasNode(to)) {
-                this.graph.addNode(to);
+            if (fromMap.size === 0) {
+                this.routes.delete(fromMapKey);
             }
-            this.graph.addUndirectedEdge(from, to, { weight, time: currentTime });
-            for (const newReachableNode of newReachableNodes) {
-                // get all nodes from this and add them to the new reachable set of nodes one can access from origin
-                const stack = [newReachableNode]; // iterate from the not reachable node
-                while (stack.length > 0) {
-                    const node = stack.shift();
-                    if (!node) {
-                        continue;
-                    }
-                    if (visited.has(node)) {
-                        continue;
-                    }
-                    visited.add(node);
-                    const neighbors = this.graph.neighbors(node);
-                    for (const neighbor of neighbors) {
-                        const edge = this.graph.undirectedEdge(node, neighbor);
-                        if (!edge) {
-                            logger.warn(`Missing edge between: ${node} - ${neighbor}`);
-                            continue;
-                        }
-                        const attributes = this.graph.getEdgeAttributes(edge);
-                        if (attributes.time > currentTime) {
-                            continue; // a new link has been added while we are iterating, dont follow this path
-                        }
-                        if (visited.has(neighbor)) {
-                            continue;
-                        }
-                        stack.push(neighbor);
-                    }
-                    newReachableNodesFromOrigin.push(node);
-                }
+        }
+        return [...maybeUnreachable].filter((x) => !this.isReachable(this.me, x));
+    }
+    findNeighbor(from, target) {
+        return this.routes.get(from)?.get(target);
+    }
+    isReachable(from, target) {
+        return ((this.routes.get(from)?.get(target)?.list[0]?.distance ??
+            Number.MAX_SAFE_INTEGER) < MAX_ROUTE_DISTANCE);
+    }
+    hasShortestPath(target) {
+        const path = this.routes.get(this.me)?.get(target);
+        if (!path) {
+            return false;
+        }
+        return path.list[0].distance <= 0;
+    }
+    hasTarget(target) {
+        for (const [k, v] of this.routes) {
+            if (v.has(target)) {
+                return true;
             }
         }
-        else {
-            // update weight
-            const edge = this.graph.undirectedEdge(from, to);
-            this.graph.setEdgeAttribute(edge, "weight", weight);
-            this.graph.setEdgeAttribute(edge, "time", +new Date());
+        return false;
+    }
+    getDependent(target) {
+        const dependent = [];
+        for (const [fromMapKey, fromMap] of this.routes) {
+            if (fromMapKey !== this.me && fromMap.has(target)) {
+                dependent.push(fromMapKey);
+            }
         }
-        return newReachableNodesFromOrigin;
+        return dependent;
     }
-    /**
-     *
-     * @param from
-     * @param to
-     * @param origin
-     * @returns nodes that are no longer reachable from origin
-     */
-    deleteLink(from, to, origin = this.peerId) {
-        const link = this.getLink(from, to);
-        if (link) {
-            const date = +new Date();
-            const fromWasReachable = origin == from ||
-                this.getPath(origin, from, { unweighted: true }).length;
-            const toWasReachable = origin === to || this.getPath(origin, to, { unweighted: true }).length;
-            this.graph.dropEdge(link);
-            const unreachableNodesFromOrigin = [];
-            if (fromWasReachable &&
-                origin !== from &&
-                this.getPath(origin, from, { unweighted: true }).length === 0) {
-                unreachableNodesFromOrigin.push(from);
+    count(from = this.me) {
+        const set = new Set();
+        const map = this.routes.get(from);
+        if (map) {
+            for (const [k, v] of map) {
+                set.add(k);
+                for (const peer of v.list) {
+                    set.add(peer.hash);
+                }
             }
-            if (toWasReachable &&
-                origin !== to &&
-                this.getPath(origin, to, { unweighted: true }).length === 0) {
-                unreachableNodesFromOrigin.push(to);
+        }
+        return set.size;
+    }
+    countAll() {
+        let size = 0;
+        for (const [from, map] of this.routes) {
+            for (const [k, v] of map) {
+                size += v.list.length;
             }
-            // remove subgraphs that are now disconnected from me
-            for (const disconnected of [...unreachableNodesFromOrigin]) {
-                const node = disconnected;
-                if (!this.graph.hasNode(node)) {
-                    continue;
+        }
+        return size;
+    }
+    // for all tos if
+    getFanout(from, tos, redundancy) {
+        if (tos.length === 0) {
+            return undefined;
+        }
+        let fanoutMap = undefined;
+        const fromKey = from.hashcode();
+        // Message to > 0
+        if (tos.length > 0) {
+            for (const to of tos) {
+                if (to === this.me || fromKey === to) {
+                    continue; // don't send to me or backwards
                 }
-                const stack = [disconnected];
-                const visited = new Set();
-                while (stack.length > 0) {
-                    const node = stack.shift();
-                    const nodeId = node;
-                    if (!nodeId || !this.graph.hasNode(nodeId)) {
-                        continue;
-                    }
-                    if (visited.has(nodeId)) {
-                        continue;
-                    }
-                    visited.add(nodeId);
-                    const neighbors = this.graph.neighbors(node);
-                    for (const neighbor of neighbors) {
-                        const edge = this.graph.undirectedEdge(node, neighbor);
-                        if (!edge) {
-                            logger.warn(`Missing edge between: ${node} - ${neighbor}`);
-                            continue;
+                const neighbour = this.findNeighbor(fromKey, to);
+                if (neighbour) {
+                    let foundClosest = false;
+                    for (let i = 0; i < Math.min(neighbour.list.length, redundancy); i++) {
+                        const distance = neighbour.list[i].distance;
+                        if (distance >= redundancy) {
+                            break; // because neighbour listis sorted
                         }
-                        const attributes = this.graph.getEdgeAttributes(edge);
-                        if (attributes.time > date) {
-                            continue; // don't follow path because this is a new link that might provide some new connectivity
+                        if (distance <= 0) {
+                            foundClosest = true;
                         }
-                        if (visited.has(neighbor)) {
-                            continue;
+                        const fanout = (fanoutMap || (fanoutMap = new Map())).get(neighbour.list[i].hash);
+                        if (!fanout) {
+                            fanoutMap.set(neighbour.list[i].hash, [
+                                { to, timestamp: neighbour.session }
+                            ]);
+                        }
+                        else {
+                            fanout.push({ to, timestamp: neighbour.session });
                         }
-                        stack.push(neighbor);
                     }
-                    this.graph.dropNode(nodeId);
-                    if (disconnected !== nodeId) {
-                        unreachableNodesFromOrigin.push(nodeId.toString());
+                    if (!foundClosest && from.hashcode() === this.me) {
+                        return undefined; // we dont have the shortest path to our target (yet). Send to all
                     }
+                    continue;
                 }
+                // we can't find path, send message to all peers
+                return undefined;
             }
-            return unreachableNodesFromOrigin;
+        }
+        return fanoutMap || (fanoutMap = new Map());
+    }
+    /**
+     * Returns a list of a prunable nodes that are not needed to reach all remote nodes
+     */
+    getPrunable(neighbours) {
+        const map = this.routes.get(this.me);
+        if (map) {
+            // check if all targets can be reached without it
+            return neighbours.filter((candidate) => {
+                for (const [target, neighbours] of map) {
+                    if (target !== candidate &&
+                        neighbours.list.length === 1 &&
+                        neighbours.list[0].hash === candidate) {
+                        return false;
+                    }
+                }
+                return true;
+            });
         }
         return [];
     }
-    getLink(from, to) {
-        if (!this.graph.hasNode(from) || !this.graph.hasNode(to)) {
-            return undefined;
+    addPendingRouteConnection(session, route) {
+        let map = this.pendingRoutes.get(session);
+        if (!map) {
+            map = new Map();
+            this.pendingRoutes.set(session, map);
         }
-        const edges = this.graph.edges(from, to);
-        if (edges.length > 1) {
-            throw new Error("Unexpected edge count: " + edges.length);
-        }
-        if (edges.length > 0) {
-            return edges[0];
-        }
-        return undefined;
-    }
-    getLinkData(from, to) {
-        const edgeId = this.getLink(from, to);
-        if (edgeId)
-            return this.graph.getEdgeAttributes(edgeId);
-        return undefined;
-    }
-    hasLink(from, to) {
-        return this.graph.hasEdge(from, to);
-    }
-    hasNode(node) {
-        return this.graph.hasNode(node);
-    }
-    getPath(from, to, options) {
-        try {
-            let getEdgeWeight = (edge) => this.graph.getEdgeAttribute(edge, "weight");
-            const blockId = options?.block;
-            if (blockId) {
-                const neighBourEdges = new Set(this.graph
-                    .inboundNeighbors(blockId)
-                    .map((x) => this.graph.edges(x, blockId))
-                    .flat());
-                getEdgeWeight = (edge) => {
-                    if (neighBourEdges.has(edge)) {
-                        return Number.MAX_SAFE_INTEGER;
-                    }
-                    return this.graph.getEdgeAttribute(edge, "weight");
-                };
+        let arr = map.get(route.target);
+        if (!arr) {
+            arr = [];
+            map.set(route.target, arr);
+        }
+        arr.push(route);
+        const neighbour = this.findNeighbor(route.from, route.target);
+        if (!neighbour || neighbour.session === session) {
+            // Commit directly since we dont have any data at all (better have something than nothing)
+            this.commitPendingRouteConnection(session, route.target);
+        }
+    }
+    // always commit if we dont know the peer yet
+    // do pending commits per remote (?)
+    commitPendingRouteConnection(session, target) {
+        const map = this.pendingRoutes.get(session);
+        if (!map) {
+            return;
+        }
+        if (target) {
+            const routes = map.get(target);
+            if (routes) {
+                for (const route of routes) {
+                    this.add(route.from, route.neighbour, target, route.distance, session);
+                }
+                map.delete(target);
+                return;
             }
-            // TODO catching for network changes and resuse last result
-            const path = (options?.unweighted
-                ? unweighted.bidirectional(this.graph, from, to)
-                : dijkstra.bidirectional(this.graph, from, to, getEdgeWeight)) || [];
-            if (path?.length > 0 && path[0] !== from) {
-                path.reverse();
+            else {
+                return;
             }
-            if (blockId) {
-                if (path.includes(blockId)) {
-                    return []; // Path does not exist, as we go through a blocked node with inifite weight
+        }
+        else {
+            for (const [target, routes] of map) {
+                for (const route of routes) {
+                    this.add(route.from, route.neighbour, target, route.distance, session);
                 }
             }
-            return path; // TODO fix types
         }
-        catch (error) {
-            return [];
-        }
-    }
-    clear() {
-        this.graph.clear();
+        this.pendingRoutes.delete(session);
     }
 }
 //# sourceMappingURL=routes.js.map

package/lib/esm/routes.js.map

@@ -1 +1 @@
-{"version":3,"file":"routes.js","sourceRoot":"","sources":["../../src/routes.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,YAAY,CAAC;AAEhC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAChE,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAOrC,MAAM,OAAO,MAAM;IAClB,KAAK,CAAsC;IACnC,MAAM,CAAS;IACvB,YAAY,MAAc;QACzB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,IAAK,MAAc,CAAC,eAAe,EAAE,CAAC;IACpD,CAAC;IAED,IAAI,UAAU;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC;IAClC,CAAC;IAED,IAAI,SAAS;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC;IAClC,CAAC;IAED;;;;;OAKG;IACH,OAAO,CACN,IAAY,EACZ,EAAU,EACV,MAAc,EACd,SAAiB,IAAI,CAAC,MAAM;QAE5B,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC3C,MAAM,2BAA2B,GAAa,EAAE,CAAC;QACjD,IAAI,CAAC,WAAW,EAAE;YACjB,MAAM,WAAW,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAChC,MAAM,gBAAgB,GACrB,MAAM,IAAI,IAAI;gBACd,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;YACzD,MAAM,cAAc,GACnB,MAAM,KAAK,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;YACxE,MAAM,kBAAkB,GAAG,cAAc,CAAC;YAC1C,MAAM,gBAAgB,GAAG,gBAAgB,CAAC;YAE1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;YAC3C,MAAM,iBAAiB,GAAa,EAAE,CAAC;YACvC,IAAI,kBAAkB,EAAE;gBACvB,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC7B;YACD,IAAI,gBAAgB,EAAE;gBACrB,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aAC3B;YACD,IAAI,gBAAgB,EAAE;gBACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;aAClB;YACD,IAAI,cAAc,EAAE;gBACnB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aAChB;YAED,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;aACzB;YACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;gBAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;aACvB;YAED,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,CAAC,CAAC;YAEtE,KAAK,MAAM,gBAAgB,IAAI,iBAAiB,EAAE;gBACjD,oGAAoG;gBAEpG,MAAM,KAAK,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC,sCAAsC;gBACxE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;oBACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC3B,IAAI,CAAC,IAAI,EAAE;wBACV,SAAS;qBACT;oBACD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;wBACtB,SAAS;qBACT;oBAED,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAClB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;oBAC7C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;wBACjC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;wBACvD,IAAI,CAAC,IAAI,EAAE;4BACV,MAAM,CAAC,IAAI,CAAC,yBAAyB,IAAI,MAAM,QAAQ,EAAE,CAAC,CAAC;4BAC3D,SAAS;yBACT;wBAED,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBACtD,IAAI,UAAU,CAAC,IAAI,GAAG,WAAW,EAAE;4BAClC,SAAS,CAAC,0EAA0E;yBACpF;wBAED,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;4BAC1B,SAAS;yBACT;wBAED,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;qBACrB;oBACD,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;iBACvC;aACD;SACD;aAAM;YACN,gBAAgB;YAChB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACjD,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;YACpD,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;SACvD;QAED,OAAO,2BAA2B,CAAC;IACpC,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,IAAY,EAAE,EAAU,EAAE,SAAiB,IAAI,CAAC,MAAM;QAChE,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACpC,IAAI,IAAI,EAAE;YACT,MAAM,IAAI,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,gBAAgB,GACrB,MAAM,IAAI,IAAI;gBACd,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;YACzD,MAAM,cAAc,GACnB,MAAM,KAAK,EAAE,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;YACxE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAE1B,MAAM,0BAA0B,GAAa,EAAE,CAAC;YAChD,IACC,gBAAgB;gBAChB,MAAM,KAAK,IAAI;gBACf,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,EAC5D;gBACD,0BAA0B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACtC;YACD,IACC,cAAc;gBACd,MAAM,KAAK,EAAE;gBACb,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,CAAC,EAC1D;gBACD,0BAA0B,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACpC;YAED,qDAAqD;YACrD,KAAK,MAAM,YAAY,IAAI,CAAC,GAAG,0BAA0B,CAAC,EAAE;gBAC3D,MAAM,IAAI,GAAG,YAAY,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;oBAC9B,SAAS;iBACT;gBAED,MAAM,KAAK,GAAG,CAAC,YAAY,CAAC,CAAC;gBAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;gBAC3C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;oBACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;oBAC3B,MAAM,MAAM,GAAG,IAAI,CAAC;oBACpB,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;wBAC3C,SAAS;qBACT;oBACD,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;wBACxB,SAAS;qBACT;oBAED,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;oBAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;oBAE7C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE;wBACjC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;wBACvD,IAAI,CAAC,IAAI,EAAE;4BACV,MAAM,CAAC,IAAI,CAAC,yBAAyB,IAAI,MAAM,QAAQ,EAAE,CAAC,CAAC;4BAC3D,SAAS;yBACT;wBACD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;wBACtD,IAAI,UAAU,CAAC,IAAI,GAAG,IAAI,EAAE;4BAC3B,SAAS,CAAC,wFAAwF;yBAClG;wBAED,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;4BAC1B,SAAS;yBACT;wBAED,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;qBACrB;oBACD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;oBAC5B,IAAI,YAAY,KAAK,MAAM,EAAE;wBAC5B,0BAA0B,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC;qBACnD;iBACD;aACD;YACD,OAAO,0BAA0B,CAAC;SAClC;QACD,OAAO,EAAE,CAAC;IACX,CAAC;IAED,OAAO,CAAC,IAAY,EAAE,EAAU;QAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;YACzD,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACzC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,MAAM,IAAI,KAAK,CAAC,yBAAyB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;SAC1D;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;SAChB;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,WAAW,CAAC,IAAY,EAAE,EAAU;QACnC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACtC,IAAI,MAAM;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACxD,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,OAAO,CAAC,IAAY,EAAE,EAAU;QAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,CAAC,IAAY;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,OAAO,CACN,IAAY,EACZ,EAAU,EACV,OAAuD;QAEvD,IAAI;YACH,IAAI,aAAa,GAEwB,CAAC,IAAI,EAAE,EAAE,CACjD,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC7C,MAAM,OAAO,GAAI,OAA8B,EAAE,KAAK,CAAC;YACvD,IAAI,OAAO,EAAE;gBACZ,MAAM,cAAc,GAAG,IAAI,GAAG,CAC7B,IAAI,CAAC,KAAK;qBACR,gBAAgB,CAAC,OAAO,CAAC;qBACzB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;qBACxC,IAAI,EAAE,CACR,CAAC;gBACF,aAAa,GAAG,CAAC,IAAI,EAAE,EAAE;oBACxB,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;wBAC7B,OAAO,MAAM,CAAC,gBAAgB,CAAC;qBAC/B;oBACD,OAAO,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;gBACpD,CAAC,CAAC;aACF;YAED,2DAA2D;YAC3D,MAAM,IAAI,GACT,CAAE,OAAoC,EAAE,UAAU;gBACjD,CAAC,CAAC,UAAU,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC;gBAChD,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,aAAa,CAAC,CAAC,IAAI,EAAE,CAAC;YACvE,IAAI,IAAI,EAAE,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;gBACzC,IAAI,CAAC,OAAO,EAAE,CAAC;aACf;YAED,IAAI,OAAO,EAAE;gBACZ,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE;oBAC3B,OAAO,EAAE,CAAC,CAAC,2EAA2E;iBACtF;aACD;YAED,OAAO,IAAW,CAAC,CAAC,iBAAiB;SACrC;QAAC,OAAO,KAAK,EAAE;YACf,OAAO,EAAE,CAAC;SACV;IACF,CAAC;IACD,KAAK;QACJ,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;CACD"}
+{"version":3,"file":"routes.js","sourceRoot":"","sources":["../../src/routes.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,kBAAkB,GAAG,MAAM,CAAC,gBAAgB,CAAC;AAC1D,MAAM,OAAO,MAAM;IAqBG;IApBrB,4BAA4B;IAE5B,MAAM,GAGF,IAAI,GAAG,EAAE,CAAC;IAEd,aAAa,GAUT,IAAI,GAAG,EAAE,CAAC;IACd,aAAa,CAAS;IAEtB,YAAqB,EAAU;QAAV,OAAE,GAAF,EAAE,CAAQ;QAC9B,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;IACxB,CAAC;IAED,KAAK;QACJ,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;IAC5B,CAAC;IAED,GAAG,CACF,IAAY,EACZ,SAAiB,EACjB,MAAc,EACd,QAAgB,EAChB,OAAe;QAEf,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,OAAO,EAAE,CAAC;YACd,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI;YACjC,OAAO,EAAE,OAAO,IAAI,CAAC,IAAI,IAAI,EAAE;YAC/B,IAAI,EAAE,EAA0C;SAChD,CAAC;QAEF,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;QAE3D,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;YACrB,8EAA8E;YAC9E,IAAI,IAAI,CAAC,OAAO,GAAG,OAAO,EAAE,CAAC;gBAC5B,IAAI,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,4CAA4C;YAC3E,CAAC;iBAAM,IAAI,IAAI,CAAC,OAAO,GAAG,OAAO,EAAE,CAAC;gBACnC,OAAO,CAAC,2CAA2C;YACpD,CAAC;QACF,CAAC;QAED,IAAI,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAC9C,kFAAkF;YAClF,8FAA8F;YAC9F,QAAQ,GAAG,CAAC,CAAC,CAAC;QACf,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC/B,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBAC9B,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBACpD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;gBAClD,OAAO;YACR,CAAC;QACF,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAClD,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED,YAAY,CAAC,MAAc;QAC1B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjD,gBAAgB;YAChB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACvB,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAChC,CAAC;QACF,CAAC;QACD,OAAO,CAAC,MAAM,CAAC,CAAC;IACjB,CAAC;IAED,eAAe,CAAC,MAAc;QAC7B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,MAAM,gBAAgB,GAAgB,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjD,gBAAgB;YAChB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAEvB,2BAA2B;YAC3B,KAAK,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,OAAO,EAAE,CAAC;gBAC5C,UAAU,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;gBACnE,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAClC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACvB,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC9B,CAAC;YACF,CAAC;YAED,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAChC,CAAC;QACF,CAAC;QACD,OAAO,CAAC,GAAG,gBAAgB,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3E,CAAC;IAED,YAAY,CAAC,IAAY,EAAE,MAAc;QACxC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED,WAAW,CAAC,IAAY,EAAE,MAAc;QACvC,OAAO,CACN,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ;YACrD,MAAM,CAAC,gBAAgB,CAAC,GAAG,kBAAkB,CAC9C,CAAC;IACH,CAAC;IAED,eAAe,CAAC,MAAc;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,IAAI,EAAE,CAAC;YACX,OAAO,KAAK,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,SAAS,CAAC,MAAc;QACvB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAClC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnB,OAAO,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED,YAAY,CAAC,MAAc;QAC1B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjD,IAAI,UAAU,KAAK,IAAI,CAAC,EAAE,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnD,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC5B,CAAC;QACF,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;QACnB,MAAM,GAAG,GAAgB,IAAI,GAAG,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,GAAG,EAAE,CAAC;YACT,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;gBAC1B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACX,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;oBAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,CAAC;YACF,CAAC;QACF,CAAC;QACD,OAAO,GAAG,CAAC,IAAI,CAAC;IACjB,CAAC;IAED,QAAQ;QACP,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;gBAC1B,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YACvB,CAAC;QACF,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,iBAAiB;IACjB,SAAS,CACR,IAAmB,EACnB,GAAa,EACb,UAAkB;QAElB,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,SAAS,CAAC;QAClB,CAAC;QAED,IAAI,SAAS,GAEE,SAAS,CAAC;QAEzB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAEhC,iBAAiB;QACjB,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACpB,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;gBACtB,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,IAAI,OAAO,KAAK,EAAE,EAAE,CAAC;oBACtC,SAAS,CAAC,gCAAgC;gBAC3C,CAAC;gBAED,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;gBACjD,IAAI,SAAS,EAAE,CAAC;oBACf,IAAI,YAAY,GAAG,KAAK,CAAC;oBACzB,KACC,IAAI,CAAC,GAAG,CAAC,EACT,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,EAC/C,CAAC,EAAE,EACF,CAAC;wBACF,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;wBAC5C,IAAI,QAAQ,IAAI,UAAU,EAAE,CAAC;4BAC5B,MAAM,CAAC,kCAAkC;wBAC1C,CAAC;wBACD,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;4BACnB,YAAY,GAAG,IAAI,CAAC;wBACrB,CAAC;wBACD,MAAM,MAAM,GAAwC,CACnD,SAAS,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC,CACpC,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;wBAC9B,IAAI,CAAC,MAAM,EAAE,CAAC;4BACb,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;gCACrC,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,OAAO,EAAE;6BACpC,CAAC,CAAC;wBACJ,CAAC;6BAAM,CAAC;4BACP,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;wBACnD,CAAC;oBACF,CAAC;oBACD,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,QAAQ,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;wBAClD,OAAO,SAAS,CAAC,CAAC,kEAAkE;oBACrF,CAAC;oBAED,SAAS;gBACV,CAAC;gBAED,gDAAgD;gBAChD,OAAO,SAAS,CAAC;YAClB,CAAC;QACF,CAAC;QACD,OAAO,SAAS,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC;IAC7C,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,UAAoB;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,GAAG,EAAE,CAAC;YACT,iDAAiD;YACjD,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE;gBACtC,KAAK,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,GAAG,EAAE,CAAC;oBACxC,IACC,MAAM,KAAK,SAAS;wBACpB,UAAU,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;wBAC5B,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,EACpC,CAAC;wBACF,OAAO,KAAK,CAAC;oBACd,CAAC;gBACF,CAAC;gBACD,OAAO,IAAI,CAAC;YACb,CAAC,CAAC,CAAC;QACJ,CAAC;QACD,OAAO,EAAE,CAAC;IACX,CAAC;IAEM,yBAAyB,CAC/B,OAAe,EACf,KAKC;QAED,IAAI,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,GAAG,EAAE,CAAC;YACV,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;YAChB,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,EAAE,CAAC;YACV,GAAG,GAAG,EAAE,CAAC;YACT,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC5B,CAAC;QAED,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEhB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC9D,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,OAAO,KAAK,OAAO,EAAE,CAAC;YACjD,0FAA0F;YAC1F,IAAI,CAAC,4BAA4B,CAAC,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;QAC1D,CAAC;IACF,CAAC;IAED,6CAA6C;IAC7C,oCAAoC;IAE7B,4BAA4B,CAAC,OAAe,EAAE,MAAe;QACnE,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC5C,IAAI,CAAC,GAAG,EAAE,CAAC;YACV,OAAO;QACR,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACZ,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/B,IAAI,MAAM,EAAE,CAAC;gBACZ,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC5B,IAAI,CAAC,GAAG,CACP,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,SAAS,EACf,MAAM,EACN,KAAK,CAAC,QAAQ,EACd,OAAO,CACP,CAAC;gBACH,CAAC;gBACD,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACnB,OAAO;YACR,CAAC;iBAAM,CAAC;gBACP,OAAO;YACR,CAAC;QACF,CAAC;aAAM,CAAC;YACP,KAAK,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;gBACpC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC5B,IAAI,CAAC,GAAG,CACP,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,SAAS,EACf,MAAM,EACN,KAAK,CAAC,QAAQ,EACd,OAAO,CACP,CAAC;gBACH,CAAC;YACF,CAAC;QACF,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;CACD"}

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@peerbit/stream",
-	"version": "1.0.20",
+	"version": "2.0.2",
 	"description": "A building block for direct streaming protocols",
 	"type": "module",
 	"sideEffects": false,
@@ -50,21 +50,17 @@
 		"dao.xyz"
 	],
 	"devDependencies": {
-		"@peerbit/libp2p-test-utils": "1.0.8",
-		"@types/yallist": "^4.0.1",
-		"graphology-types": "^0.24.7"
+		"@peerbit/libp2p-test-utils": "2.0.0",
+		"@types/yallist": "^4.0.1"
 	},
 	"dependencies": {
 		"@dao-xyz/borsh": "^5.1.8",
-		"@peerbit/cache": "1.1.1",
-		"@peerbit/crypto": "1.0.10",
-		"@peerbit/stream-interface": "^1.0.11",
-		"abstract-level": "^1.0.3",
-		"graphology": "0.25.1",
-		"graphology-shortest-path": "2.0.2",
-		"libp2p": "0.46.9",
-		"memory-level": "^1.0.0",
+		"@peerbit/cache": "2.0.0",
+		"@peerbit/crypto": "2.1.0",
+		"@peerbit/stream-interface": "^2.0.1",
+		"abortable-iterator": "^5.0.1",
+		"libp2p": "^1.1.0",
 		"yallist": "^4.0.0"
 	},
-	"gitHead": "1a57e60b02b5ea1c0c743871a92404a0115ed683"
+	"gitHead": "cba5d4b1a6f3343f044c7d3194494c3572710cc8"
 }