@dagrejs/dagre 2.0.3 → 3.0.0

package/dist/dagre.min.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
-  "sources": ["../lib/data/list.js", "../lib/greedy-fas.js", "../lib/util.js", "../lib/acyclic.js", "../lib/normalize.js", "../lib/rank/util.js", "../lib/rank/feasible-tree.js", "../lib/rank/network-simplex.js", "../lib/rank/index.js", "../lib/parent-dummy-chains.js", "../lib/nesting-graph.js", "../lib/add-border-segments.js", "../lib/coordinate-system.js", "../lib/order/init-order.js", "../lib/order/cross-count.js", "../lib/order/barycenter.js", "../lib/order/resolve-conflicts.js", "../lib/order/sort.js", "../lib/order/sort-subgraph.js", "../lib/order/build-layer-graph.js", "../lib/order/add-subgraph-constraints.js", "../lib/order/index.js", "../lib/position/bk.js", "../lib/position/index.js", "../lib/layout.js", "../lib/debug.js", "../lib/version.js", "../index.js"],
-  "sourcesContent": ["/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nclass List {\n  constructor() {\n    let sentinel = {};\n    sentinel._next = sentinel._prev = sentinel;\n    this._sentinel = sentinel;\n  }\n\n  dequeue() {\n    let sentinel = this._sentinel;\n    let entry = sentinel._prev;\n    if (entry !== sentinel) {\n      unlink(entry);\n      return entry;\n    }\n  }\n\n  enqueue(entry) {\n    let sentinel = this._sentinel;\n    if (entry._prev && entry._next) {\n      unlink(entry);\n    }\n    entry._next = sentinel._next;\n    sentinel._next._prev = entry;\n    sentinel._next = entry;\n    entry._prev = sentinel;\n  }\n\n  toString() {\n    let strs = [];\n    let sentinel = this._sentinel;\n    let curr = sentinel._prev;\n    while (curr !== sentinel) {\n      strs.push(JSON.stringify(curr, filterOutLinks));\n      curr = curr._prev;\n    }\n    return \"[\" + strs.join(\", \") + \"]\";\n  }\n}\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n\nmodule.exports = List;\n", "let Graph = require(\"@dagrejs/graphlib\").Graph;\nlet List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nlet DEFAULT_WEIGHT_FN = () => 1;\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  let state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  let results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return results.flatMap(e => g.outEdges(e.v, e.w));\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  let results = [];\n  let sources = buckets[buckets.length - 1];\n  let sinks = buckets[0];\n\n  let entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (let i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  let results = collectPredecessors ? [] : undefined;\n\n  g.inEdges(entry.v).forEach(edge => {\n    let weight = g.edge(edge);\n    let uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  g.outEdges(entry.v).forEach(edge => {\n    let weight = g.edge(edge);\n    let w = edge.w;\n    let wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  let fasGraph = new Graph();\n  let maxIn = 0;\n  let maxOut = 0;\n\n  g.nodes().forEach(v => {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  g.edges().forEach(e => {\n    let prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    let weight = weightFn(e);\n    let edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  let buckets = range(maxOut + maxIn + 3).map(() => new List());\n  let zeroIdx = maxIn + 1;\n\n  fasGraph.nodes().forEach(v => {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n\nfunction range(limit) {\n  const range = [];\n  for (let i = 0; i < limit; i++) {\n    range.push(i);\n  }\n\n  return range;\n}\n", "/* eslint \"no-console\": off */\n\n\"use strict\";\n\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = {\n  addBorderNode,\n  addDummyNode,\n  applyWithChunking,\n  asNonCompoundGraph,\n  buildLayerMatrix,\n  intersectRect,\n  mapValues,\n  maxRank,\n  normalizeRanks,\n  notime,\n  partition,\n  pick,\n  predecessorWeights,\n  range,\n  removeEmptyRanks,\n  simplify,\n  successorWeights,\n  time,\n  uniqueId,\n  zipObject,\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v = name;\n  while (g.hasNode(v)) {\n    v = uniqueId(name);\n  }\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  let simplified = new Graph().setGraph(g.graph());\n  g.nodes().forEach(v => simplified.setNode(v, g.node(v)));\n  g.edges().forEach(e => {\n    let simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    let label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  let simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  g.nodes().forEach(v => {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  g.edges().forEach(e => {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  let weightMap = g.nodes().map(v => {\n    let sucs = {};\n    g.outEdges(v).forEach(e => {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  let weightMap = g.nodes().map(v => {\n    let preds = {};\n    g.inEdges(v).forEach(e => {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  let x = rect.x;\n  let y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  let dx = point.x - x;\n  let dy = point.y - y;\n  let w = rect.width / 2;\n  let h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  let sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  let layering = range(maxRank(g) + 1).map(() => []);\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    let rank = node.rank;\n    if (rank !== undefined) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  let nodeRanks = g.nodes().map(v => {\n    let rank = g.node(v).rank;\n    if (rank === undefined) {\n      return Number.MAX_VALUE;\n    }\n\n    return rank;\n  });\n  let min = applyWithChunking(Math.min, nodeRanks);\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (Object.hasOwn(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  let nodeRanks = g.nodes().map(v => g.node(v).rank).filter(rank => rank !== undefined);\n  let offset = applyWithChunking(Math.min, nodeRanks);\n\n  let layers = [];\n  g.nodes().forEach(v => {\n    let rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  let delta = 0;\n  let nodeRankFactor = g.graph().nodeRankFactor;\n  Array.from(layers).forEach((vs, i) => {\n    if (vs === undefined && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (vs !== undefined && delta) {\n      vs.forEach(v => g.node(v).rank += delta);\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  let node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction splitToChunks(array, chunkSize = CHUNKING_THRESHOLD) {\n  const chunks = [];\n  for (let i = 0; i < array.length; i += chunkSize) {\n    const chunk = array.slice(i, i + chunkSize);\n    chunks.push(chunk);\n  }\n  return chunks;\n}\n\nconst CHUNKING_THRESHOLD = 65535;\n\nfunction applyWithChunking(fn, argsArray) {\n  if(argsArray.length > CHUNKING_THRESHOLD) {\n    const chunks = splitToChunks(argsArray);\n    return fn.apply(null, chunks.map(chunk => fn.apply(null, chunk)));\n  } else {\n    return fn.apply(null, argsArray);\n  }\n}\n\nfunction maxRank(g) {\n  const nodes = g.nodes();\n  const nodeRanks = nodes.map(v => {\n    let rank = g.node(v).rank;\n    if (rank === undefined) {\n      return Number.MIN_VALUE;\n    }\n    return rank;\n  });\n\n  return applyWithChunking(Math.max, nodeRanks);\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  let result = { lhs: [], rhs: [] };\n  collection.forEach(value => {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  let start = Date.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (Date.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n\nlet idCounter = 0;\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return prefix + (\"\" + id);\n}\n\nfunction range(start, limit, step = 1) {\n  if (limit == null) {\n    limit = start;\n    start = 0;\n  }\n\n  let endCon = (i) => i < limit;\n  if (step < 0) {\n    endCon = (i) => limit < i;\n  }\n\n  const range = [];\n  for (let i = start; endCon(i); i += step) {\n    range.push(i);\n  }\n\n  return range;\n}\n\nfunction pick(source, keys) {\n  const dest = {};\n  for (const key of keys) {\n    if (source[key] !== undefined) {\n      dest[key] = source[key];\n    }\n  }\n\n  return dest;\n}\n\nfunction mapValues(obj, funcOrProp) {\n  let func = funcOrProp;\n  if (typeof funcOrProp === 'string') {\n    func = (val) => val[funcOrProp];\n  }\n\n  return Object.entries(obj).reduce((acc, [k, v]) => {\n    acc[k] = func(v, k);\n    return acc;\n  }, {});\n}\n\nfunction zipObject(props, values) {\n  return props.reduce((acc, key, i) => {\n    acc[key] = values[i];\n    return acc;\n  }, {});\n}\n", "\"use strict\";\n\nlet greedyFAS = require(\"./greedy-fas\");\nlet uniqueId = require(\"./util\").uniqueId;\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  let fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  fas.forEach(e => {\n    let label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return e => {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  let fas = [];\n  let stack = {};\n  let visited = {};\n\n  function dfs(v) {\n    if (Object.hasOwn(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    g.outEdges(v).forEach(e => {\n      if (Object.hasOwn(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  g.nodes().forEach(dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  g.edges().forEach(e => {\n    let label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      let forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n", "\"use strict\";\n\nlet util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  g.edges().forEach(edge => normalizeEdge(g, edge));\n}\n\nfunction normalizeEdge(g, e) {\n  let v = e.v;\n  let vRank = g.node(v).rank;\n  let w = e.w;\n  let wRank = g.node(w).rank;\n  let name = e.name;\n  let edgeLabel = g.edge(e);\n  let labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  let dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  g.graph().dummyChains.forEach(v => {\n    let node = g.node(v);\n    let origLabel = node.edgeLabel;\n    let w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === \"edge-label\") {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n", "\"use strict\";\n\nconst { applyWithChunking } = require(\"../util\");\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (Object.hasOwn(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    let outEdgesMinLens = g.outEdges(v).map(e => {\n      if (e == null) {\n        return Number.POSITIVE_INFINITY;\n      }\n\n      return dfs(e.w) - g.edge(e).minlen;\n    });\n\n    var rank = applyWithChunking(Math.min, outEdgesMinLens);\n\n    if (rank === Number.POSITIVE_INFINITY) {\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  g.sources().forEach(dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n", "\"use strict\";\n\nvar Graph = require(\"@dagrejs/graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    g.nodeEdges(v).forEach(e => {\n      var edgeV = e.v,\n        w = (v === edgeV) ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  t.nodes().forEach(dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  const edges = g.edges();\n\n  return edges.reduce((acc, edge) => {\n    let edgeSlack = Number.POSITIVE_INFINITY;\n    if (t.hasNode(edge.v) !== t.hasNode(edge.w)) {\n      edgeSlack = slack(g, edge);\n    }\n\n    if (edgeSlack < acc[0]) {\n      return [edgeSlack, edge];\n    }\n\n    return acc;\n  }, [Number.POSITIVE_INFINITY, null])[1];\n}\n\nfunction shiftRanks(t, g, delta) {\n  t.nodes().forEach(v => g.node(v).rank += delta);\n}\n", "\"use strict\";\n\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"@dagrejs/graphlib\").alg.preorder;\nvar postorder = require(\"@dagrejs/graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  initRank(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  vs.forEach(v => assignCutValue(t, g, v));\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  g.nodeEdges(child).forEach(e => {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  tree.neighbors(v).forEach(w => {\n    if (!Object.hasOwn(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return tree.edges().find(e => tree.edge(e).cutvalue < 0);\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = g.edges().filter(edge => {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return candidates.reduce((acc, edge) => {\n    if (slack(g, edge) < slack(g, acc)) {\n      return edge;\n    }\n\n    return acc;\n  });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = t.nodes().find(v => !g.node(v).parent);\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  vs.forEach(v => {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n", "\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  var ranker = g.graph().ranker;\n  if (ranker instanceof Function) {\n    return ranker(g);\n  }\n\n  switch(g.graph().ranker) {\n  case \"network-simplex\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  case \"none\": break;\n  default: networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n", "module.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  let postorderNums = postorder(g);\n\n  g.graph().dummyChains.forEach(v => {\n    let node = g.node(v);\n    let edgeObj = node.edgeObj;\n    let pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    let path = pathData.path;\n    let lca = pathData.lca;\n    let pathIdx = 0;\n    let pathV = path[pathIdx];\n    let ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  let vPath = [];\n  let wPath = [];\n  let low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  let lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  let parent;\n  let lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent &&\n           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  let result = {};\n  let lim = 0;\n\n  function dfs(v) {\n    let low = lim;\n    g.children(v).forEach(dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  g.children().forEach(dfs);\n\n  return result;\n}\n", "let util = require(\"./util\");\n\nmodule.exports = {\n  run,\n  cleanup,\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundaries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  let root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  let depths = treeDepths(g);\n  let depthsArr = Object.values(depths);\n  let height = util.applyWithChunking(Math.max, depthsArr) - 1; // Note: depths is an Object not an array\n  let nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  g.edges().forEach(e => g.edge(e).minlen *= nodeSep);\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  let weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  g.children().forEach(child => dfs(g, root, nodeSep, weight, height, depths, child));\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  let children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  let top = util.addBorderNode(g, \"_bt\");\n  let bottom = util.addBorderNode(g, \"_bb\");\n  let label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  children.forEach(child => {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    let childNode = g.node(child);\n    let childTop = childNode.borderTop ? childNode.borderTop : child;\n    let childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    let thisWeight = childNode.borderTop ? weight : 2 * weight;\n    let minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      children.forEach(child => dfs(child, depth + 1));\n    }\n    depths[v] = depth;\n  }\n  g.children().forEach(v => dfs(v, 1));\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return g.edges().reduce((acc, e) => acc + g.edge(e).weight, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  g.edges().forEach(e => {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n", "let util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    let children = g.children(v);\n    let node = g.node(v);\n    if (children.length) {\n      children.forEach(dfs);\n    }\n\n    if (Object.hasOwn(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (let rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  g.children().forEach(dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  let label = { width: 0, height: 0, rank: rank, borderType: prop };\n  let prev = sgNode[prop][rank - 1];\n  let curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n", "\"use strict\";\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  let rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  let rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  g.nodes().forEach(v => swapWidthHeightOne(g.node(v)));\n  g.edges().forEach(e => swapWidthHeightOne(g.edge(e)));\n}\n\nfunction swapWidthHeightOne(attrs) {\n  let w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  g.nodes().forEach(v => reverseYOne(g.node(v)));\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(reverseYOne);\n    if (Object.hasOwn(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  g.nodes().forEach(v => swapXYOne(g.node(v)));\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(swapXYOne);\n    if (Object.hasOwn(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  let x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n", "\"use strict\";\n\nlet util = require(\"../util\");\n\nmodule.exports = initOrder;\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  let visited = {};\n  let simpleNodes = g.nodes().filter(v => !g.children(v).length);\n  let simpleNodesRanks = simpleNodes.map(v => g.node(v).rank);\n  let maxRank = util.applyWithChunking(Math.max, simpleNodesRanks);\n  let layers = util.range(maxRank + 1).map(() => []);\n\n  function dfs(v) {\n    if (visited[v]) return;\n    visited[v] = true;\n    let node = g.node(v);\n    layers[node.rank].push(v);\n    g.successors(v).forEach(dfs);\n  }\n\n  let orderedVs = simpleNodes.sort((a, b) => g.node(a).rank - g.node(b).rank);\n  orderedVs.forEach(dfs);\n\n  return layers;\n}\n", "\"use strict\";\n\nlet zipObject = require(\"../util\").zipObject;\n\nmodule.exports = crossCount;\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  let cc = 0;\n  for (let i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  let southPos = zipObject(southLayer, southLayer.map((v, i) => i));\n  let southEntries = northLayer.flatMap(v => {\n    return g.outEdges(v).map(e => {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }).sort((a, b) => a.pos - b.pos);\n  });\n\n  // Build the accumulator tree\n  let firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  let treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  let tree = new Array(treeSize).fill(0);\n\n  // Calculate the weighted crossings\n  let cc = 0;\n  southEntries.forEach(entry => {\n    let index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    let weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  });\n\n  return cc;\n}\n", "module.exports = barycenter;\n\nfunction barycenter(g, movable = []) {\n  return movable.map(v => {\n    let inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      let result = inV.reduce((acc, e) => {\n        let edge = g.edge(e),\n          nodeU = g.node(e.v);\n        return {\n          sum: acc.sum + (edge.weight * nodeU.order),\n          weight: acc.weight + edge.weight\n        };\n      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n", "\"use strict\";\n\nlet util = require(\"../util\");\n\nmodule.exports = resolveConflicts;\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  let mappedEntries = {};\n  entries.forEach((entry, i) => {\n    let tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (entry.barycenter !== undefined) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  cg.edges().forEach(e => {\n    let entryV = mappedEntries[e.v];\n    let entryW = mappedEntries[e.w];\n    if (entryV !== undefined && entryW !== undefined) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  let sourceSet = Object.values(mappedEntries).filter(entry => !entry.indegree);\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  let entries = [];\n\n  function handleIn(vEntry) {\n    return uEntry => {\n      if (uEntry.merged) {\n        return;\n      }\n      if (uEntry.barycenter === undefined ||\n          vEntry.barycenter === undefined ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return wEntry => {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    let entry = sourceSet.pop();\n    entries.push(entry);\n    entry[\"in\"].reverse().forEach(handleIn(entry));\n    entry.out.forEach(handleOut(entry));\n  }\n\n  return entries.filter(entry => !entry.merged).map(entry => {\n    return util.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n  });\n}\n\nfunction mergeEntries(target, source) {\n  let sum = 0;\n  let weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n", "let util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  let parts = util.partition(entries, entry => {\n    return Object.hasOwn(entry, \"barycenter\");\n  });\n  let sortable = parts.lhs,\n    unsortable = parts.rhs.sort((a, b) => b.i - a.i),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  sortable.forEach(entry => {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  let result = { vs: vs.flat(true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  let last;\n  while (unsortable.length && (last = unsortable[unsortable.length - 1]).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return (entryV, entryW) => {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n", "let barycenter = require(\"./barycenter\");\nlet resolveConflicts = require(\"./resolve-conflicts\");\nlet sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  let movable = g.children(v);\n  let node = g.node(v);\n  let bl = node ? node.borderLeft : undefined;\n  let br = node ? node.borderRight: undefined;\n  let subgraphs = {};\n\n  if (bl) {\n    movable = movable.filter(w => w !== bl && w !== br);\n  }\n\n  let barycenters = barycenter(g, movable);\n  barycenters.forEach(entry => {\n    if (g.children(entry.v).length) {\n      let subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (Object.hasOwn(subgraphResult, \"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  let entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  let result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = [bl, result.vs, br].flat(true);\n    if (g.predecessors(bl).length) {\n      let blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!Object.hasOwn(result, \"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  entries.forEach(entry => {\n    entry.vs = entry.vs.flatMap(v => {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    });\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (target.barycenter !== undefined) {\n    target.barycenter = (target.barycenter * target.weight +\n                         other.barycenter * other.weight) /\n                        (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n", "let Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\nmodule.exports = buildLayerGraph;\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *    5. If `nodesWithRank` is not undefined, it must contains only the nodes\n *       which belong to `g` and belong to `rank`.\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship, nodesWithRank) {\n  if (!nodesWithRank) {\n    nodesWithRank = g.nodes();\n  }\n  let root = createRootNode(g),\n    result = new Graph({ compound: true })\n      .setGraph({ root: root })\n      .setDefaultNodeLabel((v) => g.node(v));\n\n  nodesWithRank.forEach((v) => {\n    let node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      g[relationship](v).forEach(e => {\n        let u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = edge !== undefined ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (Object.hasOwn(node, \"minRank\")) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank]\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = util.uniqueId(\"_root\"))));\n  return v;\n}\n", "module.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  let prev = {},\n    rootPrev;\n\n  vs.forEach(v => {\n    let child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      children.forEach(function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.sortBy(subgraphs, \"order\").reduce(function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n", "\"use strict\";\n\nlet initOrder = require(\"./init-order\");\nlet crossCount = require(\"./cross-count\");\nlet sortSubgraph = require(\"./sort-subgraph\");\nlet buildLayerGraph = require(\"./build-layer-graph\");\nlet addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\nmodule.exports = order;\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g, opts = {}) {\n  if (typeof opts.customOrder === 'function') {\n    opts.customOrder(g, order);\n    return;\n  }\n\n  let maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, util.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, util.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  let layering = initOrder(g);\n  assignOrder(g, layering);\n\n  if (opts.disableOptimalOrderHeuristic) {\n    return;\n  }\n\n  let bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  const constraints = opts.constraints || [];\n  for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2, constraints);\n\n    layering = util.buildLayerMatrix(g);\n    let cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = Object.assign({}, layering);\n      bestCC = cc;\n    } else if (cc === bestCC) {\n      best = structuredClone(layering);\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  // Build an index mapping from rank to the nodes with that rank.\n  // This helps to avoid a quadratic search for all nodes with the same rank as\n  // the current node.\n  const nodesByRank = new Map();\n  const addNodeToRank = (rank, node) => {\n    if (!nodesByRank.has(rank)) {\n      nodesByRank.set(rank, []);\n    }\n    nodesByRank.get(rank).push(node);\n  };\n\n  // Visit the nodes in their original order in the graph, and add each\n  // node to the ranks(s) that it belongs to.\n  for (const v of g.nodes()) {\n    const node = g.node(v);\n    if (typeof node.rank === \"number\") {\n      addNodeToRank(node.rank, v);\n    }\n    // If there is a range of ranks, add it to each, but skip the `node.rank` which\n    // has already had the node added.\n    if (typeof node.minRank === \"number\" && typeof node.maxRank === \"number\") {\n      for (let r = node.minRank; r <= node.maxRank; r++) {\n        if (r !== node.rank) {\n          // Don't add this node to its `node.rank` twice.\n          addNodeToRank(r, v);\n        }\n      }\n    }\n  }\n\n  return ranks.map(function (rank) {\n    return buildLayerGraph(g, rank, relationship, nodesByRank.get(rank) || []);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight, constraints) {\n  let cg = new Graph();\n  layerGraphs.forEach(function(lg) {\n    constraints.forEach(con => cg.setEdge(con.left, con.right));\n\n    let root = lg.graph().root;\n    let sorted = sortSubgraph(lg, root, cg, biasRight);\n    sorted.vs.forEach((v, i) => lg.node(v).order = i);\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  Object.values(layering).forEach(layer => layer.forEach((v, i) => g.node(v).order = i));\n}\n", "\"use strict\";\n\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and K\u00F6pf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: balance\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  let conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    let\n      // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = layer[layer.length - 1];\n\n    layer.forEach((v, i) => {\n      let w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        layer.slice(scanPos, i+1).forEach(scanNode => {\n          g.predecessors(scanNode).forEach(u => {\n            let uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  layering.length && layering.reduce(visitLayer);\n\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  let conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    let v;\n    util.range(southPos, southEnd).forEach(i => {\n      v = south[i];\n      if (g.node(v).dummy) {\n        g.predecessors(v).forEach(u => {\n          let uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    let prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    south.forEach((v, southLookahead) => {\n      if (g.node(v).dummy === \"border\") {\n        let predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  layering.length && layering.reduce(visitLayer);\n\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return g.predecessors(v).find(u => g.node(u).dummy);\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    let tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  let conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    let tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return !!conflicts[v] && Object.hasOwn(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  let root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  layering.forEach(layer => {\n    layer.forEach((v, order) => {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  layering.forEach(layer => {\n    let prevIdx = -1;\n    layer.forEach(v => {\n      let ws = neighborFn(v);\n      if (ws.length) {\n        ws = ws.sort((a, b) => pos[a] - pos[b]);\n        let mp = (ws.length - 1) / 2;\n        for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          let w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  let xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    const stack = blockG.nodes().slice(); // Create a copy of the node list.\n    const visited = {};\n    let elem = stack.pop();\n\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        // Put the element back into the stack, so that we can process it\n        // again after all of the `nextNodesFunc` items are processed.\n        stack.push(elem);\n        for (const nextElem of nextNodesFunc(elem)) {\n          stack.push(nextElem);\n        }\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce((acc, e) => {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    let min = blockG.outEdges(elem).reduce((acc, e) => {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    let node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  Object.keys(align).forEach(v => xs[v] = xs[root[v]]);\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  let blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  layering.forEach(layer => {\n    let u;\n    layer.forEach(v => {\n      let vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return Object.values(xss).reduce((currentMinAndXs, xs) => {\n    let max = Number.NEGATIVE_INFINITY;\n    let min = Number.POSITIVE_INFINITY;\n\n    Object.entries(xs).forEach(([v, x]) => {\n      let halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    const newMin = max - min;\n    if (newMin < currentMinAndXs[0]) {\n      currentMinAndXs = [newMin, xs];\n    }\n    return currentMinAndXs;\n  }, [Number.POSITIVE_INFINITY, null])[1];\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  let alignToVals = Object.values(alignTo),\n    alignToMin = util.applyWithChunking(Math.min, alignToVals),\n    alignToMax = util.applyWithChunking(Math.max, alignToVals);\n\n  [\"u\", \"d\"].forEach(vert => {\n    [\"l\", \"r\"].forEach(horiz => {\n      let alignment = vert + horiz,\n        xs = xss[alignment];\n\n      if (xs === alignTo) return;\n\n      let xsVals = Object.values(xs);\n      let delta = alignToMin - util.applyWithChunking(Math.min, xsVals);\n      if (horiz !== \"l\") {\n        delta = alignToMax - util.applyWithChunking(Math.max,xsVals);\n      }\n\n      if (delta) {\n        xss[alignment] = util.mapValues(xs, x => x + delta);\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return util.mapValues(xss.ul, (num, v) => {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      let xs = Object.values(xss).map(xs => xs[v]).sort((a, b) => a - b);\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  let layering = util.buildLayerMatrix(g);\n  let conflicts = Object.assign(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  let xss = {};\n  let adjustedLayering;\n  [\"u\", \"d\"].forEach(vert => {\n    adjustedLayering = vert === \"u\" ? layering : Object.values(layering).reverse();\n    [\"l\", \"r\"].forEach(horiz => {\n      if (horiz === \"r\") {\n        adjustedLayering = adjustedLayering.map(inner => {\n          return Object.values(inner).reverse();\n        });\n      }\n\n      let neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      let align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      let xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = util.mapValues(xs, x => -x);\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n\n  let smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return (g, v, w) => {\n    let vLabel = g.node(v);\n    let wLabel = g.node(w);\n    let sum = 0;\n    let delta;\n\n    sum += vLabel.width / 2;\n    if (Object.hasOwn(vLabel, \"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (Object.hasOwn(wLabel, \"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n", "\"use strict\";\n\nlet util = require(\"../util\");\nlet positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  Object.entries(positionX(g)).forEach(([v, x]) => g.node(v).x = x);\n}\n\nfunction positionY(g) {\n  let layering = util.buildLayerMatrix(g);\n  let rankSep = g.graph().ranksep;\n  let prevY = 0;\n  layering.forEach(layer => {\n    const maxHeight = layer.reduce((acc, v) => {\n      const height = g.node(v).height;\n      if (acc > height) {\n        return acc;\n      } else {\n        return height;\n      }\n    }, 0);\n    layer.forEach(v => g.node(v).y = prevY + maxHeight / 2);\n    prevY += maxHeight + rankSep;\n  });\n}\n\n", "\"use strict\";\n\nlet acyclic = require(\"./acyclic\");\nlet normalize = require(\"./normalize\");\nlet rank = require(\"./rank\");\nlet normalizeRanks = require(\"./util\").normalizeRanks;\nlet parentDummyChains = require(\"./parent-dummy-chains\");\nlet removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nlet nestingGraph = require(\"./nesting-graph\");\nlet addBorderSegments = require(\"./add-border-segments\");\nlet coordinateSystem = require(\"./coordinate-system\");\nlet order = require(\"./order\");\nlet position = require(\"./position\");\nlet util = require(\"./util\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts = {}) {\n  const time = opts.debugTiming ? util.time : util.notime;\n  return time(\"layout\", () => {\n    let layoutGraph =\n      time(\"  buildLayoutGraph\", () => buildLayoutGraph(g));\n    time(\"  runLayout\",        () => runLayout(layoutGraph, time, opts));\n    time(\"  updateInputGraph\", () => updateInputGraph(g, layoutGraph));\n    return layoutGraph;\n  });\n}\n\nfunction runLayout(g, time, opts) {\n  time(\"    makeSpaceForEdgeLabels\", () => makeSpaceForEdgeLabels(g));\n  time(\"    removeSelfEdges\",        () => removeSelfEdges(g));\n  time(\"    acyclic\",                () => acyclic.run(g));\n  time(\"    nestingGraph.run\",       () => nestingGraph.run(g));\n  time(\"    rank\",                   () => rank(util.asNonCompoundGraph(g)));\n  time(\"    injectEdgeLabelProxies\", () => injectEdgeLabelProxies(g));\n  time(\"    removeEmptyRanks\",       () => removeEmptyRanks(g));\n  time(\"    nestingGraph.cleanup\",   () => nestingGraph.cleanup(g));\n  time(\"    normalizeRanks\",         () => normalizeRanks(g));\n  time(\"    assignRankMinMax\",       () => assignRankMinMax(g));\n  time(\"    removeEdgeLabelProxies\", () => removeEdgeLabelProxies(g));\n  time(\"    normalize.run\",          () => normalize.run(g));\n  time(\"    parentDummyChains\",      () => parentDummyChains(g));\n  time(\"    addBorderSegments\",      () => addBorderSegments(g));\n  time(\"    order\",                  () => order(g, opts));\n  time(\"    insertSelfEdges\",        () => insertSelfEdges(g));\n  time(\"    adjustCoordinateSystem\", () => coordinateSystem.adjust(g));\n  time(\"    position\",               () => position(g));\n  time(\"    positionSelfEdges\",      () => positionSelfEdges(g));\n  time(\"    removeBorderNodes\",      () => removeBorderNodes(g));\n  time(\"    normalize.undo\",         () => normalize.undo(g));\n  time(\"    fixupEdgeLabelCoords\",   () => fixupEdgeLabelCoords(g));\n  time(\"    undoCoordinateSystem\",   () => coordinateSystem.undo(g));\n  time(\"    translateGraph\",         () => translateGraph(g));\n  time(\"    assignNodeIntersects\",   () => assignNodeIntersects(g));\n  time(\"    reversePoints\",          () => reversePointsForReversedEdges(g));\n  time(\"    acyclic.undo\",           () => acyclic.undo(g));\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  inputGraph.nodes().forEach(v => {\n    let inputLabel = inputGraph.node(v);\n    let layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n      inputLabel.order = layoutLabel.order;\n      inputLabel.rank = layoutLabel.rank;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  inputGraph.edges().forEach(e => {\n    let inputLabel = inputGraph.edge(e);\n    let layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (Object.hasOwn(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nlet graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nlet graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nlet graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nlet nodeNumAttrs = [\"width\", \"height\", \"rank\"];\nlet nodeDefaults = { width: 0, height: 0 };\nlet edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nlet edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nlet edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  let g = new Graph({ multigraph: true, compound: true });\n  let graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(Object.assign({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    util.pick(graph, graphAttrs)));\n\n  inputGraph.nodes().forEach(v => {\n    let node = canonicalize(inputGraph.node(v));\n    const newNode = selectNumberAttrs(node, nodeNumAttrs);\n    Object.keys(nodeDefaults).forEach(k => {\n      if (newNode[k] === undefined) {\n        newNode[k] = nodeDefaults[k];\n      }\n    });\n\n    g.setNode(v, newNode);\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  inputGraph.edges().forEach(e => {\n    let edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, Object.assign({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      util.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  let graph = g.graph();\n  graph.ranksep /= 2;\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.width && edge.height) {\n      let v = g.node(e.v);\n      let w = g.node(e.w);\n      let label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  let maxRank = 0;\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = Math.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  let minX = Number.POSITIVE_INFINITY;\n  let maxX = 0;\n  let minY = Number.POSITIVE_INFINITY;\n  let maxY = 0;\n  let graphLabel = g.graph();\n  let marginX = graphLabel.marginx || 0;\n  let marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    let x = attrs.x;\n    let y = attrs.y;\n    let w = attrs.width;\n    let h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  g.nodes().forEach(v => getExtremes(g.node(v)));\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (Object.hasOwn(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(p => {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (Object.hasOwn(edge, \"x\")) { edge.x -= minX; }\n    if (Object.hasOwn(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    let nodeV = g.node(e.v);\n    let nodeW = g.node(e.w);\n    let p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (Object.hasOwn(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  g.nodes().forEach(v => {\n    if (g.children(v).length) {\n      let node = g.node(v);\n      let t = g.node(node.borderTop);\n      let b = g.node(node.borderBottom);\n      let l = g.node(node.borderLeft[node.borderLeft.length - 1]);\n      let r = g.node(node.borderRight[node.borderRight.length - 1]);\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  g.nodes().forEach(v => {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  g.edges().forEach(e => {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  layers.forEach(layer => {\n    var orderShift = 0;\n    layer.forEach((v, i) => {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      (node.selfEdges || []).forEach(selfEdge => {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  g.nodes().forEach(v => {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return util.mapValues(util.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  if (attrs) {\n    Object.entries(attrs).forEach(([k, v]) => {\n      if (typeof k === \"string\") {\n        k = k.toLowerCase();\n      }\n\n      newAttrs[k] = v;\n    });\n  }\n  return newAttrs;\n}\n", "let util = require(\"./util\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  let layerMatrix = util.buildLayerMatrix(g);\n\n  let h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  g.nodes().forEach(v => {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  g.edges().forEach(e => h.setEdge(e.v, e.w, {}, e.name));\n\n  layerMatrix.forEach((layer, i) => {\n    let layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    layer.reduce((u, v) => {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n", "module.exports = \"2.0.3\";\n", "/*\n@license\n\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"@dagrejs/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n"],
-  "mappings": "2WAAA,IAAAA,EAAAC,EAAA,CAAAC,GAAAC,IAAA,CAKA,IAAMC,EAAN,KAAW,CACT,aAAc,CACZ,IAAIC,EAAW,CAAC,EAChBA,EAAS,MAAQA,EAAS,MAAQA,EAClC,KAAK,UAAYA,CACnB,CAEA,SAAU,CACR,IAAIA,EAAW,KAAK,UAChBC,EAAQD,EAAS,MACrB,GAAIC,IAAUD,EACZ,OAAAE,EAAOD,CAAK,EACLA,CAEX,CAEA,QAAQA,EAAO,CACb,IAAID,EAAW,KAAK,UAChBC,EAAM,OAASA,EAAM,OACvBC,EAAOD,CAAK,EAEdA,EAAM,MAAQD,EAAS,MACvBA,EAAS,MAAM,MAAQC,EACvBD,EAAS,MAAQC,EACjBA,EAAM,MAAQD,CAChB,CAEA,UAAW,CACT,IAAIG,EAAO,CAAC,EACRH,EAAW,KAAK,UAChBI,EAAOJ,EAAS,MACpB,KAAOI,IAASJ,GACdG,EAAK,KAAK,KAAK,UAAUC,EAAMC,EAAc,CAAC,EAC9CD,EAAOA,EAAK,MAEd,MAAO,IAAMD,EAAK,KAAK,IAAI,EAAI,GACjC,CACF,EAEA,SAASD,EAAOD,EAAO,CACrBA,EAAM,MAAM,MAAQA,EAAM,MAC1BA,EAAM,MAAM,MAAQA,EAAM,MAC1B,OAAOA,EAAM,MACb,OAAOA,EAAM,KACf,CAEA,SAASI,GAAeC,EAAGC,EAAG,CAC5B,GAAID,IAAM,SAAWA,IAAM,QACzB,OAAOC,CAEX,CAEAT,EAAO,QAAUC,ICzDjB,IAAAS,EAAAC,EAAA,CAAAC,GAAAC,IAAA,KAAIC,GAAQ,EAAQ,mBAAmB,EAAE,MACrCC,GAAO,IASXF,EAAO,QAAUG,GAEjB,IAAIC,GAAoB,IAAM,EAE9B,SAASD,GAAUE,EAAGC,EAAU,CAC9B,GAAID,EAAE,UAAU,GAAK,EACnB,MAAO,CAAC,EAEV,IAAIE,EAAQC,GAAWH,EAAGC,GAAYF,EAAiB,EAIvD,OAHcK,GAAYF,EAAM,MAAOA,EAAM,QAASA,EAAM,OAAO,EAGpD,QAAQG,GAAKL,EAAE,SAASK,EAAE,EAAGA,EAAE,CAAC,CAAC,CAClD,CAEA,SAASD,GAAYJ,EAAGM,EAASC,EAAS,CACxC,IAAIC,EAAU,CAAC,EACXC,EAAUH,EAAQA,EAAQ,OAAS,CAAC,EACpCI,EAAQJ,EAAQ,CAAC,EAEjBK,EACJ,KAAOX,EAAE,UAAU,GAAG,CACpB,KAAQW,EAAQD,EAAM,QAAQ,GAAQE,EAAWZ,EAAGM,EAASC,EAASI,CAAK,EAC3E,KAAQA,EAAQF,EAAQ,QAAQ,GAAMG,EAAWZ,EAAGM,EAASC,EAASI,CAAK,EAC3E,GAAIX,EAAE,UAAU,GACd,QAASa,EAAIP,EAAQ,OAAS,EAAGO,EAAI,EAAG,EAAEA,EAExC,GADAF,EAAQL,EAAQO,CAAC,EAAE,QAAQ,EACvBF,EAAO,CACTH,EAAUA,EAAQ,OAAOI,EAAWZ,EAAGM,EAASC,EAASI,EAAO,EAAI,CAAC,EACrE,KACF,EAGN,CAEA,OAAOH,CACT,CAEA,SAASI,EAAWZ,EAAGM,EAASC,EAASI,EAAOG,EAAqB,CACnE,IAAIN,EAAUM,EAAsB,CAAC,EAAI,OAEzC,OAAAd,EAAE,QAAQW,EAAM,CAAC,EAAE,QAAQI,GAAQ,CACjC,IAAIC,EAAShB,EAAE,KAAKe,CAAI,EACpBE,EAASjB,EAAE,KAAKe,EAAK,CAAC,EAEtBD,GACFN,EAAQ,KAAK,CAAE,EAAGO,EAAK,EAAG,EAAGA,EAAK,CAAE,CAAC,EAGvCE,EAAO,KAAOD,EACdE,EAAaZ,EAASC,EAASU,CAAM,CACvC,CAAC,EAEDjB,EAAE,SAASW,EAAM,CAAC,EAAE,QAAQI,GAAQ,CAClC,IAAIC,EAAShB,EAAE,KAAKe,CAAI,EACpBI,EAAIJ,EAAK,EACTK,EAASpB,EAAE,KAAKmB,CAAC,EACrBC,EAAO,IAASJ,EAChBE,EAAaZ,EAASC,EAASa,CAAM,CACvC,CAAC,EAEDpB,EAAE,WAAWW,EAAM,CAAC,EAEbH,CACT,CAEA,SAASL,GAAWH,EAAGC,EAAU,CAC/B,IAAIoB,EAAW,IAAIzB,GACf0B,EAAQ,EACRC,EAAS,EAEbvB,EAAE,MAAM,EAAE,QAAQwB,GAAK,CACrBH,EAAS,QAAQG,EAAG,CAAE,EAAGA,EAAG,GAAM,EAAG,IAAK,CAAE,CAAC,CAC/C,CAAC,EAIDxB,EAAE,MAAM,EAAE,QAAQK,GAAK,CACrB,IAAIoB,EAAaJ,EAAS,KAAKhB,EAAE,EAAGA,EAAE,CAAC,GAAK,EACxCW,EAASf,EAASI,CAAC,EACnBqB,EAAaD,EAAaT,EAC9BK,EAAS,QAAQhB,EAAE,EAAGA,EAAE,EAAGqB,CAAU,EACrCH,EAAS,KAAK,IAAIA,EAAQF,EAAS,KAAKhB,EAAE,CAAC,EAAE,KAAOW,CAAM,EAC1DM,EAAS,KAAK,IAAIA,EAAQD,EAAS,KAAKhB,EAAE,CAAC,EAAE,IAAUW,CAAM,CAC/D,CAAC,EAED,IAAIV,EAAUqB,GAAMJ,EAASD,EAAQ,CAAC,EAAE,IAAI,IAAM,IAAIzB,EAAM,EACxDU,EAAUe,EAAQ,EAEtB,OAAAD,EAAS,MAAM,EAAE,QAAQG,GAAK,CAC5BN,EAAaZ,EAASC,EAASc,EAAS,KAAKG,CAAC,CAAC,CACjD,CAAC,EAEM,CAAE,MAAOH,EAAU,QAASf,EAAS,QAASC,CAAQ,CAC/D,CAEA,SAASW,EAAaZ,EAASC,EAASI,EAAO,CACxCA,EAAM,IAECA,EAAM,GAGhBL,EAAQK,EAAM,IAAMA,EAAM,GAAQJ,CAAO,EAAE,QAAQI,CAAK,EAFxDL,EAAQA,EAAQ,OAAS,CAAC,EAAE,QAAQK,CAAK,EAFzCL,EAAQ,CAAC,EAAE,QAAQK,CAAK,CAM5B,CAEA,SAASgB,GAAMC,EAAO,CACpB,IAAMD,EAAQ,CAAC,EACf,QAASd,EAAI,EAAGA,EAAIe,EAAOf,IACzBc,EAAM,KAAKd,CAAC,EAGd,OAAOc,CACT,IC3HA,IAAAE,EAAAC,EAAA,CAAAC,GAAAC,IAAA,cAIA,IAAIC,EAAQ,EAAQ,mBAAmB,EAAE,MAEzCD,EAAO,QAAU,CACf,cAAAE,GACA,aAAAC,EACA,kBAAAC,EACA,mBAAAC,GACA,iBAAAC,GACA,cAAAC,GACA,UAAAC,GACA,QAAAC,EACA,eAAAC,GACA,OAAAC,GACA,UAAAC,GACA,KAAAC,GACA,mBAAAC,GACA,MAAAC,EACA,iBAAAC,GACA,SAAAC,GACA,iBAAAC,GACA,KAAAC,GACA,SAAAC,EACA,UAAAC,CACF,EAKA,SAASlB,EAAamB,EAAGC,EAAMC,EAAOC,EAAM,CAE1C,QADIC,EAAID,EACDH,EAAE,QAAQI,CAAC,GAChBA,EAAIN,EAASK,CAAI,EAGnB,OAAAD,EAAM,MAAQD,EACdD,EAAE,QAAQI,EAAGF,CAAK,EACXE,CACT,CAMA,SAAST,GAASK,EAAG,CACnB,IAAIK,EAAa,IAAI1B,EAAM,EAAE,SAASqB,EAAE,MAAM,CAAC,EAC/C,OAAAA,EAAE,MAAM,EAAE,QAAQI,GAAKC,EAAW,QAAQD,EAAGJ,EAAE,KAAKI,CAAC,CAAC,CAAC,EACvDJ,EAAE,MAAM,EAAE,QAAQM,GAAK,CACrB,IAAIC,EAAcF,EAAW,KAAKC,EAAE,EAAGA,EAAE,CAAC,GAAK,CAAE,OAAQ,EAAG,OAAQ,CAAE,EAClEE,EAAQR,EAAE,KAAKM,CAAC,EACpBD,EAAW,QAAQC,EAAE,EAAGA,EAAE,EAAG,CAC3B,OAAQC,EAAY,OAASC,EAAM,OACnC,OAAQ,KAAK,IAAID,EAAY,OAAQC,EAAM,MAAM,CACnD,CAAC,CACH,CAAC,EACMH,CACT,CAEA,SAAStB,GAAmBiB,EAAG,CAC7B,IAAIK,EAAa,IAAI1B,EAAM,CAAE,WAAYqB,EAAE,aAAa,CAAE,CAAC,EAAE,SAASA,EAAE,MAAM,CAAC,EAC/E,OAAAA,EAAE,MAAM,EAAE,QAAQI,GAAK,CAChBJ,EAAE,SAASI,CAAC,EAAE,QACjBC,EAAW,QAAQD,EAAGJ,EAAE,KAAKI,CAAC,CAAC,CAEnC,CAAC,EACDJ,EAAE,MAAM,EAAE,QAAQM,GAAK,CACrBD,EAAW,QAAQC,EAAGN,EAAE,KAAKM,CAAC,CAAC,CACjC,CAAC,EACMD,CACT,CAEA,SAAST,GAAiBI,EAAG,CAC3B,IAAIS,EAAYT,EAAE,MAAM,EAAE,IAAII,GAAK,CACjC,IAAIM,EAAO,CAAC,EACZ,OAAAV,EAAE,SAASI,CAAC,EAAE,QAAQE,GAAK,CACzBI,EAAKJ,EAAE,CAAC,GAAKI,EAAKJ,EAAE,CAAC,GAAK,GAAKN,EAAE,KAAKM,CAAC,EAAE,MAC3C,CAAC,EACMI,CACT,CAAC,EACD,OAAOX,EAAUC,EAAE,MAAM,EAAGS,CAAS,CACvC,CAEA,SAASjB,GAAmBQ,EAAG,CAC7B,IAAIS,EAAYT,EAAE,MAAM,EAAE,IAAII,GAAK,CACjC,IAAIO,EAAQ,CAAC,EACb,OAAAX,EAAE,QAAQI,CAAC,EAAE,QAAQE,GAAK,CACxBK,EAAML,EAAE,CAAC,GAAKK,EAAML,EAAE,CAAC,GAAK,GAAKN,EAAE,KAAKM,CAAC,EAAE,MAC7C,CAAC,EACMK,CACT,CAAC,EACD,OAAOZ,EAAUC,EAAE,MAAM,EAAGS,CAAS,CACvC,CAMA,SAASxB,GAAc2B,EAAMC,EAAO,CAClC,IAAIC,EAAIF,EAAK,EACTG,EAAIH,EAAK,EAITI,EAAKH,EAAM,EAAIC,EACfG,EAAKJ,EAAM,EAAIE,EACfG,EAAIN,EAAK,MAAQ,EACjBO,EAAIP,EAAK,OAAS,EAEtB,GAAI,CAACI,GAAM,CAACC,EACV,MAAM,IAAI,MAAM,2DAA2D,EAG7E,IAAIG,EAAIC,EACR,OAAI,KAAK,IAAIJ,CAAE,EAAIC,EAAI,KAAK,IAAIF,CAAE,EAAIG,GAEhCF,EAAK,IACPE,EAAI,CAACA,GAEPC,EAAKD,EAAIH,EAAKC,EACdI,EAAKF,IAGDH,EAAK,IACPE,EAAI,CAACA,GAEPE,EAAKF,EACLG,EAAKH,EAAID,EAAKD,GAGT,CAAE,EAAGF,EAAIM,EAAI,EAAGL,EAAIM,CAAG,CAChC,CAMA,SAASrC,GAAiBgB,EAAG,CAC3B,IAAIsB,EAAW7B,EAAMN,EAAQa,CAAC,EAAI,CAAC,EAAE,IAAI,IAAM,CAAC,CAAC,EACjD,OAAAA,EAAE,MAAM,EAAE,QAAQI,GAAK,CACrB,IAAImB,EAAOvB,EAAE,KAAKI,CAAC,EACfoB,EAAOD,EAAK,KACZC,IAAS,SACXF,EAASE,CAAI,EAAED,EAAK,KAAK,EAAInB,EAEjC,CAAC,EACMkB,CACT,CAMA,SAASlC,GAAeY,EAAG,CACzB,IAAIyB,EAAYzB,EAAE,MAAM,EAAE,IAAII,GAAK,CACjC,IAAIoB,EAAOxB,EAAE,KAAKI,CAAC,EAAE,KACrB,OAAIoB,IAAS,OACJ,OAAO,UAGTA,CACT,CAAC,EACGE,EAAM5C,EAAkB,KAAK,IAAK2C,CAAS,EAC/CzB,EAAE,MAAM,EAAE,QAAQI,GAAK,CACrB,IAAImB,EAAOvB,EAAE,KAAKI,CAAC,EACf,OAAO,OAAOmB,EAAM,MAAM,IAC5BA,EAAK,MAAQG,EAEjB,CAAC,CACH,CAEA,SAAShC,GAAiBM,EAAG,CAE3B,IAAIyB,EAAYzB,EAAE,MAAM,EAAE,IAAII,GAAKJ,EAAE,KAAKI,CAAC,EAAE,IAAI,EAAE,OAAOoB,GAAQA,IAAS,MAAS,EAChFG,EAAS7C,EAAkB,KAAK,IAAK2C,CAAS,EAE9CG,EAAS,CAAC,EACd5B,EAAE,MAAM,EAAE,QAAQI,GAAK,CACrB,IAAIoB,EAAOxB,EAAE,KAAKI,CAAC,EAAE,KAAOuB,EACvBC,EAAOJ,CAAI,IACdI,EAAOJ,CAAI,EAAI,CAAC,GAElBI,EAAOJ,CAAI,EAAE,KAAKpB,CAAC,CACrB,CAAC,EAED,IAAIyB,EAAQ,EACRC,EAAiB9B,EAAE,MAAM,EAAE,eAC/B,MAAM,KAAK4B,CAAM,EAAE,QAAQ,CAACG,EAAIC,IAAM,CAChCD,IAAO,QAAaC,EAAIF,IAAmB,EAC7C,EAAED,EACOE,IAAO,QAAaF,GAC7BE,EAAG,QAAQ3B,GAAKJ,EAAE,KAAKI,CAAC,EAAE,MAAQyB,CAAK,CAE3C,CAAC,CACH,CAEA,SAASjD,GAAcoB,EAAGiC,EAAQT,EAAMU,EAAO,CAC7C,IAAIX,EAAO,CACT,MAAO,EACP,OAAQ,CACV,EACA,OAAI,UAAU,QAAU,IACtBA,EAAK,KAAOC,EACZD,EAAK,MAAQW,GAERrD,EAAamB,EAAG,SAAUuB,EAAMU,CAAM,CAC/C,CAEA,SAASE,GAAcC,EAAOC,EAAYC,EAAoB,CAC5D,IAAMC,EAAS,CAAC,EAChB,QAASP,EAAI,EAAGA,EAAII,EAAM,OAAQJ,GAAKK,EAAW,CAChD,IAAMG,EAAQJ,EAAM,MAAMJ,EAAGA,EAAIK,CAAS,EAC1CE,EAAO,KAAKC,CAAK,CACnB,CACA,OAAOD,CACT,CAEA,IAAMD,EAAqB,MAE3B,SAASxD,EAAkB2D,EAAIC,EAAW,CACxC,GAAGA,EAAU,OAASJ,EAAoB,CACxC,IAAMC,EAASJ,GAAcO,CAAS,EACtC,OAAOD,EAAG,MAAM,KAAMF,EAAO,IAAIC,GAASC,EAAG,MAAM,KAAMD,CAAK,CAAC,CAAC,CAClE,KACE,QAAOC,EAAG,MAAM,KAAMC,CAAS,CAEnC,CAEA,SAASvD,EAAQa,EAAG,CAElB,IAAMyB,EADQzB,EAAE,MAAM,EACE,IAAII,GAAK,CAC/B,IAAIoB,EAAOxB,EAAE,KAAKI,CAAC,EAAE,KACrB,OAAIoB,IAAS,OACJ,OAAO,UAETA,CACT,CAAC,EAED,OAAO1C,EAAkB,KAAK,IAAK2C,CAAS,CAC9C,CAOA,SAASnC,GAAUqD,EAAYF,EAAI,CACjC,IAAIG,EAAS,CAAE,IAAK,CAAC,EAAG,IAAK,CAAC,CAAE,EAChC,OAAAD,EAAW,QAAQE,GAAS,CACtBJ,EAAGI,CAAK,EACVD,EAAO,IAAI,KAAKC,CAAK,EAErBD,EAAO,IAAI,KAAKC,CAAK,CAEzB,CAAC,EACMD,CACT,CAMA,SAAS/C,GAAKM,EAAMsC,EAAI,CACtB,IAAIK,EAAQ,KAAK,IAAI,EACrB,GAAI,CACF,OAAOL,EAAG,CACZ,QAAE,CACA,QAAQ,IAAItC,EAAO,WAAa,KAAK,IAAI,EAAI2C,GAAS,IAAI,CAC5D,CACF,CAEA,SAASzD,GAAOc,EAAMsC,EAAI,CACxB,OAAOA,EAAG,CACZ,CAEA,IAAIM,GAAY,EAChB,SAASjD,EAASmC,EAAQ,CACxB,IAAIe,EAAK,EAAED,GACX,OAAOd,GAAU,GAAKe,EACxB,CAEA,SAASvD,EAAMqD,EAAOG,EAAOC,EAAO,EAAG,CACjCD,GAAS,OACXA,EAAQH,EACRA,EAAQ,GAGV,IAAIK,EAAUnB,GAAMA,EAAIiB,EACpBC,EAAO,IACTC,EAAUnB,GAAMiB,EAAQjB,GAG1B,IAAMvC,EAAQ,CAAC,EACf,QAASuC,EAAIc,EAAOK,EAAOnB,CAAC,EAAGA,GAAKkB,EAClCzD,EAAM,KAAKuC,CAAC,EAGd,OAAOvC,CACT,CAEA,SAASF,GAAK6D,EAAQC,EAAM,CAC1B,IAAMC,EAAO,CAAC,EACd,QAAWC,KAAOF,EACZD,EAAOG,CAAG,IAAM,SAClBD,EAAKC,CAAG,EAAIH,EAAOG,CAAG,GAI1B,OAAOD,CACT,CAEA,SAASpE,GAAUsE,EAAKC,EAAY,CAClC,IAAIC,EAAOD,EACX,OAAI,OAAOA,GAAe,WACxBC,EAAQC,GAAQA,EAAIF,CAAU,GAGzB,OAAO,QAAQD,CAAG,EAAE,OAAO,CAACI,EAAK,CAACC,EAAGzD,CAAC,KAC3CwD,EAAIC,CAAC,EAAIH,EAAKtD,EAAGyD,CAAC,EACXD,GACN,CAAC,CAAC,CACP,CAEA,SAAS7D,EAAU+D,EAAOC,EAAQ,CAChC,OAAOD,EAAM,OAAO,CAACF,EAAKL,EAAK,KAC7BK,EAAIL,CAAG,EAAIQ,EAAO,CAAC,EACZH,GACN,CAAC,CAAC,CACP,IC1UA,IAAAI,GAAAC,EAAA,CAAAC,GAAAC,IAAA,cAEA,IAAIC,GAAY,IACZC,GAAW,IAAkB,SAEjCF,EAAO,QAAU,CACf,IAAKG,GACL,KAAMC,EACR,EAEA,SAASD,GAAIE,EAAG,EACHA,EAAE,MAAM,EAAE,YAAc,SAC/BJ,GAAUI,EAAGC,EAASD,CAAC,CAAC,EACxBE,GAAOF,CAAC,GACR,QAAQG,GAAK,CACf,IAAIC,EAAQJ,EAAE,KAAKG,CAAC,EACpBH,EAAE,WAAWG,CAAC,EACdC,EAAM,YAAcD,EAAE,KACtBC,EAAM,SAAW,GACjBJ,EAAE,QAAQG,EAAE,EAAGA,EAAE,EAAGC,EAAOP,GAAS,KAAK,CAAC,CAC5C,CAAC,EAED,SAASI,EAASD,EAAG,CACnB,OAAOG,GACEH,EAAE,KAAKG,CAAC,EAAE,MAErB,CACF,CAEA,SAASD,GAAOF,EAAG,CACjB,IAAIK,EAAM,CAAC,EACPC,EAAQ,CAAC,EACTC,EAAU,CAAC,EAEf,SAASC,EAAIC,EAAG,CACV,OAAO,OAAOF,EAASE,CAAC,IAG5BF,EAAQE,CAAC,EAAI,GACbH,EAAMG,CAAC,EAAI,GACXT,EAAE,SAASS,CAAC,EAAE,QAAQN,GAAK,CACrB,OAAO,OAAOG,EAAOH,EAAE,CAAC,EAC1BE,EAAI,KAAKF,CAAC,EAEVK,EAAIL,EAAE,CAAC,CAEX,CAAC,EACD,OAAOG,EAAMG,CAAC,EAChB,CAEA,OAAAT,EAAE,MAAM,EAAE,QAAQQ,CAAG,EACdH,CACT,CAEA,SAASN,GAAKC,EAAG,CACfA,EAAE,MAAM,EAAE,QAAQG,GAAK,CACrB,IAAIC,EAAQJ,EAAE,KAAKG,CAAC,EACpB,GAAIC,EAAM,SAAU,CAClBJ,EAAE,WAAWG,CAAC,EAEd,IAAIO,EAAcN,EAAM,YACxB,OAAOA,EAAM,SACb,OAAOA,EAAM,YACbJ,EAAE,QAAQG,EAAE,EAAGA,EAAE,EAAGC,EAAOM,CAAW,CACxC,CACF,CAAC,CACH,IClEA,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAO,IAEXD,GAAO,QAAU,CACf,IAAKE,GACL,KAAMC,EACR,EAkBA,SAASD,GAAIE,EAAG,CACdA,EAAE,MAAM,EAAE,YAAc,CAAC,EACzBA,EAAE,MAAM,EAAE,QAAQC,GAAQC,GAAcF,EAAGC,CAAI,CAAC,CAClD,CAEA,SAASC,GAAcF,EAAGG,EAAG,CAC3B,IAAIC,EAAID,EAAE,EACNE,EAAQL,EAAE,KAAKI,CAAC,EAAE,KAClBE,EAAIH,EAAE,EACNI,EAAQP,EAAE,KAAKM,CAAC,EAAE,KAClBE,EAAOL,EAAE,KACTM,EAAYT,EAAE,KAAKG,CAAC,EACpBO,EAAYD,EAAU,UAE1B,GAAIF,IAAUF,EAAQ,EAAG,OAEzBL,EAAE,WAAWG,CAAC,EAEd,IAAIQ,EAAOC,EAAOC,EAClB,IAAKA,EAAI,EAAG,EAAER,EAAOA,EAAQE,EAAO,EAAEM,EAAG,EAAER,EACzCI,EAAU,OAAS,CAAC,EACpBG,EAAQ,CACN,MAAO,EAAG,OAAQ,EAClB,UAAWH,EAAW,QAASN,EAC/B,KAAME,CACR,EACAM,EAAQd,GAAK,aAAaG,EAAG,OAAQY,EAAO,IAAI,EAC5CP,IAAUK,IACZE,EAAM,MAAQH,EAAU,MACxBG,EAAM,OAASH,EAAU,OACzBG,EAAM,MAAQ,aACdA,EAAM,SAAWH,EAAU,UAE7BT,EAAE,QAAQI,EAAGO,EAAO,CAAE,OAAQF,EAAU,MAAO,EAAGD,CAAI,EAClDK,IAAM,GACRb,EAAE,MAAM,EAAE,YAAY,KAAKW,CAAK,EAElCP,EAAIO,EAGNX,EAAE,QAAQI,EAAGE,EAAG,CAAE,OAAQG,EAAU,MAAO,EAAGD,CAAI,CACpD,CAEA,SAAST,GAAKC,EAAG,CACfA,EAAE,MAAM,EAAE,YAAY,QAAQI,GAAK,CACjC,IAAIU,EAAOd,EAAE,KAAKI,CAAC,EACfW,EAAYD,EAAK,UACjBR,EAEJ,IADAN,EAAE,QAAQc,EAAK,QAASC,CAAS,EAC1BD,EAAK,OACVR,EAAIN,EAAE,WAAWI,CAAC,EAAE,CAAC,EACrBJ,EAAE,WAAWI,CAAC,EACdW,EAAU,OAAO,KAAK,CAAE,EAAGD,EAAK,EAAG,EAAGA,EAAK,CAAE,CAAC,EAC1CA,EAAK,QAAU,eACjBC,EAAU,EAAID,EAAK,EACnBC,EAAU,EAAID,EAAK,EACnBC,EAAU,MAAQD,EAAK,MACvBC,EAAU,OAASD,EAAK,QAE1BV,EAAIE,EACJQ,EAAOd,EAAE,KAAKI,CAAC,CAEnB,CAAC,CACH,ICxFA,IAAAY,EAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,GAAM,CAAE,kBAAAC,EAAkB,EAAI,IAE9BD,GAAO,QAAU,CACf,YAAaE,GACb,MAAOC,EACT,EAuBA,SAASD,GAAYE,EAAG,CACtB,IAAIC,EAAU,CAAC,EAEf,SAASC,EAAIC,EAAG,CACd,IAAIC,EAAQJ,EAAE,KAAKG,CAAC,EACpB,GAAI,OAAO,OAAOF,EAASE,CAAC,EAC1B,OAAOC,EAAM,KAEfH,EAAQE,CAAC,EAAI,GAEb,IAAIE,EAAkBL,EAAE,SAASG,CAAC,EAAE,IAAIG,GAClCA,GAAK,KACA,OAAO,kBAGTJ,EAAII,EAAE,CAAC,EAAIN,EAAE,KAAKM,CAAC,EAAE,MAC7B,EAED,IAAIC,EAAOV,GAAkB,KAAK,IAAKQ,CAAe,EAEtD,OAAIE,IAAS,OAAO,oBAClBA,EAAO,GAGDH,EAAM,KAAOG,CACvB,CAEAP,EAAE,QAAQ,EAAE,QAAQE,CAAG,CACzB,CAMA,SAASH,GAAMC,EAAGM,EAAG,CACnB,OAAON,EAAE,KAAKM,EAAE,CAAC,EAAE,KAAON,EAAE,KAAKM,EAAE,CAAC,EAAE,KAAON,EAAE,KAAKM,CAAC,EAAE,MACzD,IClEA,IAAAE,EAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAQ,EAAQ,mBAAmB,EAAE,MACrCC,EAAQ,IAAkB,MAE9BF,GAAO,QAAUG,GA2BjB,SAASA,GAAaC,EAAG,CACvB,IAAI,EAAI,IAAIH,GAAM,CAAE,SAAU,EAAM,CAAC,EAGjCI,EAAQD,EAAE,MAAM,EAAE,CAAC,EACnBE,EAAOF,EAAE,UAAU,EACvB,EAAE,QAAQC,EAAO,CAAC,CAAC,EAGnB,QADIE,EAAMC,EACHC,GAAU,EAAGL,CAAC,EAAIE,GACvBC,EAAOG,GAAiB,EAAGN,CAAC,EAC5BI,EAAQ,EAAE,QAAQD,EAAK,CAAC,EAAIL,EAAME,EAAGG,CAAI,EAAI,CAACL,EAAME,EAAGG,CAAI,EAC3DI,GAAW,EAAGP,EAAGI,CAAK,EAGxB,OAAO,CACT,CAMA,SAASC,GAAUG,EAAGR,EAAG,CACvB,SAASS,EAAIC,EAAG,CACdV,EAAE,UAAUU,CAAC,EAAE,QAAQC,GAAK,CAC1B,IAAIC,EAAQD,EAAE,EACZE,EAAKH,IAAME,EAASD,EAAE,EAAIC,EACxB,CAACJ,EAAE,QAAQK,CAAC,GAAK,CAACf,EAAME,EAAGW,CAAC,IAC9BH,EAAE,QAAQK,EAAG,CAAC,CAAC,EACfL,EAAE,QAAQE,EAAGG,EAAG,CAAC,CAAC,EAClBJ,EAAII,CAAC,EAET,CAAC,CACH,CAEA,OAAAL,EAAE,MAAM,EAAE,QAAQC,CAAG,EACdD,EAAE,UAAU,CACrB,CAMA,SAASF,GAAiBE,EAAGR,EAAG,CAG9B,OAFcA,EAAE,MAAM,EAET,OAAO,CAACc,EAAKX,IAAS,CACjC,IAAIY,EAAY,OAAO,kBAKvB,OAJIP,EAAE,QAAQL,EAAK,CAAC,IAAMK,EAAE,QAAQL,EAAK,CAAC,IACxCY,EAAYjB,EAAME,EAAGG,CAAI,GAGvBY,EAAYD,EAAI,CAAC,EACZ,CAACC,EAAWZ,CAAI,EAGlBW,CACT,EAAG,CAAC,OAAO,kBAAmB,IAAI,CAAC,EAAE,CAAC,CACxC,CAEA,SAASP,GAAWC,EAAGR,EAAGI,EAAO,CAC/BI,EAAE,MAAM,EAAE,QAAQE,GAAKV,EAAE,KAAKU,CAAC,EAAE,MAAQN,CAAK,CAChD,IC9FA,IAAAY,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAe,IACfC,GAAQ,IAAkB,MAC1BC,GAAW,IAAkB,YAC7BC,GAAW,EAAQ,mBAAmB,EAAE,IAAI,SAC5CC,GAAY,EAAQ,mBAAmB,EAAE,IAAI,UAC7CC,GAAW,IAAmB,SAElCN,GAAO,QAAUO,EAGjBA,EAAe,iBAAmBC,EAClCD,EAAe,cAAgBE,EAC/BF,EAAe,aAAeG,GAC9BH,EAAe,UAAYI,GAC3BJ,EAAe,UAAYK,GAC3BL,EAAe,cAAgBM,GAmC/B,SAASN,EAAeO,EAAG,CACzBA,EAAIR,GAASQ,CAAC,EACdX,GAASW,CAAC,EACV,IAAI,EAAIb,GAAaa,CAAC,EACtBN,EAAiB,CAAC,EAClBC,EAAc,EAAGK,CAAC,EAGlB,QADIC,EAAGC,EACCD,EAAIJ,GAAU,CAAC,GACrBK,EAAIJ,GAAU,EAAGE,EAAGC,CAAC,EACrBF,GAAc,EAAGC,EAAGC,EAAGC,CAAC,CAE5B,CAKA,SAASP,EAAcQ,EAAGH,EAAG,CAC3B,IAAII,EAAKb,GAAUY,EAAGA,EAAE,MAAM,CAAC,EAC/BC,EAAKA,EAAG,MAAM,EAAGA,EAAG,OAAS,CAAC,EAC9BA,EAAG,QAAQC,GAAKC,GAAeH,EAAGH,EAAGK,CAAC,CAAC,CACzC,CAEA,SAASC,GAAeH,EAAGH,EAAGO,EAAO,CACnC,IAAIC,EAAWL,EAAE,KAAKI,CAAK,EACvBE,EAASD,EAAS,OACtBL,EAAE,KAAKI,EAAOE,CAAM,EAAE,SAAWb,GAAaO,EAAGH,EAAGO,CAAK,CAC3D,CAMA,SAASX,GAAaO,EAAGH,EAAGO,EAAO,CACjC,IAAIC,EAAWL,EAAE,KAAKI,CAAK,EACvBE,EAASD,EAAS,OAElBE,EAAc,GAEdC,EAAYX,EAAE,KAAKO,EAAOE,CAAM,EAEhCG,EAAW,EAEf,OAAKD,IACHD,EAAc,GACdC,EAAYX,EAAE,KAAKS,EAAQF,CAAK,GAGlCK,EAAWD,EAAU,OAErBX,EAAE,UAAUO,CAAK,EAAE,QAAQN,GAAK,CAC9B,IAAIY,EAAYZ,EAAE,IAAMM,EACtBO,EAAQD,EAAYZ,EAAE,EAAIA,EAAE,EAE9B,GAAIa,IAAUL,EAAQ,CACpB,IAAIM,EAAeF,IAAcH,EAC/BM,EAAchB,EAAE,KAAKC,CAAC,EAAE,OAG1B,GADAW,GAAYG,EAAeC,EAAc,CAACA,EACtCC,GAAWd,EAAGI,EAAOO,CAAK,EAAG,CAC/B,IAAII,EAAgBf,EAAE,KAAKI,EAAOO,CAAK,EAAE,SACzCF,GAAYG,EAAe,CAACG,EAAgBA,CAC9C,CACF,CACF,CAAC,EAEMN,CACT,CAEA,SAASlB,EAAiByB,EAAMC,EAAM,CAChC,UAAU,OAAS,IACrBA,EAAOD,EAAK,MAAM,EAAE,CAAC,GAEvBE,GAAgBF,EAAM,CAAC,EAAG,EAAGC,CAAI,CACnC,CAEA,SAASC,GAAgBF,EAAMG,EAASC,EAASlB,EAAGI,EAAQ,CAC1D,IAAIe,EAAMD,EACNE,EAAQN,EAAK,KAAKd,CAAC,EAEvB,OAAAiB,EAAQjB,CAAC,EAAI,GACbc,EAAK,UAAUd,CAAC,EAAE,QAAQqB,GAAK,CACxB,OAAO,OAAOJ,EAASI,CAAC,IAC3BH,EAAUF,GAAgBF,EAAMG,EAASC,EAASG,EAAGrB,CAAC,EAE1D,CAAC,EAEDoB,EAAM,IAAMD,EACZC,EAAM,IAAMF,IACRd,EACFgB,EAAM,OAAShB,EAGf,OAAOgB,EAAM,OAGRF,CACT,CAEA,SAAS1B,GAAUsB,EAAM,CACvB,OAAOA,EAAK,MAAM,EAAE,KAAKlB,GAAKkB,EAAK,KAAKlB,CAAC,EAAE,SAAW,CAAC,CACzD,CAEA,SAASH,GAAUK,EAAGH,EAAG2B,EAAM,CAC7B,IAAItB,EAAIsB,EAAK,EACTD,EAAIC,EAAK,EAKR3B,EAAE,QAAQK,EAAGqB,CAAC,IACjBrB,EAAIsB,EAAK,EACTD,EAAIC,EAAK,GAGX,IAAIC,EAASzB,EAAE,KAAKE,CAAC,EACjBwB,EAAS1B,EAAE,KAAKuB,CAAC,EACjBI,EAAYF,EACZG,EAAO,GAIPH,EAAO,IAAMC,EAAO,MACtBC,EAAYD,EACZE,EAAO,IAGT,IAAIC,EAAahC,EAAE,MAAM,EAAE,OAAO2B,GACzBI,IAASE,GAAa9B,EAAGA,EAAE,KAAKwB,EAAK,CAAC,EAAGG,CAAS,GAClDC,IAASE,GAAa9B,EAAGA,EAAE,KAAKwB,EAAK,CAAC,EAAGG,CAAS,CAC1D,EAED,OAAOE,EAAW,OAAO,CAACE,EAAKP,IACzBvC,GAAMY,EAAG2B,CAAI,EAAIvC,GAAMY,EAAGkC,CAAG,EACxBP,EAGFO,CACR,CACH,CAEA,SAASnC,GAAcI,EAAGH,EAAGC,EAAGC,EAAG,CACjC,IAAIG,EAAIJ,EAAE,EACNyB,EAAIzB,EAAE,EACVE,EAAE,WAAWE,EAAGqB,CAAC,EACjBvB,EAAE,QAAQD,EAAE,EAAGA,EAAE,EAAG,CAAC,CAAC,EACtBR,EAAiBS,CAAC,EAClBR,EAAcQ,EAAGH,CAAC,EAClBmC,GAAYhC,EAAGH,CAAC,CAClB,CAEA,SAASmC,GAAYhC,EAAGH,EAAG,CACzB,IAAIoB,EAAOjB,EAAE,MAAM,EAAE,KAAKE,GAAK,CAACL,EAAE,KAAKK,CAAC,EAAE,MAAM,EAC5CD,EAAKd,GAASa,EAAGiB,CAAI,EACzBhB,EAAKA,EAAG,MAAM,CAAC,EACfA,EAAG,QAAQC,GAAK,CACd,IAAII,EAASN,EAAE,KAAKE,CAAC,EAAE,OACrBsB,EAAO3B,EAAE,KAAKK,EAAGI,CAAM,EACvB2B,EAAU,GAEPT,IACHA,EAAO3B,EAAE,KAAKS,EAAQJ,CAAC,EACvB+B,EAAU,IAGZpC,EAAE,KAAKK,CAAC,EAAE,KAAOL,EAAE,KAAKS,CAAM,EAAE,MAAQ2B,EAAUT,EAAK,OAAS,CAACA,EAAK,OACxE,CAAC,CACH,CAKA,SAASV,GAAWE,EAAMkB,EAAGhC,EAAG,CAC9B,OAAOc,EAAK,QAAQkB,EAAGhC,CAAC,CAC1B,CAMA,SAAS4B,GAAad,EAAMS,EAAQU,EAAW,CAC7C,OAAOA,EAAU,KAAOV,EAAO,KAAOA,EAAO,KAAOU,EAAU,GAChE,IC1OA,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAW,IACXC,GAAcD,GAAS,YACvBE,GAAe,IACfC,GAAiB,KAErBJ,GAAO,QAAUK,GAqBjB,SAASA,GAAKC,EAAG,CACf,IAAIC,EAASD,EAAE,MAAM,EAAE,OACvB,GAAIC,aAAkB,SACpB,OAAOA,EAAOD,CAAC,EAGjB,OAAOA,EAAE,MAAM,EAAE,OAAQ,CACzB,IAAK,kBAAmBE,GAAqBF,CAAC,EAAG,MACjD,IAAK,aAAcG,GAAgBH,CAAC,EAAG,MACvC,IAAK,eAAgBI,GAAkBJ,CAAC,EAAG,MAC3C,IAAK,OAAQ,MACb,QAASE,GAAqBF,CAAC,CAC/B,CACF,CAGA,IAAII,GAAoBR,GAExB,SAASO,GAAgBH,EAAG,CAC1BJ,GAAYI,CAAC,EACbH,GAAaG,CAAC,CAChB,CAEA,SAASE,GAAqBF,EAAG,CAC/BF,GAAeE,CAAC,CAClB,ICrDA,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CAAAA,GAAO,QAAUC,GAEjB,SAASA,GAAkBC,EAAG,CAC5B,IAAIC,EAAgBC,GAAUF,CAAC,EAE/BA,EAAE,MAAM,EAAE,YAAY,QAAQG,GAAK,CACjC,IAAIC,EAAOJ,EAAE,KAAKG,CAAC,EACfE,EAAUD,EAAK,QACfE,EAAWC,GAASP,EAAGC,EAAeI,EAAQ,EAAGA,EAAQ,CAAC,EAC1DG,EAAOF,EAAS,KAChBG,EAAMH,EAAS,IACfI,EAAU,EACVC,EAAQH,EAAKE,CAAO,EACpBE,EAAY,GAEhB,KAAOT,IAAME,EAAQ,GAAG,CAGtB,GAFAD,EAAOJ,EAAE,KAAKG,CAAC,EAEXS,EAAW,CACb,MAAQD,EAAQH,EAAKE,CAAO,KAAOD,GAC5BT,EAAE,KAAKW,CAAK,EAAE,QAAUP,EAAK,MAClCM,IAGEC,IAAUF,IACZG,EAAY,GAEhB,CAEA,GAAI,CAACA,EAAW,CACd,KAAOF,EAAUF,EAAK,OAAS,GACxBR,EAAE,KAAKW,EAAQH,EAAKE,EAAU,CAAC,CAAC,EAAE,SAAWN,EAAK,MACvDM,IAEFC,EAAQH,EAAKE,CAAO,CACtB,CAEAV,EAAE,UAAUG,EAAGQ,CAAK,EACpBR,EAAIH,EAAE,WAAWG,CAAC,EAAE,CAAC,CACvB,CACF,CAAC,CACH,CAIA,SAASI,GAASP,EAAGC,EAAeE,EAAGU,EAAG,CACxC,IAAIC,EAAQ,CAAC,EACTC,EAAQ,CAAC,EACTC,EAAM,KAAK,IAAIf,EAAcE,CAAC,EAAE,IAAKF,EAAcY,CAAC,EAAE,GAAG,EACzDI,EAAM,KAAK,IAAIhB,EAAcE,CAAC,EAAE,IAAKF,EAAcY,CAAC,EAAE,GAAG,EACzDK,EACAT,EAGJS,EAASf,EACT,GACEe,EAASlB,EAAE,OAAOkB,CAAM,EACxBJ,EAAM,KAAKI,CAAM,QACVA,IACCjB,EAAciB,CAAM,EAAE,IAAMF,GAAOC,EAAMhB,EAAciB,CAAM,EAAE,MAKzE,IAJAT,EAAMS,EAGNA,EAASL,GACDK,EAASlB,EAAE,OAAOkB,CAAM,KAAOT,GACrCM,EAAM,KAAKG,CAAM,EAGnB,MAAO,CAAE,KAAMJ,EAAM,OAAOC,EAAM,QAAQ,CAAC,EAAG,IAAKN,CAAI,CACzD,CAEA,SAASP,GAAUF,EAAG,CACpB,IAAImB,EAAS,CAAC,EACVF,EAAM,EAEV,SAASG,EAAIjB,EAAG,CACd,IAAIa,EAAMC,EACVjB,EAAE,SAASG,CAAC,EAAE,QAAQiB,CAAG,EACzBD,EAAOhB,CAAC,EAAI,CAAE,IAAKa,EAAK,IAAKC,GAAM,CACrC,CACA,OAAAjB,EAAE,SAAS,EAAE,QAAQoB,CAAG,EAEjBD,CACT,ICnFA,IAAAE,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAIC,EAAO,IAEXD,GAAO,QAAU,CACf,IAAAE,GACA,QAAAC,EACF,EAyBA,SAASD,GAAIE,EAAG,CACd,IAAIC,EAAOJ,EAAK,aAAaG,EAAG,OAAQ,CAAC,EAAG,OAAO,EAC/CE,EAASC,GAAWH,CAAC,EACrBI,EAAY,OAAO,OAAOF,CAAM,EAChCG,EAASR,EAAK,kBAAkB,KAAK,IAAKO,CAAS,EAAI,EACvDE,EAAU,EAAID,EAAS,EAE3BL,EAAE,MAAM,EAAE,YAAcC,EAGxBD,EAAE,MAAM,EAAE,QAAQO,GAAKP,EAAE,KAAKO,CAAC,EAAE,QAAUD,CAAO,EAGlD,IAAIE,EAASC,GAAWT,CAAC,EAAI,EAG7BA,EAAE,SAAS,EAAE,QAAQU,GAASC,GAAIX,EAAGC,EAAMK,EAASE,EAAQH,EAAQH,EAAQQ,CAAK,CAAC,EAIlFV,EAAE,MAAM,EAAE,eAAiBM,CAC7B,CAEA,SAASK,GAAIX,EAAGC,EAAMK,EAASE,EAAQH,EAAQH,EAAQU,EAAG,CACxD,IAAIC,EAAWb,EAAE,SAASY,CAAC,EAC3B,GAAI,CAACC,EAAS,OAAQ,CAChBD,IAAMX,GACRD,EAAE,QAAQC,EAAMW,EAAG,CAAE,OAAQ,EAAG,OAAQN,CAAQ,CAAC,EAEnD,MACF,CAEA,IAAIQ,EAAMjB,EAAK,cAAcG,EAAG,KAAK,EACjCe,EAASlB,EAAK,cAAcG,EAAG,KAAK,EACpCgB,EAAQhB,EAAE,KAAKY,CAAC,EAEpBZ,EAAE,UAAUc,EAAKF,CAAC,EAClBI,EAAM,UAAYF,EAClBd,EAAE,UAAUe,EAAQH,CAAC,EACrBI,EAAM,aAAeD,EAErBF,EAAS,QAAQH,GAAS,CACxBC,GAAIX,EAAGC,EAAMK,EAASE,EAAQH,EAAQH,EAAQQ,CAAK,EAEnD,IAAIO,EAAYjB,EAAE,KAAKU,CAAK,EACxBQ,EAAWD,EAAU,UAAYA,EAAU,UAAYP,EACvDS,EAAcF,EAAU,aAAeA,EAAU,aAAeP,EAChEU,EAAaH,EAAU,UAAYT,EAAS,EAAIA,EAChDa,EAASH,IAAaC,EAAc,EAAId,EAASH,EAAOU,CAAC,EAAI,EAEjEZ,EAAE,QAAQc,EAAKI,EAAU,CACvB,OAAQE,EACR,OAAQC,EACR,YAAa,EACf,CAAC,EAEDrB,EAAE,QAAQmB,EAAaJ,EAAQ,CAC7B,OAAQK,EACR,OAAQC,EACR,YAAa,EACf,CAAC,CACH,CAAC,EAEIrB,EAAE,OAAOY,CAAC,GACbZ,EAAE,QAAQC,EAAMa,EAAK,CAAE,OAAQ,EAAG,OAAQT,EAASH,EAAOU,CAAC,CAAE,CAAC,CAElE,CAEA,SAAST,GAAWH,EAAG,CACrB,IAAIE,EAAS,CAAC,EACd,SAASS,EAAIC,EAAGU,EAAO,CACrB,IAAIT,EAAWb,EAAE,SAASY,CAAC,EACvBC,GAAYA,EAAS,QACvBA,EAAS,QAAQH,GAASC,EAAID,EAAOY,EAAQ,CAAC,CAAC,EAEjDpB,EAAOU,CAAC,EAAIU,CACd,CACA,OAAAtB,EAAE,SAAS,EAAE,QAAQY,GAAKD,EAAIC,EAAG,CAAC,CAAC,EAC5BV,CACT,CAEA,SAASO,GAAWT,EAAG,CACrB,OAAOA,EAAE,MAAM,EAAE,OAAO,CAACuB,EAAKhB,IAAMgB,EAAMvB,EAAE,KAAKO,CAAC,EAAE,OAAQ,CAAC,CAC/D,CAEA,SAASR,GAAQC,EAAG,CAClB,IAAIwB,EAAaxB,EAAE,MAAM,EACzBA,EAAE,WAAWwB,EAAW,WAAW,EACnC,OAAOA,EAAW,YAClBxB,EAAE,MAAM,EAAE,QAAQO,GAAK,CACrB,IAAIkB,EAAOzB,EAAE,KAAKO,CAAC,EACfkB,EAAK,aACPzB,EAAE,WAAWO,CAAC,CAElB,CAAC,CACH,IC7HA,IAAAmB,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAIC,GAAO,IAEXD,GAAO,QAAUE,GAEjB,SAASA,GAAkBC,EAAG,CAC5B,SAASC,EAAIC,EAAG,CACd,IAAIC,EAAWH,EAAE,SAASE,CAAC,EACvBE,EAAOJ,EAAE,KAAKE,CAAC,EAKnB,GAJIC,EAAS,QACXA,EAAS,QAAQF,CAAG,EAGlB,OAAO,OAAOG,EAAM,SAAS,EAAG,CAClCA,EAAK,WAAa,CAAC,EACnBA,EAAK,YAAc,CAAC,EACpB,QAASC,EAAOD,EAAK,QAASE,EAAUF,EAAK,QAAU,EACrDC,EAAOC,EACP,EAAED,EACFE,GAAcP,EAAG,aAAc,MAAOE,EAAGE,EAAMC,CAAI,EACnDE,GAAcP,EAAG,cAAe,MAAOE,EAAGE,EAAMC,CAAI,CAExD,CACF,CAEAL,EAAE,SAAS,EAAE,QAAQC,CAAG,CAC1B,CAEA,SAASM,GAAcP,EAAGQ,EAAMC,EAAQC,EAAIC,EAAQN,EAAM,CACxD,IAAIO,EAAQ,CAAE,MAAO,EAAG,OAAQ,EAAG,KAAMP,EAAM,WAAYG,CAAK,EAC5DK,EAAOF,EAAOH,CAAI,EAAEH,EAAO,CAAC,EAC5BS,EAAOhB,GAAK,aAAaE,EAAG,SAAUY,EAAOH,CAAM,EACvDE,EAAOH,CAAI,EAAEH,CAAI,EAAIS,EACrBd,EAAE,UAAUc,EAAMJ,CAAE,EAChBG,GACFb,EAAE,QAAQa,EAAMC,EAAM,CAAE,OAAQ,CAAE,CAAC,CAEvC,ICpCA,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEAA,GAAO,QAAU,CACf,OAAQC,GACR,KAAMC,EACR,EAEA,SAASD,GAAOE,EAAG,CACjB,IAAIC,EAAUD,EAAE,MAAM,EAAE,QAAQ,YAAY,GACxCC,IAAY,MAAQA,IAAY,OAClCC,GAAgBF,CAAC,CAErB,CAEA,SAASD,GAAKC,EAAG,CACf,IAAIC,EAAUD,EAAE,MAAM,EAAE,QAAQ,YAAY,GACxCC,IAAY,MAAQA,IAAY,OAClCE,GAASH,CAAC,GAGRC,IAAY,MAAQA,IAAY,QAClCG,GAAOJ,CAAC,EACRE,GAAgBF,CAAC,EAErB,CAEA,SAASE,GAAgBF,EAAG,CAC1BA,EAAE,MAAM,EAAE,QAAQK,GAAKC,GAAmBN,EAAE,KAAKK,CAAC,CAAC,CAAC,EACpDL,EAAE,MAAM,EAAE,QAAQO,GAAKD,GAAmBN,EAAE,KAAKO,CAAC,CAAC,CAAC,CACtD,CAEA,SAASD,GAAmBE,EAAO,CACjC,IAAIC,EAAID,EAAM,MACdA,EAAM,MAAQA,EAAM,OACpBA,EAAM,OAASC,CACjB,CAEA,SAASN,GAASH,EAAG,CACnBA,EAAE,MAAM,EAAE,QAAQK,GAAKK,EAAYV,EAAE,KAAKK,CAAC,CAAC,CAAC,EAE7CL,EAAE,MAAM,EAAE,QAAQO,GAAK,CACrB,IAAII,EAAOX,EAAE,KAAKO,CAAC,EACnBI,EAAK,OAAO,QAAQD,CAAW,EAC3B,OAAO,OAAOC,EAAM,GAAG,GACzBD,EAAYC,CAAI,CAEpB,CAAC,CACH,CAEA,SAASD,EAAYF,EAAO,CAC1BA,EAAM,EAAI,CAACA,EAAM,CACnB,CAEA,SAASJ,GAAOJ,EAAG,CACjBA,EAAE,MAAM,EAAE,QAAQK,GAAKO,EAAUZ,EAAE,KAAKK,CAAC,CAAC,CAAC,EAE3CL,EAAE,MAAM,EAAE,QAAQO,GAAK,CACrB,IAAII,EAAOX,EAAE,KAAKO,CAAC,EACnBI,EAAK,OAAO,QAAQC,CAAS,EACzB,OAAO,OAAOD,EAAM,GAAG,GACzBC,EAAUD,CAAI,CAElB,CAAC,CACH,CAEA,SAASC,EAAUJ,EAAO,CACxB,IAAIK,EAAIL,EAAM,EACdA,EAAM,EAAIA,EAAM,EAChBA,EAAM,EAAIK,CACZ,ICrEA,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAO,IAEXD,GAAO,QAAUE,GAajB,SAASA,GAAUC,EAAG,CACpB,IAAIC,EAAU,CAAC,EACXC,EAAcF,EAAE,MAAM,EAAE,OAAOG,GAAK,CAACH,EAAE,SAASG,CAAC,EAAE,MAAM,EACzDC,EAAmBF,EAAY,IAAIC,GAAKH,EAAE,KAAKG,CAAC,EAAE,IAAI,EACtDE,EAAUP,GAAK,kBAAkB,KAAK,IAAKM,CAAgB,EAC3DE,EAASR,GAAK,MAAMO,EAAU,CAAC,EAAE,IAAI,IAAM,CAAC,CAAC,EAEjD,SAASE,EAAIJ,EAAG,CACd,GAAIF,EAAQE,CAAC,EAAG,OAChBF,EAAQE,CAAC,EAAI,GACb,IAAIK,EAAOR,EAAE,KAAKG,CAAC,EACnBG,EAAOE,EAAK,IAAI,EAAE,KAAKL,CAAC,EACxBH,EAAE,WAAWG,CAAC,EAAE,QAAQI,CAAG,CAC7B,CAGA,OADgBL,EAAY,KAAK,CAACO,EAAGC,IAAMV,EAAE,KAAKS,CAAC,EAAE,KAAOT,EAAE,KAAKU,CAAC,EAAE,IAAI,EAChE,QAAQH,CAAG,EAEdD,CACT,ICpCA,IAAAK,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAY,IAAmB,UAEnCD,GAAO,QAAUE,GAkBjB,SAASA,GAAWC,EAAGC,EAAU,CAC/B,IAAIC,EAAK,EACT,QAASC,EAAI,EAAGA,EAAIF,EAAS,OAAQ,EAAEE,EACrCD,GAAME,GAAmBJ,EAAGC,EAASE,EAAE,CAAC,EAAGF,EAASE,CAAC,CAAC,EAExD,OAAOD,CACT,CAEA,SAASE,GAAmBJ,EAAGK,EAAYC,EAAY,CAIrD,IAAIC,EAAWT,GAAUQ,EAAYA,EAAW,IAAI,CAACE,EAAGL,IAAMA,CAAC,CAAC,EAC5DM,EAAeJ,EAAW,QAAQG,GAC7BR,EAAE,SAASQ,CAAC,EAAE,IAAIE,IAChB,CAAE,IAAKH,EAASG,EAAE,CAAC,EAAG,OAAQV,EAAE,KAAKU,CAAC,EAAE,MAAO,EACvD,EAAE,KAAK,CAACC,EAAGC,IAAMD,EAAE,IAAMC,EAAE,GAAG,CAChC,EAGGC,EAAa,EACjB,KAAOA,EAAaP,EAAW,QAAQO,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIE,EAAO,IAAI,MAAMD,CAAQ,EAAE,KAAK,CAAC,EAGjCZ,EAAK,EACT,OAAAO,EAAa,QAAQO,GAAS,CAC5B,IAAIC,EAAQD,EAAM,IAAMH,EACxBE,EAAKE,CAAK,GAAKD,EAAM,OACrB,IAAIE,EAAY,EAChB,KAAOD,EAAQ,GACTA,EAAQ,IACVC,GAAaH,EAAKE,EAAQ,CAAC,GAE7BA,EAASA,EAAQ,GAAM,EACvBF,EAAKE,CAAK,GAAKD,EAAM,OAEvBd,GAAMc,EAAM,OAASE,CACvB,CAAC,EAEMhB,CACT,ICjEA,IAAAiB,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CAAAA,GAAO,QAAUC,GAEjB,SAASA,GAAWC,EAAGC,EAAU,CAAC,EAAG,CACnC,OAAOA,EAAQ,IAAIC,GAAK,CACtB,IAAIC,EAAMH,EAAE,QAAQE,CAAC,EACrB,GAAKC,EAAI,OAEF,CACL,IAAIC,EAASD,EAAI,OAAO,CAACE,EAAKC,IAAM,CAClC,IAAIC,EAAOP,EAAE,KAAKM,CAAC,EACjBE,EAAQR,EAAE,KAAKM,EAAE,CAAC,EACpB,MAAO,CACL,IAAKD,EAAI,IAAOE,EAAK,OAASC,EAAM,MACpC,OAAQH,EAAI,OAASE,EAAK,MAC5B,CACF,EAAG,CAAE,IAAK,EAAG,OAAQ,CAAE,CAAC,EAExB,MAAO,CACL,EAAGL,EACH,WAAYE,EAAO,IAAMA,EAAO,OAChC,OAAQA,EAAO,MACjB,CACF,KAhBE,OAAO,CAAE,EAAGF,CAAE,CAiBlB,CAAC,CACH,ICxBA,IAAAO,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAO,IAEXD,GAAO,QAAUE,GA2BjB,SAASA,GAAiBC,EAASC,EAAI,CACrC,IAAIC,EAAgB,CAAC,EACrBF,EAAQ,QAAQ,CAACG,EAAOC,IAAM,CAC5B,IAAIC,EAAMH,EAAcC,EAAM,CAAC,EAAI,CACjC,SAAU,EACV,GAAM,CAAC,EACP,IAAK,CAAC,EACN,GAAI,CAACA,EAAM,CAAC,EACZ,EAAGC,CACL,EACID,EAAM,aAAe,SACvBE,EAAI,WAAaF,EAAM,WACvBE,EAAI,OAASF,EAAM,OAEvB,CAAC,EAEDF,EAAG,MAAM,EAAE,QAAQK,GAAK,CACtB,IAAIC,EAASL,EAAcI,EAAE,CAAC,EAC1BE,EAASN,EAAcI,EAAE,CAAC,EAC1BC,IAAW,QAAaC,IAAW,SACrCA,EAAO,WACPD,EAAO,IAAI,KAAKL,EAAcI,EAAE,CAAC,CAAC,EAEtC,CAAC,EAED,IAAIG,EAAY,OAAO,OAAOP,CAAa,EAAE,OAAOC,GAAS,CAACA,EAAM,QAAQ,EAE5E,OAAOO,GAAmBD,CAAS,CACrC,CAEA,SAASC,GAAmBD,EAAW,CACrC,IAAIT,EAAU,CAAC,EAEf,SAASW,EAASC,EAAQ,CACxB,OAAOC,GAAU,CACXA,EAAO,SAGPA,EAAO,aAAe,QACtBD,EAAO,aAAe,QACtBC,EAAO,YAAcD,EAAO,aAC9BE,GAAaF,EAAQC,CAAM,CAE/B,CACF,CAEA,SAASE,EAAUH,EAAQ,CACzB,OAAOI,GAAU,CACfA,EAAO,GAAM,KAAKJ,CAAM,EACpB,EAAEI,EAAO,WAAa,GACxBP,EAAU,KAAKO,CAAM,CAEzB,CACF,CAEA,KAAOP,EAAU,QAAQ,CACvB,IAAIN,EAAQM,EAAU,IAAI,EAC1BT,EAAQ,KAAKG,CAAK,EAClBA,EAAM,GAAM,QAAQ,EAAE,QAAQQ,EAASR,CAAK,CAAC,EAC7CA,EAAM,IAAI,QAAQY,EAAUZ,CAAK,CAAC,CACpC,CAEA,OAAOH,EAAQ,OAAOG,GAAS,CAACA,EAAM,MAAM,EAAE,IAAIA,GACzCL,GAAK,KAAKK,EAAO,CAAC,KAAM,IAAK,aAAc,QAAQ,CAAC,CAC5D,CACH,CAEA,SAASW,GAAaG,EAAQC,EAAQ,CACpC,IAAIC,EAAM,EACNC,EAAS,EAETH,EAAO,SACTE,GAAOF,EAAO,WAAaA,EAAO,OAClCG,GAAUH,EAAO,QAGfC,EAAO,SACTC,GAAOD,EAAO,WAAaA,EAAO,OAClCE,GAAUF,EAAO,QAGnBD,EAAO,GAAKC,EAAO,GAAG,OAAOD,EAAO,EAAE,EACtCA,EAAO,WAAaE,EAAMC,EAC1BH,EAAO,OAASG,EAChBH,EAAO,EAAI,KAAK,IAAIC,EAAO,EAAGD,EAAO,CAAC,EACtCC,EAAO,OAAS,EAClB,ICrHA,IAAAG,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAIC,GAAO,IAEXD,GAAO,QAAUE,GAEjB,SAASA,GAAKC,EAASC,EAAW,CAChC,IAAIC,EAAQJ,GAAK,UAAUE,EAASG,GAC3B,OAAO,OAAOA,EAAO,YAAY,CACzC,EACGC,EAAWF,EAAM,IACnBG,EAAaH,EAAM,IAAI,KAAK,CAACI,EAAGC,IAAMA,EAAE,EAAID,EAAE,CAAC,EAC/CE,EAAK,CAAC,EACNC,EAAM,EACNC,EAAS,EACTC,EAAU,EAEZP,EAAS,KAAKQ,GAAgB,CAAC,CAACX,CAAS,CAAC,EAE1CU,EAAUE,GAAkBL,EAAIH,EAAYM,CAAO,EAEnDP,EAAS,QAAQD,GAAS,CACxBQ,GAAWR,EAAM,GAAG,OACpBK,EAAG,KAAKL,EAAM,EAAE,EAChBM,GAAON,EAAM,WAAaA,EAAM,OAChCO,GAAUP,EAAM,OAChBQ,EAAUE,GAAkBL,EAAIH,EAAYM,CAAO,CACrD,CAAC,EAED,IAAIG,EAAS,CAAE,GAAIN,EAAG,KAAK,EAAI,CAAE,EACjC,OAAIE,IACFI,EAAO,WAAaL,EAAMC,EAC1BI,EAAO,OAASJ,GAEXI,CACT,CAEA,SAASD,GAAkBL,EAAIH,EAAYU,EAAO,CAChD,IAAIC,EACJ,KAAOX,EAAW,SAAWW,EAAOX,EAAWA,EAAW,OAAS,CAAC,GAAG,GAAKU,GAC1EV,EAAW,IAAI,EACfG,EAAG,KAAKQ,EAAK,EAAE,EACfD,IAEF,OAAOA,CACT,CAEA,SAASH,GAAgBK,EAAM,CAC7B,MAAO,CAACC,EAAQC,IACVD,EAAO,WAAaC,EAAO,WACtB,GACED,EAAO,WAAaC,EAAO,WAC7B,EAGDF,EAA6BE,EAAO,EAAID,EAAO,EAAxCA,EAAO,EAAIC,EAAO,CAErC,ICvDA,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAIC,GAAa,KACbC,GAAmB,KACnBC,GAAO,KAEXH,GAAO,QAAUI,GAEjB,SAASA,GAAaC,EAAGC,EAAGC,EAAIC,EAAW,CACzC,IAAIC,EAAUJ,EAAE,SAASC,CAAC,EACtBI,EAAOL,EAAE,KAAKC,CAAC,EACfK,EAAKD,EAAOA,EAAK,WAAa,OAC9BE,EAAKF,EAAOA,EAAK,YAAa,OAC9BG,EAAY,CAAC,EAEbF,IACFF,EAAUA,EAAQ,OAAOK,GAAKA,IAAMH,GAAMG,IAAMF,CAAE,GAGpD,IAAIG,EAAcd,GAAWI,EAAGI,CAAO,EACvCM,EAAY,QAAQC,GAAS,CAC3B,GAAIX,EAAE,SAASW,EAAM,CAAC,EAAE,OAAQ,CAC9B,IAAIC,EAAiBb,GAAaC,EAAGW,EAAM,EAAGT,EAAIC,CAAS,EAC3DK,EAAUG,EAAM,CAAC,EAAIC,EACjB,OAAO,OAAOA,EAAgB,YAAY,GAC5CC,GAAiBF,EAAOC,CAAc,CAE1C,CACF,CAAC,EAED,IAAIE,EAAUjB,GAAiBa,EAAaR,CAAE,EAC9Ca,GAAgBD,EAASN,CAAS,EAElC,IAAIQ,EAASlB,GAAKgB,EAASX,CAAS,EAEpC,GAAIG,IACFU,EAAO,GAAK,CAACV,EAAIU,EAAO,GAAIT,CAAE,EAAE,KAAK,EAAI,EACrCP,EAAE,aAAaM,CAAE,EAAE,QAAQ,CAC7B,IAAIW,EAASjB,EAAE,KAAKA,EAAE,aAAaM,CAAE,EAAE,CAAC,CAAC,EACvCY,EAASlB,EAAE,KAAKA,EAAE,aAAaO,CAAE,EAAE,CAAC,CAAC,EAClC,OAAO,OAAOS,EAAQ,YAAY,IACrCA,EAAO,WAAa,EACpBA,EAAO,OAAS,GAElBA,EAAO,YAAcA,EAAO,WAAaA,EAAO,OAC3BC,EAAO,MAAQC,EAAO,QAAUF,EAAO,OAAS,GACrEA,EAAO,QAAU,CACnB,CAGF,OAAOA,CACT,CAEA,SAASD,GAAgBD,EAASN,EAAW,CAC3CM,EAAQ,QAAQH,GAAS,CACvBA,EAAM,GAAKA,EAAM,GAAG,QAAQV,GACtBO,EAAUP,CAAC,EACNO,EAAUP,CAAC,EAAE,GAEfA,CACR,CACH,CAAC,CACH,CAEA,SAASY,GAAiBM,EAAQC,EAAO,CACnCD,EAAO,aAAe,QACxBA,EAAO,YAAcA,EAAO,WAAaA,EAAO,OAC3BC,EAAM,WAAaA,EAAM,SACzBD,EAAO,OAASC,EAAM,QAC3CD,EAAO,QAAUC,EAAM,SAEvBD,EAAO,WAAaC,EAAM,WAC1BD,EAAO,OAASC,EAAM,OAE1B,ICxEA,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAIC,GAAQ,EAAQ,mBAAmB,EAAE,MACrCC,GAAO,IAEXF,GAAO,QAAUG,GAkCjB,SAASA,GAAgBC,EAAGC,EAAMC,EAAcC,EAAe,CACxDA,IACHA,EAAgBH,EAAE,MAAM,GAE1B,IAAII,EAAOC,GAAeL,CAAC,EACzBM,EAAS,IAAIT,GAAM,CAAE,SAAU,EAAK,CAAC,EAClC,SAAS,CAAE,KAAMO,CAAK,CAAC,EACvB,oBAAqBG,GAAMP,EAAE,KAAKO,CAAC,CAAC,EAEzC,OAAAJ,EAAc,QAASI,GAAM,CAC3B,IAAIC,EAAOR,EAAE,KAAKO,CAAC,EACjBE,EAAST,EAAE,OAAOO,CAAC,GAEjBC,EAAK,OAASP,GAAQO,EAAK,SAAWP,GAAQA,GAAQO,EAAK,WAC7DF,EAAO,QAAQC,CAAC,EAChBD,EAAO,UAAUC,EAAGE,GAAUL,CAAI,EAGlCJ,EAAEE,CAAY,EAAEK,CAAC,EAAE,QAAQG,GAAK,CAC9B,IAAI,EAAIA,EAAE,IAAMH,EAAIG,EAAE,EAAIA,EAAE,EAC1BC,EAAOL,EAAO,KAAK,EAAGC,CAAC,EACvBK,EAASD,IAAS,OAAYA,EAAK,OAAS,EAC9CL,EAAO,QAAQ,EAAGC,EAAG,CAAE,OAAQP,EAAE,KAAKU,CAAC,EAAE,OAASE,CAAO,CAAC,CAC5D,CAAC,EAEG,OAAO,OAAOJ,EAAM,SAAS,GAC/BF,EAAO,QAAQC,EAAG,CAChB,WAAYC,EAAK,WAAWP,CAAI,EAChC,YAAaO,EAAK,YAAYP,CAAI,CACpC,CAAC,EAGP,CAAC,EAEMK,CACT,CAEA,SAASD,GAAeL,EAAG,CAEzB,QADIO,EACGP,EAAE,QAASO,EAAIT,GAAK,SAAS,OAAO,CAAE,GAAE,CAC/C,OAAOS,CACT,IC9EA,IAAAM,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CAAAA,GAAO,QAAUC,GAEjB,SAASA,GAAuBC,EAAGC,EAAIC,EAAI,CACzC,IAAIC,EAAO,CAAC,EACVC,EAEFF,EAAG,QAAQG,GAAK,CACd,IAAIC,EAAQN,EAAE,OAAOK,CAAC,EACpBE,EACAC,EACF,KAAOF,GAAO,CASZ,GARAC,EAASP,EAAE,OAAOM,CAAK,EACnBC,GACFC,EAAYL,EAAKI,CAAM,EACvBJ,EAAKI,CAAM,EAAID,IAEfE,EAAYJ,EACZA,EAAWE,GAETE,GAAaA,IAAcF,EAAO,CACpCL,EAAG,QAAQO,EAAWF,CAAK,EAC3B,MACF,CACAA,EAAQC,CACV,CACF,CAAC,CAyBH,IClDA,IAAAE,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAY,KACZC,GAAa,KACbC,GAAe,KACfC,GAAkB,KAClBC,GAAyB,KACzBC,GAAQ,EAAQ,mBAAmB,EAAE,MACrCC,EAAO,IAEXP,GAAO,QAAUQ,GAiBjB,SAASA,GAAMC,EAAGC,EAAO,CAAC,EAAG,CAC3B,GAAI,OAAOA,EAAK,aAAgB,WAAY,CAC1CA,EAAK,YAAYD,EAAGD,EAAK,EACzB,MACF,CAEA,IAAIG,EAAUJ,EAAK,QAAQE,CAAC,EAC1BG,EAAkBC,GAAiBJ,EAAGF,EAAK,MAAM,EAAGI,EAAU,CAAC,EAAG,SAAS,EAC3EG,EAAgBD,GAAiBJ,EAAGF,EAAK,MAAMI,EAAU,EAAG,GAAI,EAAE,EAAG,UAAU,EAE7EI,EAAWd,GAAUQ,CAAC,EAG1B,GAFAO,GAAYP,EAAGM,CAAQ,EAEnBL,EAAK,6BACP,OAGF,IAAIO,EAAS,OAAO,kBAClBC,EAEIC,EAAcT,EAAK,aAAe,CAAC,EACzC,QAASU,EAAI,EAAGC,EAAW,EAAGA,EAAW,EAAG,EAAED,EAAG,EAAEC,EAAU,CAC3DC,GAAiBF,EAAI,EAAIR,EAAkBE,EAAeM,EAAI,GAAK,EAAGD,CAAW,EAEjFJ,EAAWR,EAAK,iBAAiBE,CAAC,EAClC,IAAIc,EAAKrB,GAAWO,EAAGM,CAAQ,EAC3BQ,EAAKN,GACPI,EAAW,EACXH,EAAO,OAAO,OAAO,CAAC,EAAGH,CAAQ,EACjCE,EAASM,GACAA,IAAON,IAChBC,EAAO,gBAAgBH,CAAQ,EAEnC,CAEAC,GAAYP,EAAGS,CAAI,CACrB,CAEA,SAASL,GAAiBJ,EAAGe,EAAOC,EAAc,CAIhD,IAAMC,EAAc,IAAI,IAClBC,EAAgB,CAACC,EAAMC,IAAS,CAC/BH,EAAY,IAAIE,CAAI,GACvBF,EAAY,IAAIE,EAAM,CAAC,CAAC,EAE1BF,EAAY,IAAIE,CAAI,EAAE,KAAKC,CAAI,CACjC,EAIA,QAAWC,KAAKrB,EAAE,MAAM,EAAG,CACzB,IAAMoB,EAAOpB,EAAE,KAAKqB,CAAC,EAMrB,GALI,OAAOD,EAAK,MAAS,UACvBF,EAAcE,EAAK,KAAMC,CAAC,EAIxB,OAAOD,EAAK,SAAY,UAAY,OAAOA,EAAK,SAAY,SAC9D,QAASE,EAAIF,EAAK,QAASE,GAAKF,EAAK,QAASE,IACxCA,IAAMF,EAAK,MAEbF,EAAcI,EAAGD,CAAC,CAI1B,CAEA,OAAON,EAAM,IAAI,SAAUI,EAAM,CAC/B,OAAOxB,GAAgBK,EAAGmB,EAAMH,EAAcC,EAAY,IAAIE,CAAI,GAAK,CAAC,CAAC,CAC3E,CAAC,CACH,CAEA,SAASN,GAAiBU,EAAaC,EAAWd,EAAa,CAC7D,IAAIe,EAAK,IAAI5B,GACb0B,EAAY,QAAQ,SAASG,EAAI,CAC/BhB,EAAY,QAAQiB,GAAOF,EAAG,QAAQE,EAAI,KAAMA,EAAI,KAAK,CAAC,EAE1D,IAAIC,EAAOF,EAAG,MAAM,EAAE,KAClBG,EAASnC,GAAagC,EAAIE,EAAMH,EAAID,CAAS,EACjDK,EAAO,GAAG,QAAQ,CAACR,EAAGV,IAAMe,EAAG,KAAKL,CAAC,EAAE,MAAQV,CAAC,EAChDf,GAAuB8B,EAAID,EAAII,EAAO,EAAE,CAC1C,CAAC,CACH,CAEA,SAAStB,GAAYP,EAAGM,EAAU,CAChC,OAAO,OAAOA,CAAQ,EAAE,QAAQwB,GAASA,EAAM,QAAQ,CAACT,EAAG,IAAMrB,EAAE,KAAKqB,CAAC,EAAE,MAAQ,CAAC,CAAC,CACvF,ICnHA,IAAAU,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAQ,EAAQ,mBAAmB,EAAE,MACrCC,EAAO,IAOXF,GAAO,QAAU,CACf,UAAWG,GACX,mBAAoBC,GACpB,mBAAoBC,GACpB,YAAaC,EACb,YAAaC,GACb,kBAAmBC,GACnB,qBAAsBC,GACtB,iBAAkBC,GAClB,2BAA4BC,GAC5B,QAASC,EACX,EAmBA,SAASR,GAAmBS,EAAGC,EAAU,CACvC,IAAIC,EAAY,CAAC,EAEjB,SAASC,EAAWC,EAAWC,EAAO,CACpC,IAGEC,EAAK,EAGLC,EAAU,EACVC,EAAkBJ,EAAU,OAC5BK,EAAWJ,EAAMA,EAAM,OAAS,CAAC,EAEnC,OAAAA,EAAM,QAAQ,CAACK,EAAGC,IAAM,CACtB,IAAIC,EAAIC,GAA0Bb,EAAGU,CAAC,EACpCI,EAAKF,EAAIZ,EAAE,KAAKY,CAAC,EAAE,MAAQJ,GAEzBI,GAAKF,IAAMD,KACbJ,EAAM,MAAME,EAASI,EAAE,CAAC,EAAE,QAAQI,GAAY,CAC5Cf,EAAE,aAAae,CAAQ,EAAE,QAAQC,GAAK,CACpC,IAAIC,EAASjB,EAAE,KAAKgB,CAAC,EACnBE,EAAOD,EAAO,OACXC,EAAOZ,GAAMQ,EAAKI,IACnB,EAAED,EAAO,OAASjB,EAAE,KAAKe,CAAQ,EAAE,QACrCtB,EAAYS,EAAWc,EAAGD,CAAQ,CAEtC,CAAC,CACH,CAAC,EACDR,EAAUI,EAAI,EACdL,EAAKQ,EAET,CAAC,EAEMT,CACT,CAEA,OAAAJ,EAAS,QAAUA,EAAS,OAAOE,CAAU,EAEtCD,CACT,CAEA,SAASV,GAAmBQ,EAAGC,EAAU,CACvC,IAAIC,EAAY,CAAC,EAEjB,SAASiB,EAAKC,EAAOC,EAAUC,EAAUC,EAAiBC,EAAiB,CACzE,IAAId,EACJrB,EAAK,MAAMgC,EAAUC,CAAQ,EAAE,QAAQX,GAAK,CAC1CD,EAAIU,EAAMT,CAAC,EACPX,EAAE,KAAKU,CAAC,EAAE,OACZV,EAAE,aAAaU,CAAC,EAAE,QAAQM,GAAK,CAC7B,IAAIS,EAAQzB,EAAE,KAAKgB,CAAC,EAChBS,EAAM,QACLA,EAAM,MAAQF,GAAmBE,EAAM,MAAQD,IAClD/B,EAAYS,EAAWc,EAAGN,CAAC,CAE/B,CAAC,CAEL,CAAC,CACH,CAGA,SAASP,EAAWuB,EAAON,EAAO,CAChC,IAAIO,EAAe,GACjBC,EACAP,EAAW,EAEb,OAAAD,EAAM,QAAQ,CAACV,EAAGmB,IAAmB,CACnC,GAAI7B,EAAE,KAAKU,CAAC,EAAE,QAAU,SAAU,CAChC,IAAIoB,EAAe9B,EAAE,aAAaU,CAAC,EAC/BoB,EAAa,SACfF,EAAe5B,EAAE,KAAK8B,EAAa,CAAC,CAAC,EAAE,MACvCX,EAAKC,EAAOC,EAAUQ,EAAgBF,EAAcC,CAAY,EAChEP,EAAWQ,EACXF,EAAeC,EAEnB,CACAT,EAAKC,EAAOC,EAAUD,EAAM,OAAQQ,EAAcF,EAAM,MAAM,CAChE,CAAC,EAEMN,CACT,CAEA,OAAAnB,EAAS,QAAUA,EAAS,OAAOE,CAAU,EAEtCD,CACT,CAEA,SAASW,GAA0Bb,EAAGU,EAAG,CACvC,GAAIV,EAAE,KAAKU,CAAC,EAAE,MACZ,OAAOV,EAAE,aAAaU,CAAC,EAAE,KAAKM,GAAKhB,EAAE,KAAKgB,CAAC,EAAE,KAAK,CAEtD,CAEA,SAASvB,EAAYS,EAAWQ,EAAGE,EAAG,CACpC,GAAIF,EAAIE,EAAG,CACT,IAAImB,EAAMrB,EACVA,EAAIE,EACJA,EAAImB,CACN,CAEA,IAAIC,EAAa9B,EAAUQ,CAAC,EACvBsB,IACH9B,EAAUQ,CAAC,EAAIsB,EAAa,CAAC,GAE/BA,EAAWpB,CAAC,EAAI,EAClB,CAEA,SAASlB,GAAYQ,EAAWQ,EAAGE,EAAG,CACpC,GAAIF,EAAIE,EAAG,CACT,IAAImB,EAAMrB,EACVA,EAAIE,EACJA,EAAImB,CACN,CACA,MAAO,CAAC,CAAC7B,EAAUQ,CAAC,GAAK,OAAO,OAAOR,EAAUQ,CAAC,EAAGE,CAAC,CACxD,CAUA,SAASjB,GAAkBK,EAAGC,EAAUC,EAAW+B,EAAY,CAC7D,IAAIC,EAAO,CAAC,EACVC,EAAQ,CAAC,EACTC,EAAM,CAAC,EAKT,OAAAnC,EAAS,QAAQI,GAAS,CACxBA,EAAM,QAAQ,CAACK,EAAG2B,IAAU,CAC1BH,EAAKxB,CAAC,EAAIA,EACVyB,EAAMzB,CAAC,EAAIA,EACX0B,EAAI1B,CAAC,EAAI2B,CACX,CAAC,CACH,CAAC,EAEDpC,EAAS,QAAQI,GAAS,CACxB,IAAIiC,EAAU,GACdjC,EAAM,QAAQK,GAAK,CACjB,IAAI6B,EAAKN,EAAWvB,CAAC,EACrB,GAAI6B,EAAG,OAAQ,CACbA,EAAKA,EAAG,KAAK,CAACC,EAAGC,IAAML,EAAII,CAAC,EAAIJ,EAAIK,CAAC,CAAC,EACtC,IAAIC,GAAMH,EAAG,OAAS,GAAK,EAC3B,QAAS5B,EAAI,KAAK,MAAM+B,CAAE,EAAGC,EAAK,KAAK,KAAKD,CAAE,EAAG/B,GAAKgC,EAAI,EAAEhC,EAAG,CAC7D,IAAIC,EAAI2B,EAAG5B,CAAC,EACRwB,EAAMzB,CAAC,IAAMA,GACb4B,EAAUF,EAAIxB,CAAC,GACf,CAAClB,GAAYQ,EAAWQ,EAAGE,CAAC,IAC9BuB,EAAMvB,CAAC,EAAIF,EACXyB,EAAMzB,CAAC,EAAIwB,EAAKxB,CAAC,EAAIwB,EAAKtB,CAAC,EAC3B0B,EAAUF,EAAIxB,CAAC,EAEnB,CACF,CACF,CAAC,CACH,CAAC,EAEM,CAAE,KAAMsB,EAAM,MAAOC,CAAM,CACpC,CAEA,SAASvC,GAAqBI,EAAGC,EAAUiC,EAAMC,EAAOS,EAAY,CAMlE,IAAIC,EAAK,CAAC,EACRC,EAASC,GAAgB/C,EAAGC,EAAUiC,EAAMU,CAAU,EACtDI,EAAaJ,EAAa,aAAe,cAE3C,SAASK,EAAQC,EAAWC,EAAe,CACzC,IAAMC,EAAQN,EAAO,MAAM,EAAE,MAAM,EAC7BO,EAAU,CAAC,EACbC,EAAOF,EAAM,IAAI,EAErB,KAAOE,GAAM,CACX,GAAID,EAAQC,CAAI,EACdJ,EAAUI,CAAI,MACT,CACLD,EAAQC,CAAI,EAAI,GAGhBF,EAAM,KAAKE,CAAI,EACf,QAAWC,KAAYJ,EAAcG,CAAI,EACvCF,EAAM,KAAKG,CAAQ,CAEvB,CAEAD,EAAOF,EAAM,IAAI,CACnB,CACF,CAGA,SAASI,EAAMF,EAAM,CACnBT,EAAGS,CAAI,EAAIR,EAAO,QAAQQ,CAAI,EAAE,OAAO,CAACG,EAAKC,IACpC,KAAK,IAAID,EAAKZ,EAAGa,EAAE,CAAC,EAAIZ,EAAO,KAAKY,CAAC,CAAC,EAC5C,CAAC,CACN,CAGA,SAASC,EAAML,EAAM,CACnB,IAAIM,EAAMd,EAAO,SAASQ,CAAI,EAAE,OAAO,CAACG,EAAKC,IACpC,KAAK,IAAID,EAAKZ,EAAGa,EAAE,CAAC,EAAIZ,EAAO,KAAKY,CAAC,CAAC,EAC5C,OAAO,iBAAiB,EAEvBG,EAAO7D,EAAE,KAAKsD,CAAI,EAClBM,IAAQ,OAAO,mBAAqBC,EAAK,aAAeb,IAC1DH,EAAGS,CAAI,EAAI,KAAK,IAAIT,EAAGS,CAAI,EAAGM,CAAG,EAErC,CAEA,OAAAX,EAAQO,EAAOV,EAAO,aAAa,KAAKA,CAAM,CAAC,EAC/CG,EAAQU,EAAOb,EAAO,WAAW,KAAKA,CAAM,CAAC,EAG7C,OAAO,KAAKX,CAAK,EAAE,QAAQzB,GAAKmC,EAAGnC,CAAC,EAAImC,EAAGX,EAAKxB,CAAC,CAAC,CAAC,EAE5CmC,CACT,CAGA,SAASE,GAAgB/C,EAAGC,EAAUiC,EAAMU,EAAY,CACtD,IAAIkB,EAAa,IAAI1E,GACnB2E,EAAa/D,EAAE,MAAM,EACrBgE,EAAQC,GAAIF,EAAW,QAASA,EAAW,QAASnB,CAAU,EAEhE,OAAA3C,EAAS,QAAQI,GAAS,CACxB,IAAIW,EACJX,EAAM,QAAQK,GAAK,CACjB,IAAIwD,EAAQhC,EAAKxB,CAAC,EAElB,GADAoD,EAAW,QAAQI,CAAK,EACpBlD,EAAG,CACL,IAAImD,EAAQjC,EAAKlB,CAAC,EAChBoD,EAAUN,EAAW,KAAKK,EAAOD,CAAK,EACxCJ,EAAW,QAAQK,EAAOD,EAAO,KAAK,IAAIF,EAAMhE,EAAGU,EAAGM,CAAC,EAAGoD,GAAW,CAAC,CAAC,CACzE,CACApD,EAAIN,CACN,CAAC,CACH,CAAC,EAEMoD,CACT,CAKA,SAAShE,GAA2BE,EAAGqE,EAAK,CAC1C,OAAO,OAAO,OAAOA,CAAG,EAAE,OAAO,CAACC,EAAiBzB,IAAO,CACxD,IAAI0B,EAAM,OAAO,kBACbX,EAAM,OAAO,kBAEjB,OAAO,QAAQf,CAAE,EAAE,QAAQ,CAAC,CAACnC,EAAG8D,CAAC,IAAM,CACrC,IAAIC,EAAYC,GAAM1E,EAAGU,CAAC,EAAI,EAE9B6D,EAAM,KAAK,IAAIC,EAAIC,EAAWF,CAAG,EACjCX,EAAM,KAAK,IAAIY,EAAIC,EAAWb,CAAG,CACnC,CAAC,EAED,IAAMe,EAASJ,EAAMX,EACrB,OAAIe,EAASL,EAAgB,CAAC,IAC5BA,EAAkB,CAACK,EAAQ9B,CAAE,GAExByB,CACT,EAAG,CAAC,OAAO,kBAAmB,IAAI,CAAC,EAAE,CAAC,CACxC,CASA,SAASzE,GAAiBwE,EAAKO,EAAS,CACtC,IAAIC,EAAc,OAAO,OAAOD,CAAO,EACrCE,EAAazF,EAAK,kBAAkB,KAAK,IAAKwF,CAAW,EACzDE,EAAa1F,EAAK,kBAAkB,KAAK,IAAKwF,CAAW,EAE3D,CAAC,IAAK,GAAG,EAAE,QAAQG,GAAQ,CACzB,CAAC,IAAK,GAAG,EAAE,QAAQC,GAAS,CAC1B,IAAIC,EAAYF,EAAOC,EACrBpC,EAAKwB,EAAIa,CAAS,EAEpB,GAAIrC,IAAO+B,EAAS,OAEpB,IAAIO,EAAS,OAAO,OAAOtC,CAAE,EACzBuC,EAAQN,EAAazF,EAAK,kBAAkB,KAAK,IAAK8F,CAAM,EAC5DF,IAAU,MACZG,EAAQL,EAAa1F,EAAK,kBAAkB,KAAK,IAAI8F,CAAM,GAGzDC,IACFf,EAAIa,CAAS,EAAI7F,EAAK,UAAUwD,EAAI2B,GAAKA,EAAIY,CAAK,EAEtD,CAAC,CACH,CAAC,CACH,CAEA,SAASrF,GAAQsE,EAAKlC,EAAO,CAC3B,OAAO9C,EAAK,UAAUgF,EAAI,GAAI,CAACgB,EAAK3E,IAAM,CACxC,GAAIyB,EACF,OAAOkC,EAAIlC,EAAM,YAAY,CAAC,EAAEzB,CAAC,EAC5B,CACL,IAAImC,EAAK,OAAO,OAAOwB,CAAG,EAAE,IAAIxB,GAAMA,EAAGnC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAG+B,IAAM,EAAIA,CAAC,EACjE,OAAQI,EAAG,CAAC,EAAIA,EAAG,CAAC,GAAK,CAC3B,CACF,CAAC,CACH,CAEA,SAASvD,GAAUU,EAAG,CACpB,IAAIC,EAAWZ,EAAK,iBAAiBW,CAAC,EAClCE,EAAY,OAAO,OACrBX,GAAmBS,EAAGC,CAAQ,EAC9BT,GAAmBQ,EAAGC,CAAQ,CAAC,EAE7BoE,EAAM,CAAC,EACPiB,EACJ,CAAC,IAAK,GAAG,EAAE,QAAQN,GAAQ,CACzBM,EAAmBN,IAAS,IAAM/E,EAAW,OAAO,OAAOA,CAAQ,EAAE,QAAQ,EAC7E,CAAC,IAAK,GAAG,EAAE,QAAQgF,GAAS,CACtBA,IAAU,MACZK,EAAmBA,EAAiB,IAAIC,GAC/B,OAAO,OAAOA,CAAK,EAAE,QAAQ,CACrC,GAGH,IAAItD,GAAc+C,IAAS,IAAMhF,EAAE,aAAeA,EAAE,YAAY,KAAKA,CAAC,EAClEmC,EAAQxC,GAAkBK,EAAGsF,EAAkBpF,EAAW+B,CAAU,EACpEY,EAAKjD,GAAqBI,EAAGsF,EAC/BnD,EAAM,KAAMA,EAAM,MAAO8C,IAAU,GAAG,EACpCA,IAAU,MACZpC,EAAKxD,EAAK,UAAUwD,EAAI2B,GAAK,CAACA,CAAC,GAEjCH,EAAIW,EAAOC,CAAK,EAAIpC,CACtB,CAAC,CACH,CAAC,EAGD,IAAI2C,EAAgB1F,GAA2BE,EAAGqE,CAAG,EACrD,OAAAxE,GAAiBwE,EAAKmB,CAAa,EAC5BzF,GAAQsE,EAAKrE,EAAE,MAAM,EAAE,KAAK,CACrC,CAEA,SAASiE,GAAIwB,EAASC,EAAS9C,EAAY,CACzC,MAAO,CAAC5C,EAAGU,EAAGE,IAAM,CAClB,IAAI+E,EAAS3F,EAAE,KAAKU,CAAC,EACjBkF,EAAS5F,EAAE,KAAKY,CAAC,EACjBiF,EAAM,EACNT,EAGJ,GADAS,GAAOF,EAAO,MAAQ,EAClB,OAAO,OAAOA,EAAQ,UAAU,EAClC,OAAQA,EAAO,SAAS,YAAY,EAAG,CACvC,IAAK,IAAKP,EAAQ,CAACO,EAAO,MAAQ,EAAG,MACrC,IAAK,IAAKP,EAAQO,EAAO,MAAQ,EAAG,KACpC,CAWF,GATIP,IACFS,GAAOjD,EAAawC,EAAQ,CAACA,GAE/BA,EAAQ,EAERS,IAAQF,EAAO,MAAQD,EAAUD,GAAW,EAC5CI,IAAQD,EAAO,MAAQF,EAAUD,GAAW,EAE5CI,GAAOD,EAAO,MAAQ,EAClB,OAAO,OAAOA,EAAQ,UAAU,EAClC,OAAQA,EAAO,SAAS,YAAY,EAAG,CACvC,IAAK,IAAKR,EAAQQ,EAAO,MAAQ,EAAG,MACpC,IAAK,IAAKR,EAAQ,CAACQ,EAAO,MAAQ,EAAG,KACrC,CAEF,OAAIR,IACFS,GAAOjD,EAAawC,EAAQ,CAACA,GAE/BA,EAAQ,EAEDS,CACT,CACF,CAEA,SAASnB,GAAM1E,EAAGU,EAAG,CACnB,OAAOV,EAAE,KAAKU,CAAC,EAAE,KACnB,IC5aA,IAAAoF,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAO,IACPC,GAAY,KAAgB,UAEhCF,GAAO,QAAUG,GAEjB,SAASA,GAASC,EAAG,CACnBA,EAAIH,GAAK,mBAAmBG,CAAC,EAE7BC,GAAUD,CAAC,EACX,OAAO,QAAQF,GAAUE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAACE,EAAGC,CAAC,IAAMH,EAAE,KAAKE,CAAC,EAAE,EAAIC,CAAC,CAClE,CAEA,SAASF,GAAUD,EAAG,CACpB,IAAII,EAAWP,GAAK,iBAAiBG,CAAC,EAClCK,EAAUL,EAAE,MAAM,EAAE,QACpBM,EAAQ,EACZF,EAAS,QAAQG,GAAS,CACxB,IAAMC,EAAYD,EAAM,OAAO,CAACE,EAAKP,IAAM,CACzC,IAAMQ,EAASV,EAAE,KAAKE,CAAC,EAAE,OACzB,OAAIO,EAAMC,EACDD,EAEAC,CAEX,EAAG,CAAC,EACJH,EAAM,QAAQL,GAAKF,EAAE,KAAKE,CAAC,EAAE,EAAII,EAAQE,EAAY,CAAC,EACtDF,GAASE,EAAYH,CACvB,CAAC,CACH,IC9BA,IAAAM,GAAAC,EAAA,CAAAC,GAAAC,KAAA,cAEA,IAAIC,GAAU,KACVC,GAAY,KACZC,GAAO,KACPC,GAAiB,IAAkB,eACnCC,GAAoB,KACpBC,GAAmB,IAAkB,iBACrCC,GAAe,KACfC,GAAoB,KACpBC,GAAmB,KACnBC,GAAQ,KACRC,GAAW,KACXC,EAAO,IACPC,GAAQ,EAAQ,mBAAmB,EAAE,MAEzCb,GAAO,QAAUc,GAEjB,SAASA,GAAOC,EAAGC,EAAO,CAAC,EAAG,CAC5B,IAAMC,EAAOD,EAAK,YAAcJ,EAAK,KAAOA,EAAK,OACjD,OAAOK,EAAK,SAAU,IAAM,CAC1B,IAAIC,EACFD,EAAK,qBAAsB,IAAME,GAAiBJ,CAAC,CAAC,EACtD,OAAAE,EAAK,cAAsB,IAAMG,GAAUF,EAAaD,EAAMD,CAAI,CAAC,EACnEC,EAAK,qBAAsB,IAAMI,GAAiBN,EAAGG,CAAW,CAAC,EAC1DA,CACT,CAAC,CACH,CAEA,SAASE,GAAUL,EAAGE,EAAMD,EAAM,CAChCC,EAAK,6BAA8B,IAAMK,GAAuBP,CAAC,CAAC,EAClEE,EAAK,sBAA8B,IAAMM,GAAgBR,CAAC,CAAC,EAC3DE,EAAK,cAA8B,IAAMhB,GAAQ,IAAIc,CAAC,CAAC,EACvDE,EAAK,uBAA8B,IAAMV,GAAa,IAAIQ,CAAC,CAAC,EAC5DE,EAAK,WAA8B,IAAMd,GAAKS,EAAK,mBAAmBG,CAAC,CAAC,CAAC,EACzEE,EAAK,6BAA8B,IAAMO,GAAuBT,CAAC,CAAC,EAClEE,EAAK,uBAA8B,IAAMX,GAAiBS,CAAC,CAAC,EAC5DE,EAAK,2BAA8B,IAAMV,GAAa,QAAQQ,CAAC,CAAC,EAChEE,EAAK,qBAA8B,IAAMb,GAAeW,CAAC,CAAC,EAC1DE,EAAK,uBAA8B,IAAMQ,GAAiBV,CAAC,CAAC,EAC5DE,EAAK,6BAA8B,IAAMS,GAAuBX,CAAC,CAAC,EAClEE,EAAK,oBAA8B,IAAMf,GAAU,IAAIa,CAAC,CAAC,EACzDE,EAAK,wBAA8B,IAAMZ,GAAkBU,CAAC,CAAC,EAC7DE,EAAK,wBAA8B,IAAMT,GAAkBO,CAAC,CAAC,EAC7DE,EAAK,YAA8B,IAAMP,GAAMK,EAAGC,CAAI,CAAC,EACvDC,EAAK,sBAA8B,IAAMU,GAAgBZ,CAAC,CAAC,EAC3DE,EAAK,6BAA8B,IAAMR,GAAiB,OAAOM,CAAC,CAAC,EACnEE,EAAK,eAA8B,IAAMN,GAASI,CAAC,CAAC,EACpDE,EAAK,wBAA8B,IAAMW,GAAkBb,CAAC,CAAC,EAC7DE,EAAK,wBAA8B,IAAMY,GAAkBd,CAAC,CAAC,EAC7DE,EAAK,qBAA8B,IAAMf,GAAU,KAAKa,CAAC,CAAC,EAC1DE,EAAK,2BAA8B,IAAMa,GAAqBf,CAAC,CAAC,EAChEE,EAAK,2BAA8B,IAAMR,GAAiB,KAAKM,CAAC,CAAC,EACjEE,EAAK,qBAA8B,IAAMc,GAAehB,CAAC,CAAC,EAC1DE,EAAK,2BAA8B,IAAMe,GAAqBjB,CAAC,CAAC,EAChEE,EAAK,oBAA8B,IAAMgB,GAA8BlB,CAAC,CAAC,EACzEE,EAAK,mBAA8B,IAAMhB,GAAQ,KAAKc,CAAC,CAAC,CAC1D,CAQA,SAASM,GAAiBa,EAAYhB,EAAa,CACjDgB,EAAW,MAAM,EAAE,QAAQC,GAAK,CAC9B,IAAIC,EAAaF,EAAW,KAAKC,CAAC,EAC9BE,EAAcnB,EAAY,KAAKiB,CAAC,EAEhCC,IACFA,EAAW,EAAIC,EAAY,EAC3BD,EAAW,EAAIC,EAAY,EAC3BD,EAAW,MAAQC,EAAY,MAC/BD,EAAW,KAAOC,EAAY,KAE1BnB,EAAY,SAASiB,CAAC,EAAE,SAC1BC,EAAW,MAAQC,EAAY,MAC/BD,EAAW,OAASC,EAAY,QAGtC,CAAC,EAEDH,EAAW,MAAM,EAAE,QAAQI,GAAK,CAC9B,IAAIF,EAAaF,EAAW,KAAKI,CAAC,EAC9BD,EAAcnB,EAAY,KAAKoB,CAAC,EAEpCF,EAAW,OAASC,EAAY,OAC5B,OAAO,OAAOA,EAAa,GAAG,IAChCD,EAAW,EAAIC,EAAY,EAC3BD,EAAW,EAAIC,EAAY,EAE/B,CAAC,EAEDH,EAAW,MAAM,EAAE,MAAQhB,EAAY,MAAM,EAAE,MAC/CgB,EAAW,MAAM,EAAE,OAAShB,EAAY,MAAM,EAAE,MAClD,CAEA,IAAIqB,GAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,SAAS,EACtEC,GAAgB,CAAE,QAAS,GAAI,QAAS,GAAI,QAAS,GAAI,QAAS,IAAK,EACvEC,GAAa,CAAC,YAAa,SAAU,UAAW,OAAO,EACvDC,GAAe,CAAC,QAAS,SAAU,MAAM,EACzCC,GAAe,CAAE,MAAO,EAAG,OAAQ,CAAE,EACrCC,GAAe,CAAC,SAAU,SAAU,QAAS,SAAU,aAAa,EACpEC,GAAe,CACjB,OAAQ,EAAG,OAAQ,EAAG,MAAO,EAAG,OAAQ,EACxC,YAAa,GAAI,SAAU,GAC7B,EACIC,GAAY,CAAC,UAAU,EAQ3B,SAAS3B,GAAiBe,EAAY,CACpC,IAAInB,EAAI,IAAIF,GAAM,CAAE,WAAY,GAAM,SAAU,EAAK,CAAC,EAClDkC,EAAQC,EAAad,EAAW,MAAM,CAAC,EAE3C,OAAAnB,EAAE,SAAS,OAAO,OAAO,CAAC,EACxByB,GACAS,EAAkBF,EAAOR,EAAa,EACtC3B,EAAK,KAAKmC,EAAON,EAAU,CAAC,CAAC,EAE/BP,EAAW,MAAM,EAAE,QAAQC,GAAK,CAC9B,IAAIe,EAAOF,EAAad,EAAW,KAAKC,CAAC,CAAC,EACpCgB,EAAUF,EAAkBC,EAAMR,EAAY,EACpD,OAAO,KAAKC,EAAY,EAAE,QAAQS,GAAK,CACjCD,EAAQC,CAAC,IAAM,SACjBD,EAAQC,CAAC,EAAIT,GAAaS,CAAC,EAE/B,CAAC,EAEDrC,EAAE,QAAQoB,EAAGgB,CAAO,EACpBpC,EAAE,UAAUoB,EAAGD,EAAW,OAAOC,CAAC,CAAC,CACrC,CAAC,EAEDD,EAAW,MAAM,EAAE,QAAQI,GAAK,CAC9B,IAAIe,EAAOL,EAAad,EAAW,KAAKI,CAAC,CAAC,EAC1CvB,EAAE,QAAQuB,EAAG,OAAO,OAAO,CAAC,EAC1BO,GACAI,EAAkBI,EAAMT,EAAY,EACpChC,EAAK,KAAKyC,EAAMP,EAAS,CAAC,CAAC,CAC/B,CAAC,EAEM/B,CACT,CAUA,SAASO,GAAuBP,EAAG,CACjC,IAAIgC,EAAQhC,EAAE,MAAM,EACpBgC,EAAM,SAAW,EACjBhC,EAAE,MAAM,EAAE,QAAQuB,GAAK,CACrB,IAAIe,EAAOtC,EAAE,KAAKuB,CAAC,EACnBe,EAAK,QAAU,EACXA,EAAK,SAAS,YAAY,IAAM,MAC9BN,EAAM,UAAY,MAAQA,EAAM,UAAY,KAC9CM,EAAK,OAASA,EAAK,YAEnBA,EAAK,QAAUA,EAAK,YAG1B,CAAC,CACH,CAQA,SAAS7B,GAAuBT,EAAG,CACjCA,EAAE,MAAM,EAAE,QAAQuB,GAAK,CACrB,IAAIe,EAAOtC,EAAE,KAAKuB,CAAC,EACnB,GAAIe,EAAK,OAASA,EAAK,OAAQ,CAC7B,IAAIlB,EAAIpB,EAAE,KAAKuB,EAAE,CAAC,EAEdgB,EAAQ,CAAE,MADNvC,EAAE,KAAKuB,EAAE,CAAC,EACK,KAAOH,EAAE,MAAQ,EAAIA,EAAE,KAAM,EAAGG,CAAE,EACzD1B,EAAK,aAAaG,EAAG,aAAcuC,EAAO,KAAK,CACjD,CACF,CAAC,CACH,CAEA,SAAS7B,GAAiBV,EAAG,CAC3B,IAAIwC,EAAU,EACdxC,EAAE,MAAM,EAAE,QAAQoB,GAAK,CACrB,IAAIe,EAAOnC,EAAE,KAAKoB,CAAC,EACfe,EAAK,YACPA,EAAK,QAAUnC,EAAE,KAAKmC,EAAK,SAAS,EAAE,KACtCA,EAAK,QAAUnC,EAAE,KAAKmC,EAAK,YAAY,EAAE,KACzCK,EAAU,KAAK,IAAIA,EAASL,EAAK,OAAO,EAE5C,CAAC,EACDnC,EAAE,MAAM,EAAE,QAAUwC,CACtB,CAEA,SAAS7B,GAAuBX,EAAG,CACjCA,EAAE,MAAM,EAAE,QAAQoB,GAAK,CACrB,IAAIe,EAAOnC,EAAE,KAAKoB,CAAC,EACfe,EAAK,QAAU,eACjBnC,EAAE,KAAKmC,EAAK,CAAC,EAAE,UAAYA,EAAK,KAChCnC,EAAE,WAAWoB,CAAC,EAElB,CAAC,CACH,CAEA,SAASJ,GAAehB,EAAG,CACzB,IAAIyC,EAAO,OAAO,kBACdC,EAAO,EACPC,EAAO,OAAO,kBACdC,EAAO,EACPC,EAAa7C,EAAE,MAAM,EACrB8C,EAAUD,EAAW,SAAW,EAChCE,EAAUF,EAAW,SAAW,EAEpC,SAASG,EAAYC,EAAO,CAC1B,IAAIC,EAAID,EAAM,EACVE,EAAIF,EAAM,EACVG,EAAIH,EAAM,MACVI,EAAIJ,EAAM,OACdR,EAAO,KAAK,IAAIA,EAAMS,EAAIE,EAAI,CAAC,EAC/BV,EAAO,KAAK,IAAIA,EAAMQ,EAAIE,EAAI,CAAC,EAC/BT,EAAO,KAAK,IAAIA,EAAMQ,EAAIE,EAAI,CAAC,EAC/BT,EAAO,KAAK,IAAIA,EAAMO,EAAIE,EAAI,CAAC,CACjC,CAEArD,EAAE,MAAM,EAAE,QAAQoB,GAAK4B,EAAYhD,EAAE,KAAKoB,CAAC,CAAC,CAAC,EAC7CpB,EAAE,MAAM,EAAE,QAAQuB,GAAK,CACrB,IAAIe,EAAOtC,EAAE,KAAKuB,CAAC,EACf,OAAO,OAAOe,EAAM,GAAG,GACzBU,EAAYV,CAAI,CAEpB,CAAC,EAEDG,GAAQK,EACRH,GAAQI,EAER/C,EAAE,MAAM,EAAE,QAAQoB,GAAK,CACrB,IAAIe,EAAOnC,EAAE,KAAKoB,CAAC,EACnBe,EAAK,GAAKM,EACVN,EAAK,GAAKQ,CACZ,CAAC,EAED3C,EAAE,MAAM,EAAE,QAAQuB,GAAK,CACrB,IAAIe,EAAOtC,EAAE,KAAKuB,CAAC,EACnBe,EAAK,OAAO,QAAQgB,GAAK,CACvBA,EAAE,GAAKb,EACPa,EAAE,GAAKX,CACT,CAAC,EACG,OAAO,OAAOL,EAAM,GAAG,IAAKA,EAAK,GAAKG,GACtC,OAAO,OAAOH,EAAM,GAAG,IAAKA,EAAK,GAAKK,EAC5C,CAAC,EAEDE,EAAW,MAAQH,EAAOD,EAAOK,EACjCD,EAAW,OAASD,EAAOD,EAAOI,CACpC,CAEA,SAAS9B,GAAqBjB,EAAG,CAC/BA,EAAE,MAAM,EAAE,QAAQuB,GAAK,CACrB,IAAIe,EAAOtC,EAAE,KAAKuB,CAAC,EACfgC,EAAQvD,EAAE,KAAKuB,EAAE,CAAC,EAClBiC,EAAQxD,EAAE,KAAKuB,EAAE,CAAC,EAClBkC,EAAIC,EACHpB,EAAK,QAKRmB,EAAKnB,EAAK,OAAO,CAAC,EAClBoB,EAAKpB,EAAK,OAAOA,EAAK,OAAO,OAAS,CAAC,IALvCA,EAAK,OAAS,CAAC,EACfmB,EAAKD,EACLE,EAAKH,GAKPjB,EAAK,OAAO,QAAQzC,EAAK,cAAc0D,EAAOE,CAAE,CAAC,EACjDnB,EAAK,OAAO,KAAKzC,EAAK,cAAc2D,EAAOE,CAAE,CAAC,CAChD,CAAC,CACH,CAEA,SAAS3C,GAAqBf,EAAG,CAC/BA,EAAE,MAAM,EAAE,QAAQuB,GAAK,CACrB,IAAIe,EAAOtC,EAAE,KAAKuB,CAAC,EACnB,GAAI,OAAO,OAAOe,EAAM,GAAG,EAIzB,QAHIA,EAAK,WAAa,KAAOA,EAAK,WAAa,OAC7CA,EAAK,OAASA,EAAK,aAEbA,EAAK,SAAU,CACvB,IAAK,IAAKA,EAAK,GAAKA,EAAK,MAAQ,EAAIA,EAAK,YAAa,MACvD,IAAK,IAAKA,EAAK,GAAKA,EAAK,MAAQ,EAAIA,EAAK,YAAa,KACvD,CAEJ,CAAC,CACH,CAEA,SAASpB,GAA8BlB,EAAG,CACxCA,EAAE,MAAM,EAAE,QAAQuB,GAAK,CACrB,IAAIe,EAAOtC,EAAE,KAAKuB,CAAC,EACfe,EAAK,UACPA,EAAK,OAAO,QAAQ,CAExB,CAAC,CACH,CAEA,SAASxB,GAAkBd,EAAG,CAC5BA,EAAE,MAAM,EAAE,QAAQoB,GAAK,CACrB,GAAIpB,EAAE,SAASoB,CAAC,EAAE,OAAQ,CACxB,IAAIe,EAAOnC,EAAE,KAAKoB,CAAC,EACfuC,EAAI3D,EAAE,KAAKmC,EAAK,SAAS,EACzByB,EAAI5D,EAAE,KAAKmC,EAAK,YAAY,EAC5B0B,EAAI7D,EAAE,KAAKmC,EAAK,WAAWA,EAAK,WAAW,OAAS,CAAC,CAAC,EACtD2B,EAAI9D,EAAE,KAAKmC,EAAK,YAAYA,EAAK,YAAY,OAAS,CAAC,CAAC,EAE5DA,EAAK,MAAQ,KAAK,IAAI2B,EAAE,EAAID,EAAE,CAAC,EAC/B1B,EAAK,OAAS,KAAK,IAAIyB,EAAE,EAAID,EAAE,CAAC,EAChCxB,EAAK,EAAI0B,EAAE,EAAI1B,EAAK,MAAQ,EAC5BA,EAAK,EAAIwB,EAAE,EAAIxB,EAAK,OAAS,CAC/B,CACF,CAAC,EAEDnC,EAAE,MAAM,EAAE,QAAQoB,GAAK,CACjBpB,EAAE,KAAKoB,CAAC,EAAE,QAAU,UACtBpB,EAAE,WAAWoB,CAAC,CAElB,CAAC,CACH,CAEA,SAASZ,GAAgBR,EAAG,CAC1BA,EAAE,MAAM,EAAE,QAAQuB,GAAK,CACrB,GAAIA,EAAE,IAAMA,EAAE,EAAG,CACf,IAAIY,EAAOnC,EAAE,KAAKuB,EAAE,CAAC,EAChBY,EAAK,YACRA,EAAK,UAAY,CAAC,GAEpBA,EAAK,UAAU,KAAK,CAAE,EAAGZ,EAAG,MAAOvB,EAAE,KAAKuB,CAAC,CAAE,CAAC,EAC9CvB,EAAE,WAAWuB,CAAC,CAChB,CACF,CAAC,CACH,CAEA,SAASX,GAAgBZ,EAAG,CAC1B,IAAI+D,EAASlE,EAAK,iBAAiBG,CAAC,EACpC+D,EAAO,QAAQC,GAAS,CACtB,IAAIC,EAAa,EACjBD,EAAM,QAAQ,CAAC5C,EAAG8C,IAAM,CACtB,IAAI/B,EAAOnC,EAAE,KAAKoB,CAAC,EACnBe,EAAK,MAAQ+B,EAAID,GAChB9B,EAAK,WAAa,CAAC,GAAG,QAAQgC,GAAY,CACzCtE,EAAK,aAAaG,EAAG,WAAY,CAC/B,MAAOmE,EAAS,MAAM,MACtB,OAAQA,EAAS,MAAM,OACvB,KAAMhC,EAAK,KACX,MAAO+B,GAAK,EAAED,EACd,EAAGE,EAAS,EACZ,MAAOA,EAAS,KAClB,EAAG,KAAK,CACV,CAAC,EACD,OAAOhC,EAAK,SACd,CAAC,CACH,CAAC,CACH,CAEA,SAAStB,GAAkBb,EAAG,CAC5BA,EAAE,MAAM,EAAE,QAAQoB,GAAK,CACrB,IAAIe,EAAOnC,EAAE,KAAKoB,CAAC,EACnB,GAAIe,EAAK,QAAU,WAAY,CAC7B,IAAIiC,EAAWpE,EAAE,KAAKmC,EAAK,EAAE,CAAC,EAC1Be,EAAIkB,EAAS,EAAIA,EAAS,MAAQ,EAClCjB,EAAIiB,EAAS,EACbC,EAAKlC,EAAK,EAAIe,EACdoB,EAAKF,EAAS,OAAS,EAC3BpE,EAAE,QAAQmC,EAAK,EAAGA,EAAK,KAAK,EAC5BnC,EAAE,WAAWoB,CAAC,EACde,EAAK,MAAM,OAAS,CAClB,CAAE,EAAGe,EAAI,EAAImB,EAAK,EAAG,EAAGlB,EAAImB,CAAG,EAC/B,CAAE,EAAGpB,EAAI,EAAImB,EAAK,EAAG,EAAGlB,EAAImB,CAAG,EAC/B,CAAE,EAAGpB,EAAQmB,EAAQ,EAAGlB,CAAE,EAC1B,CAAE,EAAGD,EAAI,EAAImB,EAAK,EAAG,EAAGlB,EAAImB,CAAG,EAC/B,CAAE,EAAGpB,EAAI,EAAImB,EAAK,EAAG,EAAGlB,EAAImB,CAAG,CACjC,EACAnC,EAAK,MAAM,EAAIA,EAAK,EACpBA,EAAK,MAAM,EAAIA,EAAK,CACtB,CACF,CAAC,CACH,CAEA,SAASD,EAAkBqC,EAAKtB,EAAO,CACrC,OAAOpD,EAAK,UAAUA,EAAK,KAAK0E,EAAKtB,CAAK,EAAG,MAAM,CACrD,CAEA,SAAShB,EAAagB,EAAO,CAC3B,IAAIuB,EAAW,CAAC,EAChB,OAAIvB,GACF,OAAO,QAAQA,CAAK,EAAE,QAAQ,CAAC,CAACZ,EAAGjB,CAAC,IAAM,CACpC,OAAOiB,GAAM,WACfA,EAAIA,EAAE,YAAY,GAGpBmC,EAASnC,CAAC,EAAIjB,CAChB,CAAC,EAEIoD,CACT,ICtZA,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,KAAIC,GAAO,IACPC,GAAQ,EAAQ,mBAAmB,EAAE,MAEzCF,GAAO,QAAU,CACf,cAAeG,EACjB,EAGA,SAASA,GAAcC,EAAG,CACxB,IAAIC,EAAcJ,GAAK,iBAAiBG,CAAC,EAErCE,EAAI,IAAIJ,GAAM,CAAE,SAAU,GAAM,WAAY,EAAK,CAAC,EAAE,SAAS,CAAC,CAAC,EAEnE,OAAAE,EAAE,MAAM,EAAE,QAAQG,GAAK,CACrBD,EAAE,QAAQC,EAAG,CAAE,MAAOA,CAAE,CAAC,EACzBD,EAAE,UAAUC,EAAG,QAAUH,EAAE,KAAKG,CAAC,EAAE,IAAI,CACzC,CAAC,EAEDH,EAAE,MAAM,EAAE,QAAQI,GAAKF,EAAE,QAAQE,EAAE,EAAGA,EAAE,EAAG,CAAC,EAAGA,EAAE,IAAI,CAAC,EAEtDH,EAAY,QAAQ,CAACI,EAAO,IAAM,CAChC,IAAIC,EAAS,QAAU,EACvBJ,EAAE,QAAQI,EAAQ,CAAE,KAAM,MAAO,CAAC,EAClCD,EAAM,OAAO,CAACE,EAAGJ,KACfD,EAAE,QAAQK,EAAGJ,EAAG,CAAE,MAAO,OAAQ,CAAC,EAC3BA,EACR,CACH,CAAC,EAEMD,CACT,IC9BA,IAAAM,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CAAAA,GAAO,QAAU,UCAjB,IAAAC,GAAAC,EAAA,CAAAC,GAAAC,KAAA,CAwBAA,GAAO,QAAU,CACf,SAAU,EAAQ,mBAAmB,EAErC,OAAQ,KACR,MAAO,KACP,KAAM,CACJ,KAAM,IAAsB,KAC5B,OAAQ,IAAsB,MAChC,EACA,QAAS,IACX",
-  "names": ["require_list", "__commonJSMin", "exports", "module", "List", "sentinel", "entry", "unlink", "strs", "curr", "filterOutLinks", "k", "v", "require_greedy_fas", "__commonJSMin", "exports", "module", "Graph", "List", "greedyFAS", "DEFAULT_WEIGHT_FN", "g", "weightFn", "state", "buildState", "doGreedyFAS", "e", "buckets", "zeroIdx", "results", "sources", "sinks", "entry", "removeNode", "i", "collectPredecessors", "edge", "weight", "uEntry", "assignBucket", "w", "wEntry", "fasGraph", "maxIn", "maxOut", "v", "prevWeight", "edgeWeight", "range", "limit", "require_util", "__commonJSMin", "exports", "module", "Graph", "addBorderNode", "addDummyNode", "applyWithChunking", "asNonCompoundGraph", "buildLayerMatrix", "intersectRect", "mapValues", "maxRank", "normalizeRanks", "notime", "partition", "pick", "predecessorWeights", "range", "removeEmptyRanks", "simplify", "successorWeights", "time", "uniqueId", "zipObject", "g", "type", "attrs", "name", "v", "simplified", "e", "simpleLabel", "label", "weightMap", "sucs", "preds", "rect", "point", "x", "y", "dx", "dy", "w", "h", "sx", "sy", "layering", "node", "rank", "nodeRanks", "min", "offset", "layers", "delta", "nodeRankFactor", "vs", "i", "prefix", "order", "splitToChunks", "array", "chunkSize", "CHUNKING_THRESHOLD", "chunks", "chunk", "fn", "argsArray", "collection", "result", "value", "start", "idCounter", "id", "limit", "step", "endCon", "source", "keys", "dest", "key", "obj", "funcOrProp", "func", "val", "acc", "k", "props", "values", "require_acyclic", "__commonJSMin", "exports", "module", "greedyFAS", "uniqueId", "run", "undo", "g", "weightFn", "dfsFAS", "e", "label", "fas", "stack", "visited", "dfs", "v", "forwardName", "require_normalize", "__commonJSMin", "exports", "module", "util", "run", "undo", "g", "edge", "normalizeEdge", "e", "v", "vRank", "w", "wRank", "name", "edgeLabel", "labelRank", "dummy", "attrs", "i", "node", "origLabel", "require_util", "__commonJSMin", "exports", "module", "applyWithChunking", "longestPath", "slack", "g", "visited", "dfs", "v", "label", "outEdgesMinLens", "e", "rank", "require_feasible_tree", "__commonJSMin", "exports", "module", "Graph", "slack", "feasibleTree", "g", "start", "size", "edge", "delta", "tightTree", "findMinSlackEdge", "shiftRanks", "t", "dfs", "v", "e", "edgeV", "w", "acc", "edgeSlack", "require_network_simplex", "__commonJSMin", "exports", "module", "feasibleTree", "slack", "initRank", "preorder", "postorder", "simplify", "networkSimplex", "initLowLimValues", "initCutValues", "calcCutValue", "leaveEdge", "enterEdge", "exchangeEdges", "g", "e", "f", "t", "vs", "v", "assignCutValue", "child", "childLab", "parent", "childIsTail", "graphEdge", "cutValue", "isOutEdge", "other", "pointsToHead", "otherWeight", "isTreeEdge", "otherCutValue", "tree", "root", "dfsAssignLowLim", "visited", "nextLim", "low", "label", "w", "edge", "vLabel", "wLabel", "tailLabel", "flip", "candidates", "isDescendant", "acc", "updateRanks", "flipped", "u", "rootLabel", "require_rank", "__commonJSMin", "exports", "module", "rankUtil", "longestPath", "feasibleTree", "networkSimplex", "rank", "g", "ranker", "networkSimplexRanker", "tightTreeRanker", "longestPathRanker", "require_parent_dummy_chains", "__commonJSMin", "exports", "module", "parentDummyChains", "g", "postorderNums", "postorder", "v", "node", "edgeObj", "pathData", "findPath", "path", "lca", "pathIdx", "pathV", "ascending", "w", "vPath", "wPath", "low", "lim", "parent", "result", "dfs", "require_nesting_graph", "__commonJSMin", "exports", "module", "util", "run", "cleanup", "g", "root", "depths", "treeDepths", "depthsArr", "height", "nodeSep", "e", "weight", "sumWeights", "child", "dfs", "v", "children", "top", "bottom", "label", "childNode", "childTop", "childBottom", "thisWeight", "minlen", "depth", "acc", "graphLabel", "edge", "require_add_border_segments", "__commonJSMin", "exports", "module", "util", "addBorderSegments", "g", "dfs", "v", "children", "node", "rank", "maxRank", "addBorderNode", "prop", "prefix", "sg", "sgNode", "label", "prev", "curr", "require_coordinate_system", "__commonJSMin", "exports", "module", "adjust", "undo", "g", "rankDir", "swapWidthHeight", "reverseY", "swapXY", "v", "swapWidthHeightOne", "e", "attrs", "w", "reverseYOne", "edge", "swapXYOne", "x", "require_init_order", "__commonJSMin", "exports", "module", "util", "initOrder", "g", "visited", "simpleNodes", "v", "simpleNodesRanks", "maxRank", "layers", "dfs", "node", "a", "b", "require_cross_count", "__commonJSMin", "exports", "module", "zipObject", "crossCount", "g", "layering", "cc", "i", "twoLayerCrossCount", "northLayer", "southLayer", "southPos", "v", "southEntries", "e", "a", "b", "firstIndex", "treeSize", "tree", "entry", "index", "weightSum", "require_barycenter", "__commonJSMin", "exports", "module", "barycenter", "g", "movable", "v", "inV", "result", "acc", "e", "edge", "nodeU", "require_resolve_conflicts", "__commonJSMin", "exports", "module", "util", "resolveConflicts", "entries", "cg", "mappedEntries", "entry", "i", "tmp", "e", "entryV", "entryW", "sourceSet", "doResolveConflicts", "handleIn", "vEntry", "uEntry", "mergeEntries", "handleOut", "wEntry", "target", "source", "sum", "weight", "require_sort", "__commonJSMin", "exports", "module", "util", "sort", "entries", "biasRight", "parts", "entry", "sortable", "unsortable", "a", "b", "vs", "sum", "weight", "vsIndex", "compareWithBias", "consumeUnsortable", "result", "index", "last", "bias", "entryV", "entryW", "require_sort_subgraph", "__commonJSMin", "exports", "module", "barycenter", "resolveConflicts", "sort", "sortSubgraph", "g", "v", "cg", "biasRight", "movable", "node", "bl", "br", "subgraphs", "w", "barycenters", "entry", "subgraphResult", "mergeBarycenters", "entries", "expandSubgraphs", "result", "blPred", "brPred", "target", "other", "require_build_layer_graph", "__commonJSMin", "exports", "module", "Graph", "util", "buildLayerGraph", "g", "rank", "relationship", "nodesWithRank", "root", "createRootNode", "result", "v", "node", "parent", "e", "edge", "weight", "require_add_subgraph_constraints", "__commonJSMin", "exports", "module", "addSubgraphConstraints", "g", "cg", "vs", "prev", "rootPrev", "v", "child", "parent", "prevChild", "require_order", "__commonJSMin", "exports", "module", "initOrder", "crossCount", "sortSubgraph", "buildLayerGraph", "addSubgraphConstraints", "Graph", "util", "order", "g", "opts", "maxRank", "downLayerGraphs", "buildLayerGraphs", "upLayerGraphs", "layering", "assignOrder", "bestCC", "best", "constraints", "i", "lastBest", "sweepLayerGraphs", "cc", "ranks", "relationship", "nodesByRank", "addNodeToRank", "rank", "node", "v", "r", "layerGraphs", "biasRight", "cg", "lg", "con", "root", "sorted", "layer", "require_bk", "__commonJSMin", "exports", "module", "Graph", "util", "positionX", "findType1Conflicts", "findType2Conflicts", "addConflict", "hasConflict", "verticalAlignment", "horizontalCompaction", "alignCoordinates", "findSmallestWidthAlignment", "balance", "g", "layering", "conflicts", "visitLayer", "prevLayer", "layer", "k0", "scanPos", "prevLayerLength", "lastNode", "v", "i", "w", "findOtherInnerSegmentNode", "k1", "scanNode", "u", "uLabel", "uPos", "scan", "south", "southPos", "southEnd", "prevNorthBorder", "nextNorthBorder", "uNode", "north", "prevNorthPos", "nextNorthPos", "southLookahead", "predecessors", "tmp", "conflictsV", "neighborFn", "root", "align", "pos", "order", "prevIdx", "ws", "a", "b", "mp", "il", "reverseSep", "xs", "blockG", "buildBlockGraph", "borderType", "iterate", "setXsFunc", "nextNodesFunc", "stack", "visited", "elem", "nextElem", "pass1", "acc", "e", "pass2", "min", "node", "blockGraph", "graphLabel", "sepFn", "sep", "vRoot", "uRoot", "prevMax", "xss", "currentMinAndXs", "max", "x", "halfWidth", "width", "newMin", "alignTo", "alignToVals", "alignToMin", "alignToMax", "vert", "horiz", "alignment", "xsVals", "delta", "num", "adjustedLayering", "inner", "smallestWidth", "nodeSep", "edgeSep", "vLabel", "wLabel", "sum", "require_position", "__commonJSMin", "exports", "module", "util", "positionX", "position", "g", "positionY", "v", "x", "layering", "rankSep", "prevY", "layer", "maxHeight", "acc", "height", "require_layout", "__commonJSMin", "exports", "module", "acyclic", "normalize", "rank", "normalizeRanks", "parentDummyChains", "removeEmptyRanks", "nestingGraph", "addBorderSegments", "coordinateSystem", "order", "position", "util", "Graph", "layout", "g", "opts", "time", "layoutGraph", "buildLayoutGraph", "runLayout", "updateInputGraph", "makeSpaceForEdgeLabels", "removeSelfEdges", "injectEdgeLabelProxies", "assignRankMinMax", "removeEdgeLabelProxies", "insertSelfEdges", "positionSelfEdges", "removeBorderNodes", "fixupEdgeLabelCoords", "translateGraph", "assignNodeIntersects", "reversePointsForReversedEdges", "inputGraph", "v", "inputLabel", "layoutLabel", "e", "graphNumAttrs", "graphDefaults", "graphAttrs", "nodeNumAttrs", "nodeDefaults", "edgeNumAttrs", "edgeDefaults", "edgeAttrs", "graph", "canonicalize", "selectNumberAttrs", "node", "newNode", "k", "edge", "label", "maxRank", "minX", "maxX", "minY", "maxY", "graphLabel", "marginX", "marginY", "getExtremes", "attrs", "x", "y", "w", "h", "p", "nodeV", "nodeW", "p1", "p2", "t", "b", "l", "r", "layers", "layer", "orderShift", "i", "selfEdge", "selfNode", "dx", "dy", "obj", "newAttrs", "require_debug", "__commonJSMin", "exports", "module", "util", "Graph", "debugOrdering", "g", "layerMatrix", "h", "v", "e", "layer", "layerV", "u", "require_version", "__commonJSMin", "exports", "module", "require_index", "__commonJSMin", "exports", "module"]
+  "sources": ["../index.ts", "../node_modules/@dagrejs/graphlib/lib/graph.ts", "../node_modules/@dagrejs/graphlib/lib/version.ts", "../node_modules/@dagrejs/graphlib/lib/json.ts", "../node_modules/@dagrejs/graphlib/lib/alg/index.ts", "../node_modules/@dagrejs/graphlib/lib/alg/bellman-ford.ts", "../node_modules/@dagrejs/graphlib/lib/alg/components.ts", "../node_modules/@dagrejs/graphlib/lib/data/priority-queue.ts", "../node_modules/@dagrejs/graphlib/lib/alg/dijkstra.ts", "../node_modules/@dagrejs/graphlib/lib/alg/dijkstra-all.ts", "../node_modules/@dagrejs/graphlib/lib/alg/tarjan.ts", "../node_modules/@dagrejs/graphlib/lib/alg/find-cycles.ts", "../node_modules/@dagrejs/graphlib/lib/alg/floyd-warshall.ts", "../node_modules/@dagrejs/graphlib/lib/alg/topsort.ts", "../node_modules/@dagrejs/graphlib/lib/alg/is-acyclic.ts", "../node_modules/@dagrejs/graphlib/lib/alg/reduce.ts", "../node_modules/@dagrejs/graphlib/lib/alg/dfs.ts", "../node_modules/@dagrejs/graphlib/lib/alg/postorder.ts", "../node_modules/@dagrejs/graphlib/lib/alg/preorder.ts", "../node_modules/@dagrejs/graphlib/lib/alg/prim.ts", "../node_modules/@dagrejs/graphlib/lib/alg/shortest-paths.ts", "../lib/util.ts", "../lib/version.ts", "../lib/data/list.ts", "../lib/greedy-fas.ts", "../lib/acyclic.ts", "../lib/normalize.ts", "../lib/rank/util.ts", "../lib/rank/feasible-tree.ts", "../lib/rank/network-simplex.ts", "../lib/rank/index.ts", "../lib/parent-dummy-chains.ts", "../lib/nesting-graph.ts", "../lib/add-border-segments.ts", "../lib/coordinate-system.ts", "../lib/order/init-order.ts", "../lib/order/cross-count.ts", "../lib/order/barycenter.ts", "../lib/order/resolve-conflicts.ts", "../lib/order/sort.ts", "../lib/order/sort-subgraph.ts", "../lib/order/build-layer-graph.ts", "../lib/order/add-subgraph-constraints.ts", "../lib/order/index.ts", "../lib/position/bk.ts", "../lib/position/index.ts", "../lib/layout.ts", "../lib/debug.ts"],
+  "sourcesContent": ["/*\n@license\n\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nimport * as graphlib from '@dagrejs/graphlib';\nimport {notime, time} from './lib/util';\nimport {version} from './lib/version';\nimport {layout} from './lib/layout';\nimport {debugOrdering as debug} from './lib/debug';\n\nexport {graphlib};\n\nexport {Graph} from '@dagrejs/graphlib';\nexport {version} from './lib/version';\nexport {layout} from './lib/layout';\nexport {debugOrdering as debug} from './lib/debug';\n\nexport const util = {time, notime};\n\n// Export types\nexport type {\n    GraphLabel,\n    NodeConfig,\n    EdgeConfig,\n    LayoutConfig,\n    LayoutOptions,\n    NodeLabel,\n    EdgeLabel,\n    Point,\n    OrderConstraint,\n    WeightFunction,\n    RankerFunction,\n    Edge\n} from './lib/types';\n\nconst dagre = {\n    graphlib,\n    version,\n    layout,\n    debug,\n    util: {time, notime},\n};\n\nexport default dagre;\n", "import type {Edge, EdgeLabelFactory, GraphOptions, NodeLabelFactory} from './types';\n\nconst DEFAULT_EDGE_NAME = \"\\x00\";\nconst GRAPH_NODE = \"\\x00\";\nconst EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nexport class Graph<GraphLabel = any, NodeLabel = any, EdgeLabel = any> {\n    private _isDirected: boolean = true;\n    private _isMultigraph: boolean = false;\n    private _isCompound: boolean = false;\n\n    // Label for the graph itself\n    private _label!: GraphLabel;\n    // v -> label\n    private _nodes: Record<string, NodeLabel> = {};\n    // v -> edgeObj\n    private _in: Record<string, Record<string, Edge>> = {};\n    // u -> v -> Number\n    private _preds: Record<string, Record<string, number>> = {};\n    // v -> edgeObj\n    private _out: Record<string, Record<string, Edge>> = {};\n    // v -> w -> Number\n    private _sucs: Record<string, Record<string, number>> = {};\n    // e -> edgeObj\n    private _edgeObjs: Record<string, Edge> = {};\n    // e -> label\n    private _edgeLabels: Record<string, EdgeLabel> = {};\n    /* Number of nodes in the graph. Should only be changed by the implementation. */\n    private _nodeCount: number = 0;\n    /* Number of edges in the graph. Should only be changed by the implementation. */\n    private _edgeCount: number = 0;\n    private _parent?: Record<string, string>;\n    private _children?: Record<string, Record<string, boolean>>;\n\n    constructor(opts?: GraphOptions) {\n        if (opts) {\n            this._isDirected = \"directed\" in opts ? opts.directed! : true;\n            this._isMultigraph = \"multigraph\" in opts ? opts.multigraph! : false;\n            this._isCompound = \"compound\" in opts ? opts.compound! : false;\n        }\n\n        if (this._isCompound) {\n            // v -> parent\n            this._parent = {};\n\n            // v -> children\n            this._children = {};\n            this._children[GRAPH_NODE] = {};\n        }\n    }\n\n    /**\n     * Whether graph was created with 'directed' flag set to true or not.\n     *\n     * @returns whether the graph edges have an orientation.\n     */\n    isDirected(): boolean {\n        return this._isDirected;\n    }\n\n    /**\n     * Whether graph was created with 'multigraph' flag set to true or not.\n     *\n     * @returns whether the pair of nodes of the graph can have multiple edges.\n     */\n    isMultigraph(): boolean {\n        return this._isMultigraph;\n    }\n\n    /* === Graph functions ========= */\n\n    /**\n     * Whether graph was created with 'compound' flag set to true or not.\n     *\n     * @returns whether a node of the graph can have subnodes.\n     */\n    isCompound(): boolean {\n        return this._isCompound;\n    }\n\n    /**\n     * Sets the label of the graph.\n     *\n     * @param label - label value.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setGraph(label: GraphLabel): this {\n        this._label = label;\n        return this;\n    }\n\n    /**\n     * Gets the graph label.\n     *\n     * @returns currently assigned label for the graph or undefined if no label assigned.\n     */\n    graph(): GraphLabel {\n        // TODO: This should return undefined if no label was assigned, but that would be a breaking change.\n        return this._label;\n    }\n\n    /**\n     * Sets the default node label. This label will be assigned as default label\n     * in case if no label was specified while setting a node.\n     * Complexity: O(1).\n     *\n     * @param labelOrFn - default node label or label factory function.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setDefaultNodeLabel(labelOrFn: NodeLabel | NodeLabelFactory<NodeLabel>): this {\n        if (typeof labelOrFn !== 'function') {\n            this._defaultNodeLabelFn = () => labelOrFn;\n        } else {\n            this._defaultNodeLabelFn = labelOrFn as NodeLabelFactory<NodeLabel>;\n        }\n\n        return this;\n    }\n\n    /**\n     * Gets the number of nodes in the graph.\n     * Complexity: O(1).\n     *\n     * @returns nodes count.\n     */\n    nodeCount(): number {\n        return this._nodeCount;\n    }\n\n\n    /* === Node functions ========== */\n\n    /**\n     * Gets all nodes of the graph. Note, the in case of compound graph subnodes are\n     * not included in list.\n     * Complexity: O(1).\n     *\n     * @returns list of graph nodes.\n     */\n    nodes(): string[] {\n        return Object.keys(this._nodes);\n    }\n\n    /**\n     * Gets list of nodes without in-edges.\n     * Complexity: O(|V|).\n     *\n     * @returns the graph source nodes.\n     */\n    sources(): string[] {\n        return this.nodes().filter(v => Object.keys(this._in[v]!).length === 0);\n    }\n\n    /**\n     * Gets list of nodes without out-edges.\n     * Complexity: O(|V|).\n     *\n     * @returns the graph sink nodes.\n     */\n    sinks(): string[] {\n        return this.nodes().filter(v => Object.keys(this._out[v]!).length === 0);\n    }\n\n    /**\n     * Invokes setNode method for each node in names list.\n     * Complexity: O(|names|).\n     *\n     * @param names - list of nodes names to be set.\n     * @param label - value to set for each node in list.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setNodes(names: string[], label?: NodeLabel): this {\n        names.forEach((v) => {\n            if (label !== undefined) {\n                this.setNode(v, label);\n            } else {\n                this.setNode(v);\n            }\n        });\n        return this;\n    }\n\n    /**\n     * Creates or updates the value for the node v in the graph. If label is supplied\n     * it is set as the value for the node. If label is not supplied and the node was\n     * created by this call then the default node label will be assigned.\n     * Complexity: O(1).\n     *\n     * @param name - node name.\n     * @param label - value to set for node.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setNode(name: string, label?: NodeLabel): this {\n        if (name in this._nodes) {\n            if (arguments.length > 1) {\n                this._nodes[name] = label!;\n            }\n            return this;\n        }\n\n        this._nodes[name] = arguments.length > 1 ? label! : this._defaultNodeLabelFn(name);\n        if (this._isCompound) {\n            this._parent![name] = GRAPH_NODE;\n            this._children![name] = {};\n            this._children![GRAPH_NODE]![name] = true;\n        }\n        this._in[name] = {};\n        this._preds[name] = {};\n        this._out[name] = {};\n        this._sucs[name] = {};\n        ++this._nodeCount;\n        return this;\n    }\n\n    /**\n     * Gets the label of node with specified name.\n     * Complexity: O(|V|).\n     *\n     * @param name - node name.\n     * @returns label value of the node.\n     */\n    node(name: string): NodeLabel {\n        // TODO: This should return undefined if the node doesn't exist, but that would be a breaking change.\n        return this._nodes[name]!;\n    }\n\n    /**\n     * Detects whether graph has a node with specified name or not.\n     *\n     * @param name - name of the node.\n     * @returns true if graph has node with specified name, false - otherwise.\n     */\n    hasNode(name: string): boolean {\n        return name in this._nodes;\n    }\n\n    /**\n     * Remove the node with the name from the graph or do nothing if the node is not in\n     * the graph. If the node was removed this function also removes any incident\n     * edges.\n     * Complexity: O(1).\n     *\n     * @param name - name of the node.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    removeNode(name: string): this {\n        if (name in this._nodes) {\n            const removeEdge = (e: string) => this.removeEdge(this._edgeObjs[e]!);\n            delete this._nodes[name];\n            if (this._isCompound) {\n                this._removeFromParentsChildList(name);\n                delete this._parent![name];\n                this.children(name).forEach((child) => {\n                    this.setParent(child);\n                });\n                delete this._children![name];\n            }\n            Object.keys(this._in[name]!).forEach(removeEdge);\n            delete this._in[name];\n            delete this._preds[name];\n            Object.keys(this._out[name]!).forEach(removeEdge);\n            delete this._out[name];\n            delete this._sucs[name];\n            --this._nodeCount;\n        }\n        return this;\n    }\n\n    /**\n     * Sets node parent for node v if it is defined, or removes the\n     * parent for v if p is undefined. Method throws an exception in case of\n     * invoking it in context of noncompound graph.\n     * Average-case complexity: O(1).\n     *\n     * @param v - node to be child for p.\n     * @param parent - node to be parent for v.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setParent(v: string, parent?: string): this {\n        if (!this._isCompound) {\n            throw new Error(\"Cannot set parent in a non-compound graph\");\n        }\n\n        if (parent === undefined) {\n            parent = GRAPH_NODE;\n        } else {\n            // Coerce parent to string\n            parent += \"\";\n            for (let ancestor: string | undefined | void = parent; ancestor !== undefined; ancestor = this.parent(ancestor)) {\n                if (ancestor === v) {\n                    throw new Error(\"Setting \" + parent + \" as parent of \" + v +\n                        \" would create a cycle\");\n                }\n            }\n\n            this.setNode(parent);\n        }\n\n        this.setNode(v);\n        this._removeFromParentsChildList(v);\n        this._parent![v] = parent;\n        this._children![parent]![v] = true;\n        return this;\n    }\n\n    /**\n     * Gets parent node for node v.\n     * Complexity: O(1).\n     *\n     * @param v - node to get parent of.\n     * @returns parent node name or void if v has no parent.\n     */\n    parent(v: string): string | void {\n        if (this._isCompound) {\n            const parent = this._parent![v];\n            if (parent !== GRAPH_NODE) {\n                return parent;\n            }\n        }\n    }\n\n    /**\n     * Gets list of direct children of node v.\n     * Complexity: O(1).\n     *\n     * @param v - node to get children of.\n     * @returns children nodes names list.\n     */\n    children(v: string = GRAPH_NODE): string[] {\n        if (this._isCompound) {\n            const children = this._children![v];\n            if (children) {\n                return Object.keys(children);\n            }\n        } else if (v === GRAPH_NODE) {\n            return this.nodes();\n        } else if (this.hasNode(v)) {\n            return [];\n        }\n        return [];\n    }\n\n    /**\n     * Return all nodes that are predecessors of the specified node or undefined if node v is not in\n     * the graph. Behavior is undefined for undirected graphs - use neighbors instead.\n     * Complexity: O(|V|).\n     *\n     * @param v - node identifier.\n     * @returns node identifiers list or undefined if v is not in the graph.\n     */\n    predecessors(v: string): void | string[] {\n        const predsV = this._preds[v];\n        if (predsV) {\n            return Object.keys(predsV);\n        }\n    }\n\n    /**\n     * Return all nodes that are successors of the specified node or undefined if node v is not in\n     * the graph. Behavior is undefined for undirected graphs - use neighbors instead.\n     * Complexity: O(|V|).\n     *\n     * @param v - node identifier.\n     * @returns node identifiers list or undefined if v is not in the graph.\n     */\n    successors(v: string): void | string[] {\n        const sucsV = this._sucs[v];\n        if (sucsV) {\n            return Object.keys(sucsV);\n        }\n    }\n\n    /**\n     * Return all nodes that are predecessors or successors of the specified node or undefined if\n     * node v is not in the graph.\n     * Complexity: O(|V|).\n     *\n     * @param v - node identifier.\n     * @returns node identifiers list or undefined if v is not in the graph.\n     */\n    neighbors(v: string): void | string[] {\n        const preds = this.predecessors(v);\n        if (preds) {\n            const union = new Set(preds);\n            for (const succ of this.successors(v)!) {\n                union.add(succ);\n            }\n\n            return Array.from(union.values());\n        }\n    }\n\n    isLeaf(v: string): boolean {\n        let neighbors: string[] | void;\n        if (this.isDirected()) {\n            neighbors = this.successors(v);\n        } else {\n            neighbors = this.neighbors(v);\n        }\n        return neighbors!.length === 0;\n    }\n\n    /**\n     * Creates new graph with nodes filtered via filter. Edges incident to rejected node\n     * are also removed. In case of compound graph, if parent is rejected by filter,\n     * than all its children are rejected too.\n     * Average-case complexity: O(|E|+|V|).\n     *\n     * @param filter - filtration function detecting whether the node should stay or not.\n     * @returns new graph made from current and nodes filtered.\n     */\n    filterNodes(filter: (v: string) => boolean): this {\n        const copy = new (this.constructor as typeof Graph<GraphLabel, NodeLabel, EdgeLabel>)({\n            directed: this._isDirected,\n            multigraph: this._isMultigraph,\n            compound: this._isCompound\n        });\n\n        copy.setGraph(this.graph()!);\n\n        Object.entries(this._nodes).forEach(([v, value]) => {\n            if (filter(v)) {\n                copy.setNode(v, value);\n            }\n        });\n\n        Object.values(this._edgeObjs).forEach((e) => {\n            if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n                copy.setEdge(e, this.edge(e));\n            }\n        });\n\n        const parents: Record<string, string | undefined> = {};\n        const findParent = (v: string): string | undefined => {\n            const parent = this.parent(v);\n            if (!parent || copy.hasNode(parent)) {\n                parents[v] = parent ?? undefined;\n                return parent ?? undefined;\n            } else if (parent in parents) {\n                return parents[parent];\n            } else {\n                return findParent(parent);\n            }\n        };\n\n        if (this._isCompound) {\n            copy.nodes().forEach(v => copy.setParent(v, findParent(v)));\n        }\n\n        return copy as this;\n    }\n\n    /**\n     * Sets the default edge label. This label will be assigned as default label\n     * in case if no label was specified while setting an edge.\n     * Complexity: O(1).\n     *\n     * @param labelOrFn - default edge label or label factory function.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setDefaultEdgeLabel(labelOrFn: EdgeLabel | EdgeLabelFactory<EdgeLabel>): this {\n        if (typeof labelOrFn !== 'function') {\n            this._defaultEdgeLabelFn = () => labelOrFn;\n        } else {\n            this._defaultEdgeLabelFn = labelOrFn as EdgeLabelFactory<EdgeLabel>;\n        }\n\n        return this;\n    }\n\n    /**\n     * Gets the number of edges in the graph.\n     * Complexity: O(1).\n     *\n     * @returns edges count.\n     */\n    edgeCount(): number {\n        return this._edgeCount;\n    }\n\n    /**\n     * Gets edges of the graph. In case of compound graph subgraphs are not considered.\n     * Complexity: O(|E|).\n     *\n     * @returns graph edges list.\n     */\n    edges(): Edge[] {\n        return Object.values(this._edgeObjs);\n    }\n\n    /* === Edge functions ========== */\n\n    /**\n     * Establish an edges path over the nodes in nodes list. If some edge is already\n     * exists, it will update its label, otherwise it will create an edge between pair\n     * of nodes with label provided or default label if no label provided.\n     * Complexity: O(|nodes|).\n     *\n     * @param nodes - list of nodes to be connected in series.\n     * @param label - value to set for each edge between pairs of nodes.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setPath(nodes: string[], label?: EdgeLabel): this {\n        nodes.reduce((v, w) => {\n            if (label !== undefined) {\n                this.setEdge(v, w, label);\n            } else {\n                this.setEdge(v, w);\n            }\n            return w;\n        });\n        return this;\n    }\n\n    /**\n     * Creates or updates the label for the edge (v, w) with the optionally supplied\n     * name. If label is supplied it is set as the value for the edge. If label is not\n     * supplied and the edge was created by this call then the default edge label will\n     * be assigned. The name parameter is only useful with multigraphs.\n     * Complexity: O(1).\n     *\n     * @param v - edge source node.\n     * @param w - edge sink node.\n     * @param label - value to associate with the edge.\n     * @param name - unique name of the edge in order to identify it in multigraph.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setEdge(v: string, w: string, label?: EdgeLabel, name?: string): this;\n\n    /**\n     * Creates or updates the label for the specified edge. If label is supplied it is\n     * set as the value for the edge. If label is not supplied and the edge was created\n     * by this call then the default edge label will be assigned. The name parameter is\n     * only useful with multigraphs.\n     * Complexity: O(1).\n     *\n     * @param edge - edge descriptor.\n     * @param label - value to associate with the edge.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    setEdge(edge: Edge, label?: EdgeLabel): this;\n\n    setEdge(v: string | Edge, w?: string | EdgeLabel, value?: EdgeLabel, name?: string): this {\n        let vStr: string;\n        let wStr: string;\n        let nameStr: string | undefined;\n        let edgeValue: EdgeLabel | undefined;\n        let valueSpecified = false;\n\n        if (typeof v === \"object\" && v !== null && \"v\" in v) {\n            vStr = v.v;\n            wStr = v.w;\n            nameStr = v.name;\n            if (arguments.length === 2) {\n                edgeValue = w as EdgeLabel;\n                valueSpecified = true;\n            }\n        } else {\n            vStr = v;\n            wStr = w as string;\n            nameStr = name;\n            if (arguments.length > 2) {\n                edgeValue = value;\n                valueSpecified = true;\n            }\n        }\n\n        vStr = \"\" + vStr;\n        wStr = \"\" + wStr;\n        if (nameStr !== undefined) {\n            nameStr = \"\" + nameStr;\n        }\n\n        const e = edgeArgsToId(this._isDirected, vStr, wStr, nameStr);\n        if (e in this._edgeLabels) {\n            if (valueSpecified) {\n                this._edgeLabels[e] = edgeValue!;\n            }\n            return this;\n        }\n\n        if (nameStr !== undefined && !this._isMultigraph) {\n            throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n        }\n\n        // It didn't exist, so we need to create it.\n        // First ensure the nodes exist.\n        this.setNode(vStr);\n        this.setNode(wStr);\n\n        this._edgeLabels[e] = valueSpecified ? edgeValue! : this._defaultEdgeLabelFn(vStr, wStr, nameStr);\n\n        // Ensure we add undirected edges in a consistent way.\n        const edgeObj = edgeArgsToObj(this._isDirected, vStr, wStr, nameStr);\n\n        vStr = edgeObj.v;\n        wStr = edgeObj.w;\n\n        Object.freeze(edgeObj);\n        this._edgeObjs[e] = edgeObj;\n        incrementOrInitEntry(this._preds[wStr]!, vStr);\n        incrementOrInitEntry(this._sucs[vStr]!, wStr);\n        this._in[wStr]![e] = edgeObj;\n        this._out[vStr]![e] = edgeObj;\n        this._edgeCount++;\n        return this;\n    }\n\n    /**\n     * Gets the label for the specified edge.\n     * Complexity: O(1).\n     *\n     * @param v - edge source node.\n     * @param w - edge sink node.\n     * @param name - name of the edge (actual for multigraph).\n     * @returns value associated with specified edge.\n     */\n    edge(v: string, w: string, name?: string): EdgeLabel;\n\n    /**\n     * Gets the label for the specified edge.\n     * Complexity: O(1).\n     *\n     * @param edge - edge descriptor.\n     * @returns value associated with specified edge.\n     */\n    edge(edge: Edge): EdgeLabel;\n\n    edge(v: string | Edge, w?: string, name?: string): EdgeLabel {\n        // TODO: This should return undefined if the edge doesn't exist, but that would be a breaking change.\n        const e = (arguments.length === 1\n            ? edgeObjToId(this._isDirected, v as Edge)\n            : edgeArgsToId(this._isDirected, v as string, w!, name));\n        return this._edgeLabels[e]!;\n    }\n\n    /**\n     * Gets the label for the specified edge and converts it to an object.\n     * Complexity: O(1).\n     *\n     * @param v - edge source node.\n     * @param w - edge sink node.\n     * @param name - name of the edge (actual for multigraph).\n     * @returns value associated with specified edge.\n     */\n    edgeAsObj(v: string, w: string, name?: string): { label: EdgeLabel };\n\n    /**\n     * Gets the label for the specified edge and converts it to an object.\n     * Complexity: O(1).\n     *\n     * @param edge - edge descriptor.\n     * @returns value associated with specified edge.\n     */\n    edgeAsObj(edge: Edge): { label: EdgeLabel };\n\n    edgeAsObj(v: string | Edge, w?: string, name?: string): { label: EdgeLabel } {\n        const edgeLabel = arguments.length === 1\n            ? this.edge(v as Edge)\n            : this.edge(v as string, w!, name);\n\n        if (typeof edgeLabel !== \"object\") {\n            return {label: edgeLabel as EdgeLabel};\n        }\n\n        return edgeLabel as { label: EdgeLabel };\n    }\n\n    /**\n     * Detects whether the graph contains specified edge or not. No subgraphs are considered.\n     * Complexity: O(1).\n     *\n     * @param v - edge source node.\n     * @param w - edge sink node.\n     * @param name - name of the edge (actual for multigraph).\n     * @returns whether the graph contains the specified edge or not.\n     */\n    hasEdge(v: string, w: string, name?: string): boolean;\n\n    /**\n     * Detects whether the graph contains specified edge or not. No subgraphs are considered.\n     * Complexity: O(1).\n     *\n     * @param edge - edge descriptor.\n     * @returns whether the graph contains the specified edge or not.\n     */\n    hasEdge(edge: Edge): boolean;\n\n    hasEdge(v: string | Edge, w?: string, name?: string): boolean {\n        const e = (arguments.length === 1\n            ? edgeObjToId(this._isDirected, v as Edge)\n            : edgeArgsToId(this._isDirected, v as string, w!, name));\n        return e in this._edgeLabels;\n    }\n\n    /**\n     * Removes the specified edge from the graph. No subgraphs are considered.\n     * Complexity: O(1).\n     *\n     * @param v - edge source node.\n     * @param w - edge sink node.\n     * @param name - name of the edge (actual for multigraph).\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    removeEdge(v: string, w: string, name?: string): this;\n\n    /**\n     * Removes the specified edge from the graph. No subgraphs are considered.\n     * Complexity: O(1).\n     *\n     * @param edge - edge descriptor.\n     * @returns the graph, allowing this to be chained with other functions.\n     */\n    removeEdge(edge: Edge): this;\n\n    removeEdge(v: string | Edge, w?: string, name?: string): this {\n        const e = (arguments.length === 1\n            ? edgeObjToId(this._isDirected, v as Edge)\n            : edgeArgsToId(this._isDirected, v as string, w!, name));\n        const edge = this._edgeObjs[e];\n        if (edge) {\n            const vStr = edge.v;\n            const wStr = edge.w;\n            delete this._edgeLabels[e];\n            delete this._edgeObjs[e];\n            decrementOrRemoveEntry(this._preds[wStr]!, vStr);\n            decrementOrRemoveEntry(this._sucs[vStr]!, wStr);\n            delete this._in[wStr]![e];\n            delete this._out[vStr]![e];\n            this._edgeCount--;\n        }\n        return this;\n    }\n\n    /**\n     * Return all edges that point to the node v. Optionally filters those edges down to just those\n     * coming from node u. Behavior is void for undirected graphs - use nodeEdges instead.\n     * Complexity: O(|E|).\n     *\n     * @param v - edge sink node.\n     * @param w - edge source node.\n     * @returns edges descriptors list if v is in the graph, or void otherwise.\n     */\n    inEdges(v: string, w?: string): void | Edge[] {\n        if (this.isDirected()) {\n            return this.filterEdges(this._in[v], v, w);\n        }\n        return this.nodeEdges(v, w);\n    }\n\n    /**\n     * Return all edges that are pointed at by node v. Optionally filters those edges down to just\n     * those point to w. Behavior is void for undirected graphs - use nodeEdges instead.\n     * Complexity: O(|E|).\n     *\n     * @param v - edge source node.\n     * @param w - edge sink node.\n     * @returns edges descriptors list if v is in the graph, or void otherwise.\n     */\n    outEdges(v: string, w?: string): void | Edge[] {\n        if (this.isDirected()) {\n            return this.filterEdges(this._out[v], v, w);\n        }\n        return this.nodeEdges(v, w);\n    }\n\n    /**\n     * Returns all edges to or from node v regardless of direction. Optionally filters those edges\n     * down to just those between nodes v and w regardless of direction.\n     * Complexity: O(|E|).\n     *\n     * @param v - edge adjacent node.\n     * @param w - edge adjacent node.\n     * @returns edges descriptors list if v is in the graph, or void otherwise.\n     */\n    nodeEdges(v: string, w?: string): void | Edge[] {\n        if (v in this._nodes) {\n            return this.filterEdges({...this._in[v]!, ...this._out[v]!}, v, w);\n        }\n    }\n\n    // Defaults to be set when creating a new node\n    private _defaultNodeLabelFn: NodeLabelFactory<NodeLabel> = () => undefined as NodeLabel;\n\n    // Defaults to be set when creating a new edge\n    private _defaultEdgeLabelFn: EdgeLabelFactory<EdgeLabel> = () => undefined as EdgeLabel;\n\n    private _removeFromParentsChildList(v: string): void {\n        delete this._children![this._parent![v]!]![v];\n    }\n\n    private filterEdges(setV: Record<string, Edge> | undefined, localEdge: string, remoteEdge?: string): Edge[] | undefined {\n        if (!setV) {\n            return;\n        }\n        const edges = Object.values(setV);\n        if (!remoteEdge) {\n            return edges;\n        }\n        return edges.filter((edge) => {\n            return edge.v === localEdge && edge.w === remoteEdge\n                || edge.v === remoteEdge && edge.w === localEdge;\n        });\n    }\n}\n\n\nfunction incrementOrInitEntry(map: Record<string, number>, k: string): void {\n    if (map[k]) {\n        map[k]++;\n    } else {\n        map[k] = 1;\n    }\n}\n\nfunction decrementOrRemoveEntry(map: Record<string, number>, k: string): void {\n    if (map[k] !== undefined && !--map[k]) {\n        delete map[k];\n    }\n}\n\nfunction edgeArgsToId(isDirected: boolean, v_: string, w_: string, name?: string): string {\n    let v = \"\" + v_;\n    let w = \"\" + w_;\n    if (!isDirected && v > w) {\n        const tmp = v;\n        v = w;\n        w = tmp;\n    }\n    return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n        (name === undefined ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected: boolean, v_: string, w_: string, name?: string): Edge {\n    let v = \"\" + v_;\n    let w = \"\" + w_;\n    if (!isDirected && v > w) {\n        const tmp = v;\n        v = w;\n        w = tmp;\n    }\n    const edgeObj: Edge = {v: v, w: w};\n    if (name) {\n        edgeObj.name = name;\n    }\n    return edgeObj;\n}\n\nfunction edgeObjToId(isDirected: boolean, edgeObj: Edge): string {\n    return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n", "export const version = '4.0.1';\n", "import {Graph} from './graph';\nimport type {GraphOptions} from './types';\n\ninterface JsonGraph {\n    options: GraphOptions;\n    nodes: JsonNode[];\n    edges: JsonEdge[];\n    value?: unknown;\n}\n\ninterface JsonNode {\n    v: string;\n    value?: unknown;\n    parent?: string;\n}\n\ninterface JsonEdge {\n    v: string;\n    w: string;\n    name?: string;\n    value?: unknown;\n}\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a string with\n * JSON.stringify. The graph can later be restored using json.read.\n *\n * @param graph - target to create JSON representation of.\n * @returns JSON serializable graph representation\n */\nexport function write(graph: Graph): JsonGraph {\n    const json: JsonGraph = {\n        options: {\n            directed: graph.isDirected(),\n            multigraph: graph.isMultigraph(),\n            compound: graph.isCompound()\n        },\n        nodes: writeNodes(graph),\n        edges: writeEdges(graph)\n    };\n\n    const graphLabel = graph.graph();\n    if (graphLabel !== undefined) {\n        json.value = structuredClone(graphLabel);\n    }\n\n    return json;\n}\n\nfunction writeNodes(g: Graph): JsonNode[] {\n    return g.nodes().map(v => {\n        const nodeValue = g.node(v);\n        const parent = g.parent(v);\n        const node: JsonNode = {v};\n\n        if (nodeValue !== undefined) {\n            node.value = nodeValue;\n        }\n        if (parent !== undefined) {\n            node.parent = parent;\n        }\n\n        return node;\n    });\n}\n\nfunction writeEdges(g: Graph): JsonEdge[] {\n    return g.edges().map(e => {\n        const edgeValue = g.edge(e);\n        const edge: JsonEdge = {v: e.v, w: e.w};\n\n        if (e.name !== undefined) {\n            edge.name = e.name;\n        }\n        if (edgeValue !== undefined) {\n            edge.value = edgeValue;\n        }\n\n        return edge;\n    });\n}\n\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @param json - JSON serializable graph representation\n * @returns graph constructed according to specified representation\n *\n * @example\n * var g2 = graphlib.json.read(JSON.parse(str));\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n */\nexport function read<GraphLabel = any, NodeLabel = any, EdgeLabel = any>(\n    json: JsonGraph\n): Graph<GraphLabel, NodeLabel, EdgeLabel> {\n    const g = new Graph<GraphLabel, NodeLabel, EdgeLabel>(json.options);\n\n    if (json.value !== undefined) {\n        g.setGraph(json.value as GraphLabel);\n    }\n\n    json.nodes.forEach(entry => {\n        g.setNode(entry.v, entry.value as NodeLabel);\n        if (entry.parent) {\n            g.setParent(entry.v, entry.parent);\n        }\n    });\n\n    json.edges.forEach(entry => {\n        g.setEdge({v: entry.v, w: entry.w, name: entry.name}, entry.value as EdgeLabel);\n    });\n\n    return g;\n}\n", "export {bellmanFord} from './bellman-ford';\nexport {components} from './components';\nexport {dijkstra} from './dijkstra';\nexport {dijkstraAll} from './dijkstra-all';\nexport {findCycles} from './find-cycles';\nexport {floydWarshall} from './floyd-warshall';\nexport {isAcyclic} from './is-acyclic';\nexport {postorder} from './postorder';\nexport {preorder} from './preorder';\nexport {prim} from './prim';\nexport {shortestPaths} from './shortest-paths';\nexport {tarjan} from './tarjan';\nexport {topsort, CycleException} from './topsort';\n", "import {Graph} from '../graph';\nimport type {Edge, EdgeFunction, Path, WeightFunction} from '../types';\n\nconst DEFAULT_WEIGHT_FUNC: WeightFunction = () => 1;\n\nexport function bellmanFord(\n    g: Graph,\n    source: string,\n    weightFn?: WeightFunction,\n    edgeFn?: EdgeFunction\n): Record<string, Path> {\n    return runBellmanFord(\n        g,\n        String(source),\n        weightFn || DEFAULT_WEIGHT_FUNC,\n        edgeFn || function (v) {\n            return g.outEdges(v)!;\n        }\n    );\n}\n\nfunction runBellmanFord(\n    g: Graph,\n    source: string,\n    weightFn: WeightFunction,\n    edgeFn: EdgeFunction\n): Record<string, Path> {\n    const results: Record<string, Path> = {};\n    let didADistanceUpgrade: boolean;\n    let iterations = 0;\n    const nodes = g.nodes();\n\n    const relaxEdge = function (edge: Edge): void {\n        const edgeWeight = weightFn(edge);\n        if (results[edge.v]!.distance + edgeWeight < results[edge.w]!.distance) {\n            results[edge.w] = {\n                distance: results[edge.v]!.distance + edgeWeight,\n                predecessor: edge.v\n            };\n            didADistanceUpgrade = true;\n        }\n    };\n\n    const relaxAllEdges = function (): void {\n        nodes.forEach(function (vertex) {\n            edgeFn(vertex).forEach(function (edge) {\n                // If the vertex on which the edgeFun in called is\n                // the edge.w, then we treat the edge as if it was reversed\n                const inVertex = edge.v === vertex ? edge.v : edge.w;\n                const outVertex = inVertex === edge.v ? edge.w : edge.v;\n                relaxEdge({v: inVertex, w: outVertex});\n            });\n        });\n    };\n\n    // Initialization\n    nodes.forEach(function (v) {\n        const distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n        results[v] = {distance: distance, predecessor: ''};\n    });\n\n    const numberOfNodes = nodes.length;\n\n    // Relax all edges in |V|-1 iterations\n    for (let i = 1; i < numberOfNodes; i++) {\n        didADistanceUpgrade = false;\n        iterations++;\n        relaxAllEdges();\n        if (!didADistanceUpgrade) {\n            // \u0399f no update was made in an iteration, Bellman-Ford has finished\n            break;\n        }\n    }\n\n    // Detect if the graph contains a negative weight cycle\n    if (iterations === numberOfNodes - 1) {\n        didADistanceUpgrade = false;\n        relaxAllEdges();\n        if (didADistanceUpgrade) {\n            throw new Error(\"The graph contains a negative weight cycle\");\n        }\n    }\n\n    return results;\n}\n", "import {Graph} from '../graph';\n\n/**\n * Finds all connected components in a graph and returns an array of these components.\n * Each component is itself an array that contains the ids of nodes in the component.\n * Complexity: O(|V|).\n *\n * @param graph - graph to find components in.\n * @returns array of nodes list representing components\n */\nexport function components(graph: Graph): string[][] {\n    const visited: Record<string, boolean> = {};\n    const cmpts: string[][] = [];\n    let cmpt: string[];\n\n    function dfs(v: string): void {\n        if (v in visited) return;\n        visited[v] = true;\n        cmpt.push(v);\n        graph.successors(v)!.forEach(dfs);\n        graph.predecessors(v)!.forEach(dfs);\n    }\n\n    graph.nodes().forEach(function (v) {\n        cmpt = [];\n        dfs(v);\n        if (cmpt.length) {\n            cmpts.push(cmpt);\n        }\n    });\n\n    return cmpts;\n}\n", "/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\n\ninterface PriorityQueueEntry {\n    key: string;\n    priority: number;\n}\n\nexport class PriorityQueue {\n    private _arr: PriorityQueueEntry[] = [];\n    private _keyIndices: Record<string, number> = {};\n\n    /**\n     * Returns the number of elements in the queue. Takes `O(1)` time.\n     */\n    size(): number {\n        return this._arr.length;\n    }\n\n    /**\n     * Returns the keys that are in the queue. Takes `O(n)` time.\n     */\n    keys(): string[] {\n        return this._arr.map(x => x.key);\n    }\n\n    /**\n     * Returns `true` if **key** is in the queue and `false` if not.\n     */\n    has(key: string): boolean {\n        return key in this._keyIndices;\n    }\n\n    /**\n     * Returns the priority for **key**. If **key** is not present in the queue\n     * then this function returns `undefined`. Takes `O(1)` time.\n     */\n    priority(key: string): number | undefined {\n        const index = this._keyIndices[key];\n        if (index !== undefined) {\n            return this._arr[index]!.priority;\n        }\n        return undefined;\n    }\n\n    /**\n     * Returns the key for the minimum element in this queue. If the queue is\n     * empty this function throws an Error. Takes `O(1)` time.\n     */\n    min(): string {\n        if (this.size() === 0) {\n            throw new Error(\"Queue underflow\");\n        }\n        return this._arr[0]!.key;\n    }\n\n    /**\n     * Inserts a new key into the priority queue. If the key already exists in\n     * the queue this function returns `false`; otherwise it will return `true`.\n     * Takes `O(n)` time.\n     */\n    add(key: string, priority: number): boolean {\n        const keyIndices = this._keyIndices;\n        const keyStr = String(key);\n\n        if (!(keyStr in keyIndices)) {\n            const arr = this._arr;\n            const index = arr.length;\n            keyIndices[keyStr] = index;\n            arr.push({key: keyStr, priority});\n            this._decrease(index);\n            return true;\n        }\n        return false;\n    }\n\n    /**\n     * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n     */\n    removeMin(): string {\n        this._swap(0, this._arr.length - 1);\n        const min = this._arr.pop()!;\n        delete this._keyIndices[min.key];\n        this._heapify(0);\n        return min.key;\n    }\n\n    /**\n     * Decreases the priority for **key** to **priority**. If the new priority is\n     * greater than the previous priority, this function will throw an Error.\n     */\n    decrease(key: string, priority: number): void {\n        const index = this._keyIndices[key];\n        if (index === undefined) {\n            throw new Error(`Key not found: ${key}`);\n        }\n\n        const currentPriority = this._arr[index]!.priority;\n        if (priority > currentPriority) {\n            throw new Error(\n                `New priority is greater than current priority. Key: ${key} Old: ${currentPriority} New: ${priority}`\n            );\n        }\n        this._arr[index]!.priority = priority;\n        this._decrease(index);\n    }\n\n    private _heapify(i: number): void {\n        const arr = this._arr;\n        const l = 2 * i;\n        const r = l + 1;\n        let largest = i;\n\n        if (l < arr.length) {\n            largest = arr[l]!.priority < arr[largest]!.priority ? l : largest;\n            if (r < arr.length) {\n                largest = arr[r]!.priority < arr[largest]!.priority ? r : largest;\n            }\n            if (largest !== i) {\n                this._swap(i, largest);\n                this._heapify(largest);\n            }\n        }\n    }\n\n    private _decrease(index: number): void {\n        const arr = this._arr;\n        const priority = arr[index]!.priority;\n        let parent: number;\n\n        while (index !== 0) {\n            parent = index >> 1;\n            if (arr[parent]!.priority < priority) {\n                break;\n            }\n            this._swap(index, parent);\n            index = parent;\n        }\n    }\n\n    private _swap(i: number, j: number): void {\n        const arr = this._arr;\n        const keyIndices = this._keyIndices;\n        const origArrI = arr[i]!;\n        const origArrJ = arr[j]!;\n\n        arr[i] = origArrJ;\n        arr[j] = origArrI;\n        keyIndices[origArrJ.key] = i;\n        keyIndices[origArrI.key] = j;\n    }\n}\n", "import {Graph} from '../graph';\nimport {PriorityQueue} from '../data/priority-queue';\nimport type {Edge, EdgeFunction, Path, WeightFunction} from '../types';\n\nconst DEFAULT_WEIGHT_FUNC: WeightFunction = () => 1;\n\n/**\n * This function is an implementation of Dijkstra's algorithm which finds the shortest\n * path from source to all other nodes in graph. This function returns a map of\n * v -> { distance, predecessor }. The distance property holds the sum of the weights\n * from source to v along the shortest path or Number.POSITIVE_INFINITY if there is no path\n * from source. The predecessor property can be used to walk the individual elements of the\n * path from source to v in reverse order.\n * Complexity: O((|E| + |V|) * log |V|).\n *\n * @param graph - graph where to search paths.\n * @param source - node to start paths from.\n * @param weightFn - function which takes edge e and returns the weight of it. If no weightFn\n * is supplied then each edge is assumed to have a weight of 1. This function throws an\n * Error if any of the traversed edges have a negative edge weight.\n * @param edgeFn - function which takes a node v and returns the ids of all edges incident to it\n * for the purposes of shortest path traversal. By default this function uses the graph.outEdges.\n * @returns shortest paths map that starts from node source\n */\nexport function dijkstra(\n    graph: Graph,\n    source: string,\n    weightFn?: WeightFunction,\n    edgeFn?: EdgeFunction\n): Record<string, Path> {\n    const defaultEdgeFn: EdgeFunction = function (v) {\n        return graph.outEdges(v)!;\n    };\n\n    return runDijkstra(graph, String(source),\n        weightFn || DEFAULT_WEIGHT_FUNC,\n        edgeFn || defaultEdgeFn);\n}\n\nfunction runDijkstra(\n    graph: Graph,\n    source: string,\n    weightFn: WeightFunction,\n    edgeFn: EdgeFunction\n): Record<string, Path> {\n    const results: Record<string, Path> = {};\n    const pq = new PriorityQueue();\n    let v: string, vEntry: Path;\n\n    const updateNeighbors = function (edge: Edge): void {\n        const w = edge.v !== v ? edge.v : edge.w;\n        const wEntry = results[w]!;\n        const weight = weightFn(edge);\n        const distance = vEntry.distance + weight;\n\n        if (weight < 0) {\n            throw new Error(\"dijkstra does not allow negative edge weights. \" +\n                \"Bad edge: \" + edge + \" Weight: \" + weight);\n        }\n\n        if (distance < wEntry.distance) {\n            wEntry.distance = distance;\n            wEntry.predecessor = v;\n            pq.decrease(w, distance);\n        }\n    };\n\n    graph.nodes().forEach(function (v) {\n        const distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n        results[v] = {distance: distance, predecessor: ''};\n        pq.add(v, distance);\n    });\n\n    while (pq.size() > 0) {\n        v = pq.removeMin()!;\n        vEntry = results[v]!;\n        if (vEntry.distance === Number.POSITIVE_INFINITY) {\n            break;\n        }\n\n        edgeFn(v).forEach(updateNeighbors);\n    }\n\n    return results;\n}\n", "import {Graph} from '../graph';\nimport type {EdgeFunction, Path, WeightFunction} from '../types';\nimport {dijkstra} from './dijkstra';\n\n/**\n * This function finds the shortest path from each node to every other reachable node in\n * the graph. It is similar to alg.dijkstra, but instead of returning a single-source\n * array, it returns a mapping of source -> alg.dijkstra(g, source, weightFn, edgeFn).\n * Complexity: O(|V| * (|E| + |V|) * log |V|).\n *\n * @param graph - graph where to search paths.\n * @param weightFn - function which takes edge e and returns the weight of it. If no weightFn\n * is supplied then each edge is assumed to have a weight of 1. This function throws an\n * Error if any of the traversed edges have a negative edge weight.\n * @param edgeFn - function which takes a node v and returns the ids of all edges incident to it\n * for the purposes of shortest path traversal. By default this function uses the graph.outEdges.\n * @returns shortest paths map.\n */\nexport function dijkstraAll(\n    graph: Graph,\n    weightFn?: WeightFunction,\n    edgeFn?: EdgeFunction\n): Record<string, Record<string, Path>> {\n    return graph.nodes().reduce(function (acc, v) {\n        acc[v] = dijkstra(graph, v, weightFn, edgeFn);\n        return acc;\n    }, {} as Record<string, Record<string, Path>>);\n}\n", "import {Graph} from '../graph';\n\ninterface VisitedEntry {\n    onStack: boolean;\n    lowlink: number;\n    index: number;\n}\n\n/**\n * This function is an implementation of Tarjan's algorithm which finds all strongly connected\n * components in the directed graph g. Each strongly connected component is composed of nodes that\n * can reach all other nodes in the component via directed edges. A strongly connected component\n * can consist of a single node if that node cannot both reach and be reached by any other\n * specific node in the graph. Components of more than one node are guaranteed to have at least\n * one cycle.\n * Complexity: O(|V| + |E|).\n *\n * @param graph - graph to find all strongly connected components of.\n * @returns an array of components. Each component is itself an array that contains\n * the ids of all nodes in the component.\n */\nexport function tarjan(graph: Graph): string[][] {\n    let index = 0;\n    const stack: string[] = [];\n    const visited: Record<string, VisitedEntry> = {}; // node id -> { onStack, lowlink, index }\n    const results: string[][] = [];\n\n    function dfs(v: string): void {\n        const entry = visited[v] = {\n            onStack: true,\n            lowlink: index,\n            index: index++\n        };\n        stack.push(v);\n\n        graph.successors(v)!.forEach(function (w) {\n            if (!(w in visited)) {\n                dfs(w);\n                entry.lowlink = Math.min(entry.lowlink, visited[w]!.lowlink);\n            } else if (visited[w]!.onStack) {\n                entry.lowlink = Math.min(entry.lowlink, visited[w]!.index);\n            }\n        });\n\n        if (entry.lowlink === entry.index) {\n            const cmpt: string[] = [];\n            let w: string;\n            do {\n                w = stack.pop()!;\n                visited[w]!.onStack = false;\n                cmpt.push(w);\n            } while (v !== w);\n            results.push(cmpt);\n        }\n    }\n\n    graph.nodes().forEach(function (v) {\n        if (!(v in visited)) {\n            dfs(v);\n        }\n    });\n\n    return results;\n}\n", "import {Graph} from '../graph';\nimport {tarjan} from './tarjan';\n\n/**\n * Given a Graph, graph, this function returns all nodes that are part of a cycle. As there\n * may be more than one cycle in a graph this function return an array of these cycles,\n * where each cycle is itself represented by an array of ids for each node involved in\n * that cycle. Method alg.isAcyclic is more efficient if you only need to determine whether a graph has a\n * cycle or not.\n * Complexity: O(|V| + |E|).\n *\n * @param graph - graph where to search cycles.\n * @returns cycles list.\n */\nexport function findCycles(graph: Graph): string[][] {\n    return tarjan(graph).filter(function (cmpt) {\n        return cmpt.length > 1 || (cmpt.length === 1 && graph.hasEdge(cmpt[0]!, cmpt[0]!));\n    });\n}\n", "import {Graph} from '../graph';\nimport type {EdgeFunction, Path, WeightFunction} from '../types';\n\nconst DEFAULT_WEIGHT_FUNC: WeightFunction = () => 1;\n\n/**\n * This function is an implementation of the Floyd-Warshall algorithm, which finds the\n * shortest path from each node to every other reachable node in the graph. It is similar\n * to alg.dijkstraAll, but it handles negative edge weights and is more efficient for some types\n * of graphs. This function returns a map of source -> { target -> { distance, predecessor }.\n * The distance property holds the sum of the weights from source to target along the shortest\n * path of Number.POSITIVE_INFINITY if there is no path from source. The predecessor property\n * can be used to walk the individual elements of the path from source to target in reverse\n * order.\n * Complexity: O(|V|^3).\n *\n * @param graph - graph where to search paths.\n * @param weightFn - function which takes edge e and returns the weight of it. If no weightFn\n * is supplied then each edge is assumed to have a weight of 1. This function throws an\n * Error if any of the traversed edges have a negative edge weight.\n * @param edgeFn - function which takes a node v and returns the ids of all edges incident to it\n * for the purposes of shortest path traversal. By default this function uses the graph.outEdges.\n * @returns shortest paths map.\n */\nexport function floydWarshall(\n    graph: Graph,\n    weightFn?: WeightFunction,\n    edgeFn?: EdgeFunction\n): Record<string, Record<string, Path>> {\n    return runFloydWarshall(graph,\n        weightFn || DEFAULT_WEIGHT_FUNC,\n        edgeFn || function (v) {\n            return graph.outEdges(v)!;\n        });\n}\n\nfunction runFloydWarshall(\n    graph: Graph,\n    weightFn: WeightFunction,\n    edgeFn: EdgeFunction\n): Record<string, Record<string, Path>> {\n    const results: Record<string, Record<string, Path>> = {};\n    const nodes = graph.nodes();\n\n    nodes.forEach(function (v) {\n        results[v] = {};\n        results[v]![v] = {distance: 0, predecessor: ''};\n        nodes.forEach(function (w) {\n            if (v !== w) {\n                results[v]![w] = {distance: Number.POSITIVE_INFINITY, predecessor: ''};\n            }\n        });\n        edgeFn(v).forEach(function (edge) {\n            const w = edge.v === v ? edge.w : edge.v;\n            const d = weightFn(edge);\n            results[v]![w] = {distance: d, predecessor: v};\n        });\n    });\n\n    nodes.forEach(function (k) {\n        const rowK = results[k]!;\n        nodes.forEach(function (i) {\n            const rowI = results[i]!;\n            nodes.forEach(function (j) {\n                const ik = rowI[k]!;\n                const kj = rowK[j]!;\n                const ij = rowI[j]!;\n                const altDistance = ik.distance + kj.distance;\n                if (altDistance < ij.distance) {\n                    ij.distance = altDistance;\n                    ij.predecessor = kj.predecessor;\n                }\n            });\n        });\n    });\n\n    return results;\n}\n", "import {Graph} from '../graph';\n\nexport class CycleException extends Error {\n    constructor(...args: unknown[]) {\n        super(...args as ConstructorParameters<typeof Error>);\n    }\n}\n\n/**\n * Given a graph this function applies topological sorting to it.\n * If the graph has a cycle it is impossible to generate such a list and CycleException is thrown.\n * Complexity: O(|V| + |E|).\n *\n * @param graph - graph to apply topological sorting to.\n * @returns an array of nodes such that for each edge u -> v, u appears before v in the array.\n */\nexport function topsort(graph: Graph): string[] {\n    const visited: Record<string, boolean> = {};\n    const stack: Record<string, boolean> = {};\n    const results: string[] = [];\n\n    function visit(node: string): void {\n        if (node in stack) {\n            throw new CycleException();\n        }\n\n        if (!(node in visited)) {\n            stack[node] = true;\n            visited[node] = true;\n            graph.predecessors(node)!.forEach(visit);\n            delete stack[node];\n            results.push(node);\n        }\n    }\n\n    graph.sinks().forEach(visit);\n\n    if (Object.keys(visited).length !== graph.nodeCount()) {\n        throw new CycleException();\n    }\n\n    return results;\n}\n", "import {Graph} from '../graph';\nimport {CycleException, topsort} from './topsort';\n\n/**\n * Given a Graph, graph, this function returns true if the graph has no cycles and returns false if it\n * does. This algorithm returns as soon as it detects the first cycle. You can use alg.findCycles\n * to get the actual list of cycles in the graph.\n *\n * @param graph - graph to detect whether it acyclic or not.\n * @returns whether graph contain cycles or not.\n */\nexport function isAcyclic(graph: Graph): boolean {\n    try {\n        topsort(graph);\n    } catch (e) {\n        if (e instanceof CycleException) {\n            return false;\n        }\n        throw e;\n    }\n    return true;\n}\n", "import {Graph} from '../graph';\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and processes the nodes in the order they are visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nexport function reduce<T>(\n    g: Graph,\n    vs: string | string[],\n    order: string,\n    fn: (acc: T, v: string) => T,\n    acc: T\n): T {\n    if (!Array.isArray(vs)) {\n        vs = [vs];\n    }\n\n    const navigation = ((v: string) => (g.isDirected() ? g.successors(v) : g.neighbors(v)) ?? []);\n\n    const visited: Record<string, boolean> = {};\n    vs.forEach(function (v) {\n        if (!g.hasNode(v)) {\n            throw new Error(\"Graph does not have node: \" + v);\n        }\n\n        acc = doReduce(g, v, order === \"post\", visited, navigation, fn, acc);\n    });\n    return acc;\n}\n\nfunction doReduce<T>(\n    g: Graph,\n    v: string,\n    postorder: boolean,\n    visited: Record<string, boolean>,\n    navigation: (v: string) => string[],\n    fn: (acc: T, v: string) => T,\n    acc: T\n): T {\n    if (!(v in visited)) {\n        visited[v] = true;\n\n        if (!postorder) {\n            acc = fn(acc, v);\n        }\n        navigation(v).forEach(function (w) {\n            acc = doReduce(g, w, postorder, visited, navigation, fn, acc);\n        });\n        if (postorder) {\n            acc = fn(acc, v);\n        }\n    }\n    return acc;\n}\n", "import {Graph} from '../graph';\nimport {reduce} from './reduce';\n\n/*\n * Pre- or post-order traversal on the input graph.\n * Returns an array of the nodes in the order they were visited.\n *\n * If the order is not \"post\", it will be treated as \"pre\".\n */\nexport function dfs(g: Graph, vs: string | string[], order: string): string[] {\n    return reduce(g, vs, order, function (acc, v) {\n        acc.push(v);\n        return acc;\n    }, [] as string[]);\n}\n", "import {Graph} from '../graph';\nimport {dfs} from './dfs';\n\n/**\n * Performs post-order depth first traversal on the input graph. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * @param graph - depth first traversal target.\n * @param vs - nodes list to traverse.\n * @returns the nodes in the order they were visited as a list of their names.\n */\nexport function postorder(graph: Graph, vs: string | string[]): string[] {\n    return dfs(graph, vs, \"post\");\n}\n", "import {Graph} from '../graph';\nimport {dfs} from './dfs';\n\n/**\n * Performs pre-order depth first traversal on the input graph. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * @param graph - depth first traversal target.\n * @param vs - nodes list to traverse.\n * @returns the nodes in the order they were visited as a list of their names.\n */\nexport function preorder(graph: Graph, vs: string | string[]): string[] {\n    return dfs(graph, vs, \"pre\");\n}\n", "import {Graph} from '../graph';\nimport {PriorityQueue} from '../data/priority-queue';\nimport type {Edge, WeightFunction} from '../types';\n\n/**\n * Prim's algorithm takes a connected undirected graph and generates a minimum spanning tree. This\n * function returns the minimum spanning tree as an undirected graph. This algorithm is derived\n * from the description in \"Introduction to Algorithms\", Third Edition, Cormen, et al., Pg 634.\n * Complexity: O(|E| * log |V|);\n *\n * @param graph - graph to generate a minimum spanning tree of.\n * @param weightFn - function which takes edge e and returns the weight of it. It throws an Error if\n * the graph is not connected.\n * @returns minimum spanning tree of graph.\n */\nexport function prim(graph: Graph, weightFn: WeightFunction): Graph {\n    const result = new Graph();\n    const parents: Record<string, string> = {};\n    const pq = new PriorityQueue();\n    let v: string;\n\n    function updateNeighbors(edge: Edge): void {\n        const w = edge.v === v ? edge.w : edge.v;\n        const pri = pq.priority(w);\n        if (pri !== undefined) {\n            const edgeWeight = weightFn(edge);\n            if (edgeWeight < pri) {\n                parents[w] = v;\n                pq.decrease(w, edgeWeight);\n            }\n        }\n    }\n\n    if (graph.nodeCount() === 0) {\n        return result;\n    }\n\n    graph.nodes().forEach(function (v) {\n        pq.add(v, Number.POSITIVE_INFINITY);\n        result.setNode(v);\n    });\n\n    // Start from an arbitrary node\n    pq.decrease(graph.nodes()[0]!, 0);\n\n    let init = false;\n    while (pq.size() > 0) {\n        v = pq.removeMin()!;\n        if (v in parents) {\n            result.setEdge(v, parents[v]!);\n        } else if (init) {\n            throw new Error(\"Input graph is not connected: \" + graph);\n        } else {\n            init = true;\n        }\n\n        graph.nodeEdges(v)!.forEach(updateNeighbors);\n    }\n\n    return result;\n}\n", "import {dijkstra} from './dijkstra';\nimport {bellmanFord} from './bellman-ford';\nimport {Graph} from '../graph';\nimport type {EdgeFunction, Path, WeightFunction} from '../types';\n\nexport function shortestPaths(\n    g: Graph,\n    source: string,\n    weightFn?: WeightFunction,\n    edgeFn?: EdgeFunction\n): Record<string, Path> {\n    return runShortestPaths(\n        g,\n        source,\n        weightFn,\n        edgeFn ?? ((v: string) => {\n            const edges = g.outEdges(v);\n            return edges ?? [];\n        })\n    );\n}\n\nfunction runShortestPaths(\n    g: Graph,\n    source: string,\n    weightFn: WeightFunction | undefined,\n    edgeFn: EdgeFunction\n): Record<string, Path> {\n    if (weightFn === undefined) {\n        return dijkstra(g, source, weightFn, edgeFn);\n    }\n\n    let negativeEdgeExists = false;\n    const nodes = g.nodes();\n\n    for (let i = 0; i < nodes.length; i++) {\n        const adjList = edgeFn(nodes[i]!);\n\n        for (let j = 0; j < adjList.length; j++) {\n            const edge = adjList[j]!;\n            const inVertex = edge.v === nodes[i] ? edge.v : edge.w;\n            const outVertex = inVertex === edge.v ? edge.w : edge.v;\n\n            if (weightFn({v: inVertex, w: outVertex}) < 0) {\n                negativeEdgeExists = true;\n            }\n        }\n\n        if (negativeEdgeExists) {\n            return bellmanFord(g, source, weightFn, edgeFn);\n        }\n    }\n\n    return dijkstra(g, source, weightFn, edgeFn);\n}\n", "import {Graph} from \"./graph-lib\";\nimport type {EdgeLabel, GraphLabel, NodeLabel, PartitionResult, Point} from \"./types\";\n\nexport {\n    addBorderNode,\n    addDummyNode,\n    applyWithChunking,\n    asNonCompoundGraph,\n    buildLayerMatrix,\n    intersectRect,\n    mapValues,\n    maxRank,\n    normalizeRanks,\n    notime,\n    partition,\n    pick,\n    predecessorWeights,\n    range,\n    removeEmptyRanks,\n    simplify,\n    successorWeights,\n    time,\n    uniqueId,\n    zipObject,\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(\n    graph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    type: 'root' | \"edge\" | \"border\" | \"edge-label\" | \"edge-proxy\" | \"selfedge\",\n    attrs: Partial<NodeLabel>,\n    name: string\n): string {\n    let v: string = name;\n    while (graph.hasNode(v)) {\n        v = uniqueId(name);\n    }\n\n    attrs.dummy = type;\n    graph.setNode(v, attrs as NodeLabel);\n    return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Graph<GraphLabel, NodeLabel, EdgeLabel> {\n    const simplified = new Graph<GraphLabel, NodeLabel, EdgeLabel>().setGraph(graph.graph());\n    graph.nodes().forEach(v => simplified.setNode(v, graph.node(v)));\n    graph.edges().forEach(e => {\n        const simpleLabel: EdgeLabel = simplified.edge(e.v, e.w) || {weight: 0, minlen: 1};\n        const label: EdgeLabel = graph.edge(e);\n        simplified.setEdge(e.v, e.w, {\n            weight: simpleLabel.weight! + label.weight!,\n            minlen: Math.max(simpleLabel.minlen!, label.minlen!)\n        });\n    });\n    return simplified;\n}\n\nfunction asNonCompoundGraph(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Graph<GraphLabel, NodeLabel, EdgeLabel> {\n    const simplified = new Graph<GraphLabel, NodeLabel, EdgeLabel>({multigraph: graph.isMultigraph()}).setGraph(graph.graph());\n    graph.nodes().forEach(v => {\n        if (!graph.children(v).length) {\n            simplified.setNode(v, graph.node(v));\n        }\n    });\n    graph.edges().forEach(e => {\n        simplified.setEdge(e, graph.edge(e));\n    });\n    return simplified;\n}\n\nfunction successorWeights(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): {\n    [key: string]: { [key: string]: number }\n} {\n    const weightMap: { [key: string]: number }[] = graph.nodes().map(v => {\n        const sucs: { [key: string]: number } = {};\n        const outEdges = graph.outEdges(v);\n        if (outEdges) {\n            outEdges.forEach(e => {\n                sucs[e.w] = (sucs[e.w] || 0) + graph.edge(e).weight!;\n            });\n        }\n        return sucs;\n    });\n    return zipObject(graph.nodes(), weightMap);\n}\n\nfunction predecessorWeights(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): {\n    [key: string]: { [key: string]: number }\n} {\n    const weightMap: { [key: string]: number }[] = graph.nodes().map(v => {\n        const preds: { [key: string]: number } = {};\n        const inEdges = graph.inEdges(v);\n        if (inEdges) {\n            inEdges.forEach(e => {\n                preds[e.v] = (preds[e.v] || 0) + graph.edge(e).weight!;\n            });\n        }\n        return preds;\n    });\n    return zipObject(graph.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect: NodeLabel, point: Point): Point {\n    const x: number = rect.x!;\n    const y: number = rect.y!;\n\n    // Rectangle intersection algorithm from:\n    // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n    const dx: number = point.x - x;\n    const dy: number = point.y - y;\n    let w: number = rect.width / 2;\n    let h: number = rect.height / 2;\n\n    if (!dx && !dy) {\n        throw new Error(\"Not possible to find intersection inside of the rectangle\");\n    }\n\n    let sx: number, sy: number;\n    if (Math.abs(dy) * w > Math.abs(dx) * h) {\n        // Intersection is top or bottom of rect.\n        if (dy < 0) {\n            h = -h;\n        }\n        sx = h * dx / dy;\n        sy = h;\n    } else {\n        // Intersection is left or right of rect.\n        if (dx < 0) {\n            w = -w;\n        }\n        sx = w;\n        sy = w * dy / dx;\n    }\n\n    return {x: x + sx, y: y + sy};\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): string[][] {\n    const layering: string[][] = range(maxRank(graph) + 1).map(() => []);\n    graph.nodes().forEach(v => {\n        const node = graph.node(v) as NodeLabel;\n        const rank: number | undefined = node.rank;\n        if (rank !== undefined) {\n            if (!layering[rank]) {\n                layering[rank] = [];\n            }\n            layering[rank][node.order!] = v;\n        }\n    });\n    return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const nodeRanks: number[] = graph.nodes().map(v => {\n        const rank: number | undefined = (graph.node(v) as NodeLabel).rank;\n        if (rank === undefined) {\n            return Number.MAX_VALUE;\n        }\n\n        return rank;\n    });\n    const min: number = applyWithChunking(Math.min, nodeRanks);\n    graph.nodes().forEach(v => {\n        const node = graph.node(v) as NodeLabel;\n        if (Object.hasOwn(node, \"rank\")) {\n            (node as NodeLabel).rank! -= min;\n        }\n    });\n}\n\nfunction removeEmptyRanks(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    // Ranks may not start at 0, so we need to offset them\n    const nodeRanks: number[] = graph.nodes().map(v => graph.node(v).rank).filter((rank): rank is number => rank !== undefined);\n    const offset: number = applyWithChunking(Math.min, nodeRanks);\n\n    const layers: string[][] = [];\n    graph.nodes().forEach(v => {\n        const rank: number = graph.node(v).rank! - offset;\n        if (!layers[rank]) {\n            layers[rank] = [];\n        }\n        layers[rank].push(v);\n    });\n\n    let delta: number = 0;\n    const nodeRankFactor: number = graph.graph().nodeRankFactor!;\n    Array.from(layers).forEach((vs, i) => {\n        if (vs === undefined && i % nodeRankFactor !== 0) {\n            --delta;\n        } else if (vs !== undefined && delta) {\n            vs.forEach(v => graph.node(v).rank! += delta);\n        }\n    });\n}\n\nfunction addBorderNode(\n    graph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    prefix: string,\n    rank?: number,\n    order?: number\n): string {\n    const node: Partial<NodeLabel> = {\n        width: 0,\n        height: 0\n    };\n    if (arguments.length >= 4) {\n        node.rank = rank;\n        node.order = order;\n    }\n    return addDummyNode(graph, \"border\", node, prefix);\n}\n\nfunction splitToChunks<T>(array: T[], chunkSize: number = CHUNKING_THRESHOLD): T[][] {\n    const chunks: T[][] = [];\n    for (let i = 0; i < array.length; i += chunkSize) {\n        const chunk: T[] = array.slice(i, i + chunkSize);\n        chunks.push(chunk);\n    }\n    return chunks;\n}\n\nconst CHUNKING_THRESHOLD = 65535;\n\nfunction applyWithChunking(fn: (...args: number[]) => number, argsArray: number[]): number {\n    if (argsArray.length > CHUNKING_THRESHOLD) {\n        const chunks: number[][] = splitToChunks(argsArray);\n        return fn(...chunks.map(chunk => fn(...chunk)));\n    } else {\n        return fn(...argsArray);\n    }\n}\n\nfunction maxRank(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): number {\n    const nodes: string[] = graph.nodes();\n    const nodeRanks: number[] = nodes.map(v => {\n        const rank: number | undefined = graph.node(v).rank;\n        if (rank === undefined) {\n            return Number.MIN_VALUE;\n        }\n        return rank;\n    });\n\n    return applyWithChunking(Math.max, nodeRanks);\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition<T>(collection: T[], fn: (value: T) => boolean): PartitionResult<T> {\n    const result: PartitionResult<T> = {lhs: [], rhs: []};\n    collection.forEach(value => {\n        if (fn(value)) {\n            result.lhs.push(value);\n        } else {\n            result.rhs.push(value);\n        }\n    });\n    return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time<T>(name: string, fn: () => T): T {\n    const start: number = Date.now();\n    try {\n        return fn();\n    } finally {\n        console.log(name + \" time: \" + (Date.now() - start) + \"ms\");\n    }\n}\n\nfunction notime<T>(name: string, fn: () => T): T {\n    return fn();\n}\n\nlet idCounter = 0;\n\nfunction uniqueId(prefix: string): string {\n    const id: number = ++idCounter;\n    return prefix + (\"\" + id);\n}\n\nfunction range(start: number, limit?: number, step: number = 1): number[] {\n    if (limit == null) {\n        limit = start;\n        start = 0;\n    }\n\n    let endCon: (i: number) => boolean = (i) => i < limit!;\n    if (step < 0) {\n        endCon = (i) => limit! < i;\n    }\n\n    const range: number[] = [];\n    for (let i = start; endCon(i); i += step) {\n        range.push(i);\n    }\n\n    return range;\n}\n\nfunction pick<T extends Record<string, unknown>>(source: T, keys: string[]): Partial<T> {\n    const dest: Partial<T> = {};\n    for (const key of keys) {\n        if (source[key] !== undefined) {\n            (dest as Record<string, unknown>)[key] = source[key];\n        }\n    }\n\n    return dest;\n}\n\nfunction mapValues<T, R>(obj: { [key: string]: T }, funcOrProp: ((val: T, key: string) => R) | string): {\n    [key: string]: R\n} {\n    let func: (val: T, key: string) => R;\n    if (typeof funcOrProp === 'string') {\n        func = (val: T) => (val as Record<string, R>)[funcOrProp] as R;\n    } else {\n        func = funcOrProp;\n    }\n\n    return Object.entries(obj).reduce((acc: { [key: string]: R }, [k, v]) => {\n        acc[k] = func(v, k);\n        return acc;\n    }, {});\n}\n\nfunction zipObject<T>(props: string[], values: T[]): { [key: string]: T } {\n    return props.reduce((acc: { [key: string]: T }, key, i) => {\n        acc[key] = values[i]!;\n        return acc;\n    }, {});\n}\n\n// TODO: Remove it when the type is fixed in graphlib. from children(v: string): string[] to children(v?: string): string[];\nexport const GRAPH_NODE = \"\\x00\";\n", "export const version = \"3.0.0\";\n", "/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\ninterface ListNode {\n    _next?: ListNode;\n    _prev?: ListNode;\n\n    [key: string]: unknown;\n}\n\nclass List {\n    private _sentinel: ListNode;\n\n    constructor() {\n        const sentinel: ListNode = {};\n        sentinel._next = sentinel._prev = sentinel;\n        this._sentinel = sentinel;\n    }\n\n    dequeue(): ListNode | undefined {\n        const sentinel = this._sentinel;\n        const entry = sentinel._prev;\n        if (entry !== sentinel) {\n            unlink(entry!);\n            return entry;\n        }\n        return undefined;\n    }\n\n    enqueue(entry: ListNode): void {\n        const sentinel = this._sentinel;\n        if (entry._prev && entry._next) {\n            unlink(entry);\n        }\n        entry._next = sentinel._next;\n        sentinel._next!._prev = entry;\n        sentinel._next = entry;\n        entry._prev = sentinel;\n    }\n\n    toString(): string {\n        const strs: string[] = [];\n        const sentinel = this._sentinel;\n        let curr = sentinel._prev;\n        while (curr !== sentinel) {\n            strs.push(JSON.stringify(curr, filterOutLinks));\n            curr = curr!._prev;\n        }\n        return \"[\" + strs.join(\", \") + \"]\";\n    }\n}\n\nfunction unlink(entry: ListNode): void {\n    entry._prev!._next = entry._next;\n    entry._next!._prev = entry._prev;\n    delete entry._next;\n    delete entry._prev;\n}\n\nfunction filterOutLinks(k: string, v: unknown): unknown {\n    if (k !== \"_next\" && k !== \"_prev\") {\n        return v;\n    }\n    return undefined;\n}\n\nexport default List;\n", "import {Graph} from \"./graph-lib\";\nimport List from './data/list';\nimport type {Edge, WeightFunction} from './types';\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\n\nconst DEFAULT_WEIGHT_FN: WeightFunction = () => 1;\n\ninterface FASEntry {\n    v: string;\n    in: number;\n    out: number;\n    [key: string]: unknown;\n}\n\ninterface FASState {\n    graph: Graph;\n    buckets: List[];\n    zeroIdx: number;\n}\n\nexport default function greedyFAS(graph: Graph, weightFn?: WeightFunction): Edge[] {\n    if (graph.nodeCount() <= 1) {\n        return [];\n    }\n    const state = buildState(graph, weightFn || DEFAULT_WEIGHT_FN);\n    const results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n    // Expand multi-edges\n    return results.flatMap(edge => graph.outEdges(edge.v, edge.w) || []);\n}\n\nfunction doGreedyFAS(g: Graph, buckets: List[], zeroIdx: number): Edge[] {\n    let results: Edge[] = [];\n    const sources = buckets[buckets.length - 1]!;\n    const sinks = buckets[0]!;\n\n    let entry: FASEntry | undefined;\n    while (g.nodeCount()) {\n        while ((entry = sinks.dequeue() as FASEntry | undefined)) {\n            removeNode(g, buckets, zeroIdx, entry);\n        }\n        while ((entry = sources.dequeue() as FASEntry | undefined)) {\n            removeNode(g, buckets, zeroIdx, entry);\n        }\n        if (g.nodeCount()) {\n            for (let i = buckets.length - 2; i > 0; --i) {\n                entry = buckets[i]?.dequeue() as FASEntry | undefined;\n                if (entry) {\n                    results = results.concat(removeNode(g, buckets, zeroIdx, entry, true) || []);\n                    break;\n                }\n            }\n        }\n    }\n\n    return results;\n}\n\nfunction removeNode(\n    graph: Graph,\n    buckets: List[],\n    zeroIdx: number,\n    entry: FASEntry,\n    collectPredecessors?: boolean\n): Edge[] | undefined {\n    const collected: Edge[] = [];\n    const results: Edge[] | undefined = collectPredecessors ? collected : undefined;\n\n    (graph.inEdges(entry.v) || []).forEach(edge => {\n        const weight = graph.edge(edge) as number;\n        const uEntry = graph.node(edge.v) as FASEntry;\n\n        if (collectPredecessors) {\n            collected.push({v: edge.v, w: edge.w});\n        }\n\n        uEntry.out -= weight;\n        assignBucket(buckets, zeroIdx, uEntry);\n    });\n\n    (graph.outEdges(entry.v) || []).forEach(edge => {\n        const weight = graph.edge(edge) as number;\n        const w = edge.w;\n        const wEntry = graph.node(w) as FASEntry;\n        wEntry.in -= weight;\n        assignBucket(buckets, zeroIdx, wEntry);\n    });\n\n    graph.removeNode(entry.v);\n\n    return results;\n}\n\nfunction buildState(graph: Graph, weightFn: WeightFunction): FASState {\n    const fasGraph = new Graph();\n    let maxIn = 0;\n    let maxOut = 0;\n\n    graph.nodes().forEach(v => {\n        fasGraph.setNode(v, {v: v, in: 0, out: 0});\n    });\n\n    // Aggregate weights on nodes, but also sum the weights across multi-edges\n    // into a single edge for the fasGraph.\n    graph.edges().forEach(edge => {\n        const prevWeight = (fasGraph.edge(edge.v, edge.w) as number) || 0;\n        const weight = weightFn(edge);\n        const edgeWeight = prevWeight + weight;\n        fasGraph.setEdge(edge.v, edge.w, edgeWeight);\n        const vNode = fasGraph.node(edge.v) as FASEntry;\n        const wNode = fasGraph.node(edge.w) as FASEntry;\n        maxOut = Math.max(maxOut, vNode.out += weight);\n        maxIn = Math.max(maxIn, wNode.in += weight);\n    });\n\n    const buckets = range(maxOut + maxIn + 3).map(() => new List());\n    const zeroIdx = maxIn + 1;\n\n    fasGraph.nodes().forEach(v => {\n        assignBucket(buckets, zeroIdx, fasGraph.node(v) as FASEntry);\n    });\n\n    return {graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx};\n}\n\nfunction assignBucket(buckets: List[], zeroIdx: number, entry: FASEntry): void {\n    if (!entry.out) {\n        buckets[0]?.enqueue(entry);\n    } else if (!entry.in) {\n        buckets[buckets.length - 1]?.enqueue(entry);\n    } else {\n        buckets[entry.out - entry.in + zeroIdx]?.enqueue(entry);\n    }\n}\n\nfunction range(limit: number): number[] {\n    const range: number[] = [];\n    for (let i = 0; i < limit; i++) {\n        range.push(i);\n    }\n\n    return range;\n}\n", "import {Graph} from \"@dagrejs/graphlib\";\nimport greedyFAS from \"./greedy-fas\";\nimport {uniqueId} from \"./util\";\nimport type {Edge, EdgeLabel, GraphLabel, NodeLabel, WeightFunction} from \"./types\";\n\nexport {run, undo};\n\nfunction run(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const fas = (graph.graph().acyclicer === \"greedy\"\n        ? greedyFAS(graph, weightFn(graph))\n        : dfsFAS(graph));\n    fas.forEach(e => {\n        const label = graph.edge(e)!;\n        graph.removeEdge(e);\n        label.forwardName = e.name;\n        label.reversed = true;\n        graph.setEdge(e.w, e.v, label, uniqueId(\"rev\"));\n    });\n\n    function weightFn(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): WeightFunction {\n        return (e: Edge) => {\n            return g.edge(e)!.weight!;\n        };\n    }\n}\n\nfunction dfsFAS(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Edge[] {\n    const fas: Edge[] = [];\n    const stack: { [key: string]: boolean } = {};\n    const visited: { [key: string]: boolean } = {};\n\n    function dfs(v: string): void {\n        if (Object.hasOwn(visited, v)) {\n            return;\n        }\n        visited[v] = true;\n        stack[v] = true;\n        graph.outEdges(v)!.forEach(e => {\n            if (Object.hasOwn(stack, e.w)) {\n                fas.push(e);\n            } else {\n                dfs(e.w);\n            }\n        });\n        delete stack[v];\n    }\n\n    graph.nodes().forEach(dfs);\n    return fas;\n}\n\nfunction undo(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    graph.edges().forEach(e => {\n        const label = graph.edge(e)!;\n        if (label.reversed) {\n            graph.removeEdge(e);\n\n            const forwardName = label.forwardName;\n            delete label.reversed;\n            delete label.forwardName;\n            graph.setEdge(e.w, e.v, label, forwardName);\n        }\n    });\n}\n", "import {addDummyNode} from \"./util\";\nimport type {Edge, EdgeLabel, Graph, GraphLabel, NodeLabel} from \"./types\";\n\nexport {\n    run,\n    undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    graph.graph().dummyChains = [];\n    graph.edges().forEach(edge => normalizeEdge(graph, edge));\n}\n\nfunction normalizeEdge(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, e: Edge): void {\n    let v: string = e.v;\n    let vRank: number = graph.node(v).rank!;\n    const w: string = e.w;\n    const wRank: number = graph.node(w).rank!;\n    const name: string | undefined = e.name;\n    const edgeLabel: EdgeLabel = graph.edge(e);\n    const labelRank: number | undefined = edgeLabel.labelRank;\n\n    if (wRank === vRank + 1) return;\n\n    graph.removeEdge(e);\n\n    let dummy: string;\n    let attrs: Partial<NodeLabel>;\n    let i: number;\n    for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n        edgeLabel.points = [];\n        attrs = {\n            width: 0,\n            height: 0,\n            edgeLabel: edgeLabel,\n            edgeObj: e,\n            rank: vRank\n        };\n        dummy = addDummyNode(graph, \"edge\", attrs, \"_d\");\n        if (vRank === labelRank) {\n            attrs.width = edgeLabel.width;\n            attrs.height = edgeLabel.height;\n            attrs.dummy = \"edge-label\";\n            attrs.labelpos = edgeLabel.labelpos;\n        }\n        graph.setEdge(v, dummy, {weight: edgeLabel.weight}, name);\n        if (i === 0) {\n            graph.graph().dummyChains!.push(dummy);\n        }\n        v = dummy;\n    }\n\n    graph.setEdge(v, w, {weight: edgeLabel.weight}, name);\n}\n\nfunction undo(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    graph.graph().dummyChains!.forEach(v => {\n        let node: NodeLabel = graph.node(v);\n        const origLabel: EdgeLabel = node.edgeLabel!;\n        let w: string;\n        graph.setEdge(node.edgeObj!, origLabel);\n        while (node.dummy) {\n            w = graph.successors(v)![0]!;\n            graph.removeNode(v);\n            origLabel.points!.push({x: node.x!, y: node.y!});\n            if (node.dummy === \"edge-label\") {\n                origLabel.x = node.x;\n                origLabel.y = node.y;\n                origLabel.width = node.width;\n                origLabel.height = node.height;\n            }\n            v = w;\n            node = graph.node(v);\n        }\n    });\n}\n", "import {applyWithChunking} from \"../util\";\nimport type {Edge, EdgeLabel, Graph, GraphLabel, NodeLabel} from \"../types\";\n\nexport {longestPath, slack};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const visited: { [key: string]: boolean } = {};\n\n    function dfs(v: string): number {\n        const label: NodeLabel = graph.node(v);\n        if (Object.hasOwn(visited, v)) {\n            return label.rank!;\n        }\n        visited[v] = true;\n\n        const outEdges = graph.outEdges(v);\n        const outEdgesMinLens: number[] = outEdges ? outEdges.map(e => {\n            if (e == null) {\n                return Number.POSITIVE_INFINITY;\n            }\n\n            return dfs(e.w) - graph.edge(e).minlen!;\n        }) : [];\n\n        let rank: number = applyWithChunking(Math.min, outEdgesMinLens);\n\n        if (rank === Number.POSITIVE_INFINITY) {\n            rank = 0;\n        }\n\n        return (label.rank = rank);\n    }\n\n    graph.sources().forEach(dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, edge: Edge): number {\n    return graph.node(edge.w).rank! - graph.node(edge.v).rank! - graph.edge(edge).minlen!;\n}\n", "import {Graph} from \"../graph-lib\";\nimport {slack} from \"./util\";\nimport type {Edge, EdgeLabel, GraphLabel, NodeLabel} from \"../types\";\n\n// Internal type for tree node labels\ninterface TreeNodeLabel {\n    low?: number;\n    lim?: number;\n    parent?: string;\n}\n\n// Internal type for tree edge labels\ninterface TreeEdgeLabel {\n    cutvalue?: number;\n}\n\nexport default feasibleTree;\nexport type {TreeNodeLabel, TreeEdgeLabel};\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Graph<object, TreeNodeLabel, TreeEdgeLabel> {\n    const tree = new Graph<object, TreeNodeLabel, TreeEdgeLabel>({directed: false});\n\n    // Choose arbitrary node from which to start our tree\n    const nodes = graph.nodes();\n    if (nodes.length === 0) {\n        throw new Error(\"Graph must have at least one node\");\n    }\n    const start: string = nodes[0]!;\n    const size: number = graph.nodeCount();\n    tree.setNode(start, {});\n\n    let edge: Edge | null;\n    let delta: number;\n    while (tightTree(tree, graph) < size) {\n        edge = findMinSlackEdge(tree, graph);\n        if (!edge) break;\n        delta = tree.hasNode(edge.v) ? slack(graph, edge) : -slack(graph, edge);\n        shiftRanks(tree, graph, delta);\n    }\n\n    return tree;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): number {\n    function dfs(v: string): void {\n        const nodeEdges = graph.nodeEdges(v);\n        if (nodeEdges) {\n            nodeEdges.forEach(e => {\n                const edgeV: string = e.v;\n                const w: string = (v === edgeV) ? e.w : edgeV;\n                if (!tree.hasNode(w) && !slack(graph, e)) {\n                    tree.setNode(w, {});\n                    tree.setEdge(v, w, {});\n                    dfs(w);\n                }\n            });\n        }\n    }\n\n    tree.nodes().forEach(dfs);\n    return tree.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Edge | null {\n    const edges: Edge[] = graph.edges();\n\n    return edges.reduce((acc: [number, Edge | null], edge: Edge): [number, Edge | null] => {\n        let edgeSlack: number = Number.POSITIVE_INFINITY;\n        if (tree.hasNode(edge.v) !== tree.hasNode(edge.w)) {\n            edgeSlack = slack(graph, edge);\n        }\n\n        if (edgeSlack < acc[0]) {\n            return [edgeSlack, edge];\n        }\n\n        return acc;\n    }, [Number.POSITIVE_INFINITY, null])[1];\n}\n\nfunction shiftRanks(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, delta: number): void {\n    tree.nodes().forEach(v => graph.node(v).rank! += delta);\n}\n", "import feasibleTree, {type TreeEdgeLabel, type TreeNodeLabel} from \"./feasible-tree\";\nimport {longestPath as initRank, slack} from \"./util\";\nimport {alg} from \"../graph-lib\";\nimport {simplify} from \"../util\";\nimport type {Edge, EdgeLabel, Graph, GraphLabel, NodeLabel} from \"../types\";\n\nconst {preorder, postorder} = alg;\n\nexport default networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    graph = simplify(graph as Graph<GraphLabel, NodeLabel, EdgeLabel>) as Graph<GraphLabel, NodeLabel, EdgeLabel>;\n    initRank(graph);\n\n    const t = feasibleTree(graph);\n    initLowLimValues(t);\n    initCutValues(t, graph);\n\n    let e: Edge | undefined;\n    let f: Edge;\n    while ((e = leaveEdge(t))) {\n        f = enterEdge(t, graph, e);\n        exchangeEdges(t, graph, e, f);\n    }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    let visitedNodes: string[] = postorder(tree, tree.nodes());\n    visitedNodes = visitedNodes.slice(0, visitedNodes.length - 1);\n    visitedNodes.forEach(v => assignCutValue(tree, graph, v));\n}\n\nfunction assignCutValue(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, child: string): void {\n    const childLab: TreeNodeLabel = tree.node(child);\n    const parent: string = childLab.parent!;\n    const edge = tree.edge(child, parent);\n    edge.cutvalue = calcCutValue(tree, graph, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, child: string): number {\n    const childLab: TreeNodeLabel = tree.node(child);\n    const parent: string = childLab.parent!;\n    // True if the child is on the tail end of the edge in the directed graph\n    let childIsTail: boolean = true;\n    // The graph's view of the tree edge we're inspecting\n    let graphEdge: EdgeLabel | undefined = graph.edge(child, parent);\n    // The accumulated cut value for the edge between this node and its parent\n    let cutValue: number = 0;\n\n    if (!graphEdge) {\n        childIsTail = false;\n        graphEdge = graph.edge(parent, child);\n    }\n\n    cutValue = graphEdge.weight!;\n\n    const nodeEdges = graph.nodeEdges(child);\n    if (nodeEdges) {\n        nodeEdges.forEach(edge => {\n            const isOutEdge: boolean = edge.v === child;\n            const other: string = isOutEdge ? edge.w : edge.v;\n\n            if (other !== parent) {\n                const pointsToHead: boolean = isOutEdge === childIsTail;\n                const otherWeight: number = graph.edge(edge).weight!;\n\n                cutValue += pointsToHead ? otherWeight : -otherWeight;\n                if (isTreeEdge(tree, child, other)) {\n                    const treeEdge = tree.edge(child, other);\n                    const otherCutValue: number = treeEdge.cutvalue!;\n                    cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n                }\n            }\n        });\n    }\n\n    return cutValue;\n}\n\nfunction initLowLimValues(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, root?: string): void {\n    if (arguments.length < 2) {\n        root = tree.nodes()[0];\n    }\n    dfsAssignLowLim(tree, {}, 1, root!);\n}\n\nfunction dfsAssignLowLim(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, visited: {\n    [key: string]: boolean\n}, nextLim: number, v: string, parent?: string): number {\n    const low: number = nextLim;\n    const label: TreeNodeLabel = tree.node(v);\n\n    visited[v] = true;\n    const neighbors = tree.neighbors(v);\n    if (neighbors) {\n        neighbors.forEach(w => {\n            if (!Object.hasOwn(visited, w)) {\n                nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n            }\n        });\n    }\n\n    label.low = low;\n    label.lim = nextLim++;\n    if (parent) {\n        label.parent = parent;\n    } else {\n        // TODO should be able to remove this when we incrementally update low lim\n        delete label.parent;\n    }\n\n    return nextLim;\n}\n\nfunction leaveEdge(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>): Edge | undefined {\n    return tree.edges().find(e => {\n        const edge = tree.edge(e);\n        return edge.cutvalue! < 0;\n    });\n}\n\nfunction enterEdge(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, edge: Edge): Edge {\n    let v: string = edge.v;\n    let w: string = edge.w;\n\n    // For the rest of this function we assume that v is the tail and w is the\n    // head, so if we don't have this edge in the graph we should flip it to\n    // match the correct orientation.\n    if (!graph.hasEdge(v, w)) {\n        v = edge.w;\n        w = edge.v;\n    }\n\n    const vLabel: TreeNodeLabel = tree.node(v);\n    const wLabel: TreeNodeLabel = tree.node(w);\n    let tailLabel: TreeNodeLabel = vLabel;\n    let flip: boolean = false;\n\n    // If the root is in the tail of the edge then we need to flip the logic that\n    // checks for the head and tail nodes in the candidates function below.\n    if (vLabel.lim! > wLabel.lim!) {\n        tailLabel = wLabel;\n        flip = true;\n    }\n\n    const candidates: Edge[] = graph.edges().filter(edge => {\n        return flip === isDescendant(tree, tree.node(edge.v), tailLabel) &&\n            flip !== isDescendant(tree, tree.node(edge.w), tailLabel);\n    });\n\n    return candidates.reduce((acc: Edge, edge: Edge): Edge => {\n        if (slack(graph, edge) < slack(graph, acc)) {\n            return edge;\n        }\n\n        return acc;\n    });\n}\n\nfunction exchangeEdges(t: Graph<object, TreeNodeLabel, TreeEdgeLabel>, g: Graph<GraphLabel, NodeLabel, EdgeLabel>, e: Edge, f: Edge): void {\n    const v: string = e.v;\n    const w: string = e.w;\n    t.removeEdge(v, w);\n    t.setEdge(f.v, f.w, {});\n    initLowLimValues(t);\n    initCutValues(t, g);\n    updateRanks(t, g);\n}\n\nfunction updateRanks(t: Graph<object, TreeNodeLabel, TreeEdgeLabel>, g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const root: string | undefined = t.nodes().find(v => {\n        const node = t.node(v);\n        return !node.parent;\n    });\n    if (!root) return;\n\n    let vs: string[] = preorder(t, [root]);\n    vs = vs.slice(1);\n    vs.forEach(v => {\n        const treeNode = t.node(v);\n        const parent: string = treeNode.parent!;\n        let edge: EdgeLabel | undefined = g.edge(v, parent);\n        let flipped: boolean = false;\n\n        if (!edge) {\n            edge = g.edge(parent, v);\n            flipped = true;\n        }\n\n        g.node(v).rank = g.node(parent).rank! + (flipped ? edge!.minlen! : -edge!.minlen!);\n    });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, u: string, v: string): boolean {\n    return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree: Graph<object, TreeNodeLabel, TreeEdgeLabel>, vLabel: TreeNodeLabel, rootLabel: TreeNodeLabel): boolean {\n    return rootLabel.low! <= vLabel.lim! && vLabel.lim! <= rootLabel.lim!;\n}\n", "\uFEFFimport {longestPath} from \"./util\";\nimport feasibleTree from \"./feasible-tree\";\nimport networkSimplex from \"./network-simplex\";\nimport type {EdgeLabel, Graph, GraphLabel, NodeLabel, RankerFunction} from \"../types\";\n\nexport default rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const ranker: RankerFunction | string | undefined = graph.graph().ranker;\n    if (typeof ranker === 'function') {\n        return (ranker as RankerFunction)(graph);\n    }\n    switch (ranker) {\n    case \"network-simplex\":\n        networkSimplexRanker(graph);\n        break;\n    case \"tight-tree\":\n        tightTreeRanker(graph);\n        break;\n    case \"longest-path\":\n        longestPathRanker(graph);\n        break;\n    case \"none\":\n        break;\n    default:\n        networkSimplexRanker(graph);\n    }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nconst longestPathRanker: RankerFunction = longestPath;\n\nfunction tightTreeRanker(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    longestPath(g);\n    feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    networkSimplex(g);\n}\n", "import type {Edge, EdgeLabel, Graph, GraphLabel, NodeLabel} from \"./types\";\nimport {GRAPH_NODE} from \"./util\";\n\nexport default parentDummyChains;\n\ninterface PostorderNum {\n    low: number;\n    lim: number;\n}\n\ninterface PathData {\n    path: (string | undefined)[];\n    lca: string | undefined;\n}\n\nfunction parentDummyChains(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const postorderNums: { [key: string]: PostorderNum } = postorder(graph);\n\n    graph.graph().dummyChains!.forEach(v => {\n        let node: NodeLabel = graph.node(v);\n        const edgeObj: Edge = node.edgeObj!;\n        const pathData: PathData = findPath(graph, postorderNums, edgeObj.v, edgeObj.w);\n        const path: (string | undefined)[] = pathData.path;\n        const lca: string | undefined = pathData.lca;\n        let pathIdx: number = 0;\n        let pathV: string | undefined = path[pathIdx];\n        let ascending: boolean = true;\n\n        while (v !== edgeObj.w) {\n            node = graph.node(v);\n\n            if (ascending) {\n                while ((pathV = path[pathIdx]) !== lca &&\n                graph.node(pathV!).maxRank! < node.rank!) {\n                    pathIdx++;\n                }\n\n                if (pathV === lca) {\n                    ascending = false;\n                }\n            }\n\n            if (!ascending) {\n                while (pathIdx < path.length - 1 &&\n                graph.node((path[pathIdx + 1])!).minRank! <= node.rank!) {\n                    pathIdx++;\n                }\n                pathV = path[pathIdx];\n            }\n\n            if (pathV !== undefined) {\n                graph.setParent(v, pathV);\n            }\n            v = graph.successors(v)![0]!;\n        }\n    });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(\n    graph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    postorderNums: { [key: string]: PostorderNum },\n    v: string,\n    w: string\n): PathData {\n    const vPath: (string | undefined)[] = [];\n    const wPath: (string | undefined)[] = [];\n    const low: number = Math.min(postorderNums[v]!.low, postorderNums[w]!.low);\n    const lim: number = Math.max(postorderNums[v]!.lim, postorderNums[w]!.lim);\n    let parent: string | undefined;\n\n    // Traverse up from v to find the LCA\n    parent = v;\n    do {\n        parent = graph.parent(parent) as string | undefined;\n        vPath.push(parent);\n    } while (parent &&\n    (postorderNums[parent]!.low > low || lim > postorderNums[parent]!.lim));\n    const lca = parent;\n\n    // Traverse from w to LCA\n    let wParent: string = w;\n    while ((wParent = graph.parent(wParent) as string) !== lca) {\n        wPath.push(wParent);\n    }\n\n    return {path: vPath.concat(wPath.reverse()), lca: lca};\n}\n\nfunction postorder(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): { [key: string]: PostorderNum } {\n    const result: { [key: string]: PostorderNum } = {};\n    let lim: number = 0;\n\n    function dfs(v: string): void {\n        const low: number = lim;\n        graph.children(v).forEach(dfs);\n        result[v] = {low: low, lim: lim++};\n    }\n\n    graph.children(GRAPH_NODE).forEach(dfs);\n\n    return result;\n}\n", "import {addBorderNode, addDummyNode, applyWithChunking, GRAPH_NODE} from \"./util\";\nimport type {EdgeLabel, Graph, GraphLabel, NodeLabel} from \"./types\";\n\nexport {\n    run,\n    cleanup,\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundaries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const root: string = addDummyNode(graph, \"root\", {}, \"_root\");\n    const depths: { [key: string]: number } = treeDepths(graph);\n    const depthsArr: number[] = Object.values(depths);\n    const height: number = applyWithChunking(Math.max, depthsArr) - 1; // Note: depths is an Object not an array\n    const nodeSep: number = 2 * height + 1;\n\n    graph.graph().nestingRoot = root;\n\n    // Multiply minlen by nodeSep to align nodes on non-border ranks.\n    graph.edges().forEach(e => graph.edge(e).minlen! *= nodeSep);\n\n    // Calculate a weight that is sufficient to keep subgraphs vertically compact\n    const weight: number = sumWeights(graph) + 1;\n\n    // Create border nodes and link them up\n    graph.children(GRAPH_NODE).forEach(child => dfs(graph, root, nodeSep, weight, height, depths, child));\n\n    // Save the multiplier for node layers for later removal of empty border\n    // layers.\n    graph.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(\n    graph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    root: string,\n    nodeSep: number,\n    weight: number,\n    height: number,\n    depths: { [key: string]: number },\n    v: string\n): void {\n    const children: string[] = graph.children(v);\n    if (!children.length) {\n        if (v !== root) {\n            graph.setEdge(root, v, {weight: 0, minlen: nodeSep});\n        }\n        return;\n    }\n\n    const top: string = addBorderNode(graph, \"_bt\");\n    const bottom: string = addBorderNode(graph, \"_bb\");\n    const label: NodeLabel = graph.node(v);\n\n    graph.setParent(top, v);\n    label.borderTop = top;\n    graph.setParent(bottom, v);\n    label.borderBottom = bottom;\n\n    children.forEach(child => {\n        dfs(graph, root, nodeSep, weight, height, depths, child);\n\n        const childNode: NodeLabel = graph.node(child);\n        const childTop: string = childNode.borderTop ? childNode.borderTop : child;\n        const childBottom: string = childNode.borderBottom ? childNode.borderBottom : child;\n        const thisWeight: number = childNode.borderTop ? weight : 2 * weight;\n        const minlen: number = childTop !== childBottom ? 1 : height - (depths[v] ?? 0) + 1;\n\n        graph.setEdge(top, childTop, {\n            weight: thisWeight,\n            minlen: minlen,\n            nestingEdge: true\n        });\n\n        graph.setEdge(childBottom, bottom, {\n            weight: thisWeight,\n            minlen: minlen,\n            nestingEdge: true\n        });\n    });\n\n    if (!graph.parent(v)) {\n        graph.setEdge(root, top, {weight: 0, minlen: height + (depths[v] ?? 0)});\n    }\n}\n\nfunction treeDepths(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): { [key: string]: number } {\n    const depths: { [key: string]: number } = {};\n\n    function dfs(v: string, depth: number): void {\n        const children: string[] = graph.children(v);\n        if (children && children.length) {\n            children.forEach(child => dfs(child, depth + 1));\n        }\n        depths[v] = depth;\n    }\n\n    graph.children(GRAPH_NODE).forEach(v => dfs(v, 1));\n    return depths;\n}\n\nfunction sumWeights(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): number {\n    return graph.edges().reduce((acc, e) => acc + graph.edge(e).weight!, 0);\n}\n\nfunction cleanup(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const graphLabel: GraphLabel = graph.graph();\n    graph.removeNode(graphLabel.nestingRoot!);\n    delete graphLabel.nestingRoot;\n    graph.edges().forEach(e => {\n        const edge: EdgeLabel = graph.edge(e);\n        if (edge.nestingEdge) {\n            graph.removeEdge(e);\n        }\n    });\n}\n", "import {addDummyNode, GRAPH_NODE} from \"./util\";\nimport type {EdgeLabel, Graph, GraphLabel, NodeLabel} from \"./types\";\n\nexport default addBorderSegments;\n\nfunction addBorderSegments(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    function dfs(v: string): void {\n        const children: string[] = graph.children(v);\n        const node = graph.node(v);\n        if (children.length) {\n            children.forEach(dfs);\n        }\n\n        if (Object.hasOwn(node, \"minRank\")) {\n            node.borderLeft = [];\n            node.borderRight = [];\n            for (let rank: number = node.minRank!, maxRank: number = node.maxRank! + 1;\n                rank < maxRank;\n                ++rank) {\n                addBorderNode(graph, \"borderLeft\", \"_bl\", v, node, rank);\n                addBorderNode(graph, \"borderRight\", \"_br\", v, node, rank);\n            }\n        }\n    }\n\n    graph.children(GRAPH_NODE).forEach(dfs);\n}\n\nfunction addBorderNode(\n    graph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    prop: \"borderLeft\" | \"borderRight\",\n    prefix: string,\n    sg: string,\n    sgNode: EdgeLabel,\n    rank: number\n): void {\n    const label: Partial<NodeLabel> = {width: 0, height: 0, rank: rank, borderType: prop};\n    const prev: string | undefined = (sgNode[prop] as string[])[rank - 1];\n    const curr: string = addDummyNode(graph, \"border\", label, prefix);\n    (sgNode[prop] as string[])[rank] = curr;\n    graph.setParent(curr, sg);\n    if (prev) {\n        graph.setEdge(prev, curr, {weight: 1});\n    }\n}\n", "import type {EdgeLabel, Graph, GraphLabel, NodeLabel, Point} from './types';\n\nexport function adjust(graph: Graph): void {\n    const rankDir = (graph.graph() as GraphLabel).rankdir?.toLowerCase();\n    if (rankDir === 'lr' || rankDir === 'rl') {\n        swapWidthHeight(graph);\n    }\n}\n\nexport function undo(graph: Graph): void {\n    const rankDir = (graph.graph() as GraphLabel).rankdir?.toLowerCase();\n    if (rankDir === 'bt' || rankDir === 'rl') {\n        reverseY(graph);\n    }\n\n    if (rankDir === 'lr' || rankDir === 'rl') {\n        swapXY(graph);\n        swapWidthHeight(graph);\n    }\n}\n\nfunction swapWidthHeight(graph: Graph): void {\n    graph.nodes().forEach(node => swapWidthHeightOne(graph.node(node) as NodeLabel));\n    graph.edges().forEach(edge => swapWidthHeightOne(graph.edge(edge) as EdgeLabel));\n}\n\nfunction swapWidthHeightOne(attrs: NodeLabel | EdgeLabel): void {\n    const w = attrs.width;\n    attrs.width = attrs.height;\n    attrs.height = w;\n}\n\nfunction reverseY(graph: Graph): void {\n    graph.nodes().forEach(node => reverseYOne(graph.node(node) as NodeLabel));\n\n    graph.edges().forEach(edge => {\n        const edgeLabel = graph.edge(edge) as EdgeLabel;\n        edgeLabel.points?.forEach(reverseYOne);\n        if (Object.hasOwn(edgeLabel, 'y')) {\n            reverseYOne(edgeLabel);\n        }\n    });\n}\n\nfunction reverseYOne(attrs: NodeLabel | EdgeLabel | Point): void {\n    attrs.y = -attrs.y!;\n}\n\nfunction swapXY(graph: Graph): void {\n    graph.nodes().forEach(node => swapXYOne(graph.node(node) as NodeLabel));\n\n    graph.edges().forEach(edge => {\n        const edgeLabel = graph.edge(edge) as EdgeLabel;\n        edgeLabel.points?.forEach(swapXYOne);\n        if (Object.hasOwn(edgeLabel, 'x')) {\n            swapXYOne(edgeLabel);\n        }\n    });\n}\n\nfunction swapXYOne(attrs: NodeLabel | EdgeLabel | Point): void {\n    const x = attrs.x;\n    attrs.x = attrs.y;\n    attrs.y = x;\n}\n", "import * as util from \"../util\";\nimport type {Graph} from '../types';\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nexport default function initOrder(graph: Graph): string[][] {\n    const visited: { [key: string]: boolean } = {};\n    const simpleNodes = graph.nodes().filter(v => !graph.children(v).length);\n    const simpleNodesRanks = simpleNodes.map(v => graph.node(v).rank);\n    const maxRank = util.applyWithChunking(Math.max, simpleNodesRanks);\n    const layers: string[][] = util.range(maxRank + 1).map(() => []);\n\n    function dfs(v: string): void {\n        if (visited[v]) return;\n        visited[v] = true;\n        const node = graph.node(v);\n        layers[node.rank]!.push(v);\n        const successors = graph.successors(v);\n        if (successors) {\n            successors.forEach(dfs);\n        }\n    }\n\n    const orderedVs = simpleNodes.sort((a, b) => graph.node(a).rank - graph.node(b).rank);\n    orderedVs.forEach(dfs);\n\n    return layers;\n}\n", "import {zipObject} from \"../util\";\nimport type {Graph} from '../types';\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nexport default function crossCount(graph: Graph, layering: string[][]): number {\n    let cc = 0;\n    for (let i = 1; i < layering.length; ++i) {\n        cc += twoLayerCrossCount(graph, layering[i - 1]!, layering[i]!);\n    }\n    return cc;\n}\n\ninterface SouthEntry {\n    pos: number;\n    weight: number;\n}\n\nfunction twoLayerCrossCount(graph: Graph, northLayer: string[], southLayer: string[]): number {\n    // Sort all of the edges between the north and south layers by their position\n    // in the north layer and then the south. Map these edges to the position of\n    // their head in the south layer.\n    const southPos: { [key: string]: number } = zipObject(southLayer, southLayer.map((v, i) => i));\n    const southEntries: SouthEntry[] = northLayer.flatMap(v => {\n        const edges = graph.outEdges(v);\n        if (!edges) return [];\n        return edges.map(e => {\n            return {pos: southPos[e.w]!, weight: graph.edge(e).weight};\n        }).sort((a, b) => a.pos - b.pos);\n    });\n\n    // Build the accumulator tree\n    let firstIndex = 1;\n    while (firstIndex < southLayer.length) firstIndex <<= 1;\n    const treeSize = 2 * firstIndex - 1;\n    firstIndex -= 1;\n    const tree = new Array(treeSize).fill(0);\n\n    // Calculate the weighted crossings\n    let cc = 0;\n    southEntries.forEach((entry: SouthEntry) => {\n        let index = entry.pos + firstIndex;\n        tree[index] += entry.weight;\n        let weightSum = 0;\n        while (index > 0) {\n            if (index % 2) {\n                weightSum += tree[index + 1];\n            }\n            index = (index - 1) >> 1;\n            tree[index] += entry.weight;\n        }\n        cc += entry.weight * weightSum;\n    });\n\n    return cc;\n}\n", "import type {Graph} from '../types';\n\ninterface BarycenterEntry {\n    v: string;\n    barycenter?: number;\n    weight?: number;\n}\n\nexport default function barycenter(graph: Graph, movable: string[] = []): BarycenterEntry[] {\n    return movable.map(v => {\n        const inV = graph.inEdges(v);\n        if (!inV || !inV.length) {\n            return {v: v};\n        } else {\n            const result = inV.reduce((acc, e) => {\n                const edge = graph.edge(e);\n                const nodeU = graph.node(e.v);\n                return {\n                    sum: acc.sum + (edge.weight * nodeU.order),\n                    weight: acc.weight + edge.weight\n                };\n            }, {sum: 0, weight: 0});\n\n            return {\n                v: v,\n                barycenter: result.sum / result.weight,\n                weight: result.weight\n            };\n        }\n    });\n}\n", "import * as util from \"../util\";\nimport type {Graph} from '../types';\n\ninterface BarycenterEntry {\n    v: string;\n    barycenter?: number;\n    weight?: number;\n}\n\ninterface MappedEntry {\n    indegree: number;\n    in: MappedEntry[];\n    out: MappedEntry[];\n    vs: string[];\n    i: number;\n    barycenter?: number;\n    weight?: number;\n    merged?: boolean;\n    [key: string]: unknown;\n}\n\nexport interface ResolvedEntry {\n    vs: string[];\n    i: number;\n    barycenter?: number;\n    weight?: number;\n}\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nexport default function resolveConflicts(entries: BarycenterEntry[], constraintGraph: Graph): ResolvedEntry[] {\n    const mappedEntries: { [key: string]: MappedEntry } = {};\n    entries.forEach((entry, i) => {\n        const tmp: MappedEntry = {\n            indegree: 0,\n            \"in\": [],\n            out: [],\n            vs: [entry.v],\n            i: i\n        };\n        if (entry.barycenter !== undefined) {\n            tmp.barycenter = entry.barycenter;\n            tmp.weight = entry.weight;\n        }\n        mappedEntries[entry.v] = tmp;\n    });\n\n    constraintGraph.edges().forEach(e => {\n        const entryV = mappedEntries[e.v];\n        const entryW = mappedEntries[e.w];\n        if (entryV !== undefined && entryW !== undefined) {\n            entryW.indegree++;\n            entryV.out.push(entryW);\n        }\n    });\n\n    const sourceSet = Object.values(mappedEntries).filter(entry => !entry.indegree);\n\n    return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet: MappedEntry[]): ResolvedEntry[] {\n    const entries: MappedEntry[] = [];\n\n    function handleIn(vEntry: MappedEntry): (uEntry: MappedEntry) => void {\n        return (uEntry: MappedEntry) => {\n            if (uEntry.merged) {\n                return;\n            }\n            if (uEntry.barycenter === undefined ||\n                vEntry.barycenter === undefined ||\n                uEntry.barycenter >= vEntry.barycenter) {\n                mergeEntries(vEntry, uEntry);\n            }\n        };\n    }\n\n    function handleOut(vEntry: MappedEntry): (wEntry: MappedEntry) => void {\n        return (wEntry: MappedEntry) => {\n            wEntry[\"in\"].push(vEntry);\n            if (--wEntry.indegree === 0) {\n                sourceSet.push(wEntry);\n            }\n        };\n    }\n\n    while (sourceSet.length) {\n        const entry = sourceSet.pop()!;\n        entries.push(entry);\n        entry[\"in\"].reverse().forEach(handleIn(entry));\n        entry.out.forEach(handleOut(entry));\n    }\n\n    return entries.filter(entry => !entry.merged).map(entry => {\n        return util.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]) as ResolvedEntry;\n    }) as ResolvedEntry[];\n}\n\nfunction mergeEntries(target: MappedEntry, source: MappedEntry): void {\n    let sum = 0;\n    let weight = 0;\n\n    if (target.weight) {\n        sum += target.barycenter! * target.weight;\n        weight += target.weight;\n    }\n\n    if (source.weight) {\n        sum += source.barycenter! * source.weight;\n        weight += source.weight;\n    }\n\n    target.vs = source.vs.concat(target.vs);\n    target.barycenter = sum / weight;\n    target.weight = weight;\n    target.i = Math.min(source.i, target.i);\n    source.merged = true;\n}\n", "import * as util from \"../util\";\n\ninterface SortEntry {\n    vs: string[];\n    i: number;\n    barycenter?: number;\n    weight?: number;\n}\n\ninterface SortResult {\n    vs: string[];\n    barycenter?: number;\n    weight?: number;\n}\n\nexport default function sort(entries: SortEntry[], biasRight?: boolean): SortResult {\n    const parts = util.partition(entries, entry => {\n        return Object.hasOwn(entry, \"barycenter\");\n    });\n    const sortable = parts.lhs;\n    const unsortable = parts.rhs.sort((a, b) => b.i - a.i);\n    const vs: string[][] = [];\n    let sum = 0;\n    let weight = 0;\n    let vsIndex = 0;\n\n    sortable.sort(compareWithBias(!!biasRight));\n\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n    sortable.forEach(entry => {\n        vsIndex += entry.vs.length;\n        vs.push(entry.vs);\n        sum += entry.barycenter! * entry.weight!;\n        weight += entry.weight!;\n        vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n    });\n\n    const result: SortResult = {vs: vs.flat(1) as string[]};\n    if (weight) {\n        result.barycenter = sum / weight;\n        result.weight = weight;\n    }\n    return result;\n}\n\nfunction consumeUnsortable(vs: string[][], unsortable: SortEntry[], index: number): number {\n    let last: SortEntry | undefined;\n    while (unsortable.length && (last = unsortable[unsortable.length - 1])!.i <= index) {\n        unsortable.pop();\n        vs.push(last!.vs);\n        index++;\n    }\n    return index;\n}\n\nfunction compareWithBias(bias: boolean): (entryV: SortEntry, entryW: SortEntry) => number {\n    return (entryV: SortEntry, entryW: SortEntry) => {\n        if (entryV.barycenter! < entryW.barycenter!) {\n            return -1;\n        } else if (entryV.barycenter! > entryW.barycenter!) {\n            return 1;\n        }\n\n        return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n    };\n}\n", "import barycenter from \"./barycenter\";\nimport resolveConflicts from \"./resolve-conflicts\";\nimport sort from \"./sort\";\nimport type {Graph} from '../types';\n\ninterface SubgraphResult {\n    vs: string[];\n    barycenter?: number;\n    weight?: number;\n}\n\ninterface BarycenterEntry {\n    v: string;\n    barycenter?: number;\n    weight?: number;\n}\n\nexport default function sortSubgraph(graph: Graph, v: string, constraintGraph: Graph, biasRight?: boolean): SubgraphResult {\n    let movable = graph.children(v);\n    const node = graph.node(v);\n    const bl: string | undefined = node ? (node.borderLeft) : undefined;\n    const br: string | undefined = node ? (node.borderRight) : undefined;\n    const subgraphs: { [key: string]: SubgraphResult } = {};\n\n    if (bl) {\n        movable = movable.filter(w => w !== bl && w !== br);\n    }\n\n    const barycenters = barycenter(graph, movable);\n    barycenters.forEach(entry => {\n        if (graph.children(entry.v).length) {\n            const subgraphResult = sortSubgraph(graph, entry.v, constraintGraph, biasRight);\n            subgraphs[entry.v] = subgraphResult;\n            if (Object.hasOwn(subgraphResult, \"barycenter\")) {\n                mergeBarycenters(entry, subgraphResult);\n            }\n        }\n    });\n\n    const entries = resolveConflicts(barycenters, constraintGraph);\n    expandSubgraphs(entries, subgraphs);\n\n    const result = sort(entries, biasRight);\n\n    if (bl && br) {\n        result.vs = [bl, result.vs, br].flat(1) as string[];\n        const blPredecessors = graph.predecessors(bl);\n        if (blPredecessors && blPredecessors.length) {\n            const blPred = graph.node(blPredecessors[0]!);\n            const brPredecessors = graph.predecessors(br);\n            const brPred = graph.node(brPredecessors![0]!);\n            if (!Object.hasOwn(result, \"barycenter\")) {\n                result.barycenter = 0;\n                result.weight = 0;\n            }\n            result.barycenter = (result.barycenter! * result.weight! +\n                blPred.order! + brPred.order!) / (result.weight! + 2);\n            result.weight! += 2;\n        }\n    }\n\n    return result;\n}\n\nfunction expandSubgraphs(entries: { vs: string[] }[], subgraphs: { [key: string]: SubgraphResult }): void {\n    entries.forEach(entry => {\n        entry.vs = entry.vs.flatMap(v => {\n            if (subgraphs[v]) {\n                return subgraphs[v].vs;\n            }\n            return v;\n        });\n    });\n}\n\nfunction mergeBarycenters(target: BarycenterEntry, other: SubgraphResult): void {\n    if (target.barycenter !== undefined) {\n        target.barycenter = (target.barycenter * target.weight! +\n                other.barycenter! * other.weight!) /\n            (target.weight! + other.weight!);\n        target.weight! += other.weight!;\n    } else {\n        target.barycenter = other.barycenter;\n        target.weight = other.weight;\n    }\n}\n", "import {Graph} from \"../graph-lib\";\nimport * as util from \"../util\";\nimport type {Graph as GraphType} from '../types';\n\ninterface LayerGraphLabel {\n    root: string;\n}\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *    5. If `nodesWithRank` is not undefined, it must contains only the nodes\n *       which belong to `g` and belong to `rank`.\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nexport default function buildLayerGraph(\n    graph: GraphType,\n    rank: number,\n    relationship: \"inEdges\" | \"outEdges\",\n    nodesWithRank?: string[]\n): GraphType {\n    if (!nodesWithRank) {\n        nodesWithRank = graph.nodes();\n    }\n    const root = createRootNode(graph);\n    const result = new Graph({compound: true})\n        .setGraph({root: root} as LayerGraphLabel)\n        .setDefaultNodeLabel((v: string) => graph.node(v)) as GraphType;\n\n    nodesWithRank.forEach((v: string) => {\n        const node = graph.node(v);\n        const parent = graph.parent(v);\n\n        if (node.rank === rank || node.minRank! <= rank && rank <= node.maxRank!) {\n            result.setNode(v);\n            result.setParent(v, parent || root);\n\n            // This assumes we have only short edges!\n            const edges = graph[relationship](v);\n            if (edges) {\n                edges.forEach(e => {\n                    const u = e.v === v ? e.w : e.v;\n                    const edge = result.edge(u, v);\n                    const weight = edge !== undefined ? edge.weight : 0;\n                    result.setEdge(u, v, {weight: graph.edge(e).weight + weight});\n                });\n            }\n\n            if (Object.hasOwn(node, \"minRank\")) {\n                result.setNode(v, {\n                    borderLeft: node.borderLeft![rank],\n                    borderRight: node.borderRight![rank]\n                });\n            }\n        }\n    });\n\n    return result;\n}\n\nfunction createRootNode(graph: GraphType): string {\n    let v: string;\n    while (graph.hasNode((v = util.uniqueId(\"_root\")))) ;\n    return v;\n}\n", "import type {Graph} from '../types';\n\nexport default function addSubgraphConstraints(graph: Graph, constraintGraph: Graph, vs: string[]): void {\n    const prev: { [key: string]: string } = {};\n    let rootPrev: string | undefined;\n\n    vs.forEach(v => {\n        let child: string | undefined | void = graph.parent(v);\n        let parent: string | undefined | void;\n        let prevChild: string | undefined;\n        while (child) {\n            parent = graph.parent(child);\n            if (parent) {\n                prevChild = prev[parent];\n                prev[parent] = child;\n            } else {\n                prevChild = rootPrev;\n                rootPrev = child;\n            }\n            if (prevChild && prevChild !== child) {\n                constraintGraph.setEdge(prevChild, child);\n                return;\n            }\n            child = parent;\n        }\n    });\n\n    /*\n    function dfs(v) {\n      var children = v ? g.children(v) : g.children();\n      if (children.length) {\n        var min = Number.POSITIVE_INFINITY,\n            subgraphs = [];\n        children.forEach(function(child) {\n          var childMin = dfs(child);\n          if (g.children(child).length) {\n            subgraphs.push({ v: child, order: childMin });\n          }\n          min = Math.min(min, childMin);\n        });\n        _.sortBy(subgraphs, \"order\").reduce(function(prev, curr) {\n          cg.setEdge(prev.v, curr.v);\n          return curr;\n        });\n        return min;\n      }\n      return g.node(v).order;\n    }\n    dfs(undefined);\n    */\n}\n", "import initOrder from \"./init-order\";\nimport crossCount from \"./cross-count\";\nimport sortSubgraph from \"./sort-subgraph\";\nimport buildLayerGraph from \"./build-layer-graph\";\nimport addSubgraphConstraints from \"./add-subgraph-constraints\";\nimport {Graph} from \"../graph-lib\";\nimport * as util from \"../util\";\nimport type {Graph as GraphType, OrderConstraint} from '../types';\n\ninterface OrderOptions {\n    customOrder?: (graph: GraphType, order: (g: GraphType, opts: OrderOptions) => void) => void;\n    disableOptimalOrderHeuristic?: boolean;\n    constraints?: OrderConstraint[];\n}\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nexport default function order(graph: GraphType, opts: OrderOptions = {}): void {\n    if (typeof opts.customOrder === 'function') {\n        opts.customOrder(graph, order);\n        return;\n    }\n\n    const maxRank = util.maxRank(graph);\n    const downLayerGraphs = buildLayerGraphs(graph, util.range(1, maxRank + 1), \"inEdges\");\n    const upLayerGraphs = buildLayerGraphs(graph, util.range(maxRank - 1, -1, -1), \"outEdges\");\n\n    let layering = initOrder(graph);\n    assignOrder(graph, layering);\n\n    if (opts.disableOptimalOrderHeuristic) {\n        return;\n    }\n\n    let bestCC = Number.POSITIVE_INFINITY;\n    let best: string[][];\n\n    const constraints = opts.constraints || [];\n    for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n        sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2, constraints);\n\n        layering = util.buildLayerMatrix(graph);\n        const cc = crossCount(graph, layering);\n        if (cc < bestCC) {\n            lastBest = 0;\n            best = Object.assign({}, layering);\n            bestCC = cc;\n        } else if (cc === bestCC) {\n            best = structuredClone(layering);\n        }\n    }\n\n    assignOrder(graph, best!);\n}\n\nfunction buildLayerGraphs(graph: GraphType, ranks: number[], relationship: \"inEdges\" | \"outEdges\"): GraphType[] {\n    // Build an index mapping from rank to the nodes with that rank.\n    // This helps to avoid a quadratic search for all nodes with the same rank as\n    // the current node.\n    const nodesByRank = new Map<number, string[]>();\n    const addNodeToRank = (rank: number, node: string): void => {\n        if (!nodesByRank.has(rank)) {\n            nodesByRank.set(rank, []);\n        }\n        nodesByRank.get(rank)!.push(node);\n    };\n\n    // Visit the nodes in their original order in the graph, and add each\n    // node to the ranks(s) that it belongs to.\n    for (const v of graph.nodes()) {\n        const node = graph.node(v);\n        if (typeof node.rank === \"number\") {\n            addNodeToRank(node.rank, v);\n        }\n        // If there is a range of ranks, add it to each, but skip the `node.rank` which\n        // has already had the node added.\n        if (typeof node.minRank === \"number\" && typeof node.maxRank === \"number\") {\n            for (let r = node.minRank; r <= node.maxRank; r++) {\n                if (r !== node.rank) {\n                    // Don't add this node to its `node.rank` twice.\n                    addNodeToRank(r, v);\n                }\n            }\n        }\n    }\n\n    return ranks.map(function (rank) {\n        return buildLayerGraph(graph, rank, relationship, nodesByRank.get(rank) || []);\n    });\n}\n\nfunction sweepLayerGraphs(layerGraphs: GraphType[], biasRight: boolean, constraints: OrderConstraint[]): void {\n    const cg = new Graph() as GraphType;\n    layerGraphs.forEach(function (lg) {\n        constraints.forEach(con => cg.setEdge(con.left, con.right));\n\n        const root = (lg.graph() as { root: string }).root;\n        const sorted = sortSubgraph(lg, root, cg, biasRight);\n        sorted.vs.forEach((v, i) => lg.node(v).order = i);\n        addSubgraphConstraints(lg, cg, sorted.vs);\n    });\n}\n\nfunction assignOrder(graph: GraphType, layering: string[][]): void {\n    Object.values(layering).forEach(layer => layer.forEach((v, i) => graph.node(v).order = i));\n}\n", "import {Graph} from \"../graph-lib\";\nimport * as util from \"../util\";\nimport type {EdgeLabel, GraphLabel, NodeLabel} from \"../types\";\n\n/*\n * This module provides coordinate assignment based on Brandes and K\u00F6pf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nexport {\n    positionX,\n    findType1Conflicts,\n    findType2Conflicts,\n    addConflict,\n    hasConflict,\n    verticalAlignment,\n    horizontalCompaction,\n    alignCoordinates,\n    findSmallestWidthAlignment,\n    balance\n};\n\ntype Conflicts = { [key: string]: { [key: string]: boolean } };\ntype PositionMap = { [key: string]: number };\ntype AlignmentResult = { root: { [key: string]: string }, align: { [key: string]: string } };\ntype XssMap = { [key: string]: PositionMap };\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, layering: string[][]): Conflicts {\n    const conflicts: Conflicts = {};\n\n    function visitLayer(prevLayer: string[], layer: string[]): string[] {\n        let\n            // last visited node in the previous layer that is incident on an inner\n            // segment.\n            k0 = 0,\n            // Tracks the last node in this layer scanned for crossings with a type-1\n            // segment.\n            scanPos = 0;\n        const prevLayerLength = prevLayer.length,\n            lastNode = layer[layer.length - 1];\n\n        layer.forEach((v, i) => {\n            const w: string | undefined = findOtherInnerSegmentNode(graph, v);\n            const k1: number = w ? graph.node(w).order! : prevLayerLength;\n\n            if (w || v === lastNode) {\n                layer.slice(scanPos, i + 1).forEach(scanNode => {\n                    const preds = graph.predecessors(scanNode);\n                    if (preds) {\n                        preds.forEach(u => {\n                            const uLabel = graph.node(u) as NodeLabel;\n                            const uPos: number = uLabel.order!;\n                            if ((uPos < k0 || k1 < uPos) &&\n                                !(uLabel.dummy && (graph.node(scanNode) as NodeLabel).dummy)) {\n                                addConflict(conflicts, u, scanNode);\n                            }\n                        });\n                    }\n                });\n                scanPos = i + 1;\n                k0 = k1;\n            }\n        });\n\n        return layer;\n    }\n\n    if (layering.length) {\n        layering.reduce(visitLayer);\n    }\n\n    return conflicts;\n}\n\nfunction findType2Conflicts(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, layering: string[][]): Conflicts {\n    const conflicts: Conflicts = {};\n\n    function scan(south: string[], southPos: number, southEnd: number, prevNorthBorder: number, nextNorthBorder: number): void {\n        util.range(southPos, southEnd).forEach(i => {\n            const v = south[i];\n            if (v === undefined) return;\n            if ((graph.node(v) as NodeLabel).dummy) {\n                const preds = graph.predecessors(v);\n                if (preds) {\n                    preds.forEach(u => {\n                        if (u === undefined) return;\n                        const uNode = graph.node(u) as NodeLabel;\n                        if (uNode.dummy &&\n                            (uNode.order! < prevNorthBorder || uNode.order! > nextNorthBorder)) {\n                            addConflict(conflicts, u, v);\n                        }\n                    });\n                }\n            }\n        });\n    }\n\n\n    function visitLayer(north: string[], south: string[]): string[] {\n        let prevNorthPos = -1;\n        let nextNorthPos = -1;\n        let southPos = 0;\n\n        south.forEach((v, southLookahead) => {\n            if ((graph.node(v) as NodeLabel).dummy === \"border\") {\n                const predecessors = graph.predecessors(v);\n                if (predecessors && predecessors.length) {\n                    const firstPred = predecessors[0];\n                    if (firstPred === undefined) return;\n                    nextNorthPos = (graph.node(firstPred) as NodeLabel).order!;\n                    scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n                    southPos = southLookahead;\n                    prevNorthPos = nextNorthPos;\n                }\n            }\n            scan(south, southPos, south.length, nextNorthPos, north.length);\n        });\n\n        return south;\n    }\n\n    if (layering.length) {\n        layering.reduce(visitLayer);\n    }\n\n    return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, v: string): string | undefined {\n    if ((graph.node(v) as NodeLabel).dummy) {\n        const preds = graph.predecessors(v);\n        if (preds) {\n            return preds.find(u => (graph.node(u) as NodeLabel).dummy);\n        }\n    }\n    return undefined;\n}\n\nfunction addConflict(conflicts: Conflicts, v: string, w: string): void {\n    if (v > w) {\n        const tmp = v;\n        v = w;\n        w = tmp;\n    }\n\n    let conflictsV = conflicts[v];\n    if (!conflictsV) {\n        conflicts[v] = conflictsV = {};\n    }\n    conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts: Conflicts, v: string, w: string): boolean {\n    if (v > w) {\n        const tmp = v;\n        v = w;\n        w = tmp;\n    }\n    const conflictsV = conflicts[v];\n    return conflictsV !== undefined && Object.hasOwn(conflictsV, w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(\n    graph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    layering: string[][],\n    conflicts: Conflicts,\n    neighborFn: (v: string) => string[]\n): AlignmentResult {\n    const root: { [key: string]: string } = {};\n    const align: { [key: string]: string } = {};\n    const pos: PositionMap = {};\n\n    // We cache the position here based on the layering because the graph and\n    // layering may be out of sync. The layering matrix is manipulated to\n    // generate different extreme alignments.\n    layering.forEach(layer => {\n        layer.forEach((v, order) => {\n            root[v] = v;\n            align[v] = v;\n            pos[v] = order;\n        });\n    });\n\n    layering.forEach(layer => {\n        let prevIdx = -1;\n        layer.forEach(v => {\n            const wsRaw = neighborFn(v);\n            if (wsRaw && wsRaw.length) {\n                const ws: string[] = wsRaw.sort((a, b) => {\n                    const posA = pos[a];\n                    const posB = pos[b];\n                    return (posA !== undefined ? posA : 0) - (posB !== undefined ? posB : 0);\n                });\n                const mp: number = (ws.length - 1) / 2;\n                for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n                    const w: string | undefined = ws[i];\n                    if (w === undefined) continue;\n                    const posW = pos[w];\n                    if (posW !== undefined && align[v] === v &&\n                        prevIdx < posW &&\n                        !hasConflict(conflicts, v, w)) {\n                        const rootW = root[w];\n                        if (rootW !== undefined) {\n                            align[w] = v;\n                            align[v] = root[v] = rootW;\n                            prevIdx = posW;\n                        }\n                    }\n                }\n            }\n        });\n    });\n\n    return {root: root, align: align};\n}\n\nfunction horizontalCompaction(\n    graph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    layering: string[][],\n    root: { [key: string]: string },\n    align: { [key: string]: string },\n    reverseSep: boolean = false\n): PositionMap {\n    // This portion of the algorithm differs from BK due to a number of problems.\n    // Instead of their algorithm we construct a new block graph and do two\n    // sweeps. The first sweep places blocks with the smallest possible\n    // coordinates. The second sweep removes unused space by moving blocks to the\n    // greatest coordinates without violating separation.\n    const xs: PositionMap = {};\n    const blockG: Graph<NodeLabel, EdgeLabel, number> = buildBlockGraph(graph, layering, root, reverseSep);\n    const borderType: string = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n    function iterate(setXsFunc: (elem: string) => void, nextNodesFunc: (elem: string) => string[]): void {\n        const stack: string[] = blockG.nodes().slice(); // Create a copy of the node list.\n        const visited: { [key: string]: boolean } = {};\n        let elem: string | undefined = stack.pop();\n\n        while (elem) {\n            if (visited[elem]) {\n                setXsFunc(elem);\n            } else {\n                visited[elem] = true;\n                // Put the element back into the stack, so that we can process it\n                // again after all of the `nextNodesFunc` items are processed.\n                stack.push(elem);\n                for (const nextElem of nextNodesFunc(elem)) {\n                    stack.push(nextElem);\n                }\n            }\n\n            elem = stack.pop();\n        }\n    }\n\n    // First pass, assign smallest coordinates\n    function pass1(elem: string): void {\n        const inEdges = blockG.inEdges(elem);\n        if (inEdges) {\n            xs[elem] = inEdges.reduce((acc, e) => {\n                const xsV = xs[e.v] ?? 0;\n                const edgeWeight = blockG.edge(e);\n                return Math.max(acc, xsV + (edgeWeight !== undefined ? edgeWeight : 0));\n            }, 0);\n        } else {\n            xs[elem] = 0;\n        }\n    }\n\n    // Second pass, assign greatest coordinates\n    function pass2(elem: string): void {\n        const outEdges = blockG.outEdges(elem);\n        let min = Number.POSITIVE_INFINITY;\n        if (outEdges) {\n            min = outEdges.reduce((acc, e) => {\n                const xsW = xs[e.w];\n                const edgeWeight = blockG.edge(e);\n                return Math.min(acc, (xsW !== undefined ? xsW : 0) - (edgeWeight !== undefined ? edgeWeight : 0));\n            }, Number.POSITIVE_INFINITY);\n        }\n\n        const node = graph.node(elem) as NodeLabel;\n        if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n            xs[elem] = Math.max(xs[elem] !== undefined ? xs[elem] : 0, min);\n        }\n    }\n\n    function predecessorsWrapper(elem: string): string[] {\n        return blockG.predecessors(elem) || [];\n    }\n\n    function successorsWrapper(elem: string): string[] {\n        return blockG.successors(elem) || [];\n    }\n\n    iterate(pass1, predecessorsWrapper);\n    iterate(pass2, successorsWrapper);\n\n    // Assign x coordinates to all nodes\n    Object.keys(align).forEach(v => {\n        const rootV = root[v];\n        if (rootV !== undefined) {\n            xs[v] = xs[rootV] ?? 0;\n        }\n    });\n\n    return xs;\n}\n\n\nfunction buildBlockGraph(\n    graph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    layering: string[][],\n    root: { [key: string]: string },\n    reverseSep: boolean\n): Graph<NodeLabel, EdgeLabel, number> {\n    const blockGraph = new Graph<NodeLabel, EdgeLabel, number>();\n    const graphLabel: GraphLabel = graph.graph();\n    const sepFn: (g: Graph<GraphLabel, NodeLabel, EdgeLabel>, v: string, u: string) => number = sep(graphLabel.nodesep!, graphLabel.edgesep!, reverseSep);\n\n    layering.forEach(layer => {\n        let u: string | undefined;\n        layer.forEach(v => {\n            const vRoot = root[v];\n            if (vRoot !== undefined) {\n                blockGraph.setNode(vRoot);\n                if (u !== undefined) {\n                    const uRoot = root[u];\n                    if (uRoot !== undefined) {\n                        const prevMax: number | undefined = blockGraph.edge(uRoot, vRoot);\n                        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(graph, v, u), prevMax || 0));\n                    }\n                }\n                u = v;\n            }\n        });\n    });\n\n    return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, xss: XssMap): PositionMap {\n    return Object.values(xss).reduce((currentMinAndXs: [number, PositionMap | null], xs: PositionMap) => {\n        let max = Number.NEGATIVE_INFINITY;\n        let min = Number.POSITIVE_INFINITY;\n\n        Object.entries(xs).forEach(([v, x]) => {\n            const halfWidth: number = width(graph, v) / 2;\n\n            max = Math.max(x + halfWidth, max);\n            min = Math.min(x - halfWidth, min);\n        });\n\n        const newMin: number = max - min;\n        if (newMin < currentMinAndXs[0]) {\n            currentMinAndXs = [newMin, xs];\n        }\n        return currentMinAndXs;\n    }, [Number.POSITIVE_INFINITY, null])[1]!;\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss: XssMap, alignTo: PositionMap): void {\n    const alignToVals: number[] = Object.values(alignTo);\n    const alignToMin: number = util.applyWithChunking(Math.min, alignToVals);\n    const alignToMax: number = util.applyWithChunking(Math.max, alignToVals);\n\n    [\"u\", \"d\"].forEach(vert => {\n        [\"l\", \"r\"].forEach(horiz => {\n            const alignment: string = vert + horiz;\n            const xs: PositionMap | undefined = xss[alignment];\n\n            if (!xs || xs === alignTo) return;\n\n            const xsVals: number[] = Object.values(xs);\n            let delta: number = alignToMin - util.applyWithChunking(Math.min, xsVals);\n            if (horiz !== \"l\") {\n                delta = alignToMax - util.applyWithChunking(Math.max, xsVals);\n            }\n\n            if (delta) {\n                xss[alignment] = util.mapValues(xs, x => x + delta);\n            }\n        });\n    });\n}\n\nfunction balance(xss: XssMap, align: string | undefined = undefined): PositionMap {\n    const ulMap = xss.ul;\n    if (!ulMap) {\n        return {};\n    }\n    return util.mapValues(ulMap, (num: number, v: string) => {\n        if (align) {\n            const alignmentKey = align.toLowerCase();\n            const alignment = xss[alignmentKey];\n            if (alignment && alignment[v] !== undefined) {\n                return alignment[v];\n            }\n        }\n        const xs: number[] = Object.values(xss).map(xs => {\n            const val = xs[v];\n            return val !== undefined ? val : 0;\n        }).sort((a, b) => a - b);\n        return ((xs[1] ?? 0) + (xs[2] ?? 0)) / 2;\n    });\n}\n\nfunction positionX(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): PositionMap {\n    const layering: string[][] = util.buildLayerMatrix(graph);\n    const conflicts: Conflicts = Object.assign(\n        findType1Conflicts(graph, layering),\n        findType2Conflicts(graph, layering));\n\n    const xss: XssMap = {};\n    let adjustedLayering: string[][];\n    [\"u\", \"d\"].forEach(vert => {\n        adjustedLayering = vert === \"u\" ? layering : Object.values(layering).reverse();\n        [\"l\", \"r\"].forEach(horiz => {\n            if (horiz === \"r\") {\n                adjustedLayering = adjustedLayering.map(inner => {\n                    return Object.values(inner).reverse();\n                });\n            }\n\n            const neighborFn = (v: string): string[] => {\n                const result = vert === \"u\" ? graph.predecessors(v) : graph.successors(v);\n                return result || [];\n            };\n            const align: AlignmentResult = verticalAlignment(graph, adjustedLayering, conflicts, neighborFn);\n            let xs: PositionMap = horizontalCompaction(graph, adjustedLayering,\n                align.root, align.align, horiz === \"r\");\n            if (horiz === \"r\") {\n                xs = util.mapValues(xs, x => -x);\n            }\n            xss[vert + horiz] = xs;\n        });\n    });\n\n\n    const smallestWidth: PositionMap = findSmallestWidthAlignment(graph, xss);\n    alignCoordinates(xss, smallestWidth);\n    return balance(xss, graph.graph().align);\n}\n\nfunction sep(nodeSep: number, edgeSep: number, reverseSep: boolean): (g: Graph<GraphLabel, NodeLabel, EdgeLabel>, v: string, w: string) => number {\n    return (g: Graph<GraphLabel, NodeLabel, EdgeLabel>, v: string, w: string): number => {\n        const vLabel = g.node(v) as NodeLabel;\n        const wLabel = g.node(w) as NodeLabel;\n        let sum = 0;\n        let delta: number | undefined;\n\n        sum += vLabel.width / 2;\n        if (Object.hasOwn(vLabel, \"labelpos\")) {\n            switch ((vLabel.labelpos as string).toLowerCase()) {\n            case \"l\":\n                delta = -vLabel.width / 2;\n                break;\n            case \"r\":\n                delta = vLabel.width / 2;\n                break;\n            }\n        }\n        if (delta) {\n            sum += reverseSep ? delta : -delta;\n        }\n        delta = undefined;\n\n        sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n        sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n        sum += wLabel.width / 2;\n        if (Object.hasOwn(wLabel, \"labelpos\")) {\n            switch ((wLabel.labelpos as string).toLowerCase()) {\n            case \"l\":\n                delta = wLabel.width / 2;\n                break;\n            case \"r\":\n                delta = -wLabel.width / 2;\n                break;\n            }\n        }\n        if (delta) {\n            sum += reverseSep ? delta : -delta;\n        }\n\n        return sum;\n    };\n}\n\nfunction width(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>, v: string): number {\n    return (graph.node(v) as NodeLabel).width;\n}\n", "import * as util from \"../util\";\nimport {positionX} from \"./bk\";\nimport type {Graph} from '@dagrejs/graphlib';\nimport type {EdgeLabel, GraphLabel, NodeLabel} from \"../types\";\n\nexport {position};\n\nfunction position(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    graph = util.asNonCompoundGraph(graph);\n\n    positionY(graph);\n    Object.entries(positionX(graph)).forEach(([v, x]) => graph.node(v).x = x);\n}\n\nfunction positionY(graph: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const layering: string[][] = util.buildLayerMatrix(graph);\n    const graphLabel = graph.graph();\n    const rankSep: number = graphLabel.ranksep!;\n    const rankAlign: string | undefined = graphLabel.rankalign;\n    let prevY = 0;\n    layering.forEach(layer => {\n        const maxHeight: number = layer.reduce((acc: number, v: string) => {\n            const height: number = graph.node(v).height ?? 0;\n            if (acc > height) {\n                return acc;\n            } else {\n                return height;\n            }\n        }, 0);\n        layer.forEach(v => {\n            const node = graph.node(v) as NodeLabel;\n            if (rankAlign === \"top\") {\n                node.y = prevY + node.height / 2;\n            } else if (rankAlign === \"bottom\") {\n                node.y = prevY + maxHeight - node.height / 2;\n            } else {\n                node.y = prevY + maxHeight / 2;\n            }\n        });\n        prevY += maxHeight + rankSep;\n    });\n}\n", "import * as acyclic from \"./acyclic\";\nimport * as normalize from \"./normalize\";\nimport rank from \"./rank\";\nimport * as util from \"./util\";\nimport {normalizeRanks, removeEmptyRanks} from \"./util\";\nimport parentDummyChains from \"./parent-dummy-chains\";\nimport * as nestingGraph from \"./nesting-graph\";\nimport addBorderSegments from \"./add-border-segments\";\nimport * as coordinateSystem from \"./coordinate-system\";\nimport order from \"./order\";\nimport {position} from \"./position\";\nimport {Graph} from \"./graph-lib\";\nimport type {Edge, EdgeLabel, GraphLabel, LayoutOptions, NodeLabel, Point} from \"./types\";\n\ninterface SelfEdge {\n    e: Edge;\n    label: EdgeLabel;\n}\n\ninterface ExtendedNodeLabel extends NodeLabel {\n    selfEdges?: SelfEdge[];\n}\n\ninterface SelfEdgeNodeLabel extends Omit<NodeLabel, 'e' | 'label'> {\n    e: Edge;\n    label: EdgeLabel;\n}\n\ninterface EdgeProxyNodeLabel extends Omit<NodeLabel, 'e'> {\n    e: Edge;\n}\n\nexport function layout(g: Graph<GraphLabel, NodeLabel, EdgeLabel>, opts: LayoutOptions = {}): Graph<GraphLabel, NodeLabel, EdgeLabel> {\n    const time = opts.debugTiming ? util.time : util.notime;\n    return time(\"layout\", () => {\n        const layoutGraph =\n            time(\"  buildLayoutGraph\", () => buildLayoutGraph(g));\n        time(\"  runLayout\", () => runLayout(layoutGraph, time, opts));\n        time(\"  updateInputGraph\", () => updateInputGraph(g, layoutGraph));\n        return layoutGraph;\n    });\n}\n\nfunction runLayout(\n    g: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    time: <T>(name: string, fn: () => T) => T,\n    opts: LayoutOptions\n): void {\n    time(\"    makeSpaceForEdgeLabels\", () => makeSpaceForEdgeLabels(g));\n    time(\"    removeSelfEdges\", () => removeSelfEdges(g));\n    time(\"    acyclic\", () => acyclic.run(g));\n    time(\"    nestingGraph.run\", () => nestingGraph.run(g));\n    time(\"    rank\", () => rank(util.asNonCompoundGraph(g)));\n    time(\"    injectEdgeLabelProxies\", () => injectEdgeLabelProxies(g));\n    time(\"    removeEmptyRanks\", () => removeEmptyRanks(g));\n    time(\"    nestingGraph.cleanup\", () => nestingGraph.cleanup(g));\n    time(\"    normalizeRanks\", () => normalizeRanks(g));\n    time(\"    assignRankMinMax\", () => assignRankMinMax(g));\n    time(\"    removeEdgeLabelProxies\", () => removeEdgeLabelProxies(g));\n    time(\"    normalize.run\", () => normalize.run(g));\n    time(\"    parentDummyChains\", () => parentDummyChains(g));\n    time(\"    addBorderSegments\", () => addBorderSegments(g));\n    time(\"    order\", () => order(g, opts));\n    time(\"    insertSelfEdges\", () => insertSelfEdges(g));\n    time(\"    adjustCoordinateSystem\", () => coordinateSystem.adjust(g));\n    time(\"    position\", () => position(g));\n    time(\"    positionSelfEdges\", () => positionSelfEdges(g));\n    time(\"    removeBorderNodes\", () => removeBorderNodes(g));\n    time(\"    normalize.undo\", () => normalize.undo(g));\n    time(\"    fixupEdgeLabelCoords\", () => fixupEdgeLabelCoords(g));\n    time(\"    undoCoordinateSystem\", () => coordinateSystem.undo(g));\n    time(\"    translateGraph\", () => translateGraph(g));\n    time(\"    assignNodeIntersects\", () => assignNodeIntersects(g));\n    time(\"    reversePoints\", () => reversePointsForReversedEdges(g));\n    time(\"    acyclic.undo\", () => acyclic.undo(g));\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(\n    inputGraph: Graph<GraphLabel, NodeLabel, EdgeLabel>,\n    layoutGraph: Graph<GraphLabel, NodeLabel, EdgeLabel>\n): void {\n    inputGraph.nodes().forEach(v => {\n        const inputLabel = inputGraph.node(v);\n        const layoutLabel = layoutGraph.node(v);\n\n        if (inputLabel) {\n            inputLabel.x = layoutLabel.x;\n            inputLabel.y = layoutLabel.y;\n            inputLabel.order = layoutLabel.order;\n            inputLabel.rank = layoutLabel.rank;\n\n            if (layoutGraph.children(v).length) {\n                inputLabel.width = layoutLabel.width;\n                inputLabel.height = layoutLabel.height;\n            }\n        }\n    });\n\n    inputGraph.edges().forEach(e => {\n        const inputLabel = inputGraph.edge(e);\n        const layoutLabel = layoutGraph.edge(e);\n\n        inputLabel.points = layoutLabel.points;\n        if (Object.hasOwn(layoutLabel, \"x\")) {\n            inputLabel.x = layoutLabel.x;\n            inputLabel.y = layoutLabel.y;\n        }\n    });\n\n    inputGraph.graph().width = layoutGraph.graph().width;\n    inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nconst graphNumAttrs: string[] = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nconst graphDefaults: Partial<GraphLabel> = {ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"TB\", rankalign: \"center\"};\nconst graphAttrs: string[] = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\", \"rankalign\"];\nconst nodeNumAttrs: string[] = [\"width\", \"height\", \"rank\"];\nconst nodeDefaults: Partial<NodeLabel> = {width: 0, height: 0};\nconst edgeNumAttrs: string[] = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nconst edgeDefaults: Partial<EdgeLabel> = {\n    minlen: 1, weight: 1, width: 0, height: 0,\n    labeloffset: 10, labelpos: \"r\"\n};\nconst edgeAttrs: string[] = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph: Graph<GraphLabel, NodeLabel, EdgeLabel>): Graph<GraphLabel, NodeLabel, EdgeLabel> {\n    const g = new Graph<GraphLabel, NodeLabel, EdgeLabel>({multigraph: true, compound: true});\n    const graph = canonicalize(inputGraph.graph());\n\n    g.setGraph(Object.assign({},\n        graphDefaults,\n        selectNumberAttrs(graph, graphNumAttrs),\n        util.pick(graph, graphAttrs)));\n\n    inputGraph.nodes().forEach(v => {\n        const node = canonicalize(inputGraph.node(v));\n        const newNode = selectNumberAttrs(node, nodeNumAttrs) as NodeLabel;\n        Object.keys(nodeDefaults).forEach(k => {\n            if (newNode[k] === undefined) {\n                newNode[k] = (nodeDefaults)[k];\n            }\n        });\n\n        g.setNode(v, newNode);\n        const parent = inputGraph.parent(v);\n        if (parent !== undefined) {\n            g.setParent(v, parent);\n        }\n    });\n\n    inputGraph.edges().forEach(e => {\n        const edge = canonicalize(inputGraph.edge(e));\n        g.setEdge(e, Object.assign({},\n            edgeDefaults,\n            selectNumberAttrs(edge, edgeNumAttrs),\n            util.pick(edge, edgeAttrs)));\n    });\n\n    return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const graph = g.graph();\n    graph.ranksep! /= 2;\n    g.edges().forEach(e => {\n        const edge = g.edge(e);\n        edge.minlen! *= 2;\n        if (edge.labelpos!.toLowerCase() !== \"c\") {\n            if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n                edge.width! += edge.labeloffset!;\n            } else {\n                edge.height! += edge.labeloffset!;\n            }\n        }\n    });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    g.edges().forEach(e => {\n        const edge = g.edge(e);\n        if (edge.width && edge.height) {\n            const v = g.node(e.v);\n            const w = g.node(e.w);\n            const label: Partial<NodeLabel> = {rank: (w.rank! - v.rank!) / 2 + v.rank!, e: e as unknown as number};\n            util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n        }\n    });\n}\n\nfunction assignRankMinMax(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    let maxRank = 0;\n    g.nodes().forEach(v => {\n        const node = g.node(v);\n        if (node.borderTop) {\n            node.minRank = g.node(node.borderTop).rank;\n            node.maxRank = g.node(node.borderBottom!).rank;\n            maxRank = Math.max(maxRank, node.maxRank!);\n        }\n    });\n    g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    g.nodes().forEach(v => {\n        const node = g.node(v);\n        if (node.dummy === \"edge-proxy\") {\n            const proxyNode = node as unknown as EdgeProxyNodeLabel;\n            g.edge(proxyNode.e).labelRank = node.rank;\n            g.removeNode(v);\n        }\n    });\n}\n\nfunction translateGraph(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    let minX = Number.POSITIVE_INFINITY;\n    let maxX = 0;\n    let minY = Number.POSITIVE_INFINITY;\n    let maxY = 0;\n    const graphLabel = g.graph();\n    const marginX = graphLabel.marginx || 0;\n    const marginY = graphLabel.marginy || 0;\n\n    function getExtremes(attrs: NodeLabel | EdgeLabel): void {\n        const x = attrs.x!;\n        const y = attrs.y!;\n        const w = attrs.width!;\n        const h = attrs.height!;\n        minX = Math.min(minX, x - w / 2);\n        maxX = Math.max(maxX, x + w / 2);\n        minY = Math.min(minY, y - h / 2);\n        maxY = Math.max(maxY, y + h / 2);\n    }\n\n    g.nodes().forEach(v => getExtremes(g.node(v)));\n    g.edges().forEach(e => {\n        const edge = g.edge(e);\n        if (Object.hasOwn(edge, \"x\")) {\n            getExtremes(edge);\n        }\n    });\n\n    minX -= marginX;\n    minY -= marginY;\n\n    g.nodes().forEach(v => {\n        const node = g.node(v);\n        node.x! -= minX;\n        node.y! -= minY;\n    });\n\n    g.edges().forEach(e => {\n        const edge = g.edge(e);\n        edge.points!.forEach(p => {\n            p.x -= minX;\n            p.y -= minY;\n        });\n        if (Object.hasOwn(edge, \"x\")) {\n            edge.x! -= minX;\n        }\n        if (Object.hasOwn(edge, \"y\")) {\n            edge.y! -= minY;\n        }\n    });\n\n    graphLabel.width = maxX - minX + marginX;\n    graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    g.edges().forEach(e => {\n        const edge = g.edge(e);\n        const nodeV = g.node(e.v);\n        const nodeW = g.node(e.w);\n        let p1: Point, p2: Point;\n        if (!edge.points) {\n            edge.points = [];\n            p1 = nodeW as Point;\n            p2 = nodeV as Point;\n        } else {\n            p1 = edge.points[0]!;\n            p2 = edge.points[edge.points.length - 1]!;\n        }\n        edge.points.unshift(util.intersectRect(nodeV, p1));\n        edge.points.push(util.intersectRect(nodeW, p2));\n    });\n}\n\nfunction fixupEdgeLabelCoords(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    g.edges().forEach(e => {\n        const edge = g.edge(e);\n        if (Object.hasOwn(edge, \"x\")) {\n            if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n                edge.width! -= edge.labeloffset!;\n            }\n            switch (edge.labelpos) {\n            case \"l\":\n                    edge.x! -= edge.width! / 2 + edge.labeloffset!;\n                break;\n            case \"r\":\n                    edge.x! += edge.width! / 2 + edge.labeloffset!;\n                break;\n            }\n        }\n    });\n}\n\nfunction reversePointsForReversedEdges(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    g.edges().forEach(e => {\n        const edge = g.edge(e);\n        if (edge.reversed) {\n            edge.points!.reverse();\n        }\n    });\n}\n\nfunction removeBorderNodes(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    g.nodes().forEach(v => {\n        if (g.children(v).length) {\n            const node = g.node(v);\n            const t = g.node(node.borderTop!);\n            const b = g.node(node.borderBottom!);\n            const l = g.node(node.borderLeft![node.borderLeft!.length - 1]!);\n            const r = g.node(node.borderRight![node.borderRight!.length - 1]!);\n\n            node.width = Math.abs(r.x! - l.x!);\n            node.height = Math.abs(b.y! - t.y!);\n            node.x = l.x! + node.width / 2;\n            node.y = t.y! + node.height / 2;\n        }\n    });\n\n    g.nodes().forEach(v => {\n        if (g.node(v).dummy === \"border\") {\n            g.removeNode(v);\n        }\n    });\n}\n\nfunction removeSelfEdges(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    g.edges().forEach(e => {\n        if (e.v === e.w) {\n            const node = g.node(e.v) as ExtendedNodeLabel;\n            if (!node.selfEdges) {\n                node.selfEdges = [];\n            }\n            node.selfEdges.push({e: e, label: g.edge(e)});\n            g.removeEdge(e);\n        }\n    });\n}\n\nfunction insertSelfEdges(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    const layers = util.buildLayerMatrix(g);\n    layers.forEach(layer => {\n        let orderShift = 0;\n        layer.forEach((v, i) => {\n            const node = g.node(v) as ExtendedNodeLabel;\n            node.order = i + orderShift;\n            (node.selfEdges || []).forEach(selfEdge => {\n                util.addDummyNode(g, \"selfedge\", {\n                    width: selfEdge.label.width!,\n                    height: selfEdge.label.height!,\n                    rank: node.rank,\n                    order: i + (++orderShift),\n                    e: selfEdge.e as unknown as number,\n                    label: selfEdge.label as unknown as string\n                }, \"_se\");\n            });\n            delete node.selfEdges;\n        });\n    });\n}\n\nfunction positionSelfEdges(g: Graph<GraphLabel, NodeLabel, EdgeLabel>): void {\n    g.nodes().forEach(v => {\n        const node = g.node(v);\n        if (node.dummy === \"selfedge\") {\n            const selfEdgeNode = node as unknown as SelfEdgeNodeLabel;\n            const selfNode = g.node(selfEdgeNode.e.v);\n            const x = selfNode.x! + selfNode.width / 2;\n            const y = selfNode.y!;\n            const dx = node.x! - x;\n            const dy = selfNode.height / 2;\n            g.setEdge(selfEdgeNode.e, selfEdgeNode.label);\n            g.removeNode(v);\n            selfEdgeNode.label.points = [\n                {x: x + 2 * dx / 3, y: y - dy},\n                {x: x + 5 * dx / 6, y: y - dy},\n                {x: x + dx, y: y},\n                {x: x + 5 * dx / 6, y: y + dy},\n                {x: x + 2 * dx / 3, y: y + dy}\n            ];\n            selfEdgeNode.label.x = node.x;\n            selfEdgeNode.label.y = node.y;\n        }\n    });\n}\n\nfunction selectNumberAttrs(obj: Record<string, unknown>, attrs: string[]): unknown {\n    return util.mapValues(util.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs: Record<string, unknown>): Record<string, unknown> {\n    const newAttrs: Record<string, unknown> = {};\n    if (attrs) {\n        Object.entries(attrs).forEach(([k, v]) => {\n            if (typeof k === \"string\") {\n                k = k.toLowerCase();\n            }\n\n            newAttrs[k] = v;\n        });\n    }\n    return newAttrs;\n}\n", "import * as util from './util';\nimport {Graph} from \"./graph-lib\";\nimport type {NodeLabel} from './types';\n\nexport function debugOrdering(graph: Graph): Graph {\n    const layerMatrix = util.buildLayerMatrix(graph);\n\n    const h = new Graph({compound: true, multigraph: true}).setGraph({});\n\n    graph.nodes().forEach(node => {\n        h.setNode(node, {label: node});\n        h.setParent(node, 'layer' + (graph.node(node) as NodeLabel).rank);\n    });\n\n    graph.edges().forEach(edge => h.setEdge(edge.v, edge.w, {}, edge.name));\n\n    layerMatrix.forEach((layer, i) => {\n        const layerV = 'layer' + i;\n        h.setNode(layerV, {rank: 'same'});\n        layer.reduce((u, v) => {\n            h.setEdge(u, v, {style: 'invis'});\n            return v;\n        });\n    });\n\n    return h;\n}\n"],
+  "mappings": "8kBAAA,IAAAA,GAAA,GAAAC,GAAAD,GAAA,uBAAAE,EAAA,YAAAC,GAAA,aAAAC,EAAA,WAAAC,EAAA,SAAAC,GAAA,YAAAC,+JCgBaC,EAAN,KAAgE,CA4BnE,YAAYC,EAAqB,CA3BjC,KAAQ,YAAuB,GAC/B,KAAQ,cAAyB,GACjC,KAAQ,YAAuB,GAK/B,KAAQ,OAAoC,CAAC,EAE7C,KAAQ,IAA4C,CAAC,EAErD,KAAQ,OAAiD,CAAC,EAE1D,KAAQ,KAA6C,CAAC,EAEtD,KAAQ,MAAgD,CAAC,EAEzD,KAAQ,UAAkC,CAAC,EAE3C,KAAQ,YAAyC,CAAC,EAElD,KAAQ,WAAqB,EAE7B,KAAQ,WAAqB,EAgvB7B,KAAQ,oBAAmD,IAAG,CAAA,EAG9D,KAAQ,oBAAmD,IAAG,CAAA,EA9uBtDA,IACA,KAAK,YAAc,aAAcA,EAAOA,EAAK,SAAY,GACzD,KAAK,cAAgB,eAAgBA,EAAOA,EAAK,WAAc,GAC/D,KAAK,YAAc,aAAcA,EAAOA,EAAK,SAAY,IAGzD,KAAK,cAEL,KAAK,QAAU,CAAC,EAGhB,KAAK,UAAY,CAAC,EAClB,KAAK,UAAU,IAAU,EAAI,CAAC,EAEtC,CAOA,YAAsB,CAClB,OAAO,KAAK,WAChB,CAOA,cAAwB,CACpB,OAAO,KAAK,aAChB,CASA,YAAsB,CAClB,OAAO,KAAK,WAChB,CAQA,SAASC,EAAyB,CAC9B,OAAA,KAAK,OAASA,EACP,IACX,CAOA,OAAoB,CAEhB,OAAO,KAAK,MAChB,CAUA,oBAAoBC,EAA0D,CAC1E,OAAI,OAAOA,GAAc,WACrB,KAAK,oBAAsB,IAAMA,EAEjC,KAAK,oBAAsBA,EAGxB,IACX,CAQA,WAAoB,CAChB,OAAO,KAAK,UAChB,CAYA,OAAkB,CACd,OAAO,OAAO,KAAK,KAAK,MAAM,CAClC,CAQA,SAAoB,CAChB,OAAO,KAAK,MAAM,EAAE,OAAOC,GAAK,OAAO,KAAK,KAAK,IAAIA,CAAC,CAAE,EAAE,SAAW,CAAC,CAC1E,CAQA,OAAkB,CACd,OAAO,KAAK,MAAM,EAAE,OAAOA,GAAK,OAAO,KAAK,KAAK,KAAKA,CAAC,CAAE,EAAE,SAAW,CAAC,CAC3E,CAUA,SAASC,EAAiBH,EAAyB,CAC/C,OAAAG,EAAM,QAASD,GAAM,CACbF,IAAU,OACV,KAAK,QAAQE,EAAGF,CAAK,EAErB,KAAK,QAAQE,CAAC,CAEtB,CAAC,EACM,IACX,CAYA,QAAQE,EAAcJ,EAAyB,CAC3C,OAAII,KAAQ,KAAK,QACT,UAAU,OAAS,IACnB,KAAK,OAAOA,CAAI,EAAIJ,GAEjB,OAGX,KAAK,OAAOI,CAAI,EAAI,UAAU,OAAS,EAAIJ,EAAS,KAAK,oBAAoBI,CAAI,EAC7E,KAAK,cACL,KAAK,QAASA,CAAI,EAAI,KACtB,KAAK,UAAWA,CAAI,EAAI,CAAC,EACzB,KAAK,UAAW,IAAU,EAAGA,CAAI,EAAI,IAEzC,KAAK,IAAIA,CAAI,EAAI,CAAC,EAClB,KAAK,OAAOA,CAAI,EAAI,CAAC,EACrB,KAAK,KAAKA,CAAI,EAAI,CAAC,EACnB,KAAK,MAAMA,CAAI,EAAI,CAAC,EACpB,EAAE,KAAK,WACA,KACX,CASA,KAAKA,EAAyB,CAE1B,OAAO,KAAK,OAAOA,CAAI,CAC3B,CAQA,QAAQA,EAAuB,CAC3B,OAAOA,KAAQ,KAAK,MACxB,CAWA,WAAWA,EAAoB,CAC3B,GAAIA,KAAQ,KAAK,OAAQ,CACrB,IAAMC,EAAcC,GAAc,KAAK,WAAW,KAAK,UAAUA,CAAC,CAAE,EACpE,OAAO,KAAK,OAAOF,CAAI,EACnB,KAAK,cACL,KAAK,4BAA4BA,CAAI,EACrC,OAAO,KAAK,QAASA,CAAI,EACzB,KAAK,SAASA,CAAI,EAAE,QAASG,GAAU,CACnC,KAAK,UAAUA,CAAK,CACxB,CAAC,EACD,OAAO,KAAK,UAAWH,CAAI,GAE/B,OAAO,KAAK,KAAK,IAAIA,CAAI,CAAE,EAAE,QAAQC,CAAU,EAC/C,OAAO,KAAK,IAAID,CAAI,EACpB,OAAO,KAAK,OAAOA,CAAI,EACvB,OAAO,KAAK,KAAK,KAAKA,CAAI,CAAE,EAAE,QAAQC,CAAU,EAChD,OAAO,KAAK,KAAKD,CAAI,EACrB,OAAO,KAAK,MAAMA,CAAI,EACtB,EAAE,KAAK,UACX,CACA,OAAO,IACX,CAYA,UAAUF,EAAWM,EAAuB,CACxC,GAAI,CAAC,KAAK,YACN,MAAM,IAAI,MAAM,2CAA2C,EAG/D,GAAIA,IAAW,OACXA,EAAS,SACN,CAEHA,GAAU,GACV,QAASC,EAAsCD,EAAQC,IAAa,OAAWA,EAAW,KAAK,OAAOA,CAAQ,EAC1G,GAAIA,IAAaP,EACb,MAAM,IAAI,MAAM,WAAaM,EAAS,iBAAmBN,EACrD,uBAAuB,EAInC,KAAK,QAAQM,CAAM,CACvB,CAEA,OAAA,KAAK,QAAQN,CAAC,EACd,KAAK,4BAA4BA,CAAC,EAClC,KAAK,QAASA,CAAC,EAAIM,EACnB,KAAK,UAAWA,CAAM,EAAGN,CAAC,EAAI,GACvB,IACX,CASA,OAAOA,EAA0B,CAC7B,GAAI,KAAK,YAAa,CAClB,IAAMM,EAAS,KAAK,QAASN,CAAC,EAC9B,GAAIM,IAAW,KACX,OAAOA,CAEf,CACJ,CASA,SAASN,EAAY,KAAsB,CACvC,GAAI,KAAK,YAAa,CAClB,IAAMQ,EAAW,KAAK,UAAWR,CAAC,EAClC,GAAIQ,EACA,OAAO,OAAO,KAAKA,CAAQ,CAEnC,KAAO,CAAA,GAAIR,IAAM,KACb,OAAO,KAAK,MAAM,EACf,GAAI,KAAK,QAAQA,CAAC,EACrB,MAAO,CAAC,CAAA,CAEZ,MAAO,CAAC,CACZ,CAUA,aAAaA,EAA4B,CACrC,IAAMS,EAAS,KAAK,OAAOT,CAAC,EAC5B,GAAIS,EACA,OAAO,OAAO,KAAKA,CAAM,CAEjC,CAUA,WAAWT,EAA4B,CACnC,IAAMU,EAAQ,KAAK,MAAMV,CAAC,EAC1B,GAAIU,EACA,OAAO,OAAO,KAAKA,CAAK,CAEhC,CAUA,UAAUV,EAA4B,CAClC,IAAMW,EAAQ,KAAK,aAAaX,CAAC,EACjC,GAAIW,EAAO,CACP,IAAMC,EAAQ,IAAI,IAAID,CAAK,EAC3B,QAAWE,KAAQ,KAAK,WAAWb,CAAC,EAChCY,EAAM,IAAIC,CAAI,EAGlB,OAAO,MAAM,KAAKD,EAAM,OAAO,CAAC,CACpC,CACJ,CAEA,OAAOZ,EAAoB,CACvB,IAAIc,EACJ,OAAI,KAAK,WAAW,EAChBA,EAAY,KAAK,WAAWd,CAAC,EAE7Bc,EAAY,KAAK,UAAUd,CAAC,EAEzBc,EAAW,SAAW,CACjC,CAWA,YAAYC,EAAsC,CAC9C,IAAMC,EAAO,IAAK,KAAK,YAA+D,CAClF,SAAU,KAAK,YACf,WAAY,KAAK,cACjB,SAAU,KAAK,WACnB,CAAC,EAEDA,EAAK,SAAS,KAAK,MAAM,CAAE,EAE3B,OAAO,QAAQ,KAAK,MAAM,EAAE,QAAQ,CAAC,CAAChB,EAAGiB,CAAK,IAAM,CAC5CF,EAAOf,CAAC,GACRgB,EAAK,QAAQhB,EAAGiB,CAAK,CAE7B,CAAC,EAED,OAAO,OAAO,KAAK,SAAS,EAAE,QAASb,GAAM,CACrCY,EAAK,QAAQZ,EAAE,CAAC,GAAKY,EAAK,QAAQZ,EAAE,CAAC,GACrCY,EAAK,QAAQZ,EAAG,KAAK,KAAKA,CAAC,CAAC,CAEpC,CAAC,EAED,IAAMc,EAA8C,CAAC,EAC/CC,EAAcnB,GAAkC,CAClD,IAAMM,EAAS,KAAK,OAAON,CAAC,EAC5B,MAAI,CAACM,GAAUU,EAAK,QAAQV,CAAM,GAC9BY,EAAQlB,CAAC,EAAIM,GAAA,KAAAA,EAAU,OAChBA,GAAA,KAAAA,EAAU,QACVA,KAAUY,EACVA,EAAQZ,CAAM,EAEda,EAAWb,CAAM,CAEhC,EAEA,OAAI,KAAK,aACLU,EAAK,MAAM,EAAE,QAAQhB,GAAKgB,EAAK,UAAUhB,EAAGmB,EAAWnB,CAAC,CAAC,CAAC,EAGvDgB,CACX,CAUA,oBAAoBjB,EAA0D,CAC1E,OAAI,OAAOA,GAAc,WACrB,KAAK,oBAAsB,IAAMA,EAEjC,KAAK,oBAAsBA,EAGxB,IACX,CAQA,WAAoB,CAChB,OAAO,KAAK,UAChB,CAQA,OAAgB,CACZ,OAAO,OAAO,OAAO,KAAK,SAAS,CACvC,CAcA,QAAQqB,EAAiBtB,EAAyB,CAC9C,OAAAsB,EAAM,OAAO,CAACpB,EAAGqB,KACTvB,IAAU,OACV,KAAK,QAAQE,EAAGqB,EAAGvB,CAAK,EAExB,KAAK,QAAQE,EAAGqB,CAAC,EAEdA,EACV,EACM,IACX,CA8BA,QAAQrB,EAAkBqB,EAAwBJ,EAAmBf,EAAqB,CACtF,IAAIoB,EACAC,EACAC,EACAC,EACAC,EAAiB,GAEjB,OAAO1B,GAAM,UAAYA,IAAM,MAAQ,MAAOA,GAC9CsB,EAAOtB,EAAE,EACTuB,EAAOvB,EAAE,EACTwB,EAAUxB,EAAE,KACR,UAAU,SAAW,IACrByB,EAAYJ,EACZK,EAAiB,MAGrBJ,EAAOtB,EACPuB,EAAOF,EACPG,EAAUtB,EACN,UAAU,OAAS,IACnBuB,EAAYR,EACZS,EAAiB,KAIzBJ,EAAO,GAAKA,EACZC,EAAO,GAAKA,EACRC,IAAY,SACZA,EAAU,GAAKA,GAGnB,IAAMpB,EAAIuB,EAAa,KAAK,YAAaL,EAAMC,EAAMC,CAAO,EAC5D,GAAIpB,KAAK,KAAK,YACV,OAAIsB,IACA,KAAK,YAAYtB,CAAC,EAAIqB,GAEnB,KAGX,GAAID,IAAY,QAAa,CAAC,KAAK,cAC/B,MAAM,IAAI,MAAM,mDAAmD,EAKvE,KAAK,QAAQF,CAAI,EACjB,KAAK,QAAQC,CAAI,EAEjB,KAAK,YAAYnB,CAAC,EAAIsB,EAAiBD,EAAa,KAAK,oBAAoBH,EAAMC,EAAMC,CAAO,EAGhG,IAAMI,EAAUC,GAAc,KAAK,YAAaP,EAAMC,EAAMC,CAAO,EAEnE,OAAAF,EAAOM,EAAQ,EACfL,EAAOK,EAAQ,EAEf,OAAO,OAAOA,CAAO,EACrB,KAAK,UAAUxB,CAAC,EAAIwB,EACpBE,GAAqB,KAAK,OAAOP,CAAI,EAAID,CAAI,EAC7CQ,GAAqB,KAAK,MAAMR,CAAI,EAAIC,CAAI,EAC5C,KAAK,IAAIA,CAAI,EAAGnB,CAAC,EAAIwB,EACrB,KAAK,KAAKN,CAAI,EAAGlB,CAAC,EAAIwB,EACtB,KAAK,aACE,IACX,CAsBA,KAAK5B,EAAkBqB,EAAYnB,EAA0B,CAEzD,IAAME,EAAK,UAAU,SAAW,EAC1B2B,EAAY,KAAK,YAAa/B,CAAS,EACvC2B,EAAa,KAAK,YAAa3B,EAAaqB,EAAInB,CAAI,EAC1D,OAAO,KAAK,YAAYE,CAAC,CAC7B,CAsBA,UAAUJ,EAAkBqB,EAAYnB,EAAqC,CACzE,IAAM8B,EAAY,UAAU,SAAW,EACjC,KAAK,KAAKhC,CAAS,EACnB,KAAK,KAAKA,EAAaqB,EAAInB,CAAI,EAErC,OAAI,OAAO8B,GAAc,SACd,CAAC,MAAOA,CAAsB,EAGlCA,CACX,CAsBA,QAAQhC,EAAkBqB,EAAYnB,EAAwB,CAI1D,OAHW,UAAU,SAAW,EAC1B6B,EAAY,KAAK,YAAa/B,CAAS,EACvC2B,EAAa,KAAK,YAAa3B,EAAaqB,EAAInB,CAAI,KAC9C,KAAK,WACrB,CAsBA,WAAWF,EAAkBqB,EAAYnB,EAAqB,CAC1D,IAAME,EAAK,UAAU,SAAW,EAC1B2B,EAAY,KAAK,YAAa/B,CAAS,EACvC2B,EAAa,KAAK,YAAa3B,EAAaqB,EAAInB,CAAI,EACpD+B,EAAO,KAAK,UAAU7B,CAAC,EAC7B,GAAI6B,EAAM,CACN,IAAMX,EAAOW,EAAK,EACZV,EAAOU,EAAK,EAClB,OAAO,KAAK,YAAY7B,CAAC,EACzB,OAAO,KAAK,UAAUA,CAAC,EACvB8B,GAAuB,KAAK,OAAOX,CAAI,EAAID,CAAI,EAC/CY,GAAuB,KAAK,MAAMZ,CAAI,EAAIC,CAAI,EAC9C,OAAO,KAAK,IAAIA,CAAI,EAAGnB,CAAC,EACxB,OAAO,KAAK,KAAKkB,CAAI,EAAGlB,CAAC,EACzB,KAAK,YACT,CACA,OAAO,IACX,CAWA,QAAQJ,EAAWqB,EAA2B,CAC1C,OAAI,KAAK,WAAW,EACT,KAAK,YAAY,KAAK,IAAIrB,CAAC,EAAGA,EAAGqB,CAAC,EAEtC,KAAK,UAAUrB,EAAGqB,CAAC,CAC9B,CAWA,SAASrB,EAAWqB,EAA2B,CAC3C,OAAI,KAAK,WAAW,EACT,KAAK,YAAY,KAAK,KAAKrB,CAAC,EAAGA,EAAGqB,CAAC,EAEvC,KAAK,UAAUrB,EAAGqB,CAAC,CAC9B,CAWA,UAAUrB,EAAWqB,EAA2B,CAC5C,GAAIrB,KAAK,KAAK,OACV,OAAO,KAAK,YAAY,CAAC,GAAG,KAAK,IAAIA,CAAC,EAAI,GAAG,KAAK,KAAKA,CAAC,CAAE,EAAGA,EAAGqB,CAAC,CAEzE,CAQQ,4BAA4BrB,EAAiB,CACjD,OAAO,KAAK,UAAW,KAAK,QAASA,CAAC,CAAE,EAAGA,CAAC,CAChD,CAEQ,YAAYmC,EAAwCC,EAAmBC,EAAyC,CACpH,GAAI,CAACF,EACD,OAEJ,IAAMG,EAAQ,OAAO,OAAOH,CAAI,EAChC,OAAKE,EAGEC,EAAM,OAAQL,GACVA,EAAK,IAAMG,GAAaH,EAAK,IAAMI,GACnCJ,EAAK,IAAMI,GAAcJ,EAAK,IAAMG,CAC9C,EALUE,CAMf,CACJ,EAGA,SAASR,GAAqBS,EAA6BC,EAAiB,CACpED,EAAIC,CAAC,EACLD,EAAIC,CAAC,IAELD,EAAIC,CAAC,EAAI,CAEjB,CAEA,SAASN,GAAuBK,EAA6BC,EAAiB,CACtED,EAAIC,CAAC,IAAM,QAAa,CAAC,EAAED,EAAIC,CAAC,GAChC,OAAOD,EAAIC,CAAC,CAEpB,CAEA,SAASb,EAAac,EAAqBC,EAAYC,EAAYzC,EAAuB,CACtF,IAAIF,EAAI,GAAK0C,EACTrB,EAAI,GAAKsB,EACb,GAAI,CAACF,GAAczC,EAAIqB,EAAG,CACtB,IAAMuB,EAAM5C,EACZA,EAAIqB,EACJA,EAAIuB,CACR,CACA,OAAO5C,EAAI,IAAiBqB,EAAI,KAC3BnB,IAAS,OAAY,KAAoBA,EAClD,CAEA,SAAS2B,GAAcY,EAAqBC,EAAYC,EAAYzC,EAAqB,CACrF,IAAIF,EAAI,GAAK0C,EACTrB,EAAI,GAAKsB,EACb,GAAI,CAACF,GAAczC,EAAIqB,EAAG,CACtB,IAAMuB,EAAM5C,EACZA,EAAIqB,EACJA,EAAIuB,CACR,CACA,IAAMhB,EAAgB,CAAC,EAAG5B,EAAG,EAAGqB,CAAC,EACjC,OAAInB,IACA0B,EAAQ,KAAO1B,GAEZ0B,CACX,CAEA,SAASG,EAAYU,EAAqBb,EAAuB,CAC7D,OAAOD,EAAac,EAAYb,EAAQ,EAAGA,EAAQ,EAAGA,EAAQ,IAAI,CACtE,CC51BO,IAAMiB,GAAU,QCAvBC,GAAA,CAAA,EAAAC,GAAAD,GAAA,CAAA,KAAA,IAAAE,GAAA,MAAA,IAAAC,EAAAA,CAAAA,EA8BO,SAASA,GAAMC,EAAyB,CAC3C,IAAMC,EAAkB,CACpB,QAAS,CACL,SAAUD,EAAM,WAAW,EAC3B,WAAYA,EAAM,aAAa,EAC/B,SAAUA,EAAM,WAAW,CAC/B,EACA,MAAOE,GAAWF,CAAK,EACvB,MAAOG,GAAWH,CAAK,CAC3B,EAEMI,EAAaJ,EAAM,MAAM,EAC/B,OAAII,IAAe,SACfH,EAAK,MAAQ,gBAAgBG,CAAU,GAGpCH,CACX,CAEA,SAASC,GAAWG,EAAsB,CACtC,OAAOA,EAAE,MAAM,EAAE,IAAIvD,GAAK,CACtB,IAAMwD,EAAYD,EAAE,KAAKvD,CAAC,EACpBM,EAASiD,EAAE,OAAOvD,CAAC,EACnByD,EAAiB,CAAC,EAAAzD,CAAC,EAEzB,OAAIwD,IAAc,SACdC,EAAK,MAAQD,GAEblD,IAAW,SACXmD,EAAK,OAASnD,GAGXmD,CACX,CAAC,CACL,CAEA,SAASJ,GAAWE,EAAsB,CACtC,OAAOA,EAAE,MAAM,EAAE,IAAInD,GAAK,CACtB,IAAMqB,EAAY8B,EAAE,KAAKnD,CAAC,EACpB6B,EAAiB,CAAC,EAAG7B,EAAE,EAAG,EAAGA,EAAE,CAAC,EAEtC,OAAIA,EAAE,OAAS,SACX6B,EAAK,KAAO7B,EAAE,MAEdqB,IAAc,SACdQ,EAAK,MAAQR,GAGVQ,CACX,CAAC,CACL,CAeO,SAASe,GACZG,EACuC,CACvC,IAAMI,EAAI,IAAI3D,EAAwCuD,EAAK,OAAO,EAElE,OAAIA,EAAK,QAAU,QACfI,EAAE,SAASJ,EAAK,KAAmB,EAGvCA,EAAK,MAAM,QAAQO,GAAS,CACxBH,EAAE,QAAQG,EAAM,EAAGA,EAAM,KAAkB,EACvCA,EAAM,QACNH,EAAE,UAAUG,EAAM,EAAGA,EAAM,MAAM,CAEzC,CAAC,EAEDP,EAAK,MAAM,QAAQO,GAAS,CACxBH,EAAE,QAAQ,CAAC,EAAGG,EAAM,EAAG,EAAGA,EAAM,EAAG,KAAMA,EAAM,IAAI,EAAGA,EAAM,KAAkB,CAClF,CAAC,EAEMH,CACX,CCpHA,IAAAI,EAAA,CAAA,EAAAZ,GAAAY,EAAA,CAAA,eAAA,IAAAC,EAAA,YAAA,IAAAC,GAAA,WAAA,IAAAC,GAAA,SAAA,IAAAC,EAAA,YAAA,IAAAC,GAAA,WAAA,IAAAC,GAAA,cAAA,IAAAC,GAAA,UAAA,IAAAC,GAAA,UAAA,IAAAC,GAAA,SAAA,IAAAC,GAAA,KAAA,IAAAC,GAAA,cAAA,IAAAC,GAAA,OAAA,IAAAC,GAAA,QAAA,IAAAC,EAAAA,CAAAA,ECGA,IAAMC,GAAsC,IAAM,EAE3C,SAASb,GACZN,EACAoB,EACAC,EACAC,EACoB,CACpB,OAAOC,GACHvB,EACA,OAAOoB,CAAM,EACbC,GAAYF,GACZG,GAAU,SAAU7E,EAAG,CACnB,OAAOuD,EAAE,SAASvD,CAAC,CACvB,CACJ,CACJ,CAEA,SAAS8E,GACLvB,EACAoB,EACAC,EACAC,EACoB,CACpB,IAAME,EAAgC,CAAC,EACnCC,EACAC,EAAa,EACX7D,EAAQmC,EAAE,MAAM,EAEhB2B,EAAY,SAAUjD,EAAkB,CAC1C,IAAMkD,EAAaP,EAAS3C,CAAI,EAC5B8C,EAAQ9C,EAAK,CAAC,EAAG,SAAWkD,EAAaJ,EAAQ9C,EAAK,CAAC,EAAG,WAC1D8C,EAAQ9C,EAAK,CAAC,EAAI,CACd,SAAU8C,EAAQ9C,EAAK,CAAC,EAAG,SAAWkD,EACtC,YAAalD,EAAK,CACtB,EACA+C,EAAsB,GAE9B,EAEMI,EAAgB,UAAkB,CACpChE,EAAM,QAAQ,SAAUiE,EAAQ,CAC5BR,EAAOQ,CAAM,EAAE,QAAQ,SAAUpD,EAAM,CAGnC,IAAMqD,EAAWrD,EAAK,IAAMoD,EAASpD,EAAK,EAAIA,EAAK,EAC7CsD,EAAYD,IAAarD,EAAK,EAAIA,EAAK,EAAIA,EAAK,EACtDiD,EAAU,CAAC,EAAGI,EAAU,EAAGC,CAAS,CAAC,CACzC,CAAC,CACL,CAAC,CACL,EAGAnE,EAAM,QAAQ,SAAUpB,EAAG,CACvB,IAAMwF,EAAWxF,IAAM2E,EAAS,EAAI,OAAO,kBAC3CI,EAAQ/E,CAAC,EAAI,CAAC,SAAUwF,EAAU,YAAa,EAAE,CACrD,CAAC,EAED,IAAMC,EAAgBrE,EAAM,OAG5B,QAASsE,EAAI,EAAGA,EAAID,IAChBT,EAAsB,GACtBC,IACAG,EAAc,EACV,CAAA,CAACJ,GAJ0BU,IAI/B,CAOJ,GAAIT,IAAeQ,EAAgB,IAC/BT,EAAsB,GACtBI,EAAc,EACVJ,GACA,MAAM,IAAI,MAAM,4CAA4C,EAIpE,OAAOD,CACX,CC1EO,SAASjB,GAAWZ,EAA0B,CACjD,IAAMyC,EAAmC,CAAC,EACpCC,EAAoB,CAAC,EACvBC,EAEJ,SAASC,EAAI9F,EAAiB,CACtBA,KAAK2F,IACTA,EAAQ3F,CAAC,EAAI,GACb6F,EAAK,KAAK7F,CAAC,EACXkD,EAAM,WAAWlD,CAAC,EAAG,QAAQ8F,CAAG,EAChC5C,EAAM,aAAalD,CAAC,EAAG,QAAQ8F,CAAG,EACtC,CAEA,OAAA5C,EAAM,MAAM,EAAE,QAAQ,SAAUlD,EAAG,CAC/B6F,EAAO,CAAC,EACRC,EAAI9F,CAAC,EACD6F,EAAK,QACLD,EAAM,KAAKC,CAAI,CAEvB,CAAC,EAEMD,CACX,CCnBO,IAAMG,GAAN,KAAoB,CAApB,aAAA,CACH,KAAQ,KAA6B,CAAC,EACtC,KAAQ,YAAsC,CAAC,CAAA,CAK/C,MAAe,CACX,OAAO,KAAK,KAAK,MACrB,CAKA,MAAiB,CACb,OAAO,KAAK,KAAK,IAAIC,GAAKA,EAAE,GAAG,CACnC,CAKA,IAAIC,EAAsB,CACtB,OAAOA,KAAO,KAAK,WACvB,CAMA,SAASA,EAAiC,CACtC,IAAMC,EAAQ,KAAK,YAAYD,CAAG,EAClC,GAAIC,IAAU,OACV,OAAO,KAAK,KAAKA,CAAK,EAAG,QAGjC,CAMA,KAAc,CACV,GAAI,KAAK,KAAK,IAAM,EAChB,MAAM,IAAI,MAAM,iBAAiB,EAErC,OAAO,KAAK,KAAK,CAAC,EAAG,GACzB,CAOA,IAAID,EAAaE,EAA2B,CACxC,IAAMC,EAAa,KAAK,YAClBC,EAAS,OAAOJ,CAAG,EAEzB,GAAI,EAAEI,KAAUD,GAAa,CACzB,IAAME,EAAM,KAAK,KACXJ,EAAQI,EAAI,OAClB,OAAAF,EAAWC,CAAM,EAAIH,EACrBI,EAAI,KAAK,CAAC,IAAKD,EAAQ,SAAAF,CAAQ,CAAC,EAChC,KAAK,UAAUD,CAAK,EACb,EACX,CACA,MAAO,EACX,CAKA,WAAoB,CAChB,KAAK,MAAM,EAAG,KAAK,KAAK,OAAS,CAAC,EAClC,IAAMK,EAAM,KAAK,KAAK,IAAI,EAC1B,OAAA,OAAO,KAAK,YAAYA,EAAI,GAAG,EAC/B,KAAK,SAAS,CAAC,EACRA,EAAI,GACf,CAMA,SAASN,EAAaE,EAAwB,CAC1C,IAAMD,EAAQ,KAAK,YAAYD,CAAG,EAClC,GAAIC,IAAU,OACV,MAAM,IAAI,MAAM,kBAAkBD,CAAG,EAAE,EAG3C,IAAMO,EAAkB,KAAK,KAAKN,CAAK,EAAG,SAC1C,GAAIC,EAAWK,EACX,MAAM,IAAI,MACN,uDAAuDP,CAAG,SAASO,CAAe,SAASL,CAAQ,EACvG,EAEJ,KAAK,KAAKD,CAAK,EAAG,SAAWC,EAC7B,KAAK,UAAUD,CAAK,CACxB,CAEQ,SAASR,EAAiB,CAC9B,IAAMY,EAAM,KAAK,KACXG,EAAI,EAAIf,EACRgB,EAAID,EAAI,EACVE,EAAUjB,EAEVe,EAAIH,EAAI,SACRK,EAAUL,EAAIG,CAAC,EAAG,SAAWH,EAAIK,CAAO,EAAG,SAAWF,EAAIE,EACtDD,EAAIJ,EAAI,SACRK,EAAUL,EAAII,CAAC,EAAG,SAAWJ,EAAIK,CAAO,EAAG,SAAWD,EAAIC,GAE1DA,IAAYjB,IACZ,KAAK,MAAMA,EAAGiB,CAAO,EACrB,KAAK,SAASA,CAAO,GAGjC,CAEQ,UAAUT,EAAqB,CACnC,IAAMI,EAAM,KAAK,KACXH,EAAWG,EAAIJ,CAAK,EAAG,SACzB5F,EAEJ,KAAO4F,IAAU,IACb5F,EAAS4F,GAAS,EACd,EAAAI,EAAIhG,CAAM,EAAG,SAAW6F,KAG5B,KAAK,MAAMD,EAAO5F,CAAM,EACxB4F,EAAQ5F,CAEhB,CAEQ,MAAMoF,EAAWkB,EAAiB,CACtC,IAAMN,EAAM,KAAK,KACXF,EAAa,KAAK,YAClBS,EAAWP,EAAIZ,CAAC,EAChBoB,EAAWR,EAAIM,CAAC,EAEtBN,EAAIZ,CAAC,EAAIoB,EACTR,EAAIM,CAAC,EAAIC,EACTT,EAAWU,EAAS,GAAG,EAAIpB,EAC3BU,EAAWS,EAAS,GAAG,EAAID,CAC/B,CACJ,ECxJMlC,GAAsC,IAAM,EAoB3C,SAASX,EACZb,EACAyB,EACAC,EACAC,EACoB,CACpB,IAAMkC,EAA8B,SAAU/G,EAAG,CAC7C,OAAOkD,EAAM,SAASlD,CAAC,CAC3B,EAEA,OAAOgH,GAAY9D,EAAO,OAAOyB,CAAM,EACnCC,GAAYF,GACZG,GAAUkC,CAAa,CAC/B,CAEA,SAASC,GACL9D,EACAyB,EACAC,EACAC,EACoB,CACpB,IAAME,EAAgC,CAAC,EACjCkC,EAAK,IAAIlB,GACX/F,EAAWkH,EAETC,EAAkB,SAAUlF,EAAkB,CAChD,IAAMZ,EAAIY,EAAK,IAAMjC,EAAIiC,EAAK,EAAIA,EAAK,EACjCmF,EAASrC,EAAQ1D,CAAC,EAClBgG,EAASzC,EAAS3C,CAAI,EACtBuD,EAAW0B,EAAO,SAAWG,EAEnC,GAAIA,EAAS,EACT,MAAM,IAAI,MAAM,4DACGpF,EAAO,YAAcoF,CAAM,EAG9C7B,EAAW4B,EAAO,WAClBA,EAAO,SAAW5B,EAClB4B,EAAO,YAAcpH,EACrBiH,EAAG,SAAS5F,EAAGmE,CAAQ,EAE/B,EAQA,IANAtC,EAAM,MAAM,EAAE,QAAQ,SAAUlD,EAAG,CAC/B,IAAMwF,EAAWxF,IAAM2E,EAAS,EAAI,OAAO,kBAC3CI,EAAQ/E,CAAC,EAAI,CAAC,SAAUwF,EAAU,YAAa,EAAE,EACjDyB,EAAG,IAAIjH,EAAGwF,CAAQ,CACtB,CAAC,EAEMyB,EAAG,KAAK,EAAI,IACfjH,EAAIiH,EAAG,UAAU,EACjBC,EAASnC,EAAQ/E,CAAC,EACdkH,EAAO,WAAa,OAAO,oBAI/BrC,EAAO7E,CAAC,EAAE,QAAQmH,CAAe,EAGrC,OAAOpC,CACX,CClEO,SAASf,GACZd,EACA0B,EACAC,EACoC,CACpC,OAAO3B,EAAM,MAAM,EAAE,OAAO,SAAUoE,EAAKtH,EAAG,CAC1C,OAAAsH,EAAItH,CAAC,EAAI+D,EAASb,EAAOlD,EAAG4E,EAAUC,CAAM,EACrCyC,CACX,EAAG,CAAC,CAAyC,CACjD,CCNO,SAAS9C,GAAOtB,EAA0B,CAC7C,IAAIgD,EAAQ,EACNqB,EAAkB,CAAC,EACnB5B,EAAwC,CAAC,EACzCZ,EAAsB,CAAC,EAE7B,SAASe,EAAI9F,EAAiB,CAC1B,IAAM0D,EAAQiC,EAAQ3F,CAAC,EAAI,CACvB,QAAS,GACT,QAASkG,EACT,MAAOA,GACX,EAYA,GAXAqB,EAAM,KAAKvH,CAAC,EAEZkD,EAAM,WAAWlD,CAAC,EAAG,QAAQ,SAAUqB,EAAG,CAChCA,KAAKsE,EAGAA,EAAQtE,CAAC,EAAG,UACnBqC,EAAM,QAAU,KAAK,IAAIA,EAAM,QAASiC,EAAQtE,CAAC,EAAG,KAAK,IAHzDyE,EAAIzE,CAAC,EACLqC,EAAM,QAAU,KAAK,IAAIA,EAAM,QAASiC,EAAQtE,CAAC,EAAG,OAAO,EAInE,CAAC,EAEGqC,EAAM,UAAYA,EAAM,MAAO,CAC/B,IAAMmC,EAAiB,CAAC,EACpBxE,EACJ,GACIA,EAAIkG,EAAM,IAAI,EACd5B,EAAQtE,CAAC,EAAG,QAAU,GACtBwE,EAAK,KAAKxE,CAAC,QACNrB,IAAMqB,GACf0D,EAAQ,KAAKc,CAAI,CACrB,CACJ,CAEA,OAAA3C,EAAM,MAAM,EAAE,QAAQ,SAAUlD,EAAG,CACzBA,KAAK2F,GACPG,EAAI9F,CAAC,CAEb,CAAC,EAEM+E,CACX,CCjDO,SAASd,GAAWf,EAA0B,CACjD,OAAOsB,GAAOtB,CAAK,EAAE,OAAO,SAAU2C,EAAM,CACxC,OAAOA,EAAK,OAAS,GAAMA,EAAK,SAAW,GAAK3C,EAAM,QAAQ2C,EAAK,CAAC,EAAIA,EAAK,CAAC,CAAE,CACpF,CAAC,CACL,CCfA,IAAMnB,GAAsC,IAAM,EAqB3C,SAASR,GACZhB,EACA0B,EACAC,EACoC,CACpC,OAAO2C,GAAiBtE,EACpB0B,GAAYF,GACZG,GAAU,SAAU7E,EAAG,CACnB,OAAOkD,EAAM,SAASlD,CAAC,CAC3B,CAAC,CACT,CAEA,SAASwH,GACLtE,EACA0B,EACAC,EACoC,CACpC,IAAME,EAAgD,CAAC,EACjD3D,EAAQ8B,EAAM,MAAM,EAE1B,OAAA9B,EAAM,QAAQ,SAAUpB,EAAG,CACvB+E,EAAQ/E,CAAC,EAAI,CAAC,EACd+E,EAAQ/E,CAAC,EAAGA,CAAC,EAAI,CAAC,SAAU,EAAG,YAAa,EAAE,EAC9CoB,EAAM,QAAQ,SAAUC,EAAG,CACnBrB,IAAMqB,IACN0D,EAAQ/E,CAAC,EAAGqB,CAAC,EAAI,CAAC,SAAU,OAAO,kBAAmB,YAAa,EAAE,EAE7E,CAAC,EACDwD,EAAO7E,CAAC,EAAE,QAAQ,SAAUiC,EAAM,CAC9B,IAAMZ,EAAIY,EAAK,IAAMjC,EAAIiC,EAAK,EAAIA,EAAK,EACjCwF,EAAI7C,EAAS3C,CAAI,EACvB8C,EAAQ/E,CAAC,EAAGqB,CAAC,EAAI,CAAC,SAAUoG,EAAG,YAAazH,CAAC,CACjD,CAAC,CACL,CAAC,EAEDoB,EAAM,QAAQ,SAAUoB,EAAG,CACvB,IAAMkF,EAAO3C,EAAQvC,CAAC,EACtBpB,EAAM,QAAQ,SAAUsE,EAAG,CACvB,IAAMiC,EAAO5C,EAAQW,CAAC,EACtBtE,EAAM,QAAQ,SAAUwF,EAAG,CACvB,IAAMgB,EAAKD,EAAKnF,CAAC,EACXqF,EAAKH,EAAKd,CAAC,EACXkB,EAAKH,EAAKf,CAAC,EACXmB,EAAcH,EAAG,SAAWC,EAAG,SACjCE,EAAcD,EAAG,WACjBA,EAAG,SAAWC,EACdD,EAAG,YAAcD,EAAG,YAE5B,CAAC,CACL,CAAC,CACL,CAAC,EAEM9C,CACX,CC3EO,IAAMnB,EAAN,cAA6B,KAAM,CACtC,eAAeoE,EAAiB,CAC5B,MAAM,GAAGA,CAA2C,CACxD,CACJ,EAUO,SAASvD,GAAQvB,EAAwB,CAC5C,IAAMyC,EAAmC,CAAC,EACpC4B,EAAiC,CAAC,EAClCxC,EAAoB,CAAC,EAE3B,SAASkD,EAAMxE,EAAoB,CAC/B,GAAIA,KAAQ8D,EACR,MAAM,IAAI3D,EAGRH,KAAQkC,IACV4B,EAAM9D,CAAI,EAAI,GACdkC,EAAQlC,CAAI,EAAI,GAChBP,EAAM,aAAaO,CAAI,EAAG,QAAQwE,CAAK,EACvC,OAAOV,EAAM9D,CAAI,EACjBsB,EAAQ,KAAKtB,CAAI,EAEzB,CAIA,GAFAP,EAAM,MAAM,EAAE,QAAQ+E,CAAK,EAEvB,OAAO,KAAKtC,CAAO,EAAE,SAAWzC,EAAM,UAAU,EAChD,MAAM,IAAIU,EAGd,OAAOmB,CACX,CC/BO,SAASZ,GAAUjB,EAAuB,CAC7C,GAAI,CACAuB,GAAQvB,CAAK,CACjB,OAAS9C,EAAG,CACR,GAAIA,aAAawD,EACb,MAAO,GAEX,MAAMxD,CACV,CACA,MAAO,EACX,CCXO,SAAS8H,GACZ3E,EACA4E,EACAC,EACAC,EACAf,EACC,CACI,MAAM,QAAQa,CAAE,IACjBA,EAAK,CAACA,CAAE,GAGZ,IAAMG,GAAetI,GAAW,CArBpC,IAAAuI,EAqBwC,OAAAA,EAAAhF,EAAE,WAAW,EAAIA,EAAE,WAAWvD,CAAC,EAAIuD,EAAE,UAAUvD,CAAC,IAAhD,KAAAuI,EAAsD,CAAC,CAAA,GAErF5C,EAAmC,CAAC,EAC1C,OAAAwC,EAAG,QAAQ,SAAUnI,EAAG,CACpB,GAAI,CAACuD,EAAE,QAAQvD,CAAC,EACZ,MAAM,IAAI,MAAM,6BAA+BA,CAAC,EAGpDsH,EAAMkB,GAASjF,EAAGvD,EAAGoI,IAAU,OAAQzC,EAAS2C,EAAYD,EAAIf,CAAG,CACvE,CAAC,EACMA,CACX,CAEA,SAASkB,GACLjF,EACAvD,EACAoE,EACAuB,EACA2C,EACAD,EACAf,EACC,CACD,OAAMtH,KAAK2F,IACPA,EAAQ3F,CAAC,EAAI,GAERoE,IACDkD,EAAMe,EAAGf,EAAKtH,CAAC,GAEnBsI,EAAWtI,CAAC,EAAE,QAAQ,SAAUqB,EAAG,CAC/BiG,EAAMkB,GAASjF,EAAGlC,EAAG+C,EAAWuB,EAAS2C,EAAYD,EAAIf,CAAG,CAChE,CAAC,EACGlD,IACAkD,EAAMe,EAAGf,EAAKtH,CAAC,IAGhBsH,CACX,CChDO,SAASxB,GAAIvC,EAAU4E,EAAuBC,EAAyB,CAC1E,OAAOF,GAAO3E,EAAG4E,EAAIC,EAAO,SAAUd,EAAKtH,EAAG,CAC1C,OAAAsH,EAAI,KAAKtH,CAAC,EACHsH,CACX,EAAG,CAAC,CAAa,CACrB,CCFO,SAASlD,GAAUlB,EAAciF,EAAiC,CACrE,OAAOrC,GAAI5C,EAAOiF,EAAI,MAAM,CAChC,CCFO,SAAS9D,GAASnB,EAAciF,EAAiC,CACpE,OAAOrC,GAAI5C,EAAOiF,EAAI,KAAK,CAC/B,CCCO,SAAS7D,GAAKpB,EAAc0B,EAAiC,CAChE,IAAM6D,EAAS,IAAI7I,EACbsB,EAAkC,CAAC,EACnC+F,EAAK,IAAIlB,GACX/F,EAEJ,SAASmH,EAAgBlF,EAAkB,CACvC,IAAMZ,EAAIY,EAAK,IAAMjC,EAAIiC,EAAK,EAAIA,EAAK,EACjCyG,EAAMzB,EAAG,SAAS5F,CAAC,EACzB,GAAIqH,IAAQ,OAAW,CACnB,IAAMvD,EAAaP,EAAS3C,CAAI,EAC5BkD,EAAauD,IACbxH,EAAQG,CAAC,EAAIrB,EACbiH,EAAG,SAAS5F,EAAG8D,CAAU,EAEjC,CACJ,CAEA,GAAIjC,EAAM,UAAU,IAAM,EACtB,OAAOuF,EAGXvF,EAAM,MAAM,EAAE,QAAQ,SAAUlD,EAAG,CAC/BiH,EAAG,IAAIjH,EAAG,OAAO,iBAAiB,EAClCyI,EAAO,QAAQzI,CAAC,CACpB,CAAC,EAGDiH,EAAG,SAAS/D,EAAM,MAAM,EAAE,CAAC,EAAI,CAAC,EAEhC,IAAIyF,EAAO,GACX,KAAO1B,EAAG,KAAK,EAAI,GAAG,CAElB,GADAjH,EAAIiH,EAAG,UAAU,EACbjH,KAAKkB,EACLuH,EAAO,QAAQzI,EAAGkB,EAAQlB,CAAC,CAAE,MAC1B,CAAA,GAAI2I,EACP,MAAM,IAAI,MAAM,iCAAmCzF,CAAK,EAExDyF,EAAO,EAAA,CAGXzF,EAAM,UAAUlD,CAAC,EAAG,QAAQmH,CAAe,CAC/C,CAEA,OAAOsB,CACX,CCvDO,SAASlE,GACZhB,EACAoB,EACAC,EACAC,EACoB,CACpB,OAAO+D,GACHrF,EACAoB,EACAC,EACAC,GAAA,KAAAA,GAAY7E,GAAc,CACtB,IAAMsC,EAAQiB,EAAE,SAASvD,CAAC,EAC1B,OAAOsC,GAAA,KAAAA,EAAS,CAAC,CACrB,EACJ,CACJ,CAEA,SAASsG,GACLrF,EACAoB,EACAC,EACAC,EACoB,CACpB,GAAID,IAAa,OACb,OAAOb,EAASR,EAAGoB,EAAQC,EAAUC,CAAM,EAG/C,IAAIgE,EAAqB,GACnBzH,EAAQmC,EAAE,MAAM,EAEtB,QAASmC,EAAI,EAAGA,EAAItE,EAAM,OAAQsE,IAAK,CACnC,IAAMoD,EAAUjE,EAAOzD,EAAMsE,CAAC,CAAE,EAEhC,QAASkB,EAAI,EAAGA,EAAIkC,EAAQ,OAAQlC,IAAK,CACrC,IAAM3E,EAAO6G,EAAQlC,CAAC,EAChBtB,EAAWrD,EAAK,IAAMb,EAAMsE,CAAC,EAAIzD,EAAK,EAAIA,EAAK,EAC/CsD,EAAYD,IAAarD,EAAK,EAAIA,EAAK,EAAIA,EAAK,EAElD2C,EAAS,CAAC,EAAGU,EAAU,EAAGC,CAAS,CAAC,EAAI,IACxCsD,EAAqB,GAE7B,CAEA,GAAIA,EACA,OAAOhF,GAAYN,EAAGoB,EAAQC,EAAUC,CAAM,CAEtD,CAEA,OAAOd,EAASR,EAAGoB,EAAQC,EAAUC,CAAM,CAC/C,CCzBA,SAASkE,EACLC,EACAC,EACAC,EACAC,EACM,CACN,IAAIC,EAAYD,EAChB,KAAOH,EAAM,QAAQI,CAAC,GAClBA,EAAIC,EAASF,CAAI,EAGrB,OAAAD,EAAM,MAAQD,EACdD,EAAM,QAAQI,EAAGF,CAAkB,EAC5BE,CACX,CAMA,SAASE,GAASN,EAAyF,CACvG,IAAMO,EAAa,IAAI,EAAwC,EAAE,SAASP,EAAM,MAAM,CAAC,EACvF,OAAAA,EAAM,MAAM,EAAE,QAAQI,GAAKG,EAAW,QAAQH,EAAGJ,EAAM,KAAKI,CAAC,CAAC,CAAC,EAC/DJ,EAAM,MAAM,EAAE,QAAQQ,GAAK,CACvB,IAAMC,EAAyBF,EAAW,KAAKC,EAAE,EAAGA,EAAE,CAAC,GAAK,CAAC,OAAQ,EAAG,OAAQ,CAAC,EAC3EE,EAAmBV,EAAM,KAAKQ,CAAC,EACrCD,EAAW,QAAQC,EAAE,EAAGA,EAAE,EAAG,CACzB,OAAQC,EAAY,OAAUC,EAAM,OACpC,OAAQ,KAAK,IAAID,EAAY,OAASC,EAAM,MAAO,CACvD,CAAC,CACL,CAAC,EACMH,CACX,CAEA,SAASI,EAAmBX,EAAyF,CACjH,IAAMO,EAAa,IAAI,EAAwC,CAAC,WAAYP,EAAM,aAAa,CAAC,CAAC,EAAE,SAASA,EAAM,MAAM,CAAC,EACzH,OAAAA,EAAM,MAAM,EAAE,QAAQI,GAAK,CAClBJ,EAAM,SAASI,CAAC,EAAE,QACnBG,EAAW,QAAQH,EAAGJ,EAAM,KAAKI,CAAC,CAAC,CAE3C,CAAC,EACDJ,EAAM,MAAM,EAAE,QAAQQ,GAAK,CACvBD,EAAW,QAAQC,EAAGR,EAAM,KAAKQ,CAAC,CAAC,CACvC,CAAC,EACMD,CACX,CAsCA,SAASK,EAAcC,EAAiBC,EAAqB,CACzD,IAAMC,EAAYF,EAAK,EACjBG,EAAYH,EAAK,EAIjBI,EAAaH,EAAM,EAAIC,EACvBG,EAAaJ,EAAM,EAAIE,EACzBG,EAAYN,EAAK,MAAQ,EACzBO,EAAYP,EAAK,OAAS,EAE9B,GAAI,CAACI,GAAM,CAACC,EACR,MAAM,IAAI,MAAM,2DAA2D,EAG/E,IAAIG,EAAYC,EAChB,OAAI,KAAK,IAAIJ,CAAE,EAAIC,EAAI,KAAK,IAAIF,CAAE,EAAIG,GAE9BF,EAAK,IACLE,EAAI,CAACA,GAETC,EAAKD,EAAIH,EAAKC,EACdI,EAAKF,IAGDH,EAAK,IACLE,EAAI,CAACA,GAETE,EAAKF,EACLG,EAAKH,EAAID,EAAKD,GAGX,CAAC,EAAGF,EAAIM,EAAI,EAAGL,EAAIM,CAAE,CAChC,CAMA,SAASC,EAAiBC,EAA4D,CAClF,IAAMC,EAAuBC,EAAMC,EAAQH,CAAK,EAAI,CAAC,EAAE,IAAI,IAAM,CAAC,CAAC,EACnE,OAAAA,EAAM,MAAM,EAAE,QAAQI,GAAK,CACvB,IAAMC,EAAOL,EAAM,KAAKI,CAAC,EACnBE,EAA2BD,EAAK,KAClCC,IAAS,SACJL,EAASK,CAAI,IACdL,EAASK,CAAI,EAAI,CAAC,GAEtBL,EAASK,CAAI,EAAED,EAAK,KAAM,EAAID,EAEtC,CAAC,EACMH,CACX,CAMA,SAASM,GAAeP,EAAsD,CAC1E,IAAMQ,EAAsBR,EAAM,MAAM,EAAE,IAAII,GAAK,CAC/C,IAAME,EAA4BN,EAAM,KAAKI,CAAC,EAAgB,KAC9D,OAAIE,IAAS,OACF,OAAO,UAGXA,CACX,CAAC,EACKG,EAAcC,EAAkB,KAAK,IAAKF,CAAS,EACzDR,EAAM,MAAM,EAAE,QAAQI,GAAK,CACvB,IAAMC,EAAOL,EAAM,KAAKI,CAAC,EACrB,OAAO,OAAOC,EAAM,MAAM,IACzBA,EAAmB,MAASI,EAErC,CAAC,CACL,CAEA,SAASE,GAAiBX,EAAsD,CAE5E,IAAMQ,EAAsBR,EAAM,MAAM,EAAE,IAAII,GAAKJ,EAAM,KAAKI,CAAC,EAAE,IAAI,EAAE,OAAQE,GAAyBA,IAAS,MAAS,EACpHM,EAAiBF,EAAkB,KAAK,IAAKF,CAAS,EAEtDK,EAAqB,CAAC,EAC5Bb,EAAM,MAAM,EAAE,QAAQI,GAAK,CACvB,IAAME,EAAeN,EAAM,KAAKI,CAAC,EAAE,KAAQQ,EACtCC,EAAOP,CAAI,IACZO,EAAOP,CAAI,EAAI,CAAC,GAEpBO,EAAOP,CAAI,EAAE,KAAKF,CAAC,CACvB,CAAC,EAED,IAAIU,EAAgB,EACdC,EAAyBf,EAAM,MAAM,EAAE,eAC7C,MAAM,KAAKa,CAAM,EAAE,QAAQ,CAACG,EAAIC,IAAM,CAC9BD,IAAO,QAAaC,EAAIF,IAAmB,EAC3C,EAAED,EACKE,IAAO,QAAaF,GAC3BE,EAAG,QAAQZ,GAAKJ,EAAM,KAAKI,CAAC,EAAE,MAASU,CAAK,CAEpD,CAAC,CACL,CAEA,SAASI,EACLlB,EACAmB,EACAb,EACAc,EACM,CACN,IAAMf,EAA2B,CAC7B,MAAO,EACP,OAAQ,CACZ,EACA,OAAI,UAAU,QAAU,IACpBA,EAAK,KAAOC,EACZD,EAAK,MAAQe,GAEVC,EAAarB,EAAO,SAAUK,EAAMc,CAAM,CACrD,CAEA,SAASG,GAAiBC,EAAYC,EAAoBC,GAA2B,CACjF,IAAMC,EAAgB,CAAC,EACvB,QAAST,EAAI,EAAGA,EAAIM,EAAM,OAAQN,GAAKO,EAAW,CAC9C,IAAMG,EAAaJ,EAAM,MAAMN,EAAGA,EAAIO,CAAS,EAC/CE,EAAO,KAAKC,CAAK,CACrB,CACA,OAAOD,CACX,CAEA,IAAMD,GAAqB,MAE3B,SAASf,EAAkBkB,EAAmCC,EAA6B,CACvF,GAAIA,EAAU,OAASJ,GAAoB,CACvC,IAAMC,EAAqBJ,GAAcO,CAAS,EAClD,OAAOD,EAAG,GAAGF,EAAO,IAAIC,GAASC,EAAG,GAAGD,CAAK,CAAC,CAAC,CAClD,KACI,QAAOC,EAAG,GAAGC,CAAS,CAE9B,CAEA,SAAS1B,EAAQH,EAAwD,CAErE,IAAMQ,EADkBR,EAAM,MAAM,EACF,IAAII,GAAK,CACvC,IAAME,EAA2BN,EAAM,KAAKI,CAAC,EAAE,KAC/C,OAAIE,IAAS,OACF,OAAO,UAEXA,CACX,CAAC,EAED,OAAOI,EAAkB,KAAK,IAAKF,CAAS,CAChD,CAOA,SAASsB,GAAaC,EAAiBH,EAA+C,CAClF,IAAMI,EAA6B,CAAC,IAAK,CAAC,EAAG,IAAK,CAAC,CAAC,EACpD,OAAAD,EAAW,QAAQE,GAAS,CACpBL,EAAGK,CAAK,EACRD,EAAO,IAAI,KAAKC,CAAK,EAErBD,EAAO,IAAI,KAAKC,CAAK,CAE7B,CAAC,EACMD,CACX,CAMA,SAASE,EAAQC,EAAcP,EAAgB,CAC3C,IAAMQ,EAAgB,KAAK,IAAI,EAC/B,GAAI,CACA,OAAOR,EAAG,CACd,QAAE,CACE,QAAQ,IAAIO,EAAO,WAAa,KAAK,IAAI,EAAIC,GAAS,IAAI,CAC9D,CACJ,CAEA,SAASC,EAAUF,EAAcP,EAAgB,CAC7C,OAAOA,EAAG,CACd,CAEA,IAAIU,GAAY,EAEhB,SAASC,EAASpB,EAAwB,CACtC,IAAMqB,EAAa,EAAEF,GACrB,OAAOnB,GAAU,GAAKqB,EAC1B,CAEA,SAAStC,EAAMkC,EAAeK,EAAgBC,EAAe,EAAa,CAClED,GAAS,OACTA,EAAQL,EACRA,EAAQ,GAGZ,IAAIO,EAAkC,GAAM,EAAIF,EAC5CC,EAAO,IACPC,EAAU,GAAMF,EAAS,GAG7B,IAAMvC,EAAkB,CAAC,EACzB,QAAS,EAAIkC,EAAOO,EAAO,CAAC,EAAG,GAAKD,EAChCxC,EAAM,KAAK,CAAC,EAGhB,OAAOA,CACX,CAEA,SAAS0C,EAAwCC,EAAWC,EAA4B,CACpF,IAAMC,EAAmB,CAAC,EAC1B,QAAWC,KAAOF,EACVD,EAAOG,CAAG,IAAM,SACfD,EAAiCC,CAAG,EAAIH,EAAOG,CAAG,GAI3D,OAAOD,CACX,CAEA,SAASE,EAAgBC,EAA2BC,EAElD,CACE,IAAIC,EACJ,OAAI,OAAOD,GAAe,SACtBC,EAAQC,GAAYA,EAA0BF,CAAU,EAExDC,EAAOD,EAGJ,OAAO,QAAQD,CAAG,EAAE,OAAO,CAACI,EAA2B,CAACC,EAAGnD,CAAC,KAC/DkD,EAAIC,CAAC,EAAIH,EAAKhD,EAAGmD,CAAC,EACXD,GACR,CAAC,CAAC,CACT,CAEA,SAASE,GAAaC,EAAiBC,EAAmC,CACtE,OAAOD,EAAM,OAAO,CAACH,EAA2BN,EAAK/B,KACjDqC,EAAIN,CAAG,EAAIU,EAAOzC,CAAC,EACZqC,GACR,CAAC,CAAC,CACT,CAGO,IAAMK,EAAa,KCtWnB,IAAMC,EAAU,QCYvB,IAAMC,EAAN,KAAW,CAGP,aAAc,CAFdC,GAAA,KAAQ,aAGJ,IAAMC,EAAqB,CAAC,EAC5BA,EAAS,MAAQA,EAAS,MAAQA,EAClC,KAAK,UAAYA,CACrB,CAEA,SAAgC,CAC5B,IAAMA,EAAW,KAAK,UAChBC,EAAQD,EAAS,MACvB,GAAIC,IAAUD,EACV,OAAAE,GAAOD,CAAM,EACNA,CAGf,CAEA,QAAQA,EAAuB,CAC3B,IAAMD,EAAW,KAAK,UAClBC,EAAM,OAASA,EAAM,OACrBC,GAAOD,CAAK,EAEhBA,EAAM,MAAQD,EAAS,MACvBA,EAAS,MAAO,MAAQC,EACxBD,EAAS,MAAQC,EACjBA,EAAM,MAAQD,CAClB,CAEA,UAAmB,CACf,IAAMG,EAAiB,CAAC,EAClBH,EAAW,KAAK,UAClBI,EAAOJ,EAAS,MACpB,KAAOI,IAASJ,GACZG,EAAK,KAAK,KAAK,UAAUC,EAAMC,EAAc,CAAC,EAC9CD,EAAOA,EAAM,MAEjB,MAAO,IAAMD,EAAK,KAAK,IAAI,EAAI,GACnC,CACJ,EAEA,SAASD,GAAOD,EAAuB,CACnCA,EAAM,MAAO,MAAQA,EAAM,MAC3BA,EAAM,MAAO,MAAQA,EAAM,MAC3B,OAAOA,EAAM,MACb,OAAOA,EAAM,KACjB,CAEA,SAASI,GAAeC,EAAWC,EAAqB,CACpD,GAAID,IAAM,SAAWA,IAAM,QACvB,OAAOC,CAGf,CAEA,IAAOC,GAAQV,ECxDf,IAAMW,GAAoC,IAAM,EAejC,SAARC,GAA2BC,EAAcC,EAAmC,CAC/E,GAAID,EAAM,UAAU,GAAK,EACrB,MAAO,CAAC,EAEZ,IAAME,EAAQC,GAAWH,EAAOC,GAAYH,EAAiB,EAI7D,OAHgBM,GAAYF,EAAM,MAAOA,EAAM,QAASA,EAAM,OAAO,EAGtD,QAAQG,GAAQL,EAAM,SAASK,EAAK,EAAGA,EAAK,CAAC,GAAK,CAAC,CAAC,CACvE,CAEA,SAASD,GAAYE,EAAUC,EAAiBC,EAAyB,CAtCzE,IAAAC,EAuCI,IAAIC,EAAkB,CAAC,EACjBC,EAAUJ,EAAQA,EAAQ,OAAS,CAAC,EACpCK,EAAQL,EAAQ,CAAC,EAEnBM,EACJ,KAAOP,EAAE,UAAU,GAAG,CAClB,KAAQO,EAAQD,EAAM,QAAQ,GAC1BE,EAAWR,EAAGC,EAASC,EAASK,CAAK,EAEzC,KAAQA,EAAQF,EAAQ,QAAQ,GAC5BG,EAAWR,EAAGC,EAASC,EAASK,CAAK,EAEzC,GAAIP,EAAE,UAAU,GACZ,QAASS,EAAIR,EAAQ,OAAS,EAAGQ,EAAI,EAAG,EAAEA,EAEtC,GADAF,GAAQJ,EAAAF,EAAQQ,CAAC,IAAT,YAAAN,EAAY,UAChBI,EAAO,CACPH,EAAUA,EAAQ,OAAOI,EAAWR,EAAGC,EAASC,EAASK,EAAO,EAAI,GAAK,CAAC,CAAC,EAC3E,KACJ,EAGZ,CAEA,OAAOH,CACX,CAEA,SAASI,EACLd,EACAO,EACAC,EACAK,EACAG,EACkB,CAClB,IAAMC,EAAoB,CAAC,EACrBP,EAA8BM,EAAsBC,EAAY,OAEtE,OAACjB,EAAM,QAAQa,EAAM,CAAC,GAAK,CAAC,GAAG,QAAQR,GAAQ,CAC3C,IAAMa,EAASlB,EAAM,KAAKK,CAAI,EACxBc,EAASnB,EAAM,KAAKK,EAAK,CAAC,EAE5BW,GACAC,EAAU,KAAK,CAAC,EAAGZ,EAAK,EAAG,EAAGA,EAAK,CAAC,CAAC,EAGzCc,EAAO,KAAOD,EACdE,GAAab,EAASC,EAASW,CAAM,CACzC,CAAC,GAEAnB,EAAM,SAASa,EAAM,CAAC,GAAK,CAAC,GAAG,QAAQR,GAAQ,CAC5C,IAAMa,EAASlB,EAAM,KAAKK,CAAI,EACxBgB,EAAIhB,EAAK,EACTiB,EAAStB,EAAM,KAAKqB,CAAC,EAC3BC,EAAO,IAAMJ,EACbE,GAAab,EAASC,EAASc,CAAM,CACzC,CAAC,EAEDtB,EAAM,WAAWa,EAAM,CAAC,EAEjBH,CACX,CAEA,SAASP,GAAWH,EAAcC,EAAoC,CAClE,IAAMsB,EAAW,IAAI,EACjBC,EAAQ,EACRC,EAAS,EAEbzB,EAAM,MAAM,EAAE,QAAQ0B,GAAK,CACvBH,EAAS,QAAQG,EAAG,CAAC,EAAGA,EAAG,GAAI,EAAG,IAAK,CAAC,CAAC,CAC7C,CAAC,EAID1B,EAAM,MAAM,EAAE,QAAQK,GAAQ,CAC1B,IAAMsB,EAAcJ,EAAS,KAAKlB,EAAK,EAAGA,EAAK,CAAC,GAAgB,EAC1Da,EAASjB,EAASI,CAAI,EACtBuB,EAAaD,EAAaT,EAChCK,EAAS,QAAQlB,EAAK,EAAGA,EAAK,EAAGuB,CAAU,EAC3C,IAAMC,EAAQN,EAAS,KAAKlB,EAAK,CAAC,EAC5ByB,EAAQP,EAAS,KAAKlB,EAAK,CAAC,EAClCoB,EAAS,KAAK,IAAIA,EAAQI,EAAM,KAAOX,CAAM,EAC7CM,EAAQ,KAAK,IAAIA,EAAOM,EAAM,IAAMZ,CAAM,CAC9C,CAAC,EAED,IAAMX,EAAUwB,GAAMN,EAASD,EAAQ,CAAC,EAAE,IAAI,IAAM,IAAIQ,EAAM,EACxDxB,EAAUgB,EAAQ,EAExB,OAAAD,EAAS,MAAM,EAAE,QAAQG,GAAK,CAC1BN,GAAab,EAASC,EAASe,EAAS,KAAKG,CAAC,CAAa,CAC/D,CAAC,EAEM,CAAC,MAAOH,EAAU,QAAShB,EAAS,QAASC,CAAO,CAC/D,CAEA,SAASY,GAAab,EAAiBC,EAAiBK,EAAuB,CApI/E,IAAAJ,EAAAwB,EAAAC,EAqISrB,EAAM,IAECA,EAAM,IAGdqB,EAAA3B,EAAQM,EAAM,IAAMA,EAAM,GAAKL,CAAO,IAAtC,MAAA0B,EAAyC,QAAQrB,IAFjDoB,EAAA1B,EAAQA,EAAQ,OAAS,CAAC,IAA1B,MAAA0B,EAA6B,QAAQpB,IAFrCJ,EAAAF,EAAQ,CAAC,IAAT,MAAAE,EAAY,QAAQI,EAM5B,CAEA,SAASkB,GAAMI,EAAyB,CACpC,IAAMJ,EAAkB,CAAC,EACzB,QAAShB,EAAI,EAAGA,EAAIoB,EAAOpB,IACvBgB,EAAM,KAAKhB,CAAC,EAGhB,OAAOgB,CACX,CC9IA,SAASK,GAAIC,EAAsD,EAClDA,EAAM,MAAM,EAAE,YAAc,SACnCC,GAAUD,EAAOE,EAASF,CAAK,CAAC,EAChCG,GAAOH,CAAK,GACd,QAAQI,GAAK,CACb,IAAMC,EAAQL,EAAM,KAAKI,CAAC,EAC1BJ,EAAM,WAAWI,CAAC,EAClBC,EAAM,YAAcD,EAAE,KACtBC,EAAM,SAAW,GACjBL,EAAM,QAAQI,EAAE,EAAGA,EAAE,EAAGC,EAAOC,EAAS,KAAK,CAAC,CAClD,CAAC,EAED,SAASJ,EAASK,EAA4D,CAC1E,OAAQH,GACGG,EAAE,KAAKH,CAAC,EAAG,MAE1B,CACJ,CAEA,SAASD,GAAOH,EAAwD,CACpE,IAAMQ,EAAc,CAAC,EACfC,EAAoC,CAAC,EACrCC,EAAsC,CAAC,EAE7C,SAASC,EAAIC,EAAiB,CACtB,OAAO,OAAOF,EAASE,CAAC,IAG5BF,EAAQE,CAAC,EAAI,GACbH,EAAMG,CAAC,EAAI,GACXZ,EAAM,SAASY,CAAC,EAAG,QAAQR,GAAK,CACxB,OAAO,OAAOK,EAAOL,EAAE,CAAC,EACxBI,EAAI,KAAKJ,CAAC,EAEVO,EAAIP,EAAE,CAAC,CAEf,CAAC,EACD,OAAOK,EAAMG,CAAC,EAClB,CAEA,OAAAZ,EAAM,MAAM,EAAE,QAAQW,CAAG,EAClBH,CACX,CAEA,SAASK,GAAKb,EAAsD,CAChEA,EAAM,MAAM,EAAE,QAAQI,GAAK,CACvB,IAAMC,EAAQL,EAAM,KAAKI,CAAC,EAC1B,GAAIC,EAAM,SAAU,CAChBL,EAAM,WAAWI,CAAC,EAElB,IAAMU,EAAcT,EAAM,YAC1B,OAAOA,EAAM,SACb,OAAOA,EAAM,YACbL,EAAM,QAAQI,EAAE,EAAGA,EAAE,EAAGC,EAAOS,CAAW,CAC9C,CACJ,CAAC,CACL,CCvCA,SAASC,GAAIC,EAAsD,CAC/DA,EAAM,MAAM,EAAE,YAAc,CAAC,EAC7BA,EAAM,MAAM,EAAE,QAAQC,GAAQC,GAAcF,EAAOC,CAAI,CAAC,CAC5D,CAEA,SAASC,GAAcF,EAAgDG,EAAe,CAClF,IAAIC,EAAYD,EAAE,EACdE,EAAgBL,EAAM,KAAKI,CAAC,EAAE,KAC5BE,EAAYH,EAAE,EACdI,EAAgBP,EAAM,KAAKM,CAAC,EAAE,KAC9BE,EAA2BL,EAAE,KAC7BM,EAAuBT,EAAM,KAAKG,CAAC,EACnCO,EAAgCD,EAAU,UAEhD,GAAIF,IAAUF,EAAQ,EAAG,OAEzBL,EAAM,WAAWG,CAAC,EAElB,IAAIQ,EACAC,EACAC,EACJ,IAAKA,EAAI,EAAG,EAAER,EAAOA,EAAQE,EAAO,EAAEM,EAAG,EAAER,EACvCI,EAAU,OAAS,CAAC,EACpBG,EAAQ,CACJ,MAAO,EACP,OAAQ,EACR,UAAWH,EACX,QAASN,EACT,KAAME,CACV,EACAM,EAAQG,EAAad,EAAO,OAAQY,EAAO,IAAI,EAC3CP,IAAUK,IACVE,EAAM,MAAQH,EAAU,MACxBG,EAAM,OAASH,EAAU,OACzBG,EAAM,MAAQ,aACdA,EAAM,SAAWH,EAAU,UAE/BT,EAAM,QAAQI,EAAGO,EAAO,CAAC,OAAQF,EAAU,MAAM,EAAGD,CAAI,EACpDK,IAAM,GACNb,EAAM,MAAM,EAAE,YAAa,KAAKW,CAAK,EAEzCP,EAAIO,EAGRX,EAAM,QAAQI,EAAGE,EAAG,CAAC,OAAQG,EAAU,MAAM,EAAGD,CAAI,CACxD,CAEA,SAASO,GAAKf,EAAsD,CAChEA,EAAM,MAAM,EAAE,YAAa,QAAQI,GAAK,CACpC,IAAIY,EAAkBhB,EAAM,KAAKI,CAAC,EAC5Ba,EAAuBD,EAAK,UAC9BV,EAEJ,IADAN,EAAM,QAAQgB,EAAK,QAAUC,CAAS,EAC/BD,EAAK,OACRV,EAAIN,EAAM,WAAWI,CAAC,EAAG,CAAC,EAC1BJ,EAAM,WAAWI,CAAC,EAClBa,EAAU,OAAQ,KAAK,CAAC,EAAGD,EAAK,EAAI,EAAGA,EAAK,CAAE,CAAC,EAC3CA,EAAK,QAAU,eACfC,EAAU,EAAID,EAAK,EACnBC,EAAU,EAAID,EAAK,EACnBC,EAAU,MAAQD,EAAK,MACvBC,EAAU,OAASD,EAAK,QAE5BZ,EAAIE,EACJU,EAAOhB,EAAM,KAAKI,CAAC,CAE3B,CAAC,CACL,CCjEA,SAASc,EAAYC,EAAsD,CACvE,IAAMC,EAAsC,CAAC,EAE7C,SAASC,EAAIC,EAAmB,CAC5B,IAAMC,EAAmBJ,EAAM,KAAKG,CAAC,EACrC,GAAI,OAAO,OAAOF,EAASE,CAAC,EACxB,OAAOC,EAAM,KAEjBH,EAAQE,CAAC,EAAI,GAEb,IAAME,EAAWL,EAAM,SAASG,CAAC,EAC3BG,EAA4BD,EAAWA,EAAS,IAAIE,GAClDA,GAAK,KACE,OAAO,kBAGXL,EAAIK,EAAE,CAAC,EAAIP,EAAM,KAAKO,CAAC,EAAE,MACnC,EAAI,CAAC,EAEFC,EAAeC,EAAkB,KAAK,IAAKH,CAAe,EAE9D,OAAIE,IAAS,OAAO,oBAChBA,EAAO,GAGHJ,EAAM,KAAOI,CACzB,CAEAR,EAAM,QAAQ,EAAE,QAAQE,CAAG,CAC/B,CAMA,SAASQ,EAAMV,EAAgDW,EAAoB,CAC/E,OAAOX,EAAM,KAAKW,EAAK,CAAC,EAAE,KAAQX,EAAM,KAAKW,EAAK,CAAC,EAAE,KAAQX,EAAM,KAAKW,CAAI,EAAE,MAClF,CC/CA,IAAOC,EAAQC,GA4Bf,SAASA,GAAaC,EAA6F,CAC/G,IAAMC,EAAO,IAAI,EAA4C,CAAC,SAAU,EAAK,CAAC,EAGxEC,EAAQF,EAAM,MAAM,EAC1B,GAAIE,EAAM,SAAW,EACjB,MAAM,IAAI,MAAM,mCAAmC,EAEvD,IAAMC,EAAgBD,EAAM,CAAC,EACvBE,EAAeJ,EAAM,UAAU,EACrCC,EAAK,QAAQE,EAAO,CAAC,CAAC,EAEtB,IAAIE,EACAC,EACJ,KAAOC,GAAUN,EAAMD,CAAK,EAAII,IAC5BC,EAAOG,GAAiBP,EAAMD,CAAK,EAC/B,EAACK,IACLC,EAAQL,EAAK,QAAQI,EAAK,CAAC,EAAII,EAAMT,EAAOK,CAAI,EAAI,CAACI,EAAMT,EAAOK,CAAI,EACtEK,GAAWT,EAAMD,EAAOM,CAAK,EAGjC,OAAOL,CACX,CAMA,SAASM,GAAUN,EAAmDD,EAAwD,CAC1H,SAASW,EAAIC,EAAiB,CAC1B,IAAMC,EAAYb,EAAM,UAAUY,CAAC,EAC/BC,GACAA,EAAU,QAAQC,GAAK,CACnB,IAAMC,EAAgBD,EAAE,EAClBE,EAAaJ,IAAMG,EAASD,EAAE,EAAIC,EACpC,CAACd,EAAK,QAAQe,CAAC,GAAK,CAACP,EAAMT,EAAOc,CAAC,IACnCb,EAAK,QAAQe,EAAG,CAAC,CAAC,EAClBf,EAAK,QAAQW,EAAGI,EAAG,CAAC,CAAC,EACrBL,EAAIK,CAAC,EAEb,CAAC,CAET,CAEA,OAAAf,EAAK,MAAM,EAAE,QAAQU,CAAG,EACjBV,EAAK,UAAU,CAC1B,CAMA,SAASO,GAAiBP,EAAmDD,EAA6D,CAGtI,OAFsBA,EAAM,MAAM,EAErB,OAAO,CAACiB,EAA4BZ,IAAsC,CACnF,IAAIa,EAAoB,OAAO,kBAK/B,OAJIjB,EAAK,QAAQI,EAAK,CAAC,IAAMJ,EAAK,QAAQI,EAAK,CAAC,IAC5Ca,EAAYT,EAAMT,EAAOK,CAAI,GAG7Ba,EAAYD,EAAI,CAAC,EACV,CAACC,EAAWb,CAAI,EAGpBY,CACX,EAAG,CAAC,OAAO,kBAAmB,IAAI,CAAC,EAAE,CAAC,CAC1C,CAEA,SAASP,GAAWT,EAAmDD,EAAgDM,EAAqB,CACxIL,EAAK,MAAM,EAAE,QAAQW,GAAKZ,EAAM,KAAKY,CAAC,EAAE,MAASN,CAAK,CAC1D,CC7GA,GAAM,CAAC,SAAAa,GAAU,UAAAC,EAAS,EAAIC,EAEvBC,GAAQC,EAGfA,EAAe,iBAAmBC,GAClCD,EAAe,cAAgBE,GAC/BF,EAAe,aAAeG,GAC9BH,EAAe,UAAYI,GAC3BJ,EAAe,UAAYK,GAC3BL,EAAe,cAAgBM,GAmC/B,SAASN,EAAeO,EAAsD,CAC1EA,EAAQC,GAASD,CAAgD,EACjEE,EAASF,CAAK,EAEd,IAAMG,EAAIC,EAAaJ,CAAK,EAC5BN,GAAiBS,CAAC,EAClBR,GAAcQ,EAAGH,CAAK,EAEtB,IAAIK,EACAC,EACJ,KAAQD,EAAIR,GAAUM,CAAC,GACnBG,EAAIR,GAAUK,EAAGH,EAAOK,CAAC,EACzBN,GAAcI,EAAGH,EAAOK,EAAGC,CAAC,CAEpC,CAKA,SAASX,GAAcY,EAAmDP,EAAsD,CAC5H,IAAIQ,EAAyBlB,GAAUiB,EAAMA,EAAK,MAAM,CAAC,EACzDC,EAAeA,EAAa,MAAM,EAAGA,EAAa,OAAS,CAAC,EAC5DA,EAAa,QAAQjB,GAAKkB,GAAeF,EAAMP,EAAOT,CAAC,CAAC,CAC5D,CAEA,SAASkB,GAAeF,EAAmDP,EAAgDU,EAAqB,CAE5I,IAAMC,EAD0BJ,EAAK,KAAKG,CAAK,EACf,OAC1BE,EAAOL,EAAK,KAAKG,EAAOC,CAAM,EACpCC,EAAK,SAAWhB,GAAaW,EAAMP,EAAOU,CAAK,CACnD,CAMA,SAASd,GAAaW,EAAmDP,EAAgDU,EAAuB,CAE5I,IAAMC,EAD0BJ,EAAK,KAAKG,CAAK,EACf,OAE5BG,EAAuB,GAEvBC,EAAmCd,EAAM,KAAKU,EAAOC,CAAM,EAE3DI,EAAmB,EAElBD,IACDD,EAAc,GACdC,EAAYd,EAAM,KAAKW,EAAQD,CAAK,GAGxCK,EAAWD,EAAU,OAErB,IAAME,EAAYhB,EAAM,UAAUU,CAAK,EACvC,OAAIM,GACAA,EAAU,QAAQJ,GAAQ,CACtB,IAAMK,EAAqBL,EAAK,IAAMF,EAChCQ,EAAgBD,EAAYL,EAAK,EAAIA,EAAK,EAEhD,GAAIM,IAAUP,EAAQ,CAClB,IAAMQ,EAAwBF,IAAcJ,EACtCO,EAAsBpB,EAAM,KAAKY,CAAI,EAAE,OAG7C,GADAG,GAAYI,EAAeC,EAAc,CAACA,EACtCC,GAAWd,EAAMG,EAAOQ,CAAK,EAAG,CAEhC,IAAMI,EADWf,EAAK,KAAKG,EAAOQ,CAAK,EACA,SACvCH,GAAYI,EAAe,CAACG,EAAgBA,CAChD,CACJ,CACJ,CAAC,EAGEP,CACX,CAEA,SAASrB,GAAiBa,EAAmDgB,EAAqB,CAC1F,UAAU,OAAS,IACnBA,EAAOhB,EAAK,MAAM,EAAE,CAAC,GAEzBiB,GAAgBjB,EAAM,CAAC,EAAG,EAAGgB,CAAK,CACtC,CAEA,SAASC,GAAgBjB,EAAmDkB,EAEzEC,EAAiBnC,EAAWoB,EAAyB,CACpD,IAAMgB,EAAcD,EACdE,EAAuBrB,EAAK,KAAKhB,CAAC,EAExCkC,EAAQlC,CAAC,EAAI,GACb,IAAMsC,EAAYtB,EAAK,UAAUhB,CAAC,EAClC,OAAIsC,GACAA,EAAU,QAAQC,GAAK,CACd,OAAO,OAAOL,EAASK,CAAC,IACzBJ,EAAUF,GAAgBjB,EAAMkB,EAASC,EAASI,EAAGvC,CAAC,EAE9D,CAAC,EAGLqC,EAAM,IAAMD,EACZC,EAAM,IAAMF,IACRf,EACAiB,EAAM,OAASjB,EAGf,OAAOiB,EAAM,OAGVF,CACX,CAEA,SAAS7B,GAAUU,EAAqE,CACpF,OAAOA,EAAK,MAAM,EAAE,KAAKF,GACRE,EAAK,KAAKF,CAAC,EACZ,SAAY,CAC3B,CACL,CAEA,SAASP,GAAUS,EAAmDP,EAAgDY,EAAkB,CACpI,IAAIrB,EAAYqB,EAAK,EACjBkB,EAAYlB,EAAK,EAKhBZ,EAAM,QAAQT,EAAGuC,CAAC,IACnBvC,EAAIqB,EAAK,EACTkB,EAAIlB,EAAK,GAGb,IAAMmB,EAAwBxB,EAAK,KAAKhB,CAAC,EACnCyC,EAAwBzB,EAAK,KAAKuB,CAAC,EACrCG,EAA2BF,EAC3BG,EAAgB,GAIpB,OAAIH,EAAO,IAAOC,EAAO,MACrBC,EAAYD,EACZE,EAAO,IAGgBlC,EAAM,MAAM,EAAE,OAAOY,GACrCsB,IAASC,GAAa5B,EAAMA,EAAK,KAAKK,EAAK,CAAC,EAAGqB,CAAS,GAC3DC,IAASC,GAAa5B,EAAMA,EAAK,KAAKK,EAAK,CAAC,EAAGqB,CAAS,CAC/D,EAEiB,OAAO,CAACG,EAAWxB,IAC7ByB,EAAMrC,EAAOY,CAAI,EAAIyB,EAAMrC,EAAOoC,CAAG,EAC9BxB,EAGJwB,CACV,CACL,CAEA,SAASrC,GAAcI,EAAgDmC,EAA4CjC,EAASC,EAAe,CACvI,IAAMf,EAAYc,EAAE,EACdyB,EAAYzB,EAAE,EACpBF,EAAE,WAAWZ,EAAGuC,CAAC,EACjB3B,EAAE,QAAQG,EAAE,EAAGA,EAAE,EAAG,CAAC,CAAC,EACtBZ,GAAiBS,CAAC,EAClBR,GAAcQ,EAAGmC,CAAC,EAClBC,GAAYpC,EAAGmC,CAAC,CACpB,CAEA,SAASC,GAAYpC,EAAgDmC,EAAkD,CACnH,IAAMf,EAA2BpB,EAAE,MAAM,EAAE,KAAKZ,GAErC,CADMY,EAAE,KAAKZ,CAAC,EACR,MAChB,EACD,GAAI,CAACgC,EAAM,OAEX,IAAIiB,EAAenD,GAASc,EAAG,CAACoB,CAAI,CAAC,EACrCiB,EAAKA,EAAG,MAAM,CAAC,EACfA,EAAG,QAAQjD,GAAK,CAEZ,IAAMoB,EADWR,EAAE,KAAKZ,CAAC,EACO,OAC5BqB,EAA8B0B,EAAE,KAAK/C,EAAGoB,CAAM,EAC9C8B,EAAmB,GAElB7B,IACDA,EAAO0B,EAAE,KAAK3B,EAAQpB,CAAC,EACvBkD,EAAU,IAGdH,EAAE,KAAK/C,CAAC,EAAE,KAAO+C,EAAE,KAAK3B,CAAM,EAAE,MAAS8B,EAAU7B,EAAM,OAAU,CAACA,EAAM,OAC9E,CAAC,CACL,CAKA,SAASS,GAAWd,EAAmDmC,EAAWnD,EAAoB,CAClG,OAAOgB,EAAK,QAAQmC,EAAGnD,CAAC,CAC5B,CAMA,SAAS4C,GAAa5B,EAAmDwB,EAAuBY,EAAmC,CAC/H,OAAOA,EAAU,KAAQZ,EAAO,KAAQA,EAAO,KAAQY,EAAU,GACrE,CCzPA,IAAOC,GAAQC,GAqBf,SAASA,GAAKC,EAAsD,CAChE,IAAMC,EAA8CD,EAAM,MAAM,EAAE,OAClE,GAAI,OAAOC,GAAW,WAClB,OAAQA,EAA0BD,CAAK,EAE3C,OAAQC,EAAQ,CAChB,IAAK,kBACDC,GAAqBF,CAAK,EAC1B,MACJ,IAAK,aACDG,GAAgBH,CAAK,EACrB,MACJ,IAAK,eACDI,GAAkBJ,CAAK,EACvB,MACJ,IAAK,OACD,MACJ,QACIE,GAAqBF,CAAK,CAC9B,CACJ,CAGA,IAAMI,GAAoCC,EAE1C,SAASF,GAAgBG,EAAkD,CACvED,EAAYC,CAAC,EACbC,EAAaD,CAAC,CAClB,CAEA,SAASJ,GAAqBI,EAAkD,CAC5EE,GAAeF,CAAC,CACpB,CCvDA,IAAOG,GAAQC,GAYf,SAASA,GAAkBC,EAAsD,CAC7E,IAAMC,EAAiDC,GAAUF,CAAK,EAEtEA,EAAM,MAAM,EAAE,YAAa,QAAQG,GAAK,CACpC,IAAIC,EAAkBJ,EAAM,KAAKG,CAAC,EAC5BE,EAAgBD,EAAK,QACrBE,EAAqBC,GAASP,EAAOC,EAAeI,EAAQ,EAAGA,EAAQ,CAAC,EACxEG,EAA+BF,EAAS,KACxCG,EAA0BH,EAAS,IACrCI,EAAkB,EAClBC,EAA4BH,EAAKE,CAAO,EACxCE,EAAqB,GAEzB,KAAOT,IAAME,EAAQ,GAAG,CAGpB,GAFAD,EAAOJ,EAAM,KAAKG,CAAC,EAEfS,EAAW,CACX,MAAQD,EAAQH,EAAKE,CAAO,KAAOD,GACnCT,EAAM,KAAKW,CAAM,EAAE,QAAWP,EAAK,MAC/BM,IAGAC,IAAUF,IACVG,EAAY,GAEpB,CAEA,GAAI,CAACA,EAAW,CACZ,KAAOF,EAAUF,EAAK,OAAS,GAC/BR,EAAM,KAAMQ,EAAKE,EAAU,CAAC,CAAG,EAAE,SAAYN,EAAK,MAC9CM,IAEJC,EAAQH,EAAKE,CAAO,CACxB,CAEIC,IAAU,QACVX,EAAM,UAAUG,EAAGQ,CAAK,EAE5BR,EAAIH,EAAM,WAAWG,CAAC,EAAG,CAAC,CAC9B,CACJ,CAAC,CACL,CAIA,SAASI,GACLP,EACAC,EACAE,EACAU,EACQ,CACR,IAAMC,EAAgC,CAAC,EACjCC,EAAgC,CAAC,EACjCC,EAAc,KAAK,IAAIf,EAAcE,CAAC,EAAG,IAAKF,EAAcY,CAAC,EAAG,GAAG,EACnEI,EAAc,KAAK,IAAIhB,EAAcE,CAAC,EAAG,IAAKF,EAAcY,CAAC,EAAG,GAAG,EACrEK,EAGJA,EAASf,EACT,GACIe,EAASlB,EAAM,OAAOkB,CAAM,EAC5BJ,EAAM,KAAKI,CAAM,QACZA,IACRjB,EAAciB,CAAM,EAAG,IAAMF,GAAOC,EAAMhB,EAAciB,CAAM,EAAG,MAClE,IAAMT,EAAMS,EAGRC,EAAkBN,EACtB,MAAQM,EAAUnB,EAAM,OAAOmB,CAAO,KAAiBV,GACnDM,EAAM,KAAKI,CAAO,EAGtB,MAAO,CAAC,KAAML,EAAM,OAAOC,EAAM,QAAQ,CAAC,EAAG,IAAKN,CAAG,CACzD,CAEA,SAASP,GAAUF,EAAiF,CAChG,IAAMoB,EAA0C,CAAC,EAC7CH,EAAc,EAElB,SAASI,EAAIlB,EAAiB,CAC1B,IAAMa,EAAcC,EACpBjB,EAAM,SAASG,CAAC,EAAE,QAAQkB,CAAG,EAC7BD,EAAOjB,CAAC,EAAI,CAAC,IAAKa,EAAK,IAAKC,GAAK,CACrC,CAEA,OAAAjB,EAAM,SAASsB,CAAU,EAAE,QAAQD,CAAG,EAE/BD,CACX,CCxEA,SAASG,GAAIC,EAAsD,CAC/D,IAAMC,EAAeC,EAAaF,EAAO,OAAQ,CAAC,EAAG,OAAO,EACtDG,EAAoCC,GAAWJ,CAAK,EACpDK,EAAsB,OAAO,OAAOF,CAAM,EAC1CG,EAAiBC,EAAkB,KAAK,IAAKF,CAAS,EAAI,EAC1DG,EAAkB,EAAIF,EAAS,EAErCN,EAAM,MAAM,EAAE,YAAcC,EAG5BD,EAAM,MAAM,EAAE,QAAQS,GAAKT,EAAM,KAAKS,CAAC,EAAE,QAAWD,CAAO,EAG3D,IAAME,EAAiBC,GAAWX,CAAK,EAAI,EAG3CA,EAAM,SAASY,CAAU,EAAE,QAAQC,GAASC,GAAId,EAAOC,EAAMO,EAASE,EAAQJ,EAAQH,EAAQU,CAAK,CAAC,EAIpGb,EAAM,MAAM,EAAE,eAAiBQ,CACnC,CAEA,SAASM,GACLd,EACAC,EACAO,EACAE,EACAJ,EACAH,EACAY,EACI,CA9DR,IAAAC,EA+DI,IAAMC,EAAqBjB,EAAM,SAASe,CAAC,EAC3C,GAAI,CAACE,EAAS,OAAQ,CACdF,IAAMd,GACND,EAAM,QAAQC,EAAMc,EAAG,CAAC,OAAQ,EAAG,OAAQP,CAAO,CAAC,EAEvD,MACJ,CAEA,IAAMU,EAAcC,EAAcnB,EAAO,KAAK,EACxCoB,EAAiBD,EAAcnB,EAAO,KAAK,EAC3CqB,EAAmBrB,EAAM,KAAKe,CAAC,EAErCf,EAAM,UAAUkB,EAAKH,CAAC,EACtBM,EAAM,UAAYH,EAClBlB,EAAM,UAAUoB,EAAQL,CAAC,EACzBM,EAAM,aAAeD,EAErBH,EAAS,QAAQJ,GAAS,CAhF9B,IAAAG,EAiFQF,GAAId,EAAOC,EAAMO,EAASE,EAAQJ,EAAQH,EAAQU,CAAK,EAEvD,IAAMS,EAAuBtB,EAAM,KAAKa,CAAK,EACvCU,EAAmBD,EAAU,UAAYA,EAAU,UAAYT,EAC/DW,EAAsBF,EAAU,aAAeA,EAAU,aAAeT,EACxEY,EAAqBH,EAAU,UAAYZ,EAAS,EAAIA,EACxDgB,EAAiBH,IAAaC,EAAc,EAAIlB,IAAUU,EAAAb,EAAOY,CAAC,IAAR,KAAAC,EAAa,GAAK,EAElFhB,EAAM,QAAQkB,EAAKK,EAAU,CACzB,OAAQE,EACR,OAAQC,EACR,YAAa,EACjB,CAAC,EAED1B,EAAM,QAAQwB,EAAaJ,EAAQ,CAC/B,OAAQK,EACR,OAAQC,EACR,YAAa,EACjB,CAAC,CACL,CAAC,EAEI1B,EAAM,OAAOe,CAAC,GACff,EAAM,QAAQC,EAAMiB,EAAK,CAAC,OAAQ,EAAG,OAAQZ,IAAUU,EAAAb,EAAOY,CAAC,IAAR,KAAAC,EAAa,EAAE,CAAC,CAE/E,CAEA,SAASZ,GAAWJ,EAA2E,CAC3F,IAAMG,EAAoC,CAAC,EAE3C,SAASW,EAAIC,EAAWY,EAAqB,CACzC,IAAMV,EAAqBjB,EAAM,SAASe,CAAC,EACvCE,GAAYA,EAAS,QACrBA,EAAS,QAAQJ,GAASC,EAAID,EAAOc,EAAQ,CAAC,CAAC,EAEnDxB,EAAOY,CAAC,EAAIY,CAChB,CAEA,OAAA3B,EAAM,SAASY,CAAU,EAAE,QAAQG,GAAKD,EAAIC,EAAG,CAAC,CAAC,EAC1CZ,CACX,CAEA,SAASQ,GAAWX,EAAwD,CACxE,OAAOA,EAAM,MAAM,EAAE,OAAO,CAAC4B,EAAKnB,IAAMmB,EAAM5B,EAAM,KAAKS,CAAC,EAAE,OAAS,CAAC,CAC1E,CAEA,SAASoB,GAAQ7B,EAAsD,CACnE,IAAM8B,EAAyB9B,EAAM,MAAM,EAC3CA,EAAM,WAAW8B,EAAW,WAAY,EACxC,OAAOA,EAAW,YAClB9B,EAAM,MAAM,EAAE,QAAQS,GAAK,CACCT,EAAM,KAAKS,CAAC,EAC3B,aACLT,EAAM,WAAWS,CAAC,CAE1B,CAAC,CACL,CCrIA,IAAOsB,GAAQC,GAEf,SAASA,GAAkBC,EAAsD,CAC7E,SAASC,EAAIC,EAAiB,CAC1B,IAAMC,EAAqBH,EAAM,SAASE,CAAC,EACrCE,EAAOJ,EAAM,KAAKE,CAAC,EAKzB,GAJIC,EAAS,QACTA,EAAS,QAAQF,CAAG,EAGpB,OAAO,OAAOG,EAAM,SAAS,EAAG,CAChCA,EAAK,WAAa,CAAC,EACnBA,EAAK,YAAc,CAAC,EACpB,QAASC,EAAeD,EAAK,QAAUE,EAAkBF,EAAK,QAAW,EACrEC,EAAOC,EACP,EAAED,EACFE,GAAcP,EAAO,aAAc,MAAOE,EAAGE,EAAMC,CAAI,EACvDE,GAAcP,EAAO,cAAe,MAAOE,EAAGE,EAAMC,CAAI,CAEhE,CACJ,CAEAL,EAAM,SAASQ,CAAU,EAAE,QAAQP,CAAG,CAC1C,CAEA,SAASM,GACLP,EACAS,EACAC,EACAC,EACAC,EACAP,EACI,CACJ,IAAMQ,EAA4B,CAAC,MAAO,EAAG,OAAQ,EAAG,KAAMR,EAAM,WAAYI,CAAI,EAC9EK,EAA4BF,EAAOH,CAAI,EAAeJ,EAAO,CAAC,EAC9DU,EAAeC,EAAahB,EAAO,SAAUa,EAAOH,CAAM,EAC/DE,EAAOH,CAAI,EAAeJ,CAAI,EAAIU,EACnCf,EAAM,UAAUe,EAAMJ,CAAE,EACpBG,GACAd,EAAM,QAAQc,EAAMC,EAAM,CAAC,OAAQ,CAAC,CAAC,CAE7C,CC1CO,SAASE,GAAOC,EAAoB,CAF3C,IAAAC,EAGI,IAAMC,GAAWD,EAAAD,EAAM,MAAM,EAAiB,UAA7B,YAAAC,EAAsC,eACnDC,IAAY,MAAQA,IAAY,OAChCC,GAAgBH,CAAK,CAE7B,CAEO,SAASI,GAAKJ,EAAoB,CATzC,IAAAC,EAUI,IAAMC,GAAWD,EAAAD,EAAM,MAAM,EAAiB,UAA7B,YAAAC,EAAsC,eACnDC,IAAY,MAAQA,IAAY,OAChCG,GAASL,CAAK,GAGdE,IAAY,MAAQA,IAAY,QAChCI,GAAON,CAAK,EACZG,GAAgBH,CAAK,EAE7B,CAEA,SAASG,GAAgBH,EAAoB,CACzCA,EAAM,MAAM,EAAE,QAAQO,GAAQC,GAAmBR,EAAM,KAAKO,CAAI,CAAc,CAAC,EAC/EP,EAAM,MAAM,EAAE,QAAQS,GAAQD,GAAmBR,EAAM,KAAKS,CAAI,CAAc,CAAC,CACnF,CAEA,SAASD,GAAmBE,EAAoC,CAC5D,IAAMC,EAAID,EAAM,MAChBA,EAAM,MAAQA,EAAM,OACpBA,EAAM,OAASC,CACnB,CAEA,SAASN,GAASL,EAAoB,CAClCA,EAAM,MAAM,EAAE,QAAQO,GAAQK,GAAYZ,EAAM,KAAKO,CAAI,CAAc,CAAC,EAExEP,EAAM,MAAM,EAAE,QAAQS,GAAQ,CAnClC,IAAAR,EAoCQ,IAAMY,EAAYb,EAAM,KAAKS,CAAI,GACjCR,EAAAY,EAAU,SAAV,MAAAZ,EAAkB,QAAQW,IACtB,OAAO,OAAOC,EAAW,GAAG,GAC5BD,GAAYC,CAAS,CAE7B,CAAC,CACL,CAEA,SAASD,GAAYF,EAA4C,CAC7DA,EAAM,EAAI,CAACA,EAAM,CACrB,CAEA,SAASJ,GAAON,EAAoB,CAChCA,EAAM,MAAM,EAAE,QAAQO,GAAQO,GAAUd,EAAM,KAAKO,CAAI,CAAc,CAAC,EAEtEP,EAAM,MAAM,EAAE,QAAQS,GAAQ,CAnDlC,IAAAR,EAoDQ,IAAMY,EAAYb,EAAM,KAAKS,CAAI,GACjCR,EAAAY,EAAU,SAAV,MAAAZ,EAAkB,QAAQa,IACtB,OAAO,OAAOD,EAAW,GAAG,GAC5BC,GAAUD,CAAS,CAE3B,CAAC,CACL,CAEA,SAASC,GAAUJ,EAA4C,CAC3D,IAAMK,EAAIL,EAAM,EAChBA,EAAM,EAAIA,EAAM,EAChBA,EAAM,EAAIK,CACd,CClDe,SAARC,GAA2BC,EAA0B,CACxD,IAAMC,EAAsC,CAAC,EACvCC,EAAcF,EAAM,MAAM,EAAE,OAAOG,GAAK,CAACH,EAAM,SAASG,CAAC,EAAE,MAAM,EACjEC,EAAmBF,EAAY,IAAIC,GAAKH,EAAM,KAAKG,CAAC,EAAE,IAAI,EAC1DE,EAAeC,EAAkB,KAAK,IAAKF,CAAgB,EAC3DG,EAA0BC,EAAMH,EAAU,CAAC,EAAE,IAAI,IAAM,CAAC,CAAC,EAE/D,SAASI,EAAIN,EAAiB,CAC1B,GAAIF,EAAQE,CAAC,EAAG,OAChBF,EAAQE,CAAC,EAAI,GACb,IAAMO,EAAOV,EAAM,KAAKG,CAAC,EACzBI,EAAOG,EAAK,IAAI,EAAG,KAAKP,CAAC,EACzB,IAAMQ,EAAaX,EAAM,WAAWG,CAAC,EACjCQ,GACAA,EAAW,QAAQF,CAAG,CAE9B,CAGA,OADkBP,EAAY,KAAK,CAACU,EAAGC,IAAMb,EAAM,KAAKY,CAAC,EAAE,KAAOZ,EAAM,KAAKa,CAAC,EAAE,IAAI,EAC1E,QAAQJ,CAAG,EAEdF,CACX,CCjBe,SAARO,GAA4BC,EAAcC,EAA8B,CAC3E,IAAIC,EAAK,EACT,QAASC,EAAI,EAAGA,EAAIF,EAAS,OAAQ,EAAEE,EACnCD,GAAME,GAAmBJ,EAAOC,EAASE,EAAI,CAAC,EAAIF,EAASE,CAAC,CAAE,EAElE,OAAOD,CACX,CAOA,SAASE,GAAmBJ,EAAcK,EAAsBC,EAA8B,CAI1F,IAAMC,EAAsCC,GAAUF,EAAYA,EAAW,IAAI,CAACG,EAAGN,IAAMA,CAAC,CAAC,EACvFO,EAA6BL,EAAW,QAAQI,GAAK,CACvD,IAAME,EAAQX,EAAM,SAASS,CAAC,EAC9B,OAAKE,EACEA,EAAM,IAAIC,IACN,CAAC,IAAKL,EAASK,EAAE,CAAC,EAAI,OAAQZ,EAAM,KAAKY,CAAC,EAAE,MAAM,EAC5D,EAAE,KAAK,CAACC,EAAGC,IAAMD,EAAE,IAAMC,EAAE,GAAG,EAHZ,CAAC,CAIxB,CAAC,EAGGC,EAAa,EACjB,KAAOA,EAAaT,EAAW,QAAQS,IAAe,EACtD,IAAMC,EAAW,EAAID,EAAa,EAClCA,GAAc,EACd,IAAME,EAAO,IAAI,MAAMD,CAAQ,EAAE,KAAK,CAAC,EAGnCd,EAAK,EACT,OAAAQ,EAAa,QAASQ,GAAsB,CACxC,IAAIC,EAAQD,EAAM,IAAMH,EACxBE,EAAKE,CAAK,GAAKD,EAAM,OACrB,IAAIE,EAAY,EAChB,KAAOD,EAAQ,GACPA,EAAQ,IACRC,GAAaH,EAAKE,EAAQ,CAAC,GAE/BA,EAASA,EAAQ,GAAM,EACvBF,EAAKE,CAAK,GAAKD,EAAM,OAEzBhB,GAAMgB,EAAM,OAASE,CACzB,CAAC,EAEMlB,CACX,CC7De,SAARmB,GAA4BC,EAAcC,EAAoB,CAAC,EAAsB,CACxF,OAAOA,EAAQ,IAAIC,GAAK,CACpB,IAAMC,EAAMH,EAAM,QAAQE,CAAC,EAC3B,GAAI,CAACC,GAAO,CAACA,EAAI,OACb,MAAO,CAAC,EAAGD,CAAC,EACT,CACH,IAAME,EAASD,EAAI,OAAO,CAACE,EAAKC,IAAM,CAClC,IAAMC,EAAOP,EAAM,KAAKM,CAAC,EACnBE,EAAQR,EAAM,KAAKM,EAAE,CAAC,EAC5B,MAAO,CACH,IAAKD,EAAI,IAAOE,EAAK,OAASC,EAAM,MACpC,OAAQH,EAAI,OAASE,EAAK,MAC9B,CACJ,EAAG,CAAC,IAAK,EAAG,OAAQ,CAAC,CAAC,EAEtB,MAAO,CACH,EAAGL,EACH,WAAYE,EAAO,IAAMA,EAAO,OAChC,OAAQA,EAAO,MACnB,CACJ,CACJ,CAAC,CACL,CCuBe,SAARK,GAAkCC,EAA4BC,EAAyC,CAC1G,IAAMC,EAAgD,CAAC,EACvDF,EAAQ,QAAQ,CAACG,EAAO,IAAM,CAC1B,IAAMC,EAAmB,CACrB,SAAU,EACV,GAAM,CAAC,EACP,IAAK,CAAC,EACN,GAAI,CAACD,EAAM,CAAC,EACZ,CACJ,EACIA,EAAM,aAAe,SACrBC,EAAI,WAAaD,EAAM,WACvBC,EAAI,OAASD,EAAM,QAEvBD,EAAcC,EAAM,CAAC,EAAIC,CAC7B,CAAC,EAEDH,EAAgB,MAAM,EAAE,QAAQI,GAAK,CACjC,IAAMC,EAASJ,EAAcG,EAAE,CAAC,EAC1BE,EAASL,EAAcG,EAAE,CAAC,EAC5BC,IAAW,QAAaC,IAAW,SACnCA,EAAO,WACPD,EAAO,IAAI,KAAKC,CAAM,EAE9B,CAAC,EAED,IAAMC,EAAY,OAAO,OAAON,CAAa,EAAE,OAAOC,GAAS,CAACA,EAAM,QAAQ,EAE9E,OAAOM,GAAmBD,CAAS,CACvC,CAEA,SAASC,GAAmBD,EAA2C,CACnE,IAAMR,EAAyB,CAAC,EAEhC,SAASU,EAASC,EAAoD,CAClE,OAAQC,GAAwB,CACxBA,EAAO,SAGPA,EAAO,aAAe,QACtBD,EAAO,aAAe,QACtBC,EAAO,YAAcD,EAAO,aAC5BE,GAAaF,EAAQC,CAAM,CAEnC,CACJ,CAEA,SAASE,EAAUH,EAAoD,CACnE,OAAQI,GAAwB,CAC5BA,EAAO,GAAM,KAAKJ,CAAM,EACpB,EAAEI,EAAO,WAAa,GACtBP,EAAU,KAAKO,CAAM,CAE7B,CACJ,CAEA,KAAOP,EAAU,QAAQ,CACrB,IAAML,EAAQK,EAAU,IAAI,EAC5BR,EAAQ,KAAKG,CAAK,EAClBA,EAAM,GAAM,QAAQ,EAAE,QAAQO,EAASP,CAAK,CAAC,EAC7CA,EAAM,IAAI,QAAQW,EAAUX,CAAK,CAAC,CACtC,CAEA,OAAOH,EAAQ,OAAOG,GAAS,CAACA,EAAM,MAAM,EAAE,IAAIA,GAClCa,EAAKb,EAAO,CAAC,KAAM,IAAK,aAAc,QAAQ,CAAC,CAC9D,CACL,CAEA,SAASU,GAAaI,EAAqBC,EAA2B,CAClE,IAAIC,EAAM,EACNC,EAAS,EAETH,EAAO,SACPE,GAAOF,EAAO,WAAcA,EAAO,OACnCG,GAAUH,EAAO,QAGjBC,EAAO,SACPC,GAAOD,EAAO,WAAcA,EAAO,OACnCE,GAAUF,EAAO,QAGrBD,EAAO,GAAKC,EAAO,GAAG,OAAOD,EAAO,EAAE,EACtCA,EAAO,WAAaE,EAAMC,EAC1BH,EAAO,OAASG,EAChBH,EAAO,EAAI,KAAK,IAAIC,EAAO,EAAGD,EAAO,CAAC,EACtCC,EAAO,OAAS,EACpB,CC7He,SAARG,GAAsBC,EAAsBC,EAAiC,CAChF,IAAMC,EAAaC,GAAUH,EAASI,GAC3B,OAAO,OAAOA,EAAO,YAAY,CAC3C,EACKC,EAAWH,EAAM,IACjBI,EAAaJ,EAAM,IAAI,KAAK,CAACK,EAAGC,IAAMA,EAAE,EAAID,EAAE,CAAC,EAC/CE,EAAiB,CAAC,EACpBC,EAAM,EACNC,EAAS,EACTC,EAAU,EAEdP,EAAS,KAAKQ,GAAgB,CAAC,CAACZ,CAAS,CAAC,EAE1CW,EAAUE,GAAkBL,EAAIH,EAAYM,CAAO,EAEnDP,EAAS,QAAQD,GAAS,CACtBQ,GAAWR,EAAM,GAAG,OACpBK,EAAG,KAAKL,EAAM,EAAE,EAChBM,GAAON,EAAM,WAAcA,EAAM,OACjCO,GAAUP,EAAM,OAChBQ,EAAUE,GAAkBL,EAAIH,EAAYM,CAAO,CACvD,CAAC,EAED,IAAMG,EAAqB,CAAC,GAAIN,EAAG,KAAK,CAAC,CAAa,EACtD,OAAIE,IACAI,EAAO,WAAaL,EAAMC,EAC1BI,EAAO,OAASJ,GAEbI,CACX,CAEA,SAASD,GAAkBL,EAAgBH,EAAyBU,EAAuB,CACvF,IAAIC,EACJ,KAAOX,EAAW,SAAWW,EAAOX,EAAWA,EAAW,OAAS,CAAC,GAAI,GAAKU,GACzEV,EAAW,IAAI,EACfG,EAAG,KAAKQ,EAAM,EAAE,EAChBD,IAEJ,OAAOA,CACX,CAEA,SAASH,GAAgBK,EAAiE,CACtF,MAAO,CAACC,EAAmBC,IACnBD,EAAO,WAAcC,EAAO,WACrB,GACAD,EAAO,WAAcC,EAAO,WAC5B,EAGHF,EAA6BE,EAAO,EAAID,EAAO,EAAxCA,EAAO,EAAIC,EAAO,CAEzC,CCjDe,SAARC,EAA8BC,EAAcC,EAAWC,EAAwBC,EAAqC,CACvH,IAAIC,EAAUJ,EAAM,SAASC,CAAC,EACxBI,EAAOL,EAAM,KAAKC,CAAC,EACnBK,EAAyBD,EAAQA,EAAK,WAAc,OACpDE,EAAyBF,EAAQA,EAAK,YAAe,OACrDG,EAA+C,CAAC,EAElDF,IACAF,EAAUA,EAAQ,OAAOK,GAAKA,IAAMH,GAAMG,IAAMF,CAAE,GAGtD,IAAMG,EAAcC,GAAWX,EAAOI,CAAO,EAC7CM,EAAY,QAAQE,GAAS,CACzB,GAAIZ,EAAM,SAASY,EAAM,CAAC,EAAE,OAAQ,CAChC,IAAMC,EAAiBd,EAAaC,EAAOY,EAAM,EAAGV,EAAiBC,CAAS,EAC9EK,EAAUI,EAAM,CAAC,EAAIC,EACjB,OAAO,OAAOA,EAAgB,YAAY,GAC1CC,GAAiBF,EAAOC,CAAc,CAE9C,CACJ,CAAC,EAED,IAAME,EAAUC,GAAiBN,EAAaR,CAAe,EAC7De,GAAgBF,EAASP,CAAS,EAElC,IAAMU,EAASC,GAAKJ,EAASZ,CAAS,EAEtC,GAAIG,GAAMC,EAAI,CACVW,EAAO,GAAK,CAACZ,EAAIY,EAAO,GAAIX,CAAE,EAAE,KAAK,CAAC,EACtC,IAAMa,EAAiBpB,EAAM,aAAaM,CAAE,EAC5C,GAAIc,GAAkBA,EAAe,OAAQ,CACzC,IAAMC,EAASrB,EAAM,KAAKoB,EAAe,CAAC,CAAE,EACtCE,EAAiBtB,EAAM,aAAaO,CAAE,EACtCgB,EAASvB,EAAM,KAAKsB,EAAgB,CAAC,CAAE,EACxC,OAAO,OAAOJ,EAAQ,YAAY,IACnCA,EAAO,WAAa,EACpBA,EAAO,OAAS,GAEpBA,EAAO,YAAcA,EAAO,WAAcA,EAAO,OAC7CG,EAAO,MAASE,EAAO,QAAWL,EAAO,OAAU,GACvDA,EAAO,QAAW,CACtB,CACJ,CAEA,OAAOA,CACX,CAEA,SAASD,GAAgBF,EAA6BP,EAAoD,CACtGO,EAAQ,QAAQH,GAAS,CACrBA,EAAM,GAAKA,EAAM,GAAG,QAAQX,GACpBO,EAAUP,CAAC,EACJO,EAAUP,CAAC,EAAE,GAEjBA,CACV,CACL,CAAC,CACL,CAEA,SAASa,GAAiBU,EAAyBC,EAA6B,CACxED,EAAO,aAAe,QACtBA,EAAO,YAAcA,EAAO,WAAaA,EAAO,OACxCC,EAAM,WAAcA,EAAM,SAC7BD,EAAO,OAAUC,EAAM,QAC5BD,EAAO,QAAWC,EAAM,SAExBD,EAAO,WAAaC,EAAM,WAC1BD,EAAO,OAASC,EAAM,OAE9B,CC7Ce,SAARC,GACHC,EACAC,EACAC,EACAC,EACS,CACJA,IACDA,EAAgBH,EAAM,MAAM,GAEhC,IAAMI,EAAOC,GAAeL,CAAK,EAC3BM,EAAS,IAAI,EAAM,CAAC,SAAU,EAAI,CAAC,EACpC,SAAS,CAAC,KAAMF,CAAI,CAAoB,EACxC,oBAAqBG,GAAcP,EAAM,KAAKO,CAAC,CAAC,EAErD,OAAAJ,EAAc,QAASI,GAAc,CACjC,IAAMC,EAAOR,EAAM,KAAKO,CAAC,EACnBE,EAAST,EAAM,OAAOO,CAAC,EAE7B,GAAIC,EAAK,OAASP,GAAQO,EAAK,SAAYP,GAAQA,GAAQO,EAAK,QAAU,CACtEF,EAAO,QAAQC,CAAC,EAChBD,EAAO,UAAUC,EAAGE,GAAUL,CAAI,EAGlC,IAAMM,EAAQV,EAAME,CAAY,EAAEK,CAAC,EAC/BG,GACAA,EAAM,QAAQC,GAAK,CACf,IAAMC,EAAID,EAAE,IAAMJ,EAAII,EAAE,EAAIA,EAAE,EACxBE,EAAOP,EAAO,KAAKM,EAAGL,CAAC,EACvBO,EAASD,IAAS,OAAYA,EAAK,OAAS,EAClDP,EAAO,QAAQM,EAAGL,EAAG,CAAC,OAAQP,EAAM,KAAKW,CAAC,EAAE,OAASG,CAAM,CAAC,CAChE,CAAC,EAGD,OAAO,OAAON,EAAM,SAAS,GAC7BF,EAAO,QAAQC,EAAG,CACd,WAAYC,EAAK,WAAYP,CAAI,EACjC,YAAaO,EAAK,YAAaP,CAAI,CACvC,CAAC,CAET,CACJ,CAAC,EAEMK,CACX,CAEA,SAASD,GAAeL,EAA0B,CAC9C,IAAIO,EACJ,KAAOP,EAAM,QAASO,EAASQ,EAAS,OAAO,CAAE,GAAG,CACpD,OAAOR,CACX,CCvFe,SAARS,GAAwCC,EAAcC,EAAwBC,EAAoB,CACrG,IAAMC,EAAkC,CAAC,EACrCC,EAEJF,EAAG,QAAQG,GAAK,CACZ,IAAIC,EAAmCN,EAAM,OAAOK,CAAC,EACjDE,EACAC,EACJ,KAAOF,GAAO,CASV,GARAC,EAASP,EAAM,OAAOM,CAAK,EACvBC,GACAC,EAAYL,EAAKI,CAAM,EACvBJ,EAAKI,CAAM,EAAID,IAEfE,EAAYJ,EACZA,EAAWE,GAEXE,GAAaA,IAAcF,EAAO,CAClCL,EAAgB,QAAQO,EAAWF,CAAK,EACxC,MACJ,CACAA,EAAQC,CACZ,CACJ,CAAC,CAyBL,CCpBe,SAARE,EAAuBC,EAAkBC,EAAqB,CAAC,EAAS,CAC3E,GAAI,OAAOA,EAAK,aAAgB,WAAY,CACxCA,EAAK,YAAYD,EAAOD,CAAK,EAC7B,MACJ,CAEA,IAAMG,EAAeA,EAAQF,CAAK,EAC5BG,EAAkBC,GAAiBJ,EAAYK,EAAM,EAAGH,EAAU,CAAC,EAAG,SAAS,EAC/EI,EAAgBF,GAAiBJ,EAAYK,EAAMH,EAAU,EAAG,GAAI,EAAE,EAAG,UAAU,EAErFK,EAAWC,GAAUR,CAAK,EAG9B,GAFAS,GAAYT,EAAOO,CAAQ,EAEvBN,EAAK,6BACL,OAGJ,IAAIS,EAAS,OAAO,kBAChBC,EAEEC,EAAcX,EAAK,aAAe,CAAC,EACzC,QAASY,EAAI,EAAGC,EAAW,EAAGA,EAAW,EAAG,EAAED,EAAG,EAAEC,EAAU,CACzDC,GAAiBF,EAAI,EAAIV,EAAkBG,EAAeO,EAAI,GAAK,EAAGD,CAAW,EAEjFL,EAAgBS,EAAiBhB,CAAK,EACtC,IAAMiB,EAAKC,GAAWlB,EAAOO,CAAQ,EACjCU,EAAKP,GACLI,EAAW,EACXH,EAAO,OAAO,OAAO,CAAC,EAAGJ,CAAQ,EACjCG,EAASO,GACFA,IAAOP,IACdC,EAAO,gBAAgBJ,CAAQ,EAEvC,CAEAE,GAAYT,EAAOW,CAAK,CAC5B,CAEA,SAASP,GAAiBJ,EAAkBmB,EAAiBC,EAAmD,CAI5G,IAAMC,EAAc,IAAI,IAClBC,EAAgB,CAACC,EAAcC,IAAuB,CACnDH,EAAY,IAAIE,CAAI,GACrBF,EAAY,IAAIE,EAAM,CAAC,CAAC,EAE5BF,EAAY,IAAIE,CAAI,EAAG,KAAKC,CAAI,CACpC,EAIA,QAAWC,KAAKzB,EAAM,MAAM,EAAG,CAC3B,IAAMwB,EAAOxB,EAAM,KAAKyB,CAAC,EAMzB,GALI,OAAOD,EAAK,MAAS,UACrBF,EAAcE,EAAK,KAAMC,CAAC,EAI1B,OAAOD,EAAK,SAAY,UAAY,OAAOA,EAAK,SAAY,SAC5D,QAASE,EAAIF,EAAK,QAASE,GAAKF,EAAK,QAASE,IACtCA,IAAMF,EAAK,MAEXF,EAAcI,EAAGD,CAAC,CAIlC,CAEA,OAAON,EAAM,IAAI,SAAUI,EAAM,CAC7B,OAAOI,GAAgB3B,EAAOuB,EAAMH,EAAcC,EAAY,IAAIE,CAAI,GAAK,CAAC,CAAC,CACjF,CAAC,CACL,CAEA,SAASR,GAAiBa,EAA0BC,EAAoBjB,EAAsC,CAC1G,IAAMkB,EAAK,IAAI,EACfF,EAAY,QAAQ,SAAUG,EAAI,CAC9BnB,EAAY,QAAQoB,GAAOF,EAAG,QAAQE,EAAI,KAAMA,EAAI,KAAK,CAAC,EAE1D,IAAMC,EAAQF,EAAG,MAAM,EAAuB,KACxCG,EAASC,EAAaJ,EAAIE,EAAMH,EAAID,CAAS,EACnDK,EAAO,GAAG,QAAQ,CAACT,EAAGZ,IAAMkB,EAAG,KAAKN,CAAC,EAAE,MAAQZ,CAAC,EAChDuB,GAAuBL,EAAID,EAAII,EAAO,EAAE,CAC5C,CAAC,CACL,CAEA,SAASzB,GAAYT,EAAkBO,EAA4B,CAC/D,OAAO,OAAOA,CAAQ,EAAE,QAAQ8B,GAASA,EAAM,QAAQ,CAACZ,EAAGZ,IAAMb,EAAM,KAAKyB,CAAC,EAAE,MAAQZ,CAAC,CAAC,CAC7F,CC1EA,SAASyB,GAAmBC,EAAgDC,EAAiC,CACzG,IAAMC,EAAuB,CAAC,EAE9B,SAASC,EAAWC,EAAqBC,EAA2B,CAChE,IAGIC,EAAK,EAGLC,EAAU,EACRC,EAAkBJ,EAAU,OAC9BK,EAAWJ,EAAMA,EAAM,OAAS,CAAC,EAErC,OAAAA,EAAM,QAAQ,CAACK,EAAGC,IAAM,CACpB,IAAMC,EAAwBC,GAA0Bb,EAAOU,CAAC,EAC1DI,EAAaF,EAAIZ,EAAM,KAAKY,CAAC,EAAE,MAASJ,GAE1CI,GAAKF,IAAMD,KACXJ,EAAM,MAAME,EAASI,EAAI,CAAC,EAAE,QAAQI,GAAY,CAC5C,IAAMC,EAAQhB,EAAM,aAAae,CAAQ,EACrCC,GACAA,EAAM,QAAQC,GAAK,CACf,IAAMC,EAASlB,EAAM,KAAKiB,CAAC,EACrBE,EAAeD,EAAO,OACvBC,EAAOb,GAAMQ,EAAKK,IACnB,EAAED,EAAO,OAAUlB,EAAM,KAAKe,CAAQ,EAAgB,QACtDK,GAAYlB,EAAWe,EAAGF,CAAQ,CAE1C,CAAC,CAET,CAAC,EACDR,EAAUI,EAAI,EACdL,EAAKQ,EAEb,CAAC,EAEMT,CACX,CAEA,OAAIJ,EAAS,QACTA,EAAS,OAAOE,CAAU,EAGvBD,CACX,CAEA,SAASmB,GAAmBrB,EAAgDC,EAAiC,CACzG,IAAMC,EAAuB,CAAC,EAE9B,SAASoB,EAAKC,EAAiBC,EAAkBC,EAAkBC,EAAyBC,EAA+B,CAClHC,EAAMJ,EAAUC,CAAQ,EAAE,QAAQd,GAAK,CACxC,IAAMD,EAAIa,EAAMZ,CAAC,EACjB,GAAID,IAAM,QACLV,EAAM,KAAKU,CAAC,EAAgB,MAAO,CACpC,IAAMM,EAAQhB,EAAM,aAAaU,CAAC,EAC9BM,GACAA,EAAM,QAAQC,GAAK,CACf,GAAIA,IAAM,OAAW,OACrB,IAAMY,EAAQ7B,EAAM,KAAKiB,CAAC,EACtBY,EAAM,QACLA,EAAM,MAASH,GAAmBG,EAAM,MAASF,IAClDP,GAAYlB,EAAWe,EAAGP,CAAC,CAEnC,CAAC,CAET,CACJ,CAAC,CACL,CAGA,SAASP,EAAW2B,EAAiBP,EAA2B,CAC5D,IAAIQ,EAAe,GACfC,EAAe,GACfR,EAAW,EAEf,OAAAD,EAAM,QAAQ,CAACb,EAAGuB,IAAmB,CACjC,GAAKjC,EAAM,KAAKU,CAAC,EAAgB,QAAU,SAAU,CACjD,IAAMwB,EAAelC,EAAM,aAAaU,CAAC,EACzC,GAAIwB,GAAgBA,EAAa,OAAQ,CACrC,IAAMC,EAAYD,EAAa,CAAC,EAChC,GAAIC,IAAc,OAAW,OAC7BH,EAAgBhC,EAAM,KAAKmC,CAAS,EAAgB,MACpDb,EAAKC,EAAOC,EAAUS,EAAgBF,EAAcC,CAAY,EAChER,EAAWS,EACXF,EAAeC,CACnB,CACJ,CACAV,EAAKC,EAAOC,EAAUD,EAAM,OAAQS,EAAcF,EAAM,MAAM,CAClE,CAAC,EAEMP,CACX,CAEA,OAAItB,EAAS,QACTA,EAAS,OAAOE,CAAU,EAGvBD,CACX,CAEA,SAASW,GAA0Bb,EAAgDU,EAA+B,CAC9G,GAAKV,EAAM,KAAKU,CAAC,EAAgB,MAAO,CACpC,IAAMM,EAAQhB,EAAM,aAAaU,CAAC,EAClC,GAAIM,EACA,OAAOA,EAAM,KAAKC,GAAMjB,EAAM,KAAKiB,CAAC,EAAgB,KAAK,CAEjE,CAEJ,CAEA,SAASG,GAAYlB,EAAsBQ,EAAWE,EAAiB,CACnE,GAAIF,EAAIE,EAAG,CACP,IAAMwB,EAAM1B,EACZA,EAAIE,EACJA,EAAIwB,CACR,CAEA,IAAIC,EAAanC,EAAUQ,CAAC,EACvB2B,IACDnC,EAAUQ,CAAC,EAAI2B,EAAa,CAAC,GAEjCA,EAAWzB,CAAC,EAAI,EACpB,CAEA,SAAS0B,GAAYpC,EAAsBQ,EAAWE,EAAoB,CACtE,GAAIF,EAAIE,EAAG,CACP,IAAMwB,EAAM1B,EACZA,EAAIE,EACJA,EAAIwB,CACR,CACA,IAAMC,EAAanC,EAAUQ,CAAC,EAC9B,OAAO2B,IAAe,QAAa,OAAO,OAAOA,EAAYzB,CAAC,CAClE,CAUA,SAAS2B,GACLvC,EACAC,EACAC,EACAsC,EACe,CACf,IAAMC,EAAkC,CAAC,EACnCC,EAAmC,CAAC,EACpCC,EAAmB,CAAC,EAK1B,OAAA1C,EAAS,QAAQI,GAAS,CACtBA,EAAM,QAAQ,CAACK,EAAGkC,IAAU,CACxBH,EAAK/B,CAAC,EAAIA,EACVgC,EAAMhC,CAAC,EAAIA,EACXiC,EAAIjC,CAAC,EAAIkC,CACb,CAAC,CACL,CAAC,EAED3C,EAAS,QAAQI,GAAS,CACtB,IAAIwC,EAAU,GACdxC,EAAM,QAAQK,GAAK,CACf,IAAMoC,EAAQN,EAAW9B,CAAC,EAC1B,GAAIoC,GAASA,EAAM,OAAQ,CACvB,IAAMC,EAAeD,EAAM,KAAK,CAACE,EAAGC,IAAM,CACtC,IAAMC,EAAOP,EAAIK,CAAC,EACZG,EAAOR,EAAIM,CAAC,EAClB,OAAQC,IAAS,OAAYA,EAAO,IAAMC,IAAS,OAAYA,EAAO,EAC1E,CAAC,EACKC,GAAcL,EAAG,OAAS,GAAK,EACrC,QAASpC,EAAI,KAAK,MAAMyC,CAAE,EAAGC,EAAK,KAAK,KAAKD,CAAE,EAAGzC,GAAK0C,EAAI,EAAE1C,EAAG,CAC3D,IAAMC,EAAwBmC,EAAGpC,CAAC,EAClC,GAAIC,IAAM,OAAW,SACrB,IAAM0C,EAAOX,EAAI/B,CAAC,EAClB,GAAI0C,IAAS,QAAaZ,EAAMhC,CAAC,IAAMA,GACnCmC,EAAUS,GACV,CAAChB,GAAYpC,EAAWQ,EAAGE,CAAC,EAAG,CAC/B,IAAM2C,EAAQd,EAAK7B,CAAC,EAChB2C,IAAU,SACVb,EAAM9B,CAAC,EAAIF,EACXgC,EAAMhC,CAAC,EAAI+B,EAAK/B,CAAC,EAAI6C,EACrBV,EAAUS,EAElB,CACJ,CACJ,CACJ,CAAC,CACL,CAAC,EAEM,CAAC,KAAMb,EAAM,MAAOC,CAAK,CACpC,CAEA,SAASc,GACLxD,EACAC,EACAwC,EACAC,EACAe,EAAsB,GACX,CAMX,IAAMC,EAAkB,CAAC,EACnBC,EAA8CC,GAAgB5D,EAAOC,EAAUwC,EAAMgB,CAAU,EAC/FI,EAAqBJ,EAAa,aAAe,cAEvD,SAASK,EAAQC,EAAmCC,EAAiD,CACjG,IAAMC,EAAkBN,EAAO,MAAM,EAAE,MAAM,EACvCO,EAAsC,CAAC,EACzCC,EAA2BF,EAAM,IAAI,EAEzC,KAAOE,GAAM,CACT,GAAID,EAAQC,CAAI,EACZJ,EAAUI,CAAI,MACX,CACHD,EAAQC,CAAI,EAAI,GAGhBF,EAAM,KAAKE,CAAI,EACf,QAAWC,KAAYJ,EAAcG,CAAI,EACrCF,EAAM,KAAKG,CAAQ,CAE3B,CAEAD,EAAOF,EAAM,IAAI,CACrB,CACJ,CAGA,SAASI,EAAMF,EAAoB,CAC/B,IAAMG,EAAUX,EAAO,QAAQQ,CAAI,EAC/BG,EACAZ,EAAGS,CAAI,EAAIG,EAAQ,OAAO,CAACC,EAAKC,IAAM,CA3RlD,IAAAC,EA4RgB,IAAMC,GAAMD,EAAAf,EAAGc,EAAE,CAAC,IAAN,KAAAC,EAAW,EACjBE,EAAahB,EAAO,KAAKa,CAAC,EAChC,OAAO,KAAK,IAAID,EAAKG,GAAOC,IAAe,OAAYA,EAAa,EAAE,CAC1E,EAAG,CAAC,EAEJjB,EAAGS,CAAI,EAAI,CAEnB,CAGA,SAASS,EAAMT,EAAoB,CAC/B,IAAMU,EAAWlB,EAAO,SAASQ,CAAI,EACjCW,EAAM,OAAO,kBACbD,IACAC,EAAMD,EAAS,OAAO,CAACN,EAAKC,IAAM,CAC9B,IAAMO,EAAMrB,EAAGc,EAAE,CAAC,EACZG,GAAahB,EAAO,KAAKa,CAAC,EAChC,OAAO,KAAK,IAAID,GAAMQ,IAAQ,OAAYA,EAAM,IAAMJ,KAAe,OAAYA,GAAa,EAAE,CACpG,EAAG,OAAO,iBAAiB,GAG/B,IAAMK,EAAOhF,EAAM,KAAKmE,CAAI,EACxBW,IAAQ,OAAO,mBAAqBE,EAAK,aAAenB,IACxDH,EAAGS,CAAI,EAAI,KAAK,IAAIT,EAAGS,CAAI,IAAM,OAAYT,EAAGS,CAAI,EAAI,EAAGW,CAAG,EAEtE,CAEA,SAASG,EAAoBd,EAAwB,CACjD,OAAOR,EAAO,aAAaQ,CAAI,GAAK,CAAC,CACzC,CAEA,SAASe,EAAkBf,EAAwB,CAC/C,OAAOR,EAAO,WAAWQ,CAAI,GAAK,CAAC,CACvC,CAEA,OAAAL,EAAQO,EAAOY,CAAmB,EAClCnB,EAAQc,EAAOM,CAAiB,EAGhC,OAAO,KAAKxC,CAAK,EAAE,QAAQhC,GAAK,CAnUpC,IAAA+D,EAoUQ,IAAMU,EAAQ1C,EAAK/B,CAAC,EAChByE,IAAU,SACVzB,EAAGhD,CAAC,GAAI+D,EAAAf,EAAGyB,CAAK,IAAR,KAAAV,EAAa,EAE7B,CAAC,EAEMf,CACX,CAGA,SAASE,GACL5D,EACAC,EACAwC,EACAgB,EACmC,CACnC,IAAM2B,EAAa,IAAI,EACjBC,EAAyBrF,EAAM,MAAM,EACrCsF,EAAsFC,GAAIF,EAAW,QAAUA,EAAW,QAAU5B,CAAU,EAEpJ,OAAAxD,EAAS,QAAQI,GAAS,CACtB,IAAIY,EACJZ,EAAM,QAAQK,GAAK,CACf,IAAM8E,EAAQ/C,EAAK/B,CAAC,EACpB,GAAI8E,IAAU,OAAW,CAErB,GADAJ,EAAW,QAAQI,CAAK,EACpBvE,IAAM,OAAW,CACjB,IAAMwE,EAAQhD,EAAKxB,CAAC,EACpB,GAAIwE,IAAU,OAAW,CACrB,IAAMC,EAA8BN,EAAW,KAAKK,EAAOD,CAAK,EAChEJ,EAAW,QAAQK,EAAOD,EAAO,KAAK,IAAIF,EAAMtF,EAAOU,EAAGO,CAAC,EAAGyE,GAAW,CAAC,CAAC,CAC/E,CACJ,CACAzE,EAAIP,CACR,CACJ,CAAC,CACL,CAAC,EAEM0E,CACX,CAKA,SAASO,GAA2B3F,EAAgD4F,EAA0B,CAC1G,OAAO,OAAO,OAAOA,CAAG,EAAE,OAAO,CAACC,EAA+CnC,IAAoB,CACjG,IAAIoC,EAAM,OAAO,kBACbhB,EAAM,OAAO,kBAEjB,OAAO,QAAQpB,CAAE,EAAE,QAAQ,CAAC,CAAChD,EAAGqF,CAAC,IAAM,CACnC,IAAMC,EAAoBC,GAAMjG,EAAOU,CAAC,EAAI,EAE5CoF,EAAM,KAAK,IAAIC,EAAIC,EAAWF,CAAG,EACjChB,EAAM,KAAK,IAAIiB,EAAIC,EAAWlB,CAAG,CACrC,CAAC,EAED,IAAMoB,EAAiBJ,EAAMhB,EAC7B,OAAIoB,EAASL,EAAgB,CAAC,IAC1BA,EAAkB,CAACK,EAAQxC,CAAE,GAE1BmC,CACX,EAAG,CAAC,OAAO,kBAAmB,IAAI,CAAC,EAAE,CAAC,CAC1C,CASA,SAASM,GAAiBP,EAAaQ,EAA4B,CAC/D,IAAMC,EAAwB,OAAO,OAAOD,CAAO,EAC7CE,EAA0BC,EAAkB,KAAK,IAAKF,CAAW,EACjEG,EAA0BD,EAAkB,KAAK,IAAKF,CAAW,EAEvE,CAAC,IAAK,GAAG,EAAE,QAAQI,GAAQ,CACvB,CAAC,IAAK,GAAG,EAAE,QAAQC,GAAS,CACxB,IAAMC,EAAoBF,EAAOC,EAC3BhD,EAA8BkC,EAAIe,CAAS,EAEjD,GAAI,CAACjD,GAAMA,IAAO0C,EAAS,OAE3B,IAAMQ,EAAmB,OAAO,OAAOlD,CAAE,EACrCmD,EAAgBP,EAAkBC,EAAkB,KAAK,IAAKK,CAAM,EACpEF,IAAU,MACVG,EAAQL,EAAkBD,EAAkB,KAAK,IAAKK,CAAM,GAG5DC,IACAjB,EAAIe,CAAS,EAASG,EAAUpD,EAAIqC,GAAKA,EAAIc,CAAK,EAE1D,CAAC,CACL,CAAC,CACL,CAEA,SAASE,GAAQnB,EAAalD,EAA4B,OAAwB,CAC9E,IAAMsE,EAAQpB,EAAI,GAClB,OAAKoB,EAGOF,EAAUE,EAAO,CAACC,EAAavG,IAAc,CAza7D,IAAA+D,EAAAyC,EA0aQ,GAAIxE,EAAO,CACP,IAAMyE,EAAezE,EAAM,YAAY,EACjCiE,EAAYf,EAAIuB,CAAY,EAClC,GAAIR,GAAaA,EAAUjG,CAAC,IAAM,OAC9B,OAAOiG,EAAUjG,CAAC,CAE1B,CACA,IAAMgD,EAAe,OAAO,OAAOkC,CAAG,EAAE,IAAIlC,GAAM,CAC9C,IAAM0D,EAAM1D,EAAGhD,CAAC,EAChB,OAAO0G,IAAQ,OAAYA,EAAM,CACrC,CAAC,EAAE,KAAK,CAACpE,EAAGC,IAAMD,EAAIC,CAAC,EACvB,SAASwB,EAAAf,EAAG,CAAC,IAAJ,KAAAe,EAAS,KAAMyC,EAAAxD,EAAG,CAAC,IAAJ,KAAAwD,EAAS,IAAM,CAC3C,CAAC,EAfU,CAAC,CAgBhB,CAEA,SAASG,GAAUrH,EAA6D,CAC5E,IAAMC,EAA4BqH,EAAiBtH,CAAK,EAClDE,EAAuB,OAAO,OAChCH,GAAmBC,EAAOC,CAAQ,EAClCoB,GAAmBrB,EAAOC,CAAQ,CAAC,EAEjC2F,EAAc,CAAC,EACjB2B,EACJ,CAAC,IAAK,GAAG,EAAE,QAAQd,GAAQ,CACvBc,EAAmBd,IAAS,IAAMxG,EAAW,OAAO,OAAOA,CAAQ,EAAE,QAAQ,EAC7E,CAAC,IAAK,GAAG,EAAE,QAAQyG,GAAS,CACpBA,IAAU,MACVa,EAAmBA,EAAiB,IAAIC,GAC7B,OAAO,OAAOA,CAAK,EAAE,QAAQ,CACvC,GAOL,IAAM9E,EAAyBH,GAAkBvC,EAAOuH,EAAkBrH,EAJtDQ,IACD+F,IAAS,IAAMzG,EAAM,aAAaU,CAAC,EAAIV,EAAM,WAAWU,CAAC,IACvD,CAAC,CAEyE,EAC3FgD,EAAkBF,GAAqBxD,EAAOuH,EAC9C7E,EAAM,KAAMA,EAAM,MAAOgE,IAAU,GAAG,EACtCA,IAAU,MACVhD,EAAUoD,EAAUpD,EAAIqC,GAAK,CAACA,CAAC,GAEnCH,EAAIa,EAAOC,CAAK,EAAIhD,CACxB,CAAC,CACL,CAAC,EAGD,IAAM+D,EAA6B9B,GAA2B3F,EAAO4F,CAAG,EACxE,OAAAO,GAAiBP,EAAK6B,CAAa,EAC5BV,GAAQnB,EAAK5F,EAAM,MAAM,EAAE,KAAK,CAC3C,CAEA,SAASuF,GAAImC,EAAiBC,EAAiBlE,EAAmG,CAC9I,MAAO,CAACmE,EAA4ClH,EAAWE,IAAsB,CACjF,IAAMiH,EAASD,EAAE,KAAKlH,CAAC,EACjBoH,EAASF,EAAE,KAAKhH,CAAC,EACnBmH,EAAM,EACNlB,EAGJ,GADAkB,GAAOF,EAAO,MAAQ,EAClB,OAAO,OAAOA,EAAQ,UAAU,EAChC,OAASA,EAAO,SAAoB,YAAY,EAAG,CACnD,IAAK,IACDhB,EAAQ,CAACgB,EAAO,MAAQ,EACxB,MACJ,IAAK,IACDhB,EAAQgB,EAAO,MAAQ,EACvB,KACJ,CAWJ,GATIhB,IACAkB,GAAOtE,EAAaoD,EAAQ,CAACA,GAEjCA,EAAQ,OAERkB,IAAQF,EAAO,MAAQF,EAAUD,GAAW,EAC5CK,IAAQD,EAAO,MAAQH,EAAUD,GAAW,EAE5CK,GAAOD,EAAO,MAAQ,EAClB,OAAO,OAAOA,EAAQ,UAAU,EAChC,OAASA,EAAO,SAAoB,YAAY,EAAG,CACnD,IAAK,IACDjB,EAAQiB,EAAO,MAAQ,EACvB,MACJ,IAAK,IACDjB,EAAQ,CAACiB,EAAO,MAAQ,EACxB,KACJ,CAEJ,OAAIjB,IACAkB,GAAOtE,EAAaoD,EAAQ,CAACA,GAG1BkB,CACX,CACJ,CAEA,SAAS9B,GAAMjG,EAAgDU,EAAmB,CAC9E,OAAQV,EAAM,KAAKU,CAAC,EAAgB,KACxC,CCtgBA,SAASsH,GAASC,EAAsD,CACpEA,EAAaC,EAAmBD,CAAK,EAErCE,GAAUF,CAAK,EACf,OAAO,QAAQG,GAAUH,CAAK,CAAC,EAAE,QAAQ,CAAC,CAACI,EAAGC,CAAC,IAAML,EAAM,KAAKI,CAAC,EAAE,EAAIC,CAAC,CAC5E,CAEA,SAASH,GAAUF,EAAsD,CACrE,IAAMM,EAA4BC,EAAiBP,CAAK,EAClDQ,EAAaR,EAAM,MAAM,EACzBS,EAAkBD,EAAW,QAC7BE,EAAgCF,EAAW,UAC7CG,EAAQ,EACZL,EAAS,QAAQM,GAAS,CACtB,IAAMC,EAAoBD,EAAM,OAAO,CAACE,EAAaV,IAAc,CArB3E,IAAAW,EAsBY,IAAMC,GAAiBD,EAAAf,EAAM,KAAKI,CAAC,EAAE,SAAd,KAAAW,EAAwB,EAC/C,OAAID,EAAME,EACCF,EAEAE,CAEf,EAAG,CAAC,EACJJ,EAAM,QAAQR,GAAK,CACf,IAAMa,EAAOjB,EAAM,KAAKI,CAAC,EACrBM,IAAc,MACdO,EAAK,EAAIN,EAAQM,EAAK,OAAS,EACxBP,IAAc,SACrBO,EAAK,EAAIN,EAAQE,EAAYI,EAAK,OAAS,EAE3CA,EAAK,EAAIN,EAAQE,EAAY,CAErC,CAAC,EACDF,GAASE,EAAYJ,CACzB,CAAC,CACL,CCTO,SAASS,EAAOC,EAA4CC,EAAsB,CAAC,EAA4C,CAClI,IAAMC,EAAOD,EAAK,YAAmBC,EAAYC,EACjD,OAAOD,EAAK,SAAU,IAAM,CACxB,IAAME,EACFF,EAAK,qBAAsB,IAAMG,GAAiBL,CAAC,CAAC,EACxD,OAAAE,EAAK,cAAe,IAAMI,GAAUF,EAAaF,EAAMD,CAAI,CAAC,EAC5DC,EAAK,qBAAsB,IAAMK,GAAiBP,EAAGI,CAAW,CAAC,EAC1DA,CACX,CAAC,CACL,CAEA,SAASE,GACLN,EACAE,EACAD,EACI,CACJC,EAAK,6BAA8B,IAAMM,GAAuBR,CAAC,CAAC,EAClEE,EAAK,sBAAuB,IAAMO,GAAgBT,CAAC,CAAC,EACpDE,EAAK,cAAe,IAAcQ,GAAIV,CAAC,CAAC,EACxCE,EAAK,uBAAwB,IAAmBQ,GAAIV,CAAC,CAAC,EACtDE,EAAK,WAAY,IAAMS,GAAUC,EAAmBZ,CAAC,CAAC,CAAC,EACvDE,EAAK,6BAA8B,IAAMW,GAAuBb,CAAC,CAAC,EAClEE,EAAK,uBAAwB,IAAMY,GAAiBd,CAAC,CAAC,EACtDE,EAAK,2BAA4B,IAAmBa,GAAQf,CAAC,CAAC,EAC9DE,EAAK,qBAAsB,IAAMc,GAAehB,CAAC,CAAC,EAClDE,EAAK,uBAAwB,IAAMe,GAAiBjB,CAAC,CAAC,EACtDE,EAAK,6BAA8B,IAAMgB,GAAuBlB,CAAC,CAAC,EAClEE,EAAK,oBAAqB,IAAgBQ,GAAIV,CAAC,CAAC,EAChDE,EAAK,wBAAyB,IAAMiB,GAAkBnB,CAAC,CAAC,EACxDE,EAAK,wBAAyB,IAAMkB,GAAkBpB,CAAC,CAAC,EACxDE,EAAK,YAAa,IAAMmB,EAAMrB,EAAGC,CAAI,CAAC,EACtCC,EAAK,sBAAuB,IAAMoB,GAAgBtB,CAAC,CAAC,EACpDE,EAAK,6BAA8B,IAAuBqB,GAAOvB,CAAC,CAAC,EACnEE,EAAK,eAAgB,IAAMsB,GAASxB,CAAC,CAAC,EACtCE,EAAK,wBAAyB,IAAMuB,GAAkBzB,CAAC,CAAC,EACxDE,EAAK,wBAAyB,IAAMwB,GAAkB1B,CAAC,CAAC,EACxDE,EAAK,qBAAsB,IAAgByB,GAAK3B,CAAC,CAAC,EAClDE,EAAK,2BAA4B,IAAM0B,GAAqB5B,CAAC,CAAC,EAC9DE,EAAK,2BAA4B,IAAuByB,GAAK3B,CAAC,CAAC,EAC/DE,EAAK,qBAAsB,IAAM2B,GAAe7B,CAAC,CAAC,EAClDE,EAAK,2BAA4B,IAAM4B,GAAqB9B,CAAC,CAAC,EAC9DE,EAAK,oBAAqB,IAAM6B,GAA8B/B,CAAC,CAAC,EAChEE,EAAK,mBAAoB,IAAcyB,GAAK3B,CAAC,CAAC,CAClD,CAQA,SAASO,GACLyB,EACA5B,EACI,CACJ4B,EAAW,MAAM,EAAE,QAAQC,GAAK,CAC5B,IAAMC,EAAaF,EAAW,KAAKC,CAAC,EAC9BE,EAAc/B,EAAY,KAAK6B,CAAC,EAElCC,IACAA,EAAW,EAAIC,EAAY,EAC3BD,EAAW,EAAIC,EAAY,EAC3BD,EAAW,MAAQC,EAAY,MAC/BD,EAAW,KAAOC,EAAY,KAE1B/B,EAAY,SAAS6B,CAAC,EAAE,SACxBC,EAAW,MAAQC,EAAY,MAC/BD,EAAW,OAASC,EAAY,QAG5C,CAAC,EAEDH,EAAW,MAAM,EAAE,QAAQI,GAAK,CAC5B,IAAMF,EAAaF,EAAW,KAAKI,CAAC,EAC9BD,EAAc/B,EAAY,KAAKgC,CAAC,EAEtCF,EAAW,OAASC,EAAY,OAC5B,OAAO,OAAOA,EAAa,GAAG,IAC9BD,EAAW,EAAIC,EAAY,EAC3BD,EAAW,EAAIC,EAAY,EAEnC,CAAC,EAEDH,EAAW,MAAM,EAAE,MAAQ5B,EAAY,MAAM,EAAE,MAC/C4B,EAAW,MAAM,EAAE,OAAS5B,EAAY,MAAM,EAAE,MACpD,CAEA,IAAMiC,GAA0B,CAAC,UAAW,UAAW,UAAW,UAAW,SAAS,EAChFC,GAAqC,CAAC,QAAS,GAAI,QAAS,GAAI,QAAS,GAAI,QAAS,KAAM,UAAW,QAAQ,EAC/GC,GAAuB,CAAC,YAAa,SAAU,UAAW,QAAS,WAAW,EAC9EC,GAAyB,CAAC,QAAS,SAAU,MAAM,EACnDC,GAAmC,CAAC,MAAO,EAAG,OAAQ,CAAC,EACvDC,GAAyB,CAAC,SAAU,SAAU,QAAS,SAAU,aAAa,EAC9EC,GAAmC,CACrC,OAAQ,EAAG,OAAQ,EAAG,MAAO,EAAG,OAAQ,EACxC,YAAa,GAAI,SAAU,GAC/B,EACMC,GAAsB,CAAC,UAAU,EAQvC,SAASvC,GAAiB2B,EAA8F,CACpH,IAAMhC,EAAI,IAAI,EAAwC,CAAC,WAAY,GAAM,SAAU,EAAI,CAAC,EAClF6C,EAAQC,GAAad,EAAW,MAAM,CAAC,EAE7C,OAAAhC,EAAE,SAAS,OAAO,OAAO,CAAC,EACtBsC,GACAS,GAAkBF,EAAOR,EAAa,EACjCW,EAAKH,EAAON,EAAU,CAAC,CAAC,EAEjCP,EAAW,MAAM,EAAE,QAAQC,GAAK,CAC5B,IAAMgB,EAAOH,GAAad,EAAW,KAAKC,CAAC,CAAC,EACtCiB,EAAUH,GAAkBE,EAAMT,EAAY,EACpD,OAAO,KAAKC,EAAY,EAAE,QAAQU,GAAK,CAC/BD,EAAQC,CAAC,IAAM,SACfD,EAAQC,CAAC,EAAKV,GAAcU,CAAC,EAErC,CAAC,EAEDnD,EAAE,QAAQiC,EAAGiB,CAAO,EACpB,IAAME,EAASpB,EAAW,OAAOC,CAAC,EAC9BmB,IAAW,QACXpD,EAAE,UAAUiC,EAAGmB,CAAM,CAE7B,CAAC,EAEDpB,EAAW,MAAM,EAAE,QAAQI,GAAK,CAC5B,IAAMiB,EAAOP,GAAad,EAAW,KAAKI,CAAC,CAAC,EAC5CpC,EAAE,QAAQoC,EAAG,OAAO,OAAO,CAAC,EACxBO,GACAI,GAAkBM,EAAMX,EAAY,EAC/BM,EAAKK,EAAMT,EAAS,CAAC,CAAC,CACnC,CAAC,EAEM5C,CACX,CAUA,SAASQ,GAAuBR,EAAkD,CAC9E,IAAM6C,EAAQ7C,EAAE,MAAM,EACtB6C,EAAM,SAAY,EAClB7C,EAAE,MAAM,EAAE,QAAQoC,GAAK,CACnB,IAAMiB,EAAOrD,EAAE,KAAKoC,CAAC,EACrBiB,EAAK,QAAW,EACZA,EAAK,SAAU,YAAY,IAAM,MAC7BR,EAAM,UAAY,MAAQA,EAAM,UAAY,KAC5CQ,EAAK,OAAUA,EAAK,YAEpBA,EAAK,QAAWA,EAAK,YAGjC,CAAC,CACL,CAQA,SAASxC,GAAuBb,EAAkD,CAC9EA,EAAE,MAAM,EAAE,QAAQoC,GAAK,CACnB,IAAMiB,EAAOrD,EAAE,KAAKoC,CAAC,EACrB,GAAIiB,EAAK,OAASA,EAAK,OAAQ,CAC3B,IAAMpB,EAAIjC,EAAE,KAAKoC,EAAE,CAAC,EAEdkB,EAA4B,CAAC,MADzBtD,EAAE,KAAKoC,EAAE,CAAC,EACwB,KAAQH,EAAE,MAAS,EAAIA,EAAE,KAAO,EAAGG,CAAsB,EAChGmB,EAAavD,EAAG,aAAcsD,EAAO,KAAK,CACnD,CACJ,CAAC,CACL,CAEA,SAASrC,GAAiBjB,EAAkD,CACxE,IAAIwD,EAAU,EACdxD,EAAE,MAAM,EAAE,QAAQiC,GAAK,CACnB,IAAMgB,EAAOjD,EAAE,KAAKiC,CAAC,EACjBgB,EAAK,YACLA,EAAK,QAAUjD,EAAE,KAAKiD,EAAK,SAAS,EAAE,KACtCA,EAAK,QAAUjD,EAAE,KAAKiD,EAAK,YAAa,EAAE,KAC1CO,EAAU,KAAK,IAAIA,EAASP,EAAK,OAAQ,EAEjD,CAAC,EACDjD,EAAE,MAAM,EAAE,QAAUwD,CACxB,CAEA,SAAStC,GAAuBlB,EAAkD,CAC9EA,EAAE,MAAM,EAAE,QAAQiC,GAAK,CACnB,IAAMgB,EAAOjD,EAAE,KAAKiC,CAAC,EACrB,GAAIgB,EAAK,QAAU,aAAc,CAC7B,IAAMQ,EAAYR,EAClBjD,EAAE,KAAKyD,EAAU,CAAC,EAAE,UAAYR,EAAK,KACrCjD,EAAE,WAAWiC,CAAC,CAClB,CACJ,CAAC,CACL,CAEA,SAASJ,GAAe7B,EAAkD,CACtE,IAAI0D,EAAO,OAAO,kBACdC,EAAO,EACPC,EAAO,OAAO,kBACdC,EAAO,EACLC,EAAa9D,EAAE,MAAM,EACrB+D,EAAUD,EAAW,SAAW,EAChCE,EAAUF,EAAW,SAAW,EAEtC,SAASG,EAAYC,EAAoC,CACrD,IAAMC,EAAID,EAAM,EACVE,EAAIF,EAAM,EACVG,EAAIH,EAAM,MACVI,EAAIJ,EAAM,OAChBR,EAAO,KAAK,IAAIA,EAAMS,EAAIE,EAAI,CAAC,EAC/BV,EAAO,KAAK,IAAIA,EAAMQ,EAAIE,EAAI,CAAC,EAC/BT,EAAO,KAAK,IAAIA,EAAMQ,EAAIE,EAAI,CAAC,EAC/BT,EAAO,KAAK,IAAIA,EAAMO,EAAIE,EAAI,CAAC,CACnC,CAEAtE,EAAE,MAAM,EAAE,QAAQiC,GAAKgC,EAAYjE,EAAE,KAAKiC,CAAC,CAAC,CAAC,EAC7CjC,EAAE,MAAM,EAAE,QAAQoC,GAAK,CACnB,IAAMiB,EAAOrD,EAAE,KAAKoC,CAAC,EACjB,OAAO,OAAOiB,EAAM,GAAG,GACvBY,EAAYZ,CAAI,CAExB,CAAC,EAEDK,GAAQK,EACRH,GAAQI,EAERhE,EAAE,MAAM,EAAE,QAAQiC,GAAK,CACnB,IAAMgB,EAAOjD,EAAE,KAAKiC,CAAC,EACrBgB,EAAK,GAAMS,EACXT,EAAK,GAAMW,CACf,CAAC,EAED5D,EAAE,MAAM,EAAE,QAAQoC,GAAK,CACnB,IAAMiB,EAAOrD,EAAE,KAAKoC,CAAC,EACrBiB,EAAK,OAAQ,QAAQkB,GAAK,CACtBA,EAAE,GAAKb,EACPa,EAAE,GAAKX,CACX,CAAC,EACG,OAAO,OAAOP,EAAM,GAAG,IACvBA,EAAK,GAAMK,GAEX,OAAO,OAAOL,EAAM,GAAG,IACvBA,EAAK,GAAMO,EAEnB,CAAC,EAEDE,EAAW,MAAQH,EAAOD,EAAOK,EACjCD,EAAW,OAASD,EAAOD,EAAOI,CACtC,CAEA,SAASlC,GAAqB9B,EAAkD,CAC5EA,EAAE,MAAM,EAAE,QAAQoC,GAAK,CACnB,IAAMiB,EAAOrD,EAAE,KAAKoC,CAAC,EACfoC,EAAQxE,EAAE,KAAKoC,EAAE,CAAC,EAClBqC,EAAQzE,EAAE,KAAKoC,EAAE,CAAC,EACpBsC,EAAWC,EACVtB,EAAK,QAKNqB,EAAKrB,EAAK,OAAO,CAAC,EAClBsB,EAAKtB,EAAK,OAAOA,EAAK,OAAO,OAAS,CAAC,IALvCA,EAAK,OAAS,CAAC,EACfqB,EAAKD,EACLE,EAAKH,GAKTnB,EAAK,OAAO,QAAauB,EAAcJ,EAAOE,CAAE,CAAC,EACjDrB,EAAK,OAAO,KAAUuB,EAAcH,EAAOE,CAAE,CAAC,CAClD,CAAC,CACL,CAEA,SAAS/C,GAAqB5B,EAAkD,CAC5EA,EAAE,MAAM,EAAE,QAAQoC,GAAK,CACnB,IAAMiB,EAAOrD,EAAE,KAAKoC,CAAC,EACrB,GAAI,OAAO,OAAOiB,EAAM,GAAG,EAIvB,QAHIA,EAAK,WAAa,KAAOA,EAAK,WAAa,OAC3CA,EAAK,OAAUA,EAAK,aAEhBA,EAAK,SAAU,CACvB,IAAK,IACGA,EAAK,GAAMA,EAAK,MAAS,EAAIA,EAAK,YACtC,MACJ,IAAK,IACGA,EAAK,GAAMA,EAAK,MAAS,EAAIA,EAAK,YACtC,KACJ,CAER,CAAC,CACL,CAEA,SAAStB,GAA8B/B,EAAkD,CACrFA,EAAE,MAAM,EAAE,QAAQoC,GAAK,CACnB,IAAMiB,EAAOrD,EAAE,KAAKoC,CAAC,EACjBiB,EAAK,UACLA,EAAK,OAAQ,QAAQ,CAE7B,CAAC,CACL,CAEA,SAAS3B,GAAkB1B,EAAkD,CACzEA,EAAE,MAAM,EAAE,QAAQiC,GAAK,CACnB,GAAIjC,EAAE,SAASiC,CAAC,EAAE,OAAQ,CACtB,IAAMgB,EAAOjD,EAAE,KAAKiC,CAAC,EACf4C,EAAI7E,EAAE,KAAKiD,EAAK,SAAU,EAC1B6B,EAAI9E,EAAE,KAAKiD,EAAK,YAAa,EAC7B8B,EAAI/E,EAAE,KAAKiD,EAAK,WAAYA,EAAK,WAAY,OAAS,CAAC,CAAE,EACzD+B,EAAIhF,EAAE,KAAKiD,EAAK,YAAaA,EAAK,YAAa,OAAS,CAAC,CAAE,EAEjEA,EAAK,MAAQ,KAAK,IAAI+B,EAAE,EAAKD,EAAE,CAAE,EACjC9B,EAAK,OAAS,KAAK,IAAI6B,EAAE,EAAKD,EAAE,CAAE,EAClC5B,EAAK,EAAI8B,EAAE,EAAK9B,EAAK,MAAQ,EAC7BA,EAAK,EAAI4B,EAAE,EAAK5B,EAAK,OAAS,CAClC,CACJ,CAAC,EAEDjD,EAAE,MAAM,EAAE,QAAQiC,GAAK,CACfjC,EAAE,KAAKiC,CAAC,EAAE,QAAU,UACpBjC,EAAE,WAAWiC,CAAC,CAEtB,CAAC,CACL,CAEA,SAASxB,GAAgBT,EAAkD,CACvEA,EAAE,MAAM,EAAE,QAAQoC,GAAK,CACnB,GAAIA,EAAE,IAAMA,EAAE,EAAG,CACb,IAAMa,EAAOjD,EAAE,KAAKoC,EAAE,CAAC,EAClBa,EAAK,YACNA,EAAK,UAAY,CAAC,GAEtBA,EAAK,UAAU,KAAK,CAAC,EAAGb,EAAG,MAAOpC,EAAE,KAAKoC,CAAC,CAAC,CAAC,EAC5CpC,EAAE,WAAWoC,CAAC,CAClB,CACJ,CAAC,CACL,CAEA,SAASd,GAAgBtB,EAAkD,CACnDiF,EAAiBjF,CAAC,EAC/B,QAAQkF,GAAS,CACpB,IAAIC,EAAa,EACjBD,EAAM,QAAQ,CAACjD,EAAG,IAAM,CACpB,IAAMgB,EAAOjD,EAAE,KAAKiC,CAAC,EACrBgB,EAAK,MAAQ,EAAIkC,GAChBlC,EAAK,WAAa,CAAC,GAAG,QAAQmC,GAAY,CAClC7B,EAAavD,EAAG,WAAY,CAC7B,MAAOoF,EAAS,MAAM,MACtB,OAAQA,EAAS,MAAM,OACvB,KAAMnC,EAAK,KACX,MAAO,GAAK,EAAEkC,EACd,EAAGC,EAAS,EACZ,MAAOA,EAAS,KACpB,EAAG,KAAK,CACZ,CAAC,EACD,OAAOnC,EAAK,SAChB,CAAC,CACL,CAAC,CACL,CAEA,SAASxB,GAAkBzB,EAAkD,CACzEA,EAAE,MAAM,EAAE,QAAQiC,GAAK,CACnB,IAAMgB,EAAOjD,EAAE,KAAKiC,CAAC,EACrB,GAAIgB,EAAK,QAAU,WAAY,CAC3B,IAAMoC,EAAepC,EACfqC,EAAWtF,EAAE,KAAKqF,EAAa,EAAE,CAAC,EAClClB,EAAImB,EAAS,EAAKA,EAAS,MAAQ,EACnClB,EAAIkB,EAAS,EACbC,EAAKtC,EAAK,EAAKkB,EACfqB,EAAKF,EAAS,OAAS,EAC7BtF,EAAE,QAAQqF,EAAa,EAAGA,EAAa,KAAK,EAC5CrF,EAAE,WAAWiC,CAAC,EACdoD,EAAa,MAAM,OAAS,CACxB,CAAC,EAAGlB,EAAI,EAAIoB,EAAK,EAAG,EAAGnB,EAAIoB,CAAE,EAC7B,CAAC,EAAGrB,EAAI,EAAIoB,EAAK,EAAG,EAAGnB,EAAIoB,CAAE,EAC7B,CAAC,EAAGrB,EAAIoB,EAAI,EAAGnB,CAAC,EAChB,CAAC,EAAGD,EAAI,EAAIoB,EAAK,EAAG,EAAGnB,EAAIoB,CAAE,EAC7B,CAAC,EAAGrB,EAAI,EAAIoB,EAAK,EAAG,EAAGnB,EAAIoB,CAAE,CACjC,EACAH,EAAa,MAAM,EAAIpC,EAAK,EAC5BoC,EAAa,MAAM,EAAIpC,EAAK,CAChC,CACJ,CAAC,CACL,CAEA,SAASF,GAAkB0C,EAA8BvB,EAA0B,CAC/E,OAAYwB,EAAe1C,EAAKyC,EAAKvB,CAAK,EAAG,MAAM,CACvD,CAEA,SAASpB,GAAaoB,EAAyD,CAC3E,IAAMyB,EAAoC,CAAC,EAC3C,OAAIzB,GACA,OAAO,QAAQA,CAAK,EAAE,QAAQ,CAAC,CAACf,EAAGlB,CAAC,IAAM,CAClC,OAAOkB,GAAM,WACbA,EAAIA,EAAE,YAAY,GAGtBwC,EAASxC,CAAC,EAAIlB,CAClB,CAAC,EAEE0D,CACX,CCpbO,SAASC,EAAcC,EAAqB,CAC/C,IAAMC,EAAmBC,EAAiBF,CAAK,EAEzCG,EAAI,IAAI,EAAM,CAAC,SAAU,GAAM,WAAY,EAAI,CAAC,EAAE,SAAS,CAAC,CAAC,EAEnE,OAAAH,EAAM,MAAM,EAAE,QAAQI,GAAQ,CAC1BD,EAAE,QAAQC,EAAM,CAAC,MAAOA,CAAI,CAAC,EAC7BD,EAAE,UAAUC,EAAM,QAAWJ,EAAM,KAAKI,CAAI,EAAgB,IAAI,CACpE,CAAC,EAEDJ,EAAM,MAAM,EAAE,QAAQK,GAAQF,EAAE,QAAQE,EAAK,EAAGA,EAAK,EAAG,CAAC,EAAGA,EAAK,IAAI,CAAC,EAEtEJ,EAAY,QAAQ,CAACK,EAAOC,IAAM,CAC9B,IAAMC,EAAS,QAAUD,EACzBJ,EAAE,QAAQK,EAAQ,CAAC,KAAM,MAAM,CAAC,EAChCF,EAAM,OAAO,CAACG,EAAGC,KACbP,EAAE,QAAQM,EAAGC,EAAG,CAAC,MAAO,OAAO,CAAC,EACzBA,EACV,CACL,CAAC,EAEMP,CACX,C/CWO,IAAMQ,GAAO,CAAC,KAAAC,EAAM,OAAAC,CAAM,EAkB3BC,GAAQ,CACV,SAAAC,EACA,QAAAC,EACA,OAAAC,EACA,MAAAC,EACA,KAAM,CAAC,KAAAN,EAAM,OAAAC,CAAM,CACvB,EAEOM,GAAQL",
+  "names": ["index_exports", "__export", "debugOrdering", "index_default", "graphlib_esm_exports", "layout", "util", "version", "Graph", "opts", "label", "labelOrFn", "v", "names", "name", "removeEdge", "e", "child", "parent", "ancestor", "children", "predsV", "sucsV", "preds", "union", "succ", "neighbors", "filter", "copy", "value", "parents", "findParent", "nodes", "w", "vStr", "wStr", "nameStr", "edgeValue", "valueSpecified", "edgeArgsToId", "edgeObj", "edgeArgsToObj", "incrementOrInitEntry", "edgeObjToId", "edgeLabel", "edge", "decrementOrRemoveEntry", "setV", "localEdge", "remoteEdge", "edges", "map", "k", "isDirected", "v_", "w_", "tmp", "version", "json_exports", "__export", "read", "write", "graph", "json", "writeNodes", "writeEdges", "graphLabel", "g", "nodeValue", "node", "entry", "alg_exports", "CycleException", "bellmanFord", "components", "dijkstra", "dijkstraAll", "findCycles", "floydWarshall", "isAcyclic", "postorder", "preorder", "prim", "shortestPaths", "tarjan", "topsort", "DEFAULT_WEIGHT_FUNC", "source", "weightFn", "edgeFn", "runBellmanFord", "results", "didADistanceUpgrade", "iterations", "relaxEdge", "edgeWeight", "relaxAllEdges", "vertex", "inVertex", "outVertex", "distance", "numberOfNodes", "i", "visited", "cmpts", "cmpt", "dfs", "PriorityQueue", "x", "key", "index", "priority", "keyIndices", "keyStr", "arr", "min", "currentPriority", "l", "r", "largest", "j", "origArrI", "origArrJ", "defaultEdgeFn", "runDijkstra", "pq", "vEntry", "updateNeighbors", "wEntry", "weight", "acc", "stack", "runFloydWarshall", "d", "rowK", "rowI", "ik", "kj", "ij", "altDistance", "args", "visit", "reduce", "vs", "order", "fn", "navigation", "_a", "doReduce", "result", "pri", "init", "runShortestPaths", "negativeEdgeExists", "adjList", "addDummyNode", "graph", "type", "attrs", "name", "v", "uniqueId", "simplify", "simplified", "e", "simpleLabel", "label", "asNonCompoundGraph", "intersectRect", "rect", "point", "x", "y", "dx", "dy", "w", "h", "sx", "sy", "buildLayerMatrix", "graph", "layering", "range", "maxRank", "v", "node", "rank", "normalizeRanks", "nodeRanks", "min", "applyWithChunking", "removeEmptyRanks", "offset", "layers", "delta", "nodeRankFactor", "vs", "i", "addBorderNode", "prefix", "order", "addDummyNode", "splitToChunks", "array", "chunkSize", "CHUNKING_THRESHOLD", "chunks", "chunk", "fn", "argsArray", "partition", "collection", "result", "value", "time", "name", "start", "notime", "idCounter", "uniqueId", "id", "limit", "step", "endCon", "pick", "source", "keys", "dest", "key", "mapValues", "obj", "funcOrProp", "func", "val", "acc", "k", "zipObject", "props", "values", "GRAPH_NODE", "version", "List", "__publicField", "sentinel", "entry", "unlink", "strs", "curr", "filterOutLinks", "k", "v", "list_default", "DEFAULT_WEIGHT_FN", "greedyFAS", "graph", "weightFn", "state", "buildState", "doGreedyFAS", "edge", "g", "buckets", "zeroIdx", "_a", "results", "sources", "sinks", "entry", "removeNode", "i", "collectPredecessors", "collected", "weight", "uEntry", "assignBucket", "w", "wEntry", "fasGraph", "maxIn", "maxOut", "v", "prevWeight", "edgeWeight", "vNode", "wNode", "range", "list_default", "_b", "_c", "limit", "run", "graph", "greedyFAS", "weightFn", "dfsFAS", "e", "label", "uniqueId", "g", "fas", "stack", "visited", "dfs", "v", "undo", "forwardName", "run", "graph", "edge", "normalizeEdge", "e", "v", "vRank", "w", "wRank", "name", "edgeLabel", "labelRank", "dummy", "attrs", "i", "addDummyNode", "undo", "node", "origLabel", "longestPath", "graph", "visited", "dfs", "v", "label", "outEdges", "outEdgesMinLens", "e", "rank", "applyWithChunking", "slack", "edge", "feasible_tree_default", "feasibleTree", "graph", "tree", "nodes", "start", "size", "edge", "delta", "tightTree", "findMinSlackEdge", "slack", "shiftRanks", "dfs", "v", "nodeEdges", "e", "edgeV", "w", "acc", "edgeSlack", "preorder", "postorder", "v", "network_simplex_default", "networkSimplex", "initLowLimValues", "initCutValues", "calcCutValue", "leaveEdge", "enterEdge", "exchangeEdges", "graph", "simplify", "longestPath", "t", "feasible_tree_default", "e", "f", "tree", "visitedNodes", "assignCutValue", "child", "parent", "edge", "childIsTail", "graphEdge", "cutValue", "nodeEdges", "isOutEdge", "other", "pointsToHead", "otherWeight", "isTreeEdge", "otherCutValue", "root", "dfsAssignLowLim", "visited", "nextLim", "low", "label", "neighbors", "w", "vLabel", "wLabel", "tailLabel", "flip", "isDescendant", "acc", "slack", "g", "updateRanks", "vs", "flipped", "u", "rootLabel", "rank_default", "rank", "graph", "ranker", "networkSimplexRanker", "tightTreeRanker", "longestPathRanker", "longestPath", "g", "feasible_tree_default", "network_simplex_default", "parent_dummy_chains_default", "parentDummyChains", "graph", "postorderNums", "postorder", "v", "node", "edgeObj", "pathData", "findPath", "path", "lca", "pathIdx", "pathV", "ascending", "w", "vPath", "wPath", "low", "lim", "parent", "wParent", "result", "dfs", "GRAPH_NODE", "run", "graph", "root", "addDummyNode", "depths", "treeDepths", "depthsArr", "height", "applyWithChunking", "nodeSep", "e", "weight", "sumWeights", "GRAPH_NODE", "child", "dfs", "v", "_a", "children", "top", "addBorderNode", "bottom", "label", "childNode", "childTop", "childBottom", "thisWeight", "minlen", "depth", "acc", "cleanup", "graphLabel", "add_border_segments_default", "addBorderSegments", "graph", "dfs", "v", "children", "node", "rank", "maxRank", "addBorderNode", "GRAPH_NODE", "prop", "prefix", "sg", "sgNode", "label", "prev", "curr", "addDummyNode", "adjust", "graph", "_a", "rankDir", "swapWidthHeight", "undo", "reverseY", "swapXY", "node", "swapWidthHeightOne", "edge", "attrs", "w", "reverseYOne", "edgeLabel", "swapXYOne", "x", "initOrder", "graph", "visited", "simpleNodes", "v", "simpleNodesRanks", "maxRank", "applyWithChunking", "layers", "range", "dfs", "node", "successors", "a", "b", "crossCount", "graph", "layering", "cc", "i", "twoLayerCrossCount", "northLayer", "southLayer", "southPos", "zipObject", "v", "southEntries", "edges", "e", "a", "b", "firstIndex", "treeSize", "tree", "entry", "index", "weightSum", "barycenter", "graph", "movable", "v", "inV", "result", "acc", "e", "edge", "nodeU", "resolveConflicts", "entries", "constraintGraph", "mappedEntries", "entry", "tmp", "e", "entryV", "entryW", "sourceSet", "doResolveConflicts", "handleIn", "vEntry", "uEntry", "mergeEntries", "handleOut", "wEntry", "pick", "target", "source", "sum", "weight", "sort", "entries", "biasRight", "parts", "partition", "entry", "sortable", "unsortable", "a", "b", "vs", "sum", "weight", "vsIndex", "compareWithBias", "consumeUnsortable", "result", "index", "last", "bias", "entryV", "entryW", "sortSubgraph", "graph", "v", "constraintGraph", "biasRight", "movable", "node", "bl", "br", "subgraphs", "w", "barycenters", "barycenter", "entry", "subgraphResult", "mergeBarycenters", "entries", "resolveConflicts", "expandSubgraphs", "result", "sort", "blPredecessors", "blPred", "brPredecessors", "brPred", "target", "other", "buildLayerGraph", "graph", "rank", "relationship", "nodesWithRank", "root", "createRootNode", "result", "v", "node", "parent", "edges", "e", "u", "edge", "weight", "uniqueId", "addSubgraphConstraints", "graph", "constraintGraph", "vs", "prev", "rootPrev", "v", "child", "parent", "prevChild", "order", "graph", "opts", "maxRank", "downLayerGraphs", "buildLayerGraphs", "range", "upLayerGraphs", "layering", "initOrder", "assignOrder", "bestCC", "best", "constraints", "i", "lastBest", "sweepLayerGraphs", "buildLayerMatrix", "cc", "crossCount", "ranks", "relationship", "nodesByRank", "addNodeToRank", "rank", "node", "v", "r", "buildLayerGraph", "layerGraphs", "biasRight", "cg", "lg", "con", "root", "sorted", "sortSubgraph", "addSubgraphConstraints", "layer", "findType1Conflicts", "graph", "layering", "conflicts", "visitLayer", "prevLayer", "layer", "k0", "scanPos", "prevLayerLength", "lastNode", "v", "i", "w", "findOtherInnerSegmentNode", "k1", "scanNode", "preds", "u", "uLabel", "uPos", "addConflict", "findType2Conflicts", "scan", "south", "southPos", "southEnd", "prevNorthBorder", "nextNorthBorder", "range", "uNode", "north", "prevNorthPos", "nextNorthPos", "southLookahead", "predecessors", "firstPred", "tmp", "conflictsV", "hasConflict", "verticalAlignment", "neighborFn", "root", "align", "pos", "order", "prevIdx", "wsRaw", "ws", "a", "b", "posA", "posB", "mp", "il", "posW", "rootW", "horizontalCompaction", "reverseSep", "xs", "blockG", "buildBlockGraph", "borderType", "iterate", "setXsFunc", "nextNodesFunc", "stack", "visited", "elem", "nextElem", "pass1", "inEdges", "acc", "e", "_a", "xsV", "edgeWeight", "pass2", "outEdges", "min", "xsW", "node", "predecessorsWrapper", "successorsWrapper", "rootV", "blockGraph", "graphLabel", "sepFn", "sep", "vRoot", "uRoot", "prevMax", "findSmallestWidthAlignment", "xss", "currentMinAndXs", "max", "x", "halfWidth", "width", "newMin", "alignCoordinates", "alignTo", "alignToVals", "alignToMin", "applyWithChunking", "alignToMax", "vert", "horiz", "alignment", "xsVals", "delta", "mapValues", "balance", "ulMap", "num", "_b", "alignmentKey", "val", "positionX", "buildLayerMatrix", "adjustedLayering", "inner", "smallestWidth", "nodeSep", "edgeSep", "g", "vLabel", "wLabel", "sum", "position", "graph", "asNonCompoundGraph", "positionY", "positionX", "v", "x", "layering", "buildLayerMatrix", "graphLabel", "rankSep", "rankAlign", "prevY", "layer", "maxHeight", "acc", "_a", "height", "node", "layout", "g", "opts", "time", "notime", "layoutGraph", "buildLayoutGraph", "runLayout", "updateInputGraph", "makeSpaceForEdgeLabels", "removeSelfEdges", "run", "rank_default", "asNonCompoundGraph", "injectEdgeLabelProxies", "removeEmptyRanks", "cleanup", "normalizeRanks", "assignRankMinMax", "removeEdgeLabelProxies", "parent_dummy_chains_default", "add_border_segments_default", "order", "insertSelfEdges", "adjust", "position", "positionSelfEdges", "removeBorderNodes", "undo", "fixupEdgeLabelCoords", "translateGraph", "assignNodeIntersects", "reversePointsForReversedEdges", "inputGraph", "v", "inputLabel", "layoutLabel", "e", "graphNumAttrs", "graphDefaults", "graphAttrs", "nodeNumAttrs", "nodeDefaults", "edgeNumAttrs", "edgeDefaults", "edgeAttrs", "graph", "canonicalize", "selectNumberAttrs", "pick", "node", "newNode", "k", "parent", "edge", "label", "addDummyNode", "maxRank", "proxyNode", "minX", "maxX", "minY", "maxY", "graphLabel", "marginX", "marginY", "getExtremes", "attrs", "x", "y", "w", "h", "p", "nodeV", "nodeW", "p1", "p2", "intersectRect", "t", "b", "l", "r", "buildLayerMatrix", "layer", "orderShift", "selfEdge", "selfEdgeNode", "selfNode", "dx", "dy", "obj", "mapValues", "newAttrs", "debugOrdering", "graph", "layerMatrix", "buildLayerMatrix", "h", "node", "edge", "layer", "i", "layerV", "u", "v", "util", "time", "notime", "dagre", "graphlib_esm_exports", "version", "layout", "debugOrdering", "index_default"]
 }