@issuegraph/viewer 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,156 @@
+# @issuegraph/viewer
+
+Render an [Issuegraph](https://github.com/autnmy/issuegraph) document as a **work order** — the ordered spine with readiness stations, the five edge treatments, and three projections over one normalised document.
+
+The innermost UI layer, and the whole of its contract:
+
+```
+in     { issues, edges, order } + a projection choice
+out    onSelect, onHover
+never  fetching, mutation, auth, persistence, or a host's vocabulary
+```
+
+```sh
+npm install @issuegraph/viewer
+```
+
+Framework-free and bundler-free. One runtime dependency ([`@issuegraph/core`](../core), for the format's field names), no CSS import, and an entry that loads on a bare Node runtime.
+
+## Two entry points
+
+```ts
+import { renderViewer, mountViewer } from '@issuegraph/viewer';
+
+// Pure: markup and styles, for server rendering and for tests.
+const { markup, styles, scene, diagnostics } = renderViewer(document, { projection: 'graph' });
+
+// The DOM shell: the same tree as nodes, plus the two callbacks.
+const handle = mountViewer(container, document, {
+  projection: 'linear',
+  onSelect: (key) => console.log('selected', key),
+  onHover: (key) => console.log('hovered', key),
+});
+
+handle.setProjection('tree');   // the subject survives; only the representation changes
+handle.destroy();               // removes every listener it added
+```
+
+`mountViewer` reaches no global — it builds into `container.ownerDocument` — which is why the package loads where there is no DOM.
+
+## The document
+
+Plain and JSON-safe, so it crosses a wire. It is structurally a projection of what [`@issuegraph/derive`](../derive) returns, which a host maps across in a few lines:
+
+```ts
+const document = {
+  issues: [{ key: '102', title: 'Backfill the ledger', url: '…', open: true, priority: 3 }],
+  edges: [{ field: 'blocked-by', from: '101', to: '102' }],
+  order: {
+    slots: [{ rank: 1, lead: '102', members: ['102'], ready: true, holds: [] }],
+    excluded: [{ key: '106', canonical: '105', reason: 'duplicate-of' }],
+  },
+};
+```
+
+**The order is an input, never something this computes.** `@issuegraph/derive` owns the derivation; a second implementation here would be a mirror whose input space drifts. Everything the viewer draws was given to it — including titles and deep links, because knowing a tracker's URL shape is exactly the knowledge this layer must not carry.
+
+`normalizeDocument` never throws. A hand-built document is untrusted input, so a dangling edge is dropped with a diagnostic rather than taking the render down.
+
+**A deep link is checked, not just escaped.** `url` is the one field that becomes an executable surface in the DOM, so only `http:`, `https:`, `mailto:` and relative values are linked — a `javascript:` or `data:` value is dropped with a diagnostic. Escaping the attribute would not have stopped it.
+
+## The three projections
+
+| projection | question it answers |
+|---|---|
+| `linear` | what gets worked next — the order as rows. Complete at any size. |
+| `graph` | what surrounds this issue — the spine with gutters and arcs. Bounded; see below. |
+| `tree` | where this work came from — the `decomposed-from` hierarchy. |
+
+**Held slots keep their position.** A hold the graph itself imposes renders *inline at the rank the work would have taken*, with `—` for the rank and a dashed station, because "why isn't my P1 running" has to be answerable in place. A hold the runner or tracker imposes is not a fact about the work, earns no rank slot, and collapses into a footer group with duplicates.
+
+**The rail sits on the canvas, not above it.** Ranks and readiness stations are HTML — SVG text is not selectable, not reflowable and announces poorly — but they are the labels *for* the spine nodes, so each row is positioned at the coordinates the layout computed for its own node. One stage carries both at the layout's own size, so one SVG unit is one CSS pixel and the two cannot drift; it scrolls rather than shrinking, because shrinking would silently break that alignment.
+
+**The graph refuses rather than degrades.** Past 60 nodes it stops drawing and shows connected components as capsules — size, blocking count, cycle flag, chain depth — and past 300 it shows clusters only. Each refusal names the next move. A refusal with a route forward reads as competence; a hairball reads as a bug.
+
+## The edge grammar
+
+Every relationship is separable on **four** channels — dash, terminal marker, glyph, and hue — so removing colour entirely leaves all five distinguishable. That is asserted as a property of the table, not claimed about the rendering.
+
+| field | dash | terminal | glyph | ordering effect |
+|---|---|---|---|---|
+| `blocked-by` | solid | filled arrow | `⊘` | strict, directed |
+| `serialize-with` | double | none | `⇄` | exclusive, unordered |
+| `together-with` | enclosure | enclosure | `⧉` | shares one rank |
+| `duplicate-of` | dotted | hollow circle | `≡` | never worked |
+| `decomposed-from` | dashed | tee bar | `⑃` | none — provenance only |
+
+The `together-with` **connector** lives in this layer, declared deliberately: a click target cannot be added from outside without the viewer knowing where members are.
+
+**Two identities, not one.** Every focusable element carries `data-ig-key`, and exactly one element per key does — otherwise focus lands on whichever the renderer emitted first. The enclosure and its connector are decoration painted *behind* the nodes, so they carry `data-ig-group` instead and stay out of the focus index while remaining clickable: `mountViewer` reads both, so a pointer on either still names its slot.
+
+## Theming
+
+**Every colour, type and spacing value is a CSS custom property.** The shipped palette is the *default theme*, not the styling — a host retheming it forks nothing.
+
+```ts
+import { defaultTheme, extendTheme, renderViewer, viewerStylesheet } from '@issuegraph/viewer';
+
+const paper = extendTheme(defaultTheme, {
+  colors: {
+    '--ig-bg': '#FBFAF7',
+    '--ig-surface': '#FFFFFF',
+    '--ig-surface-2': '#F2F0EA',
+    '--ig-line': '#D9D4C7',
+    '--ig-text': '#1B1A17',
+    '--ig-text-body': '#3B3A35',
+    '--ig-text-muted': '#5E5B52',
+    '--ig-accent': '#0A5B8A',
+    '--ig-focus': '#0A5B8A',
+    '--ig-station-ready': '#0A5B8A',
+    '--ig-station-pending': '#5E5B52',
+    '--ig-station-held': '#8A857A',
+    '--ig-edge-blocked-by': '#A32020',
+    '--ig-edge-serialize-with': '#7A5A00',
+    '--ig-edge-together-with': '#0A5B8A',
+    '--ig-edge-duplicate-of': '#6B2E9E',
+    '--ig-edge-decomposed-from': '#A31257',
+  },
+});
+
+const { markup, styles } = renderViewer(document, { theme: paper });
+```
+
+That exact theme is the one `acceptance.test.ts` uses, so the example cannot drift from what is tested.
+
+**Geometry is theme data too.** `metrics` are numbers, in CSS pixels, and they are what the layout maths reads — so retheming the row height moves the drawing and the stylesheet together rather than only one of them.
+
+**The proof that theming is real**: rendering the same document under two themes produces **byte-identical markup** and different styles. If any colour reached the markup, that equality would fail.
+
+**CSS ships as a string, not a `.css` file.** An entry that imports CSS cannot be loaded by a bare Node runtime, and a string means no consumer needs a bundler. Install `viewerStylesheet` once and `themeCss(theme)` per theme.
+
+## Accessibility
+
+- **WCAG AA, measured.** Every text token clears 4.5:1 against all three surfaces and every edge hue clears the 3:1 non-text bar — asserted against the palette, for the default theme *and* the documented second one.
+- **Colour-blind safe**, by the four-channel rule above.
+- **Keyboard navigable.** `↑` `↓` walk the order, `←` `→` traverse to gutter neighbours, `Enter` or `Space` selects, `Home` and `End` jump to the ends. Movement never wraps: the ends of the order are the ends of the work.
+- **Rank order, never geometric.** The graph places boxes where the geometry puts them and publishes its traversal in *rank* order; recovering an order from coordinates is what the design forbids, and `navigate` cannot see a coordinate.
+- **No graph-theory literacy assumed.** The tree is a nested list announced as one; every relationship carries a written label alongside its glyph.
+- **A nested control keeps its own keyboard.** `keydown` bubbles, so Enter or Space on a row's deep-link chip follows the link rather than selecting the row — a link a keyboard cannot follow is not exposed. Movement keys stay the viewer's, so a reader can still arrow away from a link.
+- **The canvas is a group, not a picture.** `role="img"` would flatten every descendant into one image node and hide the roles and labels that make gutter and held nodes reachable at all.
+- **Plain list semantics, deliberately.** Rows carry a deep-link chip, and `role="option"` / `role="treeitem"` forbid a focusable descendant — so selection is announced with `aria-current` and hierarchy with nesting, which leaves the link legal instead of making it a violation.
+
+Navigation is a pure reducer (`navigate`), so the whole key map is testable without a DOM — and the shell has nothing left to get wrong except wiring.
+
+## What this package will not do
+
+Fetch, mutate, authenticate, persist, or derive the order. It is layer 1 of a three-layer seam: the **editor** owns everything that mutates and composes this through its public surface, and a host's **chrome** — shell, nav, brand, freshness, links out — stays the host's.
+
+The seam test is the acceptance test: strip the editor and the chrome, and the viewer still renders a correct, legible order.
+
+## Versioning
+
+`0.x`, and unstable. This tracks a draft specification, so breaking changes before `1.0` are expected and a minor bump may break you — pin exactly if that matters.
+
+---
+
+Stewarded by [Autonomy LLC](https://github.com/autnmy). Apache-2.0.

package/dist/clusters.d.ts

@@ -0,0 +1,34 @@
+/**
+ * Connected components, for the graph's refusal mode.
+ *
+ * Above the node budget the canvas declines to draw a hairball and shows the
+ * shape instead: how many components there are, how big each is, how many
+ * `blocked-by` edges it carries, whether it contains a cycle, and how deep its
+ * longest blocking chain runs. A refusal with a route forward reads as
+ * competence; a hairball reads as a bug.
+ *
+ * Components are undirected — every relationship connects, whatever its
+ * direction — while the depth and cycle questions are asked of `blocked-by`
+ * alone, because that is the only field that orders anything.
+ */
+import type { NormalizedDocument } from './document.ts';
+export interface Cluster {
+    /** Members in the document's own key order, so the output is deterministic. */
+    readonly members: readonly string[];
+    readonly blockedByEdges: number;
+    readonly hasCycle: boolean;
+    /** The longest `blocked-by` chain, in edges. `0` when nothing blocks. */
+    readonly chainDepth: number;
+}
+/** Every component the document declares, largest first, then by first member. */
+export declare function clustersOf(document: NormalizedDocument, 
+/**
+ * The keys the canvas would actually draw — `layout.nodes`' key set.
+ *
+ * Passing it makes the returned components a PARTITION of exactly the nodes
+ * the refusal counted, which is the property the refusal's own text depends
+ * on. Omitting it keeps the older edge-derived reading for callers that are
+ * describing a document rather than explaining a refusal.
+ */
+drawn?: ReadonlySet<string>): readonly Cluster[];
+//# sourceMappingURL=clusters.d.ts.map

package/dist/clusters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"clusters.d.ts","sourceRoot":"","sources":["../src/clusters.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAC;AAExD,MAAM,WAAW,OAAO;IACtB,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,yEAAyE;IACzE,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAkID,kFAAkF;AAClF,wBAAgB,UAAU,CACxB,QAAQ,EAAE,kBAAkB;AAC5B;;;;;;;GAOG;AACH,KAAK,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAC1B,SAAS,OAAO,EAAE,CAyCpB"}

package/dist/clusters.js

@@ -0,0 +1,195 @@
+/**
+ * Connected components, for the graph's refusal mode.
+ *
+ * Above the node budget the canvas declines to draw a hairball and shows the
+ * shape instead: how many components there are, how big each is, how many
+ * `blocked-by` edges it carries, whether it contains a cycle, and how deep its
+ * longest blocking chain runs. A refusal with a route forward reads as
+ * competence; a hairball reads as a bug.
+ *
+ * Components are undirected — every relationship connects, whatever its
+ * direction — while the depth and cycle questions are asked of `blocked-by`
+ * alone, because that is the only field that orders anything.
+ */
+function connectedComponents(document, drawn) {
+    const adjacency = new Map();
+    const touch = (key) => {
+        const existing = adjacency.get(key);
+        if (existing !== undefined)
+            return existing;
+        const created = [];
+        adjacency.set(key, created);
+        return created;
+    };
+    for (const edge of document.edges) {
+        touch(edge.from).push(edge.to);
+        touch(edge.to).push(edge.from);
+    }
+    const seen = new Set();
+    const components = [];
+    // Walk in the document's issue order so the component list is stable.
+    for (const issue of document.issues) {
+        if (seen.has(issue.key))
+            continue;
+        // AN EDGE-FREE NODE IS A COMPONENT OF ONE, and dropping it broke the only
+        // promise the refusal makes. The refusal fires on how many nodes the canvas
+        // would DRAW, but the component list was built from nodes that have an
+        // EDGE — so an over-budget document with no relationships in it refused to
+        // draw and then listed nothing, under a sentence pointing at the list.
+        // A partition of the drawn set cannot disagree with the count that
+        // triggered it, whatever the document contains.
+        if (!adjacency.has(issue.key)) {
+            if (drawn !== undefined && drawn.has(issue.key))
+                components.push([issue.key]);
+            continue;
+        }
+        // AN EDGE ENDPOINT THE CANVAS DOES NOT DRAW IS STILL NOT DRAWN. `drawn`
+        // bounds both arms or it bounds neither, and bounding only the singletons
+        // would trade an under-count for an over-count.
+        if (drawn !== undefined && !drawn.has(issue.key))
+            continue;
+        const members = [];
+        const stack = [issue.key];
+        seen.add(issue.key);
+        while (stack.length > 0) {
+            const key = stack.pop();
+            members.push(key);
+            for (const next of adjacency.get(key) ?? []) {
+                if (seen.has(next))
+                    continue;
+                seen.add(next);
+                stack.push(next);
+            }
+        }
+        members.sort();
+        components.push(members);
+    }
+    return components;
+}
+/**
+ * The longest `blocked-by` chain inside one component, and whether that
+ * component contains a cycle.
+ *
+ * A cycle makes "longest chain" undefined, so the walk reports the depth it
+ * reached over the acyclic part and says a cycle exists rather than looping or
+ * inventing a number. Both facts are useful to a reader; a hang is not.
+ */
+function depthAndCycle(members, blockedBy) {
+    const memo = new Map();
+    const onPath = new Set();
+    let hasCycle = false;
+    // The edges the discovery pass refused to follow, keyed `from\u0000to` so a
+    // cycle through one member does not suppress that member's other edges.
+    const backEdges = new Set();
+    // ITERATIVE, NOT RECURSIVE. This runs on the graph's REFUSAL path, which is
+    // reached precisely because the component is large — so a per-node call frame
+    // is a stack overflow waiting for the input the code exists to handle. A long
+    // `blocked-by` chain is the ordinary shape of a big backlog, not a pathology.
+    for (const start of members) {
+        if (memo.has(start))
+            continue;
+        const stack = [{ key: start, expanded: false }];
+        while (stack.length > 0) {
+            const frame = stack[stack.length - 1];
+            if (memo.has(frame.key)) {
+                stack.pop();
+                continue;
+            }
+            if (!frame.expanded) {
+                frame.expanded = true;
+                onPath.add(frame.key);
+                for (const next of blockedBy.get(frame.key) ?? []) {
+                    if (onPath.has(next)) {
+                        hasCycle = true;
+                        // REMEMBER WHICH EDGE CLOSED THE CYCLE, not just that one did. The
+                        // collecting pass below walks the same adjacency and has no other
+                        // way to tell a back-edge from an ordinary one, so it counted this
+                        // edge against a memo that was never written — `?? 0` — and every
+                        // cycle came out one edge too long. Measured: a two-node cycle
+                        // published `chainDepth: 2` beside its cycle badge when the longest
+                        // acyclic chain through it is one edge, and a three-node cycle
+                        // published 3 for a chain of two.
+                        backEdges.add(`${frame.key}\u0000${next}`);
+                        continue;
+                    }
+                    if (!memo.has(next))
+                        stack.push({ key: next, expanded: false });
+                }
+                continue;
+            }
+            let best = 0;
+            for (const next of blockedBy.get(frame.key) ?? []) {
+                // SKIPPED, WHICH ALSO MAKES THE FALLBACK BELOW UNREACHABLE. Every other
+                // child was either pushed and memoized or was memoized already, so
+                // `?? 0` now covers nothing — it stays only because a missing memo must
+                // never silently become a depth of zero if this walk ever changes.
+                if (backEdges.has(`${frame.key}\u0000${next}`))
+                    continue;
+                best = Math.max(best, 1 + (memo.get(next) ?? 0));
+            }
+            memo.set(frame.key, best);
+            onPath.delete(frame.key);
+            stack.pop();
+        }
+    }
+    let depth = 0;
+    for (const member of members)
+        depth = Math.max(depth, memo.get(member) ?? 0);
+    return { depth, hasCycle };
+}
+/** Every component the document declares, largest first, then by first member. */
+export function clustersOf(document, 
+/**
+ * The keys the canvas would actually draw — `layout.nodes`' key set.
+ *
+ * Passing it makes the returned components a PARTITION of exactly the nodes
+ * the refusal counted, which is the property the refusal's own text depends
+ * on. Omitting it keeps the older edge-derived reading for callers that are
+ * describing a document rather than explaining a refusal.
+ */
+drawn) {
+    const blockedBy = new Map();
+    for (const edge of document.edges) {
+        if (edge.field !== 'blocked-by')
+            continue;
+        const existing = blockedBy.get(edge.from);
+        if (existing === undefined)
+            blockedBy.set(edge.from, [edge.to]);
+        else
+            existing.push(edge.to);
+    }
+    const clusters = connectedComponents(document, drawn).map((members) => {
+        // SUMMED OFF THE ADJACENCY ABOVE, NOT RE-FILTERED PER COMPONENT. This used to
+        // scan the WHOLE edge array once per component, which is quadratic in exactly
+        // the shape that reaches it: refusal mode exists for documents too big to
+        // draw, and a fragmented one is the worst case — 10,000 disconnected pairs
+        // means 10,000 components each scanning 10,000 edges, ~100 million checks to
+        // produce a SUMMARY. The refusal would then freeze the browser it was added
+        // to protect.
+        // The value is identical, not an approximation: `blockedBy` maps each origin
+        // to its `blocked-by` targets, members are distinct, and the filter counted
+        // exactly the edges whose origin is a member — so summing each member's list
+        // length counts the same edges once each. Linear in members, so the whole
+        // pass is linear in nodes plus edges.
+        let blockedByEdges = 0;
+        for (const member of members)
+            blockedByEdges += blockedBy.get(member)?.length ?? 0;
+        const { depth, hasCycle } = depthAndCycle(members, blockedBy);
+        return { members, blockedByEdges, hasCycle, chainDepth: depth };
+    });
+    // CODE UNITS, NOT `localeCompare`. This package promises deterministic
+    // rendering, and `localeCompare` without an explicit locale uses the RUNTIME's
+    // default — so a server and a reader's browser can order two equal-sized
+    // components differently and produce markup that does not match, which is a
+    // hydration mismatch rather than a cosmetic one. The comparison is the same
+    // one `document.ts` already uses to canonicalize a symmetric edge's endpoint
+    // pair, so the package has one ordering rule rather than two.
+    return clusters.sort((a, b) => {
+        if (a.members.length !== b.members.length)
+            return b.members.length - a.members.length;
+        const left = a.members[0] ?? '';
+        const right = b.members[0] ?? '';
+        return left < right ? -1 : left > right ? 1 : 0;
+    });
+}
+//# sourceMappingURL=clusters.js.map

package/dist/clusters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"clusters.js","sourceRoot":"","sources":["../src/clusters.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAaH,SAAS,mBAAmB,CAC1B,QAA4B,EAC5B,KAAsC;IAEtC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,MAAM,KAAK,GAAG,CAAC,GAAW,EAAY,EAAE;QACtC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC5C,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAC5B,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,sEAAsE;IACtE,KAAK,MAAM,KAAK,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,SAAS;QAClC,0EAA0E;QAC1E,4EAA4E;QAC5E,uEAAuE;QACvE,2EAA2E;QAC3E,uEAAuE;QACvE,mEAAmE;QACnE,gDAAgD;QAChD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;gBAAE,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,SAAS;QACX,CAAC;QACD,wEAAwE;QACxE,0EAA0E;QAC1E,gDAAgD;QAChD,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,SAAS;QAC3D,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;YAClC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC5C,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,SAAS;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,IAAI,EAAE,CAAC;QACf,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,aAAa,CACpB,OAA0B,EAC1B,SAAiD;IAEjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,4EAA4E;IAC5E,wEAAwE;IACxE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,4EAA4E;IAC5E,8EAA8E;IAC9E,8EAA8E;IAC9E,8EAA8E;IAC9E,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAC9B,MAAM,KAAK,GAAyC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACtF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAuC,CAAC;YAC5E,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,GAAG,EAAE,CAAC;gBACZ,SAAS;YACX,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;gBACpB,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACtB,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;oBAClD,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBACrB,QAAQ,GAAG,IAAI,CAAC;wBAChB,mEAAmE;wBACnE,kEAAkE;wBAClE,mEAAmE;wBACnE,kEAAkE;wBAClE,+DAA+D;wBAC/D,oEAAoE;wBACpE,+DAA+D;wBAC/D,kCAAkC;wBAClC,SAAS,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,SAAS,IAAI,EAAE,CAAC,CAAC;wBAC3C,SAAS;oBACX,CAAC;oBACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;gBAClE,CAAC;gBACD,SAAS;YACX,CAAC;YACD,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,wEAAwE;gBACxE,mEAAmE;gBACnE,wEAAwE;gBACxE,mEAAmE;gBACnE,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,SAAS,IAAI,EAAE,CAAC;oBAAE,SAAS;gBACzD,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1B,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACzB,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,MAAM,IAAI,OAAO;QAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7E,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC7B,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,UAAU,CACxB,QAA4B;AAC5B;;;;;;;GAOG;AACH,KAA2B;IAE3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY;YAAE,SAAS;QAC1C,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,QAAQ,KAAK,SAAS;YAAE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;;YAC3D,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,QAAQ,GAAG,mBAAmB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE;QACpE,8EAA8E;QAC9E,8EAA8E;QAC9E,0EAA0E;QAC1E,2EAA2E;QAC3E,6EAA6E;QAC7E,4EAA4E;QAC5E,cAAc;QACd,6EAA6E;QAC7E,4EAA4E;QAC5E,6EAA6E;QAC7E,0EAA0E;QAC1E,sCAAsC;QACtC,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,cAAc,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;QACnF,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,aAAa,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC9D,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,uEAAuE;IACvE,+EAA+E;IAC/E,yEAAyE;IACzE,4EAA4E;IAC5E,4EAA4E;IAC5E,6EAA6E;IAC7E,8DAA8D;IAC9D,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC5B,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;QACtF,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjC,OAAO,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC"}