@aiquants/markdown 1.8.0 → 1.9.0

package/dist/{chunk-RYQCIY6F-BuIkG6A2.js → chunk-RYQCIY6F-BBUUnDvx.js}

@@ -1,4 +1,4 @@
-import { _ as u, a1 as i } from "./extractHeadings-BH0T7P4n.js";
+import { _ as u, a1 as i } from "./extractHeadings-Bfq3sy4n.js";
 import { i as m, G as y } from "./graph-DAHC4kPm.js";
 import { b as _, m as X } from "./map-DRdzG8Ho.js";
 var j = 4;
@@ -311,4 +311,4 @@ export {
   W as s,
   C as w
 };
-//# sourceMappingURL=chunk-RYQCIY6F-BuIkG6A2.js.map
+//# sourceMappingURL=chunk-RYQCIY6F-BBUUnDvx.js.map

package/dist/{chunk-RYQCIY6F-BuIkG6A2.js.map → chunk-RYQCIY6F-BBUUnDvx.js.map}

@@ -1 +1 @@
-{"version":3,"file":"chunk-RYQCIY6F-BuIkG6A2.js","sources":["../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/clone.js","../../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/json.js","../../../node_modules/.pnpm/mermaid@11.16.0/node_modules/mermaid/dist/chunks/mermaid.core/chunk-RYQCIY6F.mjs"],"sourcesContent":["import baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nexport default clone;\n","import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\n/**\n * @import { NodeID, EdgeObj, GraphOptions } from './graph.js';\n */\n\nexport { write, read };\n\n/**\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n *\n * @typedef {object} GraphJSON\n * @property {Required<GraphOptions>} options - The options used to create the graph.\n * @property {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} nodes - The nodes in the graph.\n * @property {Array<EdgeObj & { value?: EdgeLabel }>} edges - The edges in the graph.\n * @property {GraphLabel} [value] - The graph's value, if any.\n */\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a\n * string with\n * [JSON.stringify](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify).\n * The graph can later be restored using {@link read}.\n *\n * @example\n *\n * ```js\n * var g = new graphlib.Graph();\n * g.setNode(\"a\", { label: \"node a\" });\n * g.setNode(\"b\", { label: \"node b\" });\n * g.setEdge(\"a\", \"b\", { label: \"edge a->b\" });\n * graphlib.json.write(g);\n * // Returns the object:\n * //\n * // {\n * //   \"options\": {\n * //     \"directed\": true,\n * //     \"multigraph\": false,\n * //     \"compound\": false\n * //   },\n * //   \"nodes\": [\n * //     { \"v\": \"a\", \"value\": { \"label\": \"node a\" } },\n * //     { \"v\": \"b\", \"value\": { \"label\": \"node b\" } }\n * //   ],\n * //   \"edges\": [\n * //     { \"v\": \"a\", \"w\": \"b\", \"value\": { \"label\": \"edge a->b\" } }\n * //   ]\n * // }\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {Graph<GraphLabel, NodeLabel, EdgeLabel>} g - The graph to serialize.\n * @returns {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} The JSON representation of the graph.\n */\nfunction write(g) {\n  /** @type {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} */\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\n/**\n * @template NodeLabel - Label of a node.\n *\n * @param {Graph<unknown, NodeLabel, unknown>} g - The graph to serialize.\n * @returns {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} The nodes in the graph.\n */\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function (v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    /** @type {{ v: NodeID; value?: NodeLabel; parent?: NodeID }} */\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\n/**\n * @template EdgeLabel - Label of a node.\n *\n * @param {Graph<unknown, unknown, EdgeLabel>} g - The graph to serialize.\n * @returns {Array<EdgeObj & { value?: EdgeLabel }>} The edges in the graph.\n */\nfunction writeEdges(g) {\n  return _.map(g.edges(), function (e) {\n    var edgeValue = g.edge(e);\n    /** @type {EdgeObj & { value?: EdgeLabel }} */\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\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @example\n *\n * For example, if we have serialized the graph in {@link write}\n * to a string named `str`, we can restore it to a graph as follows:\n *\n * ```js\n * var g2 = graphlib.json.read(JSON.parse(str));\n * // or, in order to copy the graph\n * var g3 = graphlib.json.read(graphlib.json.write(g))\n *\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} json - The JSON representation of the graph.\n * @returns {Graph<GraphLabel, NodeLabel, EdgeLabel>} The restored graph.\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  log\n} from \"./chunk-X3CZISLH.mjs\";\nimport {\n  __name\n} from \"./chunk-Y2CYZVJY.mjs\";\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 clear = /* @__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            const rootDescendants = descendants.get(rootId) || [];\n            const vIn = rootDescendants.includes(edge.v) || isDescendant(edge.v, rootId) || edge.v === rootId;\n            const wIn = rootDescendants.includes(edge.w) || isDescendant(edge.w, rootId) || edge.w === rootId;\n            if (vIn && wIn) {\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              const newV = vIn ? rootId : edge.v;\n              const newW = wIn ? rootId : edge.w;\n              log.info(\"Rebinding cross-boundary edge as \", newV, newW, data2, edge.name);\n              graph.setEdge(newV, newW, data2, edge.name);\n            }\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    const hasDirectOutgoingEdge = graph.edges().some((edge) => edge.v === id);\n    if (nonClusterChild && clusterDb.get(id)?.externalConnections && hasDirectOutgoingEdge && isNodeInExtractableCluster(graph, nonClusterChild, id)) {\n      const safeAnchor = findSafeAnchorNode(graph, id, graph.parent(nonClusterChild));\n      if (safeAnchor) {\n        clusterDb.get(id).id = safeAnchor;\n      }\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)?.clusterData?.explicitDir && graph.children(node) && graph.children(node).length > 0) {\n      log.warn(\"Cluster with explicit dir, creating subgraph for children\", node, depth);\n      const dir = clusterDb.get(node).clusterData.dir;\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      copy(node, graph, clusterGraph, node);\n      const clusterNodeData = graph.node(node) || {};\n      graph.setNode(node, {\n        ...clusterNodeData,\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(\n        \"Subgraph for cluster with explicit dir created:\",\n        node,\n        graphlibJson.write(clusterGraph)\n      );\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      copy(node, graph, clusterGraph, node);\n      const clusterNodeData = graph.node(node) || {};\n      graph.setNode(node, {\n        ...clusterNodeData,\n        clusterNode: true,\n        id: node,\n        clusterData: clusterDb.get(node).clusterData,\n        label: clusterDb.get(node).label,\n        graph: clusterGraph\n      });\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\");\nvar isNodeInExtractableCluster = /* @__PURE__ */ __name((graph, node, rootId) => {\n  let parent = graph.parent(node);\n  while (parent && parent !== rootId) {\n    const cluster = clusterDb.get(parent);\n    if (cluster && !cluster.externalConnections) {\n      return true;\n    }\n    parent = graph.parent(parent);\n  }\n  return false;\n}, \"isNodeInExtractableCluster\");\nvar findSafeAnchorNode = /* @__PURE__ */ __name((graph, clusterId, excludedCluster) => {\n  const children = graph.children(clusterId) ?? [];\n  for (const child of children) {\n    if (child === excludedCluster || isDescendant(child, excludedCluster)) {\n      continue;\n    }\n    const candidate = findNonClusterChild(child, graph, clusterId);\n    if (!candidate) {\n      continue;\n    }\n    if (!isNodeInExtractableCluster(graph, candidate, clusterId)) {\n      return candidate;\n    }\n  }\n  return null;\n}, \"findSafeAnchorNode\");\n\nexport {\n  clusterDb,\n  clear,\n  findNonClusterChild,\n  adjustClustersAndEdges,\n  sortNodesByHierarchy\n};\n"],"names":["CLONE_SYMBOLS_FLAG","clone","value","baseClone","write","g","json","writeNodes","writeEdges","_.isUndefined","_.clone","_.map","v","nodeValue","parent","node","e","edgeValue","edge","clusterDb","descendants","parents","clear","__name","isDescendant","id","ancestorId","ancestorDescendants","log","edgeInCluster","clusterId","clusterDescendants","copy","graph","newGraph","rootId","nodes","data","edges","data2","rootDescendants","vIn","wIn","newV","newW","extractDescendants","children","res","child","findCommonEdges","id1","id2","edges1","edges2","edges1Prim","edges2Prim","edgeIn1","findNonClusterChild","reserve","_id","commonEdges","getAnchorId","adjustClustersAndEdges","depth","d1","d2","nonClusterChild","hasDirectOutgoingEdge","isNodeInExtractableCluster","safeAnchor","findSafeAnchorNode","w","graphlibJson.write","extractor","hasChildren","dir","clusterGraph","graphlib.Graph","clusterNodeData","sorter","result","sorted","sortNodesByHierarchy","cluster","excludedCluster","candidate"],"mappings":";;;AAGA,IAAIA,IAAqB;AA4BzB,SAASC,EAAMC,GAAO;AACpB,SAAOC,EAAUD,GAAOF,CAAkB;AAC5C;AC0BA,SAASI,EAAMC,GAAG;AAEhB,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,EAAWF,CAAC;AAAA,IACnB,OAAOG,EAAWH,CAAC;AAAA,EACvB;AACE,SAAKI,EAAcJ,EAAE,MAAK,CAAE,MAC1BC,EAAK,QAAQI,EAAQL,EAAE,MAAK,CAAE,IAEzBC;AACT;AAQA,SAASC,EAAWF,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUO,GAAG;AACnC,QAAIC,IAAYR,EAAE,KAAKO,CAAC,GACpBE,IAAST,EAAE,OAAOO,CAAC,GAEnBG,IAAO,EAAE,GAAGH,EAAC;AACjB,WAAKH,EAAcI,CAAS,MAC1BE,EAAK,QAAQF,IAEVJ,EAAcK,CAAM,MACvBC,EAAK,SAASD,IAETC;AAAA,EACT,CAAC;AACH;AAQA,SAASP,EAAWH,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUW,GAAG;AACnC,QAAIC,IAAYZ,EAAE,KAAKW,CAAC,GAEpBE,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;AC3GG,IAACC,IAA4B,oBAAI,IAAG,GACnCC,IAA8B,oBAAI,IAAG,GACrCC,IAA0B,oBAAI,IAAG,GACjCC,IAAwB,gBAAAC,EAAO,MAAM;AACvC,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,IAAgC,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,cAAIN,EAAcX,GAAMiB,CAAM,GAAG;AAC/B,kBAAMK,IAAkBpB,EAAY,IAAIe,CAAM,KAAK,CAAA,GAC7CM,IAAMD,EAAgB,SAAStB,EAAK,CAAC,KAAKM,EAAaN,EAAK,GAAGiB,CAAM,KAAKjB,EAAK,MAAMiB,GACrFO,IAAMF,EAAgB,SAAStB,EAAK,CAAC,KAAKM,EAAaN,EAAK,GAAGiB,CAAM,KAAKjB,EAAK,MAAMiB;AAC3F,gBAAIM,KAAOC;AACT,cAAAd,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;AAAA,iBAC3E;AACL,oBAAMS,IAAOF,IAAMN,IAASjB,EAAK,GAC3B0B,IAAOF,IAAMP,IAASjB,EAAK;AACjC,cAAAU,EAAI,KAAK,qCAAqCe,GAAMC,GAAML,GAAOrB,EAAK,IAAI,GAC1Ee,EAAM,QAAQU,GAAMC,GAAML,GAAOrB,EAAK,IAAI;AAAA,YAC5C;AAAA,UACF;AACE,YAAAU,EAAI;AAAA,cACF;AAAA,cACAV,EAAK;AAAA,cACL;AAAA,cACAA,EAAK;AAAA,cACL;AAAA,cACAiB;AAAA,cACA;AAAA,cACAL;AAAA,YACd;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,GACL8B,IAAqC,gBAAAtB,EAAO,CAACE,GAAIQ,MAAU;AAC7D,QAAMa,IAAWb,EAAM,SAASR,CAAE;AAClC,MAAIsB,IAAM,CAAC,GAAGD,CAAQ;AACtB,aAAWE,KAASF;AAClB,IAAAzB,EAAQ,IAAI2B,GAAOvB,CAAE,GACrBsB,IAAM,CAAC,GAAGA,GAAK,GAAGF,EAAmBG,GAAOf,CAAK,CAAC;AAEpD,SAAOc;AACT,GAAG,oBAAoB,GACnBE,IAAkC,gBAAA1B,EAAO,CAACU,GAAOiB,GAAKC,MAAQ;AAChE,QAAMC,IAASnB,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAMgC,KAAOhC,EAAK,MAAMgC,CAAG,GACxEG,IAASpB,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAMiC,KAAOjC,EAAK,MAAMiC,CAAG,GACxEG,IAAaF,EAAO,IAAI,CAAClC,OACtB,EAAE,GAAGA,EAAK,MAAMgC,IAAMC,IAAMjC,EAAK,GAAG,GAAGA,EAAK,MAAMgC,IAAMA,IAAMhC,EAAK,EAAC,EAC5E,GACKqC,IAAaF,EAAO,IAAI,CAACnC,OACtB,EAAE,GAAGA,EAAK,GAAG,GAAGA,EAAK,EAAC,EAC9B;AAID,SAHeoC,EAAW,OAAO,CAACE,MACzBD,EAAW,KAAK,CAACrC,MAASsC,EAAQ,MAAMtC,EAAK,KAAKsC,EAAQ,MAAMtC,EAAK,CAAC,CAC9E;AAEH,GAAG,iBAAiB,GAChBuC,IAAsC,gBAAAlC,EAAO,CAACE,GAAIQ,GAAOH,MAAc;AACzE,QAAMgB,IAAWb,EAAM,SAASR,CAAE;AAElC,MADAG,EAAI,MAAM,6BAA6BH,GAAIqB,CAAQ,GAC/CA,EAAS,SAAS;AACpB,WAAOrB;AAET,MAAIiC;AACJ,aAAWV,KAASF,GAAU;AAC5B,UAAMa,IAAMF,EAAoBT,GAAOf,GAAOH,CAAS,GACjD8B,IAAcX,EAAgBhB,GAAOH,GAAW6B,CAAG;AACzD,QAAIA;AACF,UAAIC,EAAY,SAAS;AACvB,QAAAF,IAAUC;AAAA;AAEV,eAAOA;AAAA,EAGb;AACA,SAAOD;AACT,GAAG,qBAAqB,GACpBG,IAA8B,gBAAAtC,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,GACZqC,IAAyC,gBAAAvC,EAAO,CAACU,GAAO8B,MAAU;AACpE,MAAI,CAAC9B,KAAS8B,IAAQ,IAAI;AACxB,IAAAnC,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,MACAgC,EAAoBhC,GAAIQ,GAAOR,CAAE;AAAA,IACzC,GACML,EAAY,IAAIK,GAAIoB,EAAmBpB,GAAIQ,CAAK,CAAC,GACjDd,EAAU,IAAIM,GAAI,EAAE,IAAIgC,EAAoBhC,GAAIQ,GAAOR,CAAE,GAAG,aAAaQ,EAAM,KAAKR,CAAE,EAAC,CAAE;AAAA,EAE7F,CAAC,GACDQ,EAAM,MAAK,EAAG,QAAQ,SAASR,GAAI;AACjC,UAAMqB,IAAWb,EAAM,SAASR,CAAE,GAC5Ba,IAAQL,EAAM,MAAK;AACzB,IAAIa,EAAS,SAAS,KACpBlB,EAAI,MAAM,sBAAsBH,GAAIL,CAAW,GAC/CkB,EAAM,QAAQ,CAACpB,MAAS;AACtB,YAAM8C,IAAKxC,EAAaN,EAAK,GAAGO,CAAE,GAC5BwC,IAAKzC,EAAaN,EAAK,GAAGO,CAAE;AAClC,MAAIuC,IAAKC,MACPrC,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,UAAM+C,IAAkB/C,EAAU,IAAIM,CAAE,EAAE,IACpCX,IAASmB,EAAM,OAAOiC,CAAe;AAC3C,IAAIpD,MAAWW,KAAMN,EAAU,IAAIL,CAAM,KAAK,CAACK,EAAU,IAAIL,CAAM,EAAE,wBACnEK,EAAU,IAAIM,CAAE,EAAE,KAAKX;AAEzB,UAAMqD,IAAwBlC,EAAM,QAAQ,KAAK,CAACf,MAASA,EAAK,MAAMO,CAAE;AACxE,QAAIyC,KAAmB/C,EAAU,IAAIM,CAAE,GAAG,uBAAuB0C,KAAyBC,EAA2BnC,GAAOiC,GAAiBzC,CAAE,GAAG;AAChJ,YAAM4C,IAAaC,EAAmBrC,GAAOR,GAAIQ,EAAM,OAAOiC,CAAe,CAAC;AAC9E,MAAIG,MACFlD,EAAU,IAAIM,CAAE,EAAE,KAAK4C;AAAA,IAE3B;AAAA,EACF;AACA,EAAApC,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,GACNuD,IAAIvD,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,IAAIiD,EAAY7C,EAAE,CAAC,GACnBuD,IAAIV,EAAY7C,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,UAAIuD,MAAMvD,EAAE,GAAG;AACb,cAAMF,IAASmB,EAAM,OAAOsC,CAAC;AAC7B,QAAApD,EAAU,IAAIL,CAAM,EAAE,sBAAsB,IAC5CI,EAAK,YAAYF,EAAE;AAAA,MACrB;AACA,MAAAY,EAAI,KAAK,0BAA0BhB,GAAG2D,GAAGvD,EAAE,IAAI,GAC/CiB,EAAM,QAAQrB,GAAG2D,GAAGrD,GAAMF,EAAE,IAAI;AAAA,IAClC;AAAA,EACF,CAAC,GACDY,EAAI,KAAK,kBAAkB4C,EAAmBvC,CAAK,CAAC,GACpDwC,EAAUxC,GAAO,CAAC,GAClBL,EAAI,MAAMT,CAAS;AACrB,GAAG,wBAAwB,GACvBsD,IAA4B,gBAAAlD,EAAO,CAACU,GAAO8B,MAAU;AAEvD,MADAnC,EAAI,KAAK,gBAAgBmC,GAAOS,EAAmBvC,CAAK,GAAGA,EAAM,SAAS,GAAG,CAAC,GAC1E8B,IAAQ,IAAI;AACd,IAAAnC,EAAI,MAAM,aAAa;AACvB;AAAA,EACF;AACA,MAAIQ,IAAQH,EAAM,MAAK,GACnByC,IAAc;AAClB,aAAW3D,KAAQqB,GAAO;AACxB,UAAMU,IAAWb,EAAM,SAASlB,CAAI;AACpC,IAAA2D,IAAcA,KAAe5B,EAAS,SAAS;AAAA,EACjD;AACA,MAAI,CAAC4B,GAAa;AAChB,IAAA9C,EAAI,MAAM,8BAA8BK,EAAM,MAAK,CAAE;AACrD;AAAA,EACF;AACA,EAAAL,EAAI,MAAM,YAAYQ,GAAO2B,CAAK;AAClC,aAAWhD,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,MACA8B;AAAA,IACN,GACQ,CAAC5C,EAAU,IAAIJ,CAAI;AACrB,MAAAa,EAAI,MAAM,iBAAiBb,GAAMgD,CAAK;AAAA,aAC7B5C,EAAU,IAAIJ,CAAI,GAAG,aAAa,eAAekB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS,GAAG;AACnH,MAAAa,EAAI,KAAK,6DAA6Db,GAAMgD,CAAK;AACjF,YAAMY,IAAMxD,EAAU,IAAIJ,CAAI,EAAE,YAAY,KACtC6D,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,MAAA3C,EAAKjB,GAAMkB,GAAO2C,GAAc7D,CAAI;AACpC,YAAM+D,IAAkB7C,EAAM,KAAKlB,CAAI,KAAK,CAAA;AAC5C,MAAAkB,EAAM,QAAQlB,GAAM;AAAA,QAClB,GAAG+D;AAAA,QACH,aAAa;AAAA,QACb,IAAI/D;AAAA,QACJ,aAAaI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACjC,OAAOI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QAC3B,OAAO6D;AAAA,MACf,CAAO,GACDhD,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACAyD,EAAmBI,CAAY;AAAA,MACvC;AAAA,IACI,WAAW,CAACzD,EAAU,IAAIJ,CAAI,EAAE,uBAAuBkB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS,GAAG;AAC9G,MAAAa,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACAgD;AAAA,MACR;AAEM,UAAIY,IADkB1C,EAAM,MAAK,EACT,YAAY,OAAO,OAAO;AAClD,MAAId,EAAU,IAAIJ,CAAI,GAAG,aAAa,QACpC4D,IAAMxD,EAAU,IAAIJ,CAAI,EAAE,YAAY,KACtCa,EAAI,KAAK,cAAcT,EAAU,IAAIJ,CAAI,EAAE,YAAY,KAAK4D,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,MAAA3C,EAAKjB,GAAMkB,GAAO2C,GAAc7D,CAAI;AACpC,YAAM+D,IAAkB7C,EAAM,KAAKlB,CAAI,KAAK,CAAA;AAC5C,MAAAkB,EAAM,QAAQlB,GAAM;AAAA,QAClB,GAAG+D;AAAA,QACH,aAAa;AAAA,QACb,IAAI/D;AAAA,QACJ,aAAaI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACjC,OAAOI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QAC3B,OAAO6D;AAAA,MACf,CAAO,GACDhD,EAAI,MAAM,wBAAwB4C,EAAmBvC,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,QAClB8B;AAAA,MACR,GACMnC,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,eACRoC,EAAUpC,EAAK,OAAO0B,IAAQ,CAAC;AAAA,EAEnC;AACF,GAAG,WAAW,GACVgB,IAAyB,gBAAAxD,EAAO,CAACU,GAAOG,MAAU;AACpD,MAAIA,EAAM,WAAW;AACnB,WAAO,CAAA;AAET,MAAI4C,IAAS,OAAO,OAAO,CAAA,GAAI5C,CAAK;AACpC,SAAAA,EAAM,QAAQ,CAACrB,MAAS;AACtB,UAAM+B,IAAWb,EAAM,SAASlB,CAAI,GAC9BkE,IAASF,EAAO9C,GAAOa,CAAQ;AACrC,IAAAkC,IAAS,CAAC,GAAGA,GAAQ,GAAGC,CAAM;AAAA,EAChC,CAAC,GACMD;AACT,GAAG,QAAQ,GACPE,IAAuC,gBAAA3D,EAAO,CAACU,MAAU8C,EAAO9C,GAAOA,EAAM,SAAQ,CAAE,GAAG,sBAAsB,GAChHmC,IAA6C,gBAAA7C,EAAO,CAACU,GAAOlB,GAAMoB,MAAW;AAC/E,MAAIrB,IAASmB,EAAM,OAAOlB,CAAI;AAC9B,SAAOD,KAAUA,MAAWqB,KAAQ;AAClC,UAAMgD,IAAUhE,EAAU,IAAIL,CAAM;AACpC,QAAIqE,KAAW,CAACA,EAAQ;AACtB,aAAO;AAET,IAAArE,IAASmB,EAAM,OAAOnB,CAAM;AAAA,EAC9B;AACA,SAAO;AACT,GAAG,4BAA4B,GAC3BwD,IAAqC,gBAAA/C,EAAO,CAACU,GAAOH,GAAWsD,MAAoB;AACrF,QAAMtC,IAAWb,EAAM,SAASH,CAAS,KAAK,CAAA;AAC9C,aAAWkB,KAASF,GAAU;AAC5B,QAAIE,MAAUoC,KAAmB5D,EAAawB,GAAOoC,CAAe;AAClE;AAEF,UAAMC,IAAY5B,EAAoBT,GAAOf,GAAOH,CAAS;AAC7D,QAAKuD,KAGD,CAACjB,EAA2BnC,GAAOoD,GAAWvD,CAAS;AACzD,aAAOuD;AAAA,EAEX;AACA,SAAO;AACT,GAAG,oBAAoB;","x_google_ignoreList":[0,1,2]}
+{"version":3,"file":"chunk-RYQCIY6F-BBUUnDvx.js","sources":["../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/clone.js","../../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/json.js","../../../node_modules/.pnpm/mermaid@11.16.0/node_modules/mermaid/dist/chunks/mermaid.core/chunk-RYQCIY6F.mjs"],"sourcesContent":["import baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nexport default clone;\n","import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\n/**\n * @import { NodeID, EdgeObj, GraphOptions } from './graph.js';\n */\n\nexport { write, read };\n\n/**\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n *\n * @typedef {object} GraphJSON\n * @property {Required<GraphOptions>} options - The options used to create the graph.\n * @property {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} nodes - The nodes in the graph.\n * @property {Array<EdgeObj & { value?: EdgeLabel }>} edges - The edges in the graph.\n * @property {GraphLabel} [value] - The graph's value, if any.\n */\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a\n * string with\n * [JSON.stringify](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify).\n * The graph can later be restored using {@link read}.\n *\n * @example\n *\n * ```js\n * var g = new graphlib.Graph();\n * g.setNode(\"a\", { label: \"node a\" });\n * g.setNode(\"b\", { label: \"node b\" });\n * g.setEdge(\"a\", \"b\", { label: \"edge a->b\" });\n * graphlib.json.write(g);\n * // Returns the object:\n * //\n * // {\n * //   \"options\": {\n * //     \"directed\": true,\n * //     \"multigraph\": false,\n * //     \"compound\": false\n * //   },\n * //   \"nodes\": [\n * //     { \"v\": \"a\", \"value\": { \"label\": \"node a\" } },\n * //     { \"v\": \"b\", \"value\": { \"label\": \"node b\" } }\n * //   ],\n * //   \"edges\": [\n * //     { \"v\": \"a\", \"w\": \"b\", \"value\": { \"label\": \"edge a->b\" } }\n * //   ]\n * // }\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {Graph<GraphLabel, NodeLabel, EdgeLabel>} g - The graph to serialize.\n * @returns {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} The JSON representation of the graph.\n */\nfunction write(g) {\n  /** @type {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} */\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\n/**\n * @template NodeLabel - Label of a node.\n *\n * @param {Graph<unknown, NodeLabel, unknown>} g - The graph to serialize.\n * @returns {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} The nodes in the graph.\n */\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function (v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    /** @type {{ v: NodeID; value?: NodeLabel; parent?: NodeID }} */\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\n/**\n * @template EdgeLabel - Label of a node.\n *\n * @param {Graph<unknown, unknown, EdgeLabel>} g - The graph to serialize.\n * @returns {Array<EdgeObj & { value?: EdgeLabel }>} The edges in the graph.\n */\nfunction writeEdges(g) {\n  return _.map(g.edges(), function (e) {\n    var edgeValue = g.edge(e);\n    /** @type {EdgeObj & { value?: EdgeLabel }} */\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\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @example\n *\n * For example, if we have serialized the graph in {@link write}\n * to a string named `str`, we can restore it to a graph as follows:\n *\n * ```js\n * var g2 = graphlib.json.read(JSON.parse(str));\n * // or, in order to copy the graph\n * var g3 = graphlib.json.read(graphlib.json.write(g))\n *\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} json - The JSON representation of the graph.\n * @returns {Graph<GraphLabel, NodeLabel, EdgeLabel>} The restored graph.\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  log\n} from \"./chunk-X3CZISLH.mjs\";\nimport {\n  __name\n} from \"./chunk-Y2CYZVJY.mjs\";\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 clear = /* @__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            const rootDescendants = descendants.get(rootId) || [];\n            const vIn = rootDescendants.includes(edge.v) || isDescendant(edge.v, rootId) || edge.v === rootId;\n            const wIn = rootDescendants.includes(edge.w) || isDescendant(edge.w, rootId) || edge.w === rootId;\n            if (vIn && wIn) {\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              const newV = vIn ? rootId : edge.v;\n              const newW = wIn ? rootId : edge.w;\n              log.info(\"Rebinding cross-boundary edge as \", newV, newW, data2, edge.name);\n              graph.setEdge(newV, newW, data2, edge.name);\n            }\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    const hasDirectOutgoingEdge = graph.edges().some((edge) => edge.v === id);\n    if (nonClusterChild && clusterDb.get(id)?.externalConnections && hasDirectOutgoingEdge && isNodeInExtractableCluster(graph, nonClusterChild, id)) {\n      const safeAnchor = findSafeAnchorNode(graph, id, graph.parent(nonClusterChild));\n      if (safeAnchor) {\n        clusterDb.get(id).id = safeAnchor;\n      }\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)?.clusterData?.explicitDir && graph.children(node) && graph.children(node).length > 0) {\n      log.warn(\"Cluster with explicit dir, creating subgraph for children\", node, depth);\n      const dir = clusterDb.get(node).clusterData.dir;\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      copy(node, graph, clusterGraph, node);\n      const clusterNodeData = graph.node(node) || {};\n      graph.setNode(node, {\n        ...clusterNodeData,\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(\n        \"Subgraph for cluster with explicit dir created:\",\n        node,\n        graphlibJson.write(clusterGraph)\n      );\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      copy(node, graph, clusterGraph, node);\n      const clusterNodeData = graph.node(node) || {};\n      graph.setNode(node, {\n        ...clusterNodeData,\n        clusterNode: true,\n        id: node,\n        clusterData: clusterDb.get(node).clusterData,\n        label: clusterDb.get(node).label,\n        graph: clusterGraph\n      });\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\");\nvar isNodeInExtractableCluster = /* @__PURE__ */ __name((graph, node, rootId) => {\n  let parent = graph.parent(node);\n  while (parent && parent !== rootId) {\n    const cluster = clusterDb.get(parent);\n    if (cluster && !cluster.externalConnections) {\n      return true;\n    }\n    parent = graph.parent(parent);\n  }\n  return false;\n}, \"isNodeInExtractableCluster\");\nvar findSafeAnchorNode = /* @__PURE__ */ __name((graph, clusterId, excludedCluster) => {\n  const children = graph.children(clusterId) ?? [];\n  for (const child of children) {\n    if (child === excludedCluster || isDescendant(child, excludedCluster)) {\n      continue;\n    }\n    const candidate = findNonClusterChild(child, graph, clusterId);\n    if (!candidate) {\n      continue;\n    }\n    if (!isNodeInExtractableCluster(graph, candidate, clusterId)) {\n      return candidate;\n    }\n  }\n  return null;\n}, \"findSafeAnchorNode\");\n\nexport {\n  clusterDb,\n  clear,\n  findNonClusterChild,\n  adjustClustersAndEdges,\n  sortNodesByHierarchy\n};\n"],"names":["CLONE_SYMBOLS_FLAG","clone","value","baseClone","write","g","json","writeNodes","writeEdges","_.isUndefined","_.clone","_.map","v","nodeValue","parent","node","e","edgeValue","edge","clusterDb","descendants","parents","clear","__name","isDescendant","id","ancestorId","ancestorDescendants","log","edgeInCluster","clusterId","clusterDescendants","copy","graph","newGraph","rootId","nodes","data","edges","data2","rootDescendants","vIn","wIn","newV","newW","extractDescendants","children","res","child","findCommonEdges","id1","id2","edges1","edges2","edges1Prim","edges2Prim","edgeIn1","findNonClusterChild","reserve","_id","commonEdges","getAnchorId","adjustClustersAndEdges","depth","d1","d2","nonClusterChild","hasDirectOutgoingEdge","isNodeInExtractableCluster","safeAnchor","findSafeAnchorNode","w","graphlibJson.write","extractor","hasChildren","dir","clusterGraph","graphlib.Graph","clusterNodeData","sorter","result","sorted","sortNodesByHierarchy","cluster","excludedCluster","candidate"],"mappings":";;;AAGA,IAAIA,IAAqB;AA4BzB,SAASC,EAAMC,GAAO;AACpB,SAAOC,EAAUD,GAAOF,CAAkB;AAC5C;AC0BA,SAASI,EAAMC,GAAG;AAEhB,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,EAAWF,CAAC;AAAA,IACnB,OAAOG,EAAWH,CAAC;AAAA,EACvB;AACE,SAAKI,EAAcJ,EAAE,MAAK,CAAE,MAC1BC,EAAK,QAAQI,EAAQL,EAAE,MAAK,CAAE,IAEzBC;AACT;AAQA,SAASC,EAAWF,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUO,GAAG;AACnC,QAAIC,IAAYR,EAAE,KAAKO,CAAC,GACpBE,IAAST,EAAE,OAAOO,CAAC,GAEnBG,IAAO,EAAE,GAAGH,EAAC;AACjB,WAAKH,EAAcI,CAAS,MAC1BE,EAAK,QAAQF,IAEVJ,EAAcK,CAAM,MACvBC,EAAK,SAASD,IAETC;AAAA,EACT,CAAC;AACH;AAQA,SAASP,EAAWH,GAAG;AACrB,SAAOM,EAAMN,EAAE,MAAK,GAAI,SAAUW,GAAG;AACnC,QAAIC,IAAYZ,EAAE,KAAKW,CAAC,GAEpBE,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;AC3GG,IAACC,IAA4B,oBAAI,IAAG,GACnCC,IAA8B,oBAAI,IAAG,GACrCC,IAA0B,oBAAI,IAAG,GACjCC,IAAwB,gBAAAC,EAAO,MAAM;AACvC,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,IAAgC,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,cAAIN,EAAcX,GAAMiB,CAAM,GAAG;AAC/B,kBAAMK,IAAkBpB,EAAY,IAAIe,CAAM,KAAK,CAAA,GAC7CM,IAAMD,EAAgB,SAAStB,EAAK,CAAC,KAAKM,EAAaN,EAAK,GAAGiB,CAAM,KAAKjB,EAAK,MAAMiB,GACrFO,IAAMF,EAAgB,SAAStB,EAAK,CAAC,KAAKM,EAAaN,EAAK,GAAGiB,CAAM,KAAKjB,EAAK,MAAMiB;AAC3F,gBAAIM,KAAOC;AACT,cAAAd,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;AAAA,iBAC3E;AACL,oBAAMS,IAAOF,IAAMN,IAASjB,EAAK,GAC3B0B,IAAOF,IAAMP,IAASjB,EAAK;AACjC,cAAAU,EAAI,KAAK,qCAAqCe,GAAMC,GAAML,GAAOrB,EAAK,IAAI,GAC1Ee,EAAM,QAAQU,GAAMC,GAAML,GAAOrB,EAAK,IAAI;AAAA,YAC5C;AAAA,UACF;AACE,YAAAU,EAAI;AAAA,cACF;AAAA,cACAV,EAAK;AAAA,cACL;AAAA,cACAA,EAAK;AAAA,cACL;AAAA,cACAiB;AAAA,cACA;AAAA,cACAL;AAAA,YACd;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,GACL8B,IAAqC,gBAAAtB,EAAO,CAACE,GAAIQ,MAAU;AAC7D,QAAMa,IAAWb,EAAM,SAASR,CAAE;AAClC,MAAIsB,IAAM,CAAC,GAAGD,CAAQ;AACtB,aAAWE,KAASF;AAClB,IAAAzB,EAAQ,IAAI2B,GAAOvB,CAAE,GACrBsB,IAAM,CAAC,GAAGA,GAAK,GAAGF,EAAmBG,GAAOf,CAAK,CAAC;AAEpD,SAAOc;AACT,GAAG,oBAAoB,GACnBE,IAAkC,gBAAA1B,EAAO,CAACU,GAAOiB,GAAKC,MAAQ;AAChE,QAAMC,IAASnB,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAMgC,KAAOhC,EAAK,MAAMgC,CAAG,GACxEG,IAASpB,EAAM,MAAK,EAAG,OAAO,CAACf,MAASA,EAAK,MAAMiC,KAAOjC,EAAK,MAAMiC,CAAG,GACxEG,IAAaF,EAAO,IAAI,CAAClC,OACtB,EAAE,GAAGA,EAAK,MAAMgC,IAAMC,IAAMjC,EAAK,GAAG,GAAGA,EAAK,MAAMgC,IAAMA,IAAMhC,EAAK,EAAC,EAC5E,GACKqC,IAAaF,EAAO,IAAI,CAACnC,OACtB,EAAE,GAAGA,EAAK,GAAG,GAAGA,EAAK,EAAC,EAC9B;AAID,SAHeoC,EAAW,OAAO,CAACE,MACzBD,EAAW,KAAK,CAACrC,MAASsC,EAAQ,MAAMtC,EAAK,KAAKsC,EAAQ,MAAMtC,EAAK,CAAC,CAC9E;AAEH,GAAG,iBAAiB,GAChBuC,IAAsC,gBAAAlC,EAAO,CAACE,GAAIQ,GAAOH,MAAc;AACzE,QAAMgB,IAAWb,EAAM,SAASR,CAAE;AAElC,MADAG,EAAI,MAAM,6BAA6BH,GAAIqB,CAAQ,GAC/CA,EAAS,SAAS;AACpB,WAAOrB;AAET,MAAIiC;AACJ,aAAWV,KAASF,GAAU;AAC5B,UAAMa,IAAMF,EAAoBT,GAAOf,GAAOH,CAAS,GACjD8B,IAAcX,EAAgBhB,GAAOH,GAAW6B,CAAG;AACzD,QAAIA;AACF,UAAIC,EAAY,SAAS;AACvB,QAAAF,IAAUC;AAAA;AAEV,eAAOA;AAAA,EAGb;AACA,SAAOD;AACT,GAAG,qBAAqB,GACpBG,IAA8B,gBAAAtC,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,GACZqC,IAAyC,gBAAAvC,EAAO,CAACU,GAAO8B,MAAU;AACpE,MAAI,CAAC9B,KAAS8B,IAAQ,IAAI;AACxB,IAAAnC,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,MACAgC,EAAoBhC,GAAIQ,GAAOR,CAAE;AAAA,IACzC,GACML,EAAY,IAAIK,GAAIoB,EAAmBpB,GAAIQ,CAAK,CAAC,GACjDd,EAAU,IAAIM,GAAI,EAAE,IAAIgC,EAAoBhC,GAAIQ,GAAOR,CAAE,GAAG,aAAaQ,EAAM,KAAKR,CAAE,EAAC,CAAE;AAAA,EAE7F,CAAC,GACDQ,EAAM,MAAK,EAAG,QAAQ,SAASR,GAAI;AACjC,UAAMqB,IAAWb,EAAM,SAASR,CAAE,GAC5Ba,IAAQL,EAAM,MAAK;AACzB,IAAIa,EAAS,SAAS,KACpBlB,EAAI,MAAM,sBAAsBH,GAAIL,CAAW,GAC/CkB,EAAM,QAAQ,CAACpB,MAAS;AACtB,YAAM8C,IAAKxC,EAAaN,EAAK,GAAGO,CAAE,GAC5BwC,IAAKzC,EAAaN,EAAK,GAAGO,CAAE;AAClC,MAAIuC,IAAKC,MACPrC,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,UAAM+C,IAAkB/C,EAAU,IAAIM,CAAE,EAAE,IACpCX,IAASmB,EAAM,OAAOiC,CAAe;AAC3C,IAAIpD,MAAWW,KAAMN,EAAU,IAAIL,CAAM,KAAK,CAACK,EAAU,IAAIL,CAAM,EAAE,wBACnEK,EAAU,IAAIM,CAAE,EAAE,KAAKX;AAEzB,UAAMqD,IAAwBlC,EAAM,QAAQ,KAAK,CAACf,MAASA,EAAK,MAAMO,CAAE;AACxE,QAAIyC,KAAmB/C,EAAU,IAAIM,CAAE,GAAG,uBAAuB0C,KAAyBC,EAA2BnC,GAAOiC,GAAiBzC,CAAE,GAAG;AAChJ,YAAM4C,IAAaC,EAAmBrC,GAAOR,GAAIQ,EAAM,OAAOiC,CAAe,CAAC;AAC9E,MAAIG,MACFlD,EAAU,IAAIM,CAAE,EAAE,KAAK4C;AAAA,IAE3B;AAAA,EACF;AACA,EAAApC,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,GACNuD,IAAIvD,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,IAAIiD,EAAY7C,EAAE,CAAC,GACnBuD,IAAIV,EAAY7C,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,UAAIuD,MAAMvD,EAAE,GAAG;AACb,cAAMF,IAASmB,EAAM,OAAOsC,CAAC;AAC7B,QAAApD,EAAU,IAAIL,CAAM,EAAE,sBAAsB,IAC5CI,EAAK,YAAYF,EAAE;AAAA,MACrB;AACA,MAAAY,EAAI,KAAK,0BAA0BhB,GAAG2D,GAAGvD,EAAE,IAAI,GAC/CiB,EAAM,QAAQrB,GAAG2D,GAAGrD,GAAMF,EAAE,IAAI;AAAA,IAClC;AAAA,EACF,CAAC,GACDY,EAAI,KAAK,kBAAkB4C,EAAmBvC,CAAK,CAAC,GACpDwC,EAAUxC,GAAO,CAAC,GAClBL,EAAI,MAAMT,CAAS;AACrB,GAAG,wBAAwB,GACvBsD,IAA4B,gBAAAlD,EAAO,CAACU,GAAO8B,MAAU;AAEvD,MADAnC,EAAI,KAAK,gBAAgBmC,GAAOS,EAAmBvC,CAAK,GAAGA,EAAM,SAAS,GAAG,CAAC,GAC1E8B,IAAQ,IAAI;AACd,IAAAnC,EAAI,MAAM,aAAa;AACvB;AAAA,EACF;AACA,MAAIQ,IAAQH,EAAM,MAAK,GACnByC,IAAc;AAClB,aAAW3D,KAAQqB,GAAO;AACxB,UAAMU,IAAWb,EAAM,SAASlB,CAAI;AACpC,IAAA2D,IAAcA,KAAe5B,EAAS,SAAS;AAAA,EACjD;AACA,MAAI,CAAC4B,GAAa;AAChB,IAAA9C,EAAI,MAAM,8BAA8BK,EAAM,MAAK,CAAE;AACrD;AAAA,EACF;AACA,EAAAL,EAAI,MAAM,YAAYQ,GAAO2B,CAAK;AAClC,aAAWhD,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,MACA8B;AAAA,IACN,GACQ,CAAC5C,EAAU,IAAIJ,CAAI;AACrB,MAAAa,EAAI,MAAM,iBAAiBb,GAAMgD,CAAK;AAAA,aAC7B5C,EAAU,IAAIJ,CAAI,GAAG,aAAa,eAAekB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS,GAAG;AACnH,MAAAa,EAAI,KAAK,6DAA6Db,GAAMgD,CAAK;AACjF,YAAMY,IAAMxD,EAAU,IAAIJ,CAAI,EAAE,YAAY,KACtC6D,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,MAAA3C,EAAKjB,GAAMkB,GAAO2C,GAAc7D,CAAI;AACpC,YAAM+D,IAAkB7C,EAAM,KAAKlB,CAAI,KAAK,CAAA;AAC5C,MAAAkB,EAAM,QAAQlB,GAAM;AAAA,QAClB,GAAG+D;AAAA,QACH,aAAa;AAAA,QACb,IAAI/D;AAAA,QACJ,aAAaI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACjC,OAAOI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QAC3B,OAAO6D;AAAA,MACf,CAAO,GACDhD,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACAyD,EAAmBI,CAAY;AAAA,MACvC;AAAA,IACI,WAAW,CAACzD,EAAU,IAAIJ,CAAI,EAAE,uBAAuBkB,EAAM,SAASlB,CAAI,KAAKkB,EAAM,SAASlB,CAAI,EAAE,SAAS,GAAG;AAC9G,MAAAa,EAAI;AAAA,QACF;AAAA,QACAb;AAAA,QACAgD;AAAA,MACR;AAEM,UAAIY,IADkB1C,EAAM,MAAK,EACT,YAAY,OAAO,OAAO;AAClD,MAAId,EAAU,IAAIJ,CAAI,GAAG,aAAa,QACpC4D,IAAMxD,EAAU,IAAIJ,CAAI,EAAE,YAAY,KACtCa,EAAI,KAAK,cAAcT,EAAU,IAAIJ,CAAI,EAAE,YAAY,KAAK4D,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,MAAA3C,EAAKjB,GAAMkB,GAAO2C,GAAc7D,CAAI;AACpC,YAAM+D,IAAkB7C,EAAM,KAAKlB,CAAI,KAAK,CAAA;AAC5C,MAAAkB,EAAM,QAAQlB,GAAM;AAAA,QAClB,GAAG+D;AAAA,QACH,aAAa;AAAA,QACb,IAAI/D;AAAA,QACJ,aAAaI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QACjC,OAAOI,EAAU,IAAIJ,CAAI,EAAE;AAAA,QAC3B,OAAO6D;AAAA,MACf,CAAO,GACDhD,EAAI,MAAM,wBAAwB4C,EAAmBvC,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,QAClB8B;AAAA,MACR,GACMnC,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,eACRoC,EAAUpC,EAAK,OAAO0B,IAAQ,CAAC;AAAA,EAEnC;AACF,GAAG,WAAW,GACVgB,IAAyB,gBAAAxD,EAAO,CAACU,GAAOG,MAAU;AACpD,MAAIA,EAAM,WAAW;AACnB,WAAO,CAAA;AAET,MAAI4C,IAAS,OAAO,OAAO,CAAA,GAAI5C,CAAK;AACpC,SAAAA,EAAM,QAAQ,CAACrB,MAAS;AACtB,UAAM+B,IAAWb,EAAM,SAASlB,CAAI,GAC9BkE,IAASF,EAAO9C,GAAOa,CAAQ;AACrC,IAAAkC,IAAS,CAAC,GAAGA,GAAQ,GAAGC,CAAM;AAAA,EAChC,CAAC,GACMD;AACT,GAAG,QAAQ,GACPE,IAAuC,gBAAA3D,EAAO,CAACU,MAAU8C,EAAO9C,GAAOA,EAAM,SAAQ,CAAE,GAAG,sBAAsB,GAChHmC,IAA6C,gBAAA7C,EAAO,CAACU,GAAOlB,GAAMoB,MAAW;AAC/E,MAAIrB,IAASmB,EAAM,OAAOlB,CAAI;AAC9B,SAAOD,KAAUA,MAAWqB,KAAQ;AAClC,UAAMgD,IAAUhE,EAAU,IAAIL,CAAM;AACpC,QAAIqE,KAAW,CAACA,EAAQ;AACtB,aAAO;AAET,IAAArE,IAASmB,EAAM,OAAOnB,CAAM;AAAA,EAC9B;AACA,SAAO;AACT,GAAG,4BAA4B,GAC3BwD,IAAqC,gBAAA/C,EAAO,CAACU,GAAOH,GAAWsD,MAAoB;AACrF,QAAMtC,IAAWb,EAAM,SAASH,CAAS,KAAK,CAAA;AAC9C,aAAWkB,KAASF,GAAU;AAC5B,QAAIE,MAAUoC,KAAmB5D,EAAawB,GAAOoC,CAAe;AAClE;AAEF,UAAMC,IAAY5B,EAAoBT,GAAOf,GAAOH,CAAS;AAC7D,QAAKuD,KAGD,CAACjB,EAA2BnC,GAAOoD,GAAWvD,CAAS;AACzD,aAAOuD;AAAA,EAEX;AACA,SAAO;AACT,GAAG,oBAAoB;","x_google_ignoreList":[0,1,2]}

