npm - @aiquants/markdown - Versions diffs - 1.3.0 → 1.4.0 - Mend

@aiquants/markdown 1.3.0 → 1.4.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (319) hide show

package/dist/{dagre-6UL2VRFP-BohBB2aw.js.map → dagre-6UL2VRFP-hEXR6Hr0.js.map} RENAMED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"dagre-6UL2VRFP-BohBB2aw.js","sources":["../../../node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/graphlib/json.js","../../../node_modules/.pnpm/mermaid@11.12.2/node_modules/mermaid/dist/chunks/mermaid.core/dagre-6UL2VRFP.mjs"],"sourcesContent":["import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\nexport { write, read };\n\nfunction write(g) {\n var json = {\n options: {\n directed: g.isDirected(),\n multigraph: g.isMultigraph(),\n compound: g.isCompound(),\n },\n nodes: writeNodes(g),\n edges: writeEdges(g),\n };\n if (!_.isUndefined(g.graph())) {\n json.value = _.clone(g.graph());\n }\n return json;\n}\n\nfunction writeNodes(g) {\n return _.map(g.nodes(), function (v) {\n var nodeValue = g.node(v);\n var parent = g.parent(v);\n var node = { v: v };\n if (!_.isUndefined(nodeValue)) {\n node.value = nodeValue;\n }\n if (!_.isUndefined(parent)) {\n node.parent = parent;\n }\n return node;\n });\n}\n\nfunction writeEdges(g) {\n return _.map(g.edges(), function (e) {\n var edgeValue = g.edge(e);\n var edge = { v: e.v, w: e.w };\n if (!_.isUndefined(e.name)) {\n edge.name = e.name;\n }\n if (!_.isUndefined(edgeValue)) {\n edge.value = edgeValue;\n }\n return edge;\n });\n}\n\nfunction read(json) {\n var g = new Graph(json.options).setGraph(json.value);\n _.each(json.nodes, function (entry) {\n g.setNode(entry.v, entry.value);\n if (entry.parent) {\n g.setParent(entry.v, entry.parent);\n }\n });\n _.each(json.edges, function (entry) {\n g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n });\n return g;\n}\n","import {\n clear as clear2,\n insertEdge,\n insertEdgeLabel,\n markers_default,\n positionEdgeLabel\n} from \"./chunk-QXUST7PY.mjs\";\nimport \"./chunk-HN2XXSSU.mjs\";\nimport {\n clear,\n clear2 as clear3,\n insertCluster,\n insertNode,\n positionNode,\n setNodeElem,\n updateNodeBounds\n} from \"./chunk-JZLCHNYA.mjs\";\nimport {\n getSubGraphTitleMargins\n} from \"./chunk-CVBHYZKI.mjs\";\nimport \"./chunk-ATLVNIR6.mjs\";\nimport \"./chunk-JA3XYJ7Z.mjs\";\nimport \"./chunk-S3R3BYOJ.mjs\";\nimport {\n getConfig2 as getConfig\n} from \"./chunk-ABZYJK2D.mjs\";\nimport {\n __name,\n log\n} from \"./chunk-AGHRB4JF.mjs\";\n\n// src/rendering-util/layout-algorithms/dagre/index.js\nimport { layout as dagreLayout } from \"dagre-d3-es/src/dagre/index.js\";\nimport * as graphlibJson2 from \"dagre-d3-es/src/graphlib/json.js\";\nimport * as graphlib2 from \"dagre-d3-es/src/graphlib/index.js\";\n\n// src/rendering-util/layout-algorithms/dagre/mermaid-graphlib.js\nimport * as graphlib from \"dagre-d3-es/src/graphlib/index.js\";\nimport * as graphlibJson from \"dagre-d3-es/src/graphlib/json.js\";\nvar clusterDb = /* @__PURE__ / new Map();\nvar descendants = / @__PURE__ / new Map();\nvar parents = / @__PURE__ / new Map();\nvar clear4 = / @__PURE__ / __name(() => {\n descendants.clear();\n parents.clear();\n clusterDb.clear();\n}, \"clear\");\nvar isDescendant = / @__PURE__ / __name((id, ancestorId) => {\n const ancestorDescendants = descendants.get(ancestorId) \|\| [];\n log.trace(\"In isDescendant\", ancestorId, \" \", id, \" = \", ancestorDescendants.includes(id));\n return ancestorDescendants.includes(id);\n}, \"isDescendant\");\nvar edgeInCluster = / @__PURE__ / __name((edge, clusterId) => {\n const clusterDescendants = descendants.get(clusterId) \|\| [];\n log.info(\"Descendants of \", clusterId, \" is \", clusterDescendants);\n log.info(\"Edge is \", edge);\n if (edge.v === clusterId \|\| edge.w === clusterId) {\n return false;\n }\n if (!clusterDescendants) {\n log.debug(\"Tilt, \", clusterId, \",not in descendants\");\n return false;\n }\n return clusterDescendants.includes(edge.v) \|\| isDescendant(edge.v, clusterId) \|\| isDescendant(edge.w, clusterId) \|\| clusterDescendants.includes(edge.w);\n}, \"edgeInCluster\");\nvar copy = / @__PURE__ / __name((clusterId, graph, newGraph, rootId) => {\n log.warn(\n \"Copying children of \",\n clusterId,\n \"root\",\n rootId,\n \"data\",\n graph.node(clusterId),\n rootId\n );\n const nodes = graph.children(clusterId) \|\| [];\n if (clusterId !== rootId) {\n nodes.push(clusterId);\n }\n log.warn(\"Copying (nodes) clusterId\", clusterId, \"nodes\", nodes);\n nodes.forEach((node) => {\n if (graph.children(node).length > 0) {\n copy(node, graph, newGraph, rootId);\n } else {\n const data = graph.node(node);\n log.info(\"cp \", node, \" to \", rootId, \" with parent \", clusterId);\n newGraph.setNode(node, data);\n if (rootId !== graph.parent(node)) {\n log.warn(\"Setting parent\", node, graph.parent(node));\n newGraph.setParent(node, graph.parent(node));\n }\n if (clusterId !== rootId && node !== clusterId) {\n log.debug(\"Setting parent\", node, clusterId);\n newGraph.setParent(node, clusterId);\n } else {\n log.info(\"In copy \", clusterId, \"root\", rootId, \"data\", graph.node(clusterId), rootId);\n log.debug(\n \"Not Setting parent for node=\",\n node,\n \"cluster!==rootId\",\n clusterId !== rootId,\n \"node!==clusterId\",\n node !== clusterId\n );\n }\n const edges = graph.edges(node);\n log.debug(\"Copying Edges\", edges);\n edges.forEach((edge) => {\n log.info(\"Edge\", edge);\n const data2 = graph.edge(edge.v, edge.w, edge.name);\n log.info(\"Edge data\", data2, rootId);\n try {\n if (edgeInCluster(edge, rootId)) {\n log.info(\"Copying as \", edge.v, edge.w, data2, edge.name);\n newGraph.setEdge(edge.v, edge.w, data2, edge.name);\n log.info(\"newGraph edges \", newGraph.edges(), newGraph.edge(newGraph.edges()[0]));\n } else {\n log.info(\n \"Skipping copy of edge \",\n edge.v,\n \"-->\",\n edge.w,\n \" rootId: \",\n rootId,\n \" clusterId:\",\n clusterId\n );\n }\n } catch (e) {\n log.error(e);\n }\n });\n }\n log.debug(\"Removing node\", node);\n graph.removeNode(node);\n });\n}, \"copy\");\nvar extractDescendants = / @__PURE__ / __name((id, graph) => {\n const children = graph.children(id);\n let res = [...children];\n for (const child of children) {\n parents.set(child, id);\n res = [...res, ...extractDescendants(child, graph)];\n }\n return res;\n}, \"extractDescendants\");\nvar findCommonEdges = / @__PURE__ / __name((graph, id1, id2) => {\n const edges1 = graph.edges().filter((edge) => edge.v === id1 \|\| edge.w === id1);\n const edges2 = graph.edges().filter((edge) => edge.v === id2 \|\| edge.w === id2);\n const edges1Prim = edges1.map((edge) => {\n return { v: edge.v === id1 ? id2 : edge.v, w: edge.w === id1 ? id1 : edge.w };\n });\n const edges2Prim = edges2.map((edge) => {\n return { v: edge.v, w: edge.w };\n });\n const result = edges1Prim.filter((edgeIn1) => {\n return edges2Prim.some((edge) => edgeIn1.v === edge.v && edgeIn1.w === edge.w);\n });\n return result;\n}, \"findCommonEdges\");\nvar findNonClusterChild = / @__PURE__ / __name((id, graph, clusterId) => {\n const children = graph.children(id);\n log.trace(\"Searching children of id \", id, children);\n if (children.length < 1) {\n return id;\n }\n let reserve;\n for (const child of children) {\n const _id = findNonClusterChild(child, graph, clusterId);\n const commonEdges = findCommonEdges(graph, clusterId, _id);\n if (_id) {\n if (commonEdges.length > 0) {\n reserve = _id;\n } else {\n return _id;\n }\n }\n }\n return reserve;\n}, \"findNonClusterChild\");\nvar getAnchorId = / @__PURE__ / __name((id) => {\n if (!clusterDb.has(id)) {\n return id;\n }\n if (!clusterDb.get(id).externalConnections) {\n return id;\n }\n if (clusterDb.has(id)) {\n return clusterDb.get(id).id;\n }\n return id;\n}, \"getAnchorId\");\nvar adjustClustersAndEdges = / @__PURE__ / __name((graph, depth) => {\n if (!graph \|\| depth > 10) {\n log.debug(\"Opting out, no graph \");\n return;\n } else {\n log.debug(\"Opting in, graph \");\n }\n graph.nodes().forEach(function(id) {\n const children = graph.children(id);\n if (children.length > 0) {\n log.warn(\n \"Cluster identified\",\n id,\n \" Replacement id in edges: \",\n findNonClusterChild(id, graph, id)\n );\n descendants.set(id, extractDescendants(id, graph));\n clusterDb.set(id, { id: findNonClusterChild(id, graph, id), clusterData: graph.node(id) });\n }\n });\n graph.nodes().forEach(function(id) {\n const children = graph.children(id);\n const edges = graph.edges();\n if (children.length > 0) {\n log.debug(\"Cluster identified\", id, descendants);\n edges.forEach((edge) => {\n const d1 = isDescendant(edge.v, id);\n const d2 = isDescendant(edge.w, id);\n if (d1 ^ d2) {\n log.warn(\"Edge: \", edge, \" leaves cluster \", id);\n log.warn(\"Descendants of XXX \", id, \": \", descendants.get(id));\n clusterDb.get(id).externalConnections = true;\n }\n });\n } else {\n log.debug(\"Not a cluster \", id, descendants);\n }\n });\n for (let id of clusterDb.keys()) {\n const nonClusterChild = clusterDb.get(id).id;\n const parent = graph.parent(nonClusterChild);\n if (parent !== id && clusterDb.has(parent) && !clusterDb.get(parent).externalConnections) {\n clusterDb.get(id).id = parent;\n }\n }\n graph.edges().forEach(function(e) {\n const edge = graph.edge(e);\n log.warn(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(e));\n log.warn(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(graph.edge(e)));\n let v = e.v;\n let w = e.w;\n log.warn(\n \"Fix XXX\",\n clusterDb,\n \"ids:\",\n e.v,\n e.w,\n \"Translating: \",\n clusterDb.get(e.v),\n \" --- \",\n clusterDb.get(e.w)\n );\n if (clusterDb.get(e.v) \|\| clusterDb.get(e.w)) {\n log.warn(\"Fixing and trying - removing XXX\", e.v, e.w, e.name);\n v = getAnchorId(e.v);\n w = getAnchorId(e.w);\n graph.removeEdge(e.v, e.w, e.name);\n if (v !== e.v) {\n const parent = graph.parent(v);\n clusterDb.get(parent).externalConnections = true;\n edge.fromCluster = e.v;\n }\n if (w !== e.w) {\n const parent = graph.parent(w);\n clusterDb.get(parent).externalConnections = true;\n edge.toCluster = e.w;\n }\n log.warn(\"Fix Replacing with XXX\", v, w, e.name);\n graph.setEdge(v, w, edge, e.name);\n }\n });\n log.warn(\"Adjusted Graph\", graphlibJson.write(graph));\n extractor(graph, 0);\n log.trace(clusterDb);\n}, \"adjustClustersAndEdges\");\nvar extractor = / @__PURE__ / __name((graph, depth) => {\n log.warn(\"extractor - \", depth, graphlibJson.write(graph), graph.children(\"D\"));\n if (depth > 10) {\n log.error(\"Bailing out\");\n return;\n }\n let nodes = graph.nodes();\n let hasChildren = false;\n for (const node of nodes) {\n const children = graph.children(node);\n hasChildren = hasChildren \|\| children.length > 0;\n }\n if (!hasChildren) {\n log.debug(\"Done, no node has children\", graph.nodes());\n return;\n }\n log.debug(\"Nodes = \", nodes, depth);\n for (const node of nodes) {\n log.debug(\n \"Extracting node\",\n node,\n clusterDb,\n clusterDb.has(node) && !clusterDb.get(node).externalConnections,\n !graph.parent(node),\n graph.node(node),\n graph.children(\"D\"),\n \" Depth \",\n depth\n );\n if (!clusterDb.has(node)) {\n log.debug(\"Not a cluster\", node, depth);\n } else if (!clusterDb.get(node).externalConnections && graph.children(node) && graph.children(node).length > 0) {\n log.warn(\n \"Cluster without external connections, without a parent and with children\",\n node,\n depth\n );\n const graphSettings = graph.graph();\n let dir = graphSettings.rankdir === \"TB\" ? \"LR\" : \"TB\";\n if (clusterDb.get(node)?.clusterData?.dir) {\n dir = clusterDb.get(node).clusterData.dir;\n log.warn(\"Fixing dir\", clusterDb.get(node).clusterData.dir, dir);\n }\n const clusterGraph = new graphlib.Graph({\n multigraph: true,\n compound: true\n }).setGraph({\n rankdir: dir,\n nodesep: 50,\n ranksep: 50,\n marginx: 8,\n marginy: 8\n }).setDefaultEdgeLabel(function() {\n return {};\n });\n log.warn(\"Old graph before copy\", graphlibJson.write(graph));\n copy(node, graph, clusterGraph, node);\n graph.setNode(node, {\n clusterNode: true,\n id: node,\n clusterData: clusterDb.get(node).clusterData,\n label: clusterDb.get(node).label,\n graph: clusterGraph\n });\n log.warn(\"New graph after copy node: (\", node, \")\", graphlibJson.write(clusterGraph));\n log.debug(\"Old graph after copy\", graphlibJson.write(graph));\n } else {\n log.warn(\n \"Cluster * \",\n node,\n \" *not meeting the criteria !externalConnections:\",\n !clusterDb.get(node).externalConnections,\n \" no parent: \",\n !graph.parent(node),\n \" children \",\n graph.children(node) && graph.children(node).length > 0,\n graph.children(\"D\"),\n depth\n );\n log.debug(clusterDb);\n }\n }\n nodes = graph.nodes();\n log.warn(\"New list of nodes\", nodes);\n for (const node of nodes) {\n const data = graph.node(node);\n log.warn(\" Now next level\", node, data);\n if (data?.clusterNode) {\n extractor(data.graph, depth + 1);\n }\n }\n}, \"extractor\");\nvar sorter = / @__PURE__ / __name((graph, nodes) => {\n if (nodes.length === 0) {\n return [];\n }\n let result = Object.assign([], nodes);\n nodes.forEach((node) => {\n const children = graph.children(node);\n const sorted = sorter(graph, children);\n result = [...result, ...sorted];\n });\n return result;\n}, \"sorter\");\nvar sortNodesByHierarchy = / @__PURE__ / __name((graph) => sorter(graph, graph.children()), \"sortNodesByHierarchy\");\n\n// src/rendering-util/layout-algorithms/dagre/index.js\nvar recursiveRender = / @__PURE__ / __name(async (_elem, graph, diagramType, id, parentCluster, siteConfig) => {\n log.warn(\"Graph in recursive render:XAX\", graphlibJson2.write(graph), parentCluster);\n const dir = graph.graph().rankdir;\n log.trace(\"Dir in recursive render - dir:\", dir);\n const elem = _elem.insert(\"g\").attr(\"class\", \"root\");\n if (!graph.nodes()) {\n log.info(\"No nodes found for\", graph);\n } else {\n log.info(\"Recursive render XXX\", graph.nodes());\n }\n if (graph.edges().length > 0) {\n log.info(\"Recursive edges\", graph.edge(graph.edges()[0]));\n }\n const clusters = elem.insert(\"g\").attr(\"class\", \"clusters\");\n const edgePaths = elem.insert(\"g\").attr(\"class\", \"edgePaths\");\n const edgeLabels = elem.insert(\"g\").attr(\"class\", \"edgeLabels\");\n const nodes = elem.insert(\"g\").attr(\"class\", \"nodes\");\n await Promise.all(\n graph.nodes().map(async function(v) {\n const node = graph.node(v);\n if (parentCluster !== void 0) {\n const data = JSON.parse(JSON.stringify(parentCluster.clusterData));\n log.trace(\n \"Setting data for parent cluster XXX\\n Node.id = \",\n v,\n \"\\n data=\",\n data.height,\n \"\\nParent cluster\",\n parentCluster.height\n );\n graph.setNode(parentCluster.id, data);\n if (!graph.parent(v)) {\n log.trace(\"Setting parent\", v, parentCluster.id);\n graph.setParent(v, parentCluster.id, data);\n }\n }\n log.info(\"(Insert) Node XXX\" + v + \": \" + JSON.stringify(graph.node(v)));\n if (node?.clusterNode) {\n log.info(\"Cluster identified XBX\", v, node.width, graph.node(v));\n const { ranksep, nodesep } = graph.graph();\n node.graph.setGraph({\n ...node.graph.graph(),\n ranksep: ranksep + 25,\n nodesep\n });\n const o = await recursiveRender(\n nodes,\n node.graph,\n diagramType,\n id,\n graph.node(v),\n siteConfig\n );\n const newEl = o.elem;\n updateNodeBounds(node, newEl);\n node.diff = o.diff \|\| 0;\n log.info(\n \"New compound node after recursive render XAX\",\n v,\n \"width\",\n // node,\n node.width,\n \"height\",\n node.height\n // node.x,\n // node.y\n );\n setNodeElem(newEl, node);\n } else {\n if (graph.children(v).length > 0) {\n log.trace(\n \"Cluster - the non recursive path XBX\",\n v,\n node.id,\n node,\n node.width,\n \"Graph:\",\n graph\n );\n log.trace(findNonClusterChild(node.id, graph));\n clusterDb.set(node.id, { id: findNonClusterChild(node.id, graph), node });\n } else {\n log.trace(\"Node - the non recursive path XAX\", v, nodes, graph.node(v), dir);\n await insertNode(nodes, graph.node(v), { config: siteConfig, dir });\n }\n }\n })\n );\n const processEdges = / @__PURE__ / __name(async () => {\n const edgePromises = graph.edges().map(async function(e) {\n const edge = graph.edge(e.v, e.w, e.name);\n log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(e));\n log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \", e, \" \", JSON.stringify(graph.edge(e)));\n log.info(\n \"Fix\",\n clusterDb,\n \"ids:\",\n e.v,\n e.w,\n \"Translating: \",\n clusterDb.get(e.v),\n clusterDb.get(e.w)\n );\n await insertEdgeLabel(edgeLabels, edge);\n });\n await Promise.all(edgePromises);\n }, \"processEdges\");\n await processEdges();\n log.info(\"Graph before layout:\", JSON.stringify(graphlibJson2.write(graph)));\n log.info(\"############################################# XXX\");\n log.info(\"### Layout ### XXX\");\n log.info(\"############################################# XXX\");\n dagreLayout(graph);\n log.info(\"Graph after layout:\", JSON.stringify(graphlibJson2.write(graph)));\n let diff = 0;\n let { subGraphTitleTotalMargin } = getSubGraphTitleMargins(siteConfig);\n await Promise.all(\n sortNodesByHierarchy(graph).map(async function(v) {\n const node = graph.node(v);\n log.info(\n \"Position XBX => \" + v + \": (\" + node.x,\n \",\" + node.y,\n \") width: \",\n node.width,\n \" height: \",\n node.height\n );\n if (node?.clusterNode) {\n node.y += subGraphTitleTotalMargin;\n log.info(\n \"A tainted cluster node XBX1\",\n v,\n node.id,\n node.width,\n node.height,\n node.x,\n node.y,\n graph.parent(v)\n );\n clusterDb.get(node.id).node = node;\n positionNode(node);\n } else {\n if (graph.children(v).length > 0) {\n log.info(\n \"A pure cluster node XBX1\",\n v,\n node.id,\n node.x,\n node.y,\n node.width,\n node.height,\n graph.parent(v)\n );\n node.height += subGraphTitleTotalMargin;\n graph.node(node.parentId);\n const halfPadding = node?.padding / 2 \|\| 0;\n const labelHeight = node?.labelBBox?.height \|\| 0;\n const offsetY = labelHeight - halfPadding \|\| 0;\n log.debug(\"OffsetY\", offsetY, \"labelHeight\", labelHeight, \"halfPadding\", halfPadding);\n await insertCluster(clusters, node);\n clusterDb.get(node.id).node = node;\n } else {\n const parent = graph.node(node.parentId);\n node.y += subGraphTitleTotalMargin / 2;\n log.info(\n \"A regular node XBX1 - using the padding\",\n node.id,\n \"parent\",\n node.parentId,\n node.width,\n node.height,\n node.x,\n node.y,\n \"offsetY\",\n node.offsetY,\n \"parent\",\n parent,\n parent?.offsetY,\n node\n );\n positionNode(node);\n }\n }\n })\n );\n graph.edges().forEach(function(e) {\n const edge = graph.edge(e);\n log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(edge), edge);\n edge.points.forEach((point) => point.y += subGraphTitleTotalMargin / 2);\n const startNode = graph.node(e.v);\n var endNode = graph.node(e.w);\n const paths = insertEdge(edgePaths, edge, clusterDb, diagramType, startNode, endNode, id);\n positionEdgeLabel(edge, paths);\n });\n graph.nodes().forEach(function(v) {\n const n = graph.node(v);\n log.info(v, n.type, n.diff);\n if (n.isGroup) {\n diff = n.diff;\n }\n });\n log.warn(\"Returning from recursive render XAX\", elem, diff);\n return { elem, diff };\n}, \"recursiveRender\");\nvar render = / @__PURE__ */ __name(async (data4Layout, svg) => {\n const graph = new graphlib2.Graph({\n multigraph: true,\n compound: true\n }).setGraph({\n rankdir: data4Layout.direction,\n nodesep: data4Layout.config?.nodeSpacing \|\| data4Layout.config?.flowchart?.nodeSpacing \|\| data4Layout.nodeSpacing,\n ranksep: data4Layout.config?.rankSpacing \|\| data4Layout.config?.flowchart?.rankSpacing \|\| data4Layout.rankSpacing,\n marginx: 8,\n marginy: 8\n }).setDefaultEdgeLabel(function() {\n return {};\n });\n const element = svg.select(\"g\");\n markers_default(element, data4Layout.markers, data4Layout.type, data4Layout.diagramId);\n clear3();\n clear2();\n clear();\n clear4();\n data4Layout.nodes.forEach((node) => {\n graph.setNode(node.id, { ...node });\n if (node.parentId) {\n graph.setParent(node.id, node.parentId);\n }\n });\n log.debug(\"Edges:\", data4Layout.edges);\n data4Layout.edges.forEach((edge) => {\n if (edge.start === edge.end) {\n const nodeId = edge.start;\n const specialId1 = nodeId + \"---\" + nodeId + \"---1\";\n const specialId2 = nodeId + \"---\" + nodeId + \"---2\";\n const node = graph.node(nodeId);\n graph.setNode(specialId1, {\n domId: specialId1,\n id: specialId1,\n parentId: node.parentId,\n labelStyle: \"\",\n label: \"\",\n padding: 0,\n shape: \"labelRect\",\n // shape: 'rect',\n style: \"\",\n width: 10,\n height: 10\n });\n graph.setParent(specialId1, node.parentId);\n graph.setNode(specialId2, {\n domId: specialId2,\n id: specialId2,\n parentId: node.parentId,\n labelStyle: \"\",\n padding: 0,\n // shape: 'rect',\n shape: \"labelRect\",\n label: \"\",\n style: \"\",\n width: 10,\n height: 10\n });\n graph.setParent(specialId2, node.parentId);\n const edge1 = structuredClone(edge);\n const edgeMid = structuredClone(edge);\n const edge2 = structuredClone(edge);\n edge1.label = \"\";\n edge1.arrowTypeEnd = \"none\";\n edge1.id = nodeId + \"-cyclic-special-1\";\n edgeMid.arrowTypeStart = \"none\";\n edgeMid.arrowTypeEnd = \"none\";\n edgeMid.id = nodeId + \"-cyclic-special-mid\";\n edge2.label = \"\";\n if (node.isGroup) {\n edge1.fromCluster = nodeId;\n edge2.toCluster = nodeId;\n }\n edge2.id = nodeId + \"-cyclic-special-2\";\n edge2.arrowTypeStart = \"none\";\n graph.setEdge(nodeId, specialId1, edge1, nodeId + \"-cyclic-special-0\");\n graph.setEdge(specialId1, specialId2, edgeMid, nodeId + \"-cyclic-special-1\");\n graph.setEdge(specialId2, nodeId, edge2, nodeId + \"-cyc<lic-special-2\");\n } else {\n graph.setEdge(edge.start, edge.end, { ...edge }, edge.id);\n }\n });\n log.warn(\"Graph at first:\", JSON.stringify(graphlibJson2.write(graph)));\n adjustClustersAndEdges(graph);\n log.warn(\"Graph after XAX:\", JSON.stringify(graphlibJson2.write(graph)));\n const siteConfig = getConfig();\n await recursiveRender(\n element,\n graph,\n data4Layout.type,\n data4Layout.diagramId,\n void 0,\n siteConfig\n );\n}, \"render\");\nexport {\n render\n};\n"],"names":["write","g","json","writeNodes","writeEdges","_.isUndefined","_.clone","_.map","v","nodeValue","parent","node","e","edgeValue","edge","clusterDb","descendants","parents","clear4","__name","isDescendant","id","ancestorId","ancestorDescendants","log","edgeInCluster","clusterId","clusterDescendants","copy","graph","newGraph","rootId","nodes","data","edges","data2","extractDescendants","children","res","child","findCommonEdges","id1","id2","edges1","edges2","edges1Prim","edges2Prim","edgeIn1","findNonClusterChild","reserve","_id","commonEdges","getAnchorId","adjustClustersAndEdges","depth","d1","d2","nonClusterChild","w","graphlibJson.write","extractor","hasChildren","dir","clusterGraph","graphlib.Graph","sorter","result","sorted","sortNodesByHierarchy","recursiveRender","_elem","diagramType","parentCluster","siteConfig","graphlibJson2.write","elem","clusters","edgePaths","edgeLabels","ranksep","nodesep","o","newEl","updateNodeBounds","setNodeElem","insertNode","edgePromises","insertEdgeLabel","dagreLayout","diff","subGraphTitleTotalMargin","getSubGraphTitleMargins","positionNode","halfPadding","labelHeight","offsetY","insertCluster","point","startNode","endNode","paths","insertEdge","positionEdgeLabel","n","render","data4Layout","svg","graphlib2.Graph","element","markers_default","clear3","clear2","clear","nodeId","specialId1","specialId2","edge1","edgeMid","edge2","getConfig"],"mappings":";;;;;;AAKA,SAASA,EAAMC,GAAG;AAChB,MAAIC,IAAO;AAAA,IACT,SAAS;AAAA,MACP,UAAUD,EAAE,WAAU;AAAA,MACtB,YAAYA,EAAE,aAAY;AAAA,MAC1B,UAAUA,EAAE,WAAU;AAAA,IAC5B;AAAA,IACI,OAAOE,GAAWF,CAAC;AAAA,IACnB,OAAOG,GAAWH,CAAC;AAAA,EACvB;AACE,SAAKI,EAAcJ,EAAE,MAAK,CAAE,MAC1BC,EAAK,QAAQI,EAAQL,EAAE,MAAK,CAAE,IAEzBC;AACT;AAEA,SAASC,GAAWF,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUO,GAAG;AACnC,QAAIC,IAAYR,EAAE,KAAKO,CAAC,GACpBE,IAAST,EAAE,OAAOO,CAAC,GACnBG,IAAO,EAAE,GAAGH,EAAC;AACjB,WAAKH,EAAcI,CAAS,MAC1BE,EAAK,QAAQF,IAEVJ,EAAcK,CAAM,MACvBC,EAAK,SAASD,IAETC;AAAA,EACT,CAAC;AACH;AAEA,SAASP,GAAWH,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUW,GAAG;AACnC,QAAIC,IAAYZ,EAAE,KAAKW,CAAC,GACpBE,IAAO,EAAE,GAAGF,EAAE,GAAG,GAAGA,EAAE,EAAC;AAC3B,WAAKP,EAAcO,EAAE,IAAI,MACvBE,EAAK,OAAOF,EAAE,OAEXP,EAAcQ,CAAS,MAC1BC,EAAK,QAAQD,IAERC;AAAA,EACT,CAAC;AACH;ACTA,IAAIC,IAA4B,oBAAI,IAAG,GACnCC,IAA8B,oBAAI,IAAG,GACrCC,IAA0B,oBAAI,IAAG,GACjCC,KAAyB,gBAAAC,EAAO,MAAM;AACxC,EAAAH,EAAY,MAAK,GACjBC,EAAQ,MAAK,GACbF,EAAU,MAAK;AACjB,GAAG,OAAO,GACNK,IAA+B,gBAAAD,EAAO,CAACE,GAAIC,MAAe;AAC5D,QAAMC,IAAsBP,EAAY,IAAIM,CAAU,KAAK,CAAA;AAC3D,SAAAE,EAAI,MAAM,mBAAmBF,GAAY,KAAKD,GAAI,OAAOE,EAAoB,SAASF,CAAE,CAAC,GAClFE,EAAoB,SAASF,CAAE;AACxC,GAAG,cAAc,GACbI,KAAgC,gBAAAN,EAAO,CAACL,GAAMY,MAAc;AAC9D,QAAMC,IAAqBX,EAAY,IAAIU,CAAS,KAAK,CAAA;AAGzD,SAFAF,EAAI,KAAK,mBAAmBE,GAAW,QAAQC,CAAkB,GACjEH,EAAI,KAAK,YAAYV,CAAI,GACrBA,EAAK,MAAMY,KAAaZ,EAAK,MAAMY,IAC9B,KAEJC,IAIEA,EAAmB,SAASb,EAAK,CAAC,KAAKM,EAAaN,EAAK,GAAGY,CAAS,KAAKN,EAAaN,EAAK,GAAGY,CAAS,KAAKC,EAAmB,SAASb,EAAK,CAAC,KAHpJU,EAAI,MAAM,UAAUE,GAAW,qBAAqB,GAC7C;AAGX,GAAG,eAAe,GACdE,IAAuB,gBAAAT,EAAO,CAACO,GAAWG,GAAOC,GAAUC,MAAW;AACxE,EAAAP,EAAI;AAAA,IACF;AAAA,IACAE;AAAA,IACA;AAAA,IACAK;AAAA,IACA;AAAA,IACAF,EAAM,KAAKH,CAAS;AAAA,IACpBK;AAAA,EACJ;AACE,QAAMC,IAAQH,EAAM,SAASH,CAAS,KAAK,CAAA;AAC3C,EAAIA,MAAcK,KAChBC,EAAM,KAAKN,CAAS,GAEtBF,EAAI,KAAK,6BAA6BE,GAAW,SAASM,CAAK,GAC/DA,EAAM,QAAQ,CAACrB,MAAS;AACtB,QAAIkB,EAAM,SAASlB,CAAI,EAAE,SAAS;AAChC,MAAAiB,EAAKjB,GAAMkB,GAAOC,GAAUC,CAAM;AAAA,SAC7B;AACL,YAAME,IAAOJ,EAAM,KAAKlB,CAAI;AAC5B,MAAAa,EAAI,KAAK,OAAOb,GAAM,QAAQoB,GAAQ,iBAAiBL,CAAS,GAChEI,EAAS,QAAQnB,GAAMsB,CAAI,GACvBF,MAAWF,EAAM,OAAOlB,CAAI,MAC9Ba,EAAI,KAAK,kBAAkBb,GAAMkB,EAAM,OAAOlB,CAAI,CAAC,GACnDmB,EAAS,UAAUnB,GAAMkB,EAAM,OAAOlB,CAAI,CAAC,IAEzCe,MAAcK,KAAUpB,MAASe,KACnCF,EAAI,MAAM,kBAAkBb,GAAMe,CAAS,GAC3CI,EAAS,UAAUnB,GAAMe,CAAS,MAElCF,EAAI,KAAK,YAAYE,GAAW,QAAQK,GAAQ,QAAQF,EAAM,KAAKH,CAAS,GAAGK,CAAM,GACrFP,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA;AAAA,QACAe,MAAcK;AAAA,QACd;AAAA,QACApB,MAASe;AAAA,MACnB;AAEM,YAAMQ,IAAQL,EAAM,MAAMlB,CAAI;AAC9B,MAAAa,EAAI,MAAM,iBAAiBU,CAAK,GAChCA,EAAM,QAAQ,CAACpB,MAAS;AACtB,QAAAU,EAAI,KAAK,QAAQV,CAAI;AACrB,cAAMqB,IAAQN,EAAM,KAAKf,EAAK,GAAGA,EAAK,GAAGA,EAAK,IAAI;AAClD,QAAAU,EAAI,KAAK,aAAaW,GAAOJ,CAAM;AACnC,YAAI;AACF,UAAIN,GAAcX,GAAMiB,CAAM,KAC5BP,EAAI,KAAK,eAAeV,EAAK,GAAGA,EAAK,GAAGqB,GAAOrB,EAAK,IAAI,GACxDgB,EAAS,QAAQhB,EAAK,GAAGA,EAAK,GAAGqB,GAAOrB,EAAK,IAAI,GACjDU,EAAI,KAAK,mBAAmBM,EAAS,MAAK,GAAIA,EAAS,KAAKA,EAAS,QAAQ,CAAC,CAAC,CAAC,KAEhFN,EAAI;AAAA,YACF;AAAA,YACAV,EAAK;AAAA,YACL;AAAA,YACAA,EAAK;AAAA,YACL;AAAA,YACAiB;AAAA,YACA;AAAA,YACAL;AAAA,UACd;AAAA,QAEQ,SAASd,GAAG;AACV,UAAAY,EAAI,MAAMZ,CAAC;AAAA,QACb;AAAA,MACF,CAAC;AAAA,IACH;AACA,IAAAY,EAAI,MAAM,iBAAiBb,CAAI,GAC/BkB,EAAM,WAAWlB,CAAI;AAAA,EACvB,CAAC;AACH,GAAG,MAAM,GACLyB,IAAqC,gBAAAjB,EAAO,CAACE,GAAIQ,MAAU;AAC7D,QAAMQ,IAAWR,EAAM,SAASR,CAAE;AAClC,MAAIiB,IAAM,CAAC,GAAGD,CAAQ;AACtB,aAAWE,KAASF;AAClB,IAAApB,EAAQ,IAAIsB,GAAOlB,CAAE,GACrBiB,IAAM,CAAC,GAAGA,GAAK,GAAGF,EAAmBG,GAAOV,CAAK,CAAC;AAEpD,SAAOS;AACT,GAAG,oBAAoB,GACnBE,KAAkC,gBAAArB,EAAO,CAACU,GAAOY,GAAKC,MAAQ;AAChE,QAAMC,IAASd,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAM2B,KAAO3B,EAAK,MAAM2B,CAAG,GACxEG,IAASf,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAM4B,KAAO5B,EAAK,MAAM4B,CAAG,GACxEG,IAAaF,EAAO,IAAI,CAAC7B,OACtB,EAAE,GAAGA,EAAK,MAAM2B,IAAMC,IAAM5B,EAAK,GAAG,GAAGA,EAAK,MAAM2B,IAAMA,IAAM3B,EAAK,EAAC,EAC5E,GACKgC,IAAaF,EAAO,IAAI,CAAC9B,OACtB,EAAE,GAAGA,EAAK,GAAG,GAAGA,EAAK,EAAC,EAC9B;AAID,SAHe+B,EAAW,OAAO,CAACE,MACzBD,EAAW,KAAK,CAAChC,MAASiC,EAAQ,MAAMjC,EAAK,KAAKiC,EAAQ,MAAMjC,EAAK,CAAC,CAC9E;AAEH,GAAG,iBAAiB,GAChBkC,IAAsC,gBAAA7B,EAAO,CAACE,GAAIQ,GAAOH,MAAc;AACzE,QAAMW,IAAWR,EAAM,SAASR,CAAE;AAElC,MADAG,EAAI,MAAM,6BAA6BH,GAAIgB,CAAQ,GAC/CA,EAAS,SAAS;AACpB,WAAOhB;AAET,MAAI4B;AACJ,aAAWV,KAASF,GAAU;AAC5B,UAAMa,IAAMF,EAAoBT,GAAOV,GAAOH,CAAS,GACjDyB,IAAcX,GAAgBX,GAAOH,GAAWwB,CAAG;AACzD,QAAIA;AACF,UAAIC,EAAY,SAAS;AACvB,QAAAF,IAAUC;AAAA;AAEV,eAAOA;AAAA,EAGb;AACA,SAAOD;AACT,GAAG,qBAAqB,GACpBG,IAA8B,gBAAAjC,EAAO,CAACE,MACpC,CAACN,EAAU,IAAIM,CAAE,KAGjB,CAACN,EAAU,IAAIM,CAAE,EAAE,sBACdA,IAELN,EAAU,IAAIM,CAAE,IACXN,EAAU,IAAIM,CAAE,EAAE,KAEpBA,GACN,aAAa,GACZgC,KAAyC,gBAAAlC,EAAO,CAACU,GAAOyB,MAAU;AACpE,MAAI,CAACzB,KAASyB,IAAQ,IAAI;AACxB,IAAA9B,EAAI,MAAM,uBAAuB;AACjC;AAAA,EACF;AACE,IAAAA,EAAI,MAAM,mBAAmB;AAE/B,EAAAK,EAAM,MAAK,EAAG,QAAQ,SAASR,GAAI;AAEjC,IADiBQ,EAAM,SAASR,CAAE,EACrB,SAAS,MACpBG,EAAI;AAAA,MACF;AAAA,MACAH;AAAA,MACA;AAAA,MACA2B,EAAoB3B,GAAIQ,GAAOR,CAAE;AAAA,IACzC,GACML,EAAY,IAAIK,GAAIe,EAAmBf,GAAIQ,CAAK,CAAC,GACjDd,EAAU,IAAIM,GAAI,EAAE,IAAI2B,EAAoB3B,GAAIQ,GAAOR,CAAE,GAAG,aAAaQ,EAAM,KAAKR,CAAE,EAAC,CAAE;AAAA,EAE7F,CAAC,GACDQ,EAAM,MAAK,EAAG,QAAQ,SAASR,GAAI;AACjC,UAAMgB,IAAWR,EAAM,SAASR,CAAE,GAC5Ba,IAAQL,EAAM,MAAK;AACzB,IAAIQ,EAAS,SAAS,KACpBb,EAAI,MAAM,sBAAsBH,GAAIL,CAAW,GAC/CkB,EAAM,QAAQ,CAACpB,MAAS;AACtB,YAAMyC,IAAKnC,EAAaN,EAAK,GAAGO,CAAE,GAC5BmC,IAAKpC,EAAaN,EAAK,GAAGO,CAAE;AAClC,MAAIkC,IAAKC,MACPhC,EAAI,KAAK,UAAUV,GAAM,oBAAoBO,CAAE,GAC/CG,EAAI,KAAK,uBAAuBH,GAAI,MAAML,EAAY,IAAIK,CAAE,CAAC,GAC7DN,EAAU,IAAIM,CAAE,EAAE,sBAAsB;AAAA,IAE5C,CAAC,KAEDG,EAAI,MAAM,kBAAkBH,GAAIL,CAAW;AAAA,EAE/C,CAAC;AACD,WAASK,KAAMN,EAAU,QAAQ;AAC/B,UAAM0C,IAAkB1C,EAAU,IAAIM,CAAE,EAAE,IACpCX,IAASmB,EAAM,OAAO4B,CAAe;AAC3C,IAAI/C,MAAWW,KAAMN,EAAU,IAAIL,CAAM,KAAK,CAACK,EAAU,IAAIL,CAAM,EAAE,wBACnEK,EAAU,IAAIM,CAAE,EAAE,KAAKX;AAAA,EAE3B;AACA,EAAAmB,EAAM,MAAK,EAAG,QAAQ,SAASjB,GAAG;AAChC,UAAME,IAAOe,EAAM,KAAKjB,CAAC;AACzB,IAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUA,CAAC,CAAC,GAChEY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUiB,EAAM,KAAKjB,CAAC,CAAC,CAAC;AAC5E,QAAIJ,IAAII,EAAE,GACN8C,IAAI9C,EAAE;AAYV,QAXAY,EAAI;AAAA,MACF;AAAA,MACAT;AAAA,MACA;AAAA,MACAH,EAAE;AAAA,MACFA,EAAE;AAAA,MACF;AAAA,MACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,MACjB;AAAA,MACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,IACvB,GACQG,EAAU,IAAIH,EAAE,CAAC,KAAKG,EAAU,IAAIH,EAAE,CAAC,GAAG;AAK5C,UAJAY,EAAI,KAAK,oCAAoCZ,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI,GAC7DJ,IAAI4C,EAAYxC,EAAE,CAAC,GACnB8C,IAAIN,EAAYxC,EAAE,CAAC,GACnBiB,EAAM,WAAWjB,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI,GAC7BJ,MAAMI,EAAE,GAAG;AACb,cAAMF,IAASmB,EAAM,OAAOrB,CAAC;AAC7B,QAAAO,EAAU,IAAIL,CAAM,EAAE,sBAAsB,IAC5CI,EAAK,cAAcF,EAAE;AAAA,MACvB;AACA,UAAI8C,MAAM9C,EAAE,GAAG;AACb,cAAMF,IAASmB,EAAM,OAAO6B,CAAC;AAC7B,QAAA3C,EAAU,IAAIL,CAAM,EAAE,sBAAsB,IAC5CI,EAAK,YAAYF,EAAE;AAAA,MACrB;AACA,MAAAY,EAAI,KAAK,0BAA0BhB,GAAGkD,GAAG9C,EAAE,IAAI,GAC/CiB,EAAM,QAAQrB,GAAGkD,GAAG5C,GAAMF,EAAE,IAAI;AAAA,IAClC;AAAA,EACF,CAAC,GACDY,EAAI,KAAK,kBAAkBmC,EAAmB9B,CAAK,CAAC,GACpD+B,EAAU/B,GAAO,CAAC,GAClBL,EAAI,MAAMT,CAAS;AACrB,GAAG,wBAAwB,GACvB6C,IAA4B,gBAAAzC,EAAO,CAACU,GAAOyB,MAAU;AAEvD,MADA9B,EAAI,KAAK,gBAAgB8B,GAAOK,EAAmB9B,CAAK,GAAGA,EAAM,SAAS,GAAG,CAAC,GAC1EyB,IAAQ,IAAI;AACd,IAAA9B,EAAI,MAAM,aAAa;AACvB;AAAA,EACF;AACA,MAAIQ,IAAQH,EAAM,MAAK,GACnBgC,IAAc;AAClB,aAAWlD,KAAQqB,GAAO;AACxB,UAAMK,IAAWR,EAAM,SAASlB,CAAI;AACpC,IAAAkD,IAAcA,KAAexB,EAAS,SAAS;AAAA,EACjD;AACA,MAAI,CAACwB,GAAa;AAChB,IAAArC,EAAI,MAAM,8BAA8BK,EAAM,MAAK,CAAE;AACrD;AAAA,EACF;AACA,EAAAL,EAAI,MAAM,YAAYQ,GAAOsB,CAAK;AAClC,aAAW3C,KAAQqB;AAYjB,QAXAR,EAAI;AAAA,MACF;AAAA,MACAb;AAAA,MACAI;AAAA,MACAA,EAAU,IAAIJ,CAAI,KAAK,CAACI,EAAU,IAAIJ,CAAI,EAAE;AAAA,MAC5C,CAACkB,EAAM,OAAOlB,CAAI;AAAA,MAClBkB,EAAM,KAAKlB,CAAI;AAAA,MACfkB,EAAM,SAAS,GAAG;AAAA,MAClB;AAAA,MACAyB;AAAA,IACN,GACQ,CAACvC,EAAU,IAAIJ,CAAI;AACrB,MAAAa,EAAI,MAAM,iBAAiBb,GAAM2C,CAAK;AAAA,aAC7B,CAACvC,EAAU,IAAIJ,CAAI,EAAE,uBAAuBkB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS,GAAG;AAC9G,MAAAa,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA2C;AAAA,MACR;AAEM,UAAIQ,IADkBjC,EAAM,MAAK,EACT,YAAY,OAAO,OAAO;AAClD,MAAId,EAAU,IAAIJ,CAAI,GAAG,aAAa,QACpCmD,IAAM/C,EAAU,IAAIJ,CAAI,EAAE,YAAY,KACtCa,EAAI,KAAK,cAAcT,EAAU,IAAIJ,CAAI,EAAE,YAAY,KAAKmD,CAAG;AAEjE,YAAMC,IAAe,IAAIC,EAAe;AAAA,QACtC,YAAY;AAAA,QACZ,UAAU;AAAA,MAClB,CAAO,EAAE,SAAS;AAAA,QACV,SAASF;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,MACjB,CAAO,EAAE,oBAAoB,WAAW;AAChC,eAAO,CAAA;AAAA,MACT,CAAC;AACD,MAAAtC,EAAI,KAAK,yBAAyBmC,EAAmB9B,CAAK,CAAC,GAC3DD,EAAKjB,GAAMkB,GAAOkC,GAAcpD,CAAI,GACpCkB,EAAM,QAAQlB,GAAM;AAAA,QAClB,aAAa;AAAA,QACb,IAAIA;AAAA,QACJ,aAAaI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACjC,OAAOI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QAC3B,OAAOoD;AAAA,MACf,CAAO,GACDvC,EAAI,KAAK,gCAAgCb,GAAM,KAAKgD,EAAmBI,CAAY,CAAC,GACpFvC,EAAI,MAAM,wBAAwBmC,EAAmB9B,CAAK,CAAC;AAAA,IAC7D;AACE,MAAAL,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA;AAAA,QACA,CAACI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACrB;AAAA,QACA,CAACkB,EAAM,OAAOlB,CAAI;AAAA,QAClB;AAAA,QACAkB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS;AAAA,QACtDkB,EAAM,SAAS,GAAG;AAAA,QAClByB;AAAA,MACR,GACM9B,EAAI,MAAMT,CAAS;AAGvB,EAAAiB,IAAQH,EAAM,MAAK,GACnBL,EAAI,KAAK,qBAAqBQ,CAAK;AACnC,aAAWrB,KAAQqB,GAAO;AACxB,UAAMC,IAAOJ,EAAM,KAAKlB,CAAI;AAC5B,IAAAa,EAAI,KAAK,mBAAmBb,GAAMsB,CAAI,GAClCA,GAAM,eACR2B,EAAU3B,EAAK,OAAOqB,IAAQ,CAAC;AAAA,EAEnC;AACF,GAAG,WAAW,GACVW,IAAyB,gBAAA9C,EAAO,CAACU,GAAOG,MAAU;AACpD,MAAIA,EAAM,WAAW;AACnB,WAAO,CAAA;AAET,MAAIkC,IAAS,OAAO,OAAO,CAAA,GAAIlC,CAAK;AACpC,SAAAA,EAAM,QAAQ,CAACrB,MAAS;AACtB,UAAM0B,IAAWR,EAAM,SAASlB,CAAI,GAC9BwD,IAASF,EAAOpC,GAAOQ,CAAQ;AACrC,IAAA6B,IAAS,CAAC,GAAGA,GAAQ,GAAGC,CAAM;AAAA,EAChC,CAAC,GACMD;AACT,GAAG,QAAQ,GACPE,KAAuC,gBAAAjD,EAAO,CAACU,MAAUoC,EAAOpC,GAAOA,EAAM,UAAU,GAAG,sBAAsB,GAGhHwC,IAAkC,gBAAAlD,EAAO,OAAOmD,GAAOzC,GAAO0C,GAAalD,GAAImD,GAAeC,MAAe;AAC/G,EAAAjD,EAAI,KAAK,iCAAiCkD,EAAoB7C,CAAK,GAAG2C,CAAa;AACnF,QAAMV,IAAMjC,EAAM,MAAK,EAAG;AAC1B,EAAAL,EAAI,MAAM,kCAAkCsC,CAAG;AAC/C,QAAMa,IAAOL,EAAM,OAAO,GAAG,EAAE,KAAK,SAAS,MAAM;AACnD,EAAKzC,EAAM,UAGTL,EAAI,KAAK,wBAAwBK,EAAM,MAAK,CAAE,IAF9CL,EAAI,KAAK,sBAAsBK,CAAK,GAIlCA,EAAM,QAAQ,SAAS,KACzBL,EAAI,KAAK,mBAAmBK,EAAM,KAAKA,EAAM,MAAK,EAAG,CAAC,CAAC,CAAC;AAE1D,QAAM+C,IAAWD,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,UAAU,GACpDE,IAAYF,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,WAAW,GACtDG,IAAaH,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,YAAY,GACxD3C,IAAQ2C,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,OAAO;AACpD,QAAM,QAAQ;AAAA,IACZ9C,EAAM,MAAK,EAAG,IAAI,eAAerB,GAAG;AAClC,YAAMG,IAAOkB,EAAM,KAAKrB,CAAC;AACzB,UAAIgE,MAAkB,QAAQ;AAC5B,cAAMvC,IAAO,KAAK,MAAM,KAAK,UAAUuC,EAAc,WAAW,CAAC;AACjE,QAAAhD,EAAI;AAAA,UACF;AAAA;AAAA,UACAhB;AAAA,UACA;AAAA;AAAA,UACAyB,EAAK;AAAA,UACL;AAAA;AAAA,UACAuC,EAAc;AAAA,QACxB,GACQ3C,EAAM,QAAQ2C,EAAc,IAAIvC,CAAI,GAC/BJ,EAAM,OAAOrB,CAAC,MACjBgB,EAAI,MAAM,kBAAkBhB,GAAGgE,EAAc,EAAE,GAC/C3C,EAAM,UAAUrB,GAAGgE,EAAc,IAAIvC,CAAI;AAAA,MAE7C;AAEA,UADAT,EAAI,KAAK,sBAAsBhB,IAAI,OAAO,KAAK,UAAUqB,EAAM,KAAKrB,CAAC,CAAC,CAAC,GACnEG,GAAM,aAAa;AACrB,QAAAa,EAAI,KAAK,0BAA0BhB,GAAGG,EAAK,OAAOkB,EAAM,KAAKrB,CAAC,CAAC;AAC/D,cAAM,EAAE,SAAAuE,GAAS,SAAAC,MAAYnD,EAAM,MAAK;AACxC,QAAAlB,EAAK,MAAM,SAAS;AAAA,UAClB,GAAGA,EAAK,MAAM,MAAK;AAAA,UACnB,SAASoE,IAAU;AAAA,UACnB,SAAAC;AAAA,QACV,CAAS;AACD,cAAMC,IAAI,MAAMZ;AAAA,UACdrC;AAAA,UACArB,EAAK;AAAA,UACL4D;AAAA,UACAlD;AAAA,UACAQ,EAAM,KAAKrB,CAAC;AAAA,UACZiE;AAAA,QACV,GACcS,IAAQD,EAAE;AAChB,QAAAE,EAAiBxE,GAAMuE,CAAK,GAC5BvE,EAAK,OAAOsE,EAAE,QAAQ,GACtBzD,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACA;AAAA;AAAA,UAEAG,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA;AAAA;AAAA,QAGf,GACQyE,EAAYF,GAAOvE,CAAI;AAAA,MACzB;AACE,QAAIkB,EAAM,SAASrB,CAAC,EAAE,SAAS,KAC7BgB,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA;AAAA,UACAA,EAAK;AAAA,UACL;AAAA,UACAkB;AAAA,QACZ,GACUL,EAAI,MAAMwB,EAAoBrC,EAAK,IAAIkB,CAAK,CAAC,GAC7Cd,EAAU,IAAIJ,EAAK,IAAI,EAAE,IAAIqC,EAAoBrC,EAAK,IAAIkB,CAAK,GAAG,MAAAlB,EAAI,CAAE,MAExEa,EAAI,MAAM,qCAAqChB,GAAGwB,GAAOH,EAAM,KAAKrB,CAAC,GAAGsD,CAAG,GAC3E,MAAMuB,EAAWrD,GAAOH,EAAM,KAAKrB,CAAC,GAAG,EAAE,QAAQiE,GAAY,KAAAX,GAAK;AAAA,IAGxE,CAAC;AAAA,EACL,GAoBE,OAnBqC,gBAAA3C,EAAO,YAAY;AACtD,UAAMmE,IAAezD,EAAM,MAAK,EAAG,IAAI,eAAejB,GAAG;AACvD,YAAME,IAAOe,EAAM,KAAKjB,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI;AACxC,MAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUA,CAAC,CAAC,GAChEY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,MAAMA,GAAG,KAAK,KAAK,UAAUiB,EAAM,KAAKjB,CAAC,CAAC,CAAC,GACnFY,EAAI;AAAA,QACF;AAAA,QACAT;AAAA,QACA;AAAA,QACAH,EAAE;AAAA,QACFA,EAAE;AAAA,QACF;AAAA,QACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,QACjBG,EAAU,IAAIH,EAAE,CAAC;AAAA,MACzB,GACM,MAAM2E,EAAgBT,GAAYhE,CAAI;AAAA,IACxC,CAAC;AACD,UAAM,QAAQ,IAAIwE,CAAY;AAAA,EAChC,GAAG,cAAc,GACC,GAClB9D,EAAI,KAAK,wBAAwB,KAAK,UAAUkD,EAAoB7C,CAAK,CAAC,CAAC,GAC3EL,EAAI,KAAK,mDAAmD,GAC5DA,EAAI,KAAK,mDAAmD,GAC5DA,EAAI,KAAK,mDAAmD,GAC5DgE,EAAY3D,CAAK,GACjBL,EAAI,KAAK,uBAAuB,KAAK,UAAUkD,EAAoB7C,CAAK,CAAC,CAAC;AAC1E,MAAI4D,IAAO,GACP,EAAE,0BAAAC,EAAwB,IAAKC,EAAwBlB,CAAU;AACrE,eAAM,QAAQ;AAAA,IACZL,GAAqBvC,CAAK,EAAE,IAAI,eAAerB,GAAG;AAChD,YAAMG,IAAOkB,EAAM,KAAKrB,CAAC;AASzB,UARAgB,EAAI;AAAA,QACF,qBAAqBhB,IAAI,QAAQG,EAAK;AAAA,QACtC,MAAMA,EAAK;AAAA,QACX;AAAA,QACAA,EAAK;AAAA,QACL;AAAA,QACAA,EAAK;AAAA,MACb,GACUA,GAAM;AACR,QAAAA,EAAK,KAAK+E,GACVlE,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLkB,EAAM,OAAOrB,CAAC;AAAA,QACxB,GACQO,EAAU,IAAIJ,EAAK,EAAE,EAAE,OAAOA,GAC9BiF,EAAajF,CAAI;AAAA,eAEbkB,EAAM,SAASrB,CAAC,EAAE,SAAS,GAAG;AAChC,QAAAgB,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLkB,EAAM,OAAOrB,CAAC;AAAA,QAC1B,GACUG,EAAK,UAAU+E,GACf7D,EAAM,KAAKlB,EAAK,QAAQ;AACxB,cAAMkF,IAAclF,GAAM,UAAU,KAAK,GACnCmF,IAAcnF,GAAM,WAAW,UAAU,GACzCoF,IAAUD,IAAcD,KAAe;AAC7C,QAAArE,EAAI,MAAM,WAAWuE,GAAS,eAAeD,GAAa,eAAeD,CAAW,GACpF,MAAMG,EAAcpB,GAAUjE,CAAI,GAClCI,EAAU,IAAIJ,EAAK,EAAE,EAAE,OAAOA;AAAA,MAChC,OAAO;AACL,cAAMD,IAASmB,EAAM,KAAKlB,EAAK,QAAQ;AACvC,QAAAA,EAAK,KAAK+E,IAA2B,GACrClE,EAAI;AAAA,UACF;AAAA,UACAb,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA,UACL;AAAA,UACAD;AAAA,UACAA,GAAQ;AAAA,UACRC;AAAA,QACZ,GACUiF,EAAajF,CAAI;AAAA,MACnB;AAAA,IAEJ,CAAC;AAAA,EACL,GACEkB,EAAM,MAAK,EAAG,QAAQ,SAASjB,GAAG;AAChC,UAAME,IAAOe,EAAM,KAAKjB,CAAC;AACzB,IAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUE,CAAI,GAAGA,CAAI,GACzEA,EAAK,OAAO,QAAQ,CAACmF,MAAUA,EAAM,KAAKP,IAA2B,CAAC;AACtE,UAAMQ,IAAYrE,EAAM,KAAKjB,EAAE,CAAC;AAChC,QAAIuF,IAAUtE,EAAM,KAAKjB,EAAE,CAAC;AAC5B,UAAMwF,IAAQC,EAAWxB,GAAW/D,GAAMC,GAAWwD,GAAa2B,GAAWC,GAAS9E,CAAE;AACxF,IAAAiF,EAAkBxF,GAAMsF,CAAK;AAAA,EAC/B,CAAC,GACDvE,EAAM,MAAK,EAAG,QAAQ,SAASrB,GAAG;AAChC,UAAM+F,IAAI1E,EAAM,KAAKrB,CAAC;AACtB,IAAAgB,EAAI,KAAKhB,GAAG+F,EAAE,MAAMA,EAAE,IAAI,GACtBA,EAAE,YACJd,IAAOc,EAAE;AAAA,EAEb,CAAC,GACD/E,EAAI,KAAK,uCAAuCmD,GAAMc,CAAI,GACnD,EAAE,MAAAd,GAAM,MAAAc,EAAI;AACrB,GAAG,iBAAiB,GAChBe,KAAyB,gBAAArF,EAAO,OAAOsF,GAAaC,MAAQ;AAC9D,QAAM7E,IAAQ,IAAI8E,EAAgB;AAAA,IAChC,YAAY;AAAA,IACZ,UAAU;AAAA,EACd,CAAG,EAAE,SAAS;AAAA,IACV,SAASF,EAAY;AAAA,IACrB,SAASA,EAAY,QAAQ,eAAeA,EAAY,QAAQ,WAAW,eAAeA,EAAY;AAAA,IACtG,SAASA,EAAY,QAAQ,eAAeA,EAAY,QAAQ,WAAW,eAAeA,EAAY;AAAA,IACtG,SAAS;AAAA,IACT,SAAS;AAAA,EACb,CAAG,EAAE,oBAAoB,WAAW;AAChC,WAAO,CAAA;AAAA,EACT,CAAC,GACKG,IAAUF,EAAI,OAAO,GAAG;AAC9B,EAAAG,EAAgBD,GAASH,EAAY,SAASA,EAAY,MAAMA,EAAY,SAAS,GACrFK,EAAM,GACNC,EAAM,GACNC,EAAK,GACL9F,GAAM,GACNuF,EAAY,MAAM,QAAQ,CAAC9F,MAAS;AAClC,IAAAkB,EAAM,QAAQlB,EAAK,IAAI,EAAE,GAAGA,EAAI,CAAE,GAC9BA,EAAK,YACPkB,EAAM,UAAUlB,EAAK,IAAIA,EAAK,QAAQ;AAAA,EAE1C,CAAC,GACDa,EAAI,MAAM,UAAUiF,EAAY,KAAK,GACrCA,EAAY,MAAM,QAAQ,CAAC3F,MAAS;AAClC,QAAIA,EAAK,UAAUA,EAAK,KAAK;AAC3B,YAAMmG,IAASnG,EAAK,OACdoG,IAAaD,IAAS,QAAQA,IAAS,QACvCE,IAAaF,IAAS,QAAQA,IAAS,QACvCtG,IAAOkB,EAAM,KAAKoF,CAAM;AAC9B,MAAApF,EAAM,QAAQqF,GAAY;AAAA,QACxB,OAAOA;AAAA,QACP,IAAIA;AAAA,QACJ,UAAUvG,EAAK;AAAA,QACf,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,SAAS;AAAA,QACT,OAAO;AAAA;AAAA,QAEP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,QAAQ;AAAA,MAChB,CAAO,GACDkB,EAAM,UAAUqF,GAAYvG,EAAK,QAAQ,GACzCkB,EAAM,QAAQsF,GAAY;AAAA,QACxB,OAAOA;AAAA,QACP,IAAIA;AAAA,QACJ,UAAUxG,EAAK;AAAA,QACf,YAAY;AAAA,QACZ,SAAS;AAAA;AAAA,QAET,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,QAAQ;AAAA,MAChB,CAAO,GACDkB,EAAM,UAAUsF,GAAYxG,EAAK,QAAQ;AACzC,YAAMyG,IAAQ,gBAAgBtG,CAAI,GAC5BuG,IAAU,gBAAgBvG,CAAI,GAC9BwG,IAAQ,gBAAgBxG,CAAI;AAClC,MAAAsG,EAAM,QAAQ,IACdA,EAAM,eAAe,QACrBA,EAAM,KAAKH,IAAS,qBACpBI,EAAQ,iBAAiB,QACzBA,EAAQ,eAAe,QACvBA,EAAQ,KAAKJ,IAAS,uBACtBK,EAAM,QAAQ,IACV3G,EAAK,YACPyG,EAAM,cAAcH,GACpBK,EAAM,YAAYL,IAEpBK,EAAM,KAAKL,IAAS,qBACpBK,EAAM,iBAAiB,QACvBzF,EAAM,QAAQoF,GAAQC,GAAYE,GAAOH,IAAS,mBAAmB,GACrEpF,EAAM,QAAQqF,GAAYC,GAAYE,GAASJ,IAAS,mBAAmB,GAC3EpF,EAAM,QAAQsF,GAAYF,GAAQK,GAAOL,IAAS,oBAAoB;AAAA,IACxE;AACE,MAAApF,EAAM,QAAQf,EAAK,OAAOA,EAAK,KAAK,EAAE,GAAGA,EAAI,GAAIA,EAAK,EAAE;AAAA,EAE5D,CAAC,GACDU,EAAI,KAAK,mBAAmB,KAAK,UAAUkD,EAAoB7C,CAAK,CAAC,CAAC,GACtEwB,GAAuBxB,CAAK,GAC5BL,EAAI,KAAK,oBAAoB,KAAK,UAAUkD,EAAoB7C,CAAK,CAAC,CAAC;AACvE,QAAM4C,IAAa8C,EAAS;AAC5B,QAAMlD;AAAA,IACJuC;AAAA,IACA/E;AAAA,IACA4E,EAAY;AAAA,IACZA,EAAY;AAAA,IACZ;AAAA,IACAhC;AAAA,EACJ;AACA,GAAG,QAAQ;","x_google_ignoreList":[0,1]}
1	+ {"version":3,"file":"dagre-6UL2VRFP-hEXR6Hr0.js","sources":["../../../node_modules/.pnpm/dagre-d3-es@7.0.13/node_modules/dagre-d3-es/src/graphlib/json.js","../../../node_modules/.pnpm/mermaid@11.12.2/node_modules/mermaid/dist/chunks/mermaid.core/dagre-6UL2VRFP.mjs"],"sourcesContent":["import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\nexport { write, read };\n\nfunction write(g) {\n var json = {\n options: {\n directed: g.isDirected(),\n multigraph: g.isMultigraph(),\n compound: g.isCompound(),\n },\n nodes: writeNodes(g),\n edges: writeEdges(g),\n };\n if (!_.isUndefined(g.graph())) {\n json.value = _.clone(g.graph());\n }\n return json;\n}\n\nfunction writeNodes(g) {\n return _.map(g.nodes(), function (v) {\n var nodeValue = g.node(v);\n var parent = g.parent(v);\n var node = { v: v };\n if (!_.isUndefined(nodeValue)) {\n node.value = nodeValue;\n }\n if (!_.isUndefined(parent)) {\n node.parent = parent;\n }\n return node;\n });\n}\n\nfunction writeEdges(g) {\n return _.map(g.edges(), function (e) {\n var edgeValue = g.edge(e);\n var edge = { v: e.v, w: e.w };\n if (!_.isUndefined(e.name)) {\n edge.name = e.name;\n }\n if (!_.isUndefined(edgeValue)) {\n edge.value = edgeValue;\n }\n return edge;\n });\n}\n\nfunction read(json) {\n var g = new Graph(json.options).setGraph(json.value);\n _.each(json.nodes, function (entry) {\n g.setNode(entry.v, entry.value);\n if (entry.parent) {\n g.setParent(entry.v, entry.parent);\n }\n });\n _.each(json.edges, function (entry) {\n g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n });\n return g;\n}\n","import {\n clear as clear2,\n insertEdge,\n insertEdgeLabel,\n markers_default,\n positionEdgeLabel\n} from \"./chunk-QXUST7PY.mjs\";\nimport \"./chunk-HN2XXSSU.mjs\";\nimport {\n clear,\n clear2 as clear3,\n insertCluster,\n insertNode,\n positionNode,\n setNodeElem,\n updateNodeBounds\n} from \"./chunk-JZLCHNYA.mjs\";\nimport {\n getSubGraphTitleMargins\n} from \"./chunk-CVBHYZKI.mjs\";\nimport \"./chunk-ATLVNIR6.mjs\";\nimport \"./chunk-JA3XYJ7Z.mjs\";\nimport \"./chunk-S3R3BYOJ.mjs\";\nimport {\n getConfig2 as getConfig\n} from \"./chunk-ABZYJK2D.mjs\";\nimport {\n __name,\n log\n} from \"./chunk-AGHRB4JF.mjs\";\n\n// src/rendering-util/layout-algorithms/dagre/index.js\nimport { layout as dagreLayout } from \"dagre-d3-es/src/dagre/index.js\";\nimport * as graphlibJson2 from \"dagre-d3-es/src/graphlib/json.js\";\nimport * as graphlib2 from \"dagre-d3-es/src/graphlib/index.js\";\n\n// src/rendering-util/layout-algorithms/dagre/mermaid-graphlib.js\nimport * as graphlib from \"dagre-d3-es/src/graphlib/index.js\";\nimport * as graphlibJson from \"dagre-d3-es/src/graphlib/json.js\";\nvar clusterDb = /* @__PURE__ / new Map();\nvar descendants = / @__PURE__ / new Map();\nvar parents = / @__PURE__ / new Map();\nvar clear4 = / @__PURE__ / __name(() => {\n descendants.clear();\n parents.clear();\n clusterDb.clear();\n}, \"clear\");\nvar isDescendant = / @__PURE__ / __name((id, ancestorId) => {\n const ancestorDescendants = descendants.get(ancestorId) \|\| [];\n log.trace(\"In isDescendant\", ancestorId, \" \", id, \" = \", ancestorDescendants.includes(id));\n return ancestorDescendants.includes(id);\n}, \"isDescendant\");\nvar edgeInCluster = / @__PURE__ / __name((edge, clusterId) => {\n const clusterDescendants = descendants.get(clusterId) \|\| [];\n log.info(\"Descendants of \", clusterId, \" is \", clusterDescendants);\n log.info(\"Edge is \", edge);\n if (edge.v === clusterId \|\| edge.w === clusterId) {\n return false;\n }\n if (!clusterDescendants) {\n log.debug(\"Tilt, \", clusterId, \",not in descendants\");\n return false;\n }\n return clusterDescendants.includes(edge.v) \|\| isDescendant(edge.v, clusterId) \|\| isDescendant(edge.w, clusterId) \|\| clusterDescendants.includes(edge.w);\n}, \"edgeInCluster\");\nvar copy = / @__PURE__ / __name((clusterId, graph, newGraph, rootId) => {\n log.warn(\n \"Copying children of \",\n clusterId,\n \"root\",\n rootId,\n \"data\",\n graph.node(clusterId),\n rootId\n );\n const nodes = graph.children(clusterId) \|\| [];\n if (clusterId !== rootId) {\n nodes.push(clusterId);\n }\n log.warn(\"Copying (nodes) clusterId\", clusterId, \"nodes\", nodes);\n nodes.forEach((node) => {\n if (graph.children(node).length > 0) {\n copy(node, graph, newGraph, rootId);\n } else {\n const data = graph.node(node);\n log.info(\"cp \", node, \" to \", rootId, \" with parent \", clusterId);\n newGraph.setNode(node, data);\n if (rootId !== graph.parent(node)) {\n log.warn(\"Setting parent\", node, graph.parent(node));\n newGraph.setParent(node, graph.parent(node));\n }\n if (clusterId !== rootId && node !== clusterId) {\n log.debug(\"Setting parent\", node, clusterId);\n newGraph.setParent(node, clusterId);\n } else {\n log.info(\"In copy \", clusterId, \"root\", rootId, \"data\", graph.node(clusterId), rootId);\n log.debug(\n \"Not Setting parent for node=\",\n node,\n \"cluster!==rootId\",\n clusterId !== rootId,\n \"node!==clusterId\",\n node !== clusterId\n );\n }\n const edges = graph.edges(node);\n log.debug(\"Copying Edges\", edges);\n edges.forEach((edge) => {\n log.info(\"Edge\", edge);\n const data2 = graph.edge(edge.v, edge.w, edge.name);\n log.info(\"Edge data\", data2, rootId);\n try {\n if (edgeInCluster(edge, rootId)) {\n log.info(\"Copying as \", edge.v, edge.w, data2, edge.name);\n newGraph.setEdge(edge.v, edge.w, data2, edge.name);\n log.info(\"newGraph edges \", newGraph.edges(), newGraph.edge(newGraph.edges()[0]));\n } else {\n log.info(\n \"Skipping copy of edge \",\n edge.v,\n \"-->\",\n edge.w,\n \" rootId: \",\n rootId,\n \" clusterId:\",\n clusterId\n );\n }\n } catch (e) {\n log.error(e);\n }\n });\n }\n log.debug(\"Removing node\", node);\n graph.removeNode(node);\n });\n}, \"copy\");\nvar extractDescendants = / @__PURE__ / __name((id, graph) => {\n const children = graph.children(id);\n let res = [...children];\n for (const child of children) {\n parents.set(child, id);\n res = [...res, ...extractDescendants(child, graph)];\n }\n return res;\n}, \"extractDescendants\");\nvar findCommonEdges = / @__PURE__ / __name((graph, id1, id2) => {\n const edges1 = graph.edges().filter((edge) => edge.v === id1 \|\| edge.w === id1);\n const edges2 = graph.edges().filter((edge) => edge.v === id2 \|\| edge.w === id2);\n const edges1Prim = edges1.map((edge) => {\n return { v: edge.v === id1 ? id2 : edge.v, w: edge.w === id1 ? id1 : edge.w };\n });\n const edges2Prim = edges2.map((edge) => {\n return { v: edge.v, w: edge.w };\n });\n const result = edges1Prim.filter((edgeIn1) => {\n return edges2Prim.some((edge) => edgeIn1.v === edge.v && edgeIn1.w === edge.w);\n });\n return result;\n}, \"findCommonEdges\");\nvar findNonClusterChild = / @__PURE__ / __name((id, graph, clusterId) => {\n const children = graph.children(id);\n log.trace(\"Searching children of id \", id, children);\n if (children.length < 1) {\n return id;\n }\n let reserve;\n for (const child of children) {\n const _id = findNonClusterChild(child, graph, clusterId);\n const commonEdges = findCommonEdges(graph, clusterId, _id);\n if (_id) {\n if (commonEdges.length > 0) {\n reserve = _id;\n } else {\n return _id;\n }\n }\n }\n return reserve;\n}, \"findNonClusterChild\");\nvar getAnchorId = / @__PURE__ / __name((id) => {\n if (!clusterDb.has(id)) {\n return id;\n }\n if (!clusterDb.get(id).externalConnections) {\n return id;\n }\n if (clusterDb.has(id)) {\n return clusterDb.get(id).id;\n }\n return id;\n}, \"getAnchorId\");\nvar adjustClustersAndEdges = / @__PURE__ / __name((graph, depth) => {\n if (!graph \|\| depth > 10) {\n log.debug(\"Opting out, no graph \");\n return;\n } else {\n log.debug(\"Opting in, graph \");\n }\n graph.nodes().forEach(function(id) {\n const children = graph.children(id);\n if (children.length > 0) {\n log.warn(\n \"Cluster identified\",\n id,\n \" Replacement id in edges: \",\n findNonClusterChild(id, graph, id)\n );\n descendants.set(id, extractDescendants(id, graph));\n clusterDb.set(id, { id: findNonClusterChild(id, graph, id), clusterData: graph.node(id) });\n }\n });\n graph.nodes().forEach(function(id) {\n const children = graph.children(id);\n const edges = graph.edges();\n if (children.length > 0) {\n log.debug(\"Cluster identified\", id, descendants);\n edges.forEach((edge) => {\n const d1 = isDescendant(edge.v, id);\n const d2 = isDescendant(edge.w, id);\n if (d1 ^ d2) {\n log.warn(\"Edge: \", edge, \" leaves cluster \", id);\n log.warn(\"Descendants of XXX \", id, \": \", descendants.get(id));\n clusterDb.get(id).externalConnections = true;\n }\n });\n } else {\n log.debug(\"Not a cluster \", id, descendants);\n }\n });\n for (let id of clusterDb.keys()) {\n const nonClusterChild = clusterDb.get(id).id;\n const parent = graph.parent(nonClusterChild);\n if (parent !== id && clusterDb.has(parent) && !clusterDb.get(parent).externalConnections) {\n clusterDb.get(id).id = parent;\n }\n }\n graph.edges().forEach(function(e) {\n const edge = graph.edge(e);\n log.warn(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(e));\n log.warn(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(graph.edge(e)));\n let v = e.v;\n let w = e.w;\n log.warn(\n \"Fix XXX\",\n clusterDb,\n \"ids:\",\n e.v,\n e.w,\n \"Translating: \",\n clusterDb.get(e.v),\n \" --- \",\n clusterDb.get(e.w)\n );\n if (clusterDb.get(e.v) \|\| clusterDb.get(e.w)) {\n log.warn(\"Fixing and trying - removing XXX\", e.v, e.w, e.name);\n v = getAnchorId(e.v);\n w = getAnchorId(e.w);\n graph.removeEdge(e.v, e.w, e.name);\n if (v !== e.v) {\n const parent = graph.parent(v);\n clusterDb.get(parent).externalConnections = true;\n edge.fromCluster = e.v;\n }\n if (w !== e.w) {\n const parent = graph.parent(w);\n clusterDb.get(parent).externalConnections = true;\n edge.toCluster = e.w;\n }\n log.warn(\"Fix Replacing with XXX\", v, w, e.name);\n graph.setEdge(v, w, edge, e.name);\n }\n });\n log.warn(\"Adjusted Graph\", graphlibJson.write(graph));\n extractor(graph, 0);\n log.trace(clusterDb);\n}, \"adjustClustersAndEdges\");\nvar extractor = / @__PURE__ / __name((graph, depth) => {\n log.warn(\"extractor - \", depth, graphlibJson.write(graph), graph.children(\"D\"));\n if (depth > 10) {\n log.error(\"Bailing out\");\n return;\n }\n let nodes = graph.nodes();\n let hasChildren = false;\n for (const node of nodes) {\n const children = graph.children(node);\n hasChildren = hasChildren \|\| children.length > 0;\n }\n if (!hasChildren) {\n log.debug(\"Done, no node has children\", graph.nodes());\n return;\n }\n log.debug(\"Nodes = \", nodes, depth);\n for (const node of nodes) {\n log.debug(\n \"Extracting node\",\n node,\n clusterDb,\n clusterDb.has(node) && !clusterDb.get(node).externalConnections,\n !graph.parent(node),\n graph.node(node),\n graph.children(\"D\"),\n \" Depth \",\n depth\n );\n if (!clusterDb.has(node)) {\n log.debug(\"Not a cluster\", node, depth);\n } else if (!clusterDb.get(node).externalConnections && graph.children(node) && graph.children(node).length > 0) {\n log.warn(\n \"Cluster without external connections, without a parent and with children\",\n node,\n depth\n );\n const graphSettings = graph.graph();\n let dir = graphSettings.rankdir === \"TB\" ? \"LR\" : \"TB\";\n if (clusterDb.get(node)?.clusterData?.dir) {\n dir = clusterDb.get(node).clusterData.dir;\n log.warn(\"Fixing dir\", clusterDb.get(node).clusterData.dir, dir);\n }\n const clusterGraph = new graphlib.Graph({\n multigraph: true,\n compound: true\n }).setGraph({\n rankdir: dir,\n nodesep: 50,\n ranksep: 50,\n marginx: 8,\n marginy: 8\n }).setDefaultEdgeLabel(function() {\n return {};\n });\n log.warn(\"Old graph before copy\", graphlibJson.write(graph));\n copy(node, graph, clusterGraph, node);\n graph.setNode(node, {\n clusterNode: true,\n id: node,\n clusterData: clusterDb.get(node).clusterData,\n label: clusterDb.get(node).label,\n graph: clusterGraph\n });\n log.warn(\"New graph after copy node: (\", node, \")\", graphlibJson.write(clusterGraph));\n log.debug(\"Old graph after copy\", graphlibJson.write(graph));\n } else {\n log.warn(\n \"Cluster * \",\n node,\n \" *not meeting the criteria !externalConnections:\",\n !clusterDb.get(node).externalConnections,\n \" no parent: \",\n !graph.parent(node),\n \" children \",\n graph.children(node) && graph.children(node).length > 0,\n graph.children(\"D\"),\n depth\n );\n log.debug(clusterDb);\n }\n }\n nodes = graph.nodes();\n log.warn(\"New list of nodes\", nodes);\n for (const node of nodes) {\n const data = graph.node(node);\n log.warn(\" Now next level\", node, data);\n if (data?.clusterNode) {\n extractor(data.graph, depth + 1);\n }\n }\n}, \"extractor\");\nvar sorter = / @__PURE__ / __name((graph, nodes) => {\n if (nodes.length === 0) {\n return [];\n }\n let result = Object.assign([], nodes);\n nodes.forEach((node) => {\n const children = graph.children(node);\n const sorted = sorter(graph, children);\n result = [...result, ...sorted];\n });\n return result;\n}, \"sorter\");\nvar sortNodesByHierarchy = / @__PURE__ / __name((graph) => sorter(graph, graph.children()), \"sortNodesByHierarchy\");\n\n// src/rendering-util/layout-algorithms/dagre/index.js\nvar recursiveRender = / @__PURE__ / __name(async (_elem, graph, diagramType, id, parentCluster, siteConfig) => {\n log.warn(\"Graph in recursive render:XAX\", graphlibJson2.write(graph), parentCluster);\n const dir = graph.graph().rankdir;\n log.trace(\"Dir in recursive render - dir:\", dir);\n const elem = _elem.insert(\"g\").attr(\"class\", \"root\");\n if (!graph.nodes()) {\n log.info(\"No nodes found for\", graph);\n } else {\n log.info(\"Recursive render XXX\", graph.nodes());\n }\n if (graph.edges().length > 0) {\n log.info(\"Recursive edges\", graph.edge(graph.edges()[0]));\n }\n const clusters = elem.insert(\"g\").attr(\"class\", \"clusters\");\n const edgePaths = elem.insert(\"g\").attr(\"class\", \"edgePaths\");\n const edgeLabels = elem.insert(\"g\").attr(\"class\", \"edgeLabels\");\n const nodes = elem.insert(\"g\").attr(\"class\", \"nodes\");\n await Promise.all(\n graph.nodes().map(async function(v) {\n const node = graph.node(v);\n if (parentCluster !== void 0) {\n const data = JSON.parse(JSON.stringify(parentCluster.clusterData));\n log.trace(\n \"Setting data for parent cluster XXX\\n Node.id = \",\n v,\n \"\\n data=\",\n data.height,\n \"\\nParent cluster\",\n parentCluster.height\n );\n graph.setNode(parentCluster.id, data);\n if (!graph.parent(v)) {\n log.trace(\"Setting parent\", v, parentCluster.id);\n graph.setParent(v, parentCluster.id, data);\n }\n }\n log.info(\"(Insert) Node XXX\" + v + \": \" + JSON.stringify(graph.node(v)));\n if (node?.clusterNode) {\n log.info(\"Cluster identified XBX\", v, node.width, graph.node(v));\n const { ranksep, nodesep } = graph.graph();\n node.graph.setGraph({\n ...node.graph.graph(),\n ranksep: ranksep + 25,\n nodesep\n });\n const o = await recursiveRender(\n nodes,\n node.graph,\n diagramType,\n id,\n graph.node(v),\n siteConfig\n );\n const newEl = o.elem;\n updateNodeBounds(node, newEl);\n node.diff = o.diff \|\| 0;\n log.info(\n \"New compound node after recursive render XAX\",\n v,\n \"width\",\n // node,\n node.width,\n \"height\",\n node.height\n // node.x,\n // node.y\n );\n setNodeElem(newEl, node);\n } else {\n if (graph.children(v).length > 0) {\n log.trace(\n \"Cluster - the non recursive path XBX\",\n v,\n node.id,\n node,\n node.width,\n \"Graph:\",\n graph\n );\n log.trace(findNonClusterChild(node.id, graph));\n clusterDb.set(node.id, { id: findNonClusterChild(node.id, graph), node });\n } else {\n log.trace(\"Node - the non recursive path XAX\", v, nodes, graph.node(v), dir);\n await insertNode(nodes, graph.node(v), { config: siteConfig, dir });\n }\n }\n })\n );\n const processEdges = / @__PURE__ / __name(async () => {\n const edgePromises = graph.edges().map(async function(e) {\n const edge = graph.edge(e.v, e.w, e.name);\n log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(e));\n log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \", e, \" \", JSON.stringify(graph.edge(e)));\n log.info(\n \"Fix\",\n clusterDb,\n \"ids:\",\n e.v,\n e.w,\n \"Translating: \",\n clusterDb.get(e.v),\n clusterDb.get(e.w)\n );\n await insertEdgeLabel(edgeLabels, edge);\n });\n await Promise.all(edgePromises);\n }, \"processEdges\");\n await processEdges();\n log.info(\"Graph before layout:\", JSON.stringify(graphlibJson2.write(graph)));\n log.info(\"############################################# XXX\");\n log.info(\"### Layout ### XXX\");\n log.info(\"############################################# XXX\");\n dagreLayout(graph);\n log.info(\"Graph after layout:\", JSON.stringify(graphlibJson2.write(graph)));\n let diff = 0;\n let { subGraphTitleTotalMargin } = getSubGraphTitleMargins(siteConfig);\n await Promise.all(\n sortNodesByHierarchy(graph).map(async function(v) {\n const node = graph.node(v);\n log.info(\n \"Position XBX => \" + v + \": (\" + node.x,\n \",\" + node.y,\n \") width: \",\n node.width,\n \" height: \",\n node.height\n );\n if (node?.clusterNode) {\n node.y += subGraphTitleTotalMargin;\n log.info(\n \"A tainted cluster node XBX1\",\n v,\n node.id,\n node.width,\n node.height,\n node.x,\n node.y,\n graph.parent(v)\n );\n clusterDb.get(node.id).node = node;\n positionNode(node);\n } else {\n if (graph.children(v).length > 0) {\n log.info(\n \"A pure cluster node XBX1\",\n v,\n node.id,\n node.x,\n node.y,\n node.width,\n node.height,\n graph.parent(v)\n );\n node.height += subGraphTitleTotalMargin;\n graph.node(node.parentId);\n const halfPadding = node?.padding / 2 \|\| 0;\n const labelHeight = node?.labelBBox?.height \|\| 0;\n const offsetY = labelHeight - halfPadding \|\| 0;\n log.debug(\"OffsetY\", offsetY, \"labelHeight\", labelHeight, \"halfPadding\", halfPadding);\n await insertCluster(clusters, node);\n clusterDb.get(node.id).node = node;\n } else {\n const parent = graph.node(node.parentId);\n node.y += subGraphTitleTotalMargin / 2;\n log.info(\n \"A regular node XBX1 - using the padding\",\n node.id,\n \"parent\",\n node.parentId,\n node.width,\n node.height,\n node.x,\n node.y,\n \"offsetY\",\n node.offsetY,\n \"parent\",\n parent,\n parent?.offsetY,\n node\n );\n positionNode(node);\n }\n }\n })\n );\n graph.edges().forEach(function(e) {\n const edge = graph.edge(e);\n log.info(\"Edge \" + e.v + \" -> \" + e.w + \": \" + JSON.stringify(edge), edge);\n edge.points.forEach((point) => point.y += subGraphTitleTotalMargin / 2);\n const startNode = graph.node(e.v);\n var endNode = graph.node(e.w);\n const paths = insertEdge(edgePaths, edge, clusterDb, diagramType, startNode, endNode, id);\n positionEdgeLabel(edge, paths);\n });\n graph.nodes().forEach(function(v) {\n const n = graph.node(v);\n log.info(v, n.type, n.diff);\n if (n.isGroup) {\n diff = n.diff;\n }\n });\n log.warn(\"Returning from recursive render XAX\", elem, diff);\n return { elem, diff };\n}, \"recursiveRender\");\nvar render = / @__PURE__ */ __name(async (data4Layout, svg) => {\n const graph = new graphlib2.Graph({\n multigraph: true,\n compound: true\n }).setGraph({\n rankdir: data4Layout.direction,\n nodesep: data4Layout.config?.nodeSpacing \|\| data4Layout.config?.flowchart?.nodeSpacing \|\| data4Layout.nodeSpacing,\n ranksep: data4Layout.config?.rankSpacing \|\| data4Layout.config?.flowchart?.rankSpacing \|\| data4Layout.rankSpacing,\n marginx: 8,\n marginy: 8\n }).setDefaultEdgeLabel(function() {\n return {};\n });\n const element = svg.select(\"g\");\n markers_default(element, data4Layout.markers, data4Layout.type, data4Layout.diagramId);\n clear3();\n clear2();\n clear();\n clear4();\n data4Layout.nodes.forEach((node) => {\n graph.setNode(node.id, { ...node });\n if (node.parentId) {\n graph.setParent(node.id, node.parentId);\n }\n });\n log.debug(\"Edges:\", data4Layout.edges);\n data4Layout.edges.forEach((edge) => {\n if (edge.start === edge.end) {\n const nodeId = edge.start;\n const specialId1 = nodeId + \"---\" + nodeId + \"---1\";\n const specialId2 = nodeId + \"---\" + nodeId + \"---2\";\n const node = graph.node(nodeId);\n graph.setNode(specialId1, {\n domId: specialId1,\n id: specialId1,\n parentId: node.parentId,\n labelStyle: \"\",\n label: \"\",\n padding: 0,\n shape: \"labelRect\",\n // shape: 'rect',\n style: \"\",\n width: 10,\n height: 10\n });\n graph.setParent(specialId1, node.parentId);\n graph.setNode(specialId2, {\n domId: specialId2,\n id: specialId2,\n parentId: node.parentId,\n labelStyle: \"\",\n padding: 0,\n // shape: 'rect',\n shape: \"labelRect\",\n label: \"\",\n style: \"\",\n width: 10,\n height: 10\n });\n graph.setParent(specialId2, node.parentId);\n const edge1 = structuredClone(edge);\n const edgeMid = structuredClone(edge);\n const edge2 = structuredClone(edge);\n edge1.label = \"\";\n edge1.arrowTypeEnd = \"none\";\n edge1.id = nodeId + \"-cyclic-special-1\";\n edgeMid.arrowTypeStart = \"none\";\n edgeMid.arrowTypeEnd = \"none\";\n edgeMid.id = nodeId + \"-cyclic-special-mid\";\n edge2.label = \"\";\n if (node.isGroup) {\n edge1.fromCluster = nodeId;\n edge2.toCluster = nodeId;\n }\n edge2.id = nodeId + \"-cyclic-special-2\";\n edge2.arrowTypeStart = \"none\";\n graph.setEdge(nodeId, specialId1, edge1, nodeId + \"-cyclic-special-0\");\n graph.setEdge(specialId1, specialId2, edgeMid, nodeId + \"-cyclic-special-1\");\n graph.setEdge(specialId2, nodeId, edge2, nodeId + \"-cyc<lic-special-2\");\n } else {\n graph.setEdge(edge.start, edge.end, { ...edge }, edge.id);\n }\n });\n log.warn(\"Graph at first:\", JSON.stringify(graphlibJson2.write(graph)));\n adjustClustersAndEdges(graph);\n log.warn(\"Graph after XAX:\", JSON.stringify(graphlibJson2.write(graph)));\n const siteConfig = getConfig();\n await recursiveRender(\n element,\n graph,\n data4Layout.type,\n data4Layout.diagramId,\n void 0,\n siteConfig\n );\n}, \"render\");\nexport {\n render\n};\n"],"names":["write","g","json","writeNodes","writeEdges","_.isUndefined","_.clone","_.map","v","nodeValue","parent","node","e","edgeValue","edge","clusterDb","descendants","parents","clear4","__name","isDescendant","id","ancestorId","ancestorDescendants","log","edgeInCluster","clusterId","clusterDescendants","copy","graph","newGraph","rootId","nodes","data","edges","data2","extractDescendants","children","res","child","findCommonEdges","id1","id2","edges1","edges2","edges1Prim","edges2Prim","edgeIn1","findNonClusterChild","reserve","_id","commonEdges","getAnchorId","adjustClustersAndEdges","depth","d1","d2","nonClusterChild","w","graphlibJson.write","extractor","hasChildren","dir","clusterGraph","graphlib.Graph","sorter","result","sorted","sortNodesByHierarchy","recursiveRender","_elem","diagramType","parentCluster","siteConfig","graphlibJson2.write","elem","clusters","edgePaths","edgeLabels","ranksep","nodesep","o","newEl","updateNodeBounds","setNodeElem","insertNode","edgePromises","insertEdgeLabel","dagreLayout","diff","subGraphTitleTotalMargin","getSubGraphTitleMargins","positionNode","halfPadding","labelHeight","offsetY","insertCluster","point","startNode","endNode","paths","insertEdge","positionEdgeLabel","n","render","data4Layout","svg","graphlib2.Graph","element","markers_default","clear3","clear2","clear","nodeId","specialId1","specialId2","edge1","edgeMid","edge2","getConfig"],"mappings":";;;;;;AAKA,SAASA,EAAMC,GAAG;AAChB,MAAIC,IAAO;AAAA,IACT,SAAS;AAAA,MACP,UAAUD,EAAE,WAAU;AAAA,MACtB,YAAYA,EAAE,aAAY;AAAA,MAC1B,UAAUA,EAAE,WAAU;AAAA,IAC5B;AAAA,IACI,OAAOE,GAAWF,CAAC;AAAA,IACnB,OAAOG,GAAWH,CAAC;AAAA,EACvB;AACE,SAAKI,EAAcJ,EAAE,MAAK,CAAE,MAC1BC,EAAK,QAAQI,EAAQL,EAAE,MAAK,CAAE,IAEzBC;AACT;AAEA,SAASC,GAAWF,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUO,GAAG;AACnC,QAAIC,IAAYR,EAAE,KAAKO,CAAC,GACpBE,IAAST,EAAE,OAAOO,CAAC,GACnBG,IAAO,EAAE,GAAGH,EAAC;AACjB,WAAKH,EAAcI,CAAS,MAC1BE,EAAK,QAAQF,IAEVJ,EAAcK,CAAM,MACvBC,EAAK,SAASD,IAETC;AAAA,EACT,CAAC;AACH;AAEA,SAASP,GAAWH,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUW,GAAG;AACnC,QAAIC,IAAYZ,EAAE,KAAKW,CAAC,GACpBE,IAAO,EAAE,GAAGF,EAAE,GAAG,GAAGA,EAAE,EAAC;AAC3B,WAAKP,EAAcO,EAAE,IAAI,MACvBE,EAAK,OAAOF,EAAE,OAEXP,EAAcQ,CAAS,MAC1BC,EAAK,QAAQD,IAERC;AAAA,EACT,CAAC;AACH;ACTA,IAAIC,IAA4B,oBAAI,IAAG,GACnCC,IAA8B,oBAAI,IAAG,GACrCC,IAA0B,oBAAI,IAAG,GACjCC,KAAyB,gBAAAC,EAAO,MAAM;AACxC,EAAAH,EAAY,MAAK,GACjBC,EAAQ,MAAK,GACbF,EAAU,MAAK;AACjB,GAAG,OAAO,GACNK,IAA+B,gBAAAD,EAAO,CAACE,GAAIC,MAAe;AAC5D,QAAMC,IAAsBP,EAAY,IAAIM,CAAU,KAAK,CAAA;AAC3D,SAAAE,EAAI,MAAM,mBAAmBF,GAAY,KAAKD,GAAI,OAAOE,EAAoB,SAASF,CAAE,CAAC,GAClFE,EAAoB,SAASF,CAAE;AACxC,GAAG,cAAc,GACbI,KAAgC,gBAAAN,EAAO,CAACL,GAAMY,MAAc;AAC9D,QAAMC,IAAqBX,EAAY,IAAIU,CAAS,KAAK,CAAA;AAGzD,SAFAF,EAAI,KAAK,mBAAmBE,GAAW,QAAQC,CAAkB,GACjEH,EAAI,KAAK,YAAYV,CAAI,GACrBA,EAAK,MAAMY,KAAaZ,EAAK,MAAMY,IAC9B,KAEJC,IAIEA,EAAmB,SAASb,EAAK,CAAC,KAAKM,EAAaN,EAAK,GAAGY,CAAS,KAAKN,EAAaN,EAAK,GAAGY,CAAS,KAAKC,EAAmB,SAASb,EAAK,CAAC,KAHpJU,EAAI,MAAM,UAAUE,GAAW,qBAAqB,GAC7C;AAGX,GAAG,eAAe,GACdE,IAAuB,gBAAAT,EAAO,CAACO,GAAWG,GAAOC,GAAUC,MAAW;AACxE,EAAAP,EAAI;AAAA,IACF;AAAA,IACAE;AAAA,IACA;AAAA,IACAK;AAAA,IACA;AAAA,IACAF,EAAM,KAAKH,CAAS;AAAA,IACpBK;AAAA,EACJ;AACE,QAAMC,IAAQH,EAAM,SAASH,CAAS,KAAK,CAAA;AAC3C,EAAIA,MAAcK,KAChBC,EAAM,KAAKN,CAAS,GAEtBF,EAAI,KAAK,6BAA6BE,GAAW,SAASM,CAAK,GAC/DA,EAAM,QAAQ,CAACrB,MAAS;AACtB,QAAIkB,EAAM,SAASlB,CAAI,EAAE,SAAS;AAChC,MAAAiB,EAAKjB,GAAMkB,GAAOC,GAAUC,CAAM;AAAA,SAC7B;AACL,YAAME,IAAOJ,EAAM,KAAKlB,CAAI;AAC5B,MAAAa,EAAI,KAAK,OAAOb,GAAM,QAAQoB,GAAQ,iBAAiBL,CAAS,GAChEI,EAAS,QAAQnB,GAAMsB,CAAI,GACvBF,MAAWF,EAAM,OAAOlB,CAAI,MAC9Ba,EAAI,KAAK,kBAAkBb,GAAMkB,EAAM,OAAOlB,CAAI,CAAC,GACnDmB,EAAS,UAAUnB,GAAMkB,EAAM,OAAOlB,CAAI,CAAC,IAEzCe,MAAcK,KAAUpB,MAASe,KACnCF,EAAI,MAAM,kBAAkBb,GAAMe,CAAS,GAC3CI,EAAS,UAAUnB,GAAMe,CAAS,MAElCF,EAAI,KAAK,YAAYE,GAAW,QAAQK,GAAQ,QAAQF,EAAM,KAAKH,CAAS,GAAGK,CAAM,GACrFP,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA;AAAA,QACAe,MAAcK;AAAA,QACd;AAAA,QACApB,MAASe;AAAA,MACnB;AAEM,YAAMQ,IAAQL,EAAM,MAAMlB,CAAI;AAC9B,MAAAa,EAAI,MAAM,iBAAiBU,CAAK,GAChCA,EAAM,QAAQ,CAACpB,MAAS;AACtB,QAAAU,EAAI,KAAK,QAAQV,CAAI;AACrB,cAAMqB,IAAQN,EAAM,KAAKf,EAAK,GAAGA,EAAK,GAAGA,EAAK,IAAI;AAClD,QAAAU,EAAI,KAAK,aAAaW,GAAOJ,CAAM;AACnC,YAAI;AACF,UAAIN,GAAcX,GAAMiB,CAAM,KAC5BP,EAAI,KAAK,eAAeV,EAAK,GAAGA,EAAK,GAAGqB,GAAOrB,EAAK,IAAI,GACxDgB,EAAS,QAAQhB,EAAK,GAAGA,EAAK,GAAGqB,GAAOrB,EAAK,IAAI,GACjDU,EAAI,KAAK,mBAAmBM,EAAS,MAAK,GAAIA,EAAS,KAAKA,EAAS,QAAQ,CAAC,CAAC,CAAC,KAEhFN,EAAI;AAAA,YACF;AAAA,YACAV,EAAK;AAAA,YACL;AAAA,YACAA,EAAK;AAAA,YACL;AAAA,YACAiB;AAAA,YACA;AAAA,YACAL;AAAA,UACd;AAAA,QAEQ,SAASd,GAAG;AACV,UAAAY,EAAI,MAAMZ,CAAC;AAAA,QACb;AAAA,MACF,CAAC;AAAA,IACH;AACA,IAAAY,EAAI,MAAM,iBAAiBb,CAAI,GAC/BkB,EAAM,WAAWlB,CAAI;AAAA,EACvB,CAAC;AACH,GAAG,MAAM,GACLyB,IAAqC,gBAAAjB,EAAO,CAACE,GAAIQ,MAAU;AAC7D,QAAMQ,IAAWR,EAAM,SAASR,CAAE;AAClC,MAAIiB,IAAM,CAAC,GAAGD,CAAQ;AACtB,aAAWE,KAASF;AAClB,IAAApB,EAAQ,IAAIsB,GAAOlB,CAAE,GACrBiB,IAAM,CAAC,GAAGA,GAAK,GAAGF,EAAmBG,GAAOV,CAAK,CAAC;AAEpD,SAAOS;AACT,GAAG,oBAAoB,GACnBE,KAAkC,gBAAArB,EAAO,CAACU,GAAOY,GAAKC,MAAQ;AAChE,QAAMC,IAASd,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAM2B,KAAO3B,EAAK,MAAM2B,CAAG,GACxEG,IAASf,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAM4B,KAAO5B,EAAK,MAAM4B,CAAG,GACxEG,IAAaF,EAAO,IAAI,CAAC7B,OACtB,EAAE,GAAGA,EAAK,MAAM2B,IAAMC,IAAM5B,EAAK,GAAG,GAAGA,EAAK,MAAM2B,IAAMA,IAAM3B,EAAK,EAAC,EAC5E,GACKgC,IAAaF,EAAO,IAAI,CAAC9B,OACtB,EAAE,GAAGA,EAAK,GAAG,GAAGA,EAAK,EAAC,EAC9B;AAID,SAHe+B,EAAW,OAAO,CAACE,MACzBD,EAAW,KAAK,CAAChC,MAASiC,EAAQ,MAAMjC,EAAK,KAAKiC,EAAQ,MAAMjC,EAAK,CAAC,CAC9E;AAEH,GAAG,iBAAiB,GAChBkC,IAAsC,gBAAA7B,EAAO,CAACE,GAAIQ,GAAOH,MAAc;AACzE,QAAMW,IAAWR,EAAM,SAASR,CAAE;AAElC,MADAG,EAAI,MAAM,6BAA6BH,GAAIgB,CAAQ,GAC/CA,EAAS,SAAS;AACpB,WAAOhB;AAET,MAAI4B;AACJ,aAAWV,KAASF,GAAU;AAC5B,UAAMa,IAAMF,EAAoBT,GAAOV,GAAOH,CAAS,GACjDyB,IAAcX,GAAgBX,GAAOH,GAAWwB,CAAG;AACzD,QAAIA;AACF,UAAIC,EAAY,SAAS;AACvB,QAAAF,IAAUC;AAAA;AAEV,eAAOA;AAAA,EAGb;AACA,SAAOD;AACT,GAAG,qBAAqB,GACpBG,IAA8B,gBAAAjC,EAAO,CAACE,MACpC,CAACN,EAAU,IAAIM,CAAE,KAGjB,CAACN,EAAU,IAAIM,CAAE,EAAE,sBACdA,IAELN,EAAU,IAAIM,CAAE,IACXN,EAAU,IAAIM,CAAE,EAAE,KAEpBA,GACN,aAAa,GACZgC,KAAyC,gBAAAlC,EAAO,CAACU,GAAOyB,MAAU;AACpE,MAAI,CAACzB,KAASyB,IAAQ,IAAI;AACxB,IAAA9B,EAAI,MAAM,uBAAuB;AACjC;AAAA,EACF;AACE,IAAAA,EAAI,MAAM,mBAAmB;AAE/B,EAAAK,EAAM,MAAK,EAAG,QAAQ,SAASR,GAAI;AAEjC,IADiBQ,EAAM,SAASR,CAAE,EACrB,SAAS,MACpBG,EAAI;AAAA,MACF;AAAA,MACAH;AAAA,MACA;AAAA,MACA2B,EAAoB3B,GAAIQ,GAAOR,CAAE;AAAA,IACzC,GACML,EAAY,IAAIK,GAAIe,EAAmBf,GAAIQ,CAAK,CAAC,GACjDd,EAAU,IAAIM,GAAI,EAAE,IAAI2B,EAAoB3B,GAAIQ,GAAOR,CAAE,GAAG,aAAaQ,EAAM,KAAKR,CAAE,EAAC,CAAE;AAAA,EAE7F,CAAC,GACDQ,EAAM,MAAK,EAAG,QAAQ,SAASR,GAAI;AACjC,UAAMgB,IAAWR,EAAM,SAASR,CAAE,GAC5Ba,IAAQL,EAAM,MAAK;AACzB,IAAIQ,EAAS,SAAS,KACpBb,EAAI,MAAM,sBAAsBH,GAAIL,CAAW,GAC/CkB,EAAM,QAAQ,CAACpB,MAAS;AACtB,YAAMyC,IAAKnC,EAAaN,EAAK,GAAGO,CAAE,GAC5BmC,IAAKpC,EAAaN,EAAK,GAAGO,CAAE;AAClC,MAAIkC,IAAKC,MACPhC,EAAI,KAAK,UAAUV,GAAM,oBAAoBO,CAAE,GAC/CG,EAAI,KAAK,uBAAuBH,GAAI,MAAML,EAAY,IAAIK,CAAE,CAAC,GAC7DN,EAAU,IAAIM,CAAE,EAAE,sBAAsB;AAAA,IAE5C,CAAC,KAEDG,EAAI,MAAM,kBAAkBH,GAAIL,CAAW;AAAA,EAE/C,CAAC;AACD,WAASK,KAAMN,EAAU,QAAQ;AAC/B,UAAM0C,IAAkB1C,EAAU,IAAIM,CAAE,EAAE,IACpCX,IAASmB,EAAM,OAAO4B,CAAe;AAC3C,IAAI/C,MAAWW,KAAMN,EAAU,IAAIL,CAAM,KAAK,CAACK,EAAU,IAAIL,CAAM,EAAE,wBACnEK,EAAU,IAAIM,CAAE,EAAE,KAAKX;AAAA,EAE3B;AACA,EAAAmB,EAAM,MAAK,EAAG,QAAQ,SAASjB,GAAG;AAChC,UAAME,IAAOe,EAAM,KAAKjB,CAAC;AACzB,IAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUA,CAAC,CAAC,GAChEY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUiB,EAAM,KAAKjB,CAAC,CAAC,CAAC;AAC5E,QAAIJ,IAAII,EAAE,GACN8C,IAAI9C,EAAE;AAYV,QAXAY,EAAI;AAAA,MACF;AAAA,MACAT;AAAA,MACA;AAAA,MACAH,EAAE;AAAA,MACFA,EAAE;AAAA,MACF;AAAA,MACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,MACjB;AAAA,MACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,IACvB,GACQG,EAAU,IAAIH,EAAE,CAAC,KAAKG,EAAU,IAAIH,EAAE,CAAC,GAAG;AAK5C,UAJAY,EAAI,KAAK,oCAAoCZ,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI,GAC7DJ,IAAI4C,EAAYxC,EAAE,CAAC,GACnB8C,IAAIN,EAAYxC,EAAE,CAAC,GACnBiB,EAAM,WAAWjB,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI,GAC7BJ,MAAMI,EAAE,GAAG;AACb,cAAMF,IAASmB,EAAM,OAAOrB,CAAC;AAC7B,QAAAO,EAAU,IAAIL,CAAM,EAAE,sBAAsB,IAC5CI,EAAK,cAAcF,EAAE;AAAA,MACvB;AACA,UAAI8C,MAAM9C,EAAE,GAAG;AACb,cAAMF,IAASmB,EAAM,OAAO6B,CAAC;AAC7B,QAAA3C,EAAU,IAAIL,CAAM,EAAE,sBAAsB,IAC5CI,EAAK,YAAYF,EAAE;AAAA,MACrB;AACA,MAAAY,EAAI,KAAK,0BAA0BhB,GAAGkD,GAAG9C,EAAE,IAAI,GAC/CiB,EAAM,QAAQrB,GAAGkD,GAAG5C,GAAMF,EAAE,IAAI;AAAA,IAClC;AAAA,EACF,CAAC,GACDY,EAAI,KAAK,kBAAkBmC,EAAmB9B,CAAK,CAAC,GACpD+B,EAAU/B,GAAO,CAAC,GAClBL,EAAI,MAAMT,CAAS;AACrB,GAAG,wBAAwB,GACvB6C,IAA4B,gBAAAzC,EAAO,CAACU,GAAOyB,MAAU;AAEvD,MADA9B,EAAI,KAAK,gBAAgB8B,GAAOK,EAAmB9B,CAAK,GAAGA,EAAM,SAAS,GAAG,CAAC,GAC1EyB,IAAQ,IAAI;AACd,IAAA9B,EAAI,MAAM,aAAa;AACvB;AAAA,EACF;AACA,MAAIQ,IAAQH,EAAM,MAAK,GACnBgC,IAAc;AAClB,aAAWlD,KAAQqB,GAAO;AACxB,UAAMK,IAAWR,EAAM,SAASlB,CAAI;AACpC,IAAAkD,IAAcA,KAAexB,EAAS,SAAS;AAAA,EACjD;AACA,MAAI,CAACwB,GAAa;AAChB,IAAArC,EAAI,MAAM,8BAA8BK,EAAM,MAAK,CAAE;AACrD;AAAA,EACF;AACA,EAAAL,EAAI,MAAM,YAAYQ,GAAOsB,CAAK;AAClC,aAAW3C,KAAQqB;AAYjB,QAXAR,EAAI;AAAA,MACF;AAAA,MACAb;AAAA,MACAI;AAAA,MACAA,EAAU,IAAIJ,CAAI,KAAK,CAACI,EAAU,IAAIJ,CAAI,EAAE;AAAA,MAC5C,CAACkB,EAAM,OAAOlB,CAAI;AAAA,MAClBkB,EAAM,KAAKlB,CAAI;AAAA,MACfkB,EAAM,SAAS,GAAG;AAAA,MAClB;AAAA,MACAyB;AAAA,IACN,GACQ,CAACvC,EAAU,IAAIJ,CAAI;AACrB,MAAAa,EAAI,MAAM,iBAAiBb,GAAM2C,CAAK;AAAA,aAC7B,CAACvC,EAAU,IAAIJ,CAAI,EAAE,uBAAuBkB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS,GAAG;AAC9G,MAAAa,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA2C;AAAA,MACR;AAEM,UAAIQ,IADkBjC,EAAM,MAAK,EACT,YAAY,OAAO,OAAO;AAClD,MAAId,EAAU,IAAIJ,CAAI,GAAG,aAAa,QACpCmD,IAAM/C,EAAU,IAAIJ,CAAI,EAAE,YAAY,KACtCa,EAAI,KAAK,cAAcT,EAAU,IAAIJ,CAAI,EAAE,YAAY,KAAKmD,CAAG;AAEjE,YAAMC,IAAe,IAAIC,EAAe;AAAA,QACtC,YAAY;AAAA,QACZ,UAAU;AAAA,MAClB,CAAO,EAAE,SAAS;AAAA,QACV,SAASF;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS;AAAA,MACjB,CAAO,EAAE,oBAAoB,WAAW;AAChC,eAAO,CAAA;AAAA,MACT,CAAC;AACD,MAAAtC,EAAI,KAAK,yBAAyBmC,EAAmB9B,CAAK,CAAC,GAC3DD,EAAKjB,GAAMkB,GAAOkC,GAAcpD,CAAI,GACpCkB,EAAM,QAAQlB,GAAM;AAAA,QAClB,aAAa;AAAA,QACb,IAAIA;AAAA,QACJ,aAAaI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACjC,OAAOI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QAC3B,OAAOoD;AAAA,MACf,CAAO,GACDvC,EAAI,KAAK,gCAAgCb,GAAM,KAAKgD,EAAmBI,CAAY,CAAC,GACpFvC,EAAI,MAAM,wBAAwBmC,EAAmB9B,CAAK,CAAC;AAAA,IAC7D;AACE,MAAAL,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACA;AAAA,QACA,CAACI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACrB;AAAA,QACA,CAACkB,EAAM,OAAOlB,CAAI;AAAA,QAClB;AAAA,QACAkB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS;AAAA,QACtDkB,EAAM,SAAS,GAAG;AAAA,QAClByB;AAAA,MACR,GACM9B,EAAI,MAAMT,CAAS;AAGvB,EAAAiB,IAAQH,EAAM,MAAK,GACnBL,EAAI,KAAK,qBAAqBQ,CAAK;AACnC,aAAWrB,KAAQqB,GAAO;AACxB,UAAMC,IAAOJ,EAAM,KAAKlB,CAAI;AAC5B,IAAAa,EAAI,KAAK,mBAAmBb,GAAMsB,CAAI,GAClCA,GAAM,eACR2B,EAAU3B,EAAK,OAAOqB,IAAQ,CAAC;AAAA,EAEnC;AACF,GAAG,WAAW,GACVW,IAAyB,gBAAA9C,EAAO,CAACU,GAAOG,MAAU;AACpD,MAAIA,EAAM,WAAW;AACnB,WAAO,CAAA;AAET,MAAIkC,IAAS,OAAO,OAAO,CAAA,GAAIlC,CAAK;AACpC,SAAAA,EAAM,QAAQ,CAACrB,MAAS;AACtB,UAAM0B,IAAWR,EAAM,SAASlB,CAAI,GAC9BwD,IAASF,EAAOpC,GAAOQ,CAAQ;AACrC,IAAA6B,IAAS,CAAC,GAAGA,GAAQ,GAAGC,CAAM;AAAA,EAChC,CAAC,GACMD;AACT,GAAG,QAAQ,GACPE,KAAuC,gBAAAjD,EAAO,CAACU,MAAUoC,EAAOpC,GAAOA,EAAM,UAAU,GAAG,sBAAsB,GAGhHwC,IAAkC,gBAAAlD,EAAO,OAAOmD,GAAOzC,GAAO0C,GAAalD,GAAImD,GAAeC,MAAe;AAC/G,EAAAjD,EAAI,KAAK,iCAAiCkD,EAAoB7C,CAAK,GAAG2C,CAAa;AACnF,QAAMV,IAAMjC,EAAM,MAAK,EAAG;AAC1B,EAAAL,EAAI,MAAM,kCAAkCsC,CAAG;AAC/C,QAAMa,IAAOL,EAAM,OAAO,GAAG,EAAE,KAAK,SAAS,MAAM;AACnD,EAAKzC,EAAM,UAGTL,EAAI,KAAK,wBAAwBK,EAAM,MAAK,CAAE,IAF9CL,EAAI,KAAK,sBAAsBK,CAAK,GAIlCA,EAAM,QAAQ,SAAS,KACzBL,EAAI,KAAK,mBAAmBK,EAAM,KAAKA,EAAM,MAAK,EAAG,CAAC,CAAC,CAAC;AAE1D,QAAM+C,IAAWD,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,UAAU,GACpDE,IAAYF,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,WAAW,GACtDG,IAAaH,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,YAAY,GACxD3C,IAAQ2C,EAAK,OAAO,GAAG,EAAE,KAAK,SAAS,OAAO;AACpD,QAAM,QAAQ;AAAA,IACZ9C,EAAM,MAAK,EAAG,IAAI,eAAerB,GAAG;AAClC,YAAMG,IAAOkB,EAAM,KAAKrB,CAAC;AACzB,UAAIgE,MAAkB,QAAQ;AAC5B,cAAMvC,IAAO,KAAK,MAAM,KAAK,UAAUuC,EAAc,WAAW,CAAC;AACjE,QAAAhD,EAAI;AAAA,UACF;AAAA;AAAA,UACAhB;AAAA,UACA;AAAA;AAAA,UACAyB,EAAK;AAAA,UACL;AAAA;AAAA,UACAuC,EAAc;AAAA,QACxB,GACQ3C,EAAM,QAAQ2C,EAAc,IAAIvC,CAAI,GAC/BJ,EAAM,OAAOrB,CAAC,MACjBgB,EAAI,MAAM,kBAAkBhB,GAAGgE,EAAc,EAAE,GAC/C3C,EAAM,UAAUrB,GAAGgE,EAAc,IAAIvC,CAAI;AAAA,MAE7C;AAEA,UADAT,EAAI,KAAK,sBAAsBhB,IAAI,OAAO,KAAK,UAAUqB,EAAM,KAAKrB,CAAC,CAAC,CAAC,GACnEG,GAAM,aAAa;AACrB,QAAAa,EAAI,KAAK,0BAA0BhB,GAAGG,EAAK,OAAOkB,EAAM,KAAKrB,CAAC,CAAC;AAC/D,cAAM,EAAE,SAAAuE,GAAS,SAAAC,MAAYnD,EAAM,MAAK;AACxC,QAAAlB,EAAK,MAAM,SAAS;AAAA,UAClB,GAAGA,EAAK,MAAM,MAAK;AAAA,UACnB,SAASoE,IAAU;AAAA,UACnB,SAAAC;AAAA,QACV,CAAS;AACD,cAAMC,IAAI,MAAMZ;AAAA,UACdrC;AAAA,UACArB,EAAK;AAAA,UACL4D;AAAA,UACAlD;AAAA,UACAQ,EAAM,KAAKrB,CAAC;AAAA,UACZiE;AAAA,QACV,GACcS,IAAQD,EAAE;AAChB,QAAAE,EAAiBxE,GAAMuE,CAAK,GAC5BvE,EAAK,OAAOsE,EAAE,QAAQ,GACtBzD,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACA;AAAA;AAAA,UAEAG,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA;AAAA;AAAA,QAGf,GACQyE,EAAYF,GAAOvE,CAAI;AAAA,MACzB;AACE,QAAIkB,EAAM,SAASrB,CAAC,EAAE,SAAS,KAC7BgB,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA;AAAA,UACAA,EAAK;AAAA,UACL;AAAA,UACAkB;AAAA,QACZ,GACUL,EAAI,MAAMwB,EAAoBrC,EAAK,IAAIkB,CAAK,CAAC,GAC7Cd,EAAU,IAAIJ,EAAK,IAAI,EAAE,IAAIqC,EAAoBrC,EAAK,IAAIkB,CAAK,GAAG,MAAAlB,EAAI,CAAE,MAExEa,EAAI,MAAM,qCAAqChB,GAAGwB,GAAOH,EAAM,KAAKrB,CAAC,GAAGsD,CAAG,GAC3E,MAAMuB,EAAWrD,GAAOH,EAAM,KAAKrB,CAAC,GAAG,EAAE,QAAQiE,GAAY,KAAAX,GAAK;AAAA,IAGxE,CAAC;AAAA,EACL,GAoBE,OAnBqC,gBAAA3C,EAAO,YAAY;AACtD,UAAMmE,IAAezD,EAAM,MAAK,EAAG,IAAI,eAAejB,GAAG;AACvD,YAAME,IAAOe,EAAM,KAAKjB,EAAE,GAAGA,EAAE,GAAGA,EAAE,IAAI;AACxC,MAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUA,CAAC,CAAC,GAChEY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,MAAMA,GAAG,KAAK,KAAK,UAAUiB,EAAM,KAAKjB,CAAC,CAAC,CAAC,GACnFY,EAAI;AAAA,QACF;AAAA,QACAT;AAAA,QACA;AAAA,QACAH,EAAE;AAAA,QACFA,EAAE;AAAA,QACF;AAAA,QACAG,EAAU,IAAIH,EAAE,CAAC;AAAA,QACjBG,EAAU,IAAIH,EAAE,CAAC;AAAA,MACzB,GACM,MAAM2E,EAAgBT,GAAYhE,CAAI;AAAA,IACxC,CAAC;AACD,UAAM,QAAQ,IAAIwE,CAAY;AAAA,EAChC,GAAG,cAAc,GACC,GAClB9D,EAAI,KAAK,wBAAwB,KAAK,UAAUkD,EAAoB7C,CAAK,CAAC,CAAC,GAC3EL,EAAI,KAAK,mDAAmD,GAC5DA,EAAI,KAAK,mDAAmD,GAC5DA,EAAI,KAAK,mDAAmD,GAC5DgE,EAAY3D,CAAK,GACjBL,EAAI,KAAK,uBAAuB,KAAK,UAAUkD,EAAoB7C,CAAK,CAAC,CAAC;AAC1E,MAAI4D,IAAO,GACP,EAAE,0BAAAC,EAAwB,IAAKC,EAAwBlB,CAAU;AACrE,eAAM,QAAQ;AAAA,IACZL,GAAqBvC,CAAK,EAAE,IAAI,eAAerB,GAAG;AAChD,YAAMG,IAAOkB,EAAM,KAAKrB,CAAC;AASzB,UARAgB,EAAI;AAAA,QACF,qBAAqBhB,IAAI,QAAQG,EAAK;AAAA,QACtC,MAAMA,EAAK;AAAA,QACX;AAAA,QACAA,EAAK;AAAA,QACL;AAAA,QACAA,EAAK;AAAA,MACb,GACUA,GAAM;AACR,QAAAA,EAAK,KAAK+E,GACVlE,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLkB,EAAM,OAAOrB,CAAC;AAAA,QACxB,GACQO,EAAU,IAAIJ,EAAK,EAAE,EAAE,OAAOA,GAC9BiF,EAAajF,CAAI;AAAA,eAEbkB,EAAM,SAASrB,CAAC,EAAE,SAAS,GAAG;AAChC,QAAAgB,EAAI;AAAA,UACF;AAAA,UACAhB;AAAA,UACAG,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLkB,EAAM,OAAOrB,CAAC;AAAA,QAC1B,GACUG,EAAK,UAAU+E,GACf7D,EAAM,KAAKlB,EAAK,QAAQ;AACxB,cAAMkF,IAAclF,GAAM,UAAU,KAAK,GACnCmF,IAAcnF,GAAM,WAAW,UAAU,GACzCoF,IAAUD,IAAcD,KAAe;AAC7C,QAAArE,EAAI,MAAM,WAAWuE,GAAS,eAAeD,GAAa,eAAeD,CAAW,GACpF,MAAMG,EAAcpB,GAAUjE,CAAI,GAClCI,EAAU,IAAIJ,EAAK,EAAE,EAAE,OAAOA;AAAA,MAChC,OAAO;AACL,cAAMD,IAASmB,EAAM,KAAKlB,EAAK,QAAQ;AACvC,QAAAA,EAAK,KAAK+E,IAA2B,GACrClE,EAAI;AAAA,UACF;AAAA,UACAb,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACLA,EAAK;AAAA,UACL;AAAA,UACAA,EAAK;AAAA,UACL;AAAA,UACAD;AAAA,UACAA,GAAQ;AAAA,UACRC;AAAA,QACZ,GACUiF,EAAajF,CAAI;AAAA,MACnB;AAAA,IAEJ,CAAC;AAAA,EACL,GACEkB,EAAM,MAAK,EAAG,QAAQ,SAASjB,GAAG;AAChC,UAAME,IAAOe,EAAM,KAAKjB,CAAC;AACzB,IAAAY,EAAI,KAAK,UAAUZ,EAAE,IAAI,SAASA,EAAE,IAAI,OAAO,KAAK,UAAUE,CAAI,GAAGA,CAAI,GACzEA,EAAK,OAAO,QAAQ,CAACmF,MAAUA,EAAM,KAAKP,IAA2B,CAAC;AACtE,UAAMQ,IAAYrE,EAAM,KAAKjB,EAAE,CAAC;AAChC,QAAIuF,IAAUtE,EAAM,KAAKjB,EAAE,CAAC;AAC5B,UAAMwF,IAAQC,EAAWxB,GAAW/D,GAAMC,GAAWwD,GAAa2B,GAAWC,GAAS9E,CAAE;AACxF,IAAAiF,EAAkBxF,GAAMsF,CAAK;AAAA,EAC/B,CAAC,GACDvE,EAAM,MAAK,EAAG,QAAQ,SAASrB,GAAG;AAChC,UAAM+F,IAAI1E,EAAM,KAAKrB,CAAC;AACtB,IAAAgB,EAAI,KAAKhB,GAAG+F,EAAE,MAAMA,EAAE,IAAI,GACtBA,EAAE,YACJd,IAAOc,EAAE;AAAA,EAEb,CAAC,GACD/E,EAAI,KAAK,uCAAuCmD,GAAMc,CAAI,GACnD,EAAE,MAAAd,GAAM,MAAAc,EAAI;AACrB,GAAG,iBAAiB,GAChBe,KAAyB,gBAAArF,EAAO,OAAOsF,GAAaC,MAAQ;AAC9D,QAAM7E,IAAQ,IAAI8E,EAAgB;AAAA,IAChC,YAAY;AAAA,IACZ,UAAU;AAAA,EACd,CAAG,EAAE,SAAS;AAAA,IACV,SAASF,EAAY;AAAA,IACrB,SAASA,EAAY,QAAQ,eAAeA,EAAY,QAAQ,WAAW,eAAeA,EAAY;AAAA,IACtG,SAASA,EAAY,QAAQ,eAAeA,EAAY,QAAQ,WAAW,eAAeA,EAAY;AAAA,IACtG,SAAS;AAAA,IACT,SAAS;AAAA,EACb,CAAG,EAAE,oBAAoB,WAAW;AAChC,WAAO,CAAA;AAAA,EACT,CAAC,GACKG,IAAUF,EAAI,OAAO,GAAG;AAC9B,EAAAG,EAAgBD,GAASH,EAAY,SAASA,EAAY,MAAMA,EAAY,SAAS,GACrFK,EAAM,GACNC,EAAM,GACNC,EAAK,GACL9F,GAAM,GACNuF,EAAY,MAAM,QAAQ,CAAC9F,MAAS;AAClC,IAAAkB,EAAM,QAAQlB,EAAK,IAAI,EAAE,GAAGA,EAAI,CAAE,GAC9BA,EAAK,YACPkB,EAAM,UAAUlB,EAAK,IAAIA,EAAK,QAAQ;AAAA,EAE1C,CAAC,GACDa,EAAI,MAAM,UAAUiF,EAAY,KAAK,GACrCA,EAAY,MAAM,QAAQ,CAAC3F,MAAS;AAClC,QAAIA,EAAK,UAAUA,EAAK,KAAK;AAC3B,YAAMmG,IAASnG,EAAK,OACdoG,IAAaD,IAAS,QAAQA,IAAS,QACvCE,IAAaF,IAAS,QAAQA,IAAS,QACvCtG,IAAOkB,EAAM,KAAKoF,CAAM;AAC9B,MAAApF,EAAM,QAAQqF,GAAY;AAAA,QACxB,OAAOA;AAAA,QACP,IAAIA;AAAA,QACJ,UAAUvG,EAAK;AAAA,QACf,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,SAAS;AAAA,QACT,OAAO;AAAA;AAAA,QAEP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,QAAQ;AAAA,MAChB,CAAO,GACDkB,EAAM,UAAUqF,GAAYvG,EAAK,QAAQ,GACzCkB,EAAM,QAAQsF,GAAY;AAAA,QACxB,OAAOA;AAAA,QACP,IAAIA;AAAA,QACJ,UAAUxG,EAAK;AAAA,QACf,YAAY;AAAA,QACZ,SAAS;AAAA;AAAA,QAET,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,QAAQ;AAAA,MAChB,CAAO,GACDkB,EAAM,UAAUsF,GAAYxG,EAAK,QAAQ;AACzC,YAAMyG,IAAQ,gBAAgBtG,CAAI,GAC5BuG,IAAU,gBAAgBvG,CAAI,GAC9BwG,IAAQ,gBAAgBxG,CAAI;AAClC,MAAAsG,EAAM,QAAQ,IACdA,EAAM,eAAe,QACrBA,EAAM,KAAKH,IAAS,qBACpBI,EAAQ,iBAAiB,QACzBA,EAAQ,eAAe,QACvBA,EAAQ,KAAKJ,IAAS,uBACtBK,EAAM,QAAQ,IACV3G,EAAK,YACPyG,EAAM,cAAcH,GACpBK,EAAM,YAAYL,IAEpBK,EAAM,KAAKL,IAAS,qBACpBK,EAAM,iBAAiB,QACvBzF,EAAM,QAAQoF,GAAQC,GAAYE,GAAOH,IAAS,mBAAmB,GACrEpF,EAAM,QAAQqF,GAAYC,GAAYE,GAASJ,IAAS,mBAAmB,GAC3EpF,EAAM,QAAQsF,GAAYF,GAAQK,GAAOL,IAAS,oBAAoB;AAAA,IACxE;AACE,MAAApF,EAAM,QAAQf,EAAK,OAAOA,EAAK,KAAK,EAAE,GAAGA,EAAI,GAAIA,EAAK,EAAE;AAAA,EAE5D,CAAC,GACDU,EAAI,KAAK,mBAAmB,KAAK,UAAUkD,EAAoB7C,CAAK,CAAC,CAAC,GACtEwB,GAAuBxB,CAAK,GAC5BL,EAAI,KAAK,oBAAoB,KAAK,UAAUkD,EAAoB7C,CAAK,CAAC,CAAC;AACvE,QAAM4C,IAAa8C,EAAS;AAC5B,QAAMlD;AAAA,IACJuC;AAAA,IACA/E;AAAA,IACA4E,EAAY;AAAA,IACZA,EAAY;AAAA,IACZ;AAAA,IACAhC;AAAA,EACJ;AACA,GAAG,QAAQ;","x_google_ignoreList":[0,1]}

