/** * Atlas enrichment for the CodeMap graph. * * The three graph getters build their nodes from `symbols` and `files`. Rank, * concept summaries and subsystem membership live in tables those queries know * nothing about, and each getter reaches its nodes by a different route — one * groups by package, one by file, one by symbol id. * * Rather than thread four more joins through three query shapes and their node * builders, this decorates the finished nodes in one pass. That keeps the * enrichment strictly additive: an index where no rank or concept pass has run * produces exactly the graph it produced before, because every lookup misses * and every field stays absent. * * It also sidesteps `chunkedIdQuery`'s documented rule that `buildSql` may not * contain a `LIMIT` — there is no limit to express here. */ import type { DatabaseSync } from 'node:sqlite'; import type { GraphNode } from './schema.js'; type Statement = ReturnType; type PrepareStatement = (sql: string) => Statement; /** * Stamp rank, concept, crux, subsystem and mtime onto graph nodes. * * `packageOf` is supplied by the caller because the package labeller already * exists at every call site, and rebuilding it here would read `files` twice. */ export declare function decorateGraphNodes(stmt: PrepareStatement, nodes: GraphNode[], packageOf: (file: string) => string): void; export {}; //# sourceMappingURL=writer-graph-decorate.d.ts.map