@seed-ship/mcp-ui-solid 5.6.0 → 6.0.0

package/dist/node_modules/.pnpm/@antv_graphlib@2.0.4/node_modules/@antv/graphlib/esm/graph.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.cjs","sources":["../../../../../../../../../node_modules/.pnpm/@antv+graphlib@2.0.4/node_modules/@antv/graphlib/esm/graph.js"],"sourcesContent":["import EventEmitter from '@antv/event-emitter';\nimport { GraphView } from './graphView';\nimport { doBFS, doDFS } from './utils/traverse';\nexport class Graph extends EventEmitter {\n    nodeMap = new Map();\n    edgeMap = new Map();\n    inEdgesMap = new Map();\n    outEdgesMap = new Map();\n    bothEdgesMap = new Map();\n    treeIndices = new Map();\n    changes = [];\n    batchCount = 0;\n    /**\n     * This function is called with a {@link GraphChangedEvent} each time a graph change happened.\n     *\n     * `event.changes` contains all the graph changes in order since last `onChanged`.\n     */\n    onChanged = () => {\n        // Do nothing.\n    };\n    /**\n     * Create a new Graph instance.\n     * @param options - The options to initialize a graph. See {@link GraphOptions}.\n     *\n     * ```ts\n     * const graph = new Graph({\n     *   // Optional, initial nodes.\n     *   nodes: [\n     *     // Each node has a unique ID.\n     *     { id: 'A', foo: 1 },\n     *     { id: 'B', foo: 1 },\n     *   ],\n     *   // Optional, initial edges.\n     *   edges: [\n     *     { id: 'C', source: 'B', target: 'B', weight: 1 },\n     *   ],\n     *   // Optional, called with a GraphChangedEvent.\n     *   onChanged: (event) => {\n     *     console.log(event);\n     *   }\n     * });\n     * ```\n     */\n    constructor(options) {\n        super();\n        if (!options)\n            return;\n        if (options.nodes)\n            this.addNodes(options.nodes);\n        if (options.edges)\n            this.addEdges(options.edges);\n        if (options.tree)\n            this.addTree(options.tree);\n        if (options.onChanged)\n            this.onChanged = options.onChanged;\n    }\n    /**\n     * Batch several graph changes into one.\n     *\n     * Make several changes, but dispatch only one ChangedEvent at the end of batch:\n     * ```ts\n     * graph.batch(() => {\n     *   graph.addNodes([]);\n     *   graph.addEdges([]);\n     * });\n     * ```\n     *\n     * Batches can be nested. Only the outermost batch will dispatch a ChangedEvent:\n     * ```ts\n     * graph.batch(() => {\n     *   graph.addNodes([]);\n     *   graph.batch(() => {\n     *     graph.addEdges([]);\n     *   });\n     * });\n     * ```\n     */\n    batch = (fn) => {\n        this.batchCount += 1;\n        fn();\n        this.batchCount -= 1;\n        if (!this.batchCount) {\n            this.commit();\n        }\n    };\n    /**\n     * Reset changes and dispatch a ChangedEvent.\n     */\n    commit() {\n        const changes = this.changes;\n        this.changes = [];\n        const event = {\n            graph: this,\n            changes,\n        };\n        this.emit('changed', event);\n        this.onChanged(event);\n    }\n    /**\n     * Reduce the number of ordered graph changes by dropping or merging unnecessary changes.\n     *\n     * For example, if we update a node and remove it in a batch:\n     *\n     * ```ts\n     * graph.batch(() => {\n     *   graph.updateNodeData('A', 'foo', 2);\n     *   graph.removeNode('A');\n     * });\n     * ```\n     *\n     * We get 2 atomic graph changes like\n     *\n     * ```ts\n     * [\n     *   { type: 'NodeDataUpdated', id: 'A', propertyName: 'foo', oldValue: 1, newValue: 2 },\n     *   { type: 'NodeRemoved', value: { id: 'A', data: { foo: 2 } },\n     * ]\n     * ```\n     *\n     * Since node 'A' has been removed, we actually have no need to handle with NodeDataUpdated change.\n     *\n     * `reduceChanges()` here helps us remove such changes.\n     */\n    reduceChanges(changes) {\n        let mergedChanges = [];\n        changes.forEach((change) => {\n            switch (change.type) {\n                case 'NodeRemoved': {\n                    // NodeAdded: A added.\n                    // NodeDataUpdated: A changed.\n                    // TreeStructureChanged: A's parent changed.\n                    // NodeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n                    let isNewlyAdded = false;\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'NodeAdded') {\n                            const sameId = pastChange.value.id === change.value.id;\n                            if (sameId) {\n                                isNewlyAdded = true;\n                            }\n                            return !sameId;\n                        }\n                        else if (pastChange.type === 'NodeDataUpdated') {\n                            return pastChange.id !== change.value.id;\n                        }\n                        else if (pastChange.type === 'TreeStructureChanged') {\n                            return pastChange.nodeId !== change.value.id;\n                        }\n                        return true;\n                    });\n                    if (!isNewlyAdded) {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'EdgeRemoved': {\n                    // EdgeAdded: A added.\n                    // EdgeDataUpdated: A changed.\n                    // EdgeDataUpdated: A's source/target changed.\n                    // EdgeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n                    let isNewlyAdded = false;\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'EdgeAdded') {\n                            const sameId = pastChange.value.id === change.value.id;\n                            if (sameId) {\n                                isNewlyAdded = true;\n                            }\n                            return !sameId;\n                        }\n                        else if (pastChange.type === 'EdgeDataUpdated' ||\n                            pastChange.type === 'EdgeUpdated') {\n                            return pastChange.id !== change.value.id;\n                        }\n                        return true;\n                    });\n                    if (!isNewlyAdded) {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'NodeDataUpdated':\n                case 'EdgeDataUpdated':\n                case 'EdgeUpdated': {\n                    // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 1, newValue: 2 }.\n                    // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 2, newValue: 3 }.\n                    // 👆 Could be merged as { id: A, propertyName: 'foo', oldValue: 1, newValue: 3 }.\n                    const index = mergedChanges.findIndex((pastChange) => {\n                        return (pastChange.type === change.type &&\n                            pastChange.id === change.id &&\n                            (change.propertyName === undefined ||\n                                pastChange.propertyName === change.propertyName));\n                    });\n                    const existingChange = mergedChanges[index];\n                    if (existingChange) {\n                        if (change.propertyName !== undefined) {\n                            // The incoming change is of the same property of existing change.\n                            existingChange.newValue = change.newValue;\n                        }\n                        else {\n                            // The incoming change is a whole data override.\n                            mergedChanges.splice(index, 1);\n                            mergedChanges.push(change);\n                        }\n                    }\n                    else {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'TreeStructureDetached': {\n                    // TreeStructureAttached\n                    // TreeStructureChanged\n                    // TreeStructureDetached 👈🏻 Since the tree struct was detached, above 2 changes may be ignored.\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'TreeStructureAttached') {\n                            return pastChange.treeKey !== change.treeKey;\n                        }\n                        else if (pastChange.type === 'TreeStructureChanged') {\n                            return pastChange.treeKey !== change.treeKey;\n                        }\n                        return true;\n                    });\n                    mergedChanges.push(change);\n                    break;\n                }\n                case 'TreeStructureChanged': {\n                    const existingChange = mergedChanges.find((pastChange) => {\n                        return (pastChange.type === 'TreeStructureChanged' &&\n                            pastChange.treeKey === change.treeKey &&\n                            pastChange.nodeId === change.nodeId);\n                    });\n                    if (existingChange) {\n                        existingChange.newParentId =\n                            change.newParentId;\n                    }\n                    else {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                default:\n                    mergedChanges.push(change);\n                    break;\n            }\n        });\n        return mergedChanges;\n    }\n    // ================= Node =================\n    checkNodeExistence(id) {\n        this.getNode(id);\n    }\n    /**\n     * Check if a node exists in the graph.\n     * @group NodeMethods\n     */\n    hasNode(id) {\n        return this.nodeMap.has(id);\n    }\n    /**\n     * Tell if two nodes are neighbors.\n     * @group NodeMethods\n     */\n    areNeighbors(firstNodeId, secondNodeId) {\n        return this.getNeighbors(secondNodeId).some((neighbor) => neighbor.id === firstNodeId);\n    }\n    /**\n     * Get the node data with given ID.\n     * @group NodeMethods\n     */\n    getNode(id) {\n        const node = this.nodeMap.get(id);\n        if (!node) {\n            throw new Error('Node not found for id: ' + id);\n        }\n        return node;\n    }\n    /**\n     * Given a node ID, find all edges of the node.\n     * @param id - ID of the node\n     * @param direction - Edge direction, defaults to 'both'.\n     * @group NodeMethods\n     */\n    getRelatedEdges(id, direction) {\n        this.checkNodeExistence(id);\n        if (direction === 'in') {\n            const inEdges = this.inEdgesMap.get(id);\n            return Array.from(inEdges);\n        }\n        else if (direction === 'out') {\n            const outEdges = this.outEdgesMap.get(id);\n            return Array.from(outEdges);\n        }\n        else {\n            const bothEdges = this.bothEdgesMap.get(id);\n            return Array.from(bothEdges);\n        }\n    }\n    /**\n     * Get the degree of the given node.\n     * @group NodeMethods\n     */\n    getDegree(id, direction) {\n        return this.getRelatedEdges(id, direction).length;\n    }\n    /**\n     * Get all successors of the given node.\n     */\n    getSuccessors(id) {\n        const outEdges = this.getRelatedEdges(id, 'out');\n        const targets = outEdges.map((edge) => this.getNode(edge.target));\n        return Array.from(new Set(targets));\n    }\n    /**\n     * Get all predecessors of the given node.\n     */\n    getPredecessors(id) {\n        const inEdges = this.getRelatedEdges(id, 'in');\n        const sources = inEdges.map((edge) => this.getNode(edge.source));\n        return Array.from(new Set(sources));\n    }\n    /**\n     * Given a node ID, find its neighbors.\n     * @param id - ID of the node\n     * @group NodeMethods\n     */\n    getNeighbors(id) {\n        const predecessors = this.getPredecessors(id);\n        const successors = this.getSuccessors(id);\n        return Array.from(new Set([...predecessors, ...successors]));\n    }\n    doAddNode(node) {\n        if (this.hasNode(node.id)) {\n            throw new Error('Node already exists: ' + node.id);\n        }\n        this.nodeMap.set(node.id, node);\n        this.inEdgesMap.set(node.id, new Set());\n        this.outEdgesMap.set(node.id, new Set());\n        this.bothEdgesMap.set(node.id, new Set());\n        this.treeIndices.forEach((tree) => {\n            tree.childrenMap.set(node.id, new Set());\n        });\n        this.changes.push({ type: 'NodeAdded', value: node });\n    }\n    /**\n     * Add all nodes of the given array, or iterable, into the graph.\n     * @group NodeMethods\n     */\n    addNodes(nodes) {\n        this.batch(() => {\n            for (const node of nodes) {\n                this.doAddNode(node);\n            }\n        });\n    }\n    /**\n     * Add a single node into the graph.\n     * @group NodeMethods\n     */\n    addNode(node) {\n        this.addNodes([node]);\n    }\n    doRemoveNode(id) {\n        const node = this.getNode(id);\n        const bothEdges = this.bothEdgesMap.get(id);\n        bothEdges?.forEach((edge) => this.doRemoveEdge(edge.id));\n        this.nodeMap.delete(id);\n        this.treeIndices.forEach((tree) => {\n            tree.childrenMap.get(id)?.forEach((child) => {\n                tree.parentMap.delete(child.id);\n            });\n            const parent = tree.parentMap.get(id);\n            if (parent)\n                tree.childrenMap.get(parent.id)?.delete(node);\n            tree.parentMap.delete(id);\n            tree.childrenMap.delete(id);\n        });\n        this.bothEdgesMap.delete(id);\n        this.inEdgesMap.delete(id);\n        this.outEdgesMap.delete(id);\n        this.changes.push({ type: 'NodeRemoved', value: node });\n    }\n    /**\n     * Remove nodes and their attached edges from the graph.\n     * @group NodeMethods\n     */\n    removeNodes(idList) {\n        this.batch(() => {\n            idList.forEach((id) => this.doRemoveNode(id));\n        });\n    }\n    /**\n     * Remove a single node and its attached edges from the graph.\n     * @group NodeMethods\n     */\n    removeNode(id) {\n        this.removeNodes([id]);\n    }\n    updateNodeDataProperty(id, propertyName, value) {\n        const node = this.getNode(id);\n        this.batch(() => {\n            const oldValue = node.data[propertyName];\n            const newValue = value;\n            node.data[propertyName] = newValue;\n            this.changes.push({\n                type: 'NodeDataUpdated',\n                id,\n                propertyName,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    /**\n     * Like Object.assign, merge all properties of `path` to the node data.\n     * @param id Node ID.\n     * @param patch A data object to merge.\n     */\n    mergeNodeData(id, patch) {\n        this.batch(() => {\n            Object.entries(patch).forEach(([propertyName, value]) => {\n                this.updateNodeDataProperty(id, propertyName, value);\n            });\n        });\n    }\n    updateNodeData(...args) {\n        const id = args[0];\n        const node = this.getNode(id);\n        if (typeof args[1] === 'string') {\n            // id, propertyName, value\n            this.updateNodeDataProperty(id, args[1], args[2]);\n            return;\n        }\n        let data;\n        if (typeof args[1] === 'function') {\n            // id, update\n            const update = args[1];\n            data = update(node.data);\n        }\n        else if (typeof args[1] === 'object') {\n            // id, data\n            data = args[1];\n        }\n        this.batch(() => {\n            const oldValue = node.data;\n            const newValue = data;\n            node.data = data;\n            this.changes.push({\n                type: 'NodeDataUpdated',\n                id,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    // ================= Edge =================\n    checkEdgeExistence(id) {\n        if (!this.hasEdge(id)) {\n            throw new Error('Edge not found for id: ' + id);\n        }\n    }\n    /**\n     * Check if an edge exists in the graph.\n     * @group NodeMethods\n     */\n    hasEdge(id) {\n        return this.edgeMap.has(id);\n    }\n    /**\n     * Get the edge data with given ID.\n     * @group EdgeMethods\n     */\n    getEdge(id) {\n        this.checkEdgeExistence(id);\n        return this.edgeMap.get(id);\n    }\n    /**\n     * Get the edge, the source node, and the target node by an edge ID.\n     * @group EdgeMethods\n     */\n    getEdgeDetail(id) {\n        const edge = this.getEdge(id);\n        return {\n            edge,\n            source: this.getNode(edge.source),\n            target: this.getNode(edge.target),\n        };\n    }\n    doAddEdge(edge) {\n        if (this.hasEdge(edge.id)) {\n            throw new Error('Edge already exists: ' + edge.id);\n        }\n        this.checkNodeExistence(edge.source);\n        this.checkNodeExistence(edge.target);\n        this.edgeMap.set(edge.id, edge);\n        const inEdges = this.inEdgesMap.get(edge.target);\n        const outEdges = this.outEdgesMap.get(edge.source);\n        const bothEdgesOfSource = this.bothEdgesMap.get(edge.source);\n        const bothEdgesOfTarget = this.bothEdgesMap.get(edge.target);\n        inEdges.add(edge);\n        outEdges.add(edge);\n        bothEdgesOfSource.add(edge);\n        bothEdgesOfTarget.add(edge);\n        this.changes.push({ type: 'EdgeAdded', value: edge });\n    }\n    /**\n     * Add all edges of the given iterable(an array, a set, etc.) into the graph.\n     * @group EdgeMethods\n     */\n    addEdges(edges) {\n        this.batch(() => {\n            for (const edge of edges) {\n                this.doAddEdge(edge);\n            }\n        });\n    }\n    /**\n     * Add a single edge pointing from `source` to `target` into the graph.\n     *\n     * ```ts\n     * graph.addNode({ id: 'NodeA' });\n     * graph.addNode({ id: 'NodeB' });\n     * graph.addEdge({ id: 'EdgeA', source: 'NodeA', target: 'NodeB' });\n     * ```\n     *\n     * If `source` or `target` were not found in the current graph, it throws an Error.\n     * @group EdgeMethods\n     */\n    addEdge(edge) {\n        this.addEdges([edge]);\n    }\n    doRemoveEdge(id) {\n        const edge = this.getEdge(id);\n        const outEdges = this.outEdgesMap.get(edge.source);\n        const inEdges = this.inEdgesMap.get(edge.target);\n        const bothEdgesOfSource = this.bothEdgesMap.get(edge.source);\n        const bothEdgesOfTarget = this.bothEdgesMap.get(edge.target);\n        outEdges.delete(edge);\n        inEdges.delete(edge);\n        bothEdgesOfSource.delete(edge);\n        bothEdgesOfTarget.delete(edge);\n        this.edgeMap.delete(id);\n        this.changes.push({ type: 'EdgeRemoved', value: edge });\n    }\n    /**\n     * Remove edges whose id was included in the given id list.\n     * @group EdgeMethods\n     */\n    removeEdges(idList) {\n        this.batch(() => {\n            idList.forEach((id) => this.doRemoveEdge(id));\n        });\n    }\n    /**\n     * Remove a single edge of the given id.\n     * @group EdgeMethods\n     */\n    removeEdge(id) {\n        this.removeEdges([id]);\n    }\n    /**\n     * Change the source of an edge. The source must be found in current graph.\n     * @group EdgeMethods\n     */\n    updateEdgeSource(id, source) {\n        const edge = this.getEdge(id);\n        this.checkNodeExistence(source);\n        const oldSource = edge.source;\n        const newSource = source;\n        this.outEdgesMap.get(oldSource).delete(edge);\n        this.bothEdgesMap.get(oldSource).delete(edge);\n        this.outEdgesMap.get(newSource).add(edge);\n        this.bothEdgesMap.get(newSource).add(edge);\n        edge.source = source;\n        this.batch(() => {\n            this.changes.push({\n                type: 'EdgeUpdated',\n                id,\n                propertyName: 'source',\n                oldValue: oldSource,\n                newValue: newSource,\n            });\n        });\n    }\n    /**\n     * Change the target of an edge. The target must be found in current graph.\n     * @group EdgeMethods\n     */\n    updateEdgeTarget(id, target) {\n        const edge = this.getEdge(id);\n        this.checkNodeExistence(target);\n        const oldTarget = edge.target;\n        const newTarget = target;\n        this.inEdgesMap.get(oldTarget).delete(edge);\n        this.bothEdgesMap.get(oldTarget).delete(edge);\n        this.inEdgesMap.get(newTarget).add(edge);\n        this.bothEdgesMap.get(newTarget).add(edge);\n        edge.target = target;\n        this.batch(() => {\n            this.changes.push({\n                type: 'EdgeUpdated',\n                id,\n                propertyName: 'target',\n                oldValue: oldTarget,\n                newValue: newTarget,\n            });\n        });\n    }\n    updateEdgeDataProperty(id, propertyName, value) {\n        const edge = this.getEdge(id);\n        this.batch(() => {\n            const oldValue = edge.data[propertyName];\n            const newValue = value;\n            edge.data[propertyName] = newValue;\n            this.changes.push({\n                type: 'EdgeDataUpdated',\n                id,\n                propertyName,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    updateEdgeData(...args) {\n        const id = args[0];\n        const edge = this.getEdge(id);\n        if (typeof args[1] === 'string') {\n            // id, propertyName, value\n            this.updateEdgeDataProperty(id, args[1], args[2]);\n            return;\n        }\n        let data;\n        if (typeof args[1] === 'function') {\n            // id, update\n            const update = args[1];\n            data = update(edge.data);\n        }\n        else if (typeof args[1] === 'object') {\n            // id, data\n            data = args[1];\n        }\n        this.batch(() => {\n            const oldValue = edge.data;\n            const newValue = data;\n            edge.data = data;\n            this.changes.push({\n                type: 'EdgeDataUpdated',\n                id,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    /**\n     * @group EdgeMethods\n     */\n    mergeEdgeData(id, patch) {\n        this.batch(() => {\n            Object.entries(patch).forEach(([propertyName, value]) => {\n                this.updateEdgeDataProperty(id, propertyName, value);\n            });\n        });\n    }\n    // ================= Tree =================\n    checkTreeExistence(treeKey) {\n        if (!this.hasTreeStructure(treeKey)) {\n            throw new Error('Tree structure not found for treeKey: ' + treeKey);\n        }\n    }\n    hasTreeStructure(treeKey) {\n        return this.treeIndices.has(treeKey);\n    }\n    /**\n     * Attach a new tree structure representing the hierarchy of all nodes in the graph.\n     * @param treeKey A unique key of the tree structure. You can attach multiple tree structures with different keys.\n     *\n     * ```ts\n     * const graph = new Graph({\n     *   nodes: [{ id: 1 }, { id: 2 }, { id: 3 }],\n     * });\n     * graph.attachTreeStructure('Inheritance');\n     * graph.setParent(2, 1, 'Inheritance');\n     * graph.setParent(3, 1, 'Inheritance');\n     * graph.getRoots('Inheritance'); // [1]\n     * graph.getChildren(1, 'Inheritance'); // [2,3]\n     * ```\n     * @group TreeMethods\n     */\n    attachTreeStructure(treeKey) {\n        if (this.treeIndices.has(treeKey)) {\n            // Already attached.\n            return;\n        }\n        this.treeIndices.set(treeKey, {\n            parentMap: new Map(),\n            childrenMap: new Map(),\n        });\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureAttached',\n                treeKey,\n            });\n        });\n    }\n    /**\n     * Detach the tree structure of the given tree key from the graph.\n     *\n     * ```ts\n     * graph.detachTreeStructure('Inheritance');\n     * graph.getRoots('Inheritance'); // Error!\n     * ```\n     * @group TreeMethods\n     */\n    detachTreeStructure(treeKey) {\n        this.checkTreeExistence(treeKey);\n        this.treeIndices.delete(treeKey);\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureDetached',\n                treeKey,\n            });\n        });\n    }\n    /**\n     * Traverse the given tree data, add each node into the graph, then attach the tree structure.\n     *\n     * ```ts\n     * graph.addTree({\n     *   id: 1,\n     *   children: [\n     *     { id: 2 },\n     *     { id: 3 },\n     *   ],\n     * }, 'Inheritance');\n     * graph.getRoots('Inheritance'); // [1]\n     * graph.getChildren(1, 'Inheritance'); // [2, 3]\n     * graph.getAllNodes(); // [1, 2, 3]\n     * graph.getAllEdges(); // []\n     * ```\n     * @group TreeMethods\n     */\n    addTree(tree, treeKey) {\n        this.batch(() => {\n            this.attachTreeStructure(treeKey);\n            // Add Nodes\n            const nodes = [];\n            const stack = Array.isArray(tree) ? tree : [tree];\n            while (stack.length) {\n                const node = stack.shift();\n                nodes.push(node);\n                if (node.children) {\n                    stack.push(...node.children);\n                }\n            }\n            this.addNodes(nodes);\n            // Set parent for each child node.\n            nodes.forEach((parent) => {\n                parent.children?.forEach((child) => {\n                    this.setParent(child.id, parent.id, treeKey);\n                });\n            });\n        });\n    }\n    /**\n     * Get the root nodes of an attached tree structure.\n     *\n     * Consider a graph with the following tree structure attached:\n     * ```\n     * Tree structure:\n     *    O     3\n     *   / \\    |\n     *  1   2   4\n     * ```\n     * `graph.getRoots()` takes all nodes without a parent, therefore [0, 3] was returned.\n     *\n     * Newly added nodes are also unparented. So they are counted as roots.\n     * ```ts\n     * graph.addNode({ id: 5 });\n     * graph.getRoots(); // [0, 3, 5]\n     * ```\n     *\n     * Here is how the tree structure looks like:\n     * ```\n     * Tree structure:\n     *    O     3  5\n     *   / \\    |\n     *  1   2   4\n     * ```\n     *\n     * By setting a parent, a root node no more be a root.\n     * ```ts\n     * graph.setParent(5, 2);\n     * graph.getRoots(); // [0, 3]\n     * ```\n     *\n     * The tree structure now becomes:\n     * ```\n     * Tree structure:\n     *    O     3\n     *   / \\    |\n     *  1   2   4\n     *      |\n     *      5\n     * ```\n     *\n     * Removing a node forces its children to be unparented, or roots.\n     * ```ts\n     * graph.removeNode(0);\n     * graph.getRoots(); // [1, 2, 3]\n     * ```\n     *\n     * You might draw the the structure as follow:\n     * ```\n     * Tree structure:\n     *  1   2  3\n     *      |  |\n     *      5  4\n     * ```\n     * @group TreeMethods\n     */\n    getRoots(treeKey) {\n        this.checkTreeExistence(treeKey);\n        return this.getAllNodes().filter((node) => !this.getParent(node.id, treeKey));\n    }\n    /**\n     * Given a node ID and an optional tree key, get the children of the node in the specified tree structure.\n     * @group TreeMethods\n     */\n    getChildren(id, treeKey) {\n        this.checkNodeExistence(id);\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        const children = tree.childrenMap.get(id);\n        return Array.from(children || []);\n    }\n    /**\n     * Given a node ID and an optional tree key, get the parent of the node in the specified tree structure.\n     * If the given node is one of the tree roots, this returns null.\n     * @group TreeMethods\n     */\n    getParent(id, treeKey) {\n        this.checkNodeExistence(id);\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        return tree.parentMap.get(id) || null;\n    }\n    /**\n     * Returns an array of all the ancestor nodes, staring from the parent to the root.\n     */\n    getAncestors(id, treeKey) {\n        const ancestors = [];\n        let current = this.getNode(id);\n        let parent;\n        // eslint-disable-next-line no-cond-assign\n        while ((parent = this.getParent(current.id, treeKey))) {\n            ancestors.push(parent);\n            current = parent;\n        }\n        return ancestors;\n    }\n    /**\n     * Set node parent. If this operation causes a circle, it fails with an error.\n     * @param id - ID of the child node.\n     * @param parent - ID of the parent node. If it is undefined or null, means unset parent for node with id.\n     * @param treeKey - Which tree structure the relation is applied to.\n     * @group TreeMethods\n     */\n    setParent(id, parent, treeKey) {\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        if (!tree)\n            return;\n        const node = this.getNode(id);\n        const oldParent = tree.parentMap.get(id);\n        // Same parent id as old one, skip\n        if (oldParent?.id === parent)\n            return;\n        // New parent is undefined or null, unset parent for the node\n        if (parent === undefined || parent === null) {\n            if (oldParent) {\n                tree.childrenMap.get(oldParent.id)?.delete(node);\n            }\n            tree.parentMap.delete(id);\n            return;\n        }\n        const newParent = this.getNode(parent);\n        // Set parent\n        tree.parentMap.set(id, newParent);\n        // Set children\n        if (oldParent) {\n            tree.childrenMap.get(oldParent.id)?.delete(node);\n        }\n        let children = tree.childrenMap.get(newParent.id);\n        if (!children) {\n            children = new Set();\n            tree.childrenMap.set(newParent.id, children);\n        }\n        children.add(node);\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureChanged',\n                treeKey,\n                nodeId: id,\n                oldParentId: oldParent?.id,\n                newParentId: newParent.id,\n            });\n        });\n    }\n    dfsTree(id, fn, treeKey) {\n        const navigator = (nodeId) => this.getChildren(nodeId, treeKey);\n        return doDFS(this.getNode(id), new Set(), fn, navigator);\n    }\n    bfsTree(id, fn, treeKey) {\n        const navigator = (nodeId) => this.getChildren(nodeId, treeKey);\n        return doBFS([this.getNode(id)], new Set(), fn, navigator);\n    }\n    // ================= Graph =================\n    /**\n     * Get all nodes in the graph as an array.\n     */\n    getAllNodes() {\n        return Array.from(this.nodeMap.values());\n    }\n    /**\n     * Get all edges in the graph as an array.\n     */\n    getAllEdges() {\n        return Array.from(this.edgeMap.values());\n    }\n    bfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        return doBFS([this.getNode(id)], new Set(), fn, navigator);\n    }\n    dfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        return doDFS(this.getNode(id), new Set(), fn, navigator);\n    }\n    clone() {\n        // Make a shallow copy of nodes and edges.\n        const newNodes = this.getAllNodes().map((oldNode) => {\n            return { ...oldNode, data: { ...oldNode.data } };\n        });\n        const newEdges = this.getAllEdges().map((oldEdge) => {\n            return { ...oldEdge, data: { ...oldEdge.data } };\n        });\n        // Create a new graph with shallow copied nodes and edges.\n        const newGraph = new Graph({\n            nodes: newNodes,\n            edges: newEdges,\n        });\n        // Add tree indices.\n        this.treeIndices.forEach(({ parentMap: oldParentMap, childrenMap: oldChildrenMap }, treeKey) => {\n            const parentMap = new Map();\n            oldParentMap.forEach((parent, key) => {\n                parentMap.set(key, newGraph.getNode(parent.id));\n            });\n            const childrenMap = new Map();\n            oldChildrenMap.forEach((children, key) => {\n                childrenMap.set(key, new Set(Array.from(children).map((n) => newGraph.getNode(n.id))));\n            });\n            newGraph.treeIndices.set(treeKey, {\n                parentMap: parentMap,\n                childrenMap: childrenMap,\n            });\n        });\n        return newGraph;\n    }\n    toJSON() {\n        return JSON.stringify({\n            nodes: this.getAllNodes(),\n            edges: this.getAllEdges(),\n            // FIXME: And tree structures?\n        });\n    }\n    createView(options) {\n        return new GraphView({\n            graph: this,\n            ...options,\n        });\n    }\n}\n//# sourceMappingURL=graph.js.map"],"names":["EventEmitter","index","doDFS","doBFS","GraphView"],"mappings":";;;;;;;;AAGO,MAAM,cAAcA,MAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAwCpC,YAAY,SAAS;AACjB,UAAK;AAxCT,mCAAU,oBAAI,IAAG;AACjB,mCAAU,oBAAI,IAAG;AACjB,sCAAa,oBAAI,IAAG;AACpB,uCAAc,oBAAI,IAAG;AACrB,wCAAe,oBAAI,IAAG;AACtB,uCAAc,oBAAI,IAAG;AACrB,mCAAU,CAAA;AACV,sCAAa;AAMb;AAAA;AAAA;AAAA;AAAA;AAAA,qCAAY,MAAM;AAAA,IAElB;AA0DA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iCAAQ,CAAC,OAAO;AACZ,WAAK,cAAc;AACnB,SAAE;AACF,WAAK,cAAc;AACnB,UAAI,CAAC,KAAK,YAAY;AAClB,aAAK,OAAM;AAAA,MACf;AAAA,IACJ;AAvCI,QAAI,CAAC;AACD;AACJ,QAAI,QAAQ;AACR,WAAK,SAAS,QAAQ,KAAK;AAC/B,QAAI,QAAQ;AACR,WAAK,SAAS,QAAQ,KAAK;AAC/B,QAAI,QAAQ;AACR,WAAK,QAAQ,QAAQ,IAAI;AAC7B,QAAI,QAAQ;AACR,WAAK,YAAY,QAAQ;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA,EAiCA,SAAS;AACL,UAAM,UAAU,KAAK;AACrB,SAAK,UAAU,CAAA;AACf,UAAM,QAAQ;AAAA,MACV,OAAO;AAAA,MACP;AAAA,IACZ;AACQ,SAAK,KAAK,WAAW,KAAK;AAC1B,SAAK,UAAU,KAAK;AAAA,EACxB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA0BA,cAAc,SAAS;AACnB,QAAI,gBAAgB,CAAA;AACpB,YAAQ,QAAQ,CAAC,WAAW;AACxB,cAAQ,OAAO,MAAI;AAAA,QACf,KAAK,eAAe;AAKhB,cAAI,eAAe;AACnB,0BAAgB,cAAc,OAAO,CAAC,eAAe;AACjD,gBAAI,WAAW,SAAS,aAAa;AACjC,oBAAM,SAAS,WAAW,MAAM,OAAO,OAAO,MAAM;AACpD,kBAAI,QAAQ;AACR,+BAAe;AAAA,cACnB;AACA,qBAAO,CAAC;AAAA,YACZ,WACS,WAAW,SAAS,mBAAmB;AAC5C,qBAAO,WAAW,OAAO,OAAO,MAAM;AAAA,YAC1C,WACS,WAAW,SAAS,wBAAwB;AACjD,qBAAO,WAAW,WAAW,OAAO,MAAM;AAAA,YAC9C;AACA,mBAAO;AAAA,UACX,CAAC;AACD,cAAI,CAAC,cAAc;AACf,0BAAc,KAAK,MAAM;AAAA,UAC7B;AACA;AAAA,QACJ;AAAA,QACA,KAAK,eAAe;AAKhB,cAAI,eAAe;AACnB,0BAAgB,cAAc,OAAO,CAAC,eAAe;AACjD,gBAAI,WAAW,SAAS,aAAa;AACjC,oBAAM,SAAS,WAAW,MAAM,OAAO,OAAO,MAAM;AACpD,kBAAI,QAAQ;AACR,+BAAe;AAAA,cACnB;AACA,qBAAO,CAAC;AAAA,YACZ,WACS,WAAW,SAAS,qBACzB,WAAW,SAAS,eAAe;AACnC,qBAAO,WAAW,OAAO,OAAO,MAAM;AAAA,YAC1C;AACA,mBAAO;AAAA,UACX,CAAC;AACD,cAAI,CAAC,cAAc;AACf,0BAAc,KAAK,MAAM;AAAA,UAC7B;AACA;AAAA,QACJ;AAAA,QACA,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK,eAAe;AAIhB,gBAAMC,SAAQ,cAAc,UAAU,CAAC,eAAe;AAClD,mBAAQ,WAAW,SAAS,OAAO,QAC/B,WAAW,OAAO,OAAO,OACxB,OAAO,iBAAiB,UACrB,WAAW,iBAAiB,OAAO;AAAA,UAC/C,CAAC;AACD,gBAAM,iBAAiB,cAAcA,MAAK;AAC1C,cAAI,gBAAgB;AAChB,gBAAI,OAAO,iBAAiB,QAAW;AAEnC,6BAAe,WAAW,OAAO;AAAA,YACrC,OACK;AAED,4BAAc,OAAOA,QAAO,CAAC;AAC7B,4BAAc,KAAK,MAAM;AAAA,YAC7B;AAAA,UACJ,OACK;AACD,0BAAc,KAAK,MAAM;AAAA,UAC7B;AACA;AAAA,QACJ;AAAA,QACA,KAAK,yBAAyB;AAI1B,0BAAgB,cAAc,OAAO,CAAC,eAAe;AACjD,gBAAI,WAAW,SAAS,yBAAyB;AAC7C,qBAAO,WAAW,YAAY,OAAO;AAAA,YACzC,WACS,WAAW,SAAS,wBAAwB;AACjD,qBAAO,WAAW,YAAY,OAAO;AAAA,YACzC;AACA,mBAAO;AAAA,UACX,CAAC;AACD,wBAAc,KAAK,MAAM;AACzB;AAAA,QACJ;AAAA,QACA,KAAK,wBAAwB;AACzB,gBAAM,iBAAiB,cAAc,KAAK,CAAC,eAAe;AACtD,mBAAQ,WAAW,SAAS,0BACxB,WAAW,YAAY,OAAO,WAC9B,WAAW,WAAW,OAAO;AAAA,UACrC,CAAC;AACD,cAAI,gBAAgB;AAChB,2BAAe,cACX,OAAO;AAAA,UACf,OACK;AACD,0BAAc,KAAK,MAAM;AAAA,UAC7B;AACA;AAAA,QACJ;AAAA,QACA;AACI,wBAAc,KAAK,MAAM;AACzB;AAAA,MACpB;AAAA,IACQ,CAAC;AACD,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,mBAAmB,IAAI;AACnB,SAAK,QAAQ,EAAE;AAAA,EACnB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,IAAI;AACR,WAAO,KAAK,QAAQ,IAAI,EAAE;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,aAAa,aAAa,cAAc;AACpC,WAAO,KAAK,aAAa,YAAY,EAAE,KAAK,CAAC,aAAa,SAAS,OAAO,WAAW;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,IAAI;AACR,UAAM,OAAO,KAAK,QAAQ,IAAI,EAAE;AAChC,QAAI,CAAC,MAAM;AACP,YAAM,IAAI,MAAM,4BAA4B,EAAE;AAAA,IAClD;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,gBAAgB,IAAI,WAAW;AAC3B,SAAK,mBAAmB,EAAE;AAC1B,QAAI,cAAc,MAAM;AACpB,YAAM,UAAU,KAAK,WAAW,IAAI,EAAE;AACtC,aAAO,MAAM,KAAK,OAAO;AAAA,IAC7B,WACS,cAAc,OAAO;AAC1B,YAAM,WAAW,KAAK,YAAY,IAAI,EAAE;AACxC,aAAO,MAAM,KAAK,QAAQ;AAAA,IAC9B,OACK;AACD,YAAM,YAAY,KAAK,aAAa,IAAI,EAAE;AAC1C,aAAO,MAAM,KAAK,SAAS;AAAA,IAC/B;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,IAAI,WAAW;AACrB,WAAO,KAAK,gBAAgB,IAAI,SAAS,EAAE;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc,IAAI;AACd,UAAM,WAAW,KAAK,gBAAgB,IAAI,KAAK;AAC/C,UAAM,UAAU,SAAS,IAAI,CAAC,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC;AAChE,WAAO,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAIA,gBAAgB,IAAI;AAChB,UAAM,UAAU,KAAK,gBAAgB,IAAI,IAAI;AAC7C,UAAM,UAAU,QAAQ,IAAI,CAAC,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC;AAC/D,WAAO,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAa,IAAI;AACb,UAAM,eAAe,KAAK,gBAAgB,EAAE;AAC5C,UAAM,aAAa,KAAK,cAAc,EAAE;AACxC,WAAO,MAAM,KAAK,oBAAI,IAAI,CAAC,GAAG,cAAc,GAAG,UAAU,CAAC,CAAC;AAAA,EAC/D;AAAA,EACA,UAAU,MAAM;AACZ,QAAI,KAAK,QAAQ,KAAK,EAAE,GAAG;AACvB,YAAM,IAAI,MAAM,0BAA0B,KAAK,EAAE;AAAA,IACrD;AACA,SAAK,QAAQ,IAAI,KAAK,IAAI,IAAI;AAC9B,SAAK,WAAW,IAAI,KAAK,IAAI,oBAAI,KAAK;AACtC,SAAK,YAAY,IAAI,KAAK,IAAI,oBAAI,KAAK;AACvC,SAAK,aAAa,IAAI,KAAK,IAAI,oBAAI,KAAK;AACxC,SAAK,YAAY,QAAQ,CAAC,SAAS;AAC/B,WAAK,YAAY,IAAI,KAAK,IAAI,oBAAI,KAAK;AAAA,IAC3C,CAAC;AACD,SAAK,QAAQ,KAAK,EAAE,MAAM,aAAa,OAAO,MAAM;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,OAAO;AACZ,SAAK,MAAM,MAAM;AACb,iBAAW,QAAQ,OAAO;AACtB,aAAK,UAAU,IAAI;AAAA,MACvB;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,MAAM;AACV,SAAK,SAAS,CAAC,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,aAAa,IAAI;AACb,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,UAAM,YAAY,KAAK,aAAa,IAAI,EAAE;AAC1C,2CAAW,QAAQ,CAAC,SAAS,KAAK,aAAa,KAAK,EAAE;AACtD,SAAK,QAAQ,OAAO,EAAE;AACtB,SAAK,YAAY,QAAQ,CAAC,SAAS;;AAC/B,iBAAK,YAAY,IAAI,EAAE,MAAvB,mBAA0B,QAAQ,CAAC,UAAU;AACzC,aAAK,UAAU,OAAO,MAAM,EAAE;AAAA,MAClC;AACA,YAAM,SAAS,KAAK,UAAU,IAAI,EAAE;AACpC,UAAI;AACA,mBAAK,YAAY,IAAI,OAAO,EAAE,MAA9B,mBAAiC,OAAO;AAC5C,WAAK,UAAU,OAAO,EAAE;AACxB,WAAK,YAAY,OAAO,EAAE;AAAA,IAC9B,CAAC;AACD,SAAK,aAAa,OAAO,EAAE;AAC3B,SAAK,WAAW,OAAO,EAAE;AACzB,SAAK,YAAY,OAAO,EAAE;AAC1B,SAAK,QAAQ,KAAK,EAAE,MAAM,eAAe,OAAO,MAAM;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,QAAQ;AAChB,SAAK,MAAM,MAAM;AACb,aAAO,QAAQ,CAAC,OAAO,KAAK,aAAa,EAAE,CAAC;AAAA,IAChD,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,IAAI;AACX,SAAK,YAAY,CAAC,EAAE,CAAC;AAAA,EACzB;AAAA,EACA,uBAAuB,IAAI,cAAc,OAAO;AAC5C,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,SAAK,MAAM,MAAM;AACb,YAAM,WAAW,KAAK,KAAK,YAAY;AACvC,YAAM,WAAW;AACjB,WAAK,KAAK,YAAY,IAAI;AAC1B,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAChB,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc,IAAI,OAAO;AACrB,SAAK,MAAM,MAAM;AACb,aAAO,QAAQ,KAAK,EAAE,QAAQ,CAAC,CAAC,cAAc,KAAK,MAAM;AACrD,aAAK,uBAAuB,IAAI,cAAc,KAAK;AAAA,MACvD,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,kBAAkB,MAAM;AACpB,UAAM,KAAK,KAAK,CAAC;AACjB,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,QAAI,OAAO,KAAK,CAAC,MAAM,UAAU;AAE7B,WAAK,uBAAuB,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAChD;AAAA,IACJ;AACA,QAAI;AACJ,QAAI,OAAO,KAAK,CAAC,MAAM,YAAY;AAE/B,YAAM,SAAS,KAAK,CAAC;AACrB,aAAO,OAAO,KAAK,IAAI;AAAA,IAC3B,WACS,OAAO,KAAK,CAAC,MAAM,UAAU;AAElC,aAAO,KAAK,CAAC;AAAA,IACjB;AACA,SAAK,MAAM,MAAM;AACb,YAAM,WAAW,KAAK;AACtB,YAAM,WAAW;AACjB,WAAK,OAAO;AACZ,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,MAChB,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA;AAAA,EAEA,mBAAmB,IAAI;AACnB,QAAI,CAAC,KAAK,QAAQ,EAAE,GAAG;AACnB,YAAM,IAAI,MAAM,4BAA4B,EAAE;AAAA,IAClD;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,IAAI;AACR,WAAO,KAAK,QAAQ,IAAI,EAAE;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQ,IAAI;AACR,SAAK,mBAAmB,EAAE;AAC1B,WAAO,KAAK,QAAQ,IAAI,EAAE;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc,IAAI;AACd,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,WAAO;AAAA,MACH;AAAA,MACA,QAAQ,KAAK,QAAQ,KAAK,MAAM;AAAA,MAChC,QAAQ,KAAK,QAAQ,KAAK,MAAM;AAAA,IAC5C;AAAA,EACI;AAAA,EACA,UAAU,MAAM;AACZ,QAAI,KAAK,QAAQ,KAAK,EAAE,GAAG;AACvB,YAAM,IAAI,MAAM,0BAA0B,KAAK,EAAE;AAAA,IACrD;AACA,SAAK,mBAAmB,KAAK,MAAM;AACnC,SAAK,mBAAmB,KAAK,MAAM;AACnC,SAAK,QAAQ,IAAI,KAAK,IAAI,IAAI;AAC9B,UAAM,UAAU,KAAK,WAAW,IAAI,KAAK,MAAM;AAC/C,UAAM,WAAW,KAAK,YAAY,IAAI,KAAK,MAAM;AACjD,UAAM,oBAAoB,KAAK,aAAa,IAAI,KAAK,MAAM;AAC3D,UAAM,oBAAoB,KAAK,aAAa,IAAI,KAAK,MAAM;AAC3D,YAAQ,IAAI,IAAI;AAChB,aAAS,IAAI,IAAI;AACjB,sBAAkB,IAAI,IAAI;AAC1B,sBAAkB,IAAI,IAAI;AAC1B,SAAK,QAAQ,KAAK,EAAE,MAAM,aAAa,OAAO,MAAM;AAAA,EACxD;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,OAAO;AACZ,SAAK,MAAM,MAAM;AACb,iBAAW,QAAQ,OAAO;AACtB,aAAK,UAAU,IAAI;AAAA,MACvB;AAAA,IACJ,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,QAAQ,MAAM;AACV,SAAK,SAAS,CAAC,IAAI,CAAC;AAAA,EACxB;AAAA,EACA,aAAa,IAAI;AACb,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,UAAM,WAAW,KAAK,YAAY,IAAI,KAAK,MAAM;AACjD,UAAM,UAAU,KAAK,WAAW,IAAI,KAAK,MAAM;AAC/C,UAAM,oBAAoB,KAAK,aAAa,IAAI,KAAK,MAAM;AAC3D,UAAM,oBAAoB,KAAK,aAAa,IAAI,KAAK,MAAM;AAC3D,aAAS,OAAO,IAAI;AACpB,YAAQ,OAAO,IAAI;AACnB,sBAAkB,OAAO,IAAI;AAC7B,sBAAkB,OAAO,IAAI;AAC7B,SAAK,QAAQ,OAAO,EAAE;AACtB,SAAK,QAAQ,KAAK,EAAE,MAAM,eAAe,OAAO,MAAM;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,QAAQ;AAChB,SAAK,MAAM,MAAM;AACb,aAAO,QAAQ,CAAC,OAAO,KAAK,aAAa,EAAE,CAAC;AAAA,IAChD,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,IAAI;AACX,SAAK,YAAY,CAAC,EAAE,CAAC;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,IAAI,QAAQ;AACzB,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,SAAK,mBAAmB,MAAM;AAC9B,UAAM,YAAY,KAAK;AACvB,UAAM,YAAY;AAClB,SAAK,YAAY,IAAI,SAAS,EAAE,OAAO,IAAI;AAC3C,SAAK,aAAa,IAAI,SAAS,EAAE,OAAO,IAAI;AAC5C,SAAK,YAAY,IAAI,SAAS,EAAE,IAAI,IAAI;AACxC,SAAK,aAAa,IAAI,SAAS,EAAE,IAAI,IAAI;AACzC,SAAK,SAAS;AACd,SAAK,MAAM,MAAM;AACb,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,QACA,cAAc;AAAA,QACd,UAAU;AAAA,QACV,UAAU;AAAA,MAC1B,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB,IAAI,QAAQ;AACzB,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,SAAK,mBAAmB,MAAM;AAC9B,UAAM,YAAY,KAAK;AACvB,UAAM,YAAY;AAClB,SAAK,WAAW,IAAI,SAAS,EAAE,OAAO,IAAI;AAC1C,SAAK,aAAa,IAAI,SAAS,EAAE,OAAO,IAAI;AAC5C,SAAK,WAAW,IAAI,SAAS,EAAE,IAAI,IAAI;AACvC,SAAK,aAAa,IAAI,SAAS,EAAE,IAAI,IAAI;AACzC,SAAK,SAAS;AACd,SAAK,MAAM,MAAM;AACb,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,QACA,cAAc;AAAA,QACd,UAAU;AAAA,QACV,UAAU;AAAA,MAC1B,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,uBAAuB,IAAI,cAAc,OAAO;AAC5C,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,SAAK,MAAM,MAAM;AACb,YAAM,WAAW,KAAK,KAAK,YAAY;AACvC,YAAM,WAAW;AACjB,WAAK,KAAK,YAAY,IAAI;AAC1B,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAChB,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,kBAAkB,MAAM;AACpB,UAAM,KAAK,KAAK,CAAC;AACjB,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,QAAI,OAAO,KAAK,CAAC,MAAM,UAAU;AAE7B,WAAK,uBAAuB,IAAI,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAChD;AAAA,IACJ;AACA,QAAI;AACJ,QAAI,OAAO,KAAK,CAAC,MAAM,YAAY;AAE/B,YAAM,SAAS,KAAK,CAAC;AACrB,aAAO,OAAO,KAAK,IAAI;AAAA,IAC3B,WACS,OAAO,KAAK,CAAC,MAAM,UAAU;AAElC,aAAO,KAAK,CAAC;AAAA,IACjB;AACA,SAAK,MAAM,MAAM;AACb,YAAM,WAAW,KAAK;AACtB,YAAM,WAAW;AACjB,WAAK,OAAO;AACZ,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,MAChB,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc,IAAI,OAAO;AACrB,SAAK,MAAM,MAAM;AACb,aAAO,QAAQ,KAAK,EAAE,QAAQ,CAAC,CAAC,cAAc,KAAK,MAAM;AACrD,aAAK,uBAAuB,IAAI,cAAc,KAAK;AAAA,MACvD,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA;AAAA,EAEA,mBAAmB,SAAS;AACxB,QAAI,CAAC,KAAK,iBAAiB,OAAO,GAAG;AACjC,YAAM,IAAI,MAAM,2CAA2C,OAAO;AAAA,IACtE;AAAA,EACJ;AAAA,EACA,iBAAiB,SAAS;AACtB,WAAO,KAAK,YAAY,IAAI,OAAO;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,oBAAoB,SAAS;AACzB,QAAI,KAAK,YAAY,IAAI,OAAO,GAAG;AAE/B;AAAA,IACJ;AACA,SAAK,YAAY,IAAI,SAAS;AAAA,MAC1B,WAAW,oBAAI,IAAG;AAAA,MAClB,aAAa,oBAAI,IAAG;AAAA,IAChC,CAAS;AACD,SAAK,MAAM,MAAM;AACb,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,MAChB,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,oBAAoB,SAAS;AACzB,SAAK,mBAAmB,OAAO;AAC/B,SAAK,YAAY,OAAO,OAAO;AAC/B,SAAK,MAAM,MAAM;AACb,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,MAChB,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAmBA,QAAQ,MAAM,SAAS;AACnB,SAAK,MAAM,MAAM;AACb,WAAK,oBAAoB,OAAO;AAEhC,YAAM,QAAQ,CAAA;AACd,YAAM,QAAQ,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;AAChD,aAAO,MAAM,QAAQ;AACjB,cAAM,OAAO,MAAM,MAAK;AACxB,cAAM,KAAK,IAAI;AACf,YAAI,KAAK,UAAU;AACf,gBAAM,KAAK,GAAG,KAAK,QAAQ;AAAA,QAC/B;AAAA,MACJ;AACA,WAAK,SAAS,KAAK;AAEnB,YAAM,QAAQ,CAAC,WAAW;;AACtB,qBAAO,aAAP,mBAAiB,QAAQ,CAAC,UAAU;AAChC,eAAK,UAAU,MAAM,IAAI,OAAO,IAAI,OAAO;AAAA,QAC/C;AAAA,MACJ,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA0DA,SAAS,SAAS;AACd,SAAK,mBAAmB,OAAO;AAC/B,WAAO,KAAK,cAAc,OAAO,CAAC,SAAS,CAAC,KAAK,UAAU,KAAK,IAAI,OAAO,CAAC;AAAA,EAChF;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY,IAAI,SAAS;AACrB,SAAK,mBAAmB,EAAE;AAC1B,SAAK,mBAAmB,OAAO;AAC/B,UAAM,OAAO,KAAK,YAAY,IAAI,OAAO;AACzC,UAAM,WAAW,KAAK,YAAY,IAAI,EAAE;AACxC,WAAO,MAAM,KAAK,YAAY,EAAE;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU,IAAI,SAAS;AACnB,SAAK,mBAAmB,EAAE;AAC1B,SAAK,mBAAmB,OAAO;AAC/B,UAAM,OAAO,KAAK,YAAY,IAAI,OAAO;AACzC,WAAO,KAAK,UAAU,IAAI,EAAE,KAAK;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa,IAAI,SAAS;AACtB,UAAM,YAAY,CAAA;AAClB,QAAI,UAAU,KAAK,QAAQ,EAAE;AAC7B,QAAI;AAEJ,WAAQ,SAAS,KAAK,UAAU,QAAQ,IAAI,OAAO,GAAI;AACnD,gBAAU,KAAK,MAAM;AACrB,gBAAU;AAAA,IACd;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,IAAI,QAAQ,SAAS;;AAC3B,SAAK,mBAAmB,OAAO;AAC/B,UAAM,OAAO,KAAK,YAAY,IAAI,OAAO;AACzC,QAAI,CAAC;AACD;AACJ,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,UAAM,YAAY,KAAK,UAAU,IAAI,EAAE;AAEvC,SAAI,uCAAW,QAAO;AAClB;AAEJ,QAAI,WAAW,UAAa,WAAW,MAAM;AACzC,UAAI,WAAW;AACX,mBAAK,YAAY,IAAI,UAAU,EAAE,MAAjC,mBAAoC,OAAO;AAAA,MAC/C;AACA,WAAK,UAAU,OAAO,EAAE;AACxB;AAAA,IACJ;AACA,UAAM,YAAY,KAAK,QAAQ,MAAM;AAErC,SAAK,UAAU,IAAI,IAAI,SAAS;AAEhC,QAAI,WAAW;AACX,iBAAK,YAAY,IAAI,UAAU,EAAE,MAAjC,mBAAoC,OAAO;AAAA,IAC/C;AACA,QAAI,WAAW,KAAK,YAAY,IAAI,UAAU,EAAE;AAChD,QAAI,CAAC,UAAU;AACX,iBAAW,oBAAI,IAAG;AAClB,WAAK,YAAY,IAAI,UAAU,IAAI,QAAQ;AAAA,IAC/C;AACA,aAAS,IAAI,IAAI;AACjB,SAAK,MAAM,MAAM;AACb,WAAK,QAAQ,KAAK;AAAA,QACd,MAAM;AAAA,QACN;AAAA,QACA,QAAQ;AAAA,QACR,aAAa,uCAAW;AAAA,QACxB,aAAa,UAAU;AAAA,MACvC,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,QAAQ,IAAI,IAAI,SAAS;AACrB,UAAM,YAAY,CAAC,WAAW,KAAK,YAAY,QAAQ,OAAO;AAC9D,WAAOC,SAAAA,MAAM,KAAK,QAAQ,EAAE,GAAG,oBAAI,IAAG,GAAI,IAAI,SAAS;AAAA,EAC3D;AAAA,EACA,QAAQ,IAAI,IAAI,SAAS;AACrB,UAAM,YAAY,CAAC,WAAW,KAAK,YAAY,QAAQ,OAAO;AAC9D,WAAOC,SAAAA,MAAM,CAAC,KAAK,QAAQ,EAAE,CAAC,GAAG,oBAAI,IAAG,GAAI,IAAI,SAAS;AAAA,EAC7D;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc;AACV,WAAO,MAAM,KAAK,KAAK,QAAQ,OAAM,CAAE;AAAA,EAC3C;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc;AACV,WAAO,MAAM,KAAK,KAAK,QAAQ,OAAM,CAAE;AAAA,EAC3C;AAAA,EACA,IAAI,IAAI,IAAI,YAAY,OAAO;AAC3B,UAAM,YAAY;AAAA,MACd,IAAI,KAAK,gBAAgB,KAAK,IAAI;AAAA,MAClC,KAAK,KAAK,cAAc,KAAK,IAAI;AAAA,MACjC,MAAM,KAAK,aAAa,KAAK,IAAI;AAAA,IAC7C,EAAU,SAAS;AACX,WAAOA,SAAAA,MAAM,CAAC,KAAK,QAAQ,EAAE,CAAC,GAAG,oBAAI,IAAG,GAAI,IAAI,SAAS;AAAA,EAC7D;AAAA,EACA,IAAI,IAAI,IAAI,YAAY,OAAO;AAC3B,UAAM,YAAY;AAAA,MACd,IAAI,KAAK,gBAAgB,KAAK,IAAI;AAAA,MAClC,KAAK,KAAK,cAAc,KAAK,IAAI;AAAA,MACjC,MAAM,KAAK,aAAa,KAAK,IAAI;AAAA,IAC7C,EAAU,SAAS;AACX,WAAOD,SAAAA,MAAM,KAAK,QAAQ,EAAE,GAAG,oBAAI,IAAG,GAAI,IAAI,SAAS;AAAA,EAC3D;AAAA,EACA,QAAQ;AAEJ,UAAM,WAAW,KAAK,YAAW,EAAG,IAAI,CAAC,YAAY;AACjD,aAAO,EAAE,GAAG,SAAS,MAAM,EAAE,GAAG,QAAQ,OAAM;AAAA,IAClD,CAAC;AACD,UAAM,WAAW,KAAK,YAAW,EAAG,IAAI,CAAC,YAAY;AACjD,aAAO,EAAE,GAAG,SAAS,MAAM,EAAE,GAAG,QAAQ,OAAM;AAAA,IAClD,CAAC;AAED,UAAM,WAAW,IAAI,MAAM;AAAA,MACvB,OAAO;AAAA,MACP,OAAO;AAAA,IACnB,CAAS;AAED,SAAK,YAAY,QAAQ,CAAC,EAAE,WAAW,cAAc,aAAa,eAAc,GAAI,YAAY;AAC5F,YAAM,YAAY,oBAAI,IAAG;AACzB,mBAAa,QAAQ,CAAC,QAAQ,QAAQ;AAClC,kBAAU,IAAI,KAAK,SAAS,QAAQ,OAAO,EAAE,CAAC;AAAA,MAClD,CAAC;AACD,YAAM,cAAc,oBAAI,IAAG;AAC3B,qBAAe,QAAQ,CAAC,UAAU,QAAQ;AACtC,oBAAY,IAAI,KAAK,IAAI,IAAI,MAAM,KAAK,QAAQ,EAAE,IAAI,CAAC,MAAM,SAAS,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC;AAAA,MACzF,CAAC;AACD,eAAS,YAAY,IAAI,SAAS;AAAA,QAC9B;AAAA,QACA;AAAA,MAChB,CAAa;AAAA,IACL,CAAC;AACD,WAAO;AAAA,EACX;AAAA,EACA,SAAS;AACL,WAAO,KAAK,UAAU;AAAA,MAClB,OAAO,KAAK,YAAW;AAAA,MACvB,OAAO,KAAK,YAAW;AAAA;AAAA,IAEnC,CAAS;AAAA,EACL;AAAA,EACA,WAAW,SAAS;AAChB,WAAO,IAAIE,UAAAA,UAAU;AAAA,MACjB,OAAO;AAAA,MACP,GAAG;AAAA,IACf,CAAS;AAAA,EACL;AACJ;;","x_google_ignoreList":[0]}