package/dist/{chunk-RYQCIY6F-he5fUSYo.cjs → chunk-RYQCIY6F-BaozHSpS.cjs}

@@ -1,2 +1,2 @@
-"use strict";const o=require("./extractHeadings-BsiIYa_e.cjs"),g=require("./graph-BgRih2Qv.cjs"),E=require("./map-BvScllSQ.cjs");var k=4;function B(e){return E.baseClone(e,k)}function v(e){var r={options:{directed:e.isDirected(),multigraph:e.isMultigraph(),compound:e.isCompound()},nodes:j(e),edges:L(e)};return g.isUndefined(e.graph())||(r.value=B(e.graph())),r}function j(e){return E.map(e.nodes(),function(r){var n=e.node(r),s=e.parent(r),t={v:r};return g.isUndefined(n)||(t.value=n),g.isUndefined(s)||(t.parent=s),t})}function L(e){return E.map(e.edges(),function(r){var n=e.edge(r),s={v:r.v,w:r.w};return g.isUndefined(r.name)||(s.name=r.name),g.isUndefined(n)||(s.value=n),s})}var a=new Map,d=new Map,y=new Map,p=o.__name(()=>{d.clear(),y.clear(),a.clear()},"clear"),w=o.__name((e,r)=>{const n=d.get(r)||[];return o.log.trace("In isDescendant",r," ",e," = ",n.includes(e)),n.includes(e)},"isDescendant"),F=o.__name((e,r)=>{const n=d.get(r)||[];return o.log.info("Descendants of ",r," is ",n),o.log.info("Edge is ",e),e.v===r||e.w===r?!1:n?n.includes(e.v)||w(e.v,r)||w(e.w,r)||n.includes(e.w):(o.log.debug("Tilt, ",r,",not in descendants"),!1)},"edgeInCluster"),D=o.__name((e,r,n,s)=>{o.log.warn("Copying children of ",e,"root",s,"data",r.node(e),s);const t=r.children(e)||[];e!==s&&t.push(e),o.log.warn("Copying (nodes) clusterId",e,"nodes",t),t.forEach(i=>{if(r.children(i).length>0)D(i,r,n,s);else{const c=r.node(i);o.log.info("cp ",i," to ",s," with parent ",e),n.setNode(i,c),s!==r.parent(i)&&(o.log.warn("Setting parent",i,r.parent(i)),n.setParent(i,r.parent(i))),e!==s&&i!==e?(o.log.debug("Setting parent",i,e),n.setParent(i,e)):(o.log.info("In copy ",e,"root",s,"data",r.node(e),s),o.log.debug("Not Setting parent for node=",i,"cluster!==rootId",e!==s,"node!==clusterId",i!==e));const u=r.edges(i);o.log.debug("Copying Edges",u),u.forEach(l=>{o.log.info("Edge",l);const f=r.edge(l.v,l.w,l.name);o.log.info("Edge data",f,s);try{if(F(l,s)){const C=d.get(s)||[],b=C.includes(l.v)||w(l.v,s)||l.v===s,_=C.includes(l.w)||w(l.w,s)||l.w===s;if(b&&_)o.log.info("Copying as ",l.v,l.w,f,l.name),n.setEdge(l.v,l.w,f,l.name),o.log.info("newGraph edges ",n.edges(),n.edge(n.edges()[0]));else{const x=b?s:l.v,h=_?s:l.w;o.log.info("Rebinding cross-boundary edge as ",x,h,f,l.name),r.setEdge(x,h,f,l.name)}}else o.log.info("Skipping copy of edge ",l.v,"-->",l.w," rootId: ",s," clusterId:",e)}catch(C){o.log.error(C)}})}o.log.debug("Removing node",i),r.removeNode(i)})},"copy"),S=o.__name((e,r)=>{const n=r.children(e);let s=[...n];for(const t of n)y.set(t,e),s=[...s,...S(t,r)];return s},"extractDescendants"),M=o.__name((e,r,n)=>{const s=e.edges().filter(l=>l.v===r||l.w===r),t=e.edges().filter(l=>l.v===n||l.w===n),i=s.map(l=>({v:l.v===r?n:l.v,w:l.w===r?r:l.w})),c=t.map(l=>({v:l.v,w:l.w}));return i.filter(l=>c.some(f=>l.v===f.v&&l.w===f.w))},"findCommonEdges"),m=o.__name((e,r,n)=>{const s=r.children(e);if(o.log.trace("Searching children of id ",e,s),s.length<1)return e;let t;for(const i of s){const c=m(i,r,n),u=M(r,n,c);if(c)if(u.length>0)t=c;else return c}return t},"findNonClusterChild"),N=o.__name(e=>!a.has(e)||!a.get(e).externalConnections?e:a.has(e)?a.get(e).id:e,"getAnchorId"),R=o.__name((e,r)=>{if(!e||r>10){o.log.debug("Opting out, no graph ");return}else o.log.debug("Opting in, graph ");e.nodes().forEach(function(n){e.children(n).length>0&&(o.log.warn("Cluster identified",n," Replacement id in edges: ",m(n,e,n)),d.set(n,S(n,e)),a.set(n,{id:m(n,e,n),clusterData:e.node(n)}))}),e.nodes().forEach(function(n){const s=e.children(n),t=e.edges();s.length>0?(o.log.debug("Cluster identified",n,d),t.forEach(i=>{const c=w(i.v,n),u=w(i.w,n);c^u&&(o.log.warn("Edge: ",i," leaves cluster ",n),o.log.warn("Descendants of XXX ",n,": ",d.get(n)),a.get(n).externalConnections=!0)})):o.log.debug("Not a cluster ",n,d)});for(let n of a.keys()){const s=a.get(n).id,t=e.parent(s);t!==n&&a.has(t)&&!a.get(t).externalConnections&&(a.get(n).id=t);const i=e.edges().some(c=>c.v===n);if(s&&a.get(n)?.externalConnections&&i&&O(e,s,n)){const c=H(e,n,e.parent(s));c&&(a.get(n).id=c)}}e.edges().forEach(function(n){const s=e.edge(n);o.log.warn("Edge "+n.v+" -> "+n.w+": "+JSON.stringify(n)),o.log.warn("Edge "+n.v+" -> "+n.w+": "+JSON.stringify(e.edge(n)));let t=n.v,i=n.w;if(o.log.warn("Fix XXX",a,"ids:",n.v,n.w,"Translating: ",a.get(n.v)," --- ",a.get(n.w)),a.get(n.v)||a.get(n.w)){if(o.log.warn("Fixing and trying - removing XXX",n.v,n.w,n.name),t=N(n.v),i=N(n.w),e.removeEdge(n.v,n.w,n.name),t!==n.v){const c=e.parent(t);a.get(c).externalConnections=!0,s.fromCluster=n.v}if(i!==n.w){const c=e.parent(i);a.get(c).externalConnections=!0,s.toCluster=n.w}o.log.warn("Fix Replacing with XXX",t,i,n.name),e.setEdge(t,i,s,n.name)}}),o.log.warn("Adjusted Graph",v(e)),X(e,0),o.log.trace(a)},"adjustClustersAndEdges"),X=o.__name((e,r)=>{if(o.log.warn("extractor - ",r,v(e),e.children("D")),r>10){o.log.error("Bailing out");return}let n=e.nodes(),s=!1;for(const t of n){const i=e.children(t);s=s||i.length>0}if(!s){o.log.debug("Done, no node has children",e.nodes());return}o.log.debug("Nodes = ",n,r);for(const t of n)if(o.log.debug("Extracting node",t,a,a.has(t)&&!a.get(t).externalConnections,!e.parent(t),e.node(t),e.children("D")," Depth ",r),!a.has(t))o.log.debug("Not a cluster",t,r);else if(a.get(t)?.clusterData?.explicitDir&&e.children(t)&&e.children(t).length>0){o.log.warn("Cluster with explicit dir, creating subgraph for children",t,r);const i=a.get(t).clusterData.dir,c=new g.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:i,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});D(t,e,c,t);const u=e.node(t)||{};e.setNode(t,{...u,clusterNode:!0,id:t,clusterData:a.get(t).clusterData,label:a.get(t).label,graph:c}),o.log.warn("Subgraph for cluster with explicit dir created:",t,v(c))}else if(!a.get(t).externalConnections&&e.children(t)&&e.children(t).length>0){o.log.warn("Cluster without external connections, without a parent and with children",t,r);let c=e.graph().rankdir==="TB"?"LR":"TB";a.get(t)?.clusterData?.dir&&(c=a.get(t).clusterData.dir,o.log.warn("Fixing dir",a.get(t).clusterData.dir,c));const u=new g.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:c,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});D(t,e,u,t);const l=e.node(t)||{};e.setNode(t,{...l,clusterNode:!0,id:t,clusterData:a.get(t).clusterData,label:a.get(t).label,graph:u}),o.log.debug("Old graph after copy",v(e))}else o.log.warn("Cluster ** ",t," **not meeting the criteria !externalConnections:",!a.get(t).externalConnections," no parent: ",!e.parent(t)," children ",e.children(t)&&e.children(t).length>0,e.children("D"),r),o.log.debug(a);n=e.nodes(),o.log.warn("New list of nodes",n);for(const t of n){const i=e.node(t);o.log.warn(" Now next level",t,i),i?.clusterNode&&X(i.graph,r+1)}},"extractor"),A=o.__name((e,r)=>{if(r.length===0)return[];let n=Object.assign([],r);return r.forEach(s=>{const t=e.children(s),i=A(e,t);n=[...n,...i]}),n},"sorter"),U=o.__name(e=>A(e,e.children()),"sortNodesByHierarchy"),O=o.__name((e,r,n)=>{let s=e.parent(r);for(;s&&s!==n;){const t=a.get(s);if(t&&!t.externalConnections)return!0;s=e.parent(s)}return!1},"isNodeInExtractableCluster"),H=o.__name((e,r,n)=>{const s=e.children(r)??[];for(const t of s){if(t===n||w(t,n))continue;const i=m(t,e,r);if(i&&!O(e,i,r))return i}return null},"findSafeAnchorNode");exports.adjustClustersAndEdges=R;exports.clear=p;exports.clusterDb=a;exports.findNonClusterChild=m;exports.sortNodesByHierarchy=U;exports.write=v;
-//# sourceMappingURL=chunk-RYQCIY6F-he5fUSYo.cjs.map
+"use strict";const o=require("./extractHeadings-D7EoVxUv.cjs"),g=require("./graph-BgRih2Qv.cjs"),E=require("./map-BvScllSQ.cjs");var k=4;function B(e){return E.baseClone(e,k)}function v(e){var r={options:{directed:e.isDirected(),multigraph:e.isMultigraph(),compound:e.isCompound()},nodes:j(e),edges:L(e)};return g.isUndefined(e.graph())||(r.value=B(e.graph())),r}function j(e){return E.map(e.nodes(),function(r){var n=e.node(r),s=e.parent(r),t={v:r};return g.isUndefined(n)||(t.value=n),g.isUndefined(s)||(t.parent=s),t})}function L(e){return E.map(e.edges(),function(r){var n=e.edge(r),s={v:r.v,w:r.w};return g.isUndefined(r.name)||(s.name=r.name),g.isUndefined(n)||(s.value=n),s})}var a=new Map,d=new Map,y=new Map,p=o.__name(()=>{d.clear(),y.clear(),a.clear()},"clear"),w=o.__name((e,r)=>{const n=d.get(r)||[];return o.log.trace("In isDescendant",r," ",e," = ",n.includes(e)),n.includes(e)},"isDescendant"),F=o.__name((e,r)=>{const n=d.get(r)||[];return o.log.info("Descendants of ",r," is ",n),o.log.info("Edge is ",e),e.v===r||e.w===r?!1:n?n.includes(e.v)||w(e.v,r)||w(e.w,r)||n.includes(e.w):(o.log.debug("Tilt, ",r,",not in descendants"),!1)},"edgeInCluster"),D=o.__name((e,r,n,s)=>{o.log.warn("Copying children of ",e,"root",s,"data",r.node(e),s);const t=r.children(e)||[];e!==s&&t.push(e),o.log.warn("Copying (nodes) clusterId",e,"nodes",t),t.forEach(i=>{if(r.children(i).length>0)D(i,r,n,s);else{const c=r.node(i);o.log.info("cp ",i," to ",s," with parent ",e),n.setNode(i,c),s!==r.parent(i)&&(o.log.warn("Setting parent",i,r.parent(i)),n.setParent(i,r.parent(i))),e!==s&&i!==e?(o.log.debug("Setting parent",i,e),n.setParent(i,e)):(o.log.info("In copy ",e,"root",s,"data",r.node(e),s),o.log.debug("Not Setting parent for node=",i,"cluster!==rootId",e!==s,"node!==clusterId",i!==e));const u=r.edges(i);o.log.debug("Copying Edges",u),u.forEach(l=>{o.log.info("Edge",l);const f=r.edge(l.v,l.w,l.name);o.log.info("Edge data",f,s);try{if(F(l,s)){const C=d.get(s)||[],b=C.includes(l.v)||w(l.v,s)||l.v===s,_=C.includes(l.w)||w(l.w,s)||l.w===s;if(b&&_)o.log.info("Copying as ",l.v,l.w,f,l.name),n.setEdge(l.v,l.w,f,l.name),o.log.info("newGraph edges ",n.edges(),n.edge(n.edges()[0]));else{const x=b?s:l.v,h=_?s:l.w;o.log.info("Rebinding cross-boundary edge as ",x,h,f,l.name),r.setEdge(x,h,f,l.name)}}else o.log.info("Skipping copy of edge ",l.v,"-->",l.w," rootId: ",s," clusterId:",e)}catch(C){o.log.error(C)}})}o.log.debug("Removing node",i),r.removeNode(i)})},"copy"),S=o.__name((e,r)=>{const n=r.children(e);let s=[...n];for(const t of n)y.set(t,e),s=[...s,...S(t,r)];return s},"extractDescendants"),M=o.__name((e,r,n)=>{const s=e.edges().filter(l=>l.v===r||l.w===r),t=e.edges().filter(l=>l.v===n||l.w===n),i=s.map(l=>({v:l.v===r?n:l.v,w:l.w===r?r:l.w})),c=t.map(l=>({v:l.v,w:l.w}));return i.filter(l=>c.some(f=>l.v===f.v&&l.w===f.w))},"findCommonEdges"),m=o.__name((e,r,n)=>{const s=r.children(e);if(o.log.trace("Searching children of id ",e,s),s.length<1)return e;let t;for(const i of s){const c=m(i,r,n),u=M(r,n,c);if(c)if(u.length>0)t=c;else return c}return t},"findNonClusterChild"),N=o.__name(e=>!a.has(e)||!a.get(e).externalConnections?e:a.has(e)?a.get(e).id:e,"getAnchorId"),R=o.__name((e,r)=>{if(!e||r>10){o.log.debug("Opting out, no graph ");return}else o.log.debug("Opting in, graph ");e.nodes().forEach(function(n){e.children(n).length>0&&(o.log.warn("Cluster identified",n," Replacement id in edges: ",m(n,e,n)),d.set(n,S(n,e)),a.set(n,{id:m(n,e,n),clusterData:e.node(n)}))}),e.nodes().forEach(function(n){const s=e.children(n),t=e.edges();s.length>0?(o.log.debug("Cluster identified",n,d),t.forEach(i=>{const c=w(i.v,n),u=w(i.w,n);c^u&&(o.log.warn("Edge: ",i," leaves cluster ",n),o.log.warn("Descendants of XXX ",n,": ",d.get(n)),a.get(n).externalConnections=!0)})):o.log.debug("Not a cluster ",n,d)});for(let n of a.keys()){const s=a.get(n).id,t=e.parent(s);t!==n&&a.has(t)&&!a.get(t).externalConnections&&(a.get(n).id=t);const i=e.edges().some(c=>c.v===n);if(s&&a.get(n)?.externalConnections&&i&&O(e,s,n)){const c=H(e,n,e.parent(s));c&&(a.get(n).id=c)}}e.edges().forEach(function(n){const s=e.edge(n);o.log.warn("Edge "+n.v+" -> "+n.w+": "+JSON.stringify(n)),o.log.warn("Edge "+n.v+" -> "+n.w+": "+JSON.stringify(e.edge(n)));let t=n.v,i=n.w;if(o.log.warn("Fix XXX",a,"ids:",n.v,n.w,"Translating: ",a.get(n.v)," --- ",a.get(n.w)),a.get(n.v)||a.get(n.w)){if(o.log.warn("Fixing and trying - removing XXX",n.v,n.w,n.name),t=N(n.v),i=N(n.w),e.removeEdge(n.v,n.w,n.name),t!==n.v){const c=e.parent(t);a.get(c).externalConnections=!0,s.fromCluster=n.v}if(i!==n.w){const c=e.parent(i);a.get(c).externalConnections=!0,s.toCluster=n.w}o.log.warn("Fix Replacing with XXX",t,i,n.name),e.setEdge(t,i,s,n.name)}}),o.log.warn("Adjusted Graph",v(e)),X(e,0),o.log.trace(a)},"adjustClustersAndEdges"),X=o.__name((e,r)=>{if(o.log.warn("extractor - ",r,v(e),e.children("D")),r>10){o.log.error("Bailing out");return}let n=e.nodes(),s=!1;for(const t of n){const i=e.children(t);s=s||i.length>0}if(!s){o.log.debug("Done, no node has children",e.nodes());return}o.log.debug("Nodes = ",n,r);for(const t of n)if(o.log.debug("Extracting node",t,a,a.has(t)&&!a.get(t).externalConnections,!e.parent(t),e.node(t),e.children("D")," Depth ",r),!a.has(t))o.log.debug("Not a cluster",t,r);else if(a.get(t)?.clusterData?.explicitDir&&e.children(t)&&e.children(t).length>0){o.log.warn("Cluster with explicit dir, creating subgraph for children",t,r);const i=a.get(t).clusterData.dir,c=new g.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:i,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});D(t,e,c,t);const u=e.node(t)||{};e.setNode(t,{...u,clusterNode:!0,id:t,clusterData:a.get(t).clusterData,label:a.get(t).label,graph:c}),o.log.warn("Subgraph for cluster with explicit dir created:",t,v(c))}else if(!a.get(t).externalConnections&&e.children(t)&&e.children(t).length>0){o.log.warn("Cluster without external connections, without a parent and with children",t,r);let c=e.graph().rankdir==="TB"?"LR":"TB";a.get(t)?.clusterData?.dir&&(c=a.get(t).clusterData.dir,o.log.warn("Fixing dir",a.get(t).clusterData.dir,c));const u=new g.Graph({multigraph:!0,compound:!0}).setGraph({rankdir:c,nodesep:50,ranksep:50,marginx:8,marginy:8}).setDefaultEdgeLabel(function(){return{}});D(t,e,u,t);const l=e.node(t)||{};e.setNode(t,{...l,clusterNode:!0,id:t,clusterData:a.get(t).clusterData,label:a.get(t).label,graph:u}),o.log.debug("Old graph after copy",v(e))}else o.log.warn("Cluster ** ",t," **not meeting the criteria !externalConnections:",!a.get(t).externalConnections," no parent: ",!e.parent(t)," children ",e.children(t)&&e.children(t).length>0,e.children("D"),r),o.log.debug(a);n=e.nodes(),o.log.warn("New list of nodes",n);for(const t of n){const i=e.node(t);o.log.warn(" Now next level",t,i),i?.clusterNode&&X(i.graph,r+1)}},"extractor"),A=o.__name((e,r)=>{if(r.length===0)return[];let n=Object.assign([],r);return r.forEach(s=>{const t=e.children(s),i=A(e,t);n=[...n,...i]}),n},"sorter"),U=o.__name(e=>A(e,e.children()),"sortNodesByHierarchy"),O=o.__name((e,r,n)=>{let s=e.parent(r);for(;s&&s!==n;){const t=a.get(s);if(t&&!t.externalConnections)return!0;s=e.parent(s)}return!1},"isNodeInExtractableCluster"),H=o.__name((e,r,n)=>{const s=e.children(r)??[];for(const t of s){if(t===n||w(t,n))continue;const i=m(t,e,r);if(i&&!O(e,i,r))return i}return null},"findSafeAnchorNode");exports.adjustClustersAndEdges=R;exports.clear=p;exports.clusterDb=a;exports.findNonClusterChild=m;exports.sortNodesByHierarchy=U;exports.write=v;
+//# sourceMappingURL=chunk-RYQCIY6F-BaozHSpS.cjs.map