package/dist/{diagram-PSM6KHXK-5NyYKVKy.js → diagram-PSM6KHXK-CbqJ09v8.js} RENAMED Viewed

@@ -1,9 +1,9 @@
-import { _ as w, a5 as te, a6 as ae, a9 as he, t as ue, r as J, bq as P, q as Y, o as pe, n as fe, Q as me, U as ge, m as ye, s as Se, a7 as ve, br as xe, a0 as be } from "./createIntentTweetLink-R2TGMXxb.js";
-import { s as we } from "./chunk-QN33PNHL-C2jhEFgD.js";
-import { p as Ce } from "./chunk-4BX2VUAB-DTN5uvgP.js";
-import { p as Te } from "./mermaid-parser.core-CRCSS3x9.js";
+import { _ as w, a7 as te, a8 as ae, ab as he, v as ue, u as K, bs as P, t as Y, q as pe, p as fe, V as ge, W as me, o as ye, s as Se, a9 as ve, bt as xe, a2 as be } from "./extractHeadings-rFktacYX.js";
+import { s as we } from "./chunk-QN33PNHL-BI7lthQH.js";
+import { p as Ce } from "./chunk-4BX2VUAB-zyP_hoML.js";
+import { p as Te } from "./mermaid-parser.core-DoZecKQv.js";
 import { b as O } from "./defaultLocale-D7EN2tov.js";
