@smwb/ui-solid 0.12.0 → 0.13.0

package/dist/source/components/dataDisplay/dagView/dagLayout.js

@@ -0,0 +1,383 @@
+const dagEdgeId = (edge) => edge.id ?? `${edge.source}->${edge.target}`;
+function normalise(input) {
+  const warn = input.warn ?? (() => void 0);
+  const nodes = [];
+  const index = /* @__PURE__ */ new Map();
+  for (const node of input.nodes) {
+    if (index.has(node.id)) {
+      warn(`node "${node.id}" is listed twice; the second is dropped.`);
+      continue;
+    }
+    index.set(node.id, nodes.length);
+    nodes.push(node);
+  }
+  const edges = [];
+  const pairs = /* @__PURE__ */ new Set();
+  const ids = /* @__PURE__ */ new Set();
+  for (const edge of input.edges) {
+    const from = index.get(edge.source);
+    const to = index.get(edge.target);
+    if (from === void 0 || to === void 0) {
+      const missing = from === void 0 ? edge.source : edge.target;
+      warn(`edge ${edge.source} -> ${edge.target} names an unknown node "${missing}"; it is dropped.`);
+      continue;
+    }
+    if (from === to) {
+      warn(`edge ${edge.source} -> ${edge.target} is a self-loop; it is dropped.`);
+      continue;
+    }
+    const pair = `${from} ${to}`;
+    const id = dagEdgeId(edge);
+    if (pairs.has(pair) || ids.has(id)) {
+      warn(`edge ${edge.source} -> ${edge.target} is listed twice; the second is dropped.`);
+      continue;
+    }
+    pairs.add(pair);
+    ids.add(id);
+    edges.push({ id, source: edge.source, target: edge.target, from, to, reversed: false });
+  }
+  const out = nodes.map(() => []);
+  edges.forEach((edge, i) => out[edge.from].push(i));
+  const state = new Uint8Array(nodes.length);
+  for (let root = 0; root < nodes.length; root++) {
+    if (state[root]) continue;
+    const stack = [[root, 0]];
+    state[root] = 1;
+    while (stack.length) {
+      const top = stack[stack.length - 1];
+      const [v, next] = top;
+      const list = out[v];
+      if (next >= list.length) {
+        state[v] = 2;
+        stack.pop();
+        continue;
+      }
+      top[1] = next + 1;
+      const edge = edges[list[next]];
+      if (state[edge.to] === 1) edge.reversed = true;
+      else if (state[edge.to] === 0) {
+        state[edge.to] = 1;
+        stack.push([edge.to, 0]);
+      }
+    }
+  }
+  return { nodes, index, edges };
+}
+function assignLayers(count, arcs) {
+  const out = Array.from({ length: count }, () => []);
+  const inDegree = new Array(count).fill(0);
+  for (const [u, v] of arcs) {
+    out[u].push(v);
+    inDegree[v]++;
+  }
+  const hasPred = inDegree.map((d) => d > 0);
+  const layer = new Array(count).fill(0);
+  const order = [];
+  const queue = [];
+  for (let v = 0; v < count; v++) if (inDegree[v] === 0) queue.push(v);
+  for (let head = 0; head < queue.length; head++) {
+    const u = queue[head];
+    order.push(u);
+    for (const v of out[u]) {
+      layer[v] = Math.max(layer[v], layer[u] + 1);
+      if (--inDegree[v] === 0) queue.push(v);
+    }
+  }
+  for (let i = order.length - 1; i >= 0; i--) {
+    const v = order[i];
+    const succs = out[v];
+    if (succs.length === 0 || hasPred[v]) continue;
+    layer[v] = Math.min(...succs.map((s) => layer[s])) - 1;
+  }
+  return layer;
+}
+function crossingsBetween(upper, vertices, position) {
+  const pairs = [];
+  for (const u of upper) for (const v of vertices[u].succs) pairs.push([position[u], position[v]]);
+  pairs.sort((a, b) => a[0] - b[0] || a[1] - b[1]);
+  let size = 1;
+  for (const [, b] of pairs) size = Math.max(size, b + 2);
+  const tree = new Int32Array(size + 1);
+  let crossings = 0;
+  for (let i = pairs.length - 1; i >= 0; i--) {
+    const b = pairs[i][1];
+    for (let j = b; j > 0; j -= j & -j) crossings += tree[j];
+    for (let j = b + 1; j <= size; j += j & -j) tree[j]++;
+  }
+  return crossings;
+}
+function totalCrossings(layers, vertices, position) {
+  let sum = 0;
+  for (let l = 0; l + 1 < layers.length; l++) sum += crossingsBetween(layers[l], vertices, position);
+  return sum;
+}
+function reorder(layer, vertices, position, down) {
+  const key = /* @__PURE__ */ new Map();
+  for (const v of layer) {
+    const neighbours = down ? vertices[v].preds : vertices[v].succs;
+    if (neighbours.length === 0) key.set(v, position[v]);
+    else key.set(v, neighbours.reduce((sum, n) => sum + position[n], 0) / neighbours.length);
+  }
+  layer.sort((a, b) => key.get(a) - key.get(b) || position[a] - position[b]);
+  layer.forEach((v, i) => position[v] = i);
+}
+function orderLayers(layers, vertices, sweeps) {
+  const position = new Int32Array(vertices.length);
+  for (const layer of layers) layer.forEach((v, i) => position[v] = i);
+  let best = layers.map((layer) => layer.slice());
+  let bestCrossings = totalCrossings(layers, vertices, position);
+  let stale = 0;
+  for (let sweep = 0; sweep < sweeps && bestCrossings > 0; sweep++) {
+    const down = sweep % 2 === 0;
+    if (down) for (let l = 1; l < layers.length; l++) reorder(layers[l], vertices, position, true);
+    else for (let l = layers.length - 2; l >= 0; l--) reorder(layers[l], vertices, position, false);
+    const crossings = totalCrossings(layers, vertices, position);
+    if (crossings < bestCrossings) {
+      bestCrossings = crossings;
+      best = layers.map((layer) => layer.slice());
+      stale = 0;
+    } else if (++stale >= 2) break;
+  }
+  best.forEach((layer, l) => layers[l] = layer);
+}
+function place(desired, gaps, weights) {
+  const offset = [0];
+  for (let i = 1; i < desired.length; i++) offset.push(offset[i - 1] + gaps[i - 1]);
+  const blocks = [];
+  desired.forEach((d, i) => {
+    let block = { value: d - offset[i], weight: weights[i], count: 1 };
+    while (blocks.length && blocks[blocks.length - 1].value > block.value) {
+      const last = blocks.pop();
+      const weight = last.weight + block.weight;
+      block = {
+        value: (last.value * last.weight + block.value * block.weight) / weight,
+        weight,
+        count: last.count + block.count
+      };
+    }
+    blocks.push(block);
+  });
+  const result = [];
+  for (const block of blocks) for (let k = 0; k < block.count; k++) result.push(block.value + offset[result.length]);
+  return result;
+}
+function assignCross(layers, vertices, nodeGap) {
+  const gapBetween = (a, b) => {
+    const va = vertices[a];
+    const vb = vertices[b];
+    const gap = va.node < 0 && vb.node < 0 ? nodeGap / 2 : nodeGap;
+    return va.crossSize / 2 + gap + vb.crossSize / 2;
+  };
+  for (const layer of layers) {
+    let at = 0;
+    layer.forEach((v, i) => {
+      if (i > 0) at += gapBetween(layer[i - 1], v);
+      vertices[v].cross = at;
+    });
+  }
+  const passes = ["down", "up", "down", "up", "both", "both"];
+  for (const pass of passes) {
+    const range = pass === "up" ? layers.map((_, l) => layers.length - 1 - l) : layers.map((_, l) => l);
+    for (const l of range) {
+      const layer = layers[l];
+      if (layer.length === 0) continue;
+      const desired = layer.map((v) => {
+        const vertex = vertices[v];
+        const neighbours = pass === "down" ? vertex.preds : pass === "up" ? vertex.succs : [...vertex.preds, ...vertex.succs];
+        if (neighbours.length === 0) return vertex.cross;
+        return neighbours.reduce((sum, n) => sum + vertices[n].cross, 0) / neighbours.length;
+      });
+      const gaps = layer.slice(1).map((v, i) => gapBetween(layer[i], v));
+      const weights = layer.map((v) => vertices[v].node < 0 ? 2 : 1);
+      place(desired, gaps, weights).forEach((cross, i) => vertices[layer[i]].cross = cross);
+    }
+  }
+}
+function layoutPart(members, graph, edgeList, rankSizeOf, crossSizeOf, rankGap, nodeGap, sweeps) {
+  const local = /* @__PURE__ */ new Map();
+  members.forEach((n, i) => local.set(n, i));
+  const arcs = edgeList.map((e) => {
+    const edge = graph.edges[e];
+    const from = local.get(edge.from);
+    const to = local.get(edge.to);
+    return edge.reversed ? [to, from] : [from, to];
+  });
+  const layerOf = assignLayers(members.length, arcs);
+  const vertices = members.map((n, i) => ({
+    node: n,
+    rankSize: rankSizeOf(n),
+    crossSize: crossSizeOf(n),
+    layer: layerOf[i],
+    cross: 0,
+    preds: [],
+    succs: []
+  }));
+  const segments = edgeList.map((e, k) => {
+    const [from, to] = arcs[k];
+    const chain = [from];
+    let previous = from;
+    for (let l = vertices[from].layer + 1; l < vertices[to].layer; l++) {
+      const dummy = vertices.length;
+      vertices.push({ node: -1, rankSize: 0, crossSize: 0, layer: l, cross: 0, preds: [], succs: [] });
+      vertices[previous].succs.push(dummy);
+      vertices[dummy].preds.push(previous);
+      chain.push(dummy);
+      previous = dummy;
+    }
+    vertices[previous].succs.push(to);
+    vertices[to].preds.push(previous);
+    chain.push(to);
+    return { edge: e, chain };
+  });
+  const layerCount = vertices.reduce((max, v) => Math.max(max, v.layer + 1), 0);
+  const layers = Array.from({ length: layerCount }, () => []);
+  vertices.forEach((v, i) => layers[v.layer].push(i));
+  orderLayers(layers, vertices, sweeps);
+  assignCross(layers, vertices, nodeGap);
+  const thickness = layers.map((layer) => layer.reduce((max, v) => Math.max(max, vertices[v].rankSize), 0));
+  const start = [];
+  let rank = 0;
+  thickness.forEach((t, l) => {
+    start[l] = rank;
+    rank += t + (l + 1 < thickness.length ? rankGap : 0);
+  });
+  let minCross = Infinity;
+  let maxCross = -Infinity;
+  for (const v of vertices) {
+    minCross = Math.min(minCross, v.cross - v.crossSize / 2);
+    maxCross = Math.max(maxCross, v.cross + v.crossSize / 2);
+  }
+  const shift = Number.isFinite(minCross) ? -minCross : 0;
+  const nodes = /* @__PURE__ */ new Map();
+  layers.forEach(
+    (layer, l) => layer.forEach((v, order) => {
+      const vertex = vertices[v];
+      if (vertex.node < 0) return;
+      nodes.set(vertex.node, {
+        rank: start[l] + (thickness[l] - vertex.rankSize) / 2,
+        cross: vertex.cross - vertex.crossSize / 2 + shift,
+        layer: l,
+        order
+      });
+    })
+  );
+  const edges = /* @__PURE__ */ new Map();
+  for (const { edge, chain } of segments) {
+    const points = [];
+    chain.forEach((v, i) => {
+      const vertex = vertices[v];
+      const l = vertex.layer;
+      const cross = vertex.cross + shift;
+      const bandStart = start[l] + (thickness[l] - vertex.rankSize) / 2;
+      if (i === 0) points.push({ rank: bandStart + vertex.rankSize, cross });
+      else if (i === chain.length - 1) points.push({ rank: bandStart, cross });
+      else {
+        points.push({ rank: start[l], cross }, { rank: start[l] + thickness[l], cross });
+      }
+    });
+    if (graph.edges[edge].reversed) points.reverse();
+    edges.set(edge, points);
+  }
+  return {
+    nodes,
+    edges,
+    rankExtent: rank,
+    crossExtent: Number.isFinite(maxCross) ? maxCross - minCross : 0
+  };
+}
+function dagLayout(input) {
+  const direction = input.direction ?? "LR";
+  const rankGap = input.rankGap ?? 64;
+  const nodeGap = input.nodeGap ?? 24;
+  const sweeps = input.sweeps ?? 8;
+  const graph = normalise(input);
+  const lr = direction === "LR";
+  const rankSizeOf = (n) => lr ? graph.nodes[n].width : graph.nodes[n].height;
+  const crossSizeOf = (n) => lr ? graph.nodes[n].height : graph.nodes[n].width;
+  const parent = graph.nodes.map((_, i) => i);
+  const find = (v) => {
+    while (parent[v] !== v) {
+      parent[v] = parent[parent[v]];
+      v = parent[v];
+    }
+    return v;
+  };
+  for (const edge of graph.edges) {
+    const a = find(edge.from);
+    const b = find(edge.to);
+    if (a !== b) parent[Math.max(a, b)] = Math.min(a, b);
+  }
+  const parts = /* @__PURE__ */ new Map();
+  graph.nodes.forEach((_, i) => {
+    const root = find(i);
+    if (!parts.has(root)) parts.set(root, { members: [], edges: [] });
+    parts.get(root).members.push(i);
+  });
+  graph.edges.forEach((edge, e) => parts.get(find(edge.from)).edges.push(e));
+  const placedNodes = /* @__PURE__ */ new Map();
+  const placedEdges = /* @__PURE__ */ new Map();
+  const toPoint = (rank, cross) => lr ? { x: rank, y: cross } : { x: cross, y: rank };
+  let crossAt = 0;
+  let rankExtent = 0;
+  for (const part of parts.values()) {
+    const laid = layoutPart(part.members, graph, part.edges, rankSizeOf, crossSizeOf, rankGap, nodeGap, sweeps);
+    for (const [n, p] of laid.nodes) {
+      const node = graph.nodes[n];
+      placedNodes.set(n, {
+        id: node.id,
+        ...toPoint(p.rank, p.cross + crossAt),
+        width: node.width,
+        height: node.height,
+        layer: p.layer,
+        order: p.order
+      });
+    }
+    for (const [e, points] of laid.edges) {
+      placedEdges.set(
+        e,
+        points.map((p) => toPoint(p.rank, p.cross + crossAt))
+      );
+    }
+    rankExtent = Math.max(rankExtent, laid.rankExtent);
+    crossAt += laid.crossExtent + nodeGap * 2;
+  }
+  const crossExtent = Math.max(0, crossAt - nodeGap * 2);
+  const nodes = /* @__PURE__ */ new Map();
+  graph.nodes.forEach((node, i) => nodes.set(node.id, placedNodes.get(i)));
+  const pairs = new Set(graph.edges.map((edge) => `${edge.from} ${edge.to}`));
+  const edges = graph.edges.map((edge, e) => {
+    let points = placedEdges.get(e);
+    if (edge.reversed && pairs.has(`${edge.to} ${edge.from}`)) {
+      const across = (n) => lr ? graph.nodes[n].height : graph.nodes[n].width;
+      const offset = Math.min(8, across(edge.from) / 4, across(edge.to) / 4);
+      points = points.map((p) => lr ? { x: p.x, y: p.y + offset } : { x: p.x + offset, y: p.y });
+    }
+    return { id: edge.id, source: edge.source, target: edge.target, points, reversed: edge.reversed };
+  });
+  const extent = toPoint(rankExtent, crossExtent);
+  return { nodes, edges, width: extent.x, height: extent.y };
+}
+function dagEdgePath(points, direction = "LR") {
+  if (points.length === 0) return "";
+  const round = (n) => Math.round(n * 10) / 10;
+  const first = points[0];
+  let d = `M${round(first.x)},${round(first.y)}`;
+  for (let i = 1; i < points.length; i++) {
+    const a = points[i - 1];
+    const b = points[i];
+    if (direction === "LR") {
+      const mid = (a.x + b.x) / 2;
+      d += ` C${round(mid)},${round(a.y)} ${round(mid)},${round(b.y)} ${round(b.x)},${round(b.y)}`;
+    } else {
+      const mid = (a.y + b.y) / 2;
+      d += ` C${round(a.x)},${round(mid)} ${round(b.x)},${round(mid)} ${round(b.x)},${round(b.y)}`;
+    }
+  }
+  return d;
+}
+export {
+  dagEdgeId,
+  dagEdgePath,
+  dagLayout
+};
+//# sourceMappingURL=dagLayout.js.map