package/dist/{chunk-RYQCIY6F-he5fUSYo.cjs.map → chunk-RYQCIY6F-BaozHSpS.cjs.map}

@@ -1 +1 @@
-{"version":3,"file":"chunk-RYQCIY6F-he5fUSYo.cjs","sources":["../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/clone.js","../../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/json.js","../../../node_modules/.pnpm/mermaid@11.16.0/node_modules/mermaid/dist/chunks/mermaid.core/chunk-RYQCIY6F.mjs"],"sourcesContent":["import baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nexport default clone;\n","import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\n/**\n * @import { NodeID, EdgeObj, GraphOptions } from './graph.js';\n */\n\nexport { write, read };\n\n/**\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n *\n * @typedef {object} GraphJSON\n * @property {Required<GraphOptions>} options - The options used to create the graph.\n * @property {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} nodes - The nodes in the graph.\n * @property {Array<EdgeObj & { value?: EdgeLabel }>} edges - The edges in the graph.\n * @property {GraphLabel} [value] - The graph's value, if any.\n */\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a\n * string with\n * [JSON.stringify](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify).\n * The graph can later be restored using {@link read}.\n *\n * @example\n *\n * ```js\n * var g = new graphlib.Graph();\n * g.setNode(\"a\", { label: \"node a\" });\n * g.setNode(\"b\", { label: \"node b\" });\n * g.setEdge(\"a\", \"b\", { label: \"edge a->b\" });\n * graphlib.json.write(g);\n * // Returns the object:\n * //\n * // {\n * //   \"options\": {\n * //     \"directed\": true,\n * //     \"multigraph\": false,\n * //     \"compound\": false\n * //   },\n * //   \"nodes\": [\n * //     { \"v\": \"a\", \"value\": { \"label\": \"node a\" } },\n * //     { \"v\": \"b\", \"value\": { \"label\": \"node b\" } }\n * //   ],\n * //   \"edges\": [\n * //     { \"v\": \"a\", \"w\": \"b\", \"value\": { \"label\": \"edge a->b\" } }\n * //   ]\n * // }\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {Graph<GraphLabel, NodeLabel, EdgeLabel>} g - The graph to serialize.\n * @returns {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} The JSON representation of the graph.\n */\nfunction write(g) {\n  /** @type {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} */\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\n/**\n * @template NodeLabel - Label of a node.\n *\n * @param {Graph<unknown, NodeLabel, unknown>} g - The graph to serialize.\n * @returns {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} The nodes in the graph.\n */\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function (v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    /** @type {{ v: NodeID; value?: NodeLabel; parent?: NodeID }} */\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\n/**\n * @template EdgeLabel - Label of a node.\n *\n * @param {Graph<unknown, unknown, EdgeLabel>} g - The graph to serialize.\n * @returns {Array<EdgeObj & { value?: EdgeLabel }>} The edges in the graph.\n */\nfunction writeEdges(g) {\n  return _.map(g.edges(), function (e) {\n    var edgeValue = g.edge(e);\n    /** @type {EdgeObj & { value?: EdgeLabel }} */\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\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @example\n *\n * For example, if we have serialized the graph in {@link write}\n * to a string named `str`, we can restore it to a graph as follows:\n *\n * ```js\n * var g2 = graphlib.json.read(JSON.parse(str));\n * // or, in order to copy the graph\n * var g3 = graphlib.json.read(graphlib.json.write(g))\n *\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} json - The JSON representation of the graph.\n * @returns {Graph<GraphLabel, NodeLabel, EdgeLabel>} The restored graph.\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  log\n} from \"./chunk-X3CZISLH.mjs\";\nimport {\n  __name\n} from \"./chunk-Y2CYZVJY.mjs\";\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 clear = /* @__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            const rootDescendants = descendants.get(rootId) || [];\n            const vIn = rootDescendants.includes(edge.v) || isDescendant(edge.v, rootId) || edge.v === rootId;\n            const wIn = rootDescendants.includes(edge.w) || isDescendant(edge.w, rootId) || edge.w === rootId;\n            if (vIn && wIn) {\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              const newV = vIn ? rootId : edge.v;\n              const newW = wIn ? rootId : edge.w;\n              log.info(\"Rebinding cross-boundary edge as \", newV, newW, data2, edge.name);\n              graph.setEdge(newV, newW, data2, edge.name);\n            }\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    const hasDirectOutgoingEdge = graph.edges().some((edge) => edge.v === id);\n    if (nonClusterChild && clusterDb.get(id)?.externalConnections && hasDirectOutgoingEdge && isNodeInExtractableCluster(graph, nonClusterChild, id)) {\n      const safeAnchor = findSafeAnchorNode(graph, id, graph.parent(nonClusterChild));\n      if (safeAnchor) {\n        clusterDb.get(id).id = safeAnchor;\n      }\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)?.clusterData?.explicitDir && graph.children(node) && graph.children(node).length > 0) {\n      log.warn(\"Cluster with explicit dir, creating subgraph for children\", node, depth);\n      const dir = clusterDb.get(node).clusterData.dir;\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      copy(node, graph, clusterGraph, node);\n      const clusterNodeData = graph.node(node) || {};\n      graph.setNode(node, {\n        ...clusterNodeData,\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(\n        \"Subgraph for cluster with explicit dir created:\",\n        node,\n        graphlibJson.write(clusterGraph)\n      );\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      copy(node, graph, clusterGraph, node);\n      const clusterNodeData = graph.node(node) || {};\n      graph.setNode(node, {\n        ...clusterNodeData,\n        clusterNode: true,\n        id: node,\n        clusterData: clusterDb.get(node).clusterData,\n        label: clusterDb.get(node).label,\n        graph: clusterGraph\n      });\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\");\nvar isNodeInExtractableCluster = /* @__PURE__ */ __name((graph, node, rootId) => {\n  let parent = graph.parent(node);\n  while (parent && parent !== rootId) {\n    const cluster = clusterDb.get(parent);\n    if (cluster && !cluster.externalConnections) {\n      return true;\n    }\n    parent = graph.parent(parent);\n  }\n  return false;\n}, \"isNodeInExtractableCluster\");\nvar findSafeAnchorNode = /* @__PURE__ */ __name((graph, clusterId, excludedCluster) => {\n  const children = graph.children(clusterId) ?? [];\n  for (const child of children) {\n    if (child === excludedCluster || isDescendant(child, excludedCluster)) {\n      continue;\n    }\n    const candidate = findNonClusterChild(child, graph, clusterId);\n    if (!candidate) {\n      continue;\n    }\n    if (!isNodeInExtractableCluster(graph, candidate, clusterId)) {\n      return candidate;\n    }\n  }\n  return null;\n}, \"findSafeAnchorNode\");\n\nexport {\n  clusterDb,\n  clear,\n  findNonClusterChild,\n  adjustClustersAndEdges,\n  sortNodesByHierarchy\n};\n"],"names":["CLONE_SYMBOLS_FLAG","clone","value","baseClone","write","g","json","writeNodes","writeEdges","_.isUndefined","_.clone","_.map","v","nodeValue","parent","node","e","edgeValue","edge","clusterDb","descendants","parents","clear","__name","isDescendant","id","ancestorId","ancestorDescendants","log","edgeInCluster","clusterId","clusterDescendants","copy","graph","newGraph","rootId","nodes","data","edges","data2","rootDescendants","vIn","wIn","newV","newW","extractDescendants","children","res","child","findCommonEdges","id1","id2","edges1","edges2","edges1Prim","edges2Prim","edgeIn1","findNonClusterChild","reserve","_id","commonEdges","getAnchorId","adjustClustersAndEdges","depth","d1","d2","nonClusterChild","hasDirectOutgoingEdge","isNodeInExtractableCluster","safeAnchor","findSafeAnchorNode","w","graphlibJson.write","extractor","hasChildren","dir","clusterGraph","graphlib.Graph","clusterNodeData","sorter","result","sorted","sortNodesByHierarchy","cluster","excludedCluster","candidate"],"mappings":"iIAGA,IAAIA,EAAqB,EA4BzB,SAASC,EAAMC,EAAO,CACpB,OAAOC,EAAAA,UAAUD,EAAOF,CAAkB,CAC5C,CC0BA,SAASI,EAAMC,EAAG,CAEhB,IAAIC,EAAO,CACT,QAAS,CACP,SAAUD,EAAE,WAAU,EACtB,WAAYA,EAAE,aAAY,EAC1B,SAAUA,EAAE,WAAU,CAC5B,EACI,MAAOE,EAAWF,CAAC,EACnB,MAAOG,EAAWH,CAAC,CACvB,EACE,OAAKI,EAAAA,YAAcJ,EAAE,MAAK,CAAE,IAC1BC,EAAK,MAAQI,EAAQL,EAAE,MAAK,CAAE,GAEzBC,CACT,CAQA,SAASC,EAAWF,EAAG,CACrB,OAAOM,EAAAA,IAAMN,EAAE,MAAK,EAAI,SAAUO,EAAG,CACnC,IAAIC,EAAYR,EAAE,KAAKO,CAAC,EACpBE,EAAST,EAAE,OAAOO,CAAC,EAEnBG,EAAO,CAAE,EAAGH,CAAC,EACjB,OAAKH,EAAAA,YAAcI,CAAS,IAC1BE,EAAK,MAAQF,GAEVJ,EAAAA,YAAcK,CAAM,IACvBC,EAAK,OAASD,GAETC,CACT,CAAC,CACH,CAQA,SAASP,EAAWH,EAAG,CACrB,OAAOM,EAAAA,IAAMN,EAAE,MAAK,EAAI,SAAUW,EAAG,CACnC,IAAIC,EAAYZ,EAAE,KAAKW,CAAC,EAEpBE,EAAO,CAAE,EAAGF,EAAE,EAAG,EAAGA,EAAE,CAAC,EAC3B,OAAKP,EAAAA,YAAcO,EAAE,IAAI,IACvBE,EAAK,KAAOF,EAAE,MAEXP,EAAAA,YAAcQ,CAAS,IAC1BC,EAAK,MAAQD,GAERC,CACT,CAAC,CACH,CC3GG,IAACC,EAA4B,IAAI,IAChCC,EAA8B,IAAI,IAClCC,EAA0B,IAAI,IAC9BC,EAAwBC,EAAAA,OAAO,IAAM,CACvCH,EAAY,MAAK,EACjBC,EAAQ,MAAK,EACbF,EAAU,MAAK,CACjB,EAAG,OAAO,EACNK,EAA+BD,EAAAA,OAAO,CAACE,EAAIC,IAAe,CAC5D,MAAMC,EAAsBP,EAAY,IAAIM,CAAU,GAAK,CAAA,EAC3DE,OAAAA,EAAAA,IAAI,MAAM,kBAAmBF,EAAY,IAAKD,EAAI,MAAOE,EAAoB,SAASF,CAAE,CAAC,EAClFE,EAAoB,SAASF,CAAE,CACxC,EAAG,cAAc,EACbI,EAAgCN,EAAAA,OAAO,CAACL,EAAMY,IAAc,CAC9D,MAAMC,EAAqBX,EAAY,IAAIU,CAAS,GAAK,CAAA,EAGzD,OAFAF,EAAAA,IAAI,KAAK,kBAAmBE,EAAW,OAAQC,CAAkB,EACjEH,MAAI,KAAK,WAAYV,CAAI,EACrBA,EAAK,IAAMY,GAAaZ,EAAK,IAAMY,EAC9B,GAEJC,EAIEA,EAAmB,SAASb,EAAK,CAAC,GAAKM,EAAaN,EAAK,EAAGY,CAAS,GAAKN,EAAaN,EAAK,EAAGY,CAAS,GAAKC,EAAmB,SAASb,EAAK,CAAC,GAHpJU,EAAAA,IAAI,MAAM,SAAUE,EAAW,qBAAqB,EAC7C,GAGX,EAAG,eAAe,EACdE,EAAuBT,EAAAA,OAAO,CAACO,EAAWG,EAAOC,EAAUC,IAAW,CACxEP,EAAAA,IAAI,KACF,uBACAE,EACA,OACAK,EACA,OACAF,EAAM,KAAKH,CAAS,EACpBK,CACJ,EACE,MAAMC,EAAQH,EAAM,SAASH,CAAS,GAAK,CAAA,EACvCA,IAAcK,GAChBC,EAAM,KAAKN,CAAS,EAEtBF,EAAAA,IAAI,KAAK,4BAA6BE,EAAW,QAASM,CAAK,EAC/DA,EAAM,QAASrB,GAAS,CACtB,GAAIkB,EAAM,SAASlB,CAAI,EAAE,OAAS,EAChCiB,EAAKjB,EAAMkB,EAAOC,EAAUC,CAAM,MAC7B,CACL,MAAME,EAAOJ,EAAM,KAAKlB,CAAI,EAC5Ba,EAAAA,IAAI,KAAK,MAAOb,EAAM,OAAQoB,EAAQ,gBAAiBL,CAAS,EAChEI,EAAS,QAAQnB,EAAMsB,CAAI,EACvBF,IAAWF,EAAM,OAAOlB,CAAI,IAC9Ba,EAAAA,IAAI,KAAK,iBAAkBb,EAAMkB,EAAM,OAAOlB,CAAI,CAAC,EACnDmB,EAAS,UAAUnB,EAAMkB,EAAM,OAAOlB,CAAI,CAAC,GAEzCe,IAAcK,GAAUpB,IAASe,GACnCF,EAAAA,IAAI,MAAM,iBAAkBb,EAAMe,CAAS,EAC3CI,EAAS,UAAUnB,EAAMe,CAAS,IAElCF,EAAAA,IAAI,KAAK,WAAYE,EAAW,OAAQK,EAAQ,OAAQF,EAAM,KAAKH,CAAS,EAAGK,CAAM,EACrFP,EAAAA,IAAI,MACF,+BACAb,EACA,mBACAe,IAAcK,EACd,mBACApB,IAASe,CACnB,GAEM,MAAMQ,EAAQL,EAAM,MAAMlB,CAAI,EAC9Ba,MAAI,MAAM,gBAAiBU,CAAK,EAChCA,EAAM,QAASpB,GAAS,CACtBU,MAAI,KAAK,OAAQV,CAAI,EACrB,MAAMqB,EAAQN,EAAM,KAAKf,EAAK,EAAGA,EAAK,EAAGA,EAAK,IAAI,EAClDU,EAAAA,IAAI,KAAK,YAAaW,EAAOJ,CAAM,EACnC,GAAI,CACF,GAAIN,EAAcX,EAAMiB,CAAM,EAAG,CAC/B,MAAMK,EAAkBpB,EAAY,IAAIe,CAAM,GAAK,CAAA,EAC7CM,EAAMD,EAAgB,SAAStB,EAAK,CAAC,GAAKM,EAAaN,EAAK,EAAGiB,CAAM,GAAKjB,EAAK,IAAMiB,EACrFO,EAAMF,EAAgB,SAAStB,EAAK,CAAC,GAAKM,EAAaN,EAAK,EAAGiB,CAAM,GAAKjB,EAAK,IAAMiB,EAC3F,GAAIM,GAAOC,EACTd,MAAI,KAAK,cAAeV,EAAK,EAAGA,EAAK,EAAGqB,EAAOrB,EAAK,IAAI,EACxDgB,EAAS,QAAQhB,EAAK,EAAGA,EAAK,EAAGqB,EAAOrB,EAAK,IAAI,EACjDU,EAAAA,IAAI,KAAK,kBAAmBM,EAAS,MAAK,EAAIA,EAAS,KAAKA,EAAS,QAAQ,CAAC,CAAC,CAAC,MAC3E,CACL,MAAMS,EAAOF,EAAMN,EAASjB,EAAK,EAC3B0B,EAAOF,EAAMP,EAASjB,EAAK,EACjCU,EAAAA,IAAI,KAAK,oCAAqCe,EAAMC,EAAML,EAAOrB,EAAK,IAAI,EAC1Ee,EAAM,QAAQU,EAAMC,EAAML,EAAOrB,EAAK,IAAI,CAC5C,CACF,MACEU,EAAAA,IAAI,KACF,yBACAV,EAAK,EACL,MACAA,EAAK,EACL,YACAiB,EACA,cACAL,CACd,CAEQ,OAASd,EAAG,CACVY,EAAAA,IAAI,MAAMZ,CAAC,CACb,CACF,CAAC,CACH,CACAY,MAAI,MAAM,gBAAiBb,CAAI,EAC/BkB,EAAM,WAAWlB,CAAI,CACvB,CAAC,CACH,EAAG,MAAM,EACL8B,EAAqCtB,EAAAA,OAAO,CAACE,EAAIQ,IAAU,CAC7D,MAAMa,EAAWb,EAAM,SAASR,CAAE,EAClC,IAAIsB,EAAM,CAAC,GAAGD,CAAQ,EACtB,UAAWE,KAASF,EAClBzB,EAAQ,IAAI2B,EAAOvB,CAAE,EACrBsB,EAAM,CAAC,GAAGA,EAAK,GAAGF,EAAmBG,EAAOf,CAAK,CAAC,EAEpD,OAAOc,CACT,EAAG,oBAAoB,EACnBE,EAAkC1B,EAAAA,OAAO,CAACU,EAAOiB,EAAKC,IAAQ,CAChE,MAAMC,EAASnB,EAAM,MAAK,EAAG,OAAQf,GAASA,EAAK,IAAMgC,GAAOhC,EAAK,IAAMgC,CAAG,EACxEG,EAASpB,EAAM,MAAK,EAAG,OAAQf,GAASA,EAAK,IAAMiC,GAAOjC,EAAK,IAAMiC,CAAG,EACxEG,EAAaF,EAAO,IAAKlC,IACtB,CAAE,EAAGA,EAAK,IAAMgC,EAAMC,EAAMjC,EAAK,EAAG,EAAGA,EAAK,IAAMgC,EAAMA,EAAMhC,EAAK,CAAC,EAC5E,EACKqC,EAAaF,EAAO,IAAKnC,IACtB,CAAE,EAAGA,EAAK,EAAG,EAAGA,EAAK,CAAC,EAC9B,EAID,OAHeoC,EAAW,OAAQE,GACzBD,EAAW,KAAMrC,GAASsC,EAAQ,IAAMtC,EAAK,GAAKsC,EAAQ,IAAMtC,EAAK,CAAC,CAC9E,CAEH,EAAG,iBAAiB,EAChBuC,EAAsClC,EAAAA,OAAO,CAACE,EAAIQ,EAAOH,IAAc,CACzE,MAAMgB,EAAWb,EAAM,SAASR,CAAE,EAElC,GADAG,EAAAA,IAAI,MAAM,4BAA6BH,EAAIqB,CAAQ,EAC/CA,EAAS,OAAS,EACpB,OAAOrB,EAET,IAAIiC,EACJ,UAAWV,KAASF,EAAU,CAC5B,MAAMa,EAAMF,EAAoBT,EAAOf,EAAOH,CAAS,EACjD8B,EAAcX,EAAgBhB,EAAOH,EAAW6B,CAAG,EACzD,GAAIA,EACF,GAAIC,EAAY,OAAS,EACvBF,EAAUC,MAEV,QAAOA,CAGb,CACA,OAAOD,CACT,EAAG,qBAAqB,EACpBG,EAA8BtC,EAAAA,OAAQE,GACpC,CAACN,EAAU,IAAIM,CAAE,GAGjB,CAACN,EAAU,IAAIM,CAAE,EAAE,oBACdA,EAELN,EAAU,IAAIM,CAAE,EACXN,EAAU,IAAIM,CAAE,EAAE,GAEpBA,EACN,aAAa,EACZqC,EAAyCvC,EAAAA,OAAO,CAACU,EAAO8B,IAAU,CACpE,GAAI,CAAC9B,GAAS8B,EAAQ,GAAI,CACxBnC,EAAAA,IAAI,MAAM,uBAAuB,EACjC,MACF,MACEA,EAAAA,IAAI,MAAM,mBAAmB,EAE/BK,EAAM,MAAK,EAAG,QAAQ,SAASR,EAAI,CAChBQ,EAAM,SAASR,CAAE,EACrB,OAAS,IACpBG,EAAAA,IAAI,KACF,qBACAH,EACA,6BACAgC,EAAoBhC,EAAIQ,EAAOR,CAAE,CACzC,EACML,EAAY,IAAIK,EAAIoB,EAAmBpB,EAAIQ,CAAK,CAAC,EACjDd,EAAU,IAAIM,EAAI,CAAE,GAAIgC,EAAoBhC,EAAIQ,EAAOR,CAAE,EAAG,YAAaQ,EAAM,KAAKR,CAAE,CAAC,CAAE,EAE7F,CAAC,EACDQ,EAAM,MAAK,EAAG,QAAQ,SAASR,EAAI,CACjC,MAAMqB,EAAWb,EAAM,SAASR,CAAE,EAC5Ba,EAAQL,EAAM,MAAK,EACrBa,EAAS,OAAS,GACpBlB,EAAAA,IAAI,MAAM,qBAAsBH,EAAIL,CAAW,EAC/CkB,EAAM,QAASpB,GAAS,CACtB,MAAM8C,EAAKxC,EAAaN,EAAK,EAAGO,CAAE,EAC5BwC,EAAKzC,EAAaN,EAAK,EAAGO,CAAE,EAC9BuC,EAAKC,IACPrC,EAAAA,IAAI,KAAK,SAAUV,EAAM,mBAAoBO,CAAE,EAC/CG,MAAI,KAAK,sBAAuBH,EAAI,KAAML,EAAY,IAAIK,CAAE,CAAC,EAC7DN,EAAU,IAAIM,CAAE,EAAE,oBAAsB,GAE5C,CAAC,GAEDG,EAAAA,IAAI,MAAM,iBAAkBH,EAAIL,CAAW,CAE/C,CAAC,EACD,QAASK,KAAMN,EAAU,OAAQ,CAC/B,MAAM+C,EAAkB/C,EAAU,IAAIM,CAAE,EAAE,GACpCX,EAASmB,EAAM,OAAOiC,CAAe,EACvCpD,IAAWW,GAAMN,EAAU,IAAIL,CAAM,GAAK,CAACK,EAAU,IAAIL,CAAM,EAAE,sBACnEK,EAAU,IAAIM,CAAE,EAAE,GAAKX,GAEzB,MAAMqD,EAAwBlC,EAAM,QAAQ,KAAMf,GAASA,EAAK,IAAMO,CAAE,EACxE,GAAIyC,GAAmB/C,EAAU,IAAIM,CAAE,GAAG,qBAAuB0C,GAAyBC,EAA2BnC,EAAOiC,EAAiBzC,CAAE,EAAG,CAChJ,MAAM4C,EAAaC,EAAmBrC,EAAOR,EAAIQ,EAAM,OAAOiC,CAAe,CAAC,EAC1EG,IACFlD,EAAU,IAAIM,CAAE,EAAE,GAAK4C,EAE3B,CACF,CACApC,EAAM,MAAK,EAAG,QAAQ,SAASjB,EAAG,CAChC,MAAME,EAAOe,EAAM,KAAKjB,CAAC,EACzBY,EAAAA,IAAI,KAAK,QAAUZ,EAAE,EAAI,OAASA,EAAE,EAAI,KAAO,KAAK,UAAUA,CAAC,CAAC,EAChEY,EAAAA,IAAI,KAAK,QAAUZ,EAAE,EAAI,OAASA,EAAE,EAAI,KAAO,KAAK,UAAUiB,EAAM,KAAKjB,CAAC,CAAC,CAAC,EAC5E,IAAIJ,EAAII,EAAE,EACNuD,EAAIvD,EAAE,EAYV,GAXAY,EAAAA,IAAI,KACF,UACAT,EACA,OACAH,EAAE,EACFA,EAAE,EACF,gBACAG,EAAU,IAAIH,EAAE,CAAC,EACjB,QACAG,EAAU,IAAIH,EAAE,CAAC,CACvB,EACQG,EAAU,IAAIH,EAAE,CAAC,GAAKG,EAAU,IAAIH,EAAE,CAAC,EAAG,CAK5C,GAJAY,MAAI,KAAK,mCAAoCZ,EAAE,EAAGA,EAAE,EAAGA,EAAE,IAAI,EAC7DJ,EAAIiD,EAAY7C,EAAE,CAAC,EACnBuD,EAAIV,EAAY7C,EAAE,CAAC,EACnBiB,EAAM,WAAWjB,EAAE,EAAGA,EAAE,EAAGA,EAAE,IAAI,EAC7BJ,IAAMI,EAAE,EAAG,CACb,MAAMF,EAASmB,EAAM,OAAOrB,CAAC,EAC7BO,EAAU,IAAIL,CAAM,EAAE,oBAAsB,GAC5CI,EAAK,YAAcF,EAAE,CACvB,CACA,GAAIuD,IAAMvD,EAAE,EAAG,CACb,MAAMF,EAASmB,EAAM,OAAOsC,CAAC,EAC7BpD,EAAU,IAAIL,CAAM,EAAE,oBAAsB,GAC5CI,EAAK,UAAYF,EAAE,CACrB,CACAY,EAAAA,IAAI,KAAK,yBAA0BhB,EAAG2D,EAAGvD,EAAE,IAAI,EAC/CiB,EAAM,QAAQrB,EAAG2D,EAAGrD,EAAMF,EAAE,IAAI,CAClC,CACF,CAAC,EACDY,EAAAA,IAAI,KAAK,iBAAkB4C,EAAmBvC,CAAK,CAAC,EACpDwC,EAAUxC,EAAO,CAAC,EAClBL,EAAAA,IAAI,MAAMT,CAAS,CACrB,EAAG,wBAAwB,EACvBsD,EAA4BlD,EAAAA,OAAO,CAACU,EAAO8B,IAAU,CAEvD,GADAnC,MAAI,KAAK,eAAgBmC,EAAOS,EAAmBvC,CAAK,EAAGA,EAAM,SAAS,GAAG,CAAC,EAC1E8B,EAAQ,GAAI,CACdnC,EAAAA,IAAI,MAAM,aAAa,EACvB,MACF,CACA,IAAIQ,EAAQH,EAAM,MAAK,EACnByC,EAAc,GAClB,UAAW3D,KAAQqB,EAAO,CACxB,MAAMU,EAAWb,EAAM,SAASlB,CAAI,EACpC2D,EAAcA,GAAe5B,EAAS,OAAS,CACjD,CACA,GAAI,CAAC4B,EAAa,CAChB9C,EAAAA,IAAI,MAAM,6BAA8BK,EAAM,MAAK,CAAE,EACrD,MACF,CACAL,EAAAA,IAAI,MAAM,WAAYQ,EAAO2B,CAAK,EAClC,UAAWhD,KAAQqB,EAYjB,GAXAR,EAAAA,IAAI,MACF,kBACAb,EACAI,EACAA,EAAU,IAAIJ,CAAI,GAAK,CAACI,EAAU,IAAIJ,CAAI,EAAE,oBAC5C,CAACkB,EAAM,OAAOlB,CAAI,EAClBkB,EAAM,KAAKlB,CAAI,EACfkB,EAAM,SAAS,GAAG,EAClB,UACA8B,CACN,EACQ,CAAC5C,EAAU,IAAIJ,CAAI,EACrBa,EAAAA,IAAI,MAAM,gBAAiBb,EAAMgD,CAAK,UAC7B5C,EAAU,IAAIJ,CAAI,GAAG,aAAa,aAAekB,EAAM,SAASlB,CAAI,GAAKkB,EAAM,SAASlB,CAAI,EAAE,OAAS,EAAG,CACnHa,EAAAA,IAAI,KAAK,4DAA6Db,EAAMgD,CAAK,EACjF,MAAMY,EAAMxD,EAAU,IAAIJ,CAAI,EAAE,YAAY,IACtC6D,EAAe,IAAIC,QAAe,CACtC,WAAY,GACZ,SAAU,EAClB,CAAO,EAAE,SAAS,CACV,QAASF,EACT,QAAS,GACT,QAAS,GACT,QAAS,EACT,QAAS,CACjB,CAAO,EAAE,oBAAoB,UAAW,CAChC,MAAO,CAAA,CACT,CAAC,EACD3C,EAAKjB,EAAMkB,EAAO2C,EAAc7D,CAAI,EACpC,MAAM+D,EAAkB7C,EAAM,KAAKlB,CAAI,GAAK,CAAA,EAC5CkB,EAAM,QAAQlB,EAAM,CAClB,GAAG+D,EACH,YAAa,GACb,GAAI/D,EACJ,YAAaI,EAAU,IAAIJ,CAAI,EAAE,YACjC,MAAOI,EAAU,IAAIJ,CAAI,EAAE,MAC3B,MAAO6D,CACf,CAAO,EACDhD,EAAAA,IAAI,KACF,kDACAb,EACAyD,EAAmBI,CAAY,CACvC,CACI,SAAW,CAACzD,EAAU,IAAIJ,CAAI,EAAE,qBAAuBkB,EAAM,SAASlB,CAAI,GAAKkB,EAAM,SAASlB,CAAI,EAAE,OAAS,EAAG,CAC9Ga,EAAAA,IAAI,KACF,2EACAb,EACAgD,CACR,EAEM,IAAIY,EADkB1C,EAAM,MAAK,EACT,UAAY,KAAO,KAAO,KAC9Cd,EAAU,IAAIJ,CAAI,GAAG,aAAa,MACpC4D,EAAMxD,EAAU,IAAIJ,CAAI,EAAE,YAAY,IACtCa,MAAI,KAAK,aAAcT,EAAU,IAAIJ,CAAI,EAAE,YAAY,IAAK4D,CAAG,GAEjE,MAAMC,EAAe,IAAIC,QAAe,CACtC,WAAY,GACZ,SAAU,EAClB,CAAO,EAAE,SAAS,CACV,QAASF,EACT,QAAS,GACT,QAAS,GACT,QAAS,EACT,QAAS,CACjB,CAAO,EAAE,oBAAoB,UAAW,CAChC,MAAO,CAAA,CACT,CAAC,EACD3C,EAAKjB,EAAMkB,EAAO2C,EAAc7D,CAAI,EACpC,MAAM+D,EAAkB7C,EAAM,KAAKlB,CAAI,GAAK,CAAA,EAC5CkB,EAAM,QAAQlB,EAAM,CAClB,GAAG+D,EACH,YAAa,GACb,GAAI/D,EACJ,YAAaI,EAAU,IAAIJ,CAAI,EAAE,YACjC,MAAOI,EAAU,IAAIJ,CAAI,EAAE,MAC3B,MAAO6D,CACf,CAAO,EACDhD,EAAAA,IAAI,MAAM,uBAAwB4C,EAAmBvC,CAAK,CAAC,CAC7D,MACEL,EAAAA,IAAI,KACF,cACAb,EACA,oDACA,CAACI,EAAU,IAAIJ,CAAI,EAAE,oBACrB,eACA,CAACkB,EAAM,OAAOlB,CAAI,EAClB,aACAkB,EAAM,SAASlB,CAAI,GAAKkB,EAAM,SAASlB,CAAI,EAAE,OAAS,EACtDkB,EAAM,SAAS,GAAG,EAClB8B,CACR,EACMnC,EAAAA,IAAI,MAAMT,CAAS,EAGvBiB,EAAQH,EAAM,MAAK,EACnBL,MAAI,KAAK,oBAAqBQ,CAAK,EACnC,UAAWrB,KAAQqB,EAAO,CACxB,MAAMC,EAAOJ,EAAM,KAAKlB,CAAI,EAC5Ba,EAAAA,IAAI,KAAK,kBAAmBb,EAAMsB,CAAI,EAClCA,GAAM,aACRoC,EAAUpC,EAAK,MAAO0B,EAAQ,CAAC,CAEnC,CACF,EAAG,WAAW,EACVgB,EAAyBxD,EAAAA,OAAO,CAACU,EAAOG,IAAU,CACpD,GAAIA,EAAM,SAAW,EACnB,MAAO,CAAA,EAET,IAAI4C,EAAS,OAAO,OAAO,CAAA,EAAI5C,CAAK,EACpC,OAAAA,EAAM,QAASrB,GAAS,CACtB,MAAM+B,EAAWb,EAAM,SAASlB,CAAI,EAC9BkE,EAASF,EAAO9C,EAAOa,CAAQ,EACrCkC,EAAS,CAAC,GAAGA,EAAQ,GAAGC,CAAM,CAChC,CAAC,EACMD,CACT,EAAG,QAAQ,EACPE,EAAuC3D,EAAAA,OAAQU,GAAU8C,EAAO9C,EAAOA,EAAM,SAAQ,CAAE,EAAG,sBAAsB,EAChHmC,EAA6C7C,EAAAA,OAAO,CAACU,EAAOlB,EAAMoB,IAAW,CAC/E,IAAIrB,EAASmB,EAAM,OAAOlB,CAAI,EAC9B,KAAOD,GAAUA,IAAWqB,GAAQ,CAClC,MAAMgD,EAAUhE,EAAU,IAAIL,CAAM,EACpC,GAAIqE,GAAW,CAACA,EAAQ,oBACtB,MAAO,GAETrE,EAASmB,EAAM,OAAOnB,CAAM,CAC9B,CACA,MAAO,EACT,EAAG,4BAA4B,EAC3BwD,EAAqC/C,EAAAA,OAAO,CAACU,EAAOH,EAAWsD,IAAoB,CACrF,MAAMtC,EAAWb,EAAM,SAASH,CAAS,GAAK,CAAA,EAC9C,UAAWkB,KAASF,EAAU,CAC5B,GAAIE,IAAUoC,GAAmB5D,EAAawB,EAAOoC,CAAe,EAClE,SAEF,MAAMC,EAAY5B,EAAoBT,EAAOf,EAAOH,CAAS,EAC7D,GAAKuD,GAGD,CAACjB,EAA2BnC,EAAOoD,EAAWvD,CAAS,EACzD,OAAOuD,CAEX,CACA,OAAO,IACT,EAAG,oBAAoB","x_google_ignoreList":[0,1,2]}
+{"version":3,"file":"chunk-RYQCIY6F-BaozHSpS.cjs","sources":["../../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/clone.js","../../../node_modules/.pnpm/dagre-d3-es@7.0.14/node_modules/dagre-d3-es/src/graphlib/json.js","../../../node_modules/.pnpm/mermaid@11.16.0/node_modules/mermaid/dist/chunks/mermaid.core/chunk-RYQCIY6F.mjs"],"sourcesContent":["import baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nexport default clone;\n","import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\n/**\n * @import { NodeID, EdgeObj, GraphOptions } from './graph.js';\n */\n\nexport { write, read };\n\n/**\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n *\n * @typedef {object} GraphJSON\n * @property {Required<GraphOptions>} options - The options used to create the graph.\n * @property {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} nodes - The nodes in the graph.\n * @property {Array<EdgeObj & { value?: EdgeLabel }>} edges - The edges in the graph.\n * @property {GraphLabel} [value] - The graph's value, if any.\n */\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a\n * string with\n * [JSON.stringify](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify).\n * The graph can later be restored using {@link read}.\n *\n * @example\n *\n * ```js\n * var g = new graphlib.Graph();\n * g.setNode(\"a\", { label: \"node a\" });\n * g.setNode(\"b\", { label: \"node b\" });\n * g.setEdge(\"a\", \"b\", { label: \"edge a->b\" });\n * graphlib.json.write(g);\n * // Returns the object:\n * //\n * // {\n * //   \"options\": {\n * //     \"directed\": true,\n * //     \"multigraph\": false,\n * //     \"compound\": false\n * //   },\n * //   \"nodes\": [\n * //     { \"v\": \"a\", \"value\": { \"label\": \"node a\" } },\n * //     { \"v\": \"b\", \"value\": { \"label\": \"node b\" } }\n * //   ],\n * //   \"edges\": [\n * //     { \"v\": \"a\", \"w\": \"b\", \"value\": { \"label\": \"edge a->b\" } }\n * //   ]\n * // }\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {Graph<GraphLabel, NodeLabel, EdgeLabel>} g - The graph to serialize.\n * @returns {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} The JSON representation of the graph.\n */\nfunction write(g) {\n  /** @type {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} */\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\n/**\n * @template NodeLabel - Label of a node.\n *\n * @param {Graph<unknown, NodeLabel, unknown>} g - The graph to serialize.\n * @returns {Array<{ v: NodeID; value?: NodeLabel; parent?: NodeID }>} The nodes in the graph.\n */\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function (v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    /** @type {{ v: NodeID; value?: NodeLabel; parent?: NodeID }} */\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\n/**\n * @template EdgeLabel - Label of a node.\n *\n * @param {Graph<unknown, unknown, EdgeLabel>} g - The graph to serialize.\n * @returns {Array<EdgeObj & { value?: EdgeLabel }>} The edges in the graph.\n */\nfunction writeEdges(g) {\n  return _.map(g.edges(), function (e) {\n    var edgeValue = g.edge(e);\n    /** @type {EdgeObj & { value?: EdgeLabel }} */\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\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @example\n *\n * For example, if we have serialized the graph in {@link write}\n * to a string named `str`, we can restore it to a graph as follows:\n *\n * ```js\n * var g2 = graphlib.json.read(JSON.parse(str));\n * // or, in order to copy the graph\n * var g3 = graphlib.json.read(graphlib.json.write(g))\n *\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n * ```\n *\n * @template [GraphLabel=any] - Label of the graph.\n * @template [NodeLabel=any] - Label of a node.\n * @template [EdgeLabel=any] - Label of an edge.\n * @param {GraphJSON<GraphLabel, NodeLabel, EdgeLabel>} json - The JSON representation of the graph.\n * @returns {Graph<GraphLabel, NodeLabel, EdgeLabel>} The restored graph.\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  log\n} from \"./chunk-X3CZISLH.mjs\";\nimport {\n  __name\n} from \"./chunk-Y2CYZVJY.mjs\";\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 clear = /* @__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            const rootDescendants = descendants.get(rootId) || [];\n            const vIn = rootDescendants.includes(edge.v) || isDescendant(edge.v, rootId) || edge.v === rootId;\n            const wIn = rootDescendants.includes(edge.w) || isDescendant(edge.w, rootId) || edge.w === rootId;\n            if (vIn && wIn) {\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              const newV = vIn ? rootId : edge.v;\n              const newW = wIn ? rootId : edge.w;\n              log.info(\"Rebinding cross-boundary edge as \", newV, newW, data2, edge.name);\n              graph.setEdge(newV, newW, data2, edge.name);\n            }\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    const hasDirectOutgoingEdge = graph.edges().some((edge) => edge.v === id);\n    if (nonClusterChild && clusterDb.get(id)?.externalConnections && hasDirectOutgoingEdge && isNodeInExtractableCluster(graph, nonClusterChild, id)) {\n      const safeAnchor = findSafeAnchorNode(graph, id, graph.parent(nonClusterChild));\n      if (safeAnchor) {\n        clusterDb.get(id).id = safeAnchor;\n      }\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)?.clusterData?.explicitDir && graph.children(node) && graph.children(node).length > 0) {\n      log.warn(\"Cluster with explicit dir, creating subgraph for children\", node, depth);\n      const dir = clusterDb.get(node).clusterData.dir;\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      copy(node, graph, clusterGraph, node);\n      const clusterNodeData = graph.node(node) || {};\n      graph.setNode(node, {\n        ...clusterNodeData,\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(\n        \"Subgraph for cluster with explicit dir created:\",\n        node,\n        graphlibJson.write(clusterGraph)\n      );\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      copy(node, graph, clusterGraph, node);\n      const clusterNodeData = graph.node(node) || {};\n      graph.setNode(node, {\n        ...clusterNodeData,\n        clusterNode: true,\n        id: node,\n        clusterData: clusterDb.get(node).clusterData,\n        label: clusterDb.get(node).label,\n        graph: clusterGraph\n      });\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\");\nvar isNodeInExtractableCluster = /* @__PURE__ */ __name((graph, node, rootId) => {\n  let parent = graph.parent(node);\n  while (parent && parent !== rootId) {\n    const cluster = clusterDb.get(parent);\n    if (cluster && !cluster.externalConnections) {\n      return true;\n    }\n    parent = graph.parent(parent);\n  }\n  return false;\n}, \"isNodeInExtractableCluster\");\nvar findSafeAnchorNode = /* @__PURE__ */ __name((graph, clusterId, excludedCluster) => {\n  const children = graph.children(clusterId) ?? [];\n  for (const child of children) {\n    if (child === excludedCluster || isDescendant(child, excludedCluster)) {\n      continue;\n    }\n    const candidate = findNonClusterChild(child, graph, clusterId);\n    if (!candidate) {\n      continue;\n    }\n    if (!isNodeInExtractableCluster(graph, candidate, clusterId)) {\n      return candidate;\n    }\n  }\n  return null;\n}, \"findSafeAnchorNode\");\n\nexport {\n  clusterDb,\n  clear,\n  findNonClusterChild,\n  adjustClustersAndEdges,\n  sortNodesByHierarchy\n};\n"],"names":["CLONE_SYMBOLS_FLAG","clone","value","baseClone","write","g","json","writeNodes","writeEdges","_.isUndefined","_.clone","_.map","v","nodeValue","parent","node","e","edgeValue","edge","clusterDb","descendants","parents","clear","__name","isDescendant","id","ancestorId","ancestorDescendants","log","edgeInCluster","clusterId","clusterDescendants","copy","graph","newGraph","rootId","nodes","data","edges","data2","rootDescendants","vIn","wIn","newV","newW","extractDescendants","children","res","child","findCommonEdges","id1","id2","edges1","edges2","edges1Prim","edges2Prim","edgeIn1","findNonClusterChild","reserve","_id","commonEdges","getAnchorId","adjustClustersAndEdges","depth","d1","d2","nonClusterChild","hasDirectOutgoingEdge","isNodeInExtractableCluster","safeAnchor","findSafeAnchorNode","w","graphlibJson.write","extractor","hasChildren","dir","clusterGraph","graphlib.Graph","clusterNodeData","sorter","result","sorted","sortNodesByHierarchy","cluster","excludedCluster","candidate"],"mappings":"iIAGA,IAAIA,EAAqB,EA4BzB,SAASC,EAAMC,EAAO,CACpB,OAAOC,EAAAA,UAAUD,EAAOF,CAAkB,CAC5C,CC0BA,SAASI,EAAMC,EAAG,CAEhB,IAAIC,EAAO,CACT,QAAS,CACP,SAAUD,EAAE,WAAU,EACtB,WAAYA,EAAE,aAAY,EAC1B,SAAUA,EAAE,WAAU,CAC5B,EACI,MAAOE,EAAWF,CAAC,EACnB,MAAOG,EAAWH,CAAC,CACvB,EACE,OAAKI,EAAAA,YAAcJ,EAAE,MAAK,CAAE,IAC1BC,EAAK,MAAQI,EAAQL,EAAE,MAAK,CAAE,GAEzBC,CACT,CAQA,SAASC,EAAWF,EAAG,CACrB,OAAOM,EAAAA,IAAMN,EAAE,MAAK,EAAI,SAAUO,EAAG,CACnC,IAAIC,EAAYR,EAAE,KAAKO,CAAC,EACpBE,EAAST,EAAE,OAAOO,CAAC,EAEnBG,EAAO,CAAE,EAAGH,CAAC,EACjB,OAAKH,EAAAA,YAAcI,CAAS,IAC1BE,EAAK,MAAQF,GAEVJ,EAAAA,YAAcK,CAAM,IACvBC,EAAK,OAASD,GAETC,CACT,CAAC,CACH,CAQA,SAASP,EAAWH,EAAG,CACrB,OAAOM,EAAAA,IAAMN,EAAE,MAAK,EAAI,SAAUW,EAAG,CACnC,IAAIC,EAAYZ,EAAE,KAAKW,CAAC,EAEpBE,EAAO,CAAE,EAAGF,EAAE,EAAG,EAAGA,EAAE,CAAC,EAC3B,OAAKP,EAAAA,YAAcO,EAAE,IAAI,IACvBE,EAAK,KAAOF,EAAE,MAEXP,EAAAA,YAAcQ,CAAS,IAC1BC,EAAK,MAAQD,GAERC,CACT,CAAC,CACH,CC3GG,IAACC,EAA4B,IAAI,IAChCC,EAA8B,IAAI,IAClCC,EAA0B,IAAI,IAC9BC,EAAwBC,EAAAA,OAAO,IAAM,CACvCH,EAAY,MAAK,EACjBC,EAAQ,MAAK,EACbF,EAAU,MAAK,CACjB,EAAG,OAAO,EACNK,EAA+BD,EAAAA,OAAO,CAACE,EAAIC,IAAe,CAC5D,MAAMC,EAAsBP,EAAY,IAAIM,CAAU,GAAK,CAAA,EAC3DE,OAAAA,EAAAA,IAAI,MAAM,kBAAmBF,EAAY,IAAKD,EAAI,MAAOE,EAAoB,SAASF,CAAE,CAAC,EAClFE,EAAoB,SAASF,CAAE,CACxC,EAAG,cAAc,EACbI,EAAgCN,EAAAA,OAAO,CAACL,EAAMY,IAAc,CAC9D,MAAMC,EAAqBX,EAAY,IAAIU,CAAS,GAAK,CAAA,EAGzD,OAFAF,EAAAA,IAAI,KAAK,kBAAmBE,EAAW,OAAQC,CAAkB,EACjEH,MAAI,KAAK,WAAYV,CAAI,EACrBA,EAAK,IAAMY,GAAaZ,EAAK,IAAMY,EAC9B,GAEJC,EAIEA,EAAmB,SAASb,EAAK,CAAC,GAAKM,EAAaN,EAAK,EAAGY,CAAS,GAAKN,EAAaN,EAAK,EAAGY,CAAS,GAAKC,EAAmB,SAASb,EAAK,CAAC,GAHpJU,EAAAA,IAAI,MAAM,SAAUE,EAAW,qBAAqB,EAC7C,GAGX,EAAG,eAAe,EACdE,EAAuBT,EAAAA,OAAO,CAACO,EAAWG,EAAOC,EAAUC,IAAW,CACxEP,EAAAA,IAAI,KACF,uBACAE,EACA,OACAK,EACA,OACAF,EAAM,KAAKH,CAAS,EACpBK,CACJ,EACE,MAAMC,EAAQH,EAAM,SAASH,CAAS,GAAK,CAAA,EACvCA,IAAcK,GAChBC,EAAM,KAAKN,CAAS,EAEtBF,EAAAA,IAAI,KAAK,4BAA6BE,EAAW,QAASM,CAAK,EAC/DA,EAAM,QAASrB,GAAS,CACtB,GAAIkB,EAAM,SAASlB,CAAI,EAAE,OAAS,EAChCiB,EAAKjB,EAAMkB,EAAOC,EAAUC,CAAM,MAC7B,CACL,MAAME,EAAOJ,EAAM,KAAKlB,CAAI,EAC5Ba,EAAAA,IAAI,KAAK,MAAOb,EAAM,OAAQoB,EAAQ,gBAAiBL,CAAS,EAChEI,EAAS,QAAQnB,EAAMsB,CAAI,EACvBF,IAAWF,EAAM,OAAOlB,CAAI,IAC9Ba,EAAAA,IAAI,KAAK,iBAAkBb,EAAMkB,EAAM,OAAOlB,CAAI,CAAC,EACnDmB,EAAS,UAAUnB,EAAMkB,EAAM,OAAOlB,CAAI,CAAC,GAEzCe,IAAcK,GAAUpB,IAASe,GACnCF,EAAAA,IAAI,MAAM,iBAAkBb,EAAMe,CAAS,EAC3CI,EAAS,UAAUnB,EAAMe,CAAS,IAElCF,EAAAA,IAAI,KAAK,WAAYE,EAAW,OAAQK,EAAQ,OAAQF,EAAM,KAAKH,CAAS,EAAGK,CAAM,EACrFP,EAAAA,IAAI,MACF,+BACAb,EACA,mBACAe,IAAcK,EACd,mBACApB,IAASe,CACnB,GAEM,MAAMQ,EAAQL,EAAM,MAAMlB,CAAI,EAC9Ba,MAAI,MAAM,gBAAiBU,CAAK,EAChCA,EAAM,QAASpB,GAAS,CACtBU,MAAI,KAAK,OAAQV,CAAI,EACrB,MAAMqB,EAAQN,EAAM,KAAKf,EAAK,EAAGA,EAAK,EAAGA,EAAK,IAAI,EAClDU,EAAAA,IAAI,KAAK,YAAaW,EAAOJ,CAAM,EACnC,GAAI,CACF,GAAIN,EAAcX,EAAMiB,CAAM,EAAG,CAC/B,MAAMK,EAAkBpB,EAAY,IAAIe,CAAM,GAAK,CAAA,EAC7CM,EAAMD,EAAgB,SAAStB,EAAK,CAAC,GAAKM,EAAaN,EAAK,EAAGiB,CAAM,GAAKjB,EAAK,IAAMiB,EACrFO,EAAMF,EAAgB,SAAStB,EAAK,CAAC,GAAKM,EAAaN,EAAK,EAAGiB,CAAM,GAAKjB,EAAK,IAAMiB,EAC3F,GAAIM,GAAOC,EACTd,MAAI,KAAK,cAAeV,EAAK,EAAGA,EAAK,EAAGqB,EAAOrB,EAAK,IAAI,EACxDgB,EAAS,QAAQhB,EAAK,EAAGA,EAAK,EAAGqB,EAAOrB,EAAK,IAAI,EACjDU,EAAAA,IAAI,KAAK,kBAAmBM,EAAS,MAAK,EAAIA,EAAS,KAAKA,EAAS,QAAQ,CAAC,CAAC,CAAC,MAC3E,CACL,MAAMS,EAAOF,EAAMN,EAASjB,EAAK,EAC3B0B,EAAOF,EAAMP,EAASjB,EAAK,EACjCU,EAAAA,IAAI,KAAK,oCAAqCe,EAAMC,EAAML,EAAOrB,EAAK,IAAI,EAC1Ee,EAAM,QAAQU,EAAMC,EAAML,EAAOrB,EAAK,IAAI,CAC5C,CACF,MACEU,EAAAA,IAAI,KACF,yBACAV,EAAK,EACL,MACAA,EAAK,EACL,YACAiB,EACA,cACAL,CACd,CAEQ,OAASd,EAAG,CACVY,EAAAA,IAAI,MAAMZ,CAAC,CACb,CACF,CAAC,CACH,CACAY,MAAI,MAAM,gBAAiBb,CAAI,EAC/BkB,EAAM,WAAWlB,CAAI,CACvB,CAAC,CACH,EAAG,MAAM,EACL8B,EAAqCtB,EAAAA,OAAO,CAACE,EAAIQ,IAAU,CAC7D,MAAMa,EAAWb,EAAM,SAASR,CAAE,EAClC,IAAIsB,EAAM,CAAC,GAAGD,CAAQ,EACtB,UAAWE,KAASF,EAClBzB,EAAQ,IAAI2B,EAAOvB,CAAE,EACrBsB,EAAM,CAAC,GAAGA,EAAK,GAAGF,EAAmBG,EAAOf,CAAK,CAAC,EAEpD,OAAOc,CACT,EAAG,oBAAoB,EACnBE,EAAkC1B,EAAAA,OAAO,CAACU,EAAOiB,EAAKC,IAAQ,CAChE,MAAMC,EAASnB,EAAM,MAAK,EAAG,OAAQf,GAASA,EAAK,IAAMgC,GAAOhC,EAAK,IAAMgC,CAAG,EACxEG,EAASpB,EAAM,MAAK,EAAG,OAAQf,GAASA,EAAK,IAAMiC,GAAOjC,EAAK,IAAMiC,CAAG,EACxEG,EAAaF,EAAO,IAAKlC,IACtB,CAAE,EAAGA,EAAK,IAAMgC,EAAMC,EAAMjC,EAAK,EAAG,EAAGA,EAAK,IAAMgC,EAAMA,EAAMhC,EAAK,CAAC,EAC5E,EACKqC,EAAaF,EAAO,IAAKnC,IACtB,CAAE,EAAGA,EAAK,EAAG,EAAGA,EAAK,CAAC,EAC9B,EAID,OAHeoC,EAAW,OAAQE,GACzBD,EAAW,KAAMrC,GAASsC,EAAQ,IAAMtC,EAAK,GAAKsC,EAAQ,IAAMtC,EAAK,CAAC,CAC9E,CAEH,EAAG,iBAAiB,EAChBuC,EAAsClC,EAAAA,OAAO,CAACE,EAAIQ,EAAOH,IAAc,CACzE,MAAMgB,EAAWb,EAAM,SAASR,CAAE,EAElC,GADAG,EAAAA,IAAI,MAAM,4BAA6BH,EAAIqB,CAAQ,EAC/CA,EAAS,OAAS,EACpB,OAAOrB,EAET,IAAIiC,EACJ,UAAWV,KAASF,EAAU,CAC5B,MAAMa,EAAMF,EAAoBT,EAAOf,EAAOH,CAAS,EACjD8B,EAAcX,EAAgBhB,EAAOH,EAAW6B,CAAG,EACzD,GAAIA,EACF,GAAIC,EAAY,OAAS,EACvBF,EAAUC,MAEV,QAAOA,CAGb,CACA,OAAOD,CACT,EAAG,qBAAqB,EACpBG,EAA8BtC,EAAAA,OAAQE,GACpC,CAACN,EAAU,IAAIM,CAAE,GAGjB,CAACN,EAAU,IAAIM,CAAE,EAAE,oBACdA,EAELN,EAAU,IAAIM,CAAE,EACXN,EAAU,IAAIM,CAAE,EAAE,GAEpBA,EACN,aAAa,EACZqC,EAAyCvC,EAAAA,OAAO,CAACU,EAAO8B,IAAU,CACpE,GAAI,CAAC9B,GAAS8B,EAAQ,GAAI,CACxBnC,EAAAA,IAAI,MAAM,uBAAuB,EACjC,MACF,MACEA,EAAAA,IAAI,MAAM,mBAAmB,EAE/BK,EAAM,MAAK,EAAG,QAAQ,SAASR,EAAI,CAChBQ,EAAM,SAASR,CAAE,EACrB,OAAS,IACpBG,EAAAA,IAAI,KACF,qBACAH,EACA,6BACAgC,EAAoBhC,EAAIQ,EAAOR,CAAE,CACzC,EACML,EAAY,IAAIK,EAAIoB,EAAmBpB,EAAIQ,CAAK,CAAC,EACjDd,EAAU,IAAIM,EAAI,CAAE,GAAIgC,EAAoBhC,EAAIQ,EAAOR,CAAE,EAAG,YAAaQ,EAAM,KAAKR,CAAE,CAAC,CAAE,EAE7F,CAAC,EACDQ,EAAM,MAAK,EAAG,QAAQ,SAASR,EAAI,CACjC,MAAMqB,EAAWb,EAAM,SAASR,CAAE,EAC5Ba,EAAQL,EAAM,MAAK,EACrBa,EAAS,OAAS,GACpBlB,EAAAA,IAAI,MAAM,qBAAsBH,EAAIL,CAAW,EAC/CkB,EAAM,QAASpB,GAAS,CACtB,MAAM8C,EAAKxC,EAAaN,EAAK,EAAGO,CAAE,EAC5BwC,EAAKzC,EAAaN,EAAK,EAAGO,CAAE,EAC9BuC,EAAKC,IACPrC,EAAAA,IAAI,KAAK,SAAUV,EAAM,mBAAoBO,CAAE,EAC/CG,MAAI,KAAK,sBAAuBH,EAAI,KAAML,EAAY,IAAIK,CAAE,CAAC,EAC7DN,EAAU,IAAIM,CAAE,EAAE,oBAAsB,GAE5C,CAAC,GAEDG,EAAAA,IAAI,MAAM,iBAAkBH,EAAIL,CAAW,CAE/C,CAAC,EACD,QAASK,KAAMN,EAAU,OAAQ,CAC/B,MAAM+C,EAAkB/C,EAAU,IAAIM,CAAE,EAAE,GACpCX,EAASmB,EAAM,OAAOiC,CAAe,EACvCpD,IAAWW,GAAMN,EAAU,IAAIL,CAAM,GAAK,CAACK,EAAU,IAAIL,CAAM,EAAE,sBACnEK,EAAU,IAAIM,CAAE,EAAE,GAAKX,GAEzB,MAAMqD,EAAwBlC,EAAM,QAAQ,KAAMf,GAASA,EAAK,IAAMO,CAAE,EACxE,GAAIyC,GAAmB/C,EAAU,IAAIM,CAAE,GAAG,qBAAuB0C,GAAyBC,EAA2BnC,EAAOiC,EAAiBzC,CAAE,EAAG,CAChJ,MAAM4C,EAAaC,EAAmBrC,EAAOR,EAAIQ,EAAM,OAAOiC,CAAe,CAAC,EAC1EG,IACFlD,EAAU,IAAIM,CAAE,EAAE,GAAK4C,EAE3B,CACF,CACApC,EAAM,MAAK,EAAG,QAAQ,SAASjB,EAAG,CAChC,MAAME,EAAOe,EAAM,KAAKjB,CAAC,EACzBY,EAAAA,IAAI,KAAK,QAAUZ,EAAE,EAAI,OAASA,EAAE,EAAI,KAAO,KAAK,UAAUA,CAAC,CAAC,EAChEY,EAAAA,IAAI,KAAK,QAAUZ,EAAE,EAAI,OAASA,EAAE,EAAI,KAAO,KAAK,UAAUiB,EAAM,KAAKjB,CAAC,CAAC,CAAC,EAC5E,IAAIJ,EAAII,EAAE,EACNuD,EAAIvD,EAAE,EAYV,GAXAY,EAAAA,IAAI,KACF,UACAT,EACA,OACAH,EAAE,EACFA,EAAE,EACF,gBACAG,EAAU,IAAIH,EAAE,CAAC,EACjB,QACAG,EAAU,IAAIH,EAAE,CAAC,CACvB,EACQG,EAAU,IAAIH,EAAE,CAAC,GAAKG,EAAU,IAAIH,EAAE,CAAC,EAAG,CAK5C,GAJAY,MAAI,KAAK,mCAAoCZ,EAAE,EAAGA,EAAE,EAAGA,EAAE,IAAI,EAC7DJ,EAAIiD,EAAY7C,EAAE,CAAC,EACnBuD,EAAIV,EAAY7C,EAAE,CAAC,EACnBiB,EAAM,WAAWjB,EAAE,EAAGA,EAAE,EAAGA,EAAE,IAAI,EAC7BJ,IAAMI,EAAE,EAAG,CACb,MAAMF,EAASmB,EAAM,OAAOrB,CAAC,EAC7BO,EAAU,IAAIL,CAAM,EAAE,oBAAsB,GAC5CI,EAAK,YAAcF,EAAE,CACvB,CACA,GAAIuD,IAAMvD,EAAE,EAAG,CACb,MAAMF,EAASmB,EAAM,OAAOsC,CAAC,EAC7BpD,EAAU,IAAIL,CAAM,EAAE,oBAAsB,GAC5CI,EAAK,UAAYF,EAAE,CACrB,CACAY,EAAAA,IAAI,KAAK,yBAA0BhB,EAAG2D,EAAGvD,EAAE,IAAI,EAC/CiB,EAAM,QAAQrB,EAAG2D,EAAGrD,EAAMF,EAAE,IAAI,CAClC,CACF,CAAC,EACDY,EAAAA,IAAI,KAAK,iBAAkB4C,EAAmBvC,CAAK,CAAC,EACpDwC,EAAUxC,EAAO,CAAC,EAClBL,EAAAA,IAAI,MAAMT,CAAS,CACrB,EAAG,wBAAwB,EACvBsD,EAA4BlD,EAAAA,OAAO,CAACU,EAAO8B,IAAU,CAEvD,GADAnC,MAAI,KAAK,eAAgBmC,EAAOS,EAAmBvC,CAAK,EAAGA,EAAM,SAAS,GAAG,CAAC,EAC1E8B,EAAQ,GAAI,CACdnC,EAAAA,IAAI,MAAM,aAAa,EACvB,MACF,CACA,IAAIQ,EAAQH,EAAM,MAAK,EACnByC,EAAc,GAClB,UAAW3D,KAAQqB,EAAO,CACxB,MAAMU,EAAWb,EAAM,SAASlB,CAAI,EACpC2D,EAAcA,GAAe5B,EAAS,OAAS,CACjD,CACA,GAAI,CAAC4B,EAAa,CAChB9C,EAAAA,IAAI,MAAM,6BAA8BK,EAAM,MAAK,CAAE,EACrD,MACF,CACAL,EAAAA,IAAI,MAAM,WAAYQ,EAAO2B,CAAK,EAClC,UAAWhD,KAAQqB,EAYjB,GAXAR,EAAAA,IAAI,MACF,kBACAb,EACAI,EACAA,EAAU,IAAIJ,CAAI,GAAK,CAACI,EAAU,IAAIJ,CAAI,EAAE,oBAC5C,CAACkB,EAAM,OAAOlB,CAAI,EAClBkB,EAAM,KAAKlB,CAAI,EACfkB,EAAM,SAAS,GAAG,EAClB,UACA8B,CACN,EACQ,CAAC5C,EAAU,IAAIJ,CAAI,EACrBa,EAAAA,IAAI,MAAM,gBAAiBb,EAAMgD,CAAK,UAC7B5C,EAAU,IAAIJ,CAAI,GAAG,aAAa,aAAekB,EAAM,SAASlB,CAAI,GAAKkB,EAAM,SAASlB,CAAI,EAAE,OAAS,EAAG,CACnHa,EAAAA,IAAI,KAAK,4DAA6Db,EAAMgD,CAAK,EACjF,MAAMY,EAAMxD,EAAU,IAAIJ,CAAI,EAAE,YAAY,IACtC6D,EAAe,IAAIC,QAAe,CACtC,WAAY,GACZ,SAAU,EAClB,CAAO,EAAE,SAAS,CACV,QAASF,EACT,QAAS,GACT,QAAS,GACT,QAAS,EACT,QAAS,CACjB,CAAO,EAAE,oBAAoB,UAAW,CAChC,MAAO,CAAA,CACT,CAAC,EACD3C,EAAKjB,EAAMkB,EAAO2C,EAAc7D,CAAI,EACpC,MAAM+D,EAAkB7C,EAAM,KAAKlB,CAAI,GAAK,CAAA,EAC5CkB,EAAM,QAAQlB,EAAM,CAClB,GAAG+D,EACH,YAAa,GACb,GAAI/D,EACJ,YAAaI,EAAU,IAAIJ,CAAI,EAAE,YACjC,MAAOI,EAAU,IAAIJ,CAAI,EAAE,MAC3B,MAAO6D,CACf,CAAO,EACDhD,EAAAA,IAAI,KACF,kDACAb,EACAyD,EAAmBI,CAAY,CACvC,CACI,SAAW,CAACzD,EAAU,IAAIJ,CAAI,EAAE,qBAAuBkB,EAAM,SAASlB,CAAI,GAAKkB,EAAM,SAASlB,CAAI,EAAE,OAAS,EAAG,CAC9Ga,EAAAA,IAAI,KACF,2EACAb,EACAgD,CACR,EAEM,IAAIY,EADkB1C,EAAM,MAAK,EACT,UAAY,KAAO,KAAO,KAC9Cd,EAAU,IAAIJ,CAAI,GAAG,aAAa,MACpC4D,EAAMxD,EAAU,IAAIJ,CAAI,EAAE,YAAY,IACtCa,MAAI,KAAK,aAAcT,EAAU,IAAIJ,CAAI,EAAE,YAAY,IAAK4D,CAAG,GAEjE,MAAMC,EAAe,IAAIC,QAAe,CACtC,WAAY,GACZ,SAAU,EAClB,CAAO,EAAE,SAAS,CACV,QAASF,EACT,QAAS,GACT,QAAS,GACT,QAAS,EACT,QAAS,CACjB,CAAO,EAAE,oBAAoB,UAAW,CAChC,MAAO,CAAA,CACT,CAAC,EACD3C,EAAKjB,EAAMkB,EAAO2C,EAAc7D,CAAI,EACpC,MAAM+D,EAAkB7C,EAAM,KAAKlB,CAAI,GAAK,CAAA,EAC5CkB,EAAM,QAAQlB,EAAM,CAClB,GAAG+D,EACH,YAAa,GACb,GAAI/D,EACJ,YAAaI,EAAU,IAAIJ,CAAI,EAAE,YACjC,MAAOI,EAAU,IAAIJ,CAAI,EAAE,MAC3B,MAAO6D,CACf,CAAO,EACDhD,EAAAA,IAAI,MAAM,uBAAwB4C,EAAmBvC,CAAK,CAAC,CAC7D,MACEL,EAAAA,IAAI,KACF,cACAb,EACA,oDACA,CAACI,EAAU,IAAIJ,CAAI,EAAE,oBACrB,eACA,CAACkB,EAAM,OAAOlB,CAAI,EAClB,aACAkB,EAAM,SAASlB,CAAI,GAAKkB,EAAM,SAASlB,CAAI,EAAE,OAAS,EACtDkB,EAAM,SAAS,GAAG,EAClB8B,CACR,EACMnC,EAAAA,IAAI,MAAMT,CAAS,EAGvBiB,EAAQH,EAAM,MAAK,EACnBL,MAAI,KAAK,oBAAqBQ,CAAK,EACnC,UAAWrB,KAAQqB,EAAO,CACxB,MAAMC,EAAOJ,EAAM,KAAKlB,CAAI,EAC5Ba,EAAAA,IAAI,KAAK,kBAAmBb,EAAMsB,CAAI,EAClCA,GAAM,aACRoC,EAAUpC,EAAK,MAAO0B,EAAQ,CAAC,CAEnC,CACF,EAAG,WAAW,EACVgB,EAAyBxD,EAAAA,OAAO,CAACU,EAAOG,IAAU,CACpD,GAAIA,EAAM,SAAW,EACnB,MAAO,CAAA,EAET,IAAI4C,EAAS,OAAO,OAAO,CAAA,EAAI5C,CAAK,EACpC,OAAAA,EAAM,QAASrB,GAAS,CACtB,MAAM+B,EAAWb,EAAM,SAASlB,CAAI,EAC9BkE,EAASF,EAAO9C,EAAOa,CAAQ,EACrCkC,EAAS,CAAC,GAAGA,EAAQ,GAAGC,CAAM,CAChC,CAAC,EACMD,CACT,EAAG,QAAQ,EACPE,EAAuC3D,EAAAA,OAAQU,GAAU8C,EAAO9C,EAAOA,EAAM,SAAQ,CAAE,EAAG,sBAAsB,EAChHmC,EAA6C7C,EAAAA,OAAO,CAACU,EAAOlB,EAAMoB,IAAW,CAC/E,IAAIrB,EAASmB,EAAM,OAAOlB,CAAI,EAC9B,KAAOD,GAAUA,IAAWqB,GAAQ,CAClC,MAAMgD,EAAUhE,EAAU,IAAIL,CAAM,EACpC,GAAIqE,GAAW,CAACA,EAAQ,oBACtB,MAAO,GAETrE,EAASmB,EAAM,OAAOnB,CAAM,CAC9B,CACA,MAAO,EACT,EAAG,4BAA4B,EAC3BwD,EAAqC/C,EAAAA,OAAO,CAACU,EAAOH,EAAWsD,IAAoB,CACrF,MAAMtC,EAAWb,EAAM,SAASH,CAAS,GAAK,CAAA,EAC9C,UAAWkB,KAASF,EAAU,CAC5B,GAAIE,IAAUoC,GAAmB5D,EAAawB,EAAOoC,CAAe,EAClE,SAEF,MAAMC,EAAY5B,EAAoBT,EAAOf,EAAOH,CAAS,EAC7D,GAAKuD,GAGD,CAACjB,EAA2BnC,EAAOoD,EAAWvD,CAAS,EACzD,OAAOuD,CAEX,CACA,OAAO,IACT,EAAG,oBAAoB","x_google_ignoreList":[0,1,2]}