-import { o as Z } from "./ordinal-DfAQgscy.js";
+import { o as J } from "./ordinal-DfAQgscy.js";
 function Le(t) {
   var a = 0, l = t.children, n = l && l.length;
   if (!n) a = 1;
@@ -27,12 +27,12 @@ function Fe(t, a) {
   return this;
 }
 function ke(t, a) {
-  for (var l = this, n = [l], o = [], s, d, h, m = -1; l = n.pop(); )
+  for (var l = this, n = [l], o = [], s, d, h, g = -1; l = n.pop(); )
     if (o.push(l), s = l.children)
       for (d = 0, h = s.length; d < h; ++d)
         n.push(s[d]);
   for (; l = o.pop(); )
-    t.call(a, l, ++m, this);
+    t.call(a, l, ++g, this);
   return this;
 }
 function Ne(t, a) {
@@ -86,7 +86,7 @@ function Re() {
     l !== t && a.push({ source: l.parent, target: l });
   }), a;
 }
-function* Ee() {
+function* We() {
   var t = this, a, l = [t], n, o, s;
   do
     for (a = l.reverse(), l = []; t = a.pop(); )
@@ -95,16 +95,16 @@ function* Ee() {
           l.push(n[o]);
   while (l.length);
 }
-function K(t, a) {
+function Q(t, a) {
   t instanceof Map ? (t = [void 0, t], a === void 0 && (a = Ie)) : a === void 0 && (a = He);
-  for (var l = new U(t), n, o = [l], s, d, h, m; n = o.pop(); )
-    if ((d = a(n.data)) && (m = (d = Array.from(d)).length))
-      for (n.children = d, h = m - 1; h >= 0; --h)
+  for (var l = new U(t), n, o = [l], s, d, h, g; n = o.pop(); )
+    if ((d = a(n.data)) && (g = (d = Array.from(d)).length))
+      for (n.children = d, h = g - 1; h >= 0; --h)
         o.push(s = d[h] = new U(d[h])), s.parent = n, s.depth = n.depth + 1;
   return l.eachBefore(qe);
 }
-function We() {
-  return K(this).eachBefore(Oe);
+function Ee() {
+  return Q(this).eachBefore(Oe);
 }
 function He(t) {
   return t.children;
@@ -124,7 +124,7 @@ function qe(t) {
 function U(t) {
   this.data = t, this.depth = this.height = 0, this.parent = null;
 }
-U.prototype = K.prototype = {
+U.prototype = Q.prototype = {
   constructor: U,
   count: $e,
   each: Ae,
@@ -138,8 +138,8 @@ U.prototype = K.prototype = {
   descendants: Pe,
   leaves: Be,
   links: Re,
-  copy: We,
-  [Symbol.iterator]: Ee
+  copy: Ee,
+  [Symbol.iterator]: We
 };
 function Ge(t) {
   if (typeof t != "function") throw new Error();
@@ -157,47 +157,47 @@ function Xe(t) {
   t.x0 = Math.round(t.x0), t.y0 = Math.round(t.y0), t.x1 = Math.round(t.x1), t.y1 = Math.round(t.y1);
 }
 function je(t, a, l, n, o) {
-  for (var s = t.children, d, h = -1, m = s.length, c = t.value && (n - a) / t.value; ++h < m; )
+  for (var s = t.children, d, h = -1, g = s.length, c = t.value && (n - a) / t.value; ++h < g; )
     d = s[h], d.y0 = l, d.y1 = o, d.x0 = a, d.x1 = a += d.value * c;
 }
 function Ye(t, a, l, n, o) {
-  for (var s = t.children, d, h = -1, m = s.length, c = t.value && (o - l) / t.value; ++h < m; )
+  for (var s = t.children, d, h = -1, g = s.length, c = t.value && (o - l) / t.value; ++h < g; )
     d = s[h], d.x0 = a, d.x1 = n, d.y0 = l, d.y1 = l += d.value * c;
 }
 var Ue = (1 + Math.sqrt(5)) / 2;
-function Qe(t, a, l, n, o, s) {
-  for (var d = [], h = a.children, m, c, u = 0, b = 0, r = h.length, x, S, v = a.value, p, g, N, k, V, E, M; u < r; ) {
+function Ze(t, a, l, n, o, s) {
+  for (var d = [], h = a.children, g, c, u = 0, b = 0, r = h.length, x, S, v = a.value, p, m, N, k, V, W, M; u < r; ) {
     x = o - l, S = s - n;
     do
       p = h[b++].value;
     while (!p && b < r);
-    for (g = N = p, E = Math.max(S / x, x / S) / (v * t), M = p * p * E, V = Math.max(N / M, M / g); b < r; ++b) {
-      if (p += c = h[b].value, c < g && (g = c), c > N && (N = c), M = p * p * E, k = Math.max(N / M, M / g), k > V) {
+    for (m = N = p, W = Math.max(S / x, x / S) / (v * t), M = p * p * W, V = Math.max(N / M, M / m); b < r; ++b) {
+      if (p += c = h[b].value, c < m && (m = c), c > N && (N = c), M = p * p * W, k = Math.max(N / M, M / m), k > V) {
         p -= c;
         break;
       }
       V = k;
     }
-    d.push(m = { value: p, dice: x < S, children: h.slice(u, b) }), m.dice ? je(m, l, n, o, v ? n += S * p / v : s) : Ye(m, l, n, v ? l += x * p / v : o, s), v -= p, u = b;
+    d.push(g = { value: p, dice: x < S, children: h.slice(u, b) }), g.dice ? je(g, l, n, o, v ? n += S * p / v : s) : Ye(g, l, n, v ? l += x * p / v : o, s), v -= p, u = b;
   }
   return d;
 }
-const Ze = (function t(a) {
+const Je = (function t(a) {
   function l(n, o, s, d, h) {
-    Qe(a, n, o, s, d, h);
+    Ze(a, n, o, s, d, h);
   }
   return l.ratio = function(n) {
     return t((n = +n) > 1 ? n : 1);
   }, l;
 })(Ue);
-function Je() {
-  var t = Ze, a = !1, l = 1, n = 1, o = [0], s = q, d = q, h = q, m = q, c = q;
+function Ke() {
+  var t = Je, a = !1, l = 1, n = 1, o = [0], s = q, d = q, h = q, g = q, c = q;
   function u(r) {
     return r.x0 = r.y0 = 0, r.x1 = l, r.y1 = n, r.eachBefore(b), o = [0], a && r.eachBefore(Xe), r;
   }
   function b(r) {
-    var x = o[r.depth], S = r.x0 + x, v = r.y0 + x, p = r.x1 - x, g = r.y1 - x;
-    p < S && (S = p = (S + p) / 2), g < v && (v = g = (v + g) / 2), r.x0 = S, r.y0 = v, r.x1 = p, r.y1 = g, r.children && (x = o[r.depth + 1] = s(r) / 2, S += c(r) - x, v += d(r) - x, p -= h(r) - x, g -= m(r) - x, p < S && (S = p = (S + p) / 2), g < v && (v = g = (v + g) / 2), t(r, S, v, p, g));
+    var x = o[r.depth], S = r.x0 + x, v = r.y0 + x, p = r.x1 - x, m = r.y1 - x;
+    p < S && (S = p = (S + p) / 2), m < v && (v = m = (v + m) / 2), r.x0 = S, r.y0 = v, r.x1 = p, r.y1 = m, r.children && (x = o[r.depth + 1] = s(r) / 2, S += c(r) - x, v += d(r) - x, p -= h(r) - x, m -= g(r) - x, p < S && (S = p = (S + p) / 2), m < v && (v = m = (v + m) / 2), t(r, S, v, p, m));
   }
   return u.round = function(r) {
     return arguments.length ? (a = !!r, u) : a;
@@ -216,14 +216,14 @@ function Je() {
   }, u.paddingRight = function(r) {
     return arguments.length ? (h = typeof r == "function" ? r : G(+r), u) : h;
   }, u.paddingBottom = function(r) {
-    return arguments.length ? (m = typeof r == "function" ? r : G(+r), u) : m;
+    return arguments.length ? (g = typeof r == "function" ? r : G(+r), u) : g;
   }, u.paddingLeft = function(r) {
     return arguments.length ? (c = typeof r == "function" ? r : G(+r), u) : c;
   }, u;
 }
 var R, ne = (R = class {
   constructor() {
-    this.nodes = [], this.levels = /* @__PURE__ */ new Map(), this.outerNodes = [], this.classes = /* @__PURE__ */ new Map(), this.setAccTitle = pe, this.getAccTitle = fe, this.setDiagramTitle = me, this.getDiagramTitle = ge, this.getAccDescription = ye, this.setAccDescription = Se;
+    this.nodes = [], this.levels = /* @__PURE__ */ new Map(), this.outerNodes = [], this.classes = /* @__PURE__ */ new Map(), this.setAccTitle = pe, this.getAccTitle = fe, this.setDiagramTitle = ge, this.getDiagramTitle = me, this.getAccDescription = ye, this.setAccDescription = Se;
   }
   getNodes() {
     return this.nodes;
@@ -278,7 +278,7 @@ function le(t) {
   }), a;
 }
 w(le, "buildHierarchy");
-var Ke = /* @__PURE__ */ w((t, a) => {
+var Qe = /* @__PURE__ */ w((t, a) => {
   Ce(t, a);
   const l = [];
   for (const s of t.TreemapRows ?? [])
@@ -287,9 +287,9 @@ var Ke = /* @__PURE__ */ w((t, a) => {
     const d = s.item;
     if (!d)
       continue;
-    const h = s.indent ? parseInt(s.indent) : 0, m = et(d), c = d.classSelector ? a.getStylesForClass(d.classSelector) : [], u = c.length > 0 ? c.join(";") : void 0, b = {
+    const h = s.indent ? parseInt(s.indent) : 0, g = et(d), c = d.classSelector ? a.getStylesForClass(d.classSelector) : [], u = c.length > 0 ? c.join(";") : void 0, b = {
       level: h,
-      name: m,
+      name: g,
       type: d.$type,
       value: d.value,
       classSelector: d.classSelector,
@@ -308,20 +308,20 @@ var Ke = /* @__PURE__ */ w((t, a) => {
   parse: /* @__PURE__ */ w(async (t) => {
     try {
       const l = await Te("treemap", t);
-      J.debug("Treemap AST:", l);
+      K.debug("Treemap AST:", l);
       const n = re.parser?.yy;
       if (!(n instanceof ne))
         throw new Error(
           "parser.parser?.yy was not a TreemapDB. This is due to a bug within Mermaid, please report this issue at https://github.com/mermaid-js/mermaid/issues."
         );
-      Ke(l, n);
+      Qe(l, n);
     } catch (a) {
-      throw J.error("Error parsing treemap:", a), a;
+      throw K.error("Error parsing treemap:", a), a;
     }
   }, "parse")
 }, tt = 10, B = 10, X = 25, at = /* @__PURE__ */ w((t, a, l, n) => {
-  const o = n.db, s = o.getConfig(), d = s.padding ?? tt, h = o.getDiagramTitle(), m = o.getRoot(), { themeVariables: c } = ae();
-  if (!m)
+  const o = n.db, s = o.getConfig(), d = s.padding ?? tt, h = o.getDiagramTitle(), g = o.getRoot(), { themeVariables: c } = ae();
+  if (!g)
     return;
   const u = h ? 30 : 0, b = he(a), r = s.nodeWidth ? s.nodeWidth * B : 960, x = s.nodeHeight ? s.nodeHeight * B : 500, S = r, v = x + u;
   b.attr("viewBox", `0 0 ${S} ${v}`), ue(b, v, S, s.useMaxWidth);
@@ -339,9 +339,9 @@ var Ke = /* @__PURE__ */ w((t, a) => {
     } else
       p = O(e);
   } catch (e) {
-    J.error("Error creating format function:", e), p = O(",");
+    K.error("Error creating format function:", e), p = O(",");
   }
-  const g = Z().range([
+  const m = J().range([
     "transparent",
     c.cScale0,
     c.cScale1,
@@ -355,7 +355,7 @@ var Ke = /* @__PURE__ */ w((t, a) => {
     c.cScale9,
     c.cScale10,
     c.cScale11
-  ]), N = Z().range([
+  ]), N = J().range([
     "transparent",
     c.cScalePeer0,
     c.cScalePeer1,
@@ -369,7 +369,7 @@ var Ke = /* @__PURE__ */ w((t, a) => {
     c.cScalePeer9,
     c.cScalePeer10,
     c.cScalePeer11
-  ]), k = Z().range([
+  ]), k = J().range([
     c.cScaleLabel0,
     c.cScaleLabel1,
     c.cScaleLabel2,
@@ -384,15 +384,15 @@ var Ke = /* @__PURE__ */ w((t, a) => {
     c.cScaleLabel11
   ]);
   h && b.append("text").attr("x", S / 2).attr("y", u / 2).attr("class", "treemapTitle").attr("text-anchor", "middle").attr("dominant-baseline", "middle").text(h);
-  const V = b.append("g").attr("transform", `translate(0, ${u})`).attr("class", "treemapContainer"), E = K(m).sum((e) => e.value ?? 0).sort((e, i) => (i.value ?? 0) - (e.value ?? 0)), ee = Je().size([r, x]).paddingTop(
+  const V = b.append("g").attr("transform", `translate(0, ${u})`).attr("class", "treemapContainer"), W = Q(g).sum((e) => e.value ?? 0).sort((e, i) => (i.value ?? 0) - (e.value ?? 0)), ee = Ke().size([r, x]).paddingTop(
     (e) => e.children && e.children.length > 0 ? X + B : 0
-  ).paddingInner(d).paddingLeft((e) => e.children && e.children.length > 0 ? B : 0).paddingRight((e) => e.children && e.children.length > 0 ? B : 0).paddingBottom((e) => e.children && e.children.length > 0 ? B : 0).round(!0)(E), se = ee.descendants().filter((e) => e.children && e.children.length > 0), W = V.selectAll(".treemapSection").data(se).enter().append("g").attr("class", "treemapSection").attr("transform", (e) => `translate(${e.x0},${e.y0})`);
-  W.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", X).attr("class", "treemapSectionHeader").attr("fill", "none").attr("fill-opacity", 0.6).attr("stroke-width", 0.6).attr("style", (e) => e.depth === 0 ? "display: none;" : ""), W.append("clipPath").attr("id", (e, i) => `clip-section-${a}-${i}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 12)).attr("height", X), W.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", (e, i) => `treemapSection section${i}`).attr("fill", (e) => g(e.data.name)).attr("fill-opacity", 0.6).attr("stroke", (e) => N(e.data.name)).attr("stroke-width", 2).attr("stroke-opacity", 0.4).attr("style", (e) => {
+  ).paddingInner(d).paddingLeft((e) => e.children && e.children.length > 0 ? B : 0).paddingRight((e) => e.children && e.children.length > 0 ? B : 0).paddingBottom((e) => e.children && e.children.length > 0 ? B : 0).round(!0)(W), se = ee.descendants().filter((e) => e.children && e.children.length > 0), E = V.selectAll(".treemapSection").data(se).enter().append("g").attr("class", "treemapSection").attr("transform", (e) => `translate(${e.x0},${e.y0})`);
+  E.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", X).attr("class", "treemapSectionHeader").attr("fill", "none").attr("fill-opacity", 0.6).attr("stroke-width", 0.6).attr("style", (e) => e.depth === 0 ? "display: none;" : ""), E.append("clipPath").attr("id", (e, i) => `clip-section-${a}-${i}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 12)).attr("height", X), E.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", (e, i) => `treemapSection section${i}`).attr("fill", (e) => m(e.data.name)).attr("fill-opacity", 0.6).attr("stroke", (e) => N(e.data.name)).attr("stroke-width", 2).attr("stroke-opacity", 0.4).attr("style", (e) => {
     if (e.depth === 0)
       return "display: none;";
     const i = P({ cssCompiledStyles: e.data.cssCompiledStyles });
     return i.nodeStyles + ";" + i.borderStyles.join(";");
-  }), W.append("text").attr("class", "treemapSectionLabel").attr("x", 6).attr("y", X / 2).attr("dominant-baseline", "middle").text((e) => e.depth === 0 ? "" : e.data.name).attr("font-weight", "bold").attr("style", (e) => {
+  }), E.append("text").attr("class", "treemapSectionLabel").attr("x", 6).attr("y", X / 2).attr("dominant-baseline", "middle").text((e) => e.depth === 0 ? "" : e.data.name).attr("font-weight", "bold").attr("style", (e) => {
     if (e.depth === 0)
       return "display: none;";
     const i = "dominant-baseline: middle; font-size: 12px; fill:" + k(e.data.name) + "; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;", f = P({ cssCompiledStyles: e.data.cssCompiledStyles });
@@ -417,14 +417,14 @@ var Ke = /* @__PURE__ */ w((t, a) => {
           break;
       }
     }
-  }), s.showValues !== !1 && W.append("text").attr("class", "treemapSectionValue").attr("x", (e) => e.x1 - e.x0 - 10).attr("y", X / 2).attr("text-anchor", "end").attr("dominant-baseline", "middle").text((e) => e.value ? p(e.value) : "").attr("font-style", "italic").attr("style", (e) => {
+  }), s.showValues !== !1 && E.append("text").attr("class", "treemapSectionValue").attr("x", (e) => e.x1 - e.x0 - 10).attr("y", X / 2).attr("text-anchor", "end").attr("dominant-baseline", "middle").text((e) => e.value ? p(e.value) : "").attr("font-style", "italic").attr("style", (e) => {
     if (e.depth === 0)
       return "display: none;";
     const i = "text-anchor: end; dominant-baseline: middle; font-size: 10px; fill:" + k(e.data.name) + "; white-space: nowrap; overflow: hidden; text-overflow: ellipsis;", f = P({ cssCompiledStyles: e.data.cssCompiledStyles });
     return i + f.labelStyles.replace("color:", "fill:");
   });
   const ie = ee.leaves(), j = V.selectAll(".treemapLeafGroup").data(ie).enter().append("g").attr("class", (e, i) => `treemapNode treemapLeafGroup leaf${i}${e.data.classSelector ? ` ${e.data.classSelector}` : ""}x`).attr("transform", (e) => `translate(${e.x0},${e.y0})`);
-  j.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", "treemapLeaf").attr("fill", (e) => e.parent ? g(e.parent.data.name) : g(e.data.name)).attr("style", (e) => P({ cssCompiledStyles: e.data.cssCompiledStyles }).nodeStyles).attr("fill-opacity", 0.3).attr("stroke", (e) => e.parent ? g(e.parent.data.name) : g(e.data.name)).attr("stroke-width", 3), j.append("clipPath").attr("id", (e, i) => `clip-${a}-${i}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 4)).attr("height", (e) => Math.max(0, e.y1 - e.y0 - 4)), j.append("text").attr("class", "treemapLabel").attr("x", (e) => (e.x1 - e.x0) / 2).attr("y", (e) => (e.y1 - e.y0) / 2).attr("style", (e) => {
+  j.append("rect").attr("width", (e) => e.x1 - e.x0).attr("height", (e) => e.y1 - e.y0).attr("class", "treemapLeaf").attr("fill", (e) => e.parent ? m(e.parent.data.name) : m(e.data.name)).attr("style", (e) => P({ cssCompiledStyles: e.data.cssCompiledStyles }).nodeStyles).attr("fill-opacity", 0.3).attr("stroke", (e) => e.parent ? m(e.parent.data.name) : m(e.data.name)).attr("stroke-width", 3), j.append("clipPath").attr("id", (e, i) => `clip-${a}-${i}`).append("rect").attr("width", (e) => Math.max(0, e.x1 - e.x0 - 4)).attr("height", (e) => Math.max(0, e.y1 - e.y0 - 4)), j.append("text").attr("class", "treemapLabel").attr("x", (e) => (e.x1 - e.x0) / 2).attr("y", (e) => (e.y1 - e.y0) / 2).attr("style", (e) => {
     const i = "text-anchor: middle; dominant-baseline: middle; font-size: 38px;fill:" + k(e.data.name) + ";", f = P({ cssCompiledStyles: e.data.cssCompiledStyles });
     return i + f.labelStyles.replace("color:", "fill:");
   }).attr("clip-path", (e, i) => `url(#clip-${a}-${i})`).text((e) => e.data.name).each(function(e) {
@@ -440,12 +440,12 @@ var Ke = /* @__PURE__ */ w((t, a) => {
     let I = Math.max(
       z,
       Math.min(F, Math.round(y * T))
-    ), Q = y + H + I;
-    for (; Q > A && y > _ && (y--, I = Math.max(
+    ), Z = y + H + I;
+    for (; Z > A && y > _ && (y--, I = Math.max(
       z,
       Math.min(F, Math.round(y * T))
     ), !(I < z && y === _)); )
-      i.style("font-size", `${y}px`), Q = y + H + I;
+      i.style("font-size", `${y}px`), Z = y + H + I;
     i.style("font-size", `${y}px`), (L.getComputedTextLength() > D || y < _ || A < y) && i.style("display", "none");
   }), s.showValues !== !1 && j.append("text").attr("class", "treemapValue").attr("x", (i) => (i.x1 - i.x0) / 2).attr("y", function(i) {
     return (i.y1 - i.y0) / 2;
@@ -518,7 +518,7 @@ var Ke = /* @__PURE__ */ w((t, a) => {
     font-size: ${a.titleFontSize};
   }
   `;
-}, "getStyles"), it = st, mt = {
+}, "getStyles"), it = st, gt = {
   parser: re,
   get db() {
     return new ne();
@@ -527,6 +527,6 @@ var Ke = /* @__PURE__ */ w((t, a) => {
   styles: it
 };
 export {
-  mt as diagram
+  gt as diagram
 };
-//# sourceMappingURL=diagram-PSM6KHXK-5NyYKVKy.js.map
+//# sourceMappingURL=diagram-PSM6KHXK-CbqJ09v8.js.map