@schlessera/brain-ui-server 0.6.3 → 0.7.1

package/dist/app.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"app.d.ts","sourceRoot":"","sources":["../src/app.ts"],"names":[],"mappings":"AAWA,OAAO,EAAsB,KAAK,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAmB1E,YAAY,EAAE,WAAW,EAAE,CAAC;AAE5B,MAAM,WAAW,gBAAgB;IAC/B;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uEAAuE;IACvE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,uEAAuE;IACvE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,mDAAmD;IACnD,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAqBD,wBAAgB,SAAS,CAAC,OAAO,GAAE,gBAAqB;;;EAwFvD"}
+{"version":3,"file":"app.d.ts","sourceRoot":"","sources":["../src/app.ts"],"names":[],"mappings":"AAWA,OAAO,EAAsB,KAAK,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAoB1E,YAAY,EAAE,WAAW,EAAE,CAAC;AAE5B,MAAM,WAAW,gBAAgB;IAC/B;;;;OAIG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uEAAuE;IACvE,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,uEAAuE;IACvE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,mDAAmD;IACnD,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAqBD,wBAAgB,SAAS,CAAC,OAAO,GAAE,gBAAqB;;;EAyFvD"}

package/dist/app.js

@@ -11,6 +11,7 @@ import { filesRoutes } from "./routes/files.js";
 import { createRenderRoutes } from "./routes/render.js";
 import { providerRoutes } from "./routes/providers.js";
 import { modelRoutes } from "./routes/models.js";
+import { graphRoutes } from "./routes/graph.js";
 import { resolveAuthMode, assertAuthConfig, authGuard, authRoutes, isWsAuthorized, } from "./middleware/auth.js";
 import { passkeyPublicRoutes, passkeyManagementRoutes, passwordLoginDisabled, assertPasskeyConfig, } from "./middleware/passkeys.js";
 import { configureDb } from "./db/client.js";
