{
  "version": 3,
  "sources": ["../../../../../node_modules/.pnpm/dagre-d3-es@7.0.10/node_modules/dagre-d3-es/src/graphlib/json.js", "../../../src/dagre-wrapper/mermaid-graphlib.js", "../../../src/dagre-wrapper/clusters.js", "../../../src/dagre-wrapper/index.js"],
  "sourcesContent": ["import * as _ from 'lodash-es';\nimport { Graph } from './graph.js';\n\nexport { write, read };\n\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound(),\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g),\n  };\n  if (!_.isUndefined(g.graph())) {\n    json.value = _.clone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function (v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (!_.isUndefined(nodeValue)) {\n      node.value = nodeValue;\n    }\n    if (!_.isUndefined(parent)) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return _.map(g.edges(), function (e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (!_.isUndefined(e.name)) {\n      edge.name = e.name;\n    }\n    if (!_.isUndefined(edgeValue)) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  _.each(json.nodes, function (entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  _.each(json.edges, function (entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n", "/** Decorates with functions required by mermaids dagre-wrapper. */\nimport { log } from '../logger.js';\nimport * as graphlibJson from 'dagre-d3-es/src/graphlib/json.js';\nimport * as graphlib from 'dagre-d3-es/src/graphlib/index.js';\n\nexport let clusterDb = {};\nlet descendants = {};\nlet parents = {};\n\nexport const clear = () => {\n  descendants = {};\n  parents = {};\n  clusterDb = {};\n};\n\nconst isDescendant = (id, ancestorId) => {\n  // if (id === ancestorId) return true;\n\n  log.trace('In isDescendant', ancestorId, ' ', id, ' = ', descendants[ancestorId].includes(id));\n  if (descendants[ancestorId].includes(id)) {\n    return true;\n  }\n\n  return false;\n};\n\nconst edgeInCluster = (edge, clusterId) => {\n  log.info('Descendants of ', clusterId, ' is ', descendants[clusterId]);\n  log.info('Edge is ', edge);\n  // Edges to/from the cluster is not in the cluster, they are in the parent\n  if (edge.v === clusterId) {\n    return false;\n  }\n  if (edge.w === clusterId) {\n    return false;\n  }\n\n  if (!descendants[clusterId]) {\n    log.debug('Tilt, ', clusterId, ',not in descendants');\n    return false;\n  }\n  return (\n    descendants[clusterId].includes(edge.v) ||\n    isDescendant(edge.v, clusterId) ||\n    isDescendant(edge.w, clusterId) ||\n    descendants[clusterId].includes(edge.w)\n  );\n};\n\nconst copy = (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\n  // Include cluster node if it is not the root\n  if (clusterId !== rootId) {\n    nodes.push(clusterId);\n  }\n\n  log.warn('Copying (nodes) clusterId', clusterId, 'nodes', nodes);\n\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); //,node, data, ' parent is ', 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\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 data = graph.edge(edge.v, edge.w, edge.name);\n        log.info('Edge data', data, rootId);\n        try {\n          // Do not copy edges in and out of the root cluster, they belong to the parent graph\n          if (edgeInCluster(edge, rootId)) {\n            log.info('Copying as ', edge.v, edge.w, data, edge.name);\n            newGraph.setEdge(edge.v, edge.w, data, edge.name);\n            log.info('newGraph edges ', newGraph.edges(), newGraph.edge(newGraph.edges()[0]));\n          } else {\n            log.info(\n              'Skipping copy of edge ',\n              edge.v,\n              '-->',\n              edge.w,\n              ' rootId: ',\n              rootId,\n              ' clusterId:',\n              clusterId\n            );\n          }\n        } catch (e) {\n          log.error(e);\n        }\n      });\n    }\n    log.debug('Removing node', node);\n    graph.removeNode(node);\n  });\n};\nexport const extractDescendants = (id, graph) => {\n  // log.debug('Extracting ', id);\n  const children = graph.children(id);\n  let res = [...children];\n\n  for (const child of children) {\n    parents[child] = id;\n    res = [...res, ...extractDescendants(child, graph)];\n  }\n\n  return res;\n};\n\n/**\n * Validates the graph, checking that all parent child relation points to existing nodes and that\n * edges between nodes also ia correct. When not correct the function logs the discrepancies.\n *\n * @param graph\n */\nexport const validate = (graph) => {\n  const edges = graph.edges();\n  log.trace('Edges: ', edges);\n  for (const edge of edges) {\n    if (graph.children(edge.v).length > 0) {\n      log.trace('The node ', edge.v, ' is part of and edge even though it has children');\n      return false;\n    }\n    if (graph.children(edge.w).length > 0) {\n      log.trace('The node ', edge.w, ' is part of and edge even though it has children');\n      return false;\n    }\n  }\n  return true;\n};\n\n/**\n * Finds a child that is not a cluster. When faking an edge between a node and a cluster.\n *\n * @param id\n * @param {any} graph\n */\nexport const findNonClusterChild = (id, graph) => {\n  // const node = graph.node(id);\n  log.trace('Searching', id);\n  // const children = graph.children(id).reverse();\n  const children = graph.children(id); //.reverse();\n  log.trace('Searching children of id ', id, children);\n  if (children.length < 1) {\n    log.trace('This is a valid node', id);\n    return id;\n  }\n  for (const child of children) {\n    const _id = findNonClusterChild(child, graph);\n    if (_id) {\n      log.trace('Found replacement for', id, ' => ', _id);\n      return _id;\n    }\n  }\n};\n\nconst getAnchorId = (id) => {\n  if (!clusterDb[id]) {\n    return id;\n  }\n  // If the cluster has no external connections\n  if (!clusterDb[id].externalConnections) {\n    return id;\n  }\n\n  // Return the replacement node\n  if (clusterDb[id]) {\n    return clusterDb[id].id;\n  }\n  return id;\n};\n\nexport const adjustClustersAndEdges = (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  // Go through the nodes and for each cluster found, save a replacement node, this can be used when\n  // faking a link to a cluster\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)\n      );\n      descendants[id] = extractDescendants(id, graph);\n      clusterDb[id] = { id: findNonClusterChild(id, graph), clusterData: graph.node(id) };\n    }\n  });\n\n  // Check incoming and outgoing edges for each cluster\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        // log.debug('Edge, descendants: ', edge, descendants[id]);\n\n        // Check if any edge leaves the cluster (not the actual cluster, that's a link from the box)\n        if (edge.v !== id && edge.w !== id) {\n          // Any edge where either the one of the nodes is descending to the cluster but not the other\n          // if (descendants[id].indexOf(edge.v) < 0 && descendants[id].indexOf(edge.w) < 0) {\n\n          const d1 = isDescendant(edge.v, id);\n          const d2 = isDescendant(edge.w, id);\n\n          // d1 xor d2 - if either d1 is true and d2 is false or the other way around\n          if (d1 ^ d2) {\n            log.warn('Edge: ', edge, ' leaves cluster ', id);\n            log.warn('Descendants of XXX ', id, ': ', descendants[id]);\n            clusterDb[id].externalConnections = true;\n          }\n        }\n      });\n    } else {\n      log.debug('Not a cluster ', id, descendants);\n    }\n  });\n\n  for (let id of Object.keys(clusterDb)) {\n    const nonClusterChild = clusterDb[id].id;\n    const parent = graph.parent(nonClusterChild);\n\n    // Change replacement node of id to parent of current replacement node if valid\n    if (parent !== id && clusterDb[parent] && !clusterDb[parent].externalConnections) {\n      clusterDb[id].id = parent;\n    }\n  }\n\n  // For clusters with incoming and/or outgoing edges translate those edges to a real node\n  // in the cluster in order to fake the edge\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\n    let v = e.v;\n    let w = e.w;\n    // Check if link is either from or to a cluster\n    log.warn(\n      'Fix XXX',\n      clusterDb,\n      'ids:',\n      e.v,\n      e.w,\n      'Translating: ',\n      clusterDb[e.v],\n      ' --- ',\n      clusterDb[e.w]\n    );\n    if (clusterDb[e.v] && clusterDb[e.w] && clusterDb[e.v] === clusterDb[e.w]) {\n      // cspell:ignore trixing\n      log.warn('Fixing and trixing link to self - removing XXX', e.v, e.w, e.name);\n      log.warn('Fixing and trixing - 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      const specialId = e.w + '---' + e.v;\n      graph.setNode(specialId, {\n        domId: specialId,\n        id: specialId,\n        labelStyle: '',\n        labelText: edge.label,\n        padding: 0,\n        shape: 'labelRect',\n        style: '',\n      });\n      const edge1 = structuredClone(edge);\n      const edge2 = structuredClone(edge);\n      edge1.label = '';\n      edge1.arrowTypeEnd = 'none';\n      edge2.label = '';\n      edge1.fromCluster = e.v;\n      edge2.toCluster = e.v;\n\n      graph.setEdge(v, specialId, edge1, e.name + '-cyclic-special');\n      graph.setEdge(specialId, w, edge2, e.name + '-cyclic-special');\n    } else if (clusterDb[e.v] || clusterDb[e.w]) {\n      log.warn('Fixing and trixing - 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[parent].externalConnections = true;\n        edge.fromCluster = e.v;\n      }\n      if (w !== e.w) {\n        const parent = graph.parent(w);\n        clusterDb[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\n  log.trace(clusterDb);\n\n  // Remove references to extracted cluster\n  // graph.edges().forEach(edge => {\n  //   if (isDescendant(edge.v, clusterId) || isDescendant(edge.w, clusterId)) {\n  //     graph.removeEdge(edge);\n  //   }\n  // });\n};\n\nexport const extractor = (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  // For clusters without incoming and/or outgoing edges, create a new cluster-node\n  // containing the nodes and edges in the custer in a new graph\n  // for (let i = 0;)\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\n  if (!hasChildren) {\n    log.debug('Done, no node has children', graph.nodes());\n    return;\n  }\n  // const clusters = Object.keys(clusterDb);\n  // clusters.forEach(clusterId => {\n  log.debug('Nodes = ', nodes, depth);\n  for (const node of nodes) {\n    log.debug(\n      'Extracting node',\n      node,\n      clusterDb,\n      clusterDb[node] && !clusterDb[node].externalConnections,\n      !graph.parent(node),\n      graph.node(node),\n      graph.children('D'),\n      ' Depth ',\n      depth\n    );\n    // Note that the node might have been removed after the Object.keys call so better check\n    // that it still is in the game\n    if (!clusterDb[node]) {\n      // Skip if the node is not a cluster\n      log.debug('Not a cluster', node, depth);\n      // break;\n    } else if (\n      !clusterDb[node].externalConnections &&\n      // !graph.parent(node) &&\n      graph.children(node) &&\n      graph.children(node).length > 0\n    ) {\n      log.warn(\n        'Cluster without external connections, without a parent and with children',\n        node,\n        depth\n      );\n\n      const graphSettings = graph.graph();\n      let dir = graphSettings.rankdir === 'TB' ? 'LR' : 'TB';\n      if (clusterDb[node] && clusterDb[node].clusterData && clusterDb[node].clusterData.dir) {\n        dir = clusterDb[node].clusterData.dir;\n        log.warn('Fixing dir', clusterDb[node].clusterData.dir, dir);\n      }\n\n      const clusterGraph = new graphlib.Graph({\n        multigraph: true,\n        compound: true,\n      })\n        .setGraph({\n          rankdir: dir, // Todo: set proper spacing\n          nodesep: 50,\n          ranksep: 50,\n          marginx: 8,\n          marginy: 8,\n        })\n        .setDefaultEdgeLabel(function () {\n          return {};\n        });\n\n      log.warn('Old graph before copy', graphlibJson.write(graph));\n      copy(node, graph, clusterGraph, node);\n      graph.setNode(node, {\n        clusterNode: true,\n        id: node,\n        clusterData: clusterDb[node].clusterData,\n        labelText: clusterDb[node].labelText,\n        graph: clusterGraph,\n      });\n      log.warn('New graph after copy node: (', node, ')', graphlibJson.write(clusterGraph));\n      log.debug('Old graph after copy', graphlibJson.write(graph));\n    } else {\n      log.warn(\n        'Cluster ** ',\n        node,\n        ' **not meeting the criteria !externalConnections:',\n        !clusterDb[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\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};\n\nconst sorter = (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\n  return result;\n};\n\nexport const sortNodesByHierarchy = (graph) => sorter(graph, graph.children());\n", "import intersectRect from './intersect/intersect-rect.js';\nimport { log } from '../logger.js';\nimport createLabel from './createLabel.js';\nimport { createText } from '../rendering-util/createText.js';\nimport { select } from 'd3';\nimport { getConfig } from '../diagram-api/diagramAPI.js';\nimport { evaluate } from '../diagrams/common/common.js';\nimport { getSubGraphTitleMargins } from '../utils/subGraphTitleMargins.js';\n\nconst rect = (parent, node) => {\n  log.info('Creating subgraph rect for ', node.id, node);\n  const siteConfig = getConfig();\n\n  // Add outer g element\n  const shapeSvg = parent\n    .insert('g')\n    .attr('class', 'cluster' + (node.class ? ' ' + node.class : ''))\n    .attr('id', node.id);\n\n  // add the rect\n  const rect = shapeSvg.insert('rect', ':first-child');\n\n  const useHtmlLabels = evaluate(siteConfig.flowchart.htmlLabels);\n\n  // Create the label and insert it after the rect\n  const label = shapeSvg.insert('g').attr('class', 'cluster-label');\n\n  // const text = label\n  //   .node()\n  //   .appendChild(createLabel(node.labelText, node.labelStyle, undefined, true));\n  const text =\n    node.labelType === 'markdown'\n      ? createText(label, node.labelText, { style: node.labelStyle, useHtmlLabels }, siteConfig)\n      : label.node().appendChild(createLabel(node.labelText, node.labelStyle, undefined, true));\n\n  // Get the size of the label\n  let bbox = text.getBBox();\n\n  if (evaluate(siteConfig.flowchart.htmlLabels)) {\n    const div = text.children[0];\n    const dv = select(text);\n    bbox = div.getBoundingClientRect();\n    dv.attr('width', bbox.width);\n    dv.attr('height', bbox.height);\n  }\n\n  const padding = 0 * node.padding;\n  const halfPadding = padding / 2;\n\n  const width = node.width <= bbox.width + padding ? bbox.width + padding : node.width;\n  if (node.width <= bbox.width + padding) {\n    node.diff = (bbox.width - node.width) / 2 - node.padding / 2;\n  } else {\n    node.diff = -node.padding / 2;\n  }\n\n  log.trace('Data ', node, JSON.stringify(node));\n  // center the rect around its coordinate\n  rect\n    .attr('style', node.style)\n    .attr('rx', node.rx)\n    .attr('ry', node.ry)\n    .attr('x', node.x - width / 2)\n    .attr('y', node.y - node.height / 2 - halfPadding)\n    .attr('width', width)\n    .attr('height', node.height + padding);\n\n  const { subGraphTitleTopMargin } = getSubGraphTitleMargins(siteConfig);\n  if (useHtmlLabels) {\n    label.attr(\n      'transform',\n      // This puts the label on top of the box instead of inside it\n      `translate(${node.x - bbox.width / 2}, ${node.y - node.height / 2 + subGraphTitleTopMargin})`\n    );\n  } else {\n    label.attr(\n      'transform',\n      // This puts the label on top of the box instead of inside it\n      `translate(${node.x}, ${node.y - node.height / 2 + subGraphTitleTopMargin})`\n    );\n  }\n  // Center the label\n\n  const rectBox = rect.node().getBBox();\n  node.width = rectBox.width;\n  node.height = rectBox.height;\n\n  node.intersect = function (point) {\n    return intersectRect(node, point);\n  };\n\n  return shapeSvg;\n};\n\n/**\n * Non visible cluster where the note is group with its\n *\n * @param {any} parent\n * @param {any} node\n * @returns {any} ShapeSvg\n */\nconst noteGroup = (parent, node) => {\n  // Add outer g element\n  const shapeSvg = parent.insert('g').attr('class', 'note-cluster').attr('id', node.id);\n\n  // add the rect\n  const rect = shapeSvg.insert('rect', ':first-child');\n\n  const padding = 0 * node.padding;\n  const halfPadding = padding / 2;\n\n  // center the rect around its coordinate\n  rect\n    .attr('rx', node.rx)\n    .attr('ry', node.ry)\n    .attr('x', node.x - node.width / 2 - halfPadding)\n    .attr('y', node.y - node.height / 2 - halfPadding)\n    .attr('width', node.width + padding)\n    .attr('height', node.height + padding)\n    .attr('fill', 'none');\n\n  const rectBox = rect.node().getBBox();\n  node.width = rectBox.width;\n  node.height = rectBox.height;\n\n  node.intersect = function (point) {\n    return intersectRect(node, point);\n  };\n\n  return shapeSvg;\n};\nconst roundedWithTitle = (parent, node) => {\n  const siteConfig = getConfig();\n\n  // Add outer g element\n  const shapeSvg = parent.insert('g').attr('class', node.classes).attr('id', node.id);\n\n  // add the rect\n  const rect = shapeSvg.insert('rect', ':first-child');\n\n  // Create the label and insert it after the rect\n  const label = shapeSvg.insert('g').attr('class', 'cluster-label');\n  const innerRect = shapeSvg.append('rect');\n\n  const text = label\n    .node()\n    .appendChild(createLabel(node.labelText, node.labelStyle, undefined, true));\n\n  // Get the size of the label\n  let bbox = text.getBBox();\n  if (evaluate(siteConfig.flowchart.htmlLabels)) {\n    const div = text.children[0];\n    const dv = select(text);\n    bbox = div.getBoundingClientRect();\n    dv.attr('width', bbox.width);\n    dv.attr('height', bbox.height);\n  }\n  bbox = text.getBBox();\n  const padding = 0 * node.padding;\n  const halfPadding = padding / 2;\n\n  const width = node.width <= bbox.width + node.padding ? bbox.width + node.padding : node.width;\n  if (node.width <= bbox.width + node.padding) {\n    node.diff = (bbox.width + node.padding * 0 - node.width) / 2;\n  } else {\n    node.diff = -node.padding / 2;\n  }\n\n  // center the rect around its coordinate\n  rect\n    .attr('class', 'outer')\n    .attr('x', node.x - width / 2 - halfPadding)\n    .attr('y', node.y - node.height / 2 - halfPadding)\n    .attr('width', width + padding)\n    .attr('height', node.height + padding);\n  innerRect\n    .attr('class', 'inner')\n    .attr('x', node.x - width / 2 - halfPadding)\n    .attr('y', node.y - node.height / 2 - halfPadding + bbox.height - 1)\n    .attr('width', width + padding)\n    .attr('height', node.height + padding - bbox.height - 3);\n\n  const { subGraphTitleTopMargin } = getSubGraphTitleMargins(siteConfig);\n  // Center the label\n  label.attr(\n    'transform',\n    `translate(${node.x - bbox.width / 2}, ${\n      node.y -\n      node.height / 2 -\n      node.padding / 3 +\n      (evaluate(siteConfig.flowchart.htmlLabels) ? 5 : 3) +\n      subGraphTitleTopMargin\n    })`\n  );\n\n  const rectBox = rect.node().getBBox();\n  node.height = rectBox.height;\n\n  node.intersect = function (point) {\n    return intersectRect(node, point);\n  };\n\n  return shapeSvg;\n};\n\nconst divider = (parent, node) => {\n  // Add outer g element\n  const shapeSvg = parent.insert('g').attr('class', node.classes).attr('id', node.id);\n\n  // add the rect\n  const rect = shapeSvg.insert('rect', ':first-child');\n\n  const padding = 0 * node.padding;\n  const halfPadding = padding / 2;\n\n  // center the rect around its coordinate\n  rect\n    .attr('class', 'divider')\n    .attr('x', node.x - node.width / 2 - halfPadding)\n    .attr('y', node.y - node.height / 2)\n    .attr('width', node.width + padding)\n    .attr('height', node.height + padding);\n\n  const rectBox = rect.node().getBBox();\n  node.width = rectBox.width;\n  node.height = rectBox.height;\n  node.diff = -node.padding / 2;\n  node.intersect = function (point) {\n    return intersectRect(node, point);\n  };\n\n  return shapeSvg;\n};\n\nconst shapes = { rect, roundedWithTitle, noteGroup, divider };\n\nlet clusterElems = {};\n\nexport const insertCluster = (elem, node) => {\n  log.trace('Inserting cluster');\n  const shape = node.shape || 'rect';\n  clusterElems[node.id] = shapes[shape](elem, node);\n};\nexport const getClusterTitleWidth = (elem, node) => {\n  const label = createLabel(node.labelText, node.labelStyle, undefined, true);\n  elem.node().appendChild(label);\n  const width = label.getBBox().width;\n  elem.node().removeChild(label);\n  return width;\n};\n\nexport const clear = () => {\n  clusterElems = {};\n};\n\nexport const positionCluster = (node) => {\n  log.info('Position cluster (' + node.id + ', ' + node.x + ', ' + node.y + ')');\n  const el = clusterElems[node.id];\n\n  el.attr('transform', 'translate(' + node.x + ', ' + node.y + ')');\n};\n", "import { layout as dagreLayout } from 'dagre-d3-es/src/dagre/index.js';\nimport * as graphlibJson from 'dagre-d3-es/src/graphlib/json.js';\nimport insertMarkers from './markers.js';\nimport { updateNodeBounds } from './shapes/util.js';\nimport {\n  clear as clearGraphlib,\n  clusterDb,\n  adjustClustersAndEdges,\n  findNonClusterChild,\n  sortNodesByHierarchy,\n} from './mermaid-graphlib.js';\nimport { insertNode, positionNode, clear as clearNodes, setNodeElem } from './nodes.js';\nimport { insertCluster, clear as clearClusters } from './clusters.js';\nimport { insertEdgeLabel, positionEdgeLabel, insertEdge, clear as clearEdges } from './edges.js';\nimport { log } from '../logger.js';\nimport { getSubGraphTitleMargins } from '../utils/subGraphTitleMargins.js';\nimport { getConfig } from '../diagram-api/diagramAPI.js';\n\nconst recursiveRender = async (_elem, graph, diagramType, id, parentCluster, siteConfig) => {\n  log.info('Graph in recursive render: XXX', graphlibJson.write(graph), parentCluster);\n  const dir = graph.graph().rankdir;\n  log.trace('Dir in recursive render - dir:', dir);\n\n  const elem = _elem.insert('g').attr('class', 'root');\n  if (!graph.nodes()) {\n    log.info('No nodes found for', graph);\n  } else {\n    log.info('Recursive render XXX', graph.nodes());\n  }\n  if (graph.edges().length > 0) {\n    log.trace('Recursive edges', graph.edge(graph.edges()[0]));\n  }\n  const clusters = elem.insert('g').attr('class', 'clusters');\n  const edgePaths = elem.insert('g').attr('class', 'edgePaths');\n  const edgeLabels = elem.insert('g').attr('class', 'edgeLabels');\n  const nodes = elem.insert('g').attr('class', 'nodes');\n\n  // Insert nodes, this will insert them into the dom and each node will get a size. The size is updated\n  // to the abstract node and is later used by dagre for the layout\n  await Promise.all(\n    graph.nodes().map(async function (v) {\n      const node = graph.node(v);\n      if (parentCluster !== undefined) {\n        const data = JSON.parse(JSON.stringify(parentCluster.clusterData));\n        // data.clusterPositioning = true;\n        log.info('Setting data for cluster XXX (', v, ') ', data, parentCluster);\n        graph.setNode(parentCluster.id, data);\n        if (!graph.parent(v)) {\n          log.trace('Setting parent', v, parentCluster.id);\n          graph.setParent(v, parentCluster.id, data);\n        }\n      }\n      log.info('(Insert) Node XXX' + v + ': ' + JSON.stringify(graph.node(v)));\n      if (node && node.clusterNode) {\n        // const children = graph.children(v);\n        log.info('Cluster identified', v, node.width, graph.node(v));\n        // `node.graph.setGraph` applies the graph configurations such as nodeSpacing to subgraphs as without this the default values would be used\n        // We override only the `ranksep` and `nodesep` configurations to allow for setting subgraph spacing while avoiding overriding other properties\n        const { ranksep, nodesep } = graph.graph();\n        node.graph.setGraph({\n          ...node.graph.graph(),\n          ranksep,\n          nodesep,\n        });\n        const o = await recursiveRender(\n          nodes,\n          node.graph,\n          diagramType,\n          id,\n          graph.node(v),\n          siteConfig\n        );\n        const newEl = o.elem;\n        updateNodeBounds(node, newEl);\n        node.diff = o.diff || 0;\n        log.info('Node bounds (abc123)', v, node, node.width, node.x, node.y);\n        setNodeElem(newEl, node);\n\n        log.warn('Recursive render complete ', newEl, node);\n      } else {\n        if (graph.children(v).length > 0) {\n          // This is a cluster but not to be rendered recursively\n          // Render as before\n          log.info('Cluster - the non recursive path XXX', v, node.id, node, graph);\n          log.info(findNonClusterChild(node.id, graph));\n          clusterDb[node.id] = { id: findNonClusterChild(node.id, graph), node };\n          // insertCluster(clusters, graph.node(v));\n        } else {\n          log.info('Node - the non recursive path', v, node.id, node);\n          await insertNode(nodes, graph.node(v), dir);\n        }\n      }\n    })\n  );\n\n  // Insert labels, this will insert them into the dom so that the width can be calculated\n  // Also figure out which edges point to/from clusters and adjust them accordingly\n  // Edges from/to clusters really points to the first child in the cluster.\n  // TODO: pick optimal child in the cluster to us as link anchor\n  graph.edges().forEach(function (e) {\n    const edge = graph.edge(e.v, e.w, e.name);\n    log.info('Edge ' + e.v + ' -> ' + e.w + ': ' + JSON.stringify(e));\n    log.info('Edge ' + e.v + ' -> ' + e.w + ': ', e, ' ', JSON.stringify(graph.edge(e)));\n\n    // Check if link is either from or to a cluster\n    log.info('Fix', clusterDb, 'ids:', e.v, e.w, 'Translating: ', clusterDb[e.v], clusterDb[e.w]);\n    insertEdgeLabel(edgeLabels, edge);\n  });\n\n  graph.edges().forEach(function (e) {\n    log.info('Edge ' + e.v + ' -> ' + e.w + ': ' + JSON.stringify(e));\n  });\n  log.info('#############################################');\n  log.info('###                Layout                 ###');\n  log.info('#############################################');\n  log.info(graph);\n  dagreLayout(graph);\n  log.info('Graph after layout:', graphlibJson.write(graph));\n  // Move the nodes to the correct place\n  let diff = 0;\n  const { subGraphTitleTotalMargin } = getSubGraphTitleMargins(siteConfig);\n  sortNodesByHierarchy(graph).forEach(function (v) {\n    const node = graph.node(v);\n    log.info('Position ' + v + ': ' + JSON.stringify(graph.node(v)));\n    log.info(\n      'Position ' + v + ': (' + node.x,\n      ',' + node.y,\n      ') width: ',\n      node.width,\n      ' height: ',\n      node.height\n    );\n    if (node && node.clusterNode) {\n      // clusterDb[node.id].node = node;\n      node.y += subGraphTitleTotalMargin;\n      positionNode(node);\n    } else {\n      // Non cluster node\n      if (graph.children(v).length > 0) {\n        // A cluster in the non-recursive way\n        // positionCluster(node);\n        node.height += subGraphTitleTotalMargin;\n        insertCluster(clusters, node);\n        clusterDb[node.id].node = node;\n      } else {\n        node.y += subGraphTitleTotalMargin / 2;\n        positionNode(node);\n      }\n    }\n  });\n\n  // Move the edge labels to the correct place after layout\n  graph.edges().forEach(function (e) {\n    const edge = graph.edge(e);\n    log.info('Edge ' + e.v + ' -> ' + e.w + ': ' + JSON.stringify(edge), edge);\n\n    edge.points.forEach((point) => (point.y += subGraphTitleTotalMargin / 2));\n    const paths = insertEdge(edgePaths, e, edge, clusterDb, diagramType, graph, id);\n    positionEdgeLabel(edge, paths);\n  });\n\n  graph.nodes().forEach(function (v) {\n    const n = graph.node(v);\n    log.info(v, n.type, n.diff);\n    if (n.type === 'group') {\n      diff = n.diff;\n    }\n  });\n  return { elem, diff };\n};\n\nexport const render = async (elem, graph, markers, diagramType, id) => {\n  insertMarkers(elem, markers, diagramType, id);\n  clearNodes();\n  clearEdges();\n  clearClusters();\n  clearGraphlib();\n\n  log.warn('Graph at first:', JSON.stringify(graphlibJson.write(graph)));\n  adjustClustersAndEdges(graph);\n  log.warn('Graph after:', JSON.stringify(graphlibJson.write(graph)));\n  // log.warn('Graph ever  after:', graphlibJson.write(graph.node('A').graph));\n  const siteConfig = getConfig();\n  await recursiveRender(elem, graph, diagramType, id, undefined, siteConfig);\n};\n\n// const shapeDefinitions = {};\n// export const addShape = ({ shapeType: fun }) => {\n//   shapeDefinitions[shapeType] = fun;\n// };\n\n// const arrowDefinitions = {};\n// export const addArrow = ({ arrowType: fun }) => {\n//   arrowDefinitions[arrowType] = fun;\n// };\n"],
  "mappings": "wZAKA,SAASA,EAAMC,EAAG,CAChB,IAAIC,EAAO,CACT,QAAS,CACP,SAAUD,EAAE,WAAW,EACvB,WAAYA,EAAE,aAAa,EAC3B,SAAUA,EAAE,WAAW,CACzB,EACA,MAAOE,GAAWF,CAAC,EACnB,MAAOG,GAAWH,CAAC,CACrB,EACA,OAAOI,EAAYJ,EAAE,MAAM,CAAC,IAC1BC,EAAK,MAAUI,EAAML,EAAE,MAAM,CAAC,GAEzBC,CACT,CAdSK,EAAAP,EAAA,SAgBT,SAASG,GAAWF,EAAG,CACrB,OAASO,EAAIP,EAAE,MAAM,EAAG,SAAUQ,EAAG,CACnC,IAAIC,EAAYT,EAAE,KAAKQ,CAAC,EACpBE,EAASV,EAAE,OAAOQ,CAAC,EACnBG,EAAO,CAAE,EAAGH,CAAE,EAClB,OAAOJ,EAAYK,CAAS,IAC1BE,EAAK,MAAQF,GAERL,EAAYM,CAAM,IACvBC,EAAK,OAASD,GAETC,CACT,CAAC,CACH,CAbSL,EAAAJ,GAAA,cAeT,SAASC,GAAWH,EAAG,CACrB,OAASO,EAAIP,EAAE,MAAM,EAAG,SAAUY,EAAG,CACnC,IAAIC,EAAYb,EAAE,KAAKY,CAAC,EACpBE,EAAO,CAAE,EAAGF,EAAE,EAAG,EAAGA,EAAE,CAAE,EAC5B,OAAOR,EAAYQ,EAAE,IAAI,IACvBE,EAAK,KAAOF,EAAE,MAETR,EAAYS,CAAS,IAC1BC,EAAK,MAAQD,GAERC,CACT,CAAC,CACH,CAZSR,EAAAH,GAAA,cC/BF,IAAIY,EAAY,CAAC,EACpBC,EAAc,CAAC,EACfC,EAAU,CAAC,EAEFC,EAAQC,EAAA,IAAM,CACzBH,EAAc,CAAC,EACfC,EAAU,CAAC,EACXF,EAAY,CAAC,CACf,EAJqB,SAMfK,EAAeD,EAAA,CAACE,EAAIC,KAGxBC,EAAI,MAAM,kBAAmBD,EAAY,IAAKD,EAAI,MAAOL,EAAYM,CAAU,EAAE,SAASD,CAAE,CAAC,EACzF,EAAAL,EAAYM,CAAU,EAAE,SAASD,CAAE,GAJpB,gBAWfG,GAAgBL,EAAA,CAACM,EAAMC,KAC3BH,EAAI,KAAK,kBAAmBG,EAAW,OAAQV,EAAYU,CAAS,CAAC,EACrEH,EAAI,KAAK,WAAYE,CAAI,EAErBA,EAAK,IAAMC,GAGXD,EAAK,IAAMC,EACN,GAGJV,EAAYU,CAAS,EAKxBV,EAAYU,CAAS,EAAE,SAASD,EAAK,CAAC,GACtCL,EAAaK,EAAK,EAAGC,CAAS,GAC9BN,EAAaK,EAAK,EAAGC,CAAS,GAC9BV,EAAYU,CAAS,EAAE,SAASD,EAAK,CAAC,GAPtCF,EAAI,MAAM,SAAUG,EAAW,qBAAqB,EAC7C,KAbW,iBAuBhBC,EAAOR,EAAA,CAACO,EAAWE,EAAOC,EAAUC,IAAW,CACnDP,EAAI,KACF,uBACAG,EACA,OACAI,EACA,OACAF,EAAM,KAAKF,CAAS,EACpBI,CACF,EACA,IAAMC,EAAQH,EAAM,SAASF,CAAS,GAAK,CAAC,EAGxCA,IAAcI,GAChBC,EAAM,KAAKL,CAAS,EAGtBH,EAAI,KAAK,4BAA6BG,EAAW,QAASK,CAAK,EAE/DA,EAAM,QAASC,GAAS,CACtB,GAAIJ,EAAM,SAASI,CAAI,EAAE,OAAS,EAChCL,EAAKK,EAAMJ,EAAOC,EAAUC,CAAM,MAC7B,CACL,IAAMG,EAAOL,EAAM,KAAKI,CAAI,EAC5BT,EAAI,KAAK,MAAOS,EAAM,OAAQF,EAAQ,gBAAiBJ,CAAS,EAChEG,EAAS,QAAQG,EAAMC,CAAI,EACvBH,IAAWF,EAAM,OAAOI,CAAI,IAC9BT,EAAI,KAAK,iBAAkBS,EAAMJ,EAAM,OAAOI,CAAI,CAAC,EACnDH,EAAS,UAAUG,EAAMJ,EAAM,OAAOI,CAAI,CAAC,GAGzCN,IAAcI,GAAUE,IAASN,GACnCH,EAAI,MAAM,iBAAkBS,EAAMN,CAAS,EAC3CG,EAAS,UAAUG,EAAMN,CAAS,IAElCH,EAAI,KAAK,WAAYG,EAAW,OAAQI,EAAQ,OAAQF,EAAM,KAAKF,CAAS,EAAGI,CAAM,EACrFP,EAAI,MACF,+BACAS,EACA,mBACAN,IAAcI,EACd,mBACAE,IAASN,CACX,GAEF,IAAMQ,EAAQN,EAAM,MAAMI,CAAI,EAC9BT,EAAI,MAAM,gBAAiBW,CAAK,EAChCA,EAAM,QAAST,GAAS,CACtBF,EAAI,KAAK,OAAQE,CAAI,EACrB,IAAMQ,EAAOL,EAAM,KAAKH,EAAK,EAAGA,EAAK,EAAGA,EAAK,IAAI,EACjDF,EAAI,KAAK,YAAaU,EAAMH,CAAM,EAClC,GAAI,CAEEN,GAAcC,EAAMK,CAAM,GAC5BP,EAAI,KAAK,cAAeE,EAAK,EAAGA,EAAK,EAAGQ,EAAMR,EAAK,IAAI,EACvDI,EAAS,QAAQJ,EAAK,EAAGA,EAAK,EAAGQ,EAAMR,EAAK,IAAI,EAChDF,EAAI,KAAK,kBAAmBM,EAAS,MAAM,EAAGA,EAAS,KAAKA,EAAS,MAAM,EAAE,CAAC,CAAC,CAAC,GAEhFN,EAAI,KACF,yBACAE,EAAK,EACL,MACAA,EAAK,EACL,YACAK,EACA,cACAJ,CACF,CAEJ,OAASS,EAAG,CACVZ,EAAI,MAAMY,CAAC,CACb,CACF,CAAC,CACH,CACAZ,EAAI,MAAM,gBAAiBS,CAAI,EAC/BJ,EAAM,WAAWI,CAAI,CACvB,CAAC,CACH,EA7Ea,QA8EAI,GAAqBjB,EAAA,CAACE,EAAIO,IAAU,CAE/C,IAAMS,EAAWT,EAAM,SAASP,CAAE,EAC9BiB,EAAM,CAAC,GAAGD,CAAQ,EAEtB,QAAWE,KAASF,EAClBpB,EAAQsB,CAAK,EAAIlB,EACjBiB,EAAM,CAAC,GAAGA,EAAK,GAAGF,GAAmBG,EAAOX,CAAK,CAAC,EAGpD,OAAOU,CACT,EAXkC,sBAyC3B,IAAME,EAAsBC,EAAA,CAACC,EAAIC,IAAU,CAEhDC,EAAI,MAAM,YAAaF,CAAE,EAEzB,IAAMG,EAAWF,EAAM,SAASD,CAAE,EAElC,GADAE,EAAI,MAAM,4BAA6BF,EAAIG,CAAQ,EAC/CA,EAAS,OAAS,EACpB,OAAAD,EAAI,MAAM,uBAAwBF,CAAE,EAC7BA,EAET,QAAWI,KAASD,EAAU,CAC5B,IAAME,EAAMP,EAAoBM,EAAOH,CAAK,EAC5C,GAAII,EACF,OAAAH,EAAI,MAAM,wBAAyBF,EAAI,OAAQK,CAAG,EAC3CA,CAEX,CACF,EAjBmC,uBAmB7BC,EAAcP,EAACC,GACf,CAACO,EAAUP,CAAE,GAIb,CAACO,EAAUP,CAAE,EAAE,oBACVA,EAILO,EAAUP,CAAE,EACPO,EAAUP,CAAE,EAAE,GAEhBA,EAbW,eAgBPQ,GAAyBT,EAAA,CAACE,EAAOQ,IAAU,CACtD,GAAI,CAACR,GAASQ,EAAQ,GAAI,CACxBP,EAAI,MAAM,uBAAuB,EACjC,MACF,MACEA,EAAI,MAAM,mBAAmB,EAI/BD,EAAM,MAAM,EAAE,QAAQ,SAAUD,EAAI,CACjBC,EAAM,SAASD,CAAE,EACrB,OAAS,IACpBE,EAAI,KACF,qBACAF,EACA,6BACAF,EAAoBE,EAAIC,CAAK,CAC/B,EACAS,EAAYV,CAAE,EAAIW,GAAmBX,EAAIC,CAAK,EAC9CM,EAAUP,CAAE,EAAI,CAAE,GAAIF,EAAoBE,EAAIC,CAAK,EAAG,YAAaA,EAAM,KAAKD,CAAE,CAAE,EAEtF,CAAC,EAGDC,EAAM,MAAM,EAAE,QAAQ,SAAUD,EAAI,CAClC,IAAMG,EAAWF,EAAM,SAASD,CAAE,EAC5BY,EAAQX,EAAM,MAAM,EACtBE,EAAS,OAAS,GACpBD,EAAI,MAAM,qBAAsBF,EAAIU,CAAW,EAC/CE,EAAM,QAASC,GAAS,CAItB,GAAIA,EAAK,IAAMb,GAAMa,EAAK,IAAMb,EAAI,CAIlC,IAAMc,EAAKC,EAAaF,EAAK,EAAGb,CAAE,EAC5BgB,EAAKD,EAAaF,EAAK,EAAGb,CAAE,EAG9Bc,EAAKE,IACPd,EAAI,KAAK,SAAUW,EAAM,mBAAoBb,CAAE,EAC/CE,EAAI,KAAK,sBAAuBF,EAAI,KAAMU,EAAYV,CAAE,CAAC,EACzDO,EAAUP,CAAE,EAAE,oBAAsB,GAExC,CACF,CAAC,GAEDE,EAAI,MAAM,iBAAkBF,EAAIU,CAAW,CAE/C,CAAC,EAED,QAASV,KAAM,OAAO,KAAKO,CAAS,EAAG,CACrC,IAAMU,EAAkBV,EAAUP,CAAE,EAAE,GAChCkB,EAASjB,EAAM,OAAOgB,CAAe,EAGvCC,IAAWlB,GAAMO,EAAUW,CAAM,GAAK,CAACX,EAAUW,CAAM,EAAE,sBAC3DX,EAAUP,CAAE,EAAE,GAAKkB,EAEvB,CAIAjB,EAAM,MAAM,EAAE,QAAQ,SAAU,EAAG,CACjC,IAAMY,EAAOZ,EAAM,KAAK,CAAC,EACzBC,EAAI,KAAK,QAAU,EAAE,EAAI,OAAS,EAAE,EAAI,KAAO,KAAK,UAAU,CAAC,CAAC,EAChEA,EAAI,KAAK,QAAU,EAAE,EAAI,OAAS,EAAE,EAAI,KAAO,KAAK,UAAUD,EAAM,KAAK,CAAC,CAAC,CAAC,EAE5E,IAAIkB,EAAI,EAAE,EACNC,EAAI,EAAE,EAaV,GAXAlB,EAAI,KACF,UACAK,EACA,OACA,EAAE,EACF,EAAE,EACF,gBACAA,EAAU,EAAE,CAAC,EACb,QACAA,EAAU,EAAE,CAAC,CACf,EACIA,EAAU,EAAE,CAAC,GAAKA,EAAU,EAAE,CAAC,GAAKA,EAAU,EAAE,CAAC,IAAMA,EAAU,EAAE,CAAC,EAAG,CAEzEL,EAAI,KAAK,iDAAkD,EAAE,EAAG,EAAE,EAAG,EAAE,IAAI,EAC3EA,EAAI,KAAK,oCAAqC,EAAE,EAAG,EAAE,EAAG,EAAE,IAAI,EAC9DiB,EAAIb,EAAY,EAAE,CAAC,EACnBc,EAAId,EAAY,EAAE,CAAC,EACnBL,EAAM,WAAW,EAAE,EAAG,EAAE,EAAG,EAAE,IAAI,EACjC,IAAMoB,EAAY,EAAE,EAAI,MAAQ,EAAE,EAClCpB,EAAM,QAAQoB,EAAW,CACvB,MAAOA,EACP,GAAIA,EACJ,WAAY,GACZ,UAAWR,EAAK,MAChB,QAAS,EACT,MAAO,YACP,MAAO,EACT,CAAC,EACD,IAAMS,EAAQ,gBAAgBT,CAAI,EAC5BU,EAAQ,gBAAgBV,CAAI,EAClCS,EAAM,MAAQ,GACdA,EAAM,aAAe,OACrBC,EAAM,MAAQ,GACdD,EAAM,YAAc,EAAE,EACtBC,EAAM,UAAY,EAAE,EAEpBtB,EAAM,QAAQkB,EAAGE,EAAWC,EAAO,EAAE,KAAO,iBAAiB,EAC7DrB,EAAM,QAAQoB,EAAWD,EAAGG,EAAO,EAAE,KAAO,iBAAiB,CAC/D,SAAWhB,EAAU,EAAE,CAAC,GAAKA,EAAU,EAAE,CAAC,EAAG,CAK3C,GAJAL,EAAI,KAAK,oCAAqC,EAAE,EAAG,EAAE,EAAG,EAAE,IAAI,EAC9DiB,EAAIb,EAAY,EAAE,CAAC,EACnBc,EAAId,EAAY,EAAE,CAAC,EACnBL,EAAM,WAAW,EAAE,EAAG,EAAE,EAAG,EAAE,IAAI,EAC7BkB,IAAM,EAAE,EAAG,CACb,IAAMD,EAASjB,EAAM,OAAOkB,CAAC,EAC7BZ,EAAUW,CAAM,EAAE,oBAAsB,GACxCL,EAAK,YAAc,EAAE,CACvB,CACA,GAAIO,IAAM,EAAE,EAAG,CACb,IAAMF,EAASjB,EAAM,OAAOmB,CAAC,EAC7Bb,EAAUW,CAAM,EAAE,oBAAsB,GACxCL,EAAK,UAAY,EAAE,CACrB,CACAX,EAAI,KAAK,yBAA0BiB,EAAGC,EAAG,EAAE,IAAI,EAC/CnB,EAAM,QAAQkB,EAAGC,EAAGP,EAAM,EAAE,IAAI,CAClC,CACF,CAAC,EACDX,EAAI,KAAK,iBAA+BsB,EAAMvB,CAAK,CAAC,EACpDwB,GAAUxB,EAAO,CAAC,EAElBC,EAAI,MAAMK,CAAS,CAQrB,EA7IsC,0BA+IzBkB,GAAY1B,EAAA,CAACE,EAAOQ,IAAU,CAEzC,GADAP,EAAI,KAAK,eAAgBO,EAAoBe,EAAMvB,CAAK,EAAGA,EAAM,SAAS,GAAG,CAAC,EAC1EQ,EAAQ,GAAI,CACdP,EAAI,MAAM,aAAa,EACvB,MACF,CAIA,IAAIwB,EAAQzB,EAAM,MAAM,EACpB0B,EAAc,GAClB,QAAWC,KAAQF,EAAO,CACxB,IAAMvB,EAAWF,EAAM,SAAS2B,CAAI,EACpCD,EAAcA,GAAexB,EAAS,OAAS,CACjD,CAEA,GAAI,CAACwB,EAAa,CAChBzB,EAAI,MAAM,6BAA8BD,EAAM,MAAM,CAAC,EACrD,MACF,CAGAC,EAAI,MAAM,WAAYwB,EAAOjB,CAAK,EAClC,QAAWmB,KAAQF,EAcjB,GAbAxB,EAAI,MACF,kBACA0B,EACArB,EACAA,EAAUqB,CAAI,GAAK,CAACrB,EAAUqB,CAAI,EAAE,oBACpC,CAAC3B,EAAM,OAAO2B,CAAI,EAClB3B,EAAM,KAAK2B,CAAI,EACf3B,EAAM,SAAS,GAAG,EAClB,UACAQ,CACF,EAGI,CAACF,EAAUqB,CAAI,EAEjB1B,EAAI,MAAM,gBAAiB0B,EAAMnB,CAAK,UAGtC,CAACF,EAAUqB,CAAI,EAAE,qBAEjB3B,EAAM,SAAS2B,CAAI,GACnB3B,EAAM,SAAS2B,CAAI,EAAE,OAAS,EAC9B,CACA1B,EAAI,KACF,2EACA0B,EACAnB,CACF,EAGA,IAAIoB,EADkB5B,EAAM,MAAM,EACV,UAAY,KAAO,KAAO,KAC9CM,EAAUqB,CAAI,GAAKrB,EAAUqB,CAAI,EAAE,aAAerB,EAAUqB,CAAI,EAAE,YAAY,MAChFC,EAAMtB,EAAUqB,CAAI,EAAE,YAAY,IAClC1B,EAAI,KAAK,aAAcK,EAAUqB,CAAI,EAAE,YAAY,IAAKC,CAAG,GAG7D,IAAMC,EAAe,IAAaC,EAAM,CACtC,WAAY,GACZ,SAAU,EACZ,CAAC,EACE,SAAS,CACR,QAASF,EACT,QAAS,GACT,QAAS,GACT,QAAS,EACT,QAAS,CACX,CAAC,EACA,oBAAoB,UAAY,CAC/B,MAAO,CAAC,CACV,CAAC,EAEH3B,EAAI,KAAK,wBAAsCsB,EAAMvB,CAAK,CAAC,EAC3D+B,EAAKJ,EAAM3B,EAAO6B,EAAcF,CAAI,EACpC3B,EAAM,QAAQ2B,EAAM,CAClB,YAAa,GACb,GAAIA,EACJ,YAAarB,EAAUqB,CAAI,EAAE,YAC7B,UAAWrB,EAAUqB,CAAI,EAAE,UAC3B,MAAOE,CACT,CAAC,EACD5B,EAAI,KAAK,+BAAgC0B,EAAM,IAAkBJ,EAAMM,CAAY,CAAC,EACpF5B,EAAI,MAAM,uBAAqCsB,EAAMvB,CAAK,CAAC,CAC7D,MACEC,EAAI,KACF,cACA0B,EACA,oDACA,CAACrB,EAAUqB,CAAI,EAAE,oBACjB,eACA,CAAC3B,EAAM,OAAO2B,CAAI,EAClB,aACA3B,EAAM,SAAS2B,CAAI,GAAK3B,EAAM,SAAS2B,CAAI,EAAE,OAAS,EACtD3B,EAAM,SAAS,GAAG,EAClBQ,CACF,EACAP,EAAI,MAAMK,CAAS,EAIvBmB,EAAQzB,EAAM,MAAM,EACpBC,EAAI,KAAK,oBAAqBwB,CAAK,EACnC,QAAWE,KAAQF,EAAO,CACxB,IAAMO,EAAOhC,EAAM,KAAK2B,CAAI,EAC5B1B,EAAI,KAAK,kBAAmB0B,EAAMK,CAAI,EAClCA,EAAK,aACPR,GAAUQ,EAAK,MAAOxB,EAAQ,CAAC,CAEnC,CACF,EAhHyB,aAkHnByB,GAASnC,EAAA,CAACE,EAAOyB,IAAU,CAC/B,GAAIA,EAAM,SAAW,EACnB,MAAO,CAAC,EAEV,IAAIS,EAAS,OAAO,OAAOT,CAAK,EAChC,OAAAA,EAAM,QAASE,GAAS,CACtB,IAAMzB,EAAWF,EAAM,SAAS2B,CAAI,EAC9BQ,EAASF,GAAOjC,EAAOE,CAAQ,EACrCgC,EAAS,CAAC,GAAGA,EAAQ,GAAGC,CAAM,CAChC,CAAC,EAEMD,CACT,EAZe,UAcFE,GAAuBtC,EAACE,GAAUiC,GAAOjC,EAAOA,EAAM,SAAS,CAAC,EAAzC,wBCjdpC,IAAMqC,GAAOC,EAAA,CAACC,EAAQC,IAAS,CAC7BC,EAAI,KAAK,8BAA+BD,EAAK,GAAIA,CAAI,EACrD,IAAME,EAAaC,EAAU,EAGvBC,EAAWL,EACd,OAAO,GAAG,EACV,KAAK,QAAS,WAAaC,EAAK,MAAQ,IAAMA,EAAK,MAAQ,GAAG,EAC9D,KAAK,KAAMA,EAAK,EAAE,EAGfH,EAAOO,EAAS,OAAO,OAAQ,cAAc,EAE7CC,EAAgBC,EAASJ,EAAW,UAAU,UAAU,EAGxDK,EAAQH,EAAS,OAAO,GAAG,EAAE,KAAK,QAAS,eAAe,EAK1DI,EACJR,EAAK,YAAc,WACfS,EAAWF,EAAOP,EAAK,UAAW,CAAE,MAAOA,EAAK,WAAY,cAAAK,CAAc,EAAGH,CAAU,EACvFK,EAAM,KAAK,EAAE,YAAYG,EAAYV,EAAK,UAAWA,EAAK,WAAY,OAAW,EAAI,CAAC,EAGxFW,EAAOH,EAAK,QAAQ,EAExB,GAAIF,EAASJ,EAAW,UAAU,UAAU,EAAG,CAC7C,IAAMU,EAAMJ,EAAK,SAAS,CAAC,EACrBK,EAAKC,EAAON,CAAI,EACtBG,EAAOC,EAAI,sBAAsB,EACjCC,EAAG,KAAK,QAASF,EAAK,KAAK,EAC3BE,EAAG,KAAK,SAAUF,EAAK,MAAM,CAC/B,CAEA,IAAMI,EAAU,EAAIf,EAAK,QACnBgB,EAAcD,EAAU,EAExBE,EAAQjB,EAAK,OAASW,EAAK,MAAQI,EAAUJ,EAAK,MAAQI,EAAUf,EAAK,MAC3EA,EAAK,OAASW,EAAK,MAAQI,EAC7Bf,EAAK,MAAQW,EAAK,MAAQX,EAAK,OAAS,EAAIA,EAAK,QAAU,EAE3DA,EAAK,KAAO,CAACA,EAAK,QAAU,EAG9BC,EAAI,MAAM,QAASD,EAAM,KAAK,UAAUA,CAAI,CAAC,EAE7CH,EACG,KAAK,QAASG,EAAK,KAAK,EACxB,KAAK,KAAMA,EAAK,EAAE,EAClB,KAAK,KAAMA,EAAK,EAAE,EAClB,KAAK,IAAKA,EAAK,EAAIiB,EAAQ,CAAC,EAC5B,KAAK,IAAKjB,EAAK,EAAIA,EAAK,OAAS,EAAIgB,CAAW,EAChD,KAAK,QAASC,CAAK,EACnB,KAAK,SAAUjB,EAAK,OAASe,CAAO,EAEvC,GAAM,CAAE,uBAAAG,CAAuB,EAAIC,EAAwBjB,CAAU,EACjEG,EACFE,EAAM,KACJ,YAEA,aAAaP,EAAK,EAAIW,EAAK,MAAQ,CAAC,KAAKX,EAAK,EAAIA,EAAK,OAAS,EAAIkB,CAAsB,GAC5F,EAEAX,EAAM,KACJ,YAEA,aAAaP,EAAK,CAAC,KAAKA,EAAK,EAAIA,EAAK,OAAS,EAAIkB,CAAsB,GAC3E,EAIF,IAAME,EAAUvB,EAAK,KAAK,EAAE,QAAQ,EACpC,OAAAG,EAAK,MAAQoB,EAAQ,MACrBpB,EAAK,OAASoB,EAAQ,OAEtBpB,EAAK,UAAY,SAAUqB,EAAO,CAChC,OAAOC,EAActB,EAAMqB,CAAK,CAClC,EAEOjB,CACT,EAnFa,QA4FPmB,GAAYzB,EAAA,CAACC,EAAQC,IAAS,CAElC,IAAMI,EAAWL,EAAO,OAAO,GAAG,EAAE,KAAK,QAAS,cAAc,EAAE,KAAK,KAAMC,EAAK,EAAE,EAG9EH,EAAOO,EAAS,OAAO,OAAQ,cAAc,EAE7CW,EAAU,EAAIf,EAAK,QACnBgB,EAAcD,EAAU,EAG9BlB,EACG,KAAK,KAAMG,EAAK,EAAE,EAClB,KAAK,KAAMA,EAAK,EAAE,EAClB,KAAK,IAAKA,EAAK,EAAIA,EAAK,MAAQ,EAAIgB,CAAW,EAC/C,KAAK,IAAKhB,EAAK,EAAIA,EAAK,OAAS,EAAIgB,CAAW,EAChD,KAAK,QAAShB,EAAK,MAAQe,CAAO,EAClC,KAAK,SAAUf,EAAK,OAASe,CAAO,EACpC,KAAK,OAAQ,MAAM,EAEtB,IAAMK,EAAUvB,EAAK,KAAK,EAAE,QAAQ,EACpC,OAAAG,EAAK,MAAQoB,EAAQ,MACrBpB,EAAK,OAASoB,EAAQ,OAEtBpB,EAAK,UAAY,SAAUqB,EAAO,CAChC,OAAOC,EAActB,EAAMqB,CAAK,CAClC,EAEOjB,CACT,EA7BkB,aA8BZoB,GAAmB1B,EAAA,CAACC,EAAQC,IAAS,CACzC,IAAME,EAAaC,EAAU,EAGvBC,EAAWL,EAAO,OAAO,GAAG,EAAE,KAAK,QAASC,EAAK,OAAO,EAAE,KAAK,KAAMA,EAAK,EAAE,EAG5EH,EAAOO,EAAS,OAAO,OAAQ,cAAc,EAG7CG,EAAQH,EAAS,OAAO,GAAG,EAAE,KAAK,QAAS,eAAe,EAC1DqB,EAAYrB,EAAS,OAAO,MAAM,EAElCI,EAAOD,EACV,KAAK,EACL,YAAYG,EAAYV,EAAK,UAAWA,EAAK,WAAY,OAAW,EAAI,CAAC,EAGxEW,EAAOH,EAAK,QAAQ,EACxB,GAAIF,EAASJ,EAAW,UAAU,UAAU,EAAG,CAC7C,IAAMU,EAAMJ,EAAK,SAAS,CAAC,EACrBK,EAAKC,EAAON,CAAI,EACtBG,EAAOC,EAAI,sBAAsB,EACjCC,EAAG,KAAK,QAASF,EAAK,KAAK,EAC3BE,EAAG,KAAK,SAAUF,EAAK,MAAM,CAC/B,CACAA,EAAOH,EAAK,QAAQ,EACpB,IAAMO,EAAU,EAAIf,EAAK,QACnBgB,EAAcD,EAAU,EAExBE,EAAQjB,EAAK,OAASW,EAAK,MAAQX,EAAK,QAAUW,EAAK,MAAQX,EAAK,QAAUA,EAAK,MACrFA,EAAK,OAASW,EAAK,MAAQX,EAAK,QAClCA,EAAK,MAAQW,EAAK,MAAQX,EAAK,QAAU,EAAIA,EAAK,OAAS,EAE3DA,EAAK,KAAO,CAACA,EAAK,QAAU,EAI9BH,EACG,KAAK,QAAS,OAAO,EACrB,KAAK,IAAKG,EAAK,EAAIiB,EAAQ,EAAID,CAAW,EAC1C,KAAK,IAAKhB,EAAK,EAAIA,EAAK,OAAS,EAAIgB,CAAW,EAChD,KAAK,QAASC,EAAQF,CAAO,EAC7B,KAAK,SAAUf,EAAK,OAASe,CAAO,EACvCU,EACG,KAAK,QAAS,OAAO,EACrB,KAAK,IAAKzB,EAAK,EAAIiB,EAAQ,EAAID,CAAW,EAC1C,KAAK,IAAKhB,EAAK,EAAIA,EAAK,OAAS,EAAIgB,EAAcL,EAAK,OAAS,CAAC,EAClE,KAAK,QAASM,EAAQF,CAAO,EAC7B,KAAK,SAAUf,EAAK,OAASe,EAAUJ,EAAK,OAAS,CAAC,EAEzD,GAAM,CAAE,uBAAAO,CAAuB,EAAIC,EAAwBjB,CAAU,EAErEK,EAAM,KACJ,YACA,aAAaP,EAAK,EAAIW,EAAK,MAAQ,CAAC,KAClCX,EAAK,EACLA,EAAK,OAAS,EACdA,EAAK,QAAU,GACdM,EAASJ,EAAW,UAAU,UAAU,EAAI,EAAI,GACjDgB,CACF,GACF,EAEA,IAAME,EAAUvB,EAAK,KAAK,EAAE,QAAQ,EACpC,OAAAG,EAAK,OAASoB,EAAQ,OAEtBpB,EAAK,UAAY,SAAUqB,EAAO,CAChC,OAAOC,EAActB,EAAMqB,CAAK,CAClC,EAEOjB,CACT,EAxEyB,oBA0EnBsB,GAAU5B,EAAA,CAACC,EAAQC,IAAS,CAEhC,IAAMI,EAAWL,EAAO,OAAO,GAAG,EAAE,KAAK,QAASC,EAAK,OAAO,EAAE,KAAK,KAAMA,EAAK,EAAE,EAG5EH,EAAOO,EAAS,OAAO,OAAQ,cAAc,EAE7CW,EAAU,EAAIf,EAAK,QACnBgB,EAAcD,EAAU,EAG9BlB,EACG,KAAK,QAAS,SAAS,EACvB,KAAK,IAAKG,EAAK,EAAIA,EAAK,MAAQ,EAAIgB,CAAW,EAC/C,KAAK,IAAKhB,EAAK,EAAIA,EAAK,OAAS,CAAC,EAClC,KAAK,QAASA,EAAK,MAAQe,CAAO,EAClC,KAAK,SAAUf,EAAK,OAASe,CAAO,EAEvC,IAAMK,EAAUvB,EAAK,KAAK,EAAE,QAAQ,EACpC,OAAAG,EAAK,MAAQoB,EAAQ,MACrBpB,EAAK,OAASoB,EAAQ,OACtBpB,EAAK,KAAO,CAACA,EAAK,QAAU,EAC5BA,EAAK,UAAY,SAAUqB,EAAO,CAChC,OAAOC,EAActB,EAAMqB,CAAK,CAClC,EAEOjB,CACT,EA3BgB,WA6BVuB,GAAS,CAAE,KAAA9B,GAAM,iBAAA2B,GAAkB,UAAAD,GAAW,QAAAG,EAAQ,EAExDE,GAAe,CAAC,EAEPC,GAAgB/B,EAAA,CAACgC,EAAM9B,IAAS,CAC3CC,EAAI,MAAM,mBAAmB,EAC7B,IAAM8B,EAAQ/B,EAAK,OAAS,OAC5B4B,GAAa5B,EAAK,EAAE,EAAI2B,GAAOI,CAAK,EAAED,EAAM9B,CAAI,CAClD,EAJ6B,iBAatB,IAAMgC,GAAQC,EAAA,IAAM,CACzBC,GAAe,CAAC,CAClB,EAFqB,SCzOrB,IAAMC,GAAkBC,EAAA,MAAOC,EAAOC,EAAOC,EAAaC,EAAIC,EAAeC,IAAe,CAC1FC,EAAI,KAAK,iCAA+CC,EAAMN,CAAK,EAAGG,CAAa,EACnF,IAAMI,EAAMP,EAAM,MAAM,EAAE,QAC1BK,EAAI,MAAM,iCAAkCE,CAAG,EAE/C,IAAMC,EAAOT,EAAM,OAAO,GAAG,EAAE,KAAK,QAAS,MAAM,EAC9CC,EAAM,MAAM,EAGfK,EAAI,KAAK,uBAAwBL,EAAM,MAAM,CAAC,EAF9CK,EAAI,KAAK,qBAAsBL,CAAK,EAIlCA,EAAM,MAAM,EAAE,OAAS,GACzBK,EAAI,MAAM,kBAAmBL,EAAM,KAAKA,EAAM,MAAM,EAAE,CAAC,CAAC,CAAC,EAE3D,IAAMS,EAAWD,EAAK,OAAO,GAAG,EAAE,KAAK,QAAS,UAAU,EACpDE,EAAYF,EAAK,OAAO,GAAG,EAAE,KAAK,QAAS,WAAW,EACtDG,EAAaH,EAAK,OAAO,GAAG,EAAE,KAAK,QAAS,YAAY,EACxDI,EAAQJ,EAAK,OAAO,GAAG,EAAE,KAAK,QAAS,OAAO,EAIpD,MAAM,QAAQ,IACZR,EAAM,MAAM,EAAE,IAAI,eAAgBa,EAAG,CACnC,IAAMC,EAAOd,EAAM,KAAKa,CAAC,EACzB,GAAIV,IAAkB,OAAW,CAC/B,IAAMY,EAAO,KAAK,MAAM,KAAK,UAAUZ,EAAc,WAAW,CAAC,EAEjEE,EAAI,KAAK,iCAAkCQ,EAAG,KAAME,EAAMZ,CAAa,EACvEH,EAAM,QAAQG,EAAc,GAAIY,CAAI,EAC/Bf,EAAM,OAAOa,CAAC,IACjBR,EAAI,MAAM,iBAAkBQ,EAAGV,EAAc,EAAE,EAC/CH,EAAM,UAAUa,EAAGV,EAAc,GAAIY,CAAI,EAE7C,CAEA,GADAV,EAAI,KAAK,oBAAsBQ,EAAI,KAAO,KAAK,UAAUb,EAAM,KAAKa,CAAC,CAAC,CAAC,EACnEC,GAAQA,EAAK,YAAa,CAE5BT,EAAI,KAAK,qBAAsBQ,EAAGC,EAAK,MAAOd,EAAM,KAAKa,CAAC,CAAC,EAG3D,GAAM,CAAE,QAAAG,EAAS,QAAAC,CAAQ,EAAIjB,EAAM,MAAM,EACzCc,EAAK,MAAM,SAAS,CAClB,GAAGA,EAAK,MAAM,MAAM,EACpB,QAAAE,EACA,QAAAC,CACF,CAAC,EACD,IAAMC,EAAI,MAAMrB,GACde,EACAE,EAAK,MACLb,EACAC,EACAF,EAAM,KAAKa,CAAC,EACZT,CACF,EACMe,EAAQD,EAAE,KAChBE,EAAiBN,EAAMK,CAAK,EAC5BL,EAAK,KAAOI,EAAE,MAAQ,EACtBb,EAAI,KAAK,uBAAwBQ,EAAGC,EAAMA,EAAK,MAAOA,EAAK,EAAGA,EAAK,CAAC,EACpEO,EAAYF,EAAOL,CAAI,EAEvBT,EAAI,KAAK,6BAA8Bc,EAAOL,CAAI,CACpD,MACMd,EAAM,SAASa,CAAC,EAAE,OAAS,GAG7BR,EAAI,KAAK,uCAAwCQ,EAAGC,EAAK,GAAIA,EAAMd,CAAK,EACxEK,EAAI,KAAKiB,EAAoBR,EAAK,GAAId,CAAK,CAAC,EAC5CuB,EAAUT,EAAK,EAAE,EAAI,CAAE,GAAIQ,EAAoBR,EAAK,GAAId,CAAK,EAAG,KAAAc,CAAK,IAGrET,EAAI,KAAK,gCAAiCQ,EAAGC,EAAK,GAAIA,CAAI,EAC1D,MAAMU,EAAWZ,EAAOZ,EAAM,KAAKa,CAAC,EAAGN,CAAG,EAGhD,CAAC,CACH,EAMAP,EAAM,MAAM,EAAE,QAAQ,SAAUyB,EAAG,CACjC,IAAMC,EAAO1B,EAAM,KAAKyB,EAAE,EAAGA,EAAE,EAAGA,EAAE,IAAI,EACxCpB,EAAI,KAAK,QAAUoB,EAAE,EAAI,OAASA,EAAE,EAAI,KAAO,KAAK,UAAUA,CAAC,CAAC,EAChEpB,EAAI,KAAK,QAAUoB,EAAE,EAAI,OAASA,EAAE,EAAI,KAAMA,EAAG,IAAK,KAAK,UAAUzB,EAAM,KAAKyB,CAAC,CAAC,CAAC,EAGnFpB,EAAI,KAAK,MAAOkB,EAAW,OAAQE,EAAE,EAAGA,EAAE,EAAG,gBAAiBF,EAAUE,EAAE,CAAC,EAAGF,EAAUE,EAAE,CAAC,CAAC,EAC5FE,EAAgBhB,EAAYe,CAAI,CAClC,CAAC,EAED1B,EAAM,MAAM,EAAE,QAAQ,SAAUyB,EAAG,CACjCpB,EAAI,KAAK,QAAUoB,EAAE,EAAI,OAASA,EAAE,EAAI,KAAO,KAAK,UAAUA,CAAC,CAAC,CAClE,CAAC,EACDpB,EAAI,KAAK,+CAA+C,EACxDA,EAAI,KAAK,+CAA+C,EACxDA,EAAI,KAAK,+CAA+C,EACxDA,EAAI,KAAKL,CAAK,EACd4B,EAAY5B,CAAK,EACjBK,EAAI,KAAK,sBAAoCC,EAAMN,CAAK,CAAC,EAEzD,IAAI6B,EAAO,EACL,CAAE,yBAAAC,CAAyB,EAAIC,EAAwB3B,CAAU,EACvE,OAAA4B,GAAqBhC,CAAK,EAAE,QAAQ,SAAUa,EAAG,CAC/C,IAAMC,EAAOd,EAAM,KAAKa,CAAC,EACzBR,EAAI,KAAK,YAAcQ,EAAI,KAAO,KAAK,UAAUb,EAAM,KAAKa,CAAC,CAAC,CAAC,EAC/DR,EAAI,KACF,YAAcQ,EAAI,MAAQC,EAAK,EAC/B,IAAMA,EAAK,EACX,YACAA,EAAK,MACL,YACAA,EAAK,MACP,EACIA,GAAQA,EAAK,aAEfA,EAAK,GAAKgB,EACVG,EAAanB,CAAI,GAGbd,EAAM,SAASa,CAAC,EAAE,OAAS,GAG7BC,EAAK,QAAUgB,EACfI,GAAczB,EAAUK,CAAI,EAC5BS,EAAUT,EAAK,EAAE,EAAE,KAAOA,IAE1BA,EAAK,GAAKgB,EAA2B,EACrCG,EAAanB,CAAI,EAGvB,CAAC,EAGDd,EAAM,MAAM,EAAE,QAAQ,SAAUyB,EAAG,CACjC,IAAMC,EAAO1B,EAAM,KAAKyB,CAAC,EACzBpB,EAAI,KAAK,QAAUoB,EAAE,EAAI,OAASA,EAAE,EAAI,KAAO,KAAK,UAAUC,CAAI,EAAGA,CAAI,EAEzEA,EAAK,OAAO,QAASS,GAAWA,EAAM,GAAKL,EAA2B,CAAE,EACxE,IAAMM,EAAQC,EAAW3B,EAAWe,EAAGC,EAAMH,EAAWtB,EAAaD,EAAOE,CAAE,EAC9EoC,EAAkBZ,EAAMU,CAAK,CAC/B,CAAC,EAEDpC,EAAM,MAAM,EAAE,QAAQ,SAAUa,EAAG,CACjC,IAAM0B,EAAIvC,EAAM,KAAKa,CAAC,EACtBR,EAAI,KAAKQ,EAAG0B,EAAE,KAAMA,EAAE,IAAI,EACtBA,EAAE,OAAS,UACbV,EAAOU,EAAE,KAEb,CAAC,EACM,CAAE,KAAA/B,EAAM,KAAAqB,CAAK,CACtB,EAvJwB,mBAyJXW,GAAS1C,EAAA,MAAOU,EAAMR,EAAOyC,EAASxC,EAAaC,IAAO,CACrEwC,EAAclC,EAAMiC,EAASxC,EAAaC,CAAE,EAC5CyC,EAAW,EACXA,EAAW,EACXA,GAAc,EACdA,EAAc,EAEdtC,EAAI,KAAK,kBAAmB,KAAK,UAAuBC,EAAMN,CAAK,CAAC,CAAC,EACrE4C,GAAuB5C,CAAK,EAC5BK,EAAI,KAAK,eAAgB,KAAK,UAAuBC,EAAMN,CAAK,CAAC,CAAC,EAElE,IAAMI,EAAayC,EAAU,EAC7B,MAAMhD,GAAgBW,EAAMR,EAAOC,EAAaC,EAAI,OAAWE,CAAU,CAC3E,EAbsB",
  "names": ["write", "g", "json", "writeNodes", "writeEdges", "isUndefined_default", "clone_default", "__name", "map_default", "v", "nodeValue", "parent", "node", "e", "edgeValue", "edge", "clusterDb", "descendants", "parents", "clear", "__name", "isDescendant", "id", "ancestorId", "log", "edgeInCluster", "edge", "clusterId", "copy", "graph", "newGraph", "rootId", "nodes", "node", "data", "edges", "e", "extractDescendants", "children", "res", "child", "findNonClusterChild", "__name", "id", "graph", "log", "children", "child", "_id", "getAnchorId", "clusterDb", "adjustClustersAndEdges", "depth", "descendants", "extractDescendants", "edges", "edge", "d1", "isDescendant", "d2", "nonClusterChild", "parent", "v", "w", "specialId", "edge1", "edge2", "write", "extractor", "nodes", "hasChildren", "node", "dir", "clusterGraph", "Graph", "copy", "data", "sorter", "result", "sorted", "sortNodesByHierarchy", "rect", "__name", "parent", "node", "log", "siteConfig", "getConfig", "shapeSvg", "useHtmlLabels", "evaluate", "label", "text", "createText", "createLabel_default", "bbox", "div", "dv", "select_default", "padding", "halfPadding", "width", "subGraphTitleTopMargin", "getSubGraphTitleMargins", "rectBox", "point", "intersect_rect_default", "noteGroup", "roundedWithTitle", "innerRect", "divider", "shapes", "clusterElems", "insertCluster", "elem", "shape", "clear", "__name", "clusterElems", "recursiveRender", "__name", "_elem", "graph", "diagramType", "id", "parentCluster", "siteConfig", "log", "write", "dir", "elem", "clusters", "edgePaths", "edgeLabels", "nodes", "v", "node", "data", "ranksep", "nodesep", "o", "newEl", "updateNodeBounds", "setNodeElem", "findNonClusterChild", "clusterDb", "insertNode", "e", "edge", "insertEdgeLabel", "layout", "diff", "subGraphTitleTotalMargin", "getSubGraphTitleMargins", "sortNodesByHierarchy", "positionNode", "insertCluster", "point", "paths", "insertEdge", "positionEdgeLabel", "n", "render", "markers", "markers_default", "clear", "adjustClustersAndEdges", "getConfig"]
}