| 1 |
- {"ast":null,"code":"import _asyncToGenerator from \"F:/workspace/202226701027/huinongbao-app/node_modules/@babel/runtime/helpers/esm/asyncToGenerator.js\";\nimport { zodToJsonSchema } from \"zod-to-json-schema\";\nimport { v4 as uuidv4, validate as isUuid } from \"uuid\";\nimport { isRunnableInterface } from \"./utils.js\";\nimport { drawMermaid, drawMermaidPng } from \"./graph_mermaid.js\";\nfunction nodeDataStr(id, data) {\n if (id !== undefined && !isUuid(id)) {\n return id;\n } else if (isRunnableInterface(data)) {\n try {\n let dataStr = data.getName();\n dataStr = dataStr.startsWith(\"Runnable\") ? dataStr.slice(\"Runnable\".length) : dataStr;\n return dataStr;\n } catch (error) {\n return data.getName();\n }\n } else {\n var _data$name;\n return (_data$name = data.name) !== null && _data$name !== void 0 ? _data$name : \"UnknownSchema\";\n }\n}\nfunction nodeDataJson(node) {\n // if node.data implements Runnable\n if (isRunnableInterface(node.data)) {\n return {\n type: \"runnable\",\n data: {\n id: node.data.lc_id,\n name: node.data.getName()\n }\n };\n } else {\n return {\n type: \"schema\",\n data: {\n ...zodToJsonSchema(node.data.schema),\n title: node.data.name\n }\n };\n }\n}\nexport class Graph {\n constructor(params) {\n var _params$nodes, _params$edges;\n Object.defineProperty(this, \"nodes\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: {}\n });\n Object.defineProperty(this, \"edges\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: []\n });\n this.nodes = (_params$nodes = params === null || params === void 0 ? void 0 : params.nodes) !== null && _params$nodes !== void 0 ? _params$nodes : this.nodes;\n this.edges = (_params$edges = params === null || params === void 0 ? void 0 : params.edges) !== null && _params$edges !== void 0 ? _params$edges : this.edges;\n }\n // Convert the graph to a JSON-serializable format.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n toJSON() {\n const stableNodeIds = {};\n Object.values(this.nodes).forEach((node, i) => {\n stableNodeIds[node.id] = isUuid(node.id) ? i : node.id;\n });\n return {\n nodes: Object.values(this.nodes).map(node => ({\n id: stableNodeIds[node.id],\n ...nodeDataJson(node)\n })),\n edges: this.edges.map(edge => {\n const item = {\n source: stableNodeIds[edge.source],\n target: stableNodeIds[edge.target]\n };\n if (typeof edge.data !== \"undefined\") {\n item.data = edge.data;\n }\n if (typeof edge.conditional !== \"undefined\") {\n item.conditional = edge.conditional;\n }\n return item;\n })\n };\n }\n addNode(data, id,\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n metadata) {\n if (id !== undefined && this.nodes[id] !== undefined) {\n throw new Error(`Node with id ${id} already exists`);\n }\n const nodeId = id !== null && id !== void 0 ? id : uuidv4();\n const node = {\n id: nodeId,\n data,\n name: nodeDataStr(id, data),\n metadata\n };\n this.nodes[nodeId] = node;\n return node;\n }\n removeNode(node) {\n // Remove the node from the nodes map\n delete this.nodes[node.id];\n // Filter out edges connected to the node\n this.edges = this.edges.filter(edge => edge.source !== node.id && edge.target !== node.id);\n }\n addEdge(source, target, data, conditional) {\n if (this.nodes[source.id] === undefined) {\n throw new Error(`Source node ${source.id} not in graph`);\n }\n if (this.nodes[target.id] === undefined) {\n throw new Error(`Target node ${target.id} not in graph`);\n }\n const edge = {\n source: source.id,\n target: target.id,\n data,\n conditional\n };\n this.edges.push(edge);\n return edge;\n }\n firstNode() {\n return _firstNode(this);\n }\n lastNode() {\n return _lastNode(this);\n }\n /**\n * Add all nodes and edges from another graph.\n * Note this doesn't check for duplicates, nor does it connect the graphs.\n */\n extend(graph, prefix = \"\") {\n let finalPrefix = prefix;\n const nodeIds = Object.values(graph.nodes).map(node => node.id);\n if (nodeIds.every(isUuid)) {\n finalPrefix = \"\";\n }\n const prefixed = id => {\n return finalPrefix ? `${finalPrefix}:${id}` : id;\n };\n Object.entries(graph.nodes).forEach(([key, value]) => {\n this.nodes[prefixed(key)] = {\n ...value,\n id: prefixed(key)\n };\n });\n const newEdges = graph.edges.map(edge => {\n return {\n ...edge,\n source: prefixed(edge.source),\n target: prefixed(edge.target)\n };\n });\n // Add all edges from the other graph\n this.edges = [...this.edges, ...newEdges];\n const first = graph.firstNode();\n const last = graph.lastNode();\n return [first ? {\n id: prefixed(first.id),\n data: first.data\n } : undefined, last ? {\n id: prefixed(last.id),\n data: last.data\n } : undefined];\n }\n trimFirstNode() {\n const firstNode = this.firstNode();\n if (firstNode && _firstNode(this, [firstNode.id])) {\n this.removeNode(firstNode);\n }\n }\n trimLastNode() {\n const lastNode = this.lastNode();\n if (lastNode && _lastNode(this, [lastNode.id])) {\n this.removeNode(lastNode);\n }\n }\n /**\n * Return a new graph with all nodes re-identified,\n * using their unique, readable names where possible.\n */\n reid() {\n const nodeLabels = Object.fromEntries(Object.values(this.nodes).map(node => [node.id, node.name]));\n const nodeLabelCounts = new Map();\n Object.values(nodeLabels).forEach(label => {\n nodeLabelCounts.set(label, (nodeLabelCounts.get(label) || 0) + 1);\n });\n const getNodeId = nodeId => {\n const label = nodeLabels[nodeId];\n if (isUuid(nodeId) && nodeLabelCounts.get(label) === 1) {\n return label;\n } else {\n return nodeId;\n }\n };\n return new Graph({\n nodes: Object.fromEntries(Object.entries(this.nodes).map(([id, node]) => [getNodeId(id), {\n ...node,\n id: getNodeId(id)\n }])),\n edges: this.edges.map(edge => ({\n ...edge,\n source: getNodeId(edge.source),\n target: getNodeId(edge.target)\n }))\n });\n }\n drawMermaid(params) {\n const {\n withStyles,\n curveStyle,\n nodeColors = {\n default: \"fill:#f2f0ff,line-height:1.2\",\n first: \"fill-opacity:0\",\n last: \"fill:#bfb6fc\"\n },\n wrapLabelNWords\n } = params !== null && params !== void 0 ? params : {};\n const graph = this.reid();\n const firstNode = graph.firstNode();\n const lastNode = graph.lastNode();\n return drawMermaid(graph.nodes, graph.edges, {\n firstNode: firstNode === null || firstNode === void 0 ? void 0 : firstNode.id,\n lastNode: lastNode === null || lastNode === void 0 ? void 0 : lastNode.id,\n withStyles,\n curveStyle,\n nodeColors,\n wrapLabelNWords\n });\n }\n drawMermaidPng(params) {\n var _this = this;\n return _asyncToGenerator(function* () {\n const mermaidSyntax = _this.drawMermaid(params);\n return drawMermaidPng(mermaidSyntax, {\n backgroundColor: params === null || params === void 0 ? void 0 : params.backgroundColor\n });\n })();\n }\n}\n/**\n * Find the single node that is not a target of any edge.\n * Exclude nodes/sources with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the origin.\n */\nfunction _firstNode(graph, exclude = []) {\n const targets = new Set(graph.edges.filter(edge => !exclude.includes(edge.source)).map(edge => edge.target));\n const found = [];\n for (const node of Object.values(graph.nodes)) {\n if (!exclude.includes(node.id) && !targets.has(node.id)) {\n found.push(node);\n }\n }\n return found.length === 1 ? found[0] : undefined;\n}\n/**\n * Find the single node that is not a source of any edge.\n * Exclude nodes/targets with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the destination.\n */\nfunction _lastNode(graph, exclude = []) {\n const sources = new Set(graph.edges.filter(edge => !exclude.includes(edge.target)).map(edge => edge.source));\n const found = [];\n for (const node of Object.values(graph.nodes)) {\n if (!exclude.includes(node.id) && !sources.has(node.id)) {\n found.push(node);\n }\n }\n return found.length === 1 ? found[0] : undefined;\n}","map":{"version":3,"names":["zodToJsonSchema","v4","uuidv4","validate","isUuid","isRunnableInterface","drawMermaid","drawMermaidPng","nodeDataStr","id","data","undefined","dataStr","getName","startsWith","slice","length","error","_data$name","name","nodeDataJson","node","type","lc_id","schema","title","Graph","constructor","params","_params$nodes","_params$edges","Object","defineProperty","enumerable","configurable","writable","value","nodes","edges","toJSON","stableNodeIds","values","forEach","i","map","edge","item","source","target","conditional","addNode","metadata","Error","nodeId","removeNode","filter","addEdge","push","firstNode","_firstNode","lastNode","_lastNode","extend","graph","prefix","finalPrefix","nodeIds","every","prefixed","entries","key","newEdges","first","last","trimFirstNode","trimLastNode","reid","nodeLabels","fromEntries","nodeLabelCounts","Map","label","set","get","getNodeId","withStyles","curveStyle","nodeColors","default","wrapLabelNWords","_this","_asyncToGenerator","mermaidSyntax","backgroundColor","exclude","targets","Set","includes","found","has","sources"],"sources":["F:/workspace/202226701027/huinongbao-app/node_modules/@langchain/core/dist/runnables/graph.js"],"sourcesContent":["import { zodToJsonSchema } from \"zod-to-json-schema\";\nimport { v4 as uuidv4, validate as isUuid } from \"uuid\";\nimport { isRunnableInterface } from \"./utils.js\";\nimport { drawMermaid, drawMermaidPng } from \"./graph_mermaid.js\";\nfunction nodeDataStr(id, data) {\n if (id !== undefined && !isUuid(id)) {\n return id;\n }\n else if (isRunnableInterface(data)) {\n try {\n let dataStr = data.getName();\n dataStr = dataStr.startsWith(\"Runnable\")\n ? dataStr.slice(\"Runnable\".length)\n : dataStr;\n return dataStr;\n }\n catch (error) {\n return data.getName();\n }\n }\n else {\n return data.name ?? \"UnknownSchema\";\n }\n}\nfunction nodeDataJson(node) {\n // if node.data implements Runnable\n if (isRunnableInterface(node.data)) {\n return {\n type: \"runnable\",\n data: {\n id: node.data.lc_id,\n name: node.data.getName(),\n },\n };\n }\n else {\n return {\n type: \"schema\",\n data: { ...zodToJsonSchema(node.data.schema), title: node.data.name },\n };\n }\n}\nexport class Graph {\n constructor(params) {\n Object.defineProperty(this, \"nodes\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: {}\n });\n Object.defineProperty(this, \"edges\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: []\n });\n this.nodes = params?.nodes ?? this.nodes;\n this.edges = params?.edges ?? this.edges;\n }\n // Convert the graph to a JSON-serializable format.\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n toJSON() {\n const stableNodeIds = {};\n Object.values(this.nodes).forEach((node, i) => {\n stableNodeIds[node.id] = isUuid(node.id) ? i : node.id;\n });\n return {\n nodes: Object.values(this.nodes).map((node) => ({\n id: stableNodeIds[node.id],\n ...nodeDataJson(node),\n })),\n edges: this.edges.map((edge) => {\n const item = {\n source: stableNodeIds[edge.source],\n target: stableNodeIds[edge.target],\n };\n if (typeof edge.data !== \"undefined\") {\n item.data = edge.data;\n }\n if (typeof edge.conditional !== \"undefined\") {\n item.conditional = edge.conditional;\n }\n return item;\n }),\n };\n }\n addNode(data, id, \n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n metadata) {\n if (id !== undefined && this.nodes[id] !== undefined) {\n throw new Error(`Node with id ${id} already exists`);\n }\n const nodeId = id ?? uuidv4();\n const node = {\n id: nodeId,\n data,\n name: nodeDataStr(id, data),\n metadata,\n };\n this.nodes[nodeId] = node;\n return node;\n }\n removeNode(node) {\n // Remove the node from the nodes map\n delete this.nodes[node.id];\n // Filter out edges connected to the node\n this.edges = this.edges.filter((edge) => edge.source !== node.id && edge.target !== node.id);\n }\n addEdge(source, target, data, conditional) {\n if (this.nodes[source.id] === undefined) {\n throw new Error(`Source node ${source.id} not in graph`);\n }\n if (this.nodes[target.id] === undefined) {\n throw new Error(`Target node ${target.id} not in graph`);\n }\n const edge = {\n source: source.id,\n target: target.id,\n data,\n conditional,\n };\n this.edges.push(edge);\n return edge;\n }\n firstNode() {\n return _firstNode(this);\n }\n lastNode() {\n return _lastNode(this);\n }\n /**\n * Add all nodes and edges from another graph.\n * Note this doesn't check for duplicates, nor does it connect the graphs.\n */\n extend(graph, prefix = \"\") {\n let finalPrefix = prefix;\n const nodeIds = Object.values(graph.nodes).map((node) => node.id);\n if (nodeIds.every(isUuid)) {\n finalPrefix = \"\";\n }\n const prefixed = (id) => {\n return finalPrefix ? `${finalPrefix}:${id}` : id;\n };\n Object.entries(graph.nodes).forEach(([key, value]) => {\n this.nodes[prefixed(key)] = { ...value, id: prefixed(key) };\n });\n const newEdges = graph.edges.map((edge) => {\n return {\n ...edge,\n source: prefixed(edge.source),\n target: prefixed(edge.target),\n };\n });\n // Add all edges from the other graph\n this.edges = [...this.edges, ...newEdges];\n const first = graph.firstNode();\n const last = graph.lastNode();\n return [\n first ? { id: prefixed(first.id), data: first.data } : undefined,\n last ? { id: prefixed(last.id), data: last.data } : undefined,\n ];\n }\n trimFirstNode() {\n const firstNode = this.firstNode();\n if (firstNode && _firstNode(this, [firstNode.id])) {\n this.removeNode(firstNode);\n }\n }\n trimLastNode() {\n const lastNode = this.lastNode();\n if (lastNode && _lastNode(this, [lastNode.id])) {\n this.removeNode(lastNode);\n }\n }\n /**\n * Return a new graph with all nodes re-identified,\n * using their unique, readable names where possible.\n */\n reid() {\n const nodeLabels = Object.fromEntries(Object.values(this.nodes).map((node) => [node.id, node.name]));\n const nodeLabelCounts = new Map();\n Object.values(nodeLabels).forEach((label) => {\n nodeLabelCounts.set(label, (nodeLabelCounts.get(label) || 0) + 1);\n });\n const getNodeId = (nodeId) => {\n const label = nodeLabels[nodeId];\n if (isUuid(nodeId) && nodeLabelCounts.get(label) === 1) {\n return label;\n }\n else {\n return nodeId;\n }\n };\n return new Graph({\n nodes: Object.fromEntries(Object.entries(this.nodes).map(([id, node]) => [\n getNodeId(id),\n { ...node, id: getNodeId(id) },\n ])),\n edges: this.edges.map((edge) => ({\n ...edge,\n source: getNodeId(edge.source),\n target: getNodeId(edge.target),\n })),\n });\n }\n drawMermaid(params) {\n const { withStyles, curveStyle, nodeColors = {\n default: \"fill:#f2f0ff,line-height:1.2\",\n first: \"fill-opacity:0\",\n last: \"fill:#bfb6fc\",\n }, wrapLabelNWords, } = params ?? {};\n const graph = this.reid();\n const firstNode = graph.firstNode();\n const lastNode = graph.lastNode();\n return drawMermaid(graph.nodes, graph.edges, {\n firstNode: firstNode?.id,\n lastNode: lastNode?.id,\n withStyles,\n curveStyle,\n nodeColors,\n wrapLabelNWords,\n });\n }\n async drawMermaidPng(params) {\n const mermaidSyntax = this.drawMermaid(params);\n return drawMermaidPng(mermaidSyntax, {\n backgroundColor: params?.backgroundColor,\n });\n }\n}\n/**\n * Find the single node that is not a target of any edge.\n * Exclude nodes/sources with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the origin.\n */\nfunction _firstNode(graph, exclude = []) {\n const targets = new Set(graph.edges\n .filter((edge) => !exclude.includes(edge.source))\n .map((edge) => edge.target));\n const found = [];\n for (const node of Object.values(graph.nodes)) {\n if (!exclude.includes(node.id) && !targets.has(node.id)) {\n found.push(node);\n }\n }\n return found.length === 1 ? found[0] : undefined;\n}\n/**\n * Find the single node that is not a source of any edge.\n * Exclude nodes/targets with ids in the exclude list.\n * If there is no such node, or there are multiple, return undefined.\n * When drawing the graph, this node would be the destination.\n */\nfunction _lastNode(graph, exclude = []) {\n const sources = new Set(graph.edges\n .filter((edge) => !exclude.includes(edge.target))\n .map((edge) => edge.source));\n const found = [];\n for (const node of Object.values(graph.nodes)) {\n if (!exclude.includes(node.id) && !sources.has(node.id)) {\n found.push(node);\n }\n }\n return found.length === 1 ? found[0] : undefined;\n}\n"],"mappings":";AAAA,SAASA,eAAe,QAAQ,oBAAoB;AACpD,SAASC,EAAE,IAAIC,MAAM,EAAEC,QAAQ,IAAIC,MAAM,QAAQ,MAAM;AACvD,SAASC,mBAAmB,QAAQ,YAAY;AAChD,SAASC,WAAW,EAAEC,cAAc,QAAQ,oBAAoB;AAChE,SAASC,WAAWA,CAACC,EAAE,EAAEC,IAAI,EAAE;EAC3B,IAAID,EAAE,KAAKE,SAAS,IAAI,CAACP,MAAM,CAACK,EAAE,CAAC,EAAE;IACjC,OAAOA,EAAE;EACb,CAAC,MACI,IAAIJ,mBAAmB,CAACK,IAAI,CAAC,EAAE;IAChC,IAAI;MACA,IAAIE,OAAO,GAAGF,IAAI,CAACG,OAAO,CAAC,CAAC;MAC5BD,OAAO,GAAGA,OAAO,CAACE,UAAU,CAAC,UAAU,CAAC,GAClCF,OAAO,CAACG,KAAK,CAAC,UAAU,CAACC,MAAM,CAAC,GAChCJ,OAAO;MACb,OAAOA,OAAO;IAClB,CAAC,CACD,OAAOK,KAAK,EAAE;MACV,OAAOP,IAAI,CAACG,OAAO,CAAC,CAAC;IACzB;EACJ,CAAC,MACI;IAAA,IAAAK,UAAA;IACD,QAAAA,UAAA,GAAOR,IAAI,CAACS,IAAI,cAAAD,UAAA,cAAAA,UAAA,GAAI,eAAe;EACvC;AACJ;AACA,SAASE,YAAYA,CAACC,IAAI,EAAE;EACxB;EACA,IAAIhB,mBAAmB,CAACgB,IAAI,CAACX,IAAI,CAAC,EAAE;IAChC,OAAO;MACHY,IAAI,EAAE,UAAU;MAChBZ,IAAI,EAAE;QACFD,EAAE,EAAEY,IAAI,CAACX,IAAI,CAACa,KAAK;QACnBJ,IAAI,EAAEE,IAAI,CAACX,IAAI,CAACG,OAAO,CAAC;MAC5B;IACJ,CAAC;EACL,CAAC,MACI;IACD,OAAO;MACHS,IAAI,EAAE,QAAQ;MACdZ,IAAI,EAAE;QAAE,GAAGV,eAAe,CAACqB,IAAI,CAACX,IAAI,CAACc,MAAM,CAAC;QAAEC,KAAK,EAAEJ,IAAI,CAACX,IAAI,CAACS;MAAK;IACxE,CAAC;EACL;AACJ;AACA,OAAO,MAAMO,KAAK,CAAC;EACfC,WAAWA,CAACC,MAAM,EAAE;IAAA,IAAAC,aAAA,EAAAC,aAAA;IAChBC,MAAM,CAACC,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE;MACjCC,UAAU,EAAE,IAAI;MAChBC,YAAY,EAAE,IAAI;MAClBC,QAAQ,EAAE,IAAI;MACdC,KAAK,EAAE,CAAC;IACZ,CAAC,CAAC;IACFL,MAAM,CAACC,cAAc,CAAC,IAAI,EAAE,OAAO,EAAE;MACjCC,UAAU,EAAE,IAAI;MAChBC,YAAY,EAAE,IAAI;MAClBC,QAAQ,EAAE,IAAI;MACdC,KAAK,EAAE;IACX,CAAC,CAAC;IACF,IAAI,CAACC,KAAK,IAAAR,aAAA,GAAGD,MAAM,aAANA,MAAM,uBAANA,MAAM,CAAES,KAAK,cAAAR,aAAA,cAAAA,aAAA,GAAI,IAAI,CAACQ,KAAK;IACxC,IAAI,CAACC,KAAK,IAAAR,aAAA,GAAGF,MAAM,aAANA,MAAM,uBAANA,MAAM,CAAEU,KAAK,cAAAR,aAAA,cAAAA,aAAA,GAAI,IAAI,CAACQ,KAAK;EAC5C;EACA;EACA;EACAC,MAAMA,CAAA,EAAG;IACL,MAAMC,aAAa,GAAG,CAAC,CAAC;IACxBT,MAAM,CAACU,MAAM,CAAC,IAAI,CAACJ,KAAK,CAAC,CAACK,OAAO,CAAC,CAACrB,IAAI,EAAEsB,CAAC,KAAK;MAC3CH,aAAa,CAACnB,IAAI,CAACZ,EAAE,CAAC,GAAGL,MAAM,CAACiB,IAAI,CAACZ,EAAE,CAAC,GAAGkC,CAAC,GAAGtB,IAAI,CAACZ,EAAE;IAC1D,CAAC,CAAC;IACF,OAAO;MACH4B,KAAK,EAAEN,MAAM,CAACU,MAAM,CAAC,IAAI,CAACJ,KAAK,CAAC,CAACO,GAAG,CAAEvB,IAAI,KAAM;QAC5CZ,EAAE,EAAE+B,aAAa,CAACnB,IAAI,CAACZ,EAAE,CAAC;QAC1B,GAAGW,YAAY,CAACC,IAAI;MACxB,CAAC,CAAC,CAAC;MACHiB,KAAK,EAAE,IAAI,CAACA,KAAK,CAACM,GAAG,CAAEC,IAAI,IAAK;QAC5B,MAAMC,IAAI,GAAG;UACTC,MAAM,EAAEP,aAAa,CAACK,IAAI,CAACE,MAAM,CAAC;UAClCC,MAAM,EAAER,aAAa,CAACK,IAAI,CAACG,MAAM;QACrC,CAAC;QACD,IAAI,OAAOH,IAAI,CAACnC,IAAI,KAAK,WAAW,EAAE;UAClCoC,IAAI,CAACpC,IAAI,GAAGmC,IAAI,CAACnC,IAAI;QACzB;QACA,IAAI,OAAOmC,IAAI,CAACI,WAAW,KAAK,WAAW,EAAE;UACzCH,IAAI,CAACG,WAAW,GAAGJ,IAAI,CAACI,WAAW;QACvC;QACA,OAAOH,IAAI;MACf,CAAC;IACL,CAAC;EACL;EACAI,OAAOA,CAACxC,IAAI,EAAED,EAAE;EAChB;EACA0C,QAAQ,EAAE;IACN,IAAI1C,EAAE,KAAKE,SAAS,IAAI,IAAI,CAAC0B,KAAK,CAAC5B,EAAE,CAAC,KAAKE,SAAS,EAAE;MAClD,MAAM,IAAIyC,KAAK,CAAC,gBAAgB3C,EAAE,iBAAiB,CAAC;IACxD;IACA,MAAM4C,MAAM,GAAG5C,EAAE,aAAFA,EAAE,cAAFA,EAAE,GAAIP,MAAM,CAAC,CAAC;IAC7B,MAAMmB,IAAI,GAAG;MACTZ,EAAE,EAAE4C,MAAM;MACV3C,IAAI;MACJS,IAAI,EAAEX,WAAW,CAACC,EAAE,EAAEC,IAAI,CAAC;MAC3ByC;IACJ,CAAC;IACD,IAAI,CAACd,KAAK,CAACgB,MAAM,CAAC,GAAGhC,IAAI;IACzB,OAAOA,IAAI;EACf;EACAiC,UAAUA,CAACjC,IAAI,EAAE;IACb;IACA,OAAO,IAAI,CAACgB,KAAK,CAAChB,IAAI,CAACZ,EAAE,CAAC;IAC1B;IACA,IAAI,CAAC6B,KAAK,GAAG,IAAI,CAACA,KAAK,CAACiB,MAAM,CAAEV,IAAI,IAAKA,IAAI,CAACE,MAAM,KAAK1B,IAAI,CAACZ,EAAE,IAAIoC,IAAI,CAACG,MAAM,KAAK3B,IAAI,CAACZ,EAAE,CAAC;EAChG;EACA+C,OAAOA,CAACT,MAAM,EAAEC,MAAM,EAAEtC,IAAI,EAAEuC,WAAW,EAAE;IACvC,IAAI,IAAI,CAACZ,KAAK,CAACU,MAAM,CAACtC,EAAE,CAAC,KAAKE,SAAS,EAAE;MACrC,MAAM,IAAIyC,KAAK,CAAC,eAAeL,MAAM,CAACtC,EAAE,eAAe,CAAC;IAC5D;IACA,IAAI,IAAI,CAAC4B,KAAK,CAACW,MAAM,CAACvC,EAAE,CAAC,KAAKE,SAAS,EAAE;MACrC,MAAM,IAAIyC,KAAK,CAAC,eAAeJ,MAAM,CAACvC,EAAE,eAAe,CAAC;IAC5D;IACA,MAAMoC,IAAI,GAAG;MACTE,MAAM,EAAEA,MAAM,CAACtC,EAAE;MACjBuC,MAAM,EAAEA,MAAM,CAACvC,EAAE;MACjBC,IAAI;MACJuC;IACJ,CAAC;IACD,IAAI,CAACX,KAAK,CAACmB,IAAI,CAACZ,IAAI,CAAC;IACrB,OAAOA,IAAI;EACf;EACAa,SAASA,CAAA,EAAG;IACR,OAAOC,UAAU,CAAC,IAAI,CAAC;EAC3B;EACAC,QAAQA,CAAA,EAAG;IACP,OAAOC,SAAS,CAAC,IAAI,CAAC;EAC1B;EACA;AACJ;AACA;AACA;EACIC,MAAMA,CAACC,KAAK,EAAEC,MAAM,GAAG,EAAE,EAAE;IACvB,IAAIC,WAAW,GAAGD,MAAM;IACxB,MAAME,OAAO,GAAGnC,MAAM,CAACU,MAAM,CAACsB,KAAK,CAAC1B,KAAK,CAAC,CAACO,GAAG,CAAEvB,IAAI,IAAKA,IAAI,CAACZ,EAAE,CAAC;IACjE,IAAIyD,OAAO,CAACC,KAAK,CAAC/D,MAAM,CAAC,EAAE;MACvB6D,WAAW,GAAG,EAAE;IACpB;IACA,MAAMG,QAAQ,GAAI3D,EAAE,IAAK;MACrB,OAAOwD,WAAW,GAAG,GAAGA,WAAW,IAAIxD,EAAE,EAAE,GAAGA,EAAE;IACpD,CAAC;IACDsB,MAAM,CAACsC,OAAO,CAACN,KAAK,CAAC1B,KAAK,CAAC,CAACK,OAAO,CAAC,CAAC,CAAC4B,GAAG,EAAElC,KAAK,CAAC,KAAK;MAClD,IAAI,CAACC,KAAK,CAAC+B,QAAQ,CAACE,GAAG,CAAC,CAAC,GAAG;QAAE,GAAGlC,KAAK;QAAE3B,EAAE,EAAE2D,QAAQ,CAACE,GAAG;MAAE,CAAC;IAC/D,CAAC,CAAC;IACF,MAAMC,QAAQ,GAAGR,KAAK,CAACzB,KAAK,CAACM,GAAG,CAAEC,IAAI,IAAK;MACvC,OAAO;QACH,GAAGA,IAAI;QACPE,MAAM,EAAEqB,QAAQ,CAACvB,IAAI,CAACE,MAAM,CAAC;QAC7BC,MAAM,EAAEoB,QAAQ,CAACvB,IAAI,CAACG,MAAM;MAChC,CAAC;IACL,CAAC,CAAC;IACF;IACA,IAAI,CAACV,KAAK,GAAG,CAAC,GAAG,IAAI,CAACA,KAAK,EAAE,GAAGiC,QAAQ,CAAC;IACzC,MAAMC,KAAK,GAAGT,KAAK,CAACL,SAAS,CAAC,CAAC;IAC/B,MAAMe,IAAI,GAAGV,KAAK,CAACH,QAAQ,CAAC,CAAC;IAC7B,OAAO,CACHY,KAAK,GAAG;MAAE/D,EAAE,EAAE2D,QAAQ,CAACI,KAAK,CAAC/D,EAAE,CAAC;MAAEC,IAAI,EAAE8D,KAAK,CAAC9D;IAAK,CAAC,GAAGC,SAAS,EAChE8D,IAAI,GAAG;MAAEhE,EAAE,EAAE2D,QAAQ,CAACK,IAAI,CAAChE,EAAE,CAAC;MAAEC,IAAI,EAAE+D,IAAI,CAAC/D;IAAK,CAAC,GAAGC,SAAS,CAChE;EACL;EACA+D,aAAaA,CAAA,EAAG;IACZ,MAAMhB,SAAS,GAAG,IAAI,CAACA,SAAS,CAAC,CAAC;IAClC,IAAIA,SAAS,IAAIC,UAAU,CAAC,IAAI,EAAE,CAACD,SAAS,CAACjD,EAAE,CAAC,CAAC,EAAE;MAC/C,IAAI,CAAC6C,UAAU,CAACI,SAAS,CAAC;IAC9B;EACJ;EACAiB,YAAYA,CAAA,EAAG;IACX,MAAMf,QAAQ,GAAG,IAAI,CAACA,QAAQ,CAAC,CAAC;IAChC,IAAIA,QAAQ,IAAIC,SAAS,CAAC,IAAI,EAAE,CAACD,QAAQ,CAACnD,EAAE,CAAC,CAAC,EAAE;MAC5C,IAAI,CAAC6C,UAAU,CAACM,QAAQ,CAAC;IAC7B;EACJ;EACA;AACJ;AACA;AACA;EACIgB,IAAIA,CAAA,EAAG;IACH,MAAMC,UAAU,GAAG9C,MAAM,CAAC+C,WAAW,CAAC/C,MAAM,CAACU,MAAM,CAAC,IAAI,CAACJ,KAAK,CAAC,CAACO,GAAG,CAAEvB,IAAI,IAAK,CAACA,IAAI,CAACZ,EAAE,EAAEY,IAAI,CAACF,IAAI,CAAC,CAAC,CAAC;IACpG,MAAM4D,eAAe,GAAG,IAAIC,GAAG,CAAC,CAAC;IACjCjD,MAAM,CAACU,MAAM,CAACoC,UAAU,CAAC,CAACnC,OAAO,CAAEuC,KAAK,IAAK;MACzCF,eAAe,CAACG,GAAG,CAACD,KAAK,EAAE,CAACF,eAAe,CAACI,GAAG,CAACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrE,CAAC,CAAC;IACF,MAAMG,SAAS,GAAI/B,MAAM,IAAK;MAC1B,MAAM4B,KAAK,GAAGJ,UAAU,CAACxB,MAAM,CAAC;MAChC,IAAIjD,MAAM,CAACiD,MAAM,CAAC,IAAI0B,eAAe,CAACI,GAAG,CAACF,KAAK,CAAC,KAAK,CAAC,EAAE;QACpD,OAAOA,KAAK;MAChB,CAAC,MACI;QACD,OAAO5B,MAAM;MACjB;IACJ,CAAC;IACD,OAAO,IAAI3B,KAAK,CAAC;MACbW,KAAK,EAAEN,MAAM,CAAC+C,WAAW,CAAC/C,MAAM,CAACsC,OAAO,CAAC,IAAI,CAAChC,KAAK,CAAC,CAACO,GAAG,CAAC,CAAC,CAACnC,EAAE,EAAEY,IAAI,CAAC,KAAK,CACrE+D,SAAS,CAAC3E,EAAE,CAAC,EACb;QAAE,GAAGY,IAAI;QAAEZ,EAAE,EAAE2E,SAAS,CAAC3E,EAAE;MAAE,CAAC,CACjC,CAAC,CAAC;MACH6B,KAAK,EAAE,IAAI,CAACA,KAAK,CAACM,GAAG,CAAEC,IAAI,KAAM;QAC7B,GAAGA,IAAI;QACPE,MAAM,EAAEqC,SAAS,CAACvC,IAAI,CAACE,MAAM,CAAC;QAC9BC,MAAM,EAAEoC,SAAS,CAACvC,IAAI,CAACG,MAAM;MACjC,CAAC,CAAC;IACN,CAAC,CAAC;EACN;EACA1C,WAAWA,CAACsB,MAAM,EAAE;IAChB,MAAM;MAAEyD,UAAU;MAAEC,UAAU;MAAEC,UAAU,GAAG;QACzCC,OAAO,EAAE,8BAA8B;QACvChB,KAAK,EAAE,gBAAgB;QACvBC,IAAI,EAAE;MACV,CAAC;MAAEgB;IAAiB,CAAC,GAAG7D,MAAM,aAANA,MAAM,cAANA,MAAM,GAAI,CAAC,CAAC;IACpC,MAAMmC,KAAK,GAAG,IAAI,CAACa,IAAI,CAAC,CAAC;IACzB,MAAMlB,SAAS,GAAGK,KAAK,CAACL,SAAS,CAAC,CAAC;IACnC,MAAME,QAAQ,GAAGG,KAAK,CAACH,QAAQ,CAAC,CAAC;IACjC,OAAOtD,WAAW,CAACyD,KAAK,CAAC1B,KAAK,EAAE0B,KAAK,CAACzB,KAAK,EAAE;MACzCoB,SAAS,EAAEA,SAAS,aAATA,SAAS,uBAATA,SAAS,CAAEjD,EAAE;MACxBmD,QAAQ,EAAEA,QAAQ,aAARA,QAAQ,uBAARA,QAAQ,CAAEnD,EAAE;MACtB4E,UAAU;MACVC,UAAU;MACVC,UAAU;MACVE;IACJ,CAAC,CAAC;EACN;EACMlF,cAAcA,CAACqB,MAAM,EAAE;IAAA,IAAA8D,KAAA;IAAA,OAAAC,iBAAA;MACzB,MAAMC,aAAa,GAAGF,KAAI,CAACpF,WAAW,CAACsB,MAAM,CAAC;MAC9C,OAAOrB,cAAc,CAACqF,aAAa,EAAE;QACjCC,eAAe,EAAEjE,MAAM,aAANA,MAAM,uBAANA,MAAM,CAAEiE;MAC7B,CAAC,CAAC;IAAC;EACP;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASlC,UAAUA,CAACI,KAAK,EAAE+B,OAAO,GAAG,EAAE,EAAE;EACrC,MAAMC,OAAO,GAAG,IAAIC,GAAG,CAACjC,KAAK,CAACzB,KAAK,CAC9BiB,MAAM,CAAEV,IAAI,IAAK,CAACiD,OAAO,CAACG,QAAQ,CAACpD,IAAI,CAACE,MAAM,CAAC,CAAC,CAChDH,GAAG,CAAEC,IAAI,IAAKA,IAAI,CAACG,MAAM,CAAC,CAAC;EAChC,MAAMkD,KAAK,GAAG,EAAE;EAChB,KAAK,MAAM7E,IAAI,IAAIU,MAAM,CAACU,MAAM,CAACsB,KAAK,CAAC1B,KAAK,CAAC,EAAE;IAC3C,IAAI,CAACyD,OAAO,CAACG,QAAQ,CAAC5E,IAAI,CAACZ,EAAE,CAAC,IAAI,CAACsF,OAAO,CAACI,GAAG,CAAC9E,IAAI,CAACZ,EAAE,CAAC,EAAE;MACrDyF,KAAK,CAACzC,IAAI,CAACpC,IAAI,CAAC;IACpB;EACJ;EACA,OAAO6E,KAAK,CAAClF,MAAM,KAAK,CAAC,GAAGkF,KAAK,CAAC,CAAC,CAAC,GAAGvF,SAAS;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASkD,SAASA,CAACE,KAAK,EAAE+B,OAAO,GAAG,EAAE,EAAE;EACpC,MAAMM,OAAO,GAAG,IAAIJ,GAAG,CAACjC,KAAK,CAACzB,KAAK,CAC9BiB,MAAM,CAAEV,IAAI,IAAK,CAACiD,OAAO,CAACG,QAAQ,CAACpD,IAAI,CAACG,MAAM,CAAC,CAAC,CAChDJ,GAAG,CAAEC,IAAI,IAAKA,IAAI,CAACE,MAAM,CAAC,CAAC;EAChC,MAAMmD,KAAK,GAAG,EAAE;EAChB,KAAK,MAAM7E,IAAI,IAAIU,MAAM,CAACU,MAAM,CAACsB,KAAK,CAAC1B,KAAK,CAAC,EAAE;IAC3C,IAAI,CAACyD,OAAO,CAACG,QAAQ,CAAC5E,IAAI,CAACZ,EAAE,CAAC,IAAI,CAAC2F,OAAO,CAACD,GAAG,CAAC9E,IAAI,CAACZ,EAAE,CAAC,EAAE;MACrDyF,KAAK,CAACzC,IAAI,CAACpC,IAAI,CAAC;IACpB;EACJ;EACA,OAAO6E,KAAK,CAAClF,MAAM,KAAK,CAAC,GAAGkF,KAAK,CAAC,CAAC,CAAC,GAAGvF,SAAS;AACpD","ignoreList":[]},"metadata":{},"sourceType":"module","externalDependencies":[]}
|