@@ -91,6 +92,7 @@ export function createApp(options = {}) {
     app.route("/api", createRenderRoutes(options.renderer));
     app.route("/api", providerRoutes);
     app.route("/api", modelRoutes);
+    app.route("/api", graphRoutes);
     // WebSocket endpoint. Browsers can't set headers on the WS handshake, so the
     // upgrade authenticates via the session cookie (or IP/proxy header) INSIDE
     // the handler — no header-modifying middleware may sit on this route.

package/dist/app.js.map

@@ -1 +1 @@
-{"version":3,"file":"app.js","sourceRoot":"","sources":["../src/app.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAE5B,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAoB,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,SAAS,EACT,UAAU,EACV,cAAc,GACf,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,mBAAmB,EACnB,uBAAuB,EACvB,qBAAqB,EACrB,mBAAmB,GACpB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAyBxE,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,gFAAgF;AAChF,iFAAiF;AACjF,2EAA2E;AAC3E,6CAA6C;AAC7C,SAAS,iBAAiB,CAAC,CAAU,EAAE,cAAwB;IAC7D,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACtE,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC,OAAO,CAAC,CAAC,IAAI,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;IACjD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,UAA4B,EAAE;IACtD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;IACvB,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IACnC,4EAA4E;IAC5E,2EAA2E;IAC3E,6CAA6C;IAC7C,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAC3B,mBAAmB,EAAE,CAAC;IAEtB,IAAI,OAAO,CAAC,MAAM;QAAE,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAChD,eAAe,CAAC;QACd,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3E,CAAC,CAAC;IAEH,aAAa;IACb,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IAEvB,6EAA6E;IAC7E,sEAAsE;IACtE,sEAAsE;IACtE,kCAAkC;IAClC,MAAM,cAAc,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,IAAI,EAAE,CAAC;SACvD,KAAK,CAAC,GAAG,CAAC;SACV,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;SAC9B,MAAM,CAAC,OAAO,CAAC,CAAC;IACnB,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,GAAG,CAAC,GAAG,CACL,QAAQ,EACR,IAAI,CAAC;YACH,MAAM,EAAE,cAAc;YACtB,YAAY,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC;YAC9C,YAAY,EAAE,CAAC,cAAc,CAAC;YAC9B,WAAW,EAAE,IAAI;SAClB,CAAC,CACH,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,qEAAqE;IACrE,6EAA6E;IAC7E,4DAA4D;IAC5D,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IAChC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,UAAU,CAAC,QAAQ,EAAE,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,CAAC,CAAC,CAAC;IACrF,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEjD,4EAA4E;IAC5E,wEAAwE;IACxE,oEAAoE;IACpE,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IACvC,GAAG,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACxD,6EAA6E;IAC7E,wEAAwE;IACxE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,uBAAuB,CAAC,QAAQ,CAAC,CAAC,CAAC;IACrD,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IAChC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACjC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IACxD,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAClC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAE/B,6EAA6E;IAC7E,2EAA2E;IAC3E,sEAAsE;IACtE,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE;QAC/B,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,cAAc,CAAC,EAAE,CAAC;YAC1C,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,iCAAiC,EAAE,EAAE,GAAG,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;YACzC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,yBAAyB,EAAE,EAAE,GAAG,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,yEAAyE;IACzE,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;QACtC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;QACjD,eAAe;QACf,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,SAAS;KACV,CAAC;AACJ,CAAC"}
+{"version":3,"file":"app.js","sourceRoot":"","sources":["../src/app.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAE5B,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,kBAAkB,EAAoB,MAAM,oBAAoB,CAAC;AAC1E,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,SAAS,EACT,UAAU,EACV,cAAc,GACf,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACL,mBAAmB,EACnB,uBAAuB,EACvB,qBAAqB,EACrB,mBAAmB,GACpB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAyBxE,gFAAgF;AAChF,6EAA6E;AAC7E,gFAAgF;AAChF,gFAAgF;AAChF,iFAAiF;AACjF,2EAA2E;AAC3E,6CAA6C;AAC7C,SAAS,iBAAiB,CAAC,CAAU,EAAE,cAAwB;IAC7D,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,cAAc,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACtE,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAClC,OAAO,CAAC,CAAC,IAAI,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;IACjD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,UAA4B,EAAE;IACtD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;IACvB,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IACnC,4EAA4E;IAC5E,2EAA2E;IAC3E,6CAA6C;IAC7C,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAC3B,mBAAmB,EAAE,CAAC;IAEtB,IAAI,OAAO,CAAC,MAAM;QAAE,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAChD,eAAe,CAAC;QACd,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACxD,GAAG,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC3E,CAAC,CAAC;IAEH,aAAa;IACb,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC;IAEvB,6EAA6E;IAC7E,sEAAsE;IACtE,sEAAsE;IACtE,kCAAkC;IAClC,MAAM,cAAc,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,eAAe,IAAI,EAAE,CAAC;SACvD,KAAK,CAAC,GAAG,CAAC;SACV,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;SAC9B,MAAM,CAAC,OAAO,CAAC,CAAC;IACnB,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC9B,GAAG,CAAC,GAAG,CACL,QAAQ,EACR,IAAI,CAAC;YACH,MAAM,EAAE,cAAc;YACtB,YAAY,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC;YAC9C,YAAY,EAAE,CAAC,cAAc,CAAC;YAC9B,WAAW,EAAE,IAAI;SAClB,CAAC,CACH,CAAC;IACJ,CAAC;IAED,6EAA6E;IAC7E,qEAAqE;IACrE,6EAA6E;IAC7E,4DAA4D;IAC5D,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IAChC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,UAAU,CAAC,QAAQ,EAAE,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,CAAC,CAAC,CAAC;IACrF,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,mBAAmB,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEjD,4EAA4E;IAC5E,wEAAwE;IACxE,oEAAoE;IACpE,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;IACvC,GAAG,CAAC,GAAG,CAAC,gBAAgB,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IACxD,6EAA6E;IAC7E,wEAAwE;IACxE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,uBAAuB,CAAC,QAAQ,CAAC,CAAC,CAAC;IACrD,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IAChC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACjC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,kBAAkB,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IACxD,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAClC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAE/B,6EAA6E;IAC7E,2EAA2E;IAC3E,sEAAsE;IACtE,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE;QAC/B,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,cAAc,CAAC,EAAE,CAAC;YAC1C,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,iCAAiC,EAAE,EAAE,GAAG,CAAC,CAAC;QACnE,CAAC;QACD,IAAI,CAAC,CAAC,MAAM,cAAc,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,CAAC;YACzC,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,yBAAyB,EAAE,EAAE,GAAG,CAAC,CAAC;QAC3D,CAAC;QACD,OAAO,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,yEAAyE;IACzE,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;QACtC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;QACjD,eAAe;QACf,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,UAAU,EAAE,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,SAAS;KACV,CAAC;AACJ,CAAC"}

package/dist/graph/reader.d.ts

@@ -0,0 +1,71 @@
+/**
+ * Read side of the knowledge graph.
+ *
+ * brain.db is opened read-only per request (the keyterm-builder precedent):
+ * WAL makes concurrent readers cheap, and a short-lived handle means a
+ * `brain sync` swapping the file underneath us can never leave the server
+ * holding a stale page cache. ui-server has no dependency on core, so the
+ * schema below is consumed as the documented direct-read contract, not as
+ * imported types.
+ *
+ * Everything derived (metrics, communities, layout, root distances) is
+ * precomputed by the CLI. What stays here is per-request work over the raw
+ * `links` table: ego extraction and BFS from an arbitrary root, both of which
+ * are too interactive to shell out for.
+ */
+import type { GraphMaintenanceResponse, GraphMetaResponse, GraphSubgraphResponse } from "@schlessera/brain-ui-sdk/protocol";
+/** brain.db schema that first carries the graph tables. */
+export declare const MIN_SCHEMA_VERSION = 8;
+/** Response caps. Over them, the lowest-pagerank nodes/edges are dropped. */
+export declare const MAX_NODES = 5000;
+export declare const MAX_EDGES = 20000;
+/** A neighborhood is meant to stay readable, so it caps well below MAX_NODES. */
+export declare const MAX_NEIGHBORHOOD_NODES = 1500;
+export declare const MAX_NEIGHBORHOOD_DEPTH = 3;
+export declare const MAX_DISCOVERY_DEPTH = 8;
+export type GraphDirection = "in" | "out" | "both";
+export type GraphUnavailableReason = "schema" | "not_computed";
+/** No graph to read: the repo predates schema v8, or nothing has computed one. */
+export declare class GraphUnavailableError extends Error {
+    readonly reason: GraphUnavailableReason;
+    constructor(reason: GraphUnavailableReason);
+}
+/** A center/root path that matches no indexed markdown document. */
+export declare class GraphNotFoundError extends Error {
+    readonly path: string;
+    constructor(path: string);
+}
+export interface GraphReadOptions {
+    /** Defaults to the repo the rest of the server reads (BRAIN_PATH). */
+    brainPath?: string;
+}
+export interface ClustersOptions extends GraphReadOptions {
+    community?: number;
+    includeIsolates?: boolean;
+}
+export interface NeighborhoodOptions extends GraphReadOptions {
+    center: string;
+    depth?: number;
+    direction?: GraphDirection;
+}
+export interface DiscoveryOptions extends GraphReadOptions {
+    /** Omitted → the precomputed default root, virtual node included. */
+    root?: string;
+    direction?: "out" | "both";
+    maxDepth?: number;
+}
+export interface MaintenanceOptions extends GraphReadOptions {
+    staleDays?: number;
+}
+export declare const DEFAULT_STALE_DAYS = 180;
+export declare function getGraphMeta(opts?: GraphReadOptions): GraphMetaResponse;
+export declare function getClusters(opts?: ClustersOptions): GraphSubgraphResponse;
+/**
+ * Deliberately exempt from the schema gate: an ego graph needs nothing but the
+ * `links` table, so the local mode stays useful on a repo that has never seen a
+ * graph precompute.
+ */
+export declare function getNeighborhood(opts: NeighborhoodOptions): GraphSubgraphResponse;
+export declare function getDiscovery(opts?: DiscoveryOptions): GraphSubgraphResponse;
+export declare function getMaintenance(opts?: MaintenanceOptions): GraphMaintenanceResponse;
+//# sourceMappingURL=reader.d.ts.map

package/dist/graph/reader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reader.d.ts","sourceRoot":"","sources":["../../src/graph/reader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAKH,OAAO,KAAK,EAGV,wBAAwB,EACxB,iBAAiB,EAEjB,qBAAqB,EACtB,MAAM,mCAAmC,CAAC;AAG3C,2DAA2D;AAC3D,eAAO,MAAM,kBAAkB,IAAI,CAAC;AAEpC,6EAA6E;AAC7E,eAAO,MAAM,SAAS,OAAO,CAAC;AAC9B,eAAO,MAAM,SAAS,QAAS,CAAC;AAChC,iFAAiF;AACjF,eAAO,MAAM,sBAAsB,OAAO,CAAC;AAE3C,eAAO,MAAM,sBAAsB,IAAI,CAAC;AACxC,eAAO,MAAM,mBAAmB,IAAI,CAAC;AAErC,MAAM,MAAM,cAAc,GAAG,IAAI,GAAG,KAAK,GAAG,MAAM,CAAC;AACnD,MAAM,MAAM,sBAAsB,GAAG,QAAQ,GAAG,cAAc,CAAC;AAE/D,kFAAkF;AAClF,qBAAa,qBAAsB,SAAQ,KAAK;IAClC,QAAQ,CAAC,MAAM,EAAE,sBAAsB;gBAA9B,MAAM,EAAE,sBAAsB;CAIpD;AAED,oEAAoE;AACpE,qBAAa,kBAAmB,SAAQ,KAAK;IAC/B,QAAQ,CAAC,IAAI,EAAE,MAAM;gBAAZ,IAAI,EAAE,MAAM;CAIlC;AAED,MAAM,WAAW,gBAAgB;IAC/B,sEAAsE;IACtE,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,eAAgB,SAAQ,gBAAgB;IACvD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,eAAe,CAAC,EAAE,OAAO,CAAC;CAC3B;AAED,MAAM,WAAW,mBAAoB,SAAQ,gBAAgB;IAC3D,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,cAAc,CAAC;CAC5B;AAED,MAAM,WAAW,gBAAiB,SAAQ,gBAAgB;IACxD,qEAAqE;IACrE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,SAAS,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC;IAC3B,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,kBAAmB,SAAQ,gBAAgB;IAC1D,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,eAAO,MAAM,kBAAkB,MAAM,CAAC;AAkVtC,wBAAgB,YAAY,CAAC,IAAI,GAAE,gBAAqB,GAAG,iBAAiB,CAkC3E;AAqBD,wBAAgB,WAAW,CAAC,IAAI,GAAE,eAAoB,GAAG,qBAAqB,CA0B7E;AAED;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,mBAAmB,GAAG,qBAAqB,CAehF;AAED,wBAAgB,YAAY,CAAC,IAAI,GAAE,gBAAqB,GAAG,qBAAqB,CA2E/E;AAED,wBAAgB,cAAc,CAAC,IAAI,GAAE,kBAAuB,GAAG,wBAAwB,CAuDtF"}

package/dist/graph/reader.js

@@ -0,0 +1,522 @@
+/**
+ * Read side of the knowledge graph.
+ *
+ * brain.db is opened read-only per request (the keyterm-builder precedent):
+ * WAL makes concurrent readers cheap, and a short-lived handle means a
+ * `brain sync` swapping the file underneath us can never leave the server
+ * holding a stale page cache. ui-server has no dependency on core, so the
+ * schema below is consumed as the documented direct-read contract, not as
+ * imported types.
+ *
+ * Everything derived (metrics, communities, layout, root distances) is
+ * precomputed by the CLI. What stays here is per-request work over the raw
+ * `links` table: ego extraction and BFS from an arbitrary root, both of which
+ * are too interactive to shell out for.
+ */
+import { Database } from "bun:sqlite";
+import { existsSync } from "fs";
+import { basename, join } from "path";
+import { getBrainRoot } from "../files/walker.js";
+/** brain.db schema that first carries the graph tables. */
+export const MIN_SCHEMA_VERSION = 8;
+/** Response caps. Over them, the lowest-pagerank nodes/edges are dropped. */
+export const MAX_NODES = 5000;
+export const MAX_EDGES = 20_000;
+/** A neighborhood is meant to stay readable, so it caps well below MAX_NODES. */
+export const MAX_NEIGHBORHOOD_NODES = 1500;
+export const MAX_NEIGHBORHOOD_DEPTH = 3;
+export const MAX_DISCOVERY_DEPTH = 8;
+/** No graph to read: the repo predates schema v8, or nothing has computed one. */
+export class GraphUnavailableError extends Error {
+    reason;
+    constructor(reason) {
+        super(`graph_unavailable: ${reason}`);
+        this.reason = reason;
+        this.name = "GraphUnavailableError";
+    }
+}
+/** A center/root path that matches no indexed markdown document. */
+export class GraphNotFoundError extends Error {
+    path;
+    constructor(path) {
+        super(`not_found: ${path}`);
+        this.path = path;
+        this.name = "GraphNotFoundError";
+    }
+}
+export const DEFAULT_STALE_DAYS = 180;
+// --- db access -------------------------------------------------------------
+function openDb(brainPath) {
+    const dbPath = join(brainPath ?? getBrainRoot(), "brain.db");
+    if (!existsSync(dbPath))
+        throw new GraphUnavailableError("schema");
+    return new Database(dbPath, { readonly: true });
+}
+function withDb(brainPath, fn) {
+    const db = openDb(brainPath);
+    try {
+        return fn(db);
+    }
+    finally {
+        db.close();
+    }
+}
+const GRAPH_TABLES = ["graph_metrics", "graph_communities", "graph_root_distances", "graph_layouts"];
+/**
+ * A db can claim schema 8 in metadata and still lack the tables (a hand-copied
+ * file, an interrupted migration), so presence is checked rather than trusted.
+ */
+function hasGraphTables(db) {
+    const rows = db
+        .query(`SELECT name FROM sqlite_master WHERE type = 'table'
+         AND name IN ('graph_metrics', 'graph_communities', 'graph_root_distances', 'graph_layouts')`)
+        .all();
+    return rows.length === GRAPH_TABLES.length;
+}
+function readMetadata(db) {
+    try {
+        const rows = db.query("SELECT key, value FROM index_metadata").all();
+        return new Map(rows.map((r) => [r.key, r.value]));
+    }
+    catch {
+        return new Map();
+    }
+}
+function readSchemaVersion(meta) {
+    const parsed = Number.parseInt(meta.get("schema_version") ?? "", 10);
+    return Number.isFinite(parsed) ? parsed : 0;
+}
+function requireComputedGraph(db, meta) {
+    if (readSchemaVersion(meta) < MIN_SCHEMA_VERSION || !hasGraphTables(db)) {
+        throw new GraphUnavailableError("schema");
+    }
+    if (!meta.get("graph_computed_at"))
+        throw new GraphUnavailableError("not_computed");
+}
+/** Only markdown notes are graph nodes; other assets carry no wiki links. */
+const MARKDOWN_ONLY = "COALESCE(d.asset_type, 'markdown') = 'markdown'";
+/**
+ * The analytical columns come from tables that do not exist below schema v8,
+ * so the select degrades to literals — that is what keeps the neighborhood
+ * endpoint working against an older repo.
+ */
+function nodeSelect(withGraphTables, extraColumns = "") {
+    const base = `d.id AS id, d.path AS path, d.title AS title, d.type AS type${extraColumns}`;
+    if (!withGraphTables) {
+        return `SELECT ${base},
+        0 AS in_degree, 0 AS out_degree,
+        NULL AS community, NULL AS pagerank, NULL AS x, NULL AS y
+      FROM documents d`;
+    }
+    return `SELECT ${base},
+      COALESCE(m.in_degree, 0) AS in_degree, COALESCE(m.out_degree, 0) AS out_degree,
+      m.community AS community, m.pagerank AS pagerank, gl.x AS x, gl.y AS y
+    FROM documents d
+    LEFT JOIN graph_metrics m ON m.document_id = d.id
+    LEFT JOIN graph_layouts gl ON gl.document_id = d.id AND gl.mode = 'clusters'`;
+}
+function toNode(row, distance) {
+    const node = {
+        id: row.id,
+        path: row.path,
+        title: row.title,
+        type: row.type,
+        inDegree: row.in_degree ?? 0,
+        outDegree: row.out_degree ?? 0,
+    };
+    if (row.community != null)
+        node.community = row.community;
+    if (row.pagerank != null)
+        node.pagerank = row.pagerank;
+    if (row.x != null && row.y != null) {
+        node.x = row.x;
+        node.y = row.y;
+    }
+    if (distance !== undefined)
+        node.distance = distance;
+    return node;
+}
+/** Chunked so a large id set never runs into SQLite's bound-parameter limit. */
+function loadNodesByIds(db, ids, withGraphTables) {
+    const out = [];
+    for (let i = 0; i < ids.length; i += 500) {
+        const chunk = ids.slice(i, i + 500);
+        const placeholders = chunk.map(() => "?").join(", ");
+        const rows = db
+            .query(`${nodeSelect(withGraphTables)} WHERE ${MARKDOWN_ONLY} AND d.id IN (${placeholders})`)
+            .all(...chunk);
+        out.push(...rows);
+    }
+    return out;
+}
+function lookupDocumentId(db, path) {
+    const normalized = path.replace(/^\.?\//, "");
+    const row = db
+        .query(`SELECT d.id AS id FROM documents d WHERE ${MARKDOWN_ONLY} AND d.path = ?`)
+        .get(normalized);
+    if (!row)
+        throw new GraphNotFoundError(path);
+    return row.id;
+}
+/**
+ * The one definition of an edge, shared by the adjacency load and the meta
+ * count so /api/graph/meta agrees with `brain graph stats`: one edge per
+ * distinct (source, target) DOCUMENT pair — two wiki links that resolve to the
+ * same note are one edge — self-links dropped, and both ends markdown, since
+ * non-markdown assets are not graph nodes.
+ */
+const DISTINCT_EDGES_SQL = `SELECT DISTINCT l.source_id AS source, l.target_id AS target
+    FROM links l
+    JOIN documents d ON d.id = l.source_id AND ${MARKDOWN_ONLY}
+    JOIN documents t ON t.id = l.target_id AND COALESCE(t.asset_type, 'markdown') = 'markdown'
+   WHERE l.target_id IS NOT NULL AND l.target_id <> l.source_id`;
+/** The whole link table as an edge list plus adjacency maps in both directions. */
+function loadLinkStructure(db) {
+    const edges = db.query(DISTINCT_EDGES_SQL).all();
+    const out = new Map();
+    const inbound = new Map();
+    for (const edge of edges) {
+        push(out, edge.source, edge.target);
+        push(inbound, edge.target, edge.source);
+    }
+    return { edges, out, in: inbound };
+}
+function push(map, key, value) {
+    const existing = map.get(key);
+    if (existing)
+        existing.push(value);
+    else
+        map.set(key, [value]);
+}
+/** Breadth-first walk, level by level, stopping at `maxDepth` or `limit` nodes. */
+function bfs(structure, start, direction, maxDepth, limit) {
+    const distances = new Map([[start, 0]]);
+    let frontier = [start];
+    let depth = 0;
+    let truncated = false;
+    while (frontier.length > 0 && depth < maxDepth && !truncated) {
+        depth++;
+        const next = [];
+        for (const id of frontier) {
+            const neighbors = [];
+            if (direction !== "in")
+                neighbors.push(...(structure.out.get(id) ?? []));
+            if (direction !== "out")
+                neighbors.push(...(structure.in.get(id) ?? []));
+            for (const neighbor of neighbors) {
+                if (distances.has(neighbor))
+                    continue;
+                if (distances.size >= limit) {
+                    truncated = true;
+                    break;
+                }
+                distances.set(neighbor, depth);
+                next.push(neighbor);
+            }
+            if (truncated)
+                break;
+        }
+        frontier = next;
+    }
+    return { distances, truncated };
+}
+// --- caps ------------------------------------------------------------------
+/**
+ * Trims a subgraph to the response caps, keeping the highest-pagerank nodes
+ * (a virtual root always survives — dropping the thing the view is rooted on
+ * would be nonsense). Edges are then filtered to the surviving node set, which
+ * is also how a whole-corpus edge list is narrowed to the requested subgraph.
+ */
+function applyCaps(nodes, edges, maxNodes) {
+    let truncated = false;
+    let keptNodes = nodes;
+    if (nodes.length > maxNodes) {
+        truncated = true;
+        keptNodes = [...nodes]
+            .sort((a, b) => Number(b.virtual ?? false) - Number(a.virtual ?? false) || (b.pagerank ?? 0) - (a.pagerank ?? 0))
+            .slice(0, maxNodes);
+    }
+    const ids = new Set(keptNodes.map((n) => n.id));
+    let keptEdges = edges.filter((e) => ids.has(e.source) && ids.has(e.target));
+    if (keptEdges.length > MAX_EDGES) {
+        truncated = true;
+        const rank = new Map(keptNodes.map((n) => [n.id, n.pagerank ?? 0]));
+        keptEdges = keptEdges
+            .map((edge) => ({ edge, weight: Math.min(rank.get(edge.source) ?? 0, rank.get(edge.target) ?? 0) }))
+            .sort((a, b) => b.weight - a.weight)
+            .slice(0, MAX_EDGES)
+            .map((entry) => entry.edge);
+    }
+    return { nodes: keptNodes, edges: keptEdges, truncated };
+}
+// --- meta ------------------------------------------------------------------
+function countGraph(db) {
+    try {
+        const edges = db.query(`SELECT COUNT(*) AS c FROM (${DISTINCT_EDGES_SQL})`).get();
+        return { nodeCount: countMarkdownDocs(db), edgeCount: edges?.c ?? 0 };
+    }
+    catch {
+        return { nodeCount: 0, edgeCount: 0 };
+    }
+}
+/**
+ * Whether the precompute resolved a root at all.
+ *
+ * The key is deleted and rewritten each run, so its ABSENCE is the only signal
+ * that there is no root — an empty `graph_root_distances` does not mean the
+ * same thing. A named root whose links all failed to resolve is written with
+ * zero distance rows, and in that state every note really is unreachable.
+ */
+function hasResolvedRoot(meta) {
+    return Boolean(meta.get("graph_root"));
+}
+function countMarkdownDocs(db) {
+    return (db.query(`SELECT COUNT(*) AS c FROM documents d WHERE ${MARKDOWN_ONLY}`).get()?.c ?? 0);
+}
+function parseDefaultRoot(meta) {
+    const raw = meta.get("graph_root");
+    if (!raw)
+        return null;
+    if (raw.startsWith("virtual:"))
+        return { path: raw.slice("virtual:".length), virtual: true };
+    return { path: raw, virtual: false };
+}
+function parseRootLinks(meta) {
+    const raw = meta.get("graph_root_links");
+    if (!raw)
+        return [];
+    try {
+        const parsed = JSON.parse(raw);
+        return Array.isArray(parsed) ? parsed.filter((id) => Number.isFinite(id)) : [];
+    }
+    catch {
+        return [];
+    }
+}
+function readCommunities(db) {
+    const rows = db
+        .query("SELECT community, size, label, top_terms FROM graph_communities ORDER BY size DESC, community ASC")
+        .all();
+    return rows.map((row) => {
+        let topTerms = [];
+        try {
+            const parsed = row.top_terms ? JSON.parse(row.top_terms) : [];
+            if (Array.isArray(parsed))
+                topTerms = parsed.filter((t) => typeof t === "string");
+        }
+        catch {
+            topTerms = [];
+        }
+        return { community: row.community, size: row.size, label: row.label ?? null, topTerms };
+    });
+}
+/**
+ * An older CLI indexing a v8 repo leaves the graph tables untouched rather than
+ * broken, so freshness is a comparison against the newest index run, not a
+ * structural check.
+ */
+function isStale(db, computedAt) {
+    const row = db.query("SELECT MAX(indexed_at) AS newest FROM documents").get();
+    if (!row?.newest)
+        return false;
+    const computed = Date.parse(computedAt);
+    const indexed = Date.parse(row.newest);
+    if (Number.isNaN(computed) || Number.isNaN(indexed))
+        return false;
+    return computed < indexed;
+}
+export function getGraphMeta(opts = {}) {
+    let db;
+    try {
+        db = openDb(opts.brainPath);
+    }
+    catch {
+        // No brain.db at all — indistinguishable, from the client's side, from a
+        // repo whose schema is too old to carry a graph.
+        return unavailable("schema", 0, { nodeCount: 0, edgeCount: 0 });
+    }
+    try {
+        const meta = readMetadata(db);
+        const schemaVersion = readSchemaVersion(meta);
+        const counts = countGraph(db);
+        if (schemaVersion < MIN_SCHEMA_VERSION || !hasGraphTables(db)) {
+            return unavailable("schema", schemaVersion, counts);
+        }
+        const computedAt = meta.get("graph_computed_at") ?? null;
+        if (!computedAt)
+            return unavailable("not_computed", schemaVersion, counts);
+        const response = {
+            available: true,
+            schemaVersion,
+            computedAt,
+            stale: isStale(db, computedAt),
+            ...counts,
+            communities: readCommunities(db),
+            defaultRoot: parseDefaultRoot(meta),
+        };
+        if (meta.get("graph_layout_skipped") === "1")
+            response.layoutSkipped = true;
+        return response;
+    }
+    finally {
+        db.close();
+    }
+}
+function unavailable(reason, schemaVersion, counts) {
+    return {
+        available: false,
+        reason,
+        schemaVersion,
+        computedAt: null,
+        stale: false,
+        ...counts,
+        communities: [],
+        defaultRoot: null,
+    };
+}
+// --- modes -----------------------------------------------------------------
+export function getClusters(opts = {}) {
+    return withDb(opts.brainPath, (db) => {
+        requireComputedGraph(db, readMetadata(db));
+        const filters = [MARKDOWN_ONLY];
+        const params = [];
+        if (opts.community !== undefined) {
+            filters.push("m.community = ?");
+            params.push(opts.community);
+        }
+        if (!opts.includeIsolates) {
+            filters.push("(COALESCE(m.in_degree, 0) + COALESCE(m.out_degree, 0)) > 0");
+        }
+        const rows = db
+            .query(`${nodeSelect(true)} WHERE ${filters.join(" AND ")} ORDER BY m.pagerank DESC, d.id ASC`)
+            .all(...params);
+        return applyCaps(rows.map((row) => toNode(row)), loadLinkStructure(db).edges, MAX_NODES);
+    });
+}
+/**
+ * Deliberately exempt from the schema gate: an ego graph needs nothing but the
+ * `links` table, so the local mode stays useful on a repo that has never seen a
+ * graph precompute.
+ */
+export function getNeighborhood(opts) {
+    const depth = clamp(opts.depth ?? 1, 1, MAX_NEIGHBORHOOD_DEPTH);
+    const direction = opts.direction ?? "both";
+    return withDb(opts.brainPath, (db) => {
+        const centerId = lookupDocumentId(db, opts.center);
+        const withGraphTables = hasGraphTables(db);
+        const structure = loadLinkStructure(db);
+        const { distances, truncated } = bfs(structure, centerId, direction, depth, MAX_NEIGHBORHOOD_NODES);
+        const rows = loadNodesByIds(db, [...distances.keys()], withGraphTables);
+        const nodes = rows.map((row) => toNode(row, distances.get(row.id)));
+        const capped = applyCaps(nodes, structure.edges, MAX_NEIGHBORHOOD_NODES);
+        return { ...capped, truncated: capped.truncated || truncated };
+    });
+}
+export function getDiscovery(opts = {}) {
+    const maxDepth = clamp(opts.maxDepth ?? MAX_DISCOVERY_DEPTH, 1, MAX_DISCOVERY_DEPTH);
+    const direction = opts.direction ?? "out";
+    return withDb(opts.brainPath, (db) => {
+        const meta = readMetadata(db);
+        requireComputedGraph(db, meta);
+        const structure = loadLinkStructure(db);
+        const total = countMarkdownDocs(db);
+        if (opts.root) {
+            const rootId = lookupDocumentId(db, opts.root);
+            const { distances, truncated } = bfs(structure, rootId, direction, maxDepth, MAX_NODES);
+            const rows = loadNodesByIds(db, [...distances.keys()], true);
+            const capped = applyCaps(rows.map((row) => toNode(row, distances.get(row.id))), structure.edges, MAX_NODES);
+            // Reach is a property of the graph, not of the scene, so it is measured
+            // by a second walk with no depth window. A BFS can neither exceed the
+            // node count in levels nor in nodes, so `total` bounds both exactly.
+            const reachable = bfs(structure, rootId, direction, total, total).distances.size;
+            return {
+                ...capped,
+                truncated: capped.truncated || truncated,
+                reachableCount: reachable,
+                unreachableCount: Math.max(0, total - reachable),
+            };
+        }
+        // Default root: the distances were computed at index time, so `direction`
+        // does not apply here — the precomputed walk is the one that was run.
+        const distanceRows = db
+            .query("SELECT document_id, distance FROM graph_root_distances WHERE distance <= ?")
+            .all(maxDepth);
+        const distances = new Map(distanceRows.map((row) => [row.document_id, row.distance]));
+        const rows = loadNodesByIds(db, [...distances.keys()], true);
+        const nodes = rows.map((row) => toNode(row, distances.get(row.id)));
+        const root = parseDefaultRoot(meta);
+        const edges = [...structure.edges];
+        if (root?.virtual) {
+            // The entry file is excluded from indexing, so it has no documents row:
+            // the node standing in for it is synthesized here, at id 0.
+            const rootLinks = parseRootLinks(meta).filter((id) => distances.has(id));
+            nodes.unshift({
+                id: 0,
+                path: root.path,
+                title: basename(root.path),
+                type: "root",
+                inDegree: 0,
+                outDegree: rootLinks.length,
+                distance: 0,
+                virtual: true,
+            });
+            edges.unshift(...rootLinks.map((id) => ({ source: 0, target: id })));
+        }
+        const response = applyCaps(nodes, edges, MAX_NODES);
+        if (hasResolvedRoot(meta)) {
+            // Every distance row is one reached DOCUMENT — a virtual root is none, so
+            // this needs no adjustment for the synthesized node. Counted over the
+            // whole table, not the depth-limited scene above.
+            const reachable = db.query("SELECT COUNT(*) AS c FROM graph_root_distances").get()?.c ?? 0;
+            response.reachableCount = reachable;
+            response.unreachableCount = Math.max(0, total - reachable);
+        }
+        return response;
+    });
+}
+export function getMaintenance(opts = {}) {
+    const staleDays = clamp(opts.staleDays ?? DEFAULT_STALE_DAYS, 1, 3650);
+    return withDb(opts.brainPath, (db) => {
+        const meta = readMetadata(db);
+        requireComputedGraph(db, meta);
+        const orphans = db
+            .query(`${nodeSelect(true)} WHERE ${MARKDOWN_ONLY}
+           AND COALESCE(m.in_degree, 0) = 0 AND COALESCE(m.out_degree, 0) = 0
+         ORDER BY d.updated DESC, d.id ASC LIMIT ?`)
+            .all(MAX_NODES)
+            .map((row) => toNode(row));
+        // Keyed on whether a root was RESOLVED, not on whether any note has a
+        // distance: a named root that reached nothing leaves the distances empty,
+        // and then the whole corpus genuinely is unreachable. Only the absence of a
+        // root makes the finding meaningless.
+        const unreachable = !hasResolvedRoot(meta)
+            ? []
+            : db
+                .query(`${nodeSelect(true)}
+                 LEFT JOIN graph_root_distances rd ON rd.document_id = d.id
+               WHERE ${MARKDOWN_ONLY} AND rd.document_id IS NULL
+               ORDER BY m.pagerank DESC, d.id ASC LIMIT ?`)
+                .all(MAX_NODES)
+                .map((row) => toNode(row));
+        const brokenLinks = db
+            .query(`SELECT d.path AS sourcePath, l.target AS target
+           FROM links l JOIN documents d ON d.id = l.source_id
+          WHERE l.target_id IS NULL
+          ORDER BY d.path ASC, l.target ASC LIMIT ?`)
+            .all(MAX_NODES);
+        // `documents.updated` is a date, `indexed_at` a timestamp — compare on the
+        // date prefix so a mix of both formats still sorts correctly.
+        const cutoff = new Date(Date.now() - staleDays * 86_400_000).toISOString().slice(0, 10);
+        const stale = db
+            .query(`${nodeSelect(true, ", d.updated AS updated")}
+         WHERE ${MARKDOWN_ONLY} AND substr(d.updated, 1, 10) < ?
+         ORDER BY d.updated ASC, d.id ASC LIMIT ?`)
+            .all(cutoff, MAX_NODES)
+            .map((row) => ({ ...toNode(row), updated: row.updated }));
+        return { orphans, unreachable, brokenLinks, stale, staleDays };
+    });
+}
+function clamp(value, min, max) {
+    return Math.min(max, Math.max(min, value));
+}
+//# sourceMappingURL=reader.js.map