3 Commits

Include renames

Author	SHA1	Message	Date
Colby McHenryandClaude Opus 5	56dfdb0655	feat(ui): dead code and islands — what nothing reaches, and everything that could still reach it (CG-59) ... A Dead code screen and a mark on the Map, both drawn from one derivation in src/graph/dead-code.ts so a second surface can never disagree with the first. The SQL half is four lines — no incoming edge but `contains`. It returns ~2 500 candidates on this repository and the shipped list is 20; everything in between is the feature. A candidate is dropped the moment there is any reason to believe something outside the graph reaches it: exported symbols and header declarations, test and generated files, abstract and interface members, anything carrying a `decorates` edge, overrides of an ancestor's member, names the language calls by itself, vendored directories, files nothing in the index reaches (those are islands, and the Map says so instead), names the resolver failed to resolve somewhere, and names shared with a symbol that IS referenced — the mis-resolution that leaves a used method with a self-edge and its twin with nothing. The last rule is the only one that is not a graph query: before a claim is made, the declaring file and every file that reaches it are read and the identifier counted, which is what catches the references the extractor never recorded (`this.handleMessage.bind(this)`, a call inside an object literal, a shorthand property). Every subtraction is counted and printed under the list with the scale it came from, and the caveat line above it never collapses: the claim is "no static reference in the index", not "unused". On the Map a module nothing depends on keeps its stroke and says so in its count line, and tool-generated files and modules recede to ink-4 there, in the map's file list, in search results and on the file screen. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>	2026-08-27 07:57:00 -05:00
Colby McHenryandClaude Opus 5	5cecaabfc2	feat(ui): the Symbol view — callers, gutter-ported source, line-anchored callee rail (CG-44) ... The core screen of `codegraph ui`: who calls a symbol on the left, its verbatim body in the middle with a port on every line that has an outgoing edge, and what it calls on the right — each callee row placed beside the line that makes the call, with a hairline connector between them. The callee rail is the part that is not a list. A row wants to sit at the centre of its first call-site line and is pushed down only when that would collide with the row above, so the rail keeps source order; the connector still runs to the real line, so the displacement is visible rather than silent. Positions come from measuring the laid-out DOM, so they are recomputed on resize, on font load and whenever a fold opens. Honesty is carried in the drawing, not in a footnote: a filled port means the resolver matched something on that line and a hollow one means it only guessed; uncertain connectors are dashed and their targets fold away behind their count; synthesized edges are dashed differently and tagged with the mechanism that made them; references that leave the index are text with a soft underline rather than links to nowhere, and they are counted. Long bodies keep their head plus a window round every call site — windowed on graph edges only, since a function calling `console.log` two hundred times would otherwise window round every line and buy nothing. Containers over 80 lines show a members outline with per-member fan-in/fan-out instead of 700 lines of braces. Two small additions to the read-only API this needed: * `/api/node` gives every outline member its own fanIn/fanOut (two batched queries for the whole outline). A class's own fan-out is nearly always zero because its methods do the calling, so without these the outline cannot say which member carries weight. * `/api/stats` gains `blastScale` — the denominator the blast bar is drawn against, so one symbol's radius reads as wide or narrow *for this repo*. It is measured across the index's 24 most-depended-on symbols (found with a new `getTopDependedOn`, distinct dependents rather than edges), memoised against the index stamp, and reported as sampled; a symbol wider than the sample becomes the scale instead of overflowing the track. Verified against a real index in a real browser: parity with the prototype on `CodeGraph.sync` (259 lines, 27 callee rows, no overlaps), `GraphTraverser` (20-member outline), a 773-line function (26 windows, 78 connectors), light and dark, hover linking in both directions, keyboard-only navigation, and reflow on resize and on fold toggles. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>	2026-08-27 00:09:47 -05:00
Colby McHenryandClaude Opus 5	951ba3678a	feat(ui): read-only JSON API over the index for the viewer (CG-42) ... Six endpoints under `/api/`, one per screen, each answering in a single round-trip in the spirit of `codegraph_explore` — the viewer should never have to ask a follow-up question to finish drawing a pane: /api/stats index state, graph counts, frameworks /api/search?q= ranked, kind-grouped symbol search /api/node/<id> rails, members, tests, blast radius /api/source?file=&from=&to= verbatim source + a drift verdict /api/file/<path> outline and import rails /api/routes URL -> handler, when there is one It is a reader of the existing schema: no extraction or resolution changes. It mounts on the `api` seam `startUiServer` already exposed, so it sits behind the CG-41 loopback boundary — Host allowlist, no CORS headers, GET/HEAD only — and every read out of the repository goes through `resolveProjectFile`, ahead of the index lookup so a traversal is refused as a traversal rather than reported as "not indexed". Three properties the endpoints are built around: - No N+1. The engine's busiest symbol has 545 incoming edges; resolving those one `getNode` at a time is 545 queries. Every edge list is resolved with one batched lookup, which needed four additive read-only query methods (`getNodesByIds`/`getFanIn`/`getFanOut` on `CodeGraph`, plus batched outgoing/incoming edge fetches and unresolved-reference reads). `/api/node` on `LRUCache.get` answers in ~10 ms. - Capped lists, honest totals. 545 callers cannot all be rows, so caller groups cap at 300 — but `total` is always the real number, and the ordering puts the useful end first (same file, then production code, then tests). Every count in the payload is the length of a list the same payload returns, so a badge and its rail cannot disagree. - Nothing overclaims. Source that drifted on disk since the last index sync is omitted rather than sliced at line ranges that may now point at a different symbol; calls that leave the index are counted instead of silently shortening the callee rail; imports that never resolved are named; and a test-coverage claim reports whether its search actually finished. `/api/routes` says a project simply is not routed, and refuses a `limit` below three because the engine's manifest would answer that question wrongly. Tests: 45 against a real indexed fixture over a real loopback server, covering every endpoint's shape, the drift verdict in all three places it surfaces, search ranking and the filter grammar, the refusals, and the capping/latency behaviour at 500 callers. The issue's own acceptance case — `lru-cache.ts` `get` under 100 ms — runs against this repo's index when one is present. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com>	2026-08-26 23:33:30 -05:00