package/dist/{chunk-V7JOEXUC-DWnZRQBl.js → chunk-V7JOEXUC-BpOeSTIu.js}

@@ -1,8 +1,8 @@
-import { g as st } from "./chunk-5VM5RSS4-BhTMtA9l.js";
-import { g as it } from "./chunk-XXDRQBXY-qt9x9red.js";
-import { s as at } from "./chunk-VR4S4FIN-BWCLM0a0.js";
-import { _ as f, a1 as we, $ as F, ac as nt, ad as rt, ae as Ve, a0 as Ae, X as ut, W as lt, U as ct, V as ot, af as ht, ag as dt, a8 as I, al as pt, ak as At, a5 as ft, aC as U } from "./extractHeadings-BH0T7P4n.js";
-import { c as gt } from "./chunk-32BRIVSS-CXH5EQUk.js";
+import { g as st } from "./chunk-5VM5RSS4-BzNAhFN7.js";
+import { g as it } from "./chunk-XXDRQBXY-Bcfw5A34.js";
+import { s as at } from "./chunk-VR4S4FIN-Dshtsgib.js";
+import { _ as f, a1 as we, $ as F, ac as nt, ad as rt, ae as Ve, a0 as Ae, X as ut, W as lt, U as ct, V as ot, af as ht, ag as dt, a8 as I, al as pt, ak as At, a5 as ft, aC as U } from "./extractHeadings-Bfq3sy4n.js";
+import { c as gt } from "./chunk-32BRIVSS-RrFz8EL9.js";
 import mt from "dompurify";
 var Pe = (function() {
   var s = /* @__PURE__ */ f(function(O, o, h, p) {
@@ -1532,4 +1532,4 @@ export {
   xt as c,
   Lt as s
 };
-//# sourceMappingURL=chunk-V7JOEXUC-DWnZRQBl.js.map
+//# sourceMappingURL=chunk-V7JOEXUC-BpOeSTIu.js.map