package/dist/source/components/dataDisplay/dagView/dagLayout.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../src/components/dataDisplay/dagView/dagLayout.ts"],
+  "sourcesContent": ["// A layered (Sugiyama-style) layout for directed graphs: pure, synchronous and\n// deterministic, with no imports from Solid or the DOM, so the server and the\n// browser compute the same picture and a React port can copy the file as is.\n//\n// Steps: normalise the input; reverse the back edges of cycles; put each node\n// in a layer by the longest path from the sources; split edges that span\n// several layers with dummy points; order each layer by barycenter sweeps to\n// cut crossings; place nodes along the layer, pulled toward their neighbours\n// without overlapping; lay disconnected parts side by side; route each edge as\n// a list of points through its dummies.\n\n/** Which way the layers run: left to right, or top to bottom. */\nexport type DagDirection = \"LR\" | \"TB\";\n\nexport interface DagLayoutInputNode {\n  id: string;\n  width: number;\n  height: number;\n}\n\nexport interface DagLayoutInputEdge {\n  /** `source->target` unless given. */\n  id?: string | undefined;\n  source: string;\n  target: string;\n}\n\nexport interface DagLayoutInput {\n  nodes: readonly DagLayoutInputNode[];\n  edges: readonly DagLayoutInputEdge[];\n  /** \"LR\" by default. */\n  direction?: DagDirection | undefined;\n  /** The space between layers; 64 by default. */\n  rankGap?: number | undefined;\n  /** The space between nodes in a layer, and twice it between disconnected parts; 24 by default. */\n  nodeGap?: number | undefined;\n  /** Ordering sweeps (down and up count as one each); 8 by default. */\n  sweeps?: number | undefined;\n  /** Told what was dropped from the input: unknown ids, self-loops, duplicates. */\n  warn?: ((message: string) => void) | undefined;\n}\n\nexport interface DagPoint {\n  x: number;\n  y: number;\n}\n\nexport interface DagLayoutNode {\n  id: string;\n  /** The left edge. */\n  x: number;\n  /** The top edge. */\n  y: number;\n  width: number;\n  height: number;\n  /** The node's layer, 0 for the first. */\n  layer: number;\n  /** The node's place in its layer, 0 for the first (dummies included). */\n  order: number;\n}\n\nexport interface DagLayoutEdge {\n  id: string;\n  source: string;\n  target: string;\n  /** From the source's side to the target's side, through the layers between. */\n  points: DagPoint[];\n  /** The edge closes a cycle and was drawn against the layer direction. */\n  reversed: boolean;\n}\n\nexport interface DagLayoutResult {\n  /** Every node drawn, in input order. */\n  nodes: Map<string, DagLayoutNode>;\n  /** Every edge drawn, in input order. */\n  edges: DagLayoutEdge[];\n  width: number;\n  height: number;\n}\n\n/** The id an edge is drawn and highlighted by. */\nexport const dagEdgeId = (edge: DagLayoutInputEdge): string => edge.id ?? `${edge.source}->${edge.target}`;\n\ninterface Vertex {\n  /** Index into the real nodes, or -1 for a dummy. */\n  node: number;\n  /** Size along the layer axis (width in LR) and across it. */\n  rankSize: number;\n  crossSize: number;\n  layer: number;\n  /** Centre across the layer axis. */\n  cross: number;\n  preds: number[];\n  succs: number[];\n}\n\ninterface Segment {\n  /** The edge's index in the normalised list. */\n  edge: number;\n  /** Vertices from the layered source to the layered target, dummies between. */\n  chain: number[];\n}\n\n// ---- Steps 1-2: normalise, break cycles ----\n\ninterface Normalised {\n  nodes: DagLayoutInputNode[];\n  index: Map<string, number>;\n  edges: Array<{ id: string; source: string; target: string; from: number; to: number; reversed: boolean }>;\n}\n\nfunction normalise(input: DagLayoutInput): Normalised {\n  const warn = input.warn ?? (() => undefined);\n  const nodes: DagLayoutInputNode[] = [];\n  const index = new Map<string, number>();\n  for (const node of input.nodes) {\n    if (index.has(node.id)) {\n      warn(`node \"${node.id}\" is listed twice; the second is dropped.`);\n      continue;\n    }\n    index.set(node.id, nodes.length);\n    nodes.push(node);\n  }\n  const edges: Normalised[\"edges\"] = [];\n  const pairs = new Set<string>();\n  const ids = new Set<string>();\n  for (const edge of input.edges) {\n    const from = index.get(edge.source);\n    const to = index.get(edge.target);\n    if (from === undefined || to === undefined) {\n      const missing = from === undefined ? edge.source : edge.target;\n      warn(`edge ${edge.source} -> ${edge.target} names an unknown node \"${missing}\"; it is dropped.`);\n      continue;\n    }\n    if (from === to) {\n      warn(`edge ${edge.source} -> ${edge.target} is a self-loop; it is dropped.`);\n      continue;\n    }\n    const pair = `${from} ${to}`;\n    const id = dagEdgeId(edge);\n    if (pairs.has(pair) || ids.has(id)) {\n      warn(`edge ${edge.source} -> ${edge.target} is listed twice; the second is dropped.`);\n      continue;\n    }\n    pairs.add(pair);\n    ids.add(id);\n    edges.push({ id, source: edge.source, target: edge.target, from, to, reversed: false });\n  }\n\n  // A depth-first walk in input order: an edge to a node still on the stack\n  // closes a cycle, and is turned around so the rest can be layered.\n  const out: number[][] = nodes.map(() => []);\n  edges.forEach((edge, i) => out[edge.from]!.push(i));\n  const state = new Uint8Array(nodes.length); // 0 new, 1 on the stack, 2 done\n  for (let root = 0; root < nodes.length; root++) {\n    if (state[root]) continue;\n    const stack: Array<[number, number]> = [[root, 0]];\n    state[root] = 1;\n    while (stack.length) {\n      const top = stack[stack.length - 1]!;\n      const [v, next] = top;\n      const list = out[v]!;\n      if (next >= list.length) {\n        state[v] = 2;\n        stack.pop();\n        continue;\n      }\n      top[1] = next + 1;\n      const edge = edges[list[next]!]!;\n      if (state[edge.to] === 1) edge.reversed = true;\n      else if (state[edge.to] === 0) {\n        state[edge.to] = 1;\n        stack.push([edge.to, 0]);\n      }\n    }\n  }\n  return { nodes, index, edges };\n}\n\n// ---- Step 3: layers by the longest path ----\n\nfunction assignLayers(count: number, arcs: Array<[number, number]>): number[] {\n  const out: number[][] = Array.from({ length: count }, () => []);\n  const inDegree = new Array<number>(count).fill(0);\n  for (const [u, v] of arcs) {\n    out[u]!.push(v);\n    inDegree[v]!++;\n  }\n  const hasPred = inDegree.map((d) => d > 0);\n  const layer = new Array<number>(count).fill(0);\n  const order: number[] = [];\n  const queue: number[] = [];\n  for (let v = 0; v < count; v++) if (inDegree[v] === 0) queue.push(v);\n  for (let head = 0; head < queue.length; head++) {\n    const u = queue[head]!;\n    order.push(u);\n    for (const v of out[u]!) {\n      layer[v] = Math.max(layer[v]!, layer[u]! + 1);\n      if (--inDegree[v]! === 0) queue.push(v);\n    }\n  }\n  // A source sits just before the first layer it feeds, not in layer 0 with a\n  // long edge across: a late input stays next to the step that reads it.\n  for (let i = order.length - 1; i >= 0; i--) {\n    const v = order[i]!;\n    const succs = out[v]!;\n    if (succs.length === 0 || hasPred[v]) continue;\n    layer[v] = Math.min(...succs.map((s) => layer[s]!)) - 1;\n  }\n  return layer;\n}\n\n// ---- Step 5: ordering ----\n\n/** Crossings between two neighbouring layers, by counting inversions. */\nfunction crossingsBetween(upper: number[], vertices: Vertex[], position: Int32Array): number {\n  const pairs: Array<[number, number]> = [];\n  for (const u of upper) for (const v of vertices[u]!.succs) pairs.push([position[u]!, position[v]!]);\n  pairs.sort((a, b) => a[0] - b[0] || a[1] - b[1]);\n  // Inversions of the lower ends, with a Fenwick tree.\n  let size = 1;\n  for (const [, b] of pairs) size = Math.max(size, b + 2);\n  const tree = new Int32Array(size + 1);\n  let crossings = 0;\n  for (let i = pairs.length - 1; i >= 0; i--) {\n    const b = pairs[i]![1];\n    for (let j = b; j > 0; j -= j & -j) crossings += tree[j]!;\n    for (let j = b + 1; j <= size; j += j & -j) tree[j]!++;\n  }\n  return crossings;\n}\n\nfunction totalCrossings(layers: number[][], vertices: Vertex[], position: Int32Array): number {\n  let sum = 0;\n  for (let l = 0; l + 1 < layers.length; l++) sum += crossingsBetween(layers[l]!, vertices, position);\n  return sum;\n}\n\nfunction reorder(layer: number[], vertices: Vertex[], position: Int32Array, down: boolean): void {\n  const key = new Map<number, number>();\n  for (const v of layer) {\n    const neighbours = down ? vertices[v]!.preds : vertices[v]!.succs;\n    if (neighbours.length === 0) key.set(v, position[v]!);\n    else key.set(v, neighbours.reduce((sum, n) => sum + position[n]!, 0) / neighbours.length);\n  }\n  // Ties keep the current order, so the result is the same on every run.\n  layer.sort((a, b) => key.get(a)! - key.get(b)! || position[a]! - position[b]!);\n  layer.forEach((v, i) => (position[v] = i));\n}\n\nfunction orderLayers(layers: number[][], vertices: Vertex[], sweeps: number): void {\n  const position = new Int32Array(vertices.length);\n  for (const layer of layers) layer.forEach((v, i) => (position[v] = i));\n  let best = layers.map((layer) => layer.slice());\n  let bestCrossings = totalCrossings(layers, vertices, position);\n  let stale = 0;\n  for (let sweep = 0; sweep < sweeps && bestCrossings > 0; sweep++) {\n    const down = sweep % 2 === 0;\n    if (down) for (let l = 1; l < layers.length; l++) reorder(layers[l]!, vertices, position, true);\n    else for (let l = layers.length - 2; l >= 0; l--) reorder(layers[l]!, vertices, position, false);\n    const crossings = totalCrossings(layers, vertices, position);\n    if (crossings < bestCrossings) {\n      bestCrossings = crossings;\n      best = layers.map((layer) => layer.slice());\n      stale = 0;\n    } else if (++stale >= 2) break;\n  }\n  best.forEach((layer, l) => (layers[l] = layer));\n}\n\n// ---- Step 6: positions across the layer ----\n\n/**\n * Centres as close to `desired` as they can get, in order, at least `gap`\n * apart: an isotonic regression by pooling adjacent violators.\n */\nfunction place(desired: number[], gaps: number[], weights: number[]): number[] {\n  // Shift out the gaps, so the constraint becomes \"non-decreasing\".\n  const offset: number[] = [0];\n  for (let i = 1; i < desired.length; i++) offset.push(offset[i - 1]! + gaps[i - 1]!);\n  const blocks: Array<{ value: number; weight: number; count: number }> = [];\n  desired.forEach((d, i) => {\n    let block = { value: d - offset[i]!, weight: weights[i]!, count: 1 };\n    while (blocks.length && blocks[blocks.length - 1]!.value > block.value) {\n      const last = blocks.pop()!;\n      const weight = last.weight + block.weight;\n      block = {\n        value: (last.value * last.weight + block.value * block.weight) / weight,\n        weight,\n        count: last.count + block.count,\n      };\n    }\n    blocks.push(block);\n  });\n  const result: number[] = [];\n  for (const block of blocks) for (let k = 0; k < block.count; k++) result.push(block.value + offset[result.length]!);\n  return result;\n}\n\nfunction assignCross(layers: number[][], vertices: Vertex[], nodeGap: number): void {\n  const gapBetween = (a: number, b: number): number => {\n    const va = vertices[a]!;\n    const vb = vertices[b]!;\n    // Dummies keep less room between each other than real nodes do.\n    const gap = va.node < 0 && vb.node < 0 ? nodeGap / 2 : nodeGap;\n    return va.crossSize / 2 + gap + vb.crossSize / 2;\n  };\n  for (const layer of layers) {\n    let at = 0;\n    layer.forEach((v, i) => {\n      if (i > 0) at += gapBetween(layer[i - 1]!, v);\n      vertices[v]!.cross = at;\n    });\n  }\n  // Pull toward the neighbours: down from the layer before, up from the layer\n  // after, and once more from both sides. Dummies weigh more, so long edges run straight.\n  const passes: Array<\"down\" | \"up\" | \"both\"> = [\"down\", \"up\", \"down\", \"up\", \"both\", \"both\"];\n  for (const pass of passes) {\n    const range = pass === \"up\" ? layers.map((_, l) => layers.length - 1 - l) : layers.map((_, l) => l);\n    for (const l of range) {\n      const layer = layers[l]!;\n      if (layer.length === 0) continue;\n      const desired = layer.map((v) => {\n        const vertex = vertices[v]!;\n        const neighbours =\n          pass === \"down\" ? vertex.preds : pass === \"up\" ? vertex.succs : [...vertex.preds, ...vertex.succs];\n        if (neighbours.length === 0) return vertex.cross;\n        return neighbours.reduce((sum, n) => sum + vertices[n]!.cross, 0) / neighbours.length;\n      });\n      const gaps = layer.slice(1).map((v, i) => gapBetween(layer[i]!, v));\n      const weights = layer.map((v) => (vertices[v]!.node < 0 ? 2 : 1));\n      place(desired, gaps, weights).forEach((cross, i) => (vertices[layer[i]!]!.cross = cross));\n    }\n  }\n}\n\n// ---- Steps 4, 7, 8: one connected part, then all of them ----\n\ninterface PartLayout {\n  /** Real node index \u2192 its rectangle in part coordinates (rank, cross). */\n  nodes: Map<number, { rank: number; cross: number; layer: number; order: number }>;\n  /** Edge index \u2192 points in part coordinates (rank, cross). */\n  edges: Map<number, Array<{ rank: number; cross: number }>>;\n  rankExtent: number;\n  crossExtent: number;\n}\n\nfunction layoutPart(\n  members: number[],\n  graph: Normalised,\n  edgeList: number[],\n  rankSizeOf: (n: number) => number,\n  crossSizeOf: (n: number) => number,\n  rankGap: number,\n  nodeGap: number,\n  sweeps: number\n): PartLayout {\n  const local = new Map<number, number>();\n  members.forEach((n, i) => local.set(n, i));\n  const arcs: Array<[number, number]> = edgeList.map((e) => {\n    const edge = graph.edges[e]!;\n    const from = local.get(edge.from)!;\n    const to = local.get(edge.to)!;\n    return edge.reversed ? [to, from] : [from, to];\n  });\n  const layerOf = assignLayers(members.length, arcs);\n\n  const vertices: Vertex[] = members.map((n, i) => ({\n    node: n,\n    rankSize: rankSizeOf(n),\n    crossSize: crossSizeOf(n),\n    layer: layerOf[i]!,\n    cross: 0,\n    preds: [],\n    succs: [],\n  }));\n  const segments: Segment[] = edgeList.map((e, k) => {\n    const [from, to] = arcs[k]!;\n    const chain = [from];\n    let previous = from;\n    for (let l = vertices[from]!.layer + 1; l < vertices[to]!.layer; l++) {\n      const dummy = vertices.length;\n      vertices.push({ node: -1, rankSize: 0, crossSize: 0, layer: l, cross: 0, preds: [], succs: [] });\n      vertices[previous]!.succs.push(dummy);\n      vertices[dummy]!.preds.push(previous);\n      chain.push(dummy);\n      previous = dummy;\n    }\n    vertices[previous]!.succs.push(to);\n    vertices[to]!.preds.push(previous);\n    chain.push(to);\n    return { edge: e, chain };\n  });\n\n  // Each layer starts in the order of first appearance in a walk from the\n  // sources in input order; the sweeps take it from there.\n  const layerCount = vertices.reduce((max, v) => Math.max(max, v.layer + 1), 0);\n  const layers: number[][] = Array.from({ length: layerCount }, () => []);\n  vertices.forEach((v, i) => layers[v.layer]!.push(i));\n  orderLayers(layers, vertices, sweeps);\n  assignCross(layers, vertices, nodeGap);\n\n  // Layer bands along the rank axis: each as thick as its thickest node.\n  const thickness = layers.map((layer) => layer.reduce((max, v) => Math.max(max, vertices[v]!.rankSize), 0));\n  const start: number[] = [];\n  let rank = 0;\n  thickness.forEach((t, l) => {\n    start[l] = rank;\n    rank += t + (l + 1 < thickness.length ? rankGap : 0);\n  });\n\n  let minCross = Infinity;\n  let maxCross = -Infinity;\n  for (const v of vertices) {\n    minCross = Math.min(minCross, v.cross - v.crossSize / 2);\n    maxCross = Math.max(maxCross, v.cross + v.crossSize / 2);\n  }\n  const shift = Number.isFinite(minCross) ? -minCross : 0;\n\n  const nodes: PartLayout[\"nodes\"] = new Map();\n  layers.forEach((layer, l) =>\n    layer.forEach((v, order) => {\n      const vertex = vertices[v]!;\n      if (vertex.node < 0) return;\n      nodes.set(vertex.node, {\n        rank: start[l]! + (thickness[l]! - vertex.rankSize) / 2,\n        cross: vertex.cross - vertex.crossSize / 2 + shift,\n        layer: l,\n        order,\n      });\n    })\n  );\n\n  const edges: PartLayout[\"edges\"] = new Map();\n  for (const { edge, chain } of segments) {\n    const points: Array<{ rank: number; cross: number }> = [];\n    chain.forEach((v, i) => {\n      const vertex = vertices[v]!;\n      const l = vertex.layer;\n      const cross = vertex.cross + shift;\n      const bandStart = start[l]! + (thickness[l]! - vertex.rankSize) / 2;\n      if (i === 0) points.push({ rank: bandStart + vertex.rankSize, cross });\n      else if (i === chain.length - 1) points.push({ rank: bandStart, cross });\n      else {\n        // Straight through the band of a layer it skips, so it never cuts a node.\n        points.push({ rank: start[l]!, cross }, { rank: start[l]! + thickness[l]!, cross });\n      }\n    });\n    if (graph.edges[edge]!.reversed) points.reverse();\n    edges.set(edge, points);\n  }\n\n  return {\n    nodes,\n    edges,\n    rankExtent: rank,\n    crossExtent: Number.isFinite(maxCross) ? maxCross - minCross : 0,\n  };\n}\n\n/**\n * Lays out a directed graph in layers. Never throws: unknown ids, self-loops\n * and duplicates are dropped (and reported through `warn`), and the edges that\n * close a cycle are drawn against the layer direction, marked `reversed`.\n */\nexport function dagLayout(input: DagLayoutInput): DagLayoutResult {\n  const direction = input.direction ?? \"LR\";\n  const rankGap = input.rankGap ?? 64;\n  const nodeGap = input.nodeGap ?? 24;\n  const sweeps = input.sweeps ?? 8;\n  const graph = normalise(input);\n  const lr = direction === \"LR\";\n  const rankSizeOf = (n: number): number => (lr ? graph.nodes[n]!.width : graph.nodes[n]!.height);\n  const crossSizeOf = (n: number): number => (lr ? graph.nodes[n]!.height : graph.nodes[n]!.width);\n\n  // Connected parts (edges taken both ways), in the order of their first node.\n  const parent = graph.nodes.map((_, i) => i);\n  const find = (v: number): number => {\n    while (parent[v] !== v) {\n      parent[v] = parent[parent[v]!]!;\n      v = parent[v]!;\n    }\n    return v;\n  };\n  for (const edge of graph.edges) {\n    const a = find(edge.from);\n    const b = find(edge.to);\n    if (a !== b) parent[Math.max(a, b)] = Math.min(a, b);\n  }\n  const parts = new Map<number, { members: number[]; edges: number[] }>();\n  graph.nodes.forEach((_, i) => {\n    const root = find(i);\n    if (!parts.has(root)) parts.set(root, { members: [], edges: [] });\n    parts.get(root)!.members.push(i);\n  });\n  graph.edges.forEach((edge, e) => parts.get(find(edge.from))!.edges.push(e));\n\n  const placedNodes = new Map<number, DagLayoutNode>();\n  const placedEdges = new Map<number, DagPoint[]>();\n  const toPoint = (rank: number, cross: number): DagPoint => (lr ? { x: rank, y: cross } : { x: cross, y: rank });\n  let crossAt = 0;\n  let rankExtent = 0;\n  for (const part of parts.values()) {\n    const laid = layoutPart(part.members, graph, part.edges, rankSizeOf, crossSizeOf, rankGap, nodeGap, sweeps);\n    for (const [n, p] of laid.nodes) {\n      const node = graph.nodes[n]!;\n      placedNodes.set(n, {\n        id: node.id,\n        ...toPoint(p.rank, p.cross + crossAt),\n        width: node.width,\n        height: node.height,\n        layer: p.layer,\n        order: p.order,\n      });\n    }\n    for (const [e, points] of laid.edges) {\n      placedEdges.set(\n        e,\n        points.map((p) => toPoint(p.rank, p.cross + crossAt))\n      );\n    }\n    rankExtent = Math.max(rankExtent, laid.rankExtent);\n    crossAt += laid.crossExtent + nodeGap * 2;\n  }\n  const crossExtent = Math.max(0, crossAt - nodeGap * 2);\n\n  const nodes = new Map<string, DagLayoutNode>();\n  graph.nodes.forEach((node, i) => nodes.set(node.id, placedNodes.get(i)!));\n  // A two-cycle (a->b and b->a) would draw both edges on one curve: the\n  // turned-around one moves across, still ending on both nodes.\n  const pairs = new Set(graph.edges.map((edge) => `${edge.from} ${edge.to}`));\n  const edges = graph.edges.map((edge, e) => {\n    let points = placedEdges.get(e)!;\n    if (edge.reversed && pairs.has(`${edge.to} ${edge.from}`)) {\n      const across = (n: number): number => (lr ? graph.nodes[n]!.height : graph.nodes[n]!.width);\n      const offset = Math.min(8, across(edge.from) / 4, across(edge.to) / 4);\n      points = points.map((p) => (lr ? { x: p.x, y: p.y + offset } : { x: p.x + offset, y: p.y }));\n    }\n    return { id: edge.id, source: edge.source, target: edge.target, points, reversed: edge.reversed };\n  });\n  const extent = toPoint(rankExtent, crossExtent);\n  return { nodes, edges, width: extent.x, height: extent.y };\n}\n\n/**\n * An SVG path through an edge's points: a smooth S-curve between layers, a\n * straight line through the layers it skips.\n */\nexport function dagEdgePath(points: readonly DagPoint[], direction: DagDirection = \"LR\"): string {\n  if (points.length === 0) return \"\";\n  const round = (n: number): number => Math.round(n * 10) / 10;\n  const first = points[0]!;\n  let d = `M${round(first.x)},${round(first.y)}`;\n  for (let i = 1; i < points.length; i++) {\n    const a = points[i - 1]!;\n    const b = points[i]!;\n    if (direction === \"LR\") {\n      const mid = (a.x + b.x) / 2;\n      d += ` C${round(mid)},${round(a.y)} ${round(mid)},${round(b.y)} ${round(b.x)},${round(b.y)}`;\n    } else {\n      const mid = (a.y + b.y) / 2;\n      d += ` C${round(a.x)},${round(mid)} ${round(b.x)},${round(mid)} ${round(b.x)},${round(b.y)}`;\n    }\n  }\n  return d;\n}\n"],
+  "mappings": "AAiFO,MAAM,YAAY,CAAC,SAAqC,KAAK,MAAM,GAAG,KAAK,MAAM,KAAK,KAAK,MAAM;AA8BxG,SAAS,UAAU,OAAmC;AACpD,QAAM,OAAO,MAAM,SAAS,MAAM;AAClC,QAAM,QAA8B,CAAC;AACrC,QAAM,QAAQ,oBAAI,IAAoB;AACtC,aAAW,QAAQ,MAAM,OAAO;AAC9B,QAAI,MAAM,IAAI,KAAK,EAAE,GAAG;AACtB,WAAK,SAAS,KAAK,EAAE,2CAA2C;AAChE;AAAA,IACF;AACA,UAAM,IAAI,KAAK,IAAI,MAAM,MAAM;AAC/B,UAAM,KAAK,IAAI;AAAA,EACjB;AACA,QAAM,QAA6B,CAAC;AACpC,QAAM,QAAQ,oBAAI,IAAY;AAC9B,QAAM,MAAM,oBAAI,IAAY;AAC5B,aAAW,QAAQ,MAAM,OAAO;AAC9B,UAAM,OAAO,MAAM,IAAI,KAAK,MAAM;AAClC,UAAM,KAAK,MAAM,IAAI,KAAK,MAAM;AAChC,QAAI,SAAS,UAAa,OAAO,QAAW;AAC1C,YAAM,UAAU,SAAS,SAAY,KAAK,SAAS,KAAK;AACxD,WAAK,QAAQ,KAAK,MAAM,OAAO,KAAK,MAAM,2BAA2B,OAAO,mBAAmB;AAC/F;AAAA,IACF;AACA,QAAI,SAAS,IAAI;AACf,WAAK,QAAQ,KAAK,MAAM,OAAO,KAAK,MAAM,iCAAiC;AAC3E;AAAA,IACF;AACA,UAAM,OAAO,GAAG,IAAI,IAAI,EAAE;AAC1B,UAAM,KAAK,UAAU,IAAI;AACzB,QAAI,MAAM,IAAI,IAAI,KAAK,IAAI,IAAI,EAAE,GAAG;AAClC,WAAK,QAAQ,KAAK,MAAM,OAAO,KAAK,MAAM,0CAA0C;AACpF;AAAA,IACF;AACA,UAAM,IAAI,IAAI;AACd,QAAI,IAAI,EAAE;AACV,UAAM,KAAK,EAAE,IAAI,QAAQ,KAAK,QAAQ,QAAQ,KAAK,QAAQ,MAAM,IAAI,UAAU,MAAM,CAAC;AAAA,EACxF;AAIA,QAAM,MAAkB,MAAM,IAAI,MAAM,CAAC,CAAC;AAC1C,QAAM,QAAQ,CAAC,MAAM,MAAM,IAAI,KAAK,IAAI,EAAG,KAAK,CAAC,CAAC;AAClD,QAAM,QAAQ,IAAI,WAAW,MAAM,MAAM;AACzC,WAAS,OAAO,GAAG,OAAO,MAAM,QAAQ,QAAQ;AAC9C,QAAI,MAAM,IAAI,EAAG;AACjB,UAAM,QAAiC,CAAC,CAAC,MAAM,CAAC,CAAC;AACjD,UAAM,IAAI,IAAI;AACd,WAAO,MAAM,QAAQ;AACnB,YAAM,MAAM,MAAM,MAAM,SAAS,CAAC;AAClC,YAAM,CAAC,GAAG,IAAI,IAAI;AAClB,YAAM,OAAO,IAAI,CAAC;AAClB,UAAI,QAAQ,KAAK,QAAQ;AACvB,cAAM,CAAC,IAAI;AACX,cAAM,IAAI;AACV;AAAA,MACF;AACA,UAAI,CAAC,IAAI,OAAO;AAChB,YAAM,OAAO,MAAM,KAAK,IAAI,CAAE;AAC9B,UAAI,MAAM,KAAK,EAAE,MAAM,EAAG,MAAK,WAAW;AAAA,eACjC,MAAM,KAAK,EAAE,MAAM,GAAG;AAC7B,cAAM,KAAK,EAAE,IAAI;AACjB,cAAM,KAAK,CAAC,KAAK,IAAI,CAAC,CAAC;AAAA,MACzB;AAAA,IACF;AAAA,EACF;AACA,SAAO,EAAE,OAAO,OAAO,MAAM;AAC/B;AAIA,SAAS,aAAa,OAAe,MAAyC;AAC5E,QAAM,MAAkB,MAAM,KAAK,EAAE,QAAQ,MAAM,GAAG,MAAM,CAAC,CAAC;AAC9D,QAAM,WAAW,IAAI,MAAc,KAAK,EAAE,KAAK,CAAC;AAChD,aAAW,CAAC,GAAG,CAAC,KAAK,MAAM;AACzB,QAAI,CAAC,EAAG,KAAK,CAAC;AACd,aAAS,CAAC;AAAA,EACZ;AACA,QAAM,UAAU,SAAS,IAAI,CAAC,MAAM,IAAI,CAAC;AACzC,QAAM,QAAQ,IAAI,MAAc,KAAK,EAAE,KAAK,CAAC;AAC7C,QAAM,QAAkB,CAAC;AACzB,QAAM,QAAkB,CAAC;AACzB,WAAS,IAAI,GAAG,IAAI,OAAO,IAAK,KAAI,SAAS,CAAC,MAAM,EAAG,OAAM,KAAK,CAAC;AACnE,WAAS,OAAO,GAAG,OAAO,MAAM,QAAQ,QAAQ;AAC9C,UAAM,IAAI,MAAM,IAAI;AACpB,UAAM,KAAK,CAAC;AACZ,eAAW,KAAK,IAAI,CAAC,GAAI;AACvB,YAAM,CAAC,IAAI,KAAK,IAAI,MAAM,CAAC,GAAI,MAAM,CAAC,IAAK,CAAC;AAC5C,UAAI,EAAE,SAAS,CAAC,MAAO,EAAG,OAAM,KAAK,CAAC;AAAA,IACxC;AAAA,EACF;AAGA,WAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,UAAM,IAAI,MAAM,CAAC;AACjB,UAAM,QAAQ,IAAI,CAAC;AACnB,QAAI,MAAM,WAAW,KAAK,QAAQ,CAAC,EAAG;AACtC,UAAM,CAAC,IAAI,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC,MAAM,MAAM,CAAC,CAAE,CAAC,IAAI;AAAA,EACxD;AACA,SAAO;AACT;AAKA,SAAS,iBAAiB,OAAiB,UAAoB,UAA8B;AAC3F,QAAM,QAAiC,CAAC;AACxC,aAAW,KAAK,MAAO,YAAW,KAAK,SAAS,CAAC,EAAG,MAAO,OAAM,KAAK,CAAC,SAAS,CAAC,GAAI,SAAS,CAAC,CAAE,CAAC;AAClG,QAAM,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAE/C,MAAI,OAAO;AACX,aAAW,CAAC,EAAE,CAAC,KAAK,MAAO,QAAO,KAAK,IAAI,MAAM,IAAI,CAAC;AACtD,QAAM,OAAO,IAAI,WAAW,OAAO,CAAC;AACpC,MAAI,YAAY;AAChB,WAAS,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,UAAM,IAAI,MAAM,CAAC,EAAG,CAAC;AACrB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,CAAC,EAAG,cAAa,KAAK,CAAC;AACvD,aAAS,IAAI,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,CAAC,EAAG,MAAK,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAEA,SAAS,eAAe,QAAoB,UAAoB,UAA8B;AAC5F,MAAI,MAAM;AACV,WAAS,IAAI,GAAG,IAAI,IAAI,OAAO,QAAQ,IAAK,QAAO,iBAAiB,OAAO,CAAC,GAAI,UAAU,QAAQ;AAClG,SAAO;AACT;AAEA,SAAS,QAAQ,OAAiB,UAAoB,UAAsB,MAAqB;AAC/F,QAAM,MAAM,oBAAI,IAAoB;AACpC,aAAW,KAAK,OAAO;AACrB,UAAM,aAAa,OAAO,SAAS,CAAC,EAAG,QAAQ,SAAS,CAAC,EAAG;AAC5D,QAAI,WAAW,WAAW,EAAG,KAAI,IAAI,GAAG,SAAS,CAAC,CAAE;AAAA,QAC/C,KAAI,IAAI,GAAG,WAAW,OAAO,CAAC,KAAK,MAAM,MAAM,SAAS,CAAC,GAAI,CAAC,IAAI,WAAW,MAAM;AAAA,EAC1F;AAEA,QAAM,KAAK,CAAC,GAAG,MAAM,IAAI,IAAI,CAAC,IAAK,IAAI,IAAI,CAAC,KAAM,SAAS,CAAC,IAAK,SAAS,CAAC,CAAE;AAC7E,QAAM,QAAQ,CAAC,GAAG,MAAO,SAAS,CAAC,IAAI,CAAE;AAC3C;AAEA,SAAS,YAAY,QAAoB,UAAoB,QAAsB;AACjF,QAAM,WAAW,IAAI,WAAW,SAAS,MAAM;AAC/C,aAAW,SAAS,OAAQ,OAAM,QAAQ,CAAC,GAAG,MAAO,SAAS,CAAC,IAAI,CAAE;AACrE,MAAI,OAAO,OAAO,IAAI,CAAC,UAAU,MAAM,MAAM,CAAC;AAC9C,MAAI,gBAAgB,eAAe,QAAQ,UAAU,QAAQ;AAC7D,MAAI,QAAQ;AACZ,WAAS,QAAQ,GAAG,QAAQ,UAAU,gBAAgB,GAAG,SAAS;AAChE,UAAM,OAAO,QAAQ,MAAM;AAC3B,QAAI,KAAM,UAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,SAAQ,OAAO,CAAC,GAAI,UAAU,UAAU,IAAI;AAAA,QACzF,UAAS,IAAI,OAAO,SAAS,GAAG,KAAK,GAAG,IAAK,SAAQ,OAAO,CAAC,GAAI,UAAU,UAAU,KAAK;AAC/F,UAAM,YAAY,eAAe,QAAQ,UAAU,QAAQ;AAC3D,QAAI,YAAY,eAAe;AAC7B,sBAAgB;AAChB,aAAO,OAAO,IAAI,CAAC,UAAU,MAAM,MAAM,CAAC;AAC1C,cAAQ;AAAA,IACV,WAAW,EAAE,SAAS,EAAG;AAAA,EAC3B;AACA,OAAK,QAAQ,CAAC,OAAO,MAAO,OAAO,CAAC,IAAI,KAAM;AAChD;AAQA,SAAS,MAAM,SAAmB,MAAgB,SAA6B;AAE7E,QAAM,SAAmB,CAAC,CAAC;AAC3B,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAAK,QAAO,KAAK,OAAO,IAAI,CAAC,IAAK,KAAK,IAAI,CAAC,CAAE;AAClF,QAAM,SAAkE,CAAC;AACzE,UAAQ,QAAQ,CAAC,GAAG,MAAM;AACxB,QAAI,QAAQ,EAAE,OAAO,IAAI,OAAO,CAAC,GAAI,QAAQ,QAAQ,CAAC,GAAI,OAAO,EAAE;AACnE,WAAO,OAAO,UAAU,OAAO,OAAO,SAAS,CAAC,EAAG,QAAQ,MAAM,OAAO;AACtE,YAAM,OAAO,OAAO,IAAI;AACxB,YAAM,SAAS,KAAK,SAAS,MAAM;AACnC,cAAQ;AAAA,QACN,QAAQ,KAAK,QAAQ,KAAK,SAAS,MAAM,QAAQ,MAAM,UAAU;AAAA,QACjE;AAAA,QACA,OAAO,KAAK,QAAQ,MAAM;AAAA,MAC5B;AAAA,IACF;AACA,WAAO,KAAK,KAAK;AAAA,EACnB,CAAC;AACD,QAAM,SAAmB,CAAC;AAC1B,aAAW,SAAS,OAAQ,UAAS,IAAI,GAAG,IAAI,MAAM,OAAO,IAAK,QAAO,KAAK,MAAM,QAAQ,OAAO,OAAO,MAAM,CAAE;AAClH,SAAO;AACT;AAEA,SAAS,YAAY,QAAoB,UAAoB,SAAuB;AAClF,QAAM,aAAa,CAAC,GAAW,MAAsB;AACnD,UAAM,KAAK,SAAS,CAAC;AACrB,UAAM,KAAK,SAAS,CAAC;AAErB,UAAM,MAAM,GAAG,OAAO,KAAK,GAAG,OAAO,IAAI,UAAU,IAAI;AACvD,WAAO,GAAG,YAAY,IAAI,MAAM,GAAG,YAAY;AAAA,EACjD;AACA,aAAW,SAAS,QAAQ;AAC1B,QAAI,KAAK;AACT,UAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,UAAI,IAAI,EAAG,OAAM,WAAW,MAAM,IAAI,CAAC,GAAI,CAAC;AAC5C,eAAS,CAAC,EAAG,QAAQ;AAAA,IACvB,CAAC;AAAA,EACH;AAGA,QAAM,SAAwC,CAAC,QAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM;AACzF,aAAW,QAAQ,QAAQ;AACzB,UAAM,QAAQ,SAAS,OAAO,OAAO,IAAI,CAAC,GAAG,MAAM,OAAO,SAAS,IAAI,CAAC,IAAI,OAAO,IAAI,CAAC,GAAG,MAAM,CAAC;AAClG,eAAW,KAAK,OAAO;AACrB,YAAM,QAAQ,OAAO,CAAC;AACtB,UAAI,MAAM,WAAW,EAAG;AACxB,YAAM,UAAU,MAAM,IAAI,CAAC,MAAM;AAC/B,cAAM,SAAS,SAAS,CAAC;AACzB,cAAM,aACJ,SAAS,SAAS,OAAO,QAAQ,SAAS,OAAO,OAAO,QAAQ,CAAC,GAAG,OAAO,OAAO,GAAG,OAAO,KAAK;AACnG,YAAI,WAAW,WAAW,EAAG,QAAO,OAAO;AAC3C,eAAO,WAAW,OAAO,CAAC,KAAK,MAAM,MAAM,SAAS,CAAC,EAAG,OAAO,CAAC,IAAI,WAAW;AAAA,MACjF,CAAC;AACD,YAAM,OAAO,MAAM,MAAM,CAAC,EAAE,IAAI,CAAC,GAAG,MAAM,WAAW,MAAM,CAAC,GAAI,CAAC,CAAC;AAClE,YAAM,UAAU,MAAM,IAAI,CAAC,MAAO,SAAS,CAAC,EAAG,OAAO,IAAI,IAAI,CAAE;AAChE,YAAM,SAAS,MAAM,OAAO,EAAE,QAAQ,CAAC,OAAO,MAAO,SAAS,MAAM,CAAC,CAAE,EAAG,QAAQ,KAAM;AAAA,IAC1F;AAAA,EACF;AACF;AAaA,SAAS,WACP,SACA,OACA,UACA,YACA,aACA,SACA,SACA,QACY;AACZ,QAAM,QAAQ,oBAAI,IAAoB;AACtC,UAAQ,QAAQ,CAAC,GAAG,MAAM,MAAM,IAAI,GAAG,CAAC,CAAC;AACzC,QAAM,OAAgC,SAAS,IAAI,CAAC,MAAM;AACxD,UAAM,OAAO,MAAM,MAAM,CAAC;AAC1B,UAAM,OAAO,MAAM,IAAI,KAAK,IAAI;AAChC,UAAM,KAAK,MAAM,IAAI,KAAK,EAAE;AAC5B,WAAO,KAAK,WAAW,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE;AAAA,EAC/C,CAAC;AACD,QAAM,UAAU,aAAa,QAAQ,QAAQ,IAAI;AAEjD,QAAM,WAAqB,QAAQ,IAAI,CAAC,GAAG,OAAO;AAAA,IAChD,MAAM;AAAA,IACN,UAAU,WAAW,CAAC;AAAA,IACtB,WAAW,YAAY,CAAC;AAAA,IACxB,OAAO,QAAQ,CAAC;AAAA,IAChB,OAAO;AAAA,IACP,OAAO,CAAC;AAAA,IACR,OAAO,CAAC;AAAA,EACV,EAAE;AACF,QAAM,WAAsB,SAAS,IAAI,CAAC,GAAG,MAAM;AACjD,UAAM,CAAC,MAAM,EAAE,IAAI,KAAK,CAAC;AACzB,UAAM,QAAQ,CAAC,IAAI;AACnB,QAAI,WAAW;AACf,aAAS,IAAI,SAAS,IAAI,EAAG,QAAQ,GAAG,IAAI,SAAS,EAAE,EAAG,OAAO,KAAK;AACpE,YAAM,QAAQ,SAAS;AACvB,eAAS,KAAK,EAAE,MAAM,IAAI,UAAU,GAAG,WAAW,GAAG,OAAO,GAAG,OAAO,GAAG,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;AAC/F,eAAS,QAAQ,EAAG,MAAM,KAAK,KAAK;AACpC,eAAS,KAAK,EAAG,MAAM,KAAK,QAAQ;AACpC,YAAM,KAAK,KAAK;AAChB,iBAAW;AAAA,IACb;AACA,aAAS,QAAQ,EAAG,MAAM,KAAK,EAAE;AACjC,aAAS,EAAE,EAAG,MAAM,KAAK,QAAQ;AACjC,UAAM,KAAK,EAAE;AACb,WAAO,EAAE,MAAM,GAAG,MAAM;AAAA,EAC1B,CAAC;AAID,QAAM,aAAa,SAAS,OAAO,CAAC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC;AAC5E,QAAM,SAAqB,MAAM,KAAK,EAAE,QAAQ,WAAW,GAAG,MAAM,CAAC,CAAC;AACtE,WAAS,QAAQ,CAAC,GAAG,MAAM,OAAO,EAAE,KAAK,EAAG,KAAK,CAAC,CAAC;AACnD,cAAY,QAAQ,UAAU,MAAM;AACpC,cAAY,QAAQ,UAAU,OAAO;AAGrC,QAAM,YAAY,OAAO,IAAI,CAAC,UAAU,MAAM,OAAO,CAAC,KAAK,MAAM,KAAK,IAAI,KAAK,SAAS,CAAC,EAAG,QAAQ,GAAG,CAAC,CAAC;AACzG,QAAM,QAAkB,CAAC;AACzB,MAAI,OAAO;AACX,YAAU,QAAQ,CAAC,GAAG,MAAM;AAC1B,UAAM,CAAC,IAAI;AACX,YAAQ,KAAK,IAAI,IAAI,UAAU,SAAS,UAAU;AAAA,EACpD,CAAC;AAED,MAAI,WAAW;AACf,MAAI,WAAW;AACf,aAAW,KAAK,UAAU;AACxB,eAAW,KAAK,IAAI,UAAU,EAAE,QAAQ,EAAE,YAAY,CAAC;AACvD,eAAW,KAAK,IAAI,UAAU,EAAE,QAAQ,EAAE,YAAY,CAAC;AAAA,EACzD;AACA,QAAM,QAAQ,OAAO,SAAS,QAAQ,IAAI,CAAC,WAAW;AAEtD,QAAM,QAA6B,oBAAI,IAAI;AAC3C,SAAO;AAAA,IAAQ,CAAC,OAAO,MACrB,MAAM,QAAQ,CAAC,GAAG,UAAU;AAC1B,YAAM,SAAS,SAAS,CAAC;AACzB,UAAI,OAAO,OAAO,EAAG;AACrB,YAAM,IAAI,OAAO,MAAM;AAAA,QACrB,MAAM,MAAM,CAAC,KAAM,UAAU,CAAC,IAAK,OAAO,YAAY;AAAA,QACtD,OAAO,OAAO,QAAQ,OAAO,YAAY,IAAI;AAAA,QAC7C,OAAO;AAAA,QACP;AAAA,MACF,CAAC;AAAA,IACH,CAAC;AAAA,EACH;AAEA,QAAM,QAA6B,oBAAI,IAAI;AAC3C,aAAW,EAAE,MAAM,MAAM,KAAK,UAAU;AACtC,UAAM,SAAiD,CAAC;AACxD,UAAM,QAAQ,CAAC,GAAG,MAAM;AACtB,YAAM,SAAS,SAAS,CAAC;AACzB,YAAM,IAAI,OAAO;AACjB,YAAM,QAAQ,OAAO,QAAQ;AAC7B,YAAM,YAAY,MAAM,CAAC,KAAM,UAAU,CAAC,IAAK,OAAO,YAAY;AAClE,UAAI,MAAM,EAAG,QAAO,KAAK,EAAE,MAAM,YAAY,OAAO,UAAU,MAAM,CAAC;AAAA,eAC5D,MAAM,MAAM,SAAS,EAAG,QAAO,KAAK,EAAE,MAAM,WAAW,MAAM,CAAC;AAAA,WAClE;AAEH,eAAO,KAAK,EAAE,MAAM,MAAM,CAAC,GAAI,MAAM,GAAG,EAAE,MAAM,MAAM,CAAC,IAAK,UAAU,CAAC,GAAI,MAAM,CAAC;AAAA,MACpF;AAAA,IACF,CAAC;AACD,QAAI,MAAM,MAAM,IAAI,EAAG,SAAU,QAAO,QAAQ;AAChD,UAAM,IAAI,MAAM,MAAM;AAAA,EACxB;AAEA,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,YAAY;AAAA,IACZ,aAAa,OAAO,SAAS,QAAQ,IAAI,WAAW,WAAW;AAAA,EACjE;AACF;AAOO,SAAS,UAAU,OAAwC;AAChE,QAAM,YAAY,MAAM,aAAa;AACrC,QAAM,UAAU,MAAM,WAAW;AACjC,QAAM,UAAU,MAAM,WAAW;AACjC,QAAM,SAAS,MAAM,UAAU;AAC/B,QAAM,QAAQ,UAAU,KAAK;AAC7B,QAAM,KAAK,cAAc;AACzB,QAAM,aAAa,CAAC,MAAuB,KAAK,MAAM,MAAM,CAAC,EAAG,QAAQ,MAAM,MAAM,CAAC,EAAG;AACxF,QAAM,cAAc,CAAC,MAAuB,KAAK,MAAM,MAAM,CAAC,EAAG,SAAS,MAAM,MAAM,CAAC,EAAG;AAG1F,QAAM,SAAS,MAAM,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC;AAC1C,QAAM,OAAO,CAAC,MAAsB;AAClC,WAAO,OAAO,CAAC,MAAM,GAAG;AACtB,aAAO,CAAC,IAAI,OAAO,OAAO,CAAC,CAAE;AAC7B,UAAI,OAAO,CAAC;AAAA,IACd;AACA,WAAO;AAAA,EACT;AACA,aAAW,QAAQ,MAAM,OAAO;AAC9B,UAAM,IAAI,KAAK,KAAK,IAAI;AACxB,UAAM,IAAI,KAAK,KAAK,EAAE;AACtB,QAAI,MAAM,EAAG,QAAO,KAAK,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC;AAAA,EACrD;AACA,QAAM,QAAQ,oBAAI,IAAoD;AACtE,QAAM,MAAM,QAAQ,CAAC,GAAG,MAAM;AAC5B,UAAM,OAAO,KAAK,CAAC;AACnB,QAAI,CAAC,MAAM,IAAI,IAAI,EAAG,OAAM,IAAI,MAAM,EAAE,SAAS,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC;AAChE,UAAM,IAAI,IAAI,EAAG,QAAQ,KAAK,CAAC;AAAA,EACjC,CAAC;AACD,QAAM,MAAM,QAAQ,CAAC,MAAM,MAAM,MAAM,IAAI,KAAK,KAAK,IAAI,CAAC,EAAG,MAAM,KAAK,CAAC,CAAC;AAE1E,QAAM,cAAc,oBAAI,IAA2B;AACnD,QAAM,cAAc,oBAAI,IAAwB;AAChD,QAAM,UAAU,CAAC,MAAc,UAA6B,KAAK,EAAE,GAAG,MAAM,GAAG,MAAM,IAAI,EAAE,GAAG,OAAO,GAAG,KAAK;AAC7G,MAAI,UAAU;AACd,MAAI,aAAa;AACjB,aAAW,QAAQ,MAAM,OAAO,GAAG;AACjC,UAAM,OAAO,WAAW,KAAK,SAAS,OAAO,KAAK,OAAO,YAAY,aAAa,SAAS,SAAS,MAAM;AAC1G,eAAW,CAAC,GAAG,CAAC,KAAK,KAAK,OAAO;AAC/B,YAAM,OAAO,MAAM,MAAM,CAAC;AAC1B,kBAAY,IAAI,GAAG;AAAA,QACjB,IAAI,KAAK;AAAA,QACT,GAAG,QAAQ,EAAE,MAAM,EAAE,QAAQ,OAAO;AAAA,QACpC,OAAO,KAAK;AAAA,QACZ,QAAQ,KAAK;AAAA,QACb,OAAO,EAAE;AAAA,QACT,OAAO,EAAE;AAAA,MACX,CAAC;AAAA,IACH;AACA,eAAW,CAAC,GAAG,MAAM,KAAK,KAAK,OAAO;AACpC,kBAAY;AAAA,QACV;AAAA,QACA,OAAO,IAAI,CAAC,MAAM,QAAQ,EAAE,MAAM,EAAE,QAAQ,OAAO,CAAC;AAAA,MACtD;AAAA,IACF;AACA,iBAAa,KAAK,IAAI,YAAY,KAAK,UAAU;AACjD,eAAW,KAAK,cAAc,UAAU;AAAA,EAC1C;AACA,QAAM,cAAc,KAAK,IAAI,GAAG,UAAU,UAAU,CAAC;AAErD,QAAM,QAAQ,oBAAI,IAA2B;AAC7C,QAAM,MAAM,QAAQ,CAAC,MAAM,MAAM,MAAM,IAAI,KAAK,IAAI,YAAY,IAAI,CAAC,CAAE,CAAC;AAGxE,QAAM,QAAQ,IAAI,IAAI,MAAM,MAAM,IAAI,CAAC,SAAS,GAAG,KAAK,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;AAC1E,QAAM,QAAQ,MAAM,MAAM,IAAI,CAAC,MAAM,MAAM;AACzC,QAAI,SAAS,YAAY,IAAI,CAAC;AAC9B,QAAI,KAAK,YAAY,MAAM,IAAI,GAAG,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,GAAG;AACzD,YAAM,SAAS,CAAC,MAAuB,KAAK,MAAM,MAAM,CAAC,EAAG,SAAS,MAAM,MAAM,CAAC,EAAG;AACrF,YAAM,SAAS,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,IAAI,GAAG,OAAO,KAAK,EAAE,IAAI,CAAC;AACrE,eAAS,OAAO,IAAI,CAAC,MAAO,KAAK,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,IAAI,OAAO,IAAI,EAAE,GAAG,EAAE,IAAI,QAAQ,GAAG,EAAE,EAAE,CAAE;AAAA,IAC7F;AACA,WAAO,EAAE,IAAI,KAAK,IAAI,QAAQ,KAAK,QAAQ,QAAQ,KAAK,QAAQ,QAAQ,UAAU,KAAK,SAAS;AAAA,EAClG,CAAC;AACD,QAAM,SAAS,QAAQ,YAAY,WAAW;AAC9C,SAAO,EAAE,OAAO,OAAO,OAAO,OAAO,GAAG,QAAQ,OAAO,EAAE;AAC3D;AAMO,SAAS,YAAY,QAA6B,YAA0B,MAAc;AAC/F,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,QAAQ,CAAC,MAAsB,KAAK,MAAM,IAAI,EAAE,IAAI;AAC1D,QAAM,QAAQ,OAAO,CAAC;AACtB,MAAI,IAAI,IAAI,MAAM,MAAM,CAAC,CAAC,IAAI,MAAM,MAAM,CAAC,CAAC;AAC5C,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,UAAM,IAAI,OAAO,IAAI,CAAC;AACtB,UAAM,IAAI,OAAO,CAAC;AAClB,QAAI,cAAc,MAAM;AACtB,YAAM,OAAO,EAAE,IAAI,EAAE,KAAK;AAC1B,WAAK,KAAK,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC;AAAA,IAC5F,OAAO;AACL,YAAM,OAAO,EAAE,IAAI,EAAE,KAAK;AAC1B,WAAK,KAAK,MAAM,EAAE,CAAC,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC,IAAI,MAAM,EAAE,CAAC,CAAC;AAAA,IAC5F;AAAA,EACF;AACA,SAAO;AACT;",
+  "names": []
+}