@dagrejs/dagre 2.0.0 → 2.0.1

package/dist/dagre.esm.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);\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 (opts && 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 && opts.disableOptimalOrderHeuristic) {\n    return;\n  }\n\n  let bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\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    }\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) {\n  let cg = new Graph();\n  layerGraphs.forEach(function(lg) {\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    let stack = blockG.nodes();\n    let elem = stack.pop();\n    let visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\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  let time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", () => {\n    let layoutGraph =\n      time(\"  buildLayoutGraph\", () => buildLayoutGraph(g));\n    time(\"  runLayout\",        () => runLayout(layoutGraph, time, opts));\n    time(\"  updateInputGraph\", () => updateInputGraph(g, 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.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.0\";\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": "2VAAA,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,EAC7CuB,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,EAAM,CACtB,GAAIA,GAAQ,OAAOA,EAAK,aAAgB,WAAY,CAClDA,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,GAAQA,EAAK,6BACf,OAGF,IAAIO,EAAS,OAAO,kBAClBC,EAEF,QAASC,EAAI,EAAGC,EAAW,EAAGA,EAAW,EAAG,EAAED,EAAG,EAAEC,EAAU,CAC3DC,GAAiBF,EAAI,EAAIP,EAAkBE,EAAeK,EAAI,GAAK,CAAC,EAEpEJ,EAAWR,EAAK,iBAAiBE,CAAC,EAClC,IAAIa,EAAKpB,GAAWO,EAAGM,CAAQ,EAC3BO,EAAKL,IACPG,EAAW,EACXF,EAAO,OAAO,OAAO,CAAC,EAAGH,CAAQ,EACjCE,EAASK,EAEb,CAEAN,GAAYP,EAAGS,CAAI,CACrB,CAEA,SAASL,GAAiBJ,EAAGc,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,KAAKpB,EAAE,MAAM,EAAG,CACzB,IAAMmB,EAAOnB,EAAE,KAAKoB,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,OAAOvB,GAAgBK,EAAGkB,EAAMH,EAAcC,EAAY,IAAIE,CAAI,GAAK,CAAC,CAAC,CAC3E,CAAC,CACH,CAEA,SAASN,GAAiBU,EAAaC,EAAW,CAChD,IAAIC,EAAK,IAAI3B,GACbyB,EAAY,QAAQ,SAASG,EAAI,CAC/B,IAAIC,EAAOD,EAAG,MAAM,EAAE,KAClBE,EAASjC,GAAa+B,EAAIC,EAAMF,EAAID,CAAS,EACjDI,EAAO,GAAG,QAAQ,CAACP,EAAGV,IAAMe,EAAG,KAAKL,CAAC,EAAE,MAAQV,CAAC,EAChDd,GAAuB6B,EAAID,EAAIG,EAAO,EAAE,CAC1C,CAAC,CACH,CAEA,SAASpB,GAAYP,EAAGM,EAAU,CAChC,OAAO,OAAOA,CAAQ,EAAE,QAAQsB,GAASA,EAAM,QAAQ,CAACR,EAAG,IAAMpB,EAAE,KAAKoB,CAAC,EAAE,MAAQ,CAAC,CAAC,CACvF,IC9GA,IAAAS,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,IAAIC,EAAQN,EAAO,MAAM,EACrBO,EAAOD,EAAM,IAAI,EACjBE,EAAU,CAAC,EACf,KAAOD,GACDC,EAAQD,CAAI,EACdH,EAAUG,CAAI,GAEdC,EAAQD,CAAI,EAAI,GAChBD,EAAM,KAAKC,CAAI,EACfD,EAAQA,EAAM,OAAOD,EAAcE,CAAI,CAAC,GAG1CA,EAAOD,EAAM,IAAI,CAErB,CAGA,SAASG,EAAMF,EAAM,CACnBR,EAAGQ,CAAI,EAAIP,EAAO,QAAQO,CAAI,EAAE,OAAO,CAACG,EAAKC,IACpC,KAAK,IAAID,EAAKX,EAAGY,EAAE,CAAC,EAAIX,EAAO,KAAKW,CAAC,CAAC,EAC5C,CAAC,CACN,CAGA,SAASC,EAAML,EAAM,CACnB,IAAIM,EAAMb,EAAO,SAASO,CAAI,EAAE,OAAO,CAACG,EAAKC,IACpC,KAAK,IAAID,EAAKX,EAAGY,EAAE,CAAC,EAAIX,EAAO,KAAKW,CAAC,CAAC,EAC5C,OAAO,iBAAiB,EAEvBG,EAAO5D,EAAE,KAAKqD,CAAI,EAClBM,IAAQ,OAAO,mBAAqBC,EAAK,aAAeZ,IAC1DH,EAAGQ,CAAI,EAAI,KAAK,IAAIR,EAAGQ,CAAI,EAAGM,CAAG,EAErC,CAEA,OAAAV,EAAQM,EAAOT,EAAO,aAAa,KAAKA,CAAM,CAAC,EAC/CG,EAAQS,EAAOZ,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,IAAIiB,EAAa,IAAIzE,GACnB0E,EAAa9D,EAAE,MAAM,EACrB+D,EAAQC,GAAIF,EAAW,QAASA,EAAW,QAASlB,CAAU,EAEhE,OAAA3C,EAAS,QAAQI,GAAS,CACxB,IAAIW,EACJX,EAAM,QAAQK,GAAK,CACjB,IAAIuD,EAAQ/B,EAAKxB,CAAC,EAElB,GADAmD,EAAW,QAAQI,CAAK,EACpBjD,EAAG,CACL,IAAIkD,EAAQhC,EAAKlB,CAAC,EAChBmD,EAAUN,EAAW,KAAKK,EAAOD,CAAK,EACxCJ,EAAW,QAAQK,EAAOD,EAAO,KAAK,IAAIF,EAAM/D,EAAGU,EAAGM,CAAC,EAAGmD,GAAW,CAAC,CAAC,CACzE,CACAnD,EAAIN,CACN,CAAC,CACH,CAAC,EAEMmD,CACT,CAKA,SAAS/D,GAA2BE,EAAGoE,EAAK,CAC1C,OAAO,OAAO,OAAOA,CAAG,EAAE,OAAO,CAACC,EAAiBxB,IAAO,CACxD,IAAIyB,EAAM,OAAO,kBACbX,EAAM,OAAO,kBAEjB,OAAO,QAAQd,CAAE,EAAE,QAAQ,CAAC,CAACnC,EAAG6D,CAAC,IAAM,CACrC,IAAIC,EAAYC,GAAMzE,EAAGU,CAAC,EAAI,EAE9B4D,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,EAAQ7B,CAAE,GAExBwB,CACT,EAAG,CAAC,OAAO,kBAAmB,IAAI,CAAC,EAAE,CAAC,CACxC,CASA,SAASxE,GAAiBuE,EAAKO,EAAS,CACtC,IAAIC,EAAc,OAAO,OAAOD,CAAO,EACrCE,EAAaxF,EAAK,kBAAkB,KAAK,IAAKuF,CAAW,EACzDE,EAAazF,EAAK,kBAAkB,KAAK,IAAKuF,CAAW,EAE3D,CAAC,IAAK,GAAG,EAAE,QAAQG,GAAQ,CACzB,CAAC,IAAK,GAAG,EAAE,QAAQC,GAAS,CAC1B,IAAIC,EAAYF,EAAOC,EACrBnC,EAAKuB,EAAIa,CAAS,EAEpB,GAAIpC,IAAO8B,EAAS,OAEpB,IAAIO,EAAS,OAAO,OAAOrC,CAAE,EACzBsC,EAAQN,EAAaxF,EAAK,kBAAkB,KAAK,IAAK6F,CAAM,EAC5DF,IAAU,MACZG,EAAQL,EAAazF,EAAK,kBAAkB,KAAK,IAAI6F,CAAM,GAGzDC,IACFf,EAAIa,CAAS,EAAI5F,EAAK,UAAUwD,EAAI0B,GAAKA,EAAIY,CAAK,EAEtD,CAAC,CACH,CAAC,CACH,CAEA,SAASpF,GAAQqE,EAAKjC,EAAO,CAC3B,OAAO9C,EAAK,UAAU+E,EAAI,GAAI,CAACgB,EAAK1E,IAAM,CACxC,GAAIyB,EACF,OAAOiC,EAAIjC,EAAM,YAAY,CAAC,EAAEzB,CAAC,EAC5B,CACL,IAAImC,EAAK,OAAO,OAAOuB,CAAG,EAAE,IAAIvB,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,EAE7BmE,EAAM,CAAC,EACPiB,EACJ,CAAC,IAAK,GAAG,EAAE,QAAQN,GAAQ,CACzBM,EAAmBN,IAAS,IAAM9E,EAAW,OAAO,OAAOA,CAAQ,EAAE,QAAQ,EAC7E,CAAC,IAAK,GAAG,EAAE,QAAQ+E,GAAS,CACtBA,IAAU,MACZK,EAAmBA,EAAiB,IAAIC,GAC/B,OAAO,OAAOA,CAAK,EAAE,QAAQ,CACrC,GAGH,IAAIrD,GAAc8C,IAAS,IAAM/E,EAAE,aAAeA,EAAE,YAAY,KAAKA,CAAC,EAClEmC,EAAQxC,GAAkBK,EAAGqF,EAAkBnF,EAAW+B,CAAU,EACpEY,EAAKjD,GAAqBI,EAAGqF,EAC/BlD,EAAM,KAAMA,EAAM,MAAO6C,IAAU,GAAG,EACpCA,IAAU,MACZnC,EAAKxD,EAAK,UAAUwD,EAAI0B,GAAK,CAACA,CAAC,GAEjCH,EAAIW,EAAOC,CAAK,EAAInC,CACtB,CAAC,CACH,CAAC,EAGD,IAAI0C,EAAgBzF,GAA2BE,EAAGoE,CAAG,EACrD,OAAAvE,GAAiBuE,EAAKmB,CAAa,EAC5BxF,GAAQqE,EAAKpE,EAAE,MAAM,EAAE,KAAK,CACrC,CAEA,SAASgE,GAAIwB,EAASC,EAAS7C,EAAY,CACzC,MAAO,CAAC5C,EAAGU,EAAGE,IAAM,CAClB,IAAI8E,EAAS1F,EAAE,KAAKU,CAAC,EACjBiF,EAAS3F,EAAE,KAAKY,CAAC,EACjBgF,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,GAAOhD,EAAauC,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,GAAOhD,EAAauC,EAAQ,CAACA,GAE/BA,EAAQ,EAEDS,CACT,CACF,CAEA,SAASnB,GAAMzE,EAAGU,EAAG,CACnB,OAAOV,EAAE,KAAKU,CAAC,EAAE,KACnB,ICvaA,IAAAmF,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,EAAM,CACvB,IAAIC,EAAOD,GAAQA,EAAK,YAAcJ,EAAK,KAAOA,EAAK,OACvDK,EAAK,SAAU,IAAM,CACnB,IAAIC,EACFD,EAAK,qBAAsB,IAAME,GAAiBJ,CAAC,CAAC,EACtDE,EAAK,cAAsB,IAAMG,GAAUF,EAAaD,EAAMD,CAAI,CAAC,EACnEC,EAAK,qBAAsB,IAAMI,GAAiBN,EAAGG,CAAW,CAAC,CACnE,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,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,ICpZA,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", "i", "lastBest", "sweepLayerGraphs", "cc", "ranks", "relationship", "nodesByRank", "addNodeToRank", "rank", "node", "v", "r", "layerGraphs", "biasRight", "cg", "lg", "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", "elem", "visited", "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"]
+  "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.1\";\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": "2VAAA,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"]
 }