@graphrefly/graphrefly 0.44.0 → 0.46.0

package/dist/utils/topology-view/index.cjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../src/utils/topology-view/index.ts","../../../src/base/render/_layout-sugiyama.ts","../../../src/utils/topology-view/_internal.ts"],"sourcesContent":["/**\n * `topologyView({ graph, layout? }): TopologyViewGraph` — D3 of the\n * three-layer view (`docs/optimizations.md` line \"D — Three-layer view\").\n *\n * Composes a target {@link Graph} with a pluggable layered-DAG layout into a\n * live {@link LayoutFrame} stream:\n *\n * ```text\n * target graph\n *   └─ observe({ changeset: true })  →  Node<GraphChange>\n *        └─ filter(topology)         →  recompute layout\n *        └─ each change              →  merge into a LayoutFrame\n * ```\n *\n * **Initial frame** is delivered on subscribe (push-on-subscribe per spec\n * §2.2) — the layout is seeded from `graph.describe()` at construction. A\n * consumer that wants deltas only can `pipe(skip(1))` from the output node.\n *\n * **Pluggable layout** — pass `opts.layout` to swap in `dagre`, `elk`, or\n * any layered-DAG library. The default is a minimal Sugiyama in\n * `_internal.ts` (matches the library's \"no deps, browser-safe\" ethos).\n *\n * **No timers** — animation is driven by the changeset's batch boundaries.\n * Each batch IS a frame; CSS transitions handle visual fade.\n *\n * @module\n */\n\nimport type { Node } from \"@graphrefly/pure-ts/core\";\nimport { Graph, type GraphChange, type GraphOptions } from \"@graphrefly/pure-ts/graph\";\nimport { defaultLayout } from \"./_internal.js\";\nimport type { LayoutFn, LayoutFrame } from \"./types.js\";\n\nexport type {\n\tLayoutBox,\n\tLayoutEdge,\n\tLayoutFn,\n\tLayoutFrame,\n} from \"./types.js\";\n\n/** Topology variants from {@link GraphChange} that invalidate layout. */\nconst TOPOLOGY_TYPES = new Set<GraphChange[\"type\"]>([\n\t\"node-added\",\n\t\"node-removed\",\n\t\"mount\",\n\t\"unmount\",\n]);\n\nfunction isTopologyChange(c: GraphChange): boolean {\n\treturn TOPOLOGY_TYPES.has(c.type);\n}\n\n/** Options for {@link topologyView}. */\nexport interface TopologyViewOptions {\n\t/** The target graph to observe. */\n\treadonly graph: Graph;\n\t/**\n\t * Pluggable layout function. Defaults to the bundled Sugiyama layout.\n\t * Adapt `dagre` / `elk` / etc. by wrapping their output in the\n\t * {@link LayoutFn} shape.\n\t */\n\treadonly layout?: LayoutFn;\n\t/** Optional name for the {@link TopologyViewGraph}. Defaults to `\"topology-view\"`. */\n\treadonly name?: string;\n\t/**\n\t * Forward extra options to the underlying {@link Graph} constructor\n\t * (e.g. `versioning`, `traceCapacity`).\n\t */\n\treadonly graphOptions?: GraphOptions;\n}\n\n/**\n * Live topology view — a {@link Graph} subclass that exposes a single\n * output node {@link TopologyViewGraph.frame} emitting {@link LayoutFrame}s.\n */\nexport class TopologyViewGraph extends Graph {\n\treadonly target: Graph;\n\treadonly layout: LayoutFn;\n\treadonly frame: Node<LayoutFrame>;\n\n\tconstructor(opts: TopologyViewOptions) {\n\t\tconst name = opts.name ?? \"topology-view\";\n\t\tsuper(name, opts.graphOptions);\n\t\tthis.target = opts.graph;\n\t\tthis.layout = opts.layout ?? ((spec) => defaultLayout(spec, \"LR\"));\n\n\t\t// 1. Source node — discrete GraphChange events from the target graph.\n\t\t//    Every change (data + topology + batch boundaries) flows here.\n\t\tconst changeset = this.target.observe({\n\t\t\tchangeset: true,\n\t\t\tchangesetName: \"target-changeset\",\n\t\t});\n\t\tthis.add(changeset, { name: \"changeset\" });\n\n\t\t// 2. Layout — recomputes only on topology changes. Reads\n\t\t//    `target.describe()` inside the fn body — this is a method call on\n\t\t//    the stored Graph reference, NOT a `.cache` read of another\n\t\t//    reactive node, so it does not violate spec §5.12. Initial value\n\t\t//    is seeded from the construction-time describe so the first\n\t\t//    push-on-subscribe delivers a valid frame before any change\n\t\t//    arrives. `partial: true` opts out of the first-run gate (§2.7) —\n\t\t//    the seeded `initial` is correct from construction; we don't need\n\t\t//    to wait for the upstream changeset to deliver its first DATA.\n\t\tconst seedLayout = this._computeLayout();\n\t\tconst layoutNode = this.derived<Pick<LayoutFrame, \"boxes\" | \"edges\">>(\n\t\t\t\"layout\",\n\t\t\t[\"changeset\"],\n\t\t\t(data, _ctx) => {\n\t\t\t\tconst batch0 = data[0];\n\t\t\t\tif (batch0 == null || batch0.length === 0) {\n\t\t\t\t\t// No changeset DATA this wave (or this is the seed activation\n\t\t\t\t\t// before changeset has fired). Settle as RESOLVED — caller\n\t\t\t\t\t// will read `prevData[0]` if it needs the current layout.\n\t\t\t\t\treturn [];\n\t\t\t\t}\n\t\t\t\tlet topologyHit = false;\n\t\t\t\tfor (const c of batch0 as readonly GraphChange[]) {\n\t\t\t\t\tif (isTopologyChange(c)) {\n\t\t\t\t\t\ttopologyHit = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!topologyHit) {\n\t\t\t\t\t// Data-only wave: keep layout unchanged. The cached layout\n\t\t\t\t\t// (from `initial` or a prior emit) is still valid.\n\t\t\t\t\treturn [];\n\t\t\t\t}\n\t\t\t\treturn [this._computeLayout()];\n\t\t\t},\n\t\t\t{ initial: seedLayout, partial: true },\n\t\t);\n\t\tvoid layoutNode;\n\n\t\t// 3. Frame — merges latest layout with the per-wave changes from the\n\t\t//    changeset. Two deps: layout (slow-moving — re-emits only on\n\t\t//    topology) and changeset (fast-moving — re-emits per change event).\n\t\t//    The fn collapses each wave into one LayoutFrame.\n\t\t//\n\t\t//    `partial: true` opts out of the first-run gate so that a\n\t\t//    data-only wave (where the layout dep settles RESOLVED but\n\t\t//    changeset emits DATA) still triggers fn — without it, frame\n\t\t//    would never run for data events because layout settled RESOLVED\n\t\t//    and `_depSettledAsResolved` does NOT exit the sentinel state on\n\t\t//    a dep, leaving the gate closed indefinitely.\n\t\tthis.frame = this.derived<LayoutFrame>(\n\t\t\t\"frame\",\n\t\t\t[\"layout\", \"changeset\"],\n\t\t\t(data, ctx) => {\n\t\t\t\tconst layoutBatch = data[0];\n\t\t\t\tconst changesetBatch = data[1];\n\t\t\t\tconst layout =\n\t\t\t\t\tlayoutBatch != null && layoutBatch.length > 0\n\t\t\t\t\t\t? (layoutBatch.at(-1) as Pick<LayoutFrame, \"boxes\" | \"edges\">)\n\t\t\t\t\t\t: (ctx.prevData[0] as Pick<LayoutFrame, \"boxes\" | \"edges\"> | undefined);\n\t\t\t\tif (layout == null) {\n\t\t\t\t\t// No layout yet — defer (skip emit). With `initial:` on\n\t\t\t\t\t// `layout`, this should never happen on the activation\n\t\t\t\t\t// wave, but guard for the edge case.\n\t\t\t\t\treturn [];\n\t\t\t\t}\n\t\t\t\tconst changes: GraphChange[] = [];\n\t\t\t\tif (changesetBatch != null) {\n\t\t\t\t\tfor (const c of changesetBatch) changes.push(c as GraphChange);\n\t\t\t\t}\n\t\t\t\treturn [\n\t\t\t\t\t{\n\t\t\t\t\t\tboxes: layout.boxes,\n\t\t\t\t\t\tedges: layout.edges,\n\t\t\t\t\t\tchanges,\n\t\t\t\t\t},\n\t\t\t\t];\n\t\t\t},\n\t\t\t{\n\t\t\t\tinitial: { boxes: seedLayout.boxes, edges: seedLayout.edges, changes: [] },\n\t\t\t\tpartial: true,\n\t\t\t},\n\t\t);\n\n\t\t// No external keepalive — the chain `frame → layout → changeset` is\n\t\t// activated by external subscribers on `frame`. When the last consumer\n\t\t// unsubscribes, the chain tears down and releases the target observe\n\t\t// handle. Producer-bound lifecycle, no leaks.\n\t}\n\n\tprivate _computeLayout(): Pick<LayoutFrame, \"boxes\" | \"edges\"> {\n\t\t// /qa F-5: short-circuit if the target was destroyed. `target.describe()`\n\t\t// on a destroyed graph returns empty topology silently — without this\n\t\t// guard, frame consumers would see a degraded layout (empty boxes /\n\t\t// edges) with no signal that the underlying graph is gone. The COMPLETE\n\t\t// propagation is handled by the changeset stream's teardown variant\n\t\t// flowing through `frame`.\n\t\tif (this.target.destroyed) {\n\t\t\treturn { boxes: [], edges: [] };\n\t\t}\n\t\tconst spec = this.target.describe();\n\t\treturn this.layout(spec);\n\t}\n}\n\n/**\n * Factory wrapper — `topologyView({ graph, layout? })`.\n */\nexport function topologyView(opts: TopologyViewOptions): TopologyViewGraph {\n\tconst view = new TopologyViewGraph(opts);\n\tview.tagFactory(\"topologyView\");\n\treturn view;\n}\n","/**\n * Sugiyama-style layered DAG layout on an integer grid.\n *\n * Pipeline:\n *   1. Longest-path layer assignment (sources at layer 0).\n *   2. Virtual-node splitting — every edge spanning more than one layer\n *      becomes a chain of synthetic nodes on intermediate layers. Downstream\n *      passes treat real and virtual nodes identically; crossing\n *      minimization therefore works on wide + deep DAGs, not only\n *      adjacent-layer cases.\n *   3. Crossing minimization — barycenter heuristic with alternating up /\n *      down sweeps plus an adjacent-transposition polish pass.\n *   4. Coordinate assignment — greedy median-aligned packing with collision\n *      resolution. Straightens vertical runs of virtual nodes so long edges\n *      become straight lines where topology allows.\n *   5. Orthogonal edge routing — per-gutter x-track assignment; horizontal\n *      segments sit at endpoint centerlines, vertical segments pack into the\n *      gutter column range without overlap. Remaining crossings are\n *      topologically unavoidable and will render as `┼` at draw time.\n *\n * Output coordinates are cell-grid integers (LR direction). TD rendering\n * swaps axes at draw time — the layout is direction-agnostic by\n * construction.\n *\n * Used only by [graph-spec-to-ascii.ts](./graph-spec-to-ascii.ts); not part of the public\n * `extra/render/index.ts` surface (underscore-prefixed).\n */\n\nexport type LayoutDirection = \"LR\" | \"TD\";\n\nexport type LayoutInput = {\n\t/** Node ids in stable iteration order. Determines initial tie-break. */\n\treadonly nodes: readonly string[];\n\t/** Edges by (from, to) path. Endpoints must be present in `nodes`. */\n\treadonly edges: ReadonlyArray<{ from: string; to: string }>;\n\t/** Label width in cells for each node (independent of direction). */\n\treadonly widthCells: (id: string) => number;\n\t/** Label height in cells for each node (independent of direction). */\n\treadonly heightCells: (id: string) => number;\n\t/**\n\t * Gap between layer \"columns\" (LR) or \"rows\" (TD), in cells.\n\t * Must allow enough room for per-gutter edge tracks.\n\t */\n\treadonly layerGap: number;\n\t/**\n\t * Gap between neighboring nodes *within* a layer, in cells.\n\t * LR: vertical gap; TD: horizontal gap.\n\t */\n\treadonly nodeGap: number;\n\t/**\n\t * Axis orientation. LR: layers = columns (x grows), order = rows (y grows).\n\t * TD: layers = rows (y grows), order = columns (x grows).\n\t */\n\treadonly direction: LayoutDirection;\n};\n\nexport type LayoutBox = {\n\treadonly id: string;\n\treadonly layer: number;\n\treadonly order: number;\n\treadonly x: number;\n\treadonly y: number;\n\treadonly w: number;\n\treadonly h: number;\n};\n\nexport type LayoutEdgePoint = { readonly x: number; readonly y: number };\n\nexport type LayoutEdge = {\n\treadonly from: string;\n\treadonly to: string;\n\t/** Polyline of waypoints (start → corners → end). Minimum 2 entries. */\n\treadonly points: readonly LayoutEdgePoint[];\n};\n\nexport type LayoutResult = {\n\treadonly boxes: readonly LayoutBox[];\n\treadonly edges: readonly LayoutEdge[];\n\treadonly width: number;\n\treadonly height: number;\n};\n\n// ---------------------------------------------------------------------------\n// Internal types — carried through the pipeline\n// ---------------------------------------------------------------------------\n\ntype Hop = {\n\tchainId: number;\n\tchainFrom: string;\n\tchainTo: string;\n\tfromId: string;\n\ttoId: string;\n\t/** 0-based hop index along the chain. */\n\thopIndex: number;\n\t/** Total hops in the chain (1 = direct, 2+ = spans virtuals). */\n\tchainLen: number;\n};\n\ntype InternalNode = {\n\tid: string;\n\tisVirtual: boolean;\n\tlayer: number;\n\torder: number;\n\tx: number;\n\ty: number;\n\tw: number;\n\th: number;\n\tin: Hop[];\n\tout: Hop[];\n};\n\ntype Layer = InternalNode[];\n\ntype PipelineState = {\n\tnodes: Map<string, InternalNode>;\n\tlayers: Layer[];\n\thops: Hop[];\n};\n\n// ---------------------------------------------------------------------------\n// Pipeline entry\n// ---------------------------------------------------------------------------\n\nexport function sugiyamaLayout(input: LayoutInput): LayoutResult {\n\tconst state = buildInitial(input);\n\tassignLayers(state);\n\tinsertVirtualNodes(state);\n\tminimizeCrossings(state);\n\tassignCoordinates(state, input);\n\tconst edges = routeEdges(state, input);\n\tconst { width, height } = boundingBox(state);\n\tconst boxes: LayoutBox[] = [];\n\tfor (const layer of state.layers) {\n\t\tfor (const n of layer) {\n\t\t\tif (n.isVirtual) continue;\n\t\t\tboxes.push({\n\t\t\t\tid: n.id,\n\t\t\t\tlayer: n.layer,\n\t\t\t\torder: n.order,\n\t\t\t\tx: n.x,\n\t\t\t\ty: n.y,\n\t\t\t\tw: n.w,\n\t\t\t\th: n.h,\n\t\t\t});\n\t\t}\n\t}\n\treturn { boxes, edges, width, height };\n}\n\n// ---------------------------------------------------------------------------\n// 1. Build internal graph\n// ---------------------------------------------------------------------------\n\nfunction buildInitial(input: LayoutInput): PipelineState {\n\tconst nodes = new Map<string, InternalNode>();\n\tfor (const id of input.nodes) {\n\t\tnodes.set(id, {\n\t\t\tid,\n\t\t\tisVirtual: false,\n\t\t\tlayer: -1,\n\t\t\torder: 0,\n\t\t\tx: 0,\n\t\t\ty: 0,\n\t\t\tw: input.widthCells(id),\n\t\t\th: input.heightCells(id),\n\t\t\tin: [],\n\t\t\tout: [],\n\t\t});\n\t}\n\tconst hops: Hop[] = [];\n\tlet chainId = 0;\n\tfor (const e of input.edges) {\n\t\tif (e.from === e.to) continue; // drop self-loops\n\t\tconst f = nodes.get(e.from);\n\t\tconst t = nodes.get(e.to);\n\t\tif (!f || !t) continue; // drop dangling endpoints\n\t\tconst hop: Hop = {\n\t\t\tchainId: chainId++,\n\t\t\tchainFrom: e.from,\n\t\t\tchainTo: e.to,\n\t\t\tfromId: e.from,\n\t\t\ttoId: e.to,\n\t\t\thopIndex: 0,\n\t\t\tchainLen: 1,\n\t\t};\n\t\tf.out.push(hop);\n\t\tt.in.push(hop);\n\t\thops.push(hop);\n\t}\n\treturn { nodes, layers: [], hops };\n}\n\n// ---------------------------------------------------------------------------\n// 2. Longest-path layer assignment (Kahn's algorithm)\n// ---------------------------------------------------------------------------\n\nfunction assignLayers(state: PipelineState): void {\n\tconst indeg = new Map<string, number>();\n\tfor (const n of state.nodes.values()) indeg.set(n.id, n.in.length);\n\n\tconst queue: InternalNode[] = [];\n\tfor (const n of state.nodes.values()) {\n\t\tif ((indeg.get(n.id) ?? 0) === 0) {\n\t\t\tn.layer = 0;\n\t\t\tqueue.push(n);\n\t\t}\n\t}\n\n\t// Cursor-based BFS — `Array.prototype.shift` is O(n), so the naive form\n\t// is O(n²) and degrades past ~1000 nodes. Cursor keeps it linear.\n\tconst visited = new Set<string>();\n\tlet head = 0;\n\twhile (head < queue.length) {\n\t\tconst n = queue[head++]!;\n\t\tif (visited.has(n.id)) continue;\n\t\tvisited.add(n.id);\n\t\tfor (const hop of n.out) {\n\t\t\tconst t = state.nodes.get(hop.toId)!;\n\t\t\tt.layer = Math.max(t.layer, n.layer + 1);\n\t\t\tconst d = (indeg.get(t.id) ?? 0) - 1;\n\t\t\tindeg.set(t.id, d);\n\t\t\tif (d <= 0) queue.push(t);\n\t\t}\n\t}\n\t// Nodes trapped in a cycle default to layer 0. The edges that would\n\t// close the cycle are dropped in `insertVirtualNodes` (any hop whose\n\t// span is not a positive integer). GraphReFly graphs are DAGs by spec;\n\t// this path is defensive against malformed describe snapshots.\n\tfor (const n of state.nodes.values()) if (n.layer < 0) n.layer = 0;\n}\n\n// ---------------------------------------------------------------------------\n// 3. Virtual-node insertion — critical for scaling past adjacent-layer edges\n// ---------------------------------------------------------------------------\n\nfunction insertVirtualNodes(state: PipelineState): void {\n\tconst maxLayer = Math.max(0, ...Array.from(state.nodes.values(), (n) => n.layer));\n\tconst layers: Layer[] = Array.from({ length: maxLayer + 1 }, () => []);\n\tfor (const n of state.nodes.values()) layers[n.layer]!.push(n);\n\n\tconst newHops: Hop[] = [];\n\tlet virtCounter = 0;\n\tfor (const hop of state.hops) {\n\t\tconst f = state.nodes.get(hop.fromId)!;\n\t\tconst t = state.nodes.get(hop.toId)!;\n\t\tconst span = t.layer - f.layer;\n\t\tif (span <= 0) {\n\t\t\t// Same-layer or back-edge — the input violated the DAG invariant\n\t\t\t// (self-loop was already dropped in `buildInitial`; this catches\n\t\t\t// cycles whose nodes collapsed to layer 0 in `assignLayers`).\n\t\t\t// Drop from both endpoints so routing never sees the hop; same\n\t\t\t// render-best-effort policy as the self-loop / dangling-endpoint\n\t\t\t// filters in `buildInitial`.\n\t\t\tf.out = f.out.filter((h) => h !== hop);\n\t\t\tt.in = t.in.filter((h) => h !== hop);\n\t\t\tcontinue;\n\t\t}\n\t\tif (span === 1) {\n\t\t\thop.hopIndex = 0;\n\t\t\thop.chainLen = 1;\n\t\t\tnewHops.push(hop);\n\t\t\tcontinue;\n\t\t}\n\t\t// Multi-hop: f → v1 → v2 → ... → t\n\t\t// Detach the original edge from f.out / t.in; we rewrite as chain.\n\t\tf.out = f.out.filter((h) => h !== hop);\n\t\tt.in = t.in.filter((h) => h !== hop);\n\n\t\tlet prev = f;\n\t\tfor (let i = 1; i < span; i += 1) {\n\t\t\tconst vid = `__virt_${virtCounter++}__`;\n\t\t\tconst v: InternalNode = {\n\t\t\t\tid: vid,\n\t\t\t\tisVirtual: true,\n\t\t\t\tlayer: f.layer + i,\n\t\t\t\torder: 0,\n\t\t\t\tx: 0,\n\t\t\t\ty: 0,\n\t\t\t\tw: 0,\n\t\t\t\th: 1,\n\t\t\t\tin: [],\n\t\t\t\tout: [],\n\t\t\t};\n\t\t\tstate.nodes.set(vid, v);\n\t\t\tlayers[v.layer]!.push(v);\n\t\t\tconst h: Hop = {\n\t\t\t\tchainId: hop.chainId,\n\t\t\t\tchainFrom: hop.chainFrom,\n\t\t\t\tchainTo: hop.chainTo,\n\t\t\t\tfromId: prev.id,\n\t\t\t\ttoId: vid,\n\t\t\t\thopIndex: i - 1,\n\t\t\t\tchainLen: span,\n\t\t\t};\n\t\t\tprev.out.push(h);\n\t\t\tv.in.push(h);\n\t\t\tnewHops.push(h);\n\t\t\tprev = v;\n\t\t}\n\t\tconst finalHop: Hop = {\n\t\t\tchainId: hop.chainId,\n\t\t\tchainFrom: hop.chainFrom,\n\t\t\tchainTo: hop.chainTo,\n\t\t\tfromId: prev.id,\n\t\t\ttoId: t.id,\n\t\t\thopIndex: span - 1,\n\t\t\tchainLen: span,\n\t\t};\n\t\tprev.out.push(finalHop);\n\t\tt.in.push(finalHop);\n\t\tnewHops.push(finalHop);\n\t}\n\n\t// Stable initial order within each layer.\n\tfor (const layer of layers) {\n\t\tfor (let i = 0; i < layer.length; i += 1) layer[i]!.order = i;\n\t}\n\tstate.layers = layers;\n\tstate.hops = newHops;\n}\n\n// ---------------------------------------------------------------------------\n// 4. Crossing minimization\n// ---------------------------------------------------------------------------\n\nfunction minimizeCrossings(state: PipelineState): void {\n\tconst SWEEPS = 4;\n\tfor (let sweep = 0; sweep < SWEEPS; sweep += 1) {\n\t\t// Down-sweep\n\t\tfor (let li = 1; li < state.layers.length; li += 1) {\n\t\t\tsortByBarycenter(state, state.layers[li]!, \"in\");\n\t\t\treindex(state.layers[li]!);\n\t\t}\n\t\t// Up-sweep\n\t\tfor (let li = state.layers.length - 2; li >= 0; li -= 1) {\n\t\t\tsortByBarycenter(state, state.layers[li]!, \"out\");\n\t\t\treindex(state.layers[li]!);\n\t\t}\n\t}\n\t// Polish — adjacent-transposition pass, bounded iterations.\n\tfor (let iter = 0; iter < 2; iter += 1) {\n\t\tlet improved = false;\n\t\tfor (let li = 1; li < state.layers.length; li += 1) {\n\t\t\tconst layer = state.layers[li]!;\n\t\t\tfor (let i = 0; i + 1 < layer.length; i += 1) {\n\t\t\t\tconst before = pairCrossings(state, layer[i]!, layer[i + 1]!, \"in\");\n\t\t\t\t[layer[i], layer[i + 1]] = [layer[i + 1]!, layer[i]!];\n\t\t\t\treindex(layer);\n\t\t\t\tconst after = pairCrossings(state, layer[i]!, layer[i + 1]!, \"in\");\n\t\t\t\tif (after < before) {\n\t\t\t\t\timproved = true;\n\t\t\t\t} else {\n\t\t\t\t\t[layer[i], layer[i + 1]] = [layer[i + 1]!, layer[i]!];\n\t\t\t\t\treindex(layer);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (!improved) break;\n\t}\n}\n\nfunction sortByBarycenter(state: PipelineState, layer: Layer, direction: \"in\" | \"out\"): void {\n\tconst bary = new Map<string, number>();\n\tfor (const n of layer) {\n\t\tconst neighbors = direction === \"in\" ? n.in : n.out;\n\t\tif (neighbors.length === 0) {\n\t\t\tbary.set(n.id, n.order);\n\t\t\tcontinue;\n\t\t}\n\t\tlet sum = 0;\n\t\tlet count = 0;\n\t\tfor (const h of neighbors) {\n\t\t\tconst other = state.nodes.get(direction === \"in\" ? h.fromId : h.toId);\n\t\t\tif (!other) continue;\n\t\t\tsum += other.order;\n\t\t\tcount += 1;\n\t\t}\n\t\tbary.set(n.id, count === 0 ? n.order : sum / count);\n\t}\n\tlayer.sort((a, b) => {\n\t\tconst ba = bary.get(a.id)!;\n\t\tconst bb = bary.get(b.id)!;\n\t\tif (ba !== bb) return ba - bb;\n\t\treturn a.order - b.order;\n\t});\n}\n\nfunction reindex(layer: Layer): void {\n\tfor (let i = 0; i < layer.length; i += 1) layer[i]!.order = i;\n}\n\nfunction pairCrossings(\n\tstate: PipelineState,\n\ta: InternalNode,\n\tb: InternalNode,\n\tdirection: \"in\" | \"out\",\n): number {\n\tconst aEdges = direction === \"in\" ? a.in : a.out;\n\tconst bEdges = direction === \"in\" ? b.in : b.out;\n\tlet crossings = 0;\n\tfor (const ea of aEdges) {\n\t\tfor (const eb of bEdges) {\n\t\t\tconst oa = state.nodes.get(direction === \"in\" ? ea.fromId : ea.toId)?.order ?? 0;\n\t\t\tconst ob = state.nodes.get(direction === \"in\" ? eb.fromId : eb.toId)?.order ?? 0;\n\t\t\tif ((a.order < b.order && oa > ob) || (a.order > b.order && oa < ob)) {\n\t\t\t\tcrossings += 1;\n\t\t\t}\n\t\t}\n\t}\n\treturn crossings;\n}\n\n// ---------------------------------------------------------------------------\n// 5. Coordinate assignment (direction-aware)\n// ---------------------------------------------------------------------------\n\nfunction assignCoordinates(state: PipelineState, input: LayoutInput): void {\n\tif (input.direction === \"LR\") assignCoordinatesLR(state, input);\n\telse assignCoordinatesTD(state, input);\n}\n\nfunction assignCoordinatesLR(state: PipelineState, input: LayoutInput): void {\n\t// x: per-layer column based on cumulative max width.\n\tconst layerX: number[] = [];\n\tlet cursorX = 0;\n\tfor (let li = 0; li < state.layers.length; li += 1) {\n\t\tlayerX.push(cursorX);\n\t\tlet maxW = 0;\n\t\tfor (const n of state.layers[li]!) maxW = Math.max(maxW, n.w);\n\t\tcursorX += maxW + input.layerGap;\n\t}\n\tfor (let li = 0; li < state.layers.length; li += 1) {\n\t\tfor (const n of state.layers[li]!) n.x = layerX[li]!;\n\t}\n\t// y: greedy pack per layer.\n\tfor (const layer of state.layers) {\n\t\tlet y = 0;\n\t\tfor (const n of layer) {\n\t\t\tn.y = y;\n\t\t\ty += n.h + input.nodeGap;\n\t\t}\n\t}\n\t// Median alignment — straightens chains through virtuals.\n\trunMedianPasses(state, input, \"y\");\n}\n\nfunction assignCoordinatesTD(state: PipelineState, input: LayoutInput): void {\n\t// y: per-layer row based on cumulative max height.\n\tconst layerY: number[] = [];\n\tlet cursorY = 0;\n\tfor (let li = 0; li < state.layers.length; li += 1) {\n\t\tlayerY.push(cursorY);\n\t\tlet maxH = 0;\n\t\tfor (const n of state.layers[li]!) maxH = Math.max(maxH, n.h);\n\t\tcursorY += maxH + input.layerGap;\n\t}\n\tfor (let li = 0; li < state.layers.length; li += 1) {\n\t\tfor (const n of state.layers[li]!) n.y = layerY[li]!;\n\t}\n\t// x: greedy pack per layer.\n\tfor (const layer of state.layers) {\n\t\tlet x = 0;\n\t\tfor (const n of layer) {\n\t\t\tn.x = x;\n\t\t\tx += n.w + input.nodeGap;\n\t\t}\n\t}\n\trunMedianPasses(state, input, \"x\");\n}\n\n/**\n * Median alignment passes — pulls each node toward the median position of\n * its in-layer neighbors along the private axis (\"y\" for LR, \"x\" for TD),\n * then resolves collisions greedily while preserving layer order.\n */\nfunction runMedianPasses(state: PipelineState, input: LayoutInput, axis: \"x\" | \"y\"): void {\n\tconst sizeOf = (n: InternalNode) => (axis === \"y\" ? n.h : n.w);\n\tconst gap = input.nodeGap;\n\tfor (let pass = 0; pass < 2; pass += 1) {\n\t\tconst walk = pass === 0 ? state.layers.slice(1) : state.layers.slice(0, -1).reverse();\n\t\tfor (const layer of walk) {\n\t\t\tconst preferred = new Map<string, number>();\n\t\t\tfor (const n of layer) {\n\t\t\t\tconst neighbors = pass === 0 ? n.in : n.out;\n\t\t\t\tif (neighbors.length === 0) continue;\n\t\t\t\tconst centers: number[] = [];\n\t\t\t\tfor (const h of neighbors) {\n\t\t\t\t\tconst other = state.nodes.get(pass === 0 ? h.fromId : h.toId);\n\t\t\t\t\tif (!other) continue;\n\t\t\t\t\tconst base = axis === \"y\" ? other.y : other.x;\n\t\t\t\t\tcenters.push(base + Math.floor(sizeOf(other) / 2));\n\t\t\t\t}\n\t\t\t\tif (centers.length === 0) continue;\n\t\t\t\tcenters.sort((a, b) => a - b);\n\t\t\t\tconst mid = centers[Math.floor(centers.length / 2)]!;\n\t\t\t\tpreferred.set(n.id, mid - Math.floor(sizeOf(n) / 2));\n\t\t\t}\n\t\t\tlet floor = 0;\n\t\t\tfor (const n of layer) {\n\t\t\t\tconst p = preferred.get(n.id);\n\t\t\t\tconst current = axis === \"y\" ? n.y : n.x;\n\t\t\t\tconst target = p ?? current;\n\t\t\t\tconst clamped = Math.max(target, floor);\n\t\t\t\tif (axis === \"y\") n.y = clamped;\n\t\t\t\telse n.x = clamped;\n\t\t\t\tfloor = clamped + sizeOf(n) + gap;\n\t\t\t}\n\t\t}\n\t}\n}\n\n// ---------------------------------------------------------------------------\n// 6. Orthogonal edge routing (direction-aware)\n//\n// For both LR and TD the algorithm is symmetric — it just operates on a\n// different pair of \"primary\" vs \"cross\" axes:\n//\n//   LR: primary = x (layer axis); cross = y. Gutters are vertical strips\n//       between columns; tracks within a gutter are distinct x-values.\n//   TD: primary = y (layer axis); cross = x. Gutters are horizontal strips\n//       between rows; tracks within a gutter are distinct y-values.\n// ---------------------------------------------------------------------------\n\nfunction routeEdges(state: PipelineState, input: LayoutInput): LayoutEdge[] {\n\t// Group hops by chainId → one LayoutEdge per user-facing edge.\n\tconst byChain = new Map<number, Hop[]>();\n\tfor (const h of state.hops) {\n\t\tconst arr = byChain.get(h.chainId);\n\t\tif (arr) arr.push(h);\n\t\telse byChain.set(h.chainId, [h]);\n\t}\n\tfor (const arr of byChain.values()) arr.sort((a, b) => a.hopIndex - b.hopIndex);\n\n\tconst isLR = input.direction === \"LR\";\n\tconst primary = (n: InternalNode): number => (isLR ? n.x : n.y);\n\tconst primarySize = (n: InternalNode): number => (isLR ? n.w : n.h);\n\tconst crossCenter = (n: InternalNode): number =>\n\t\tisLR ? n.y + Math.floor(n.h / 2) : n.x + Math.floor(n.w / 2);\n\n\t// Per-gutter cross-axis track assignment. Two passes:\n\t//   1. Assign each hop to a track INDEX using disjoint-interval packing\n\t//      (an existing track may host multiple hops as long as their\n\t//      cross-axis ranges don't overlap pairwise).\n\t//   2. Map each track index to a primary-axis position using the final\n\t//      track count so the distribution is uniform across the gutter —\n\t//      per-hop recomputation (old behavior) collapsed late tracks onto\n\t//      `gEnd`, producing bundled overlaps in dense gutters.\n\tconst hopTrackCross = new Map<Hop, number>();\n\tfor (let g = 0; g + 1 < state.layers.length; g += 1) {\n\t\tconst srcLayer = state.layers[g]!;\n\t\tconst dstLayer = state.layers[g + 1]!;\n\n\t\tlet gutterStart = 0;\n\t\tfor (const n of srcLayer) gutterStart = Math.max(gutterStart, primary(n) + primarySize(n));\n\t\tlet gutterEnd = Number.POSITIVE_INFINITY;\n\t\tfor (const n of dstLayer) gutterEnd = Math.min(gutterEnd, primary(n));\n\t\tconst gEnd = Number.isFinite(gutterEnd) ? (gutterEnd as number) - 1 : gutterStart;\n\t\tconst gutterWidth = Math.max(1, gEnd - gutterStart + 1);\n\n\t\tconst gutterHops: Hop[] = [];\n\t\tfor (const n of srcLayer) for (const h of n.out) gutterHops.push(h);\n\t\tgutterHops.sort((a, b) => {\n\t\t\tconst sa = crossCenter(state.nodes.get(a.fromId)!);\n\t\t\tconst sb = crossCenter(state.nodes.get(b.fromId)!);\n\t\t\tif (sa !== sb) return sa - sb;\n\t\t\tconst da = crossCenter(state.nodes.get(a.toId)!);\n\t\t\tconst db = crossCenter(state.nodes.get(b.toId)!);\n\t\t\treturn da - db;\n\t\t});\n\n\t\t// Pass 1: assign track indexes. Each track is an ARRAY of disjoint\n\t\t// intervals — two hops share a track iff their cross-axis ranges\n\t\t// don't overlap any existing interval on that track.\n\t\tconst tracks: Array<Array<{ lo: number; hi: number }>> = [];\n\t\tconst hopToTrackIdx = new Map<Hop, number>();\n\t\tfor (const h of gutterHops) {\n\t\t\tconst sc = crossCenter(state.nodes.get(h.fromId)!);\n\t\t\tconst dc = crossCenter(state.nodes.get(h.toId)!);\n\t\t\tconst lo = Math.min(sc, dc);\n\t\t\tconst hi = Math.max(sc, dc);\n\t\t\tlet idx = -1;\n\t\t\tfor (let t = 0; t < tracks.length; t += 1) {\n\t\t\t\tconst intervals = tracks[t]!;\n\t\t\t\tlet fits = true;\n\t\t\t\tfor (const iv of intervals) {\n\t\t\t\t\tif (iv.lo <= hi && lo <= iv.hi) {\n\t\t\t\t\t\tfits = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (fits) {\n\t\t\t\t\tintervals.push({ lo, hi });\n\t\t\t\t\tidx = t;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (idx < 0) {\n\t\t\t\ttracks.push([{ lo, hi }]);\n\t\t\t\tidx = tracks.length - 1;\n\t\t\t}\n\t\t\thopToTrackIdx.set(h, idx);\n\t\t}\n\n\t\t// Pass 2: distribute track indexes uniformly across the gutter's\n\t\t// **interior** (reserve 1-cell margin from each boundary when the\n\t\t// gutter is wide enough). A track placed exactly at `gutterStart`\n\t\t// or `gEnd` collapses the final turn-segment into the adjacent\n\t\t// node's border row, producing a visually misleading arrow; the\n\t\t// margin avoids that whenever geometry allows.\n\t\tconst count = tracks.length;\n\t\tconst hasMargin = gutterWidth >= Math.max(3, count + 2);\n\t\tconst usableStart = hasMargin ? gutterStart + 1 : gutterStart;\n\t\tconst usableEnd = hasMargin ? gEnd - 1 : gEnd;\n\t\tconst usableWidth = Math.max(1, usableEnd - usableStart + 1);\n\t\tfor (const h of gutterHops) {\n\t\t\tconst idx = hopToTrackIdx.get(h)!;\n\t\t\tlet trackPrimary: number;\n\t\t\tif (count <= 1) {\n\t\t\t\ttrackPrimary = usableStart + Math.floor(usableWidth / 2);\n\t\t\t} else {\n\t\t\t\tconst step = (usableWidth - 1) / (count - 1);\n\t\t\t\ttrackPrimary = usableStart + Math.floor(idx * step);\n\t\t\t}\n\t\t\thopTrackCross.set(h, Math.max(gutterStart, Math.min(gEnd, trackPrimary)));\n\t\t}\n\t}\n\n\t// Build polylines.\n\tconst out: LayoutEdge[] = [];\n\tfor (const [, hops] of byChain) {\n\t\tconst points: LayoutEdgePoint[] = [];\n\t\tfor (let i = 0; i < hops.length; i += 1) {\n\t\t\tconst h = hops[i]!;\n\t\t\tconst src = state.nodes.get(h.fromId)!;\n\t\t\tconst dst = state.nodes.get(h.toId)!;\n\t\t\tconst track = hopTrackCross.get(h)!;\n\t\t\t// Endpoints in (primary, cross) space.\n\t\t\tconst srcPrimary = src.isVirtual ? primary(src) : primary(src) + primarySize(src);\n\t\t\tconst dstPrimary = dst.isVirtual ? primary(dst) : primary(dst) - 1;\n\t\t\tconst sc = crossCenter(src);\n\t\t\tconst dc = crossCenter(dst);\n\t\t\tif (i === 0) pushPoint(points, isLR, srcPrimary, sc);\n\t\t\tif (sc !== dc) {\n\t\t\t\tpushPoint(points, isLR, track, sc);\n\t\t\t\tpushPoint(points, isLR, track, dc);\n\t\t\t}\n\t\t\tpushPoint(points, isLR, dstPrimary, dc);\n\t\t}\n\t\tconst chain = hops[0]!;\n\t\tout.push({\n\t\t\tfrom: chain.chainFrom,\n\t\t\tto: chain.chainTo,\n\t\t\tpoints: dedupWaypoints(points),\n\t\t});\n\t}\n\treturn out;\n}\n\nfunction pushPoint(acc: LayoutEdgePoint[], isLR: boolean, primary: number, cross: number): void {\n\tacc.push(isLR ? { x: primary, y: cross } : { x: cross, y: primary });\n}\n\nfunction dedupWaypoints(points: readonly LayoutEdgePoint[]): LayoutEdgePoint[] {\n\tconst out: LayoutEdgePoint[] = [];\n\tfor (const p of points) {\n\t\tconst last = out[out.length - 1];\n\t\tif (!last || last.x !== p.x || last.y !== p.y) out.push(p);\n\t}\n\treturn out;\n}\n\n// ---------------------------------------------------------------------------\n// Bounding box\n// ---------------------------------------------------------------------------\n\nfunction boundingBox(state: PipelineState): { width: number; height: number } {\n\tlet w = 0;\n\tlet h = 0;\n\tfor (const layer of state.layers) {\n\t\tfor (const n of layer) {\n\t\t\tw = Math.max(w, n.x + n.w);\n\t\t\th = Math.max(h, n.y + n.h);\n\t\t}\n\t}\n\treturn { width: w, height: h };\n}\n","/**\n * Default layout for `topologyView` — wraps the bundled Sugiyama-style layered\n * DAG layout from `extra/render/_layout-sugiyama.ts`.\n *\n * The library ships zero deps and is browser-safe by default; the bundled\n * layout matches that ethos. Users wanting production-quality layout can swap\n * in `dagre`, `elk`, etc. by passing `opts.layout` to {@link topologyView}.\n *\n * Direction-agnostic (defaults to `\"LR\"`). Per-node label sizing is\n * conservative: 1 cell tall, label-length-derived width capped at 24 cells.\n *\n * @module\n */\n\nimport type { GraphDescribeOutput } from \"@graphrefly/pure-ts/graph\";\nimport {\n\ttype LayoutDirection,\n\ttype LayoutEdgePoint,\n\tsugiyamaLayout,\n} from \"../../base/render/_layout-sugiyama.js\";\nimport type { LayoutFn, LayoutFrame } from \"./types.js\";\n\nconst MIN_W = 3;\nconst MAX_W = 24;\nconst NODE_H = 1;\nconst LAYER_GAP = 4;\nconst NODE_GAP = 1;\n\n/**\n * Best-effort label-width estimate (cells). Caller can override by providing\n * its own {@link LayoutFn}; this default treats every visible character as\n * one cell. Local-segment is preferred over qualified path so the label\n * stays compact on cells with deep mounts.\n */\nfunction widthOf(id: string): number {\n\tconst local = id.includes(\"::\") ? (id.split(\"::\").pop() ?? id) : id;\n\treturn Math.max(MIN_W, Math.min(MAX_W, local.length + 2));\n}\n\nfunction heightOf(_id: string): number {\n\treturn NODE_H;\n}\n\n/**\n * Default layered-DAG layout for `topologyView`. Pure fn over a describe\n * snapshot; deterministic for a given input ordering.\n */\nexport function defaultLayout(\n\tspec: GraphDescribeOutput,\n\tdirection: LayoutDirection = \"LR\",\n): Pick<LayoutFrame, \"boxes\" | \"edges\"> {\n\tconst ids = Object.keys(spec.nodes).sort();\n\tconst edges = spec.edges.map((e) => ({ from: e.from, to: e.to }));\n\tif (ids.length === 0) {\n\t\treturn { boxes: [], edges: [] };\n\t}\n\tconst result = sugiyamaLayout({\n\t\tnodes: ids,\n\t\tedges,\n\t\twidthCells: widthOf,\n\t\theightCells: heightOf,\n\t\tlayerGap: LAYER_GAP,\n\t\tnodeGap: NODE_GAP,\n\t\tdirection,\n\t});\n\n\t// Map back to the public LayoutFrame shape, attaching per-node meta from\n\t// the describe snapshot for downstream renderers (kind/factory/domain).\n\tconst boxes = result.boxes.map((b) => ({\n\t\tid: b.id,\n\t\tx: b.x,\n\t\ty: b.y,\n\t\tw: b.w,\n\t\th: b.h,\n\t\tmeta: spec.nodes[b.id]?.meta,\n\t}));\n\n\t// Build a quick \"to → ordered deps\" lookup for `depIndex` attribution. The\n\t// describe snapshot's `nodes[id].deps` is the positional dep array; the\n\t// edge's depIndex is the position of `from` in `to`'s deps.\n\t//\n\t// /qa F-22: when the same upstream appears multiple times in `to.deps`\n\t// (diamond / duplicate-dep patterns), each (from, to) edge gets a distinct\n\t// depIndex via a per-`to` running cursor over occurrences in `toDeps`.\n\tconst seenPerTo = new Map<string, number>();\n\tconst edgeOut = result.edges.map((e) => {\n\t\tconst toDeps = spec.nodes[e.to]?.deps ?? [];\n\t\tconst cursorKey = `${e.to}::${e.from}`;\n\t\tconst startFrom = seenPerTo.get(cursorKey) ?? 0;\n\t\tconst depIndex = toDeps.indexOf(e.from, startFrom);\n\t\tseenPerTo.set(cursorKey, depIndex >= 0 ? depIndex + 1 : startFrom);\n\t\tconst points = e.points.map((p: LayoutEdgePoint) => [p.x, p.y] as const);\n\t\treturn {\n\t\t\tfrom: e.from,\n\t\t\tto: e.to,\n\t\t\tdepIndex: depIndex >= 0 ? depIndex : -1,\n\t\t\tpoints: points as ReadonlyArray<readonly [number, number]>,\n\t\t};\n\t});\n\n\treturn { boxes, edges: edgeOut };\n}\n\n/** Adapter — narrows `defaultLayout` to the {@link LayoutFn} signature. */\nexport const defaultLayoutFn: LayoutFn = (spec) => defaultLayout(spec, \"LR\");\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AA6BA,mBAA2D;;;AC8FpD,SAAS,eAAe,OAAkC;AAChE,QAAM,QAAQ,aAAa,KAAK;AAChC,eAAa,KAAK;AAClB,qBAAmB,KAAK;AACxB,oBAAkB,KAAK;AACvB,oBAAkB,OAAO,KAAK;AAC9B,QAAM,QAAQ,WAAW,OAAO,KAAK;AACrC,QAAM,EAAE,OAAO,OAAO,IAAI,YAAY,KAAK;AAC3C,QAAM,QAAqB,CAAC;AAC5B,aAAW,SAAS,MAAM,QAAQ;AACjC,eAAW,KAAK,OAAO;AACtB,UAAI,EAAE,UAAW;AACjB,YAAM,KAAK;AAAA,QACV,IAAI,EAAE;AAAA,QACN,OAAO,EAAE;AAAA,QACT,OAAO,EAAE;AAAA,QACT,GAAG,EAAE;AAAA,QACL,GAAG,EAAE;AAAA,QACL,GAAG,EAAE;AAAA,QACL,GAAG,EAAE;AAAA,MACN,CAAC;AAAA,IACF;AAAA,EACD;AACA,SAAO,EAAE,OAAO,OAAO,OAAO,OAAO;AACtC;AAMA,SAAS,aAAa,OAAmC;AACxD,QAAM,QAAQ,oBAAI,IAA0B;AAC5C,aAAW,MAAM,MAAM,OAAO;AAC7B,UAAM,IAAI,IAAI;AAAA,MACb;AAAA,MACA,WAAW;AAAA,MACX,OAAO;AAAA,MACP,OAAO;AAAA,MACP,GAAG;AAAA,MACH,GAAG;AAAA,MACH,GAAG,MAAM,WAAW,EAAE;AAAA,MACtB,GAAG,MAAM,YAAY,EAAE;AAAA,MACvB,IAAI,CAAC;AAAA,MACL,KAAK,CAAC;AAAA,IACP,CAAC;AAAA,EACF;AACA,QAAM,OAAc,CAAC;AACrB,MAAI,UAAU;AACd,aAAW,KAAK,MAAM,OAAO;AAC5B,QAAI,EAAE,SAAS,EAAE,GAAI;AACrB,UAAM,IAAI,MAAM,IAAI,EAAE,IAAI;AAC1B,UAAM,IAAI,MAAM,IAAI,EAAE,EAAE;AACxB,QAAI,CAAC,KAAK,CAAC,EAAG;AACd,UAAM,MAAW;AAAA,MAChB,SAAS;AAAA,MACT,WAAW,EAAE;AAAA,MACb,SAAS,EAAE;AAAA,MACX,QAAQ,EAAE;AAAA,MACV,MAAM,EAAE;AAAA,MACR,UAAU;AAAA,MACV,UAAU;AAAA,IACX;AACA,MAAE,IAAI,KAAK,GAAG;AACd,MAAE,GAAG,KAAK,GAAG;AACb,SAAK,KAAK,GAAG;AAAA,EACd;AACA,SAAO,EAAE,OAAO,QAAQ,CAAC,GAAG,KAAK;AAClC;AAMA,SAAS,aAAa,OAA4B;AACjD,QAAM,QAAQ,oBAAI,IAAoB;AACtC,aAAW,KAAK,MAAM,MAAM,OAAO,EAAG,OAAM,IAAI,EAAE,IAAI,EAAE,GAAG,MAAM;AAEjE,QAAM,QAAwB,CAAC;AAC/B,aAAW,KAAK,MAAM,MAAM,OAAO,GAAG;AACrC,SAAK,MAAM,IAAI,EAAE,EAAE,KAAK,OAAO,GAAG;AACjC,QAAE,QAAQ;AACV,YAAM,KAAK,CAAC;AAAA,IACb;AAAA,EACD;AAIA,QAAM,UAAU,oBAAI,IAAY;AAChC,MAAI,OAAO;AACX,SAAO,OAAO,MAAM,QAAQ;AAC3B,UAAM,IAAI,MAAM,MAAM;AACtB,QAAI,QAAQ,IAAI,EAAE,EAAE,EAAG;AACvB,YAAQ,IAAI,EAAE,EAAE;AAChB,eAAW,OAAO,EAAE,KAAK;AACxB,YAAM,IAAI,MAAM,MAAM,IAAI,IAAI,IAAI;AAClC,QAAE,QAAQ,KAAK,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC;AACvC,YAAM,KAAK,MAAM,IAAI,EAAE,EAAE,KAAK,KAAK;AACnC,YAAM,IAAI,EAAE,IAAI,CAAC;AACjB,UAAI,KAAK,EAAG,OAAM,KAAK,CAAC;AAAA,IACzB;AAAA,EACD;AAKA,aAAW,KAAK,MAAM,MAAM,OAAO,EAAG,KAAI,EAAE,QAAQ,EAAG,GAAE,QAAQ;AAClE;AAMA,SAAS,mBAAmB,OAA4B;AACvD,QAAM,WAAW,KAAK,IAAI,GAAG,GAAG,MAAM,KAAK,MAAM,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC;AAChF,QAAM,SAAkB,MAAM,KAAK,EAAE,QAAQ,WAAW,EAAE,GAAG,MAAM,CAAC,CAAC;AACrE,aAAW,KAAK,MAAM,MAAM,OAAO,EAAG,QAAO,EAAE,KAAK,EAAG,KAAK,CAAC;AAE7D,QAAM,UAAiB,CAAC;AACxB,MAAI,cAAc;AAClB,aAAW,OAAO,MAAM,MAAM;AAC7B,UAAM,IAAI,MAAM,MAAM,IAAI,IAAI,MAAM;AACpC,UAAM,IAAI,MAAM,MAAM,IAAI,IAAI,IAAI;AAClC,UAAM,OAAO,EAAE,QAAQ,EAAE;AACzB,QAAI,QAAQ,GAAG;AAOd,QAAE,MAAM,EAAE,IAAI,OAAO,CAAC,MAAM,MAAM,GAAG;AACrC,QAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,MAAM,GAAG;AACnC;AAAA,IACD;AACA,QAAI,SAAS,GAAG;AACf,UAAI,WAAW;AACf,UAAI,WAAW;AACf,cAAQ,KAAK,GAAG;AAChB;AAAA,IACD;AAGA,MAAE,MAAM,EAAE,IAAI,OAAO,CAAC,MAAM,MAAM,GAAG;AACrC,MAAE,KAAK,EAAE,GAAG,OAAO,CAAC,MAAM,MAAM,GAAG;AAEnC,QAAI,OAAO;AACX,aAAS,IAAI,GAAG,IAAI,MAAM,KAAK,GAAG;AACjC,YAAM,MAAM,UAAU,aAAa;AACnC,YAAM,IAAkB;AAAA,QACvB,IAAI;AAAA,QACJ,WAAW;AAAA,QACX,OAAO,EAAE,QAAQ;AAAA,QACjB,OAAO;AAAA,QACP,GAAG;AAAA,QACH,GAAG;AAAA,QACH,GAAG;AAAA,QACH,GAAG;AAAA,QACH,IAAI,CAAC;AAAA,QACL,KAAK,CAAC;AAAA,MACP;AACA,YAAM,MAAM,IAAI,KAAK,CAAC;AACtB,aAAO,EAAE,KAAK,EAAG,KAAK,CAAC;AACvB,YAAM,IAAS;AAAA,QACd,SAAS,IAAI;AAAA,QACb,WAAW,IAAI;AAAA,QACf,SAAS,IAAI;AAAA,QACb,QAAQ,KAAK;AAAA,QACb,MAAM;AAAA,QACN,UAAU,IAAI;AAAA,QACd,UAAU;AAAA,MACX;AACA,WAAK,IAAI,KAAK,CAAC;AACf,QAAE,GAAG,KAAK,CAAC;AACX,cAAQ,KAAK,CAAC;AACd,aAAO;AAAA,IACR;AACA,UAAM,WAAgB;AAAA,MACrB,SAAS,IAAI;AAAA,MACb,WAAW,IAAI;AAAA,MACf,SAAS,IAAI;AAAA,MACb,QAAQ,KAAK;AAAA,MACb,MAAM,EAAE;AAAA,MACR,UAAU,OAAO;AAAA,MACjB,UAAU;AAAA,IACX;AACA,SAAK,IAAI,KAAK,QAAQ;AACtB,MAAE,GAAG,KAAK,QAAQ;AAClB,YAAQ,KAAK,QAAQ;AAAA,EACtB;AAGA,aAAW,SAAS,QAAQ;AAC3B,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EAAG,OAAM,CAAC,EAAG,QAAQ;AAAA,EAC7D;AACA,QAAM,SAAS;AACf,QAAM,OAAO;AACd;AAMA,SAAS,kBAAkB,OAA4B;AACtD,QAAM,SAAS;AACf,WAAS,QAAQ,GAAG,QAAQ,QAAQ,SAAS,GAAG;AAE/C,aAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,uBAAiB,OAAO,MAAM,OAAO,EAAE,GAAI,IAAI;AAC/C,cAAQ,MAAM,OAAO,EAAE,CAAE;AAAA,IAC1B;AAEA,aAAS,KAAK,MAAM,OAAO,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG;AACxD,uBAAiB,OAAO,MAAM,OAAO,EAAE,GAAI,KAAK;AAChD,cAAQ,MAAM,OAAO,EAAE,CAAE;AAAA,IAC1B;AAAA,EACD;AAEA,WAAS,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG;AACvC,QAAI,WAAW;AACf,aAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,YAAM,QAAQ,MAAM,OAAO,EAAE;AAC7B,eAAS,IAAI,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK,GAAG;AAC7C,cAAM,SAAS,cAAc,OAAO,MAAM,CAAC,GAAI,MAAM,IAAI,CAAC,GAAI,IAAI;AAClE,SAAC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,GAAI,MAAM,CAAC,CAAE;AACpD,gBAAQ,KAAK;AACb,cAAM,QAAQ,cAAc,OAAO,MAAM,CAAC,GAAI,MAAM,IAAI,CAAC,GAAI,IAAI;AACjE,YAAI,QAAQ,QAAQ;AACnB,qBAAW;AAAA,QACZ,OAAO;AACN,WAAC,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,GAAI,MAAM,CAAC,CAAE;AACpD,kBAAQ,KAAK;AAAA,QACd;AAAA,MACD;AAAA,IACD;AACA,QAAI,CAAC,SAAU;AAAA,EAChB;AACD;AAEA,SAAS,iBAAiB,OAAsB,OAAc,WAA+B;AAC5F,QAAM,OAAO,oBAAI,IAAoB;AACrC,aAAW,KAAK,OAAO;AACtB,UAAM,YAAY,cAAc,OAAO,EAAE,KAAK,EAAE;AAChD,QAAI,UAAU,WAAW,GAAG;AAC3B,WAAK,IAAI,EAAE,IAAI,EAAE,KAAK;AACtB;AAAA,IACD;AACA,QAAI,MAAM;AACV,QAAI,QAAQ;AACZ,eAAW,KAAK,WAAW;AAC1B,YAAM,QAAQ,MAAM,MAAM,IAAI,cAAc,OAAO,EAAE,SAAS,EAAE,IAAI;AACpE,UAAI,CAAC,MAAO;AACZ,aAAO,MAAM;AACb,eAAS;AAAA,IACV;AACA,SAAK,IAAI,EAAE,IAAI,UAAU,IAAI,EAAE,QAAQ,MAAM,KAAK;AAAA,EACnD;AACA,QAAM,KAAK,CAAC,GAAG,MAAM;AACpB,UAAM,KAAK,KAAK,IAAI,EAAE,EAAE;AACxB,UAAM,KAAK,KAAK,IAAI,EAAE,EAAE;AACxB,QAAI,OAAO,GAAI,QAAO,KAAK;AAC3B,WAAO,EAAE,QAAQ,EAAE;AAAA,EACpB,CAAC;AACF;AAEA,SAAS,QAAQ,OAAoB;AACpC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EAAG,OAAM,CAAC,EAAG,QAAQ;AAC7D;AAEA,SAAS,cACR,OACA,GACA,GACA,WACS;AACT,QAAM,SAAS,cAAc,OAAO,EAAE,KAAK,EAAE;AAC7C,QAAM,SAAS,cAAc,OAAO,EAAE,KAAK,EAAE;AAC7C,MAAI,YAAY;AAChB,aAAW,MAAM,QAAQ;AACxB,eAAW,MAAM,QAAQ;AACxB,YAAM,KAAK,MAAM,MAAM,IAAI,cAAc,OAAO,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS;AAC/E,YAAM,KAAK,MAAM,MAAM,IAAI,cAAc,OAAO,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS;AAC/E,UAAK,EAAE,QAAQ,EAAE,SAAS,KAAK,MAAQ,EAAE,QAAQ,EAAE,SAAS,KAAK,IAAK;AACrE,qBAAa;AAAA,MACd;AAAA,IACD;AAAA,EACD;AACA,SAAO;AACR;AAMA,SAAS,kBAAkB,OAAsB,OAA0B;AAC1E,MAAI,MAAM,cAAc,KAAM,qBAAoB,OAAO,KAAK;AAAA,MACzD,qBAAoB,OAAO,KAAK;AACtC;AAEA,SAAS,oBAAoB,OAAsB,OAA0B;AAE5E,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,WAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,WAAO,KAAK,OAAO;AACnB,QAAI,OAAO;AACX,eAAW,KAAK,MAAM,OAAO,EAAE,EAAI,QAAO,KAAK,IAAI,MAAM,EAAE,CAAC;AAC5D,eAAW,OAAO,MAAM;AAAA,EACzB;AACA,WAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,eAAW,KAAK,MAAM,OAAO,EAAE,EAAI,GAAE,IAAI,OAAO,EAAE;AAAA,EACnD;AAEA,aAAW,SAAS,MAAM,QAAQ;AACjC,QAAI,IAAI;AACR,eAAW,KAAK,OAAO;AACtB,QAAE,IAAI;AACN,WAAK,EAAE,IAAI,MAAM;AAAA,IAClB;AAAA,EACD;AAEA,kBAAgB,OAAO,OAAO,GAAG;AAClC;AAEA,SAAS,oBAAoB,OAAsB,OAA0B;AAE5E,QAAM,SAAmB,CAAC;AAC1B,MAAI,UAAU;AACd,WAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,WAAO,KAAK,OAAO;AACnB,QAAI,OAAO;AACX,eAAW,KAAK,MAAM,OAAO,EAAE,EAAI,QAAO,KAAK,IAAI,MAAM,EAAE,CAAC;AAC5D,eAAW,OAAO,MAAM;AAAA,EACzB;AACA,WAAS,KAAK,GAAG,KAAK,MAAM,OAAO,QAAQ,MAAM,GAAG;AACnD,eAAW,KAAK,MAAM,OAAO,EAAE,EAAI,GAAE,IAAI,OAAO,EAAE;AAAA,EACnD;AAEA,aAAW,SAAS,MAAM,QAAQ;AACjC,QAAI,IAAI;AACR,eAAW,KAAK,OAAO;AACtB,QAAE,IAAI;AACN,WAAK,EAAE,IAAI,MAAM;AAAA,IAClB;AAAA,EACD;AACA,kBAAgB,OAAO,OAAO,GAAG;AAClC;AAOA,SAAS,gBAAgB,OAAsB,OAAoB,MAAuB;AACzF,QAAM,SAAS,CAAC,MAAqB,SAAS,MAAM,EAAE,IAAI,EAAE;AAC5D,QAAM,MAAM,MAAM;AAClB,WAAS,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG;AACvC,UAAM,OAAO,SAAS,IAAI,MAAM,OAAO,MAAM,CAAC,IAAI,MAAM,OAAO,MAAM,GAAG,EAAE,EAAE,QAAQ;AACpF,eAAW,SAAS,MAAM;AACzB,YAAM,YAAY,oBAAI,IAAoB;AAC1C,iBAAW,KAAK,OAAO;AACtB,cAAM,YAAY,SAAS,IAAI,EAAE,KAAK,EAAE;AACxC,YAAI,UAAU,WAAW,EAAG;AAC5B,cAAM,UAAoB,CAAC;AAC3B,mBAAW,KAAK,WAAW;AAC1B,gBAAM,QAAQ,MAAM,MAAM,IAAI,SAAS,IAAI,EAAE,SAAS,EAAE,IAAI;AAC5D,cAAI,CAAC,MAAO;AACZ,gBAAM,OAAO,SAAS,MAAM,MAAM,IAAI,MAAM;AAC5C,kBAAQ,KAAK,OAAO,KAAK,MAAM,OAAO,KAAK,IAAI,CAAC,CAAC;AAAA,QAClD;AACA,YAAI,QAAQ,WAAW,EAAG;AAC1B,gBAAQ,KAAK,CAAC,GAAG,MAAM,IAAI,CAAC;AAC5B,cAAM,MAAM,QAAQ,KAAK,MAAM,QAAQ,SAAS,CAAC,CAAC;AAClD,kBAAU,IAAI,EAAE,IAAI,MAAM,KAAK,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC;AAAA,MACpD;AACA,UAAI,QAAQ;AACZ,iBAAW,KAAK,OAAO;AACtB,cAAM,IAAI,UAAU,IAAI,EAAE,EAAE;AAC5B,cAAM,UAAU,SAAS,MAAM,EAAE,IAAI,EAAE;AACvC,cAAM,SAAS,KAAK;AACpB,cAAM,UAAU,KAAK,IAAI,QAAQ,KAAK;AACtC,YAAI,SAAS,IAAK,GAAE,IAAI;AAAA,YACnB,GAAE,IAAI;AACX,gBAAQ,UAAU,OAAO,CAAC,IAAI;AAAA,MAC/B;AAAA,IACD;AAAA,EACD;AACD;AAcA,SAAS,WAAW,OAAsB,OAAkC;AAE3E,QAAM,UAAU,oBAAI,IAAmB;AACvC,aAAW,KAAK,MAAM,MAAM;AAC3B,UAAM,MAAM,QAAQ,IAAI,EAAE,OAAO;AACjC,QAAI,IAAK,KAAI,KAAK,CAAC;AAAA,QACd,SAAQ,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;AAAA,EAChC;AACA,aAAW,OAAO,QAAQ,OAAO,EAAG,KAAI,KAAK,CAAC,GAAG,MAAM,EAAE,WAAW,EAAE,QAAQ;AAE9E,QAAM,OAAO,MAAM,cAAc;AACjC,QAAM,UAAU,CAAC,MAA6B,OAAO,EAAE,IAAI,EAAE;AAC7D,QAAM,cAAc,CAAC,MAA6B,OAAO,EAAE,IAAI,EAAE;AACjE,QAAM,cAAc,CAAC,MACpB,OAAO,EAAE,IAAI,KAAK,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,EAAE,IAAI,CAAC;AAU5D,QAAM,gBAAgB,oBAAI,IAAiB;AAC3C,WAAS,IAAI,GAAG,IAAI,IAAI,MAAM,OAAO,QAAQ,KAAK,GAAG;AACpD,UAAM,WAAW,MAAM,OAAO,CAAC;AAC/B,UAAM,WAAW,MAAM,OAAO,IAAI,CAAC;AAEnC,QAAI,cAAc;AAClB,eAAW,KAAK,SAAU,eAAc,KAAK,IAAI,aAAa,QAAQ,CAAC,IAAI,YAAY,CAAC,CAAC;AACzF,QAAI,YAAY,OAAO;AACvB,eAAW,KAAK,SAAU,aAAY,KAAK,IAAI,WAAW,QAAQ,CAAC,CAAC;AACpE,UAAM,OAAO,OAAO,SAAS,SAAS,IAAK,YAAuB,IAAI;AACtE,UAAM,cAAc,KAAK,IAAI,GAAG,OAAO,cAAc,CAAC;AAEtD,UAAM,aAAoB,CAAC;AAC3B,eAAW,KAAK,SAAU,YAAW,KAAK,EAAE,IAAK,YAAW,KAAK,CAAC;AAClE,eAAW,KAAK,CAAC,GAAG,MAAM;AACzB,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,MAAM,CAAE;AACjD,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,MAAM,CAAE;AACjD,UAAI,OAAO,GAAI,QAAO,KAAK;AAC3B,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,IAAI,CAAE;AAC/C,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,IAAI,CAAE;AAC/C,aAAO,KAAK;AAAA,IACb,CAAC;AAKD,UAAM,SAAmD,CAAC;AAC1D,UAAM,gBAAgB,oBAAI,IAAiB;AAC3C,eAAW,KAAK,YAAY;AAC3B,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,MAAM,CAAE;AACjD,YAAM,KAAK,YAAY,MAAM,MAAM,IAAI,EAAE,IAAI,CAAE;AAC/C,YAAM,KAAK,KAAK,IAAI,IAAI,EAAE;AAC1B,YAAM,KAAK,KAAK,IAAI,IAAI,EAAE;AAC1B,UAAI,MAAM;AACV,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;AAC1C,cAAM,YAAY,OAAO,CAAC;AAC1B,YAAI,OAAO;AACX,mBAAW,MAAM,WAAW;AAC3B,cAAI,GAAG,MAAM,MAAM,MAAM,GAAG,IAAI;AAC/B,mBAAO;AACP;AAAA,UACD;AAAA,QACD;AACA,YAAI,MAAM;AACT,oBAAU,KAAK,EAAE,IAAI,GAAG,CAAC;AACzB,gBAAM;AACN;AAAA,QACD;AAAA,MACD;AACA,UAAI,MAAM,GAAG;AACZ,eAAO,KAAK,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;AACxB,cAAM,OAAO,SAAS;AAAA,MACvB;AACA,oBAAc,IAAI,GAAG,GAAG;AAAA,IACzB;AAQA,UAAM,QAAQ,OAAO;AACrB,UAAM,YAAY,eAAe,KAAK,IAAI,GAAG,QAAQ,CAAC;AACtD,UAAM,cAAc,YAAY,cAAc,IAAI;AAClD,UAAM,YAAY,YAAY,OAAO,IAAI;AACzC,UAAM,cAAc,KAAK,IAAI,GAAG,YAAY,cAAc,CAAC;AAC3D,eAAW,KAAK,YAAY;AAC3B,YAAM,MAAM,cAAc,IAAI,CAAC;AAC/B,UAAI;AACJ,UAAI,SAAS,GAAG;AACf,uBAAe,cAAc,KAAK,MAAM,cAAc,CAAC;AAAA,MACxD,OAAO;AACN,cAAM,QAAQ,cAAc,MAAM,QAAQ;AAC1C,uBAAe,cAAc,KAAK,MAAM,MAAM,IAAI;AAAA,MACnD;AACA,oBAAc,IAAI,GAAG,KAAK,IAAI,aAAa,KAAK,IAAI,MAAM,YAAY,CAAC,CAAC;AAAA,IACzE;AAAA,EACD;AAGA,QAAM,MAAoB,CAAC;AAC3B,aAAW,CAAC,EAAE,IAAI,KAAK,SAAS;AAC/B,UAAM,SAA4B,CAAC;AACnC,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,GAAG;AACxC,YAAM,IAAI,KAAK,CAAC;AAChB,YAAM,MAAM,MAAM,MAAM,IAAI,EAAE,MAAM;AACpC,YAAM,MAAM,MAAM,MAAM,IAAI,EAAE,IAAI;AAClC,YAAM,QAAQ,cAAc,IAAI,CAAC;AAEjC,YAAM,aAAa,IAAI,YAAY,QAAQ,GAAG,IAAI,QAAQ,GAAG,IAAI,YAAY,GAAG;AAChF,YAAM,aAAa,IAAI,YAAY,QAAQ,GAAG,IAAI,QAAQ,GAAG,IAAI;AACjE,YAAM,KAAK,YAAY,GAAG;AAC1B,YAAM,KAAK,YAAY,GAAG;AAC1B,UAAI,MAAM,EAAG,WAAU,QAAQ,MAAM,YAAY,EAAE;AACnD,UAAI,OAAO,IAAI;AACd,kBAAU,QAAQ,MAAM,OAAO,EAAE;AACjC,kBAAU,QAAQ,MAAM,OAAO,EAAE;AAAA,MAClC;AACA,gBAAU,QAAQ,MAAM,YAAY,EAAE;AAAA,IACvC;AACA,UAAM,QAAQ,KAAK,CAAC;AACpB,QAAI,KAAK;AAAA,MACR,MAAM,MAAM;AAAA,MACZ,IAAI,MAAM;AAAA,MACV,QAAQ,eAAe,MAAM;AAAA,IAC9B,CAAC;AAAA,EACF;AACA,SAAO;AACR;AAEA,SAAS,UAAU,KAAwB,MAAe,SAAiB,OAAqB;AAC/F,MAAI,KAAK,OAAO,EAAE,GAAG,SAAS,GAAG,MAAM,IAAI,EAAE,GAAG,OAAO,GAAG,QAAQ,CAAC;AACpE;AAEA,SAAS,eAAe,QAAuD;AAC9E,QAAM,MAAyB,CAAC;AAChC,aAAW,KAAK,QAAQ;AACvB,UAAM,OAAO,IAAI,IAAI,SAAS,CAAC;AAC/B,QAAI,CAAC,QAAQ,KAAK,MAAM,EAAE,KAAK,KAAK,MAAM,EAAE,EAAG,KAAI,KAAK,CAAC;AAAA,EAC1D;AACA,SAAO;AACR;AAMA,SAAS,YAAY,OAAyD;AAC7E,MAAI,IAAI;AACR,MAAI,IAAI;AACR,aAAW,SAAS,MAAM,QAAQ;AACjC,eAAW,KAAK,OAAO;AACtB,UAAI,KAAK,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC;AACzB,UAAI,KAAK,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC;AAAA,IAC1B;AAAA,EACD;AACA,SAAO,EAAE,OAAO,GAAG,QAAQ,EAAE;AAC9B;;;ACvpBA,IAAM,QAAQ;AACd,IAAM,QAAQ;AACd,IAAM,SAAS;AACf,IAAM,YAAY;AAClB,IAAM,WAAW;AAQjB,SAAS,QAAQ,IAAoB;AACpC,QAAM,QAAQ,GAAG,SAAS,IAAI,IAAK,GAAG,MAAM,IAAI,EAAE,IAAI,KAAK,KAAM;AACjE,SAAO,KAAK,IAAI,OAAO,KAAK,IAAI,OAAO,MAAM,SAAS,CAAC,CAAC;AACzD;AAEA,SAAS,SAAS,KAAqB;AACtC,SAAO;AACR;AAMO,SAAS,cACf,MACA,YAA6B,MACU;AACvC,QAAM,MAAM,OAAO,KAAK,KAAK,KAAK,EAAE,KAAK;AACzC,QAAM,QAAQ,KAAK,MAAM,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,IAAI,EAAE,GAAG,EAAE;AAChE,MAAI,IAAI,WAAW,GAAG;AACrB,WAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,EAC/B;AACA,QAAM,SAAS,eAAe;AAAA,IAC7B,OAAO;AAAA,IACP;AAAA,IACA,YAAY;AAAA,IACZ,aAAa;AAAA,IACb,UAAU;AAAA,IACV,SAAS;AAAA,IACT;AAAA,EACD,CAAC;AAID,QAAM,QAAQ,OAAO,MAAM,IAAI,CAAC,OAAO;AAAA,IACtC,IAAI,EAAE;AAAA,IACN,GAAG,EAAE;AAAA,IACL,GAAG,EAAE;AAAA,IACL,GAAG,EAAE;AAAA,IACL,GAAG,EAAE;AAAA,IACL,MAAM,KAAK,MAAM,EAAE,EAAE,GAAG;AAAA,EACzB,EAAE;AASF,QAAM,YAAY,oBAAI,IAAoB;AAC1C,QAAM,UAAU,OAAO,MAAM,IAAI,CAAC,MAAM;AACvC,UAAM,SAAS,KAAK,MAAM,EAAE,EAAE,GAAG,QAAQ,CAAC;AAC1C,UAAM,YAAY,GAAG,EAAE,EAAE,KAAK,EAAE,IAAI;AACpC,UAAM,YAAY,UAAU,IAAI,SAAS,KAAK;AAC9C,UAAM,WAAW,OAAO,QAAQ,EAAE,MAAM,SAAS;AACjD,cAAU,IAAI,WAAW,YAAY,IAAI,WAAW,IAAI,SAAS;AACjE,UAAM,SAAS,EAAE,OAAO,IAAI,CAAC,MAAuB,CAAC,EAAE,GAAG,EAAE,CAAC,CAAU;AACvE,WAAO;AAAA,MACN,MAAM,EAAE;AAAA,MACR,IAAI,EAAE;AAAA,MACN,UAAU,YAAY,IAAI,WAAW;AAAA,MACrC;AAAA,IACD;AAAA,EACD,CAAC;AAED,SAAO,EAAE,OAAO,OAAO,QAAQ;AAChC;;;AF5DA,IAAM,iBAAiB,oBAAI,IAAyB;AAAA,EACnD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACD,CAAC;AAED,SAAS,iBAAiB,GAAyB;AAClD,SAAO,eAAe,IAAI,EAAE,IAAI;AACjC;AAyBO,IAAM,oBAAN,cAAgC,mBAAM;AAAA,EACnC;AAAA,EACA;AAAA,EACA;AAAA,EAET,YAAY,MAA2B;AACtC,UAAM,OAAO,KAAK,QAAQ;AAC1B,UAAM,MAAM,KAAK,YAAY;AAC7B,SAAK,SAAS,KAAK;AACnB,SAAK,SAAS,KAAK,WAAW,CAAC,SAAS,cAAc,MAAM,IAAI;AAIhE,UAAM,YAAY,KAAK,OAAO,QAAQ;AAAA,MACrC,WAAW;AAAA,MACX,eAAe;AAAA,IAChB,CAAC;AACD,SAAK,IAAI,WAAW,EAAE,MAAM,YAAY,CAAC;AAWzC,UAAM,aAAa,KAAK,eAAe;AACvC,UAAM,aAAa,KAAK;AAAA,MACvB;AAAA,MACA,CAAC,WAAW;AAAA,MACZ,CAAC,MAAM,SAAS;AACf,cAAM,SAAS,KAAK,CAAC;AACrB,YAAI,UAAU,QAAQ,OAAO,WAAW,GAAG;AAI1C,iBAAO,CAAC;AAAA,QACT;AACA,YAAI,cAAc;AAClB,mBAAW,KAAK,QAAkC;AACjD,cAAI,iBAAiB,CAAC,GAAG;AACxB,0BAAc;AACd;AAAA,UACD;AAAA,QACD;AACA,YAAI,CAAC,aAAa;AAGjB,iBAAO,CAAC;AAAA,QACT;AACA,eAAO,CAAC,KAAK,eAAe,CAAC;AAAA,MAC9B;AAAA,MACA,EAAE,SAAS,YAAY,SAAS,KAAK;AAAA,IACtC;AACA,SAAK;AAaL,SAAK,QAAQ,KAAK;AAAA,MACjB;AAAA,MACA,CAAC,UAAU,WAAW;AAAA,MACtB,CAAC,MAAM,QAAQ;AACd,cAAM,cAAc,KAAK,CAAC;AAC1B,cAAM,iBAAiB,KAAK,CAAC;AAC7B,cAAM,SACL,eAAe,QAAQ,YAAY,SAAS,IACxC,YAAY,GAAG,EAAE,IACjB,IAAI,SAAS,CAAC;AACnB,YAAI,UAAU,MAAM;AAInB,iBAAO,CAAC;AAAA,QACT;AACA,cAAM,UAAyB,CAAC;AAChC,YAAI,kBAAkB,MAAM;AAC3B,qBAAW,KAAK,eAAgB,SAAQ,KAAK,CAAgB;AAAA,QAC9D;AACA,eAAO;AAAA,UACN;AAAA,YACC,OAAO,OAAO;AAAA,YACd,OAAO,OAAO;AAAA,YACd;AAAA,UACD;AAAA,QACD;AAAA,MACD;AAAA,MACA;AAAA,QACC,SAAS,EAAE,OAAO,WAAW,OAAO,OAAO,WAAW,OAAO,SAAS,CAAC,EAAE;AAAA,QACzE,SAAS;AAAA,MACV;AAAA,IACD;AAAA,EAMD;AAAA,EAEQ,iBAAuD;AAO9D,QAAI,KAAK,OAAO,WAAW;AAC1B,aAAO,EAAE,OAAO,CAAC,GAAG,OAAO,CAAC,EAAE;AAAA,IAC/B;AACA,UAAM,OAAO,KAAK,OAAO,SAAS;AAClC,WAAO,KAAK,OAAO,IAAI;AAAA,EACxB;AACD;AAKO,SAAS,aAAa,MAA8C;AAC1E,QAAM,OAAO,IAAI,kBAAkB,IAAI;AACvC,OAAK,WAAW,cAAc;AAC9B,SAAO;AACR;","names":[]}

