@smwb/ui-react 2.8.0 → 2.9.0

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

@@ -0,0 +1 @@
+{"version":3,"file":"dagLayout.js","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 → its rectangle in part coordinates (rank, cross). */\n  nodes: Map<number, { rank: number; cross: number; layer: number; order: number }>;\n  /** Edge index → 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"],"names":["dagEdgeId","edge","_a","normalise","input","warn","nodes","index","node","edges","pairs","ids","from","to","missing","pair","id","out","i","state","root","stack","top","v","next","list","assignLayers","count","arcs","inDegree","u","hasPred","d","layer","order","queue","head","succs","s","crossingsBetween","upper","vertices","position","a","b","size","tree","crossings","j","totalCrossings","layers","sum","l","reorder","down","key","neighbours","n","orderLayers","sweeps","best","bestCrossings","stale","sweep","place","desired","gaps","weights","offset","blocks","block","last","weight","result","k","assignCross","nodeGap","gapBetween","va","vb","gap","at","passes","pass","range","_","vertex","cross","layoutPart","members","graph","edgeList","rankSizeOf","crossSizeOf","rankGap","local","e","layerOf","segments","chain","previous","dummy","layerCount","max","thickness","start","rank","t","minCross","maxCross","shift","points","bandStart","dagLayout","_b","_c","_d","direction","lr","parent","find","parts","placedNodes","placedEdges","toPoint","crossAt","rankExtent","part","laid","p","crossExtent","across","extent","dagEdgePath","round","first","mid"],"mappings":"AAiFO,MAAMA,IAAY,CAACC;AAAnB,MAAAC;AAAwD,UAAAA,IAAAD,EAAK,OAAL,OAAAC,IAAW,GAAGD,EAAK,MAAM,KAAKA,EAAK,MAAM;AAAA;AA8BxG,SAASE,EAAUC,GAAmC;AA9B/C,MAAAF;AA+BL,QAAMG,KAAOH,IAAAE,EAAM,SAAN,OAAAF,KAAe,MAAA;AAAA,MACtBI,IAA8B,CAAA,GAC9BC,wBAAY,IAAA;AAClB,aAAWC,KAAQJ,EAAM,OAAO;AAC9B,QAAIG,EAAM,IAAIC,EAAK,EAAE,GAAG;AACtB,MAAAH,EAAK,SAASG,EAAK,EAAE,2CAA2C;AAChE;AAAA,IACF;AACA,IAAAD,EAAM,IAAIC,EAAK,IAAIF,EAAM,MAAM,GAC/BA,EAAM,KAAKE,CAAI;AAAA,EACjB;AACA,QAAMC,IAA6B,CAAA,GAC7BC,wBAAY,IAAA,GACZC,wBAAU,IAAA;AAChB,aAAWV,KAAQG,EAAM,OAAO;AAC9B,UAAMQ,IAAOL,EAAM,IAAIN,EAAK,MAAM,GAC5BY,IAAKN,EAAM,IAAIN,EAAK,MAAM;AAChC,QAAIW,MAAS,UAAaC,MAAO,QAAW;AAC1C,YAAMC,IAAUF,MAAS,SAAYX,EAAK,SAASA,EAAK;AACxD,MAAAI,EAAK,QAAQJ,EAAK,MAAM,OAAOA,EAAK,MAAM,2BAA2Ba,CAAO,mBAAmB;AAC/F;AAAA,IACF;AACA,QAAIF,MAASC,GAAI;AACf,MAAAR,EAAK,QAAQJ,EAAK,MAAM,OAAOA,EAAK,MAAM,iCAAiC;AAC3E;AAAA,IACF;AACA,UAAMc,IAAO,GAAGH,CAAI,IAAIC,CAAE,IACpBG,IAAKhB,EAAUC,CAAI;AACzB,QAAIS,EAAM,IAAIK,CAAI,KAAKJ,EAAI,IAAIK,CAAE,GAAG;AAClC,MAAAX,EAAK,QAAQJ,EAAK,MAAM,OAAOA,EAAK,MAAM,0CAA0C;AACpF;AAAA,IACF;AACA,IAAAS,EAAM,IAAIK,CAAI,GACdJ,EAAI,IAAIK,CAAE,GACVP,EAAM,KAAK,EAAE,IAAAO,GAAI,QAAQf,EAAK,QAAQ,QAAQA,EAAK,QAAQ,MAAAW,GAAM,IAAAC,GAAI,UAAU,IAAO;AAAA,EACxF;AAIA,QAAMI,IAAkBX,EAAM,IAAI,MAAM,CAAA,CAAE;AAC1C,EAAAG,EAAM,QAAQ,CAACR,GAAMiB,MAAMD,EAAIhB,EAAK,IAAI,EAAE,KAAKiB,CAAC,CAAC;AACjD,QAAMC,IAAQ,IAAI,WAAWb,EAAM,MAAM;AACzC,WAASc,IAAO,GAAGA,IAAOd,EAAM,QAAQc,KAAQ;AAC9C,QAAID,EAAMC,CAAI,EAAG;AACjB,UAAMC,IAAiC,CAAC,CAACD,GAAM,CAAC,CAAC;AAEjD,SADAD,EAAMC,CAAI,IAAI,GACPC,EAAM,UAAQ;AACnB,YAAMC,IAAMD,EAAMA,EAAM,SAAS,CAAC,GAC5B,CAACE,GAAGC,CAAI,IAAIF,GACZG,IAAOR,EAAIM,CAAC;AAClB,UAAIC,KAAQC,EAAK,QAAQ;AACvB,QAAAN,EAAMI,CAAC,IAAI,GACXF,EAAM,IAAA;AACN;AAAA,MACF;AACA,MAAAC,EAAI,CAAC,IAAIE,IAAO;AAChB,YAAMvB,IAAOQ,EAAMgB,EAAKD,CAAI,CAAC;AAC7B,MAAIL,EAAMlB,EAAK,EAAE,MAAM,MAAQ,WAAW,KACjCkB,EAAMlB,EAAK,EAAE,MAAM,MAC1BkB,EAAMlB,EAAK,EAAE,IAAI,GACjBoB,EAAM,KAAK,CAACpB,EAAK,IAAI,CAAC,CAAC;AAAA,IAE3B;AAAA,EACF;AACA,SAAO,EAAE,OAAAK,GAAO,OAAAC,GAAO,OAAAE,EAAA;AACzB;AAIA,SAASiB,EAAaC,GAAeC,GAAyC;AAC5E,QAAMX,IAAkB,MAAM,KAAK,EAAE,QAAQU,EAAA,GAAS,MAAM,EAAE,GACxDE,IAAW,IAAI,MAAcF,CAAK,EAAE,KAAK,CAAC;AAChD,aAAW,CAACG,GAAGP,CAAC,KAAKK;AACnB,IAAAX,EAAIa,CAAC,EAAE,KAAKP,CAAC,GACbM,EAASN,CAAC;AAEZ,QAAMQ,IAAUF,EAAS,IAAI,CAACG,MAAMA,IAAI,CAAC,GACnCC,IAAQ,IAAI,MAAcN,CAAK,EAAE,KAAK,CAAC,GACvCO,IAAkB,CAAA,GAClBC,IAAkB,CAAA;AACxB,WAASZ,IAAI,GAAGA,IAAII,GAAOJ,IAAK,CAAIM,EAASN,CAAC,MAAM,KAAGY,EAAM,KAAKZ,CAAC;AACnE,WAASa,IAAO,GAAGA,IAAOD,EAAM,QAAQC,KAAQ;AAC9C,UAAMN,IAAIK,EAAMC,CAAI;AACpB,IAAAF,EAAM,KAAKJ,CAAC;AACZ,eAAWP,KAAKN,EAAIa,CAAC;AACnB,MAAAG,EAAMV,CAAC,IAAI,KAAK,IAAIU,EAAMV,CAAC,GAAGU,EAAMH,CAAC,IAAI,CAAC,GACtC,EAAED,EAASN,CAAC,MAAM,KAAGY,EAAM,KAAKZ,CAAC;AAAA,EAEzC;AAGA,WAASL,IAAIgB,EAAM,SAAS,GAAGhB,KAAK,GAAGA,KAAK;AAC1C,UAAMK,IAAIW,EAAMhB,CAAC,GACXmB,IAAQpB,EAAIM,CAAC;AACnB,IAAIc,EAAM,WAAW,KAAKN,EAAQR,CAAC,MACnCU,EAAMV,CAAC,IAAI,KAAK,IAAI,GAAGc,EAAM,IAAI,CAACC,MAAML,EAAMK,CAAC,CAAC,CAAC,IAAI;AAAA,EACvD;AACA,SAAOL;AACT;AAKA,SAASM,EAAiBC,GAAiBC,GAAoBC,GAA8B;AAC3F,QAAMhC,IAAiC,CAAA;AACvC,aAAWoB,KAAKU,EAAO,YAAWjB,KAAKkB,EAASX,CAAC,EAAE,MAAO,CAAApB,EAAM,KAAK,CAACgC,EAASZ,CAAC,GAAGY,EAASnB,CAAC,CAAC,CAAC;AAC/F,EAAAb,EAAM,KAAK,CAACiC,GAAGC,MAAMD,EAAE,CAAC,IAAIC,EAAE,CAAC,KAAKD,EAAE,CAAC,IAAIC,EAAE,CAAC,CAAC;AAE/C,MAAIC,IAAO;AACX,aAAW,CAAA,EAAGD,CAAC,KAAKlC,OAAc,KAAK,IAAImC,GAAMD,IAAI,CAAC;AACtD,QAAME,IAAO,IAAI,WAAWD,IAAO,CAAC;AACpC,MAAIE,IAAY;AAChB,WAAS7B,IAAIR,EAAM,SAAS,GAAGQ,KAAK,GAAGA,KAAK;AAC1C,UAAM0B,IAAIlC,EAAMQ,CAAC,EAAE,CAAC;AACpB,aAAS8B,IAAIJ,GAAGI,IAAI,GAAGA,KAAKA,IAAI,CAACA,EAAG,CAAAD,KAAaD,EAAKE,CAAC;AACvD,aAASA,IAAIJ,IAAI,GAAGI,KAAKH,GAAMG,KAAKA,IAAI,CAACA,EAAG,CAAAF,EAAKE,CAAC;AAAA,EACpD;AACA,SAAOD;AACT;AAEA,SAASE,EAAeC,GAAoBT,GAAoBC,GAA8B;AAC5F,MAAIS,IAAM;AACV,WAASC,IAAI,GAAGA,IAAI,IAAIF,EAAO,QAAQE,IAAK,CAAAD,KAAOZ,EAAiBW,EAAOE,CAAC,GAAGX,GAAUC,CAAQ;AACjG,SAAOS;AACT;AAEA,SAASE,EAAQpB,GAAiBQ,GAAoBC,GAAsBY,GAAqB;AAC/F,QAAMC,wBAAU,IAAA;AAChB,aAAWhC,KAAKU,GAAO;AACrB,UAAMuB,IAAaF,IAAOb,EAASlB,CAAC,EAAE,QAAQkB,EAASlB,CAAC,EAAE;AAC1D,IAAIiC,EAAW,WAAW,IAAGD,EAAI,IAAIhC,GAAGmB,EAASnB,CAAC,CAAC,IAC9CgC,EAAI,IAAIhC,GAAGiC,EAAW,OAAO,CAACL,GAAKM,MAAMN,IAAMT,EAASe,CAAC,GAAG,CAAC,IAAID,EAAW,MAAM;AAAA,EACzF;AAEA,EAAAvB,EAAM,KAAK,CAACU,GAAGC,MAAMW,EAAI,IAAIZ,CAAC,IAAKY,EAAI,IAAIX,CAAC,KAAMF,EAASC,CAAC,IAAID,EAASE,CAAC,CAAC,GAC3EX,EAAM,QAAQ,CAACV,GAAGL,MAAOwB,EAASnB,CAAC,IAAIL,CAAE;AAC3C;AAEA,SAASwC,EAAYR,GAAoBT,GAAoBkB,GAAsB;AACjF,QAAMjB,IAAW,IAAI,WAAWD,EAAS,MAAM;AAC/C,aAAWR,KAASiB,EAAQ,CAAAjB,EAAM,QAAQ,CAACV,GAAGL,MAAOwB,EAASnB,CAAC,IAAIL,CAAE;AACrE,MAAI0C,IAAOV,EAAO,IAAI,CAACjB,MAAUA,EAAM,OAAO,GAC1C4B,IAAgBZ,EAAeC,GAAQT,GAAUC,CAAQ,GACzDoB,IAAQ;AACZ,WAASC,IAAQ,GAAGA,IAAQJ,KAAUE,IAAgB,GAAGE,KAAS;AAEhE,QADaA,IAAQ,MAAM,EACjB,UAASX,IAAI,GAAGA,IAAIF,EAAO,QAAQE,IAAK,CAAAC,EAAQH,EAAOE,CAAC,GAAGX,GAAUC,GAAU,EAAI;AAAA,QACxF,UAASU,IAAIF,EAAO,SAAS,GAAGE,KAAK,GAAGA,IAAK,CAAAC,EAAQH,EAAOE,CAAC,GAAGX,GAAUC,GAAU,EAAK;AAC9F,UAAMK,IAAYE,EAAeC,GAAQT,GAAUC,CAAQ;AAC3D,QAAIK,IAAYc;AACd,MAAAA,IAAgBd,GAChBa,IAAOV,EAAO,IAAI,CAACjB,MAAUA,EAAM,OAAO,GAC1C6B,IAAQ;AAAA,aACC,EAAEA,KAAS,EAAG;AAAA,EAC3B;AACA,EAAAF,EAAK,QAAQ,CAAC3B,GAAOmB,MAAOF,EAAOE,CAAC,IAAInB,CAAM;AAChD;AAQA,SAAS+B,EAAMC,GAAmBC,GAAgBC,GAA6B;AAE7E,QAAMC,IAAmB,CAAC,CAAC;AAC3B,WAASlD,IAAI,GAAGA,IAAI+C,EAAQ,QAAQ/C,IAAK,CAAAkD,EAAO,KAAKA,EAAOlD,IAAI,CAAC,IAAIgD,EAAKhD,IAAI,CAAC,CAAC;AAChF,QAAMmD,IAAkE,CAAA;AACxE,EAAAJ,EAAQ,QAAQ,CAACjC,GAAGd,MAAM;AACxB,QAAIoD,IAAQ,EAAE,OAAOtC,IAAIoC,EAAOlD,CAAC,GAAG,QAAQiD,EAAQjD,CAAC,GAAG,OAAO,EAAA;AAC/D,WAAOmD,EAAO,UAAUA,EAAOA,EAAO,SAAS,CAAC,EAAE,QAAQC,EAAM,SAAO;AACrE,YAAMC,IAAOF,EAAO,IAAA,GACdG,IAASD,EAAK,SAASD,EAAM;AACnC,MAAAA,IAAQ;AAAA,QACN,QAAQC,EAAK,QAAQA,EAAK,SAASD,EAAM,QAAQA,EAAM,UAAUE;AAAA,QACjE,QAAAA;AAAA,QACA,OAAOD,EAAK,QAAQD,EAAM;AAAA,MAAA;AAAA,IAE9B;AACA,IAAAD,EAAO,KAAKC,CAAK;AAAA,EACnB,CAAC;AACD,QAAMG,IAAmB,CAAA;AACzB,aAAWH,KAASD,EAAQ,UAASK,IAAI,GAAGA,IAAIJ,EAAM,OAAOI,IAAK,CAAAD,EAAO,KAAKH,EAAM,QAAQF,EAAOK,EAAO,MAAM,CAAC;AACjH,SAAOA;AACT;AAEA,SAASE,EAAYzB,GAAoBT,GAAoBmC,GAAuB;AAClF,QAAMC,IAAa,CAAClC,GAAWC,MAAsB;AACnD,UAAMkC,IAAKrC,EAASE,CAAC,GACfoC,IAAKtC,EAASG,CAAC,GAEfoC,IAAMF,EAAG,OAAO,KAAKC,EAAG,OAAO,IAAIH,IAAU,IAAIA;AACvD,WAAOE,EAAG,YAAY,IAAIE,IAAMD,EAAG,YAAY;AAAA,EACjD;AACA,aAAW9C,KAASiB,GAAQ;AAC1B,QAAI+B,IAAK;AACT,IAAAhD,EAAM,QAAQ,CAACV,GAAGL,MAAM;AACtB,MAAIA,IAAI,MAAG+D,KAAMJ,EAAW5C,EAAMf,IAAI,CAAC,GAAGK,CAAC,IAC3CkB,EAASlB,CAAC,EAAE,QAAQ0D;AAAA,IACtB,CAAC;AAAA,EACH;AAGA,QAAMC,IAAwC,CAAC,QAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM;AACzF,aAAWC,KAAQD,GAAQ;AACzB,UAAME,IAAQD,MAAS,OAAOjC,EAAO,IAAI,CAACmC,GAAGjC,MAAMF,EAAO,SAAS,IAAIE,CAAC,IAAIF,EAAO,IAAI,CAACmC,GAAGjC,MAAMA,CAAC;AAClG,eAAWA,KAAKgC,GAAO;AACrB,YAAMnD,IAAQiB,EAAOE,CAAC;AACtB,UAAInB,EAAM,WAAW,EAAG;AACxB,YAAMgC,IAAUhC,EAAM,IAAI,CAACV,MAAM;AAC/B,cAAM+D,IAAS7C,EAASlB,CAAC,GACnBiC,IACJ2B,MAAS,SAASG,EAAO,QAAQH,MAAS,OAAOG,EAAO,QAAQ,CAAC,GAAGA,EAAO,OAAO,GAAGA,EAAO,KAAK;AACnG,eAAI9B,EAAW,WAAW,IAAU8B,EAAO,QACpC9B,EAAW,OAAO,CAACL,GAAKM,MAAMN,IAAMV,EAASgB,CAAC,EAAE,OAAO,CAAC,IAAID,EAAW;AAAA,MAChF,CAAC,GACKU,IAAOjC,EAAM,MAAM,CAAC,EAAE,IAAI,CAACV,GAAGL,MAAM2D,EAAW5C,EAAMf,CAAC,GAAGK,CAAC,CAAC,GAC3D4C,IAAUlC,EAAM,IAAI,CAACV,MAAOkB,EAASlB,CAAC,EAAE,OAAO,IAAI,IAAI,CAAE;AAC/D,MAAAyC,EAAMC,GAASC,GAAMC,CAAO,EAAE,QAAQ,CAACoB,GAAOrE,MAAOuB,EAASR,EAAMf,CAAC,CAAC,EAAE,QAAQqE,CAAM;AAAA,IACxF;AAAA,EACF;AACF;AAaA,SAASC,EACPC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAlB,GACAjB,GACY;AACZ,QAAMoC,wBAAY,IAAA;AAClB,EAAAN,EAAQ,QAAQ,CAAChC,GAAGvC,MAAM6E,EAAM,IAAItC,GAAGvC,CAAC,CAAC;AACzC,QAAMU,IAAgC+D,EAAS,IAAI,CAACK,MAAM;AACxD,UAAM/F,IAAOyF,EAAM,MAAMM,CAAC,GACpBpF,IAAOmF,EAAM,IAAI9F,EAAK,IAAI,GAC1BY,IAAKkF,EAAM,IAAI9F,EAAK,EAAE;AAC5B,WAAOA,EAAK,WAAW,CAACY,GAAID,CAAI,IAAI,CAACA,GAAMC,CAAE;AAAA,EAC/C,CAAC,GACKoF,IAAUvE,EAAa+D,EAAQ,QAAQ7D,CAAI,GAE3Ca,IAAqBgD,EAAQ,IAAI,CAAChC,GAAGvC,OAAO;AAAA,IAChD,MAAMuC;AAAA,IACN,UAAUmC,EAAWnC,CAAC;AAAA,IACtB,WAAWoC,EAAYpC,CAAC;AAAA,IACxB,OAAOwC,EAAQ/E,CAAC;AAAA,IAChB,OAAO;AAAA,IACP,OAAO,CAAA;AAAA,IACP,OAAO,CAAA;AAAA,EAAC,EACR,GACIgF,IAAsBP,EAAS,IAAI,CAACK,GAAGtB,MAAM;AACjD,UAAM,CAAC9D,GAAMC,CAAE,IAAIe,EAAK8C,CAAC,GACnByB,IAAQ,CAACvF,CAAI;AACnB,QAAIwF,IAAWxF;AACf,aAASwC,IAAIX,EAAS7B,CAAI,EAAE,QAAQ,GAAGwC,IAAIX,EAAS5B,CAAE,EAAE,OAAOuC,KAAK;AAClE,YAAMiD,IAAQ5D,EAAS;AACvB,MAAAA,EAAS,KAAK,EAAE,MAAM,IAAI,UAAU,GAAG,WAAW,GAAG,OAAOW,GAAG,OAAO,GAAG,OAAO,IAAI,OAAO,CAAA,GAAI,GAC/FX,EAAS2D,CAAQ,EAAE,MAAM,KAAKC,CAAK,GACnC5D,EAAS4D,CAAK,EAAE,MAAM,KAAKD,CAAQ,GACnCD,EAAM,KAAKE,CAAK,GAChBD,IAAWC;AAAA,IACb;AACA,WAAA5D,EAAS2D,CAAQ,EAAE,MAAM,KAAKvF,CAAE,GAChC4B,EAAS5B,CAAE,EAAE,MAAM,KAAKuF,CAAQ,GAChCD,EAAM,KAAKtF,CAAE,GACN,EAAE,MAAMmF,GAAG,OAAAG,EAAA;AAAA,EACpB,CAAC,GAIKG,IAAa7D,EAAS,OAAO,CAAC8D,GAAKhF,MAAM,KAAK,IAAIgF,GAAKhF,EAAE,QAAQ,CAAC,GAAG,CAAC,GACtE2B,IAAqB,MAAM,KAAK,EAAE,QAAQoD,EAAA,GAAc,MAAM,EAAE;AACtE,EAAA7D,EAAS,QAAQ,CAAClB,GAAGL,MAAMgC,EAAO3B,EAAE,KAAK,EAAE,KAAKL,CAAC,CAAC,GAClDwC,EAAYR,GAAQT,GAAUkB,CAAM,GACpCgB,EAAYzB,GAAQT,GAAUmC,CAAO;AAGrC,QAAM4B,IAAYtD,EAAO,IAAI,CAACjB,MAAUA,EAAM,OAAO,CAACsE,GAAKhF,MAAM,KAAK,IAAIgF,GAAK9D,EAASlB,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,GAClGkF,IAAkB,CAAA;AACxB,MAAIC,IAAO;AACX,EAAAF,EAAU,QAAQ,CAACG,GAAGvD,MAAM;AAC1B,IAAAqD,EAAMrD,CAAC,IAAIsD,GACXA,KAAQC,KAAKvD,IAAI,IAAIoD,EAAU,SAASV,IAAU;AAAA,EACpD,CAAC;AAED,MAAIc,IAAW,OACXC,IAAW;AACf,aAAWtF,KAAKkB;AACd,IAAAmE,IAAW,KAAK,IAAIA,GAAUrF,EAAE,QAAQA,EAAE,YAAY,CAAC,GACvDsF,IAAW,KAAK,IAAIA,GAAUtF,EAAE,QAAQA,EAAE,YAAY,CAAC;AAEzD,QAAMuF,IAAQ,OAAO,SAASF,CAAQ,IAAI,CAACA,IAAW,GAEhDtG,wBAAiC,IAAA;AACvC,EAAA4C,EAAO;AAAA,IAAQ,CAACjB,GAAOmB,MACrBnB,EAAM,QAAQ,CAACV,GAAGW,MAAU;AAC1B,YAAMoD,IAAS7C,EAASlB,CAAC;AACzB,MAAI+D,EAAO,OAAO,KAClBhF,EAAM,IAAIgF,EAAO,MAAM;AAAA,QACrB,MAAMmB,EAAMrD,CAAC,KAAKoD,EAAUpD,CAAC,IAAIkC,EAAO,YAAY;AAAA,QACpD,OAAOA,EAAO,QAAQA,EAAO,YAAY,IAAIwB;AAAA,QAC7C,OAAO1D;AAAA,QACP,OAAAlB;AAAA,MAAA,CACD;AAAA,IACH,CAAC;AAAA,EAAA;AAGH,QAAMzB,wBAAiC,IAAA;AACvC,aAAW,EAAE,MAAAR,GAAM,OAAAkG,EAAA,KAAWD,GAAU;AACtC,UAAMa,IAAiD,CAAA;AACvD,IAAAZ,EAAM,QAAQ,CAAC5E,GAAGL,MAAM;AACtB,YAAMoE,IAAS7C,EAASlB,CAAC,GACnB6B,IAAIkC,EAAO,OACXC,IAAQD,EAAO,QAAQwB,GACvBE,IAAYP,EAAMrD,CAAC,KAAKoD,EAAUpD,CAAC,IAAIkC,EAAO,YAAY;AAChE,MAAIpE,MAAM,IAAG6F,EAAO,KAAK,EAAE,MAAMC,IAAY1B,EAAO,UAAU,OAAAC,GAAO,IAC5DrE,MAAMiF,EAAM,SAAS,IAAGY,EAAO,KAAK,EAAE,MAAMC,GAAW,OAAAzB,GAAO,IAGrEwB,EAAO,KAAK,EAAE,MAAMN,EAAMrD,CAAC,GAAG,OAAAmC,EAAA,GAAS,EAAE,MAAMkB,EAAMrD,CAAC,IAAIoD,EAAUpD,CAAC,GAAG,OAAAmC,GAAO;AAAA,IAEnF,CAAC,GACGG,EAAM,MAAMzF,CAAI,EAAE,cAAiB,QAAA,GACvCQ,EAAM,IAAIR,GAAM8G,CAAM;AAAA,EACxB;AAEA,SAAO;AAAA,IACL,OAAAzG;AAAA,IACA,OAAAG;AAAA,IACA,YAAYiG;AAAA,IACZ,aAAa,OAAO,SAASG,CAAQ,IAAIA,IAAWD,IAAW;AAAA,EAAA;AAEnE;AAOO,SAASK,EAAU7G,GAAwC;AAhY3D,MAAAF,GAAAgH,GAAAC,GAAAC;AAiYL,QAAMC,KAAYnH,IAAAE,EAAM,cAAN,OAAAF,IAAmB,MAC/B4F,KAAUoB,IAAA9G,EAAM,YAAN,OAAA8G,IAAiB,IAC3BtC,KAAUuC,IAAA/G,EAAM,YAAN,OAAA+G,IAAiB,IAC3BxD,KAASyD,IAAAhH,EAAM,WAAN,OAAAgH,IAAgB,GACzB1B,IAAQvF,EAAUC,CAAK,GACvBkH,IAAKD,MAAc,MACnBzB,IAAa,CAACnC,MAAuB6D,IAAK5B,EAAM,MAAMjC,CAAC,EAAE,QAAQiC,EAAM,MAAMjC,CAAC,EAAE,QAChFoC,IAAc,CAACpC,MAAuB6D,IAAK5B,EAAM,MAAMjC,CAAC,EAAE,SAASiC,EAAM,MAAMjC,CAAC,EAAE,OAGlF8D,IAAS7B,EAAM,MAAM,IAAI,CAACL,GAAGnE,MAAMA,CAAC,GACpCsG,IAAO,CAACjG,MAAsB;AAClC,WAAOgG,EAAOhG,CAAC,MAAMA;AACnB,MAAAgG,EAAOhG,CAAC,IAAIgG,EAAOA,EAAOhG,CAAC,CAAC,GAC5BA,IAAIgG,EAAOhG,CAAC;AAEd,WAAOA;AAAA,EACT;AACA,aAAWtB,KAAQyF,EAAM,OAAO;AAC9B,UAAM/C,IAAI6E,EAAKvH,EAAK,IAAI,GAClB2C,IAAI4E,EAAKvH,EAAK,EAAE;AACtB,IAAI0C,MAAMC,MAAG2E,EAAO,KAAK,IAAI5E,GAAGC,CAAC,CAAC,IAAI,KAAK,IAAID,GAAGC,CAAC;AAAA,EACrD;AACA,QAAM6E,wBAAY,IAAA;AAClB,EAAA/B,EAAM,MAAM,QAAQ,CAACL,GAAGnE,MAAM;AAC5B,UAAME,IAAOoG,EAAKtG,CAAC;AACnB,IAAKuG,EAAM,IAAIrG,CAAI,KAAGqG,EAAM,IAAIrG,GAAM,EAAE,SAAS,CAAA,GAAI,OAAO,CAAA,GAAI,GAChEqG,EAAM,IAAIrG,CAAI,EAAG,QAAQ,KAAKF,CAAC;AAAA,EACjC,CAAC,GACDwE,EAAM,MAAM,QAAQ,CAACzF,GAAM+F,MAAMyB,EAAM,IAAID,EAAKvH,EAAK,IAAI,CAAC,EAAG,MAAM,KAAK+F,CAAC,CAAC;AAE1E,QAAM0B,wBAAkB,IAAA,GAClBC,wBAAkB,IAAA,GAClBC,IAAU,CAAClB,GAAcnB,MAA6B+B,IAAK,EAAE,GAAGZ,GAAM,GAAGnB,MAAU,EAAE,GAAGA,GAAO,GAAGmB,EAAA;AACxG,MAAImB,IAAU,GACVC,IAAa;AACjB,aAAWC,KAAQN,EAAM,UAAU;AACjC,UAAMO,IAAOxC,EAAWuC,EAAK,SAASrC,GAAOqC,EAAK,OAAOnC,GAAYC,GAAaC,GAASlB,GAASjB,CAAM;AAC1G,eAAW,CAACF,GAAGwE,CAAC,KAAKD,EAAK,OAAO;AAC/B,YAAMxH,IAAOkF,EAAM,MAAMjC,CAAC;AAC1B,MAAAiE,EAAY,IAAIjE,GAAG;AAAA,QACjB,IAAIjD,EAAK;AAAA,QACT,GAAGoH,EAAQK,EAAE,MAAMA,EAAE,QAAQJ,CAAO;AAAA,QACpC,OAAOrH,EAAK;AAAA,QACZ,QAAQA,EAAK;AAAA,QACb,OAAOyH,EAAE;AAAA,QACT,OAAOA,EAAE;AAAA,MAAA,CACV;AAAA,IACH;AACA,eAAW,CAACjC,GAAGe,CAAM,KAAKiB,EAAK;AAC7B,MAAAL,EAAY;AAAA,QACV3B;AAAA,QACAe,EAAO,IAAI,CAACkB,MAAML,EAAQK,EAAE,MAAMA,EAAE,QAAQJ,CAAO,CAAC;AAAA,MAAA;AAGxD,IAAAC,IAAa,KAAK,IAAIA,GAAYE,EAAK,UAAU,GACjDH,KAAWG,EAAK,cAAcpD,IAAU;AAAA,EAC1C;AACA,QAAMsD,IAAc,KAAK,IAAI,GAAGL,IAAUjD,IAAU,CAAC,GAE/CtE,wBAAY,IAAA;AAClB,EAAAoF,EAAM,MAAM,QAAQ,CAAClF,GAAMU,MAAMZ,EAAM,IAAIE,EAAK,IAAIkH,EAAY,IAAIxG,CAAC,CAAE,CAAC;AAGxE,QAAMR,IAAQ,IAAI,IAAIgF,EAAM,MAAM,IAAI,CAACzF,MAAS,GAAGA,EAAK,IAAI,IAAIA,EAAK,EAAE,EAAE,CAAC,GACpEQ,IAAQiF,EAAM,MAAM,IAAI,CAACzF,GAAM+F,MAAM;AACzC,QAAIe,IAASY,EAAY,IAAI3B,CAAC;AAC9B,QAAI/F,EAAK,YAAYS,EAAM,IAAI,GAAGT,EAAK,EAAE,IAAIA,EAAK,IAAI,EAAE,GAAG;AACzD,YAAMkI,IAAS,CAAC1E,MAAuB6D,IAAK5B,EAAM,MAAMjC,CAAC,EAAE,SAASiC,EAAM,MAAMjC,CAAC,EAAE,OAC7EW,IAAS,KAAK,IAAI,GAAG+D,EAAOlI,EAAK,IAAI,IAAI,GAAGkI,EAAOlI,EAAK,EAAE,IAAI,CAAC;AACrE,MAAA8G,IAASA,EAAO,IAAI,CAACkB,MAAOX,IAAK,EAAE,GAAGW,EAAE,GAAG,GAAGA,EAAE,IAAI7D,EAAA,IAAW,EAAE,GAAG6D,EAAE,IAAI7D,GAAQ,GAAG6D,EAAE,GAAI;AAAA,IAC7F;AACA,WAAO,EAAE,IAAIhI,EAAK,IAAI,QAAQA,EAAK,QAAQ,QAAQA,EAAK,QAAQ,QAAA8G,GAAQ,UAAU9G,EAAK,SAAA;AAAA,EACzF,CAAC,GACKmI,IAASR,EAAQE,GAAYI,CAAW;AAC9C,SAAO,EAAE,OAAA5H,GAAO,OAAAG,GAAO,OAAO2H,EAAO,GAAG,QAAQA,EAAO,EAAA;AACzD;AAMO,SAASC,EAAYtB,GAA6BM,IAA0B,MAAc;AAC/F,MAAIN,EAAO,WAAW,EAAG,QAAO;AAChC,QAAMuB,IAAQ,CAAC7E,MAAsB,KAAK,MAAMA,IAAI,EAAE,IAAI,IACpD8E,IAAQxB,EAAO,CAAC;AACtB,MAAI/E,IAAI,IAAIsG,EAAMC,EAAM,CAAC,CAAC,IAAID,EAAMC,EAAM,CAAC,CAAC;AAC5C,WAASrH,IAAI,GAAGA,IAAI6F,EAAO,QAAQ7F,KAAK;AACtC,UAAMyB,IAAIoE,EAAO7F,IAAI,CAAC,GAChB0B,IAAImE,EAAO7F,CAAC;AAClB,QAAImG,MAAc,MAAM;AACtB,YAAMmB,KAAO7F,EAAE,IAAIC,EAAE,KAAK;AAC1B,MAAAZ,KAAK,KAAKsG,EAAME,CAAG,CAAC,IAAIF,EAAM3F,EAAE,CAAC,CAAC,IAAI2F,EAAME,CAAG,CAAC,IAAIF,EAAM1F,EAAE,CAAC,CAAC,IAAI0F,EAAM1F,EAAE,CAAC,CAAC,IAAI0F,EAAM1F,EAAE,CAAC,CAAC;AAAA,IAC5F,OAAO;AACL,YAAM4F,KAAO7F,EAAE,IAAIC,EAAE,KAAK;AAC1B,MAAAZ,KAAK,KAAKsG,EAAM3F,EAAE,CAAC,CAAC,IAAI2F,EAAME,CAAG,CAAC,IAAIF,EAAM1F,EAAE,CAAC,CAAC,IAAI0F,EAAME,CAAG,CAAC,IAAIF,EAAM1F,EAAE,CAAC,CAAC,IAAI0F,EAAM1F,EAAE,CAAC,CAAC;AAAA,IAC5F;AAAA,EACF;AACA,SAAOZ;AACT;"}

package/dist/headless/components/dataDisplay/dagView/dagView.js

@@ -0,0 +1,541 @@
+import { jsxs as S, jsx as d, Fragment as bt } from "react/jsx-runtime";
+import i from "react";
+import be from "clsx";
+import { useControllableState as Xe } from "../../../hooks/useControllableState.js";
+import { useForkRef as vt } from "../../../hooks/useForkRef.js";
+import { useId as yt } from "../../../hooks/useId.js";
+import { useSafeLayoutEffect as O } from "../../../hooks/useSafeLayoutEffect.js";
+import { dagLayout as _t, dagEdgePath as xt } from "./dagLayout.js";
+import { viewportTransform as Rt, centerOn as At, zoomAt as Mt, fitBounds as St, createPanZoom as kt, isVisible as Bt } from "./panZoom.js";
+const b = 24, Ye = {
+  roleDescription: "dependency graph",
+  status: "Status",
+  dependsOn: "Depends on",
+  requiredBy: "Required by",
+  statuses: {
+    idle: "Idle",
+    pending: "Pending",
+    running: "Running",
+    success: "Success",
+    warning: "Warning",
+    error: "Error",
+    skipped: "Skipped"
+  },
+  zoomIn: "Zoom in",
+  zoomOut: "Zoom out",
+  fitView: "Fit to view",
+  controls: "Zoom"
+}, Dt = 'a[href], button, input, select, textarea, iframe, summary, audio[controls], video[controls], [tabindex], [contenteditable]:not([contenteditable="false"])', Nt = (g) => typeof g == "number" ? `${g}px` : g, zt = (g, k) => g.length === k.length && g.every((R, J) => R === k[J]), It = (g, k) => {
+  const R = g == null ? void 0 : g.label;
+  return typeof R == "string" || typeof R == "number" ? String(R) : k;
+}, $t = (g) => console.warn(`[smwb] DagView: ${g}`), Lt = i.forwardRef(function(k, R) {
+  const {
+    className: J,
+    style: ve,
+    label: Je,
+    summary: Q,
+    nodes: ye,
+    edges: _e,
+    renderNode: z,
+    direction: _ = "LR",
+    nodeWidth: xe = 180,
+    nodeHeight: Re = 56,
+    rankGap: ee = 64,
+    nodeGap: te = 24,
+    layout: Ae,
+    selectedId: Qe,
+    defaultSelectedId: re,
+    onSelectedChange: et,
+    onNodeClick: ne,
+    dimUnrelated: Me = !1,
+    viewport: tt,
+    defaultViewport: se,
+    onViewportChange: rt,
+    fit: Se = !0,
+    minZoom: ke = 0.1,
+    maxZoom: Be = 2,
+    wheel: De = "zoom",
+    controls: nt = !0,
+    labels: I,
+    height: Ne,
+    apiRef: ze,
+    "data-testid": st = "dag-view",
+    ...ot
+  } = k, W = yt(), Ie = `${W}-arrow`, $e = `${W}-arrow-active`, Le = `${W}-summary`, B = i.useRef(null), $ = i.useRef(/* @__PURE__ */ new Map()), v = i.useMemo(
+    () => ({
+      ...Ye,
+      ...I,
+      statuses: { ...Ye.statuses, ...I == null ? void 0 : I.statuses }
+    }),
+    [I]
+  ), Ve = (e) => {
+    var t;
+    return (t = v.statuses[e]) != null ? t : e;
+  }, x = i.useMemo(() => {
+    const e = /* @__PURE__ */ new Map();
+    for (const t of ye) e.has(t.id) || e.set(t.id, t);
+    return e;
+  }, [ye]), oe = i.useMemo(() => [...x.keys()], [x]), U = i.useRef(oe);
+  zt(U.current, oe) || (U.current = oe);
+  const L = U.current, ae = i.useMemo(() => {
+    const e = [...x.values()].map((n) => {
+      var o, a;
+      return {
+        id: n.id,
+        width: (o = n.width) != null ? o : xe,
+        height: (a = n.height) != null ? a : Re
+      };
+    }), t = _e.map((n) => ({ id: n.id, source: n.source, target: n.target })), r = {
+      nodes: e,
+      edges: t,
+      direction: _,
+      rankGap: ee,
+      nodeGap: te,
+      warn: $t
+    };
+    return { key: JSON.stringify([
+      _,
+      ee,
+      te,
+      e.map((n) => [n.id, n.width, n.height]),
+      t.map((n) => {
+        var o;
+        return [(o = n.id) != null ? o : null, n.source, n.target];
+      })
+    ]), input: r };
+  }, [x, _e, _, xe, Re, ee, te]), ie = i.useRef(ae);
+  ie.current.key !== ae.key && (ie.current = ae);
+  const Ze = ie.current, h = i.useRef({ fit: Se, minZoom: ke, maxZoom: Be, wheel: De, apiRef: ze, layout: Ae });
+  h.current = { fit: Se, minZoom: ke, maxZoom: Be, wheel: De, apiRef: ze, layout: Ae };
+  const l = i.useMemo(
+    () => {
+      var e;
+      return ((e = h.current.layout) != null ? e : _t)(Ze.input);
+    },
+    // eslint-disable-next-line react-hooks/exhaustive-deps
+    [Ze]
+  ), H = (e) => _ === "TB" ? e.x : e.y, p = i.useMemo(() => {
+    const e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map();
+    for (const n of l.edges)
+      e.has(n.target) || e.set(n.target, []), t.has(n.source) || t.set(n.source, []), e.get(n.target).push(n), t.get(n.source).push(n);
+    const r = [...l.nodes.values()].sort((n, o) => n.layer - o.layer || H(n) - H(o)), s = /* @__PURE__ */ new Map();
+    for (const n of r)
+      s.has(n.layer) || s.set(n.layer, []), s.get(n.layer).push(n);
+    return { incoming: e, outgoing: t, ordered: r, layers: s };
+  }, [l, _]), [m, P] = Xe({
+    value: Qe,
+    defaultValue: re != null ? re : null,
+    onChange: et
+  }), D = i.useMemo(() => {
+    var n, o;
+    const e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map();
+    if (m === null || !l.nodes.has(m)) return { active: !1, edges: e, nodes: t };
+    const { incoming: r, outgoing: s } = p;
+    for (const a of (n = r.get(m)) != null ? n : [])
+      e.set(a.id, "upstream"), t.set(a.source, "upstream");
+    for (const a of (o = s.get(m)) != null ? o : [])
+      e.set(a.id, "downstream"), t.set(a.target, "downstream");
+    return { active: !0, edges: e, nodes: t };
+  }, [m, l, p]), [q, Ee] = i.useState(null), [ce, ue] = i.useState(null), K = i.useMemo(() => {
+    var e, t;
+    return q !== null && l.nodes.has(q) ? q : m !== null && l.nodes.has(m) ? m : (t = (e = p.ordered[0]) == null ? void 0 : e.id) != null ? t : null;
+  }, [l, q, m, p]), [A, de] = Xe({
+    value: tt,
+    defaultValue: se != null ? se : { x: 0, y: 0, zoom: 1 },
+    onChange: rt
+  }), [at, it] = i.useState(!1), ct = A.zoom < 0.45, N = i.useRef(A);
+  N.current = A;
+  const Fe = i.useRef(m);
+  Fe.current = m;
+  const le = i.useRef(ce);
+  le.current = ce;
+  const me = i.useRef(K);
+  me.current = K;
+  const Te = i.useRef(P);
+  Te.current = P;
+  const V = i.useRef(de);
+  V.current = de;
+  const j = i.useRef(l);
+  j.current = l;
+  const fe = i.useRef(z);
+  fe.current = z;
+  const ge = i.useRef(!1), Z = () => {
+    var e, t, r, s;
+    return {
+      width: (t = (e = B.current) == null ? void 0 : e.clientWidth) != null ? t : 0,
+      height: (s = (r = B.current) == null ? void 0 : r.clientHeight) != null ? s : 0
+    };
+  }, we = () => {
+    const { width: e, height: t } = Z();
+    return e > 0 && t > 0;
+  }, ut = () => ({
+    width: j.current.width + b * 2,
+    height: j.current.height + b * 2
+  }), Ce = (e) => {
+    const t = j.current.nodes.get(e);
+    return t && { x: t.x + b, y: t.y + b, width: t.width, height: t.height };
+  }, he = i.useRef(null);
+  if (he.current === null) {
+    const e = {
+      fitView() {
+        if (!we()) return;
+        const t = ut();
+        V.current(
+          St(
+            { x: 0, y: 0, ...t },
+            Z(),
+            0,
+            h.current.minZoom,
+            Math.max(h.current.minZoom, Math.min(1, h.current.maxZoom))
+          )
+        );
+      },
+      zoomTo(t) {
+        e.zoomBy(t / N.current.zoom);
+      },
+      zoomBy(t) {
+        const { width: r, height: s } = Z();
+        V.current(
+          Mt(
+            N.current,
+            { x: r / 2, y: s / 2 },
+            t,
+            h.current.minZoom,
+            h.current.maxZoom
+          )
+        );
+      },
+      centerNode(t) {
+        const r = Ce(t);
+        r && V.current(
+          At(N.current, { x: r.x + r.width / 2, y: r.y + r.height / 2 }, Z())
+        );
+      }
+    };
+    he.current = e;
+  }
+  const y = he.current, Oe = (e) => {
+    const t = Ce(e);
+    t && we() && !Bt(N.current, t, Z(), 8) && y.centerNode(e);
+  }, We = () => {
+    !ge.current || !we() || (ge.current = !1, y.fitView());
+  };
+  O(() => {
+    h.current.fit && (ge.current = !0, We());
+  }, [l]), O(() => {
+    var n, o;
+    const e = B.current;
+    if (!e) return;
+    const t = kt(e, {
+      viewport: () => N.current,
+      write: (a) => V.current(a),
+      minZoom: () => h.current.minZoom,
+      maxZoom: () => h.current.maxZoom,
+      wheel: () => h.current.wheel,
+      onInteracting: it
+    });
+    let r = 0;
+    const s = typeof ResizeObserver == "function" ? new ResizeObserver(() => {
+      cancelAnimationFrame(r), r = requestAnimationFrame(We);
+    }) : void 0;
+    return s == null || s.observe(e), (o = (n = h.current).apiRef) == null || o.call(n, y), () => {
+      t(), s == null || s.disconnect(), cancelAnimationFrame(r);
+    };
+  }, []);
+  const Ue = (e, t) => {
+    const r = x.get(e);
+    !r || r.disabled || (P(e), ne == null || ne(r, t));
+  }, pe = (e) => {
+    var t;
+    e !== void 0 && (Ee(e), (t = $.current.get(e)) == null || t.focus({ preventScroll: !0 }), Oe(e));
+  }, He = i.useRef(null);
+  O(() => {
+    var a, c;
+    const e = He.current;
+    if (He.current = L, e === null || e === L) return;
+    const t = new Set(L), r = Fe.current;
+    r !== null && !t.has(r) && e.includes(r) && Te.current(null);
+    const s = le.current;
+    if (s === null || t.has(s)) return;
+    ue(null);
+    const n = (a = B.current) == null ? void 0 : a.ownerDocument, o = me.current;
+    n && (n.activeElement === null || n.activeElement === n.body) && o !== null && ((c = $.current.get(o)) == null || c.focus({ preventScroll: !0 }));
+  }, [L]);
+  const Pe = i.useRef(/* @__PURE__ */ new WeakMap()), qe = i.useRef(/* @__PURE__ */ new WeakMap()), G = i.useCallback(() => {
+    var s, n;
+    const e = me.current, t = Pe.current, r = qe.current;
+    for (const [o, a] of $.current)
+      for (const c of a.querySelectorAll(Dt)) {
+        t.has(c) || t.set(c, c.getAttribute("tabindex")), c.getAttribute("tabindex") !== ((s = r.get(c)) != null ? s : null) && t.set(c, c.getAttribute("tabindex"));
+        const u = o === e ? (n = t.get(c)) != null ? n : null : "-1";
+        if (c.getAttribute("tabindex") === u) {
+          r.set(c, u);
+          continue;
+        }
+        u === null ? c.removeAttribute("tabindex") : c.setAttribute("tabindex", u), r.set(c, u);
+      }
+  }, []);
+  O(() => {
+    fe.current && G();
+  }, [K, G]), O(() => {
+    const e = B.current;
+    if (!e || typeof MutationObserver != "function") return;
+    const t = new MutationObserver((r) => {
+      var a;
+      if (!fe.current) return;
+      const s = Pe.current, n = qe.current;
+      let o = !1;
+      for (const c of r) {
+        if (c.type !== "attributes") {
+          o = !0;
+          continue;
+        }
+        const u = c.target;
+        if (!n.has(u)) continue;
+        const w = u.getAttribute("tabindex");
+        w !== ((a = n.get(u)) != null ? a : null) && (s.set(u, w), o = !0);
+      }
+      o && G();
+    });
+    return t.observe(e, { childList: !0, subtree: !0, attributes: !0, attributeFilter: ["tabindex"] }), () => t.disconnect();
+  }, [G]);
+  const dt = (e, t) => {
+    var E, Y, F, f, T;
+    const r = _ === "TB", s = r ? "ArrowDown" : "ArrowRight", n = r ? "ArrowUp" : "ArrowLeft", o = r ? "ArrowLeft" : "ArrowUp", a = r ? "ArrowRight" : "ArrowDown", c = (M) => {
+      var Ge;
+      return (Ge = M.map((C) => l.nodes.get(C)).filter((C) => C !== void 0).sort((C, pt) => H(C) - H(pt))[0]) == null ? void 0 : Ge.id;
+    };
+    if (t === s) return c(((E = p.outgoing.get(e)) != null ? E : []).map((M) => M.target));
+    if (t === n) return c(((Y = p.incoming.get(e)) != null ? Y : []).map((M) => M.source));
+    const u = l.nodes.get(e);
+    if (!u) return;
+    const w = (F = p.layers.get(u.layer)) != null ? F : [], X = w.findIndex((M) => M.id === e);
+    if (t === o) return (f = w[X - 1]) == null ? void 0 : f.id;
+    if (t === a) return (T = w[X + 1]) == null ? void 0 : T.id;
+  }, lt = (e) => {
+    var n, o, a;
+    const t = e.target, r = (n = t.dataset) == null ? void 0 : n.dagId;
+    if (r === void 0 || !t.classList.contains("smwb-dag-view__node") || e.ctrlKey || e.metaKey || e.altKey) return;
+    const s = e.key;
+    if (s.startsWith("Arrow") && e.shiftKey) {
+      const u = s === "ArrowLeft" ? 48 : s === "ArrowRight" ? -48 : 0, w = s === "ArrowUp" ? 48 : s === "ArrowDown" ? -48 : 0;
+      de({ x: A.x + u, y: A.y + w, zoom: A.zoom }), e.preventDefault();
+      return;
+    }
+    if (s.startsWith("Arrow")) {
+      e.preventDefault(), pe(dt(r, s));
+      return;
+    }
+    switch (s) {
+      case "Home":
+        e.preventDefault(), pe((o = p.ordered[0]) == null ? void 0 : o.id);
+        return;
+      case "End":
+        e.preventDefault(), pe((a = p.ordered[p.ordered.length - 1]) == null ? void 0 : a.id);
+        return;
+      case "Enter":
+      case " ":
+        e.preventDefault(), Ue(r, e);
+        return;
+      case "Escape":
+        if (m === null) return;
+        e.preventDefault(), P(null);
+        return;
+      case "+":
+      case "=":
+        e.preventDefault(), y.zoomBy(1.25);
+        return;
+      case "-":
+      case "_":
+        e.preventDefault(), y.zoomBy(0.8);
+        return;
+      case "0":
+        e.preventDefault(), y.fitView();
+        return;
+    }
+  }, mt = (e) => {
+    var t;
+    return /* @__PURE__ */ S(bt, { children: [
+      /* @__PURE__ */ d("span", { className: "smwb-dag-view__dot", "aria-hidden": "true" }),
+      /* @__PURE__ */ d("span", { className: "smwb-dag-view__label", children: (t = e.label) != null ? t : e.id }),
+      e.status ? /* @__PURE__ */ d("span", { className: "smwb-dag-view__status", children: Ve(e.status) }) : null
+    ] });
+  }, ft = (e) => {
+    var a, c;
+    const t = x.get(e), r = [];
+    t != null && t.status && r.push(`${v.status}: ${Ve(t.status)}.`);
+    const s = (u) => u.map((w) => It(x.get(w), w)).join(", "), n = ((a = p.incoming.get(e)) != null ? a : []).map((u) => u.source), o = ((c = p.outgoing.get(e)) != null ? c : []).map((u) => u.target);
+    return n.length && r.push(`${v.dependsOn}: ${s(n)}.`), o.length && r.push(`${v.requiredBy}: ${s(o)}.`), r.join(" ");
+  }, gt = (e, t) => {
+    var F;
+    const r = x.get(e), s = r != null ? r : { id: e }, n = {
+      selected: m === e,
+      related: (F = D.nodes.get(e)) != null ? F : null,
+      dimmed: !!Me && D.active && m !== e && !D.nodes.has(e),
+      focused: ce === e
+    }, o = `${W}-node-${t}`, a = l.nodes.get(e), c = a ? {
+      left: `${a.x + b}px`,
+      top: `${a.y + b}px`,
+      width: `${a.width}px`,
+      height: `${a.height}px`
+    } : { display: "none" }, u = r == null ? void 0 : r.accent;
+    u && (c["--smwb-dag-view-node-accent"] = u);
+    const w = (f) => {
+      if (f.target !== f.currentTarget) return;
+      Ee(e), ue(e);
+      let T = !0;
+      try {
+        T = f.currentTarget.matches(":focus-visible");
+      } catch {
+      }
+      T && Oe(e);
+    }, X = (f) => {
+      f.target !== f.currentTarget || le.current !== e || U.current.includes(e) && ue(null);
+    }, E = ft(e), Y = (z != null ? z : mt)(s, n);
+    return /* @__PURE__ */ S(
+      "div",
+      {
+        role: "option",
+        "data-dag-id": e,
+        ref: (f) => {
+          f ? $.current.set(e, f) : $.current.delete(e);
+        },
+        className: be("smwb-dag-view__node", {
+          "smwb-dag-view__node--selected": n.selected,
+          "smwb-dag-view__node--upstream": n.related === "upstream",
+          "smwb-dag-view__node--downstream": n.related === "downstream",
+          "smwb-dag-view__node--dimmed": n.dimmed,
+          "smwb-dag-view__node--disabled": !!(r != null && r.disabled)
+        }),
+        "data-status": r == null ? void 0 : r.status,
+        "aria-selected": n.selected,
+        "aria-disabled": r != null && r.disabled ? !0 : void 0,
+        "aria-describedby": E ? o : void 0,
+        tabIndex: K === e ? 0 : -1,
+        style: c,
+        onClick: (f) => Ue(e, f),
+        onFocus: w,
+        onBlur: X,
+        children: [
+          Y,
+          /* @__PURE__ */ d("span", { id: o, hidden: !0, children: E })
+        ]
+      },
+      e
+    );
+  }, wt = (e) => {
+    const t = D.edges.get(e.id);
+    return be("smwb-dag-view__edge", {
+      "smwb-dag-view__edge--active": t !== void 0,
+      "smwb-dag-view__edge--upstream": t === "upstream",
+      "smwb-dag-view__edge--downstream": t === "downstream",
+      "smwb-dag-view__edge--dimmed": !!Me && D.active && t === void 0,
+      "smwb-dag-view__edge--reversed": e.reversed
+    });
+  }, Ke = l.width + b * 2, je = l.height + b * 2, ht = vt(R, B);
+  return /* @__PURE__ */ S(
+    "div",
+    {
+      "data-testid": st,
+      ...ot,
+      ref: ht,
+      className: be("smwb-dag-view", J),
+      style: Ne === void 0 ? ve : { ...ve, height: Nt(Ne) },
+      "data-direction": _,
+      "data-zoom": ct ? "far" : void 0,
+      "data-interacting": at ? "" : void 0,
+      children: [
+        /* @__PURE__ */ S(
+          "div",
+          {
+            className: "smwb-dag-view__world",
+            role: "listbox",
+            "aria-label": Je,
+            "aria-roledescription": v.roleDescription,
+            "aria-describedby": Q ? Le : void 0,
+            style: {
+              width: `${Ke}px`,
+              height: `${je}px`,
+              transform: Rt(A)
+            },
+            onKeyDown: lt,
+            children: [
+              /* @__PURE__ */ S("svg", { className: "smwb-dag-view__edges", width: Ke, height: je, "aria-hidden": "true", children: [
+                /* @__PURE__ */ S("defs", { children: [
+                  /* @__PURE__ */ d(
+                    "marker",
+                    {
+                      id: Ie,
+                      viewBox: "0 0 10 10",
+                      refX: "9",
+                      refY: "5",
+                      markerWidth: "10",
+                      markerHeight: "10",
+                      markerUnits: "userSpaceOnUse",
+                      orient: "auto-start-reverse",
+                      children: /* @__PURE__ */ d("path", { className: "smwb-dag-view__arrow", d: "M0,1 L9,5 L0,9 z" })
+                    }
+                  ),
+                  /* @__PURE__ */ d(
+                    "marker",
+                    {
+                      id: $e,
+                      viewBox: "0 0 10 10",
+                      refX: "9",
+                      refY: "5",
+                      markerWidth: "10",
+                      markerHeight: "10",
+                      markerUnits: "userSpaceOnUse",
+                      orient: "auto-start-reverse",
+                      children: /* @__PURE__ */ d("path", { className: "smwb-dag-view__arrow smwb-dag-view__arrow--active", d: "M0,1 L9,5 L0,9 z" })
+                    }
+                  )
+                ] }),
+                /* @__PURE__ */ d("g", { transform: `translate(${b} ${b})`, children: l.edges.map((e) => /* @__PURE__ */ d(
+                  "path",
+                  {
+                    className: wt(e),
+                    "data-source": e.source,
+                    "data-target": e.target,
+                    d: xt(e.points, _),
+                    markerEnd: `url(#${D.edges.has(e.id) ? $e : Ie})`
+                  },
+                  e.id
+                )) })
+              ] }),
+              L.map((e, t) => gt(e, t))
+            ]
+          }
+        ),
+        Q ? /* @__PURE__ */ d("p", { id: Le, className: "smwb-dag-view__summary", children: Q }) : null,
+        nt ? /* @__PURE__ */ S("div", { className: "smwb-dag-view__controls", role: "group", "aria-label": v.controls, children: [
+          /* @__PURE__ */ d(
+            "button",
+            {
+              type: "button",
+              className: "smwb-dag-view__control",
+              title: v.zoomIn,
+              onClick: () => y.zoomBy(1.25),
+              children: /* @__PURE__ */ d("svg", { viewBox: "0 0 24 24", "aria-hidden": "true", children: /* @__PURE__ */ d("path", { d: "M12 5v14M5 12h14" }) })
+            }
+          ),
+          /* @__PURE__ */ d(
+            "button",
+            {
+              type: "button",
+              className: "smwb-dag-view__control",
+              title: v.zoomOut,
+              onClick: () => y.zoomBy(0.8),
+              children: /* @__PURE__ */ d("svg", { viewBox: "0 0 24 24", "aria-hidden": "true", children: /* @__PURE__ */ d("path", { d: "M5 12h14" }) })
+            }
+          ),
+          /* @__PURE__ */ d("button", { type: "button", className: "smwb-dag-view__control", title: v.fitView, onClick: () => y.fitView(), children: /* @__PURE__ */ d("svg", { viewBox: "0 0 24 24", "aria-hidden": "true", children: /* @__PURE__ */ d("path", { d: "M4 9V4h5M20 9V4h-5M4 15v5h5M20 15v5h-5" }) }) })
+        ] }) : null
+      ]
+    }
+  );
+}), Ht = Lt;
+export {
+  Ht as DagView
+};
+//# sourceMappingURL=dagView.js.map