package/dist/utils/topology-view/index.d.cts

@@ -0,0 +1,68 @@
+import { Node } from '@graphrefly/pure-ts/core';
+import { Graph, GraphOptions } from '@graphrefly/pure-ts/graph';
+import { b as LayoutFn, c as LayoutFrame } from '../../layout-types-B5aiHYgk.cjs';
+export { L as LayoutBox, a as LayoutEdge } from '../../layout-types-B5aiHYgk.cjs';
+
+/**
+ * `topologyView({ graph, layout? }): TopologyViewGraph` — D3 of the
+ * three-layer view (`docs/optimizations.md` line "D — Three-layer view").
+ *
+ * Composes a target {@link Graph} with a pluggable layered-DAG layout into a
+ * live {@link LayoutFrame} stream:
+ *
+ * ```text
+ * target graph
+ *   └─ observe({ changeset: true })  →  Node<GraphChange>
+ *        └─ filter(topology)         →  recompute layout
+ *        └─ each change              →  merge into a LayoutFrame
+ * ```
+ *
+ * **Initial frame** is delivered on subscribe (push-on-subscribe per spec
+ * §2.2) — the layout is seeded from `graph.describe()` at construction. A
+ * consumer that wants deltas only can `pipe(skip(1))` from the output node.
+ *
+ * **Pluggable layout** — pass `opts.layout` to swap in `dagre`, `elk`, or
+ * any layered-DAG library. The default is a minimal Sugiyama in
+ * `_internal.ts` (matches the library's "no deps, browser-safe" ethos).
+ *
+ * **No timers** — animation is driven by the changeset's batch boundaries.
+ * Each batch IS a frame; CSS transitions handle visual fade.
+ *
+ * @module
+ */
+
+/** Options for {@link topologyView}. */
+interface TopologyViewOptions {
+    /** The target graph to observe. */
+    readonly graph: Graph;
+    /**
+     * Pluggable layout function. Defaults to the bundled Sugiyama layout.
+     * Adapt `dagre` / `elk` / etc. by wrapping their output in the
+     * {@link LayoutFn} shape.
+     */
+    readonly layout?: LayoutFn;
+    /** Optional name for the {@link TopologyViewGraph}. Defaults to `"topology-view"`. */
+    readonly name?: string;
+    /**
+     * Forward extra options to the underlying {@link Graph} constructor
+     * (e.g. `versioning`, `traceCapacity`).
+     */
+    readonly graphOptions?: GraphOptions;
+}
+/**
+ * Live topology view — a {@link Graph} subclass that exposes a single
+ * output node {@link TopologyViewGraph.frame} emitting {@link LayoutFrame}s.
+ */
+declare class TopologyViewGraph extends Graph {
+    readonly target: Graph;
+    readonly layout: LayoutFn;
+    readonly frame: Node<LayoutFrame>;
+    constructor(opts: TopologyViewOptions);
+    private _computeLayout;
+}
+/**
+ * Factory wrapper — `topologyView({ graph, layout? })`.
+ */
+declare function topologyView(opts: TopologyViewOptions): TopologyViewGraph;
+
+export { LayoutFn, LayoutFrame, TopologyViewGraph, type TopologyViewOptions, topologyView };

package/dist/utils/topology-view/index.d.ts

@@ -0,0 +1,68 @@
+import { Node } from '@graphrefly/pure-ts/core';
+import { Graph, GraphOptions } from '@graphrefly/pure-ts/graph';
+import { b as LayoutFn, c as LayoutFrame } from '../../layout-types-B5aiHYgk.js';
+export { L as LayoutBox, a as LayoutEdge } from '../../layout-types-B5aiHYgk.js';
+
+/**
+ * `topologyView({ graph, layout? }): TopologyViewGraph` — D3 of the
+ * three-layer view (`docs/optimizations.md` line "D — Three-layer view").
+ *
+ * Composes a target {@link Graph} with a pluggable layered-DAG layout into a
+ * live {@link LayoutFrame} stream:
+ *
+ * ```text
+ * target graph
+ *   └─ observe({ changeset: true })  →  Node<GraphChange>
+ *        └─ filter(topology)         →  recompute layout
+ *        └─ each change              →  merge into a LayoutFrame
+ * ```
+ *
+ * **Initial frame** is delivered on subscribe (push-on-subscribe per spec
+ * §2.2) — the layout is seeded from `graph.describe()` at construction. A
+ * consumer that wants deltas only can `pipe(skip(1))` from the output node.
+ *
+ * **Pluggable layout** — pass `opts.layout` to swap in `dagre`, `elk`, or
+ * any layered-DAG library. The default is a minimal Sugiyama in
+ * `_internal.ts` (matches the library's "no deps, browser-safe" ethos).
+ *
+ * **No timers** — animation is driven by the changeset's batch boundaries.
+ * Each batch IS a frame; CSS transitions handle visual fade.
+ *
+ * @module
+ */
+
+/** Options for {@link topologyView}. */
+interface TopologyViewOptions {
+    /** The target graph to observe. */
+    readonly graph: Graph;
+    /**
+     * Pluggable layout function. Defaults to the bundled Sugiyama layout.
+     * Adapt `dagre` / `elk` / etc. by wrapping their output in the
+     * {@link LayoutFn} shape.
+     */
+    readonly layout?: LayoutFn;
+    /** Optional name for the {@link TopologyViewGraph}. Defaults to `"topology-view"`. */
+    readonly name?: string;
+    /**
+     * Forward extra options to the underlying {@link Graph} constructor
+     * (e.g. `versioning`, `traceCapacity`).
+     */
+    readonly graphOptions?: GraphOptions;
+}
+/**
+ * Live topology view — a {@link Graph} subclass that exposes a single
+ * output node {@link TopologyViewGraph.frame} emitting {@link LayoutFrame}s.
+ */
+declare class TopologyViewGraph extends Graph {
+    readonly target: Graph;
+    readonly layout: LayoutFn;
+    readonly frame: Node<LayoutFrame>;
+    constructor(opts: TopologyViewOptions);
+    private _computeLayout;
+}
+/**
+ * Factory wrapper — `topologyView({ graph, layout? })`.
+ */
+declare function topologyView(opts: TopologyViewOptions): TopologyViewGraph;
+
+export { LayoutFn, LayoutFrame, TopologyViewGraph, type TopologyViewOptions, topologyView };

package/dist/utils/topology-view/index.js

@@ -0,0 +1,11 @@
+import {
+  TopologyViewGraph,
+  topologyView
+} from "../../chunk-APY2SS5X.js";
+import "../../chunk-DMSNO6ZB.js";
+import "../../chunk-AZDQPQ3V.js";
+export {
+  TopologyViewGraph,
+  topologyView
+};
+//# sourceMappingURL=index.js.map

package/dist/utils/topology-view/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}