maestro-flow 0.1.4 → 0.2.1

package/dashboard/dist-server/dashboard/src/server/wiki/frontmatter-util.d.ts

@@ -0,0 +1,5 @@
+export interface ParsedFrontmatter {
+    data: Record<string, unknown>;
+    content: string;
+}
+export declare function parseFrontmatter(raw: string): ParsedFrontmatter;

package/dashboard/dist-server/dashboard/src/server/wiki/frontmatter-util.js

@@ -0,0 +1,52 @@
+// Frontmatter parser extracted verbatim from routes/specs.ts so both routes
+// share a single source of truth. Matches spec-index-builder.ts behavior.
+export function parseFrontmatter(raw) {
+    const trimmed = raw.trimStart();
+    if (!trimmed.startsWith('---')) {
+        return { data: {}, content: raw };
+    }
+    const endIdx = trimmed.indexOf('\n---', 3);
+    if (endIdx === -1) {
+        return { data: {}, content: raw };
+    }
+    const yamlBlock = trimmed.substring(3, endIdx).trim();
+    const content = trimmed.substring(endIdx + 4);
+    const data = {};
+    let currentKey = '';
+    let arrayItems = null;
+    for (const line of yamlBlock.split('\n')) {
+        const trimLine = line.trim();
+        if (trimLine.startsWith('- ') && arrayItems !== null) {
+            arrayItems.push(trimLine.substring(2).trim());
+            continue;
+        }
+        if (arrayItems !== null && currentKey) {
+            data[currentKey] = arrayItems;
+            arrayItems = null;
+        }
+        const colonIdx = trimLine.indexOf(':');
+        if (colonIdx === -1)
+            continue;
+        const key = trimLine.substring(0, colonIdx).trim();
+        const value = trimLine.substring(colonIdx + 1).trim();
+        currentKey = key;
+        if (value === '' || value === '[]') {
+            arrayItems = [];
+        }
+        else if (value.startsWith('[') && value.endsWith(']')) {
+            data[key] = value
+                .slice(1, -1)
+                .split(',')
+                .map((s) => s.trim().replace(/^["']|["']$/g, ''))
+                .filter((s) => s.length > 0);
+        }
+        else {
+            data[key] = value.replace(/^["']|["']$/g, '');
+        }
+    }
+    if (arrayItems !== null && currentKey) {
+        data[currentKey] = arrayItems;
+    }
+    return { data, content };
+}
+//# sourceMappingURL=frontmatter-util.js.map

package/dashboard/dist-server/dashboard/src/server/wiki/frontmatter-util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"frontmatter-util.js","sourceRoot":"","sources":["../../../../../src/server/wiki/frontmatter-util.ts"],"names":[],"mappings":"AAAA,4EAA4E;AAC5E,0EAA0E;AAO1E,MAAM,UAAU,gBAAgB,CAAC,GAAW;IAC1C,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,EAAE,CAAC;IAChC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;IACpC,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;IAC3C,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QAClB,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;IACpC,CAAC;IACD,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IACtD,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC9C,MAAM,IAAI,GAA4B,EAAE,CAAC;IAEzC,IAAI,UAAU,GAAG,EAAE,CAAC;IACpB,IAAI,UAAU,GAAoB,IAAI,CAAC;IAEvC,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;YACrD,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;YAC9C,SAAS;QACX,CAAC;QACD,IAAI,UAAU,KAAK,IAAI,IAAI,UAAU,EAAE,CAAC;YACtC,IAAI,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC;YAC9B,UAAU,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,QAAQ,KAAK,CAAC,CAAC;YAAE,SAAS;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACnD,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACtD,UAAU,GAAG,GAAG,CAAC;QACjB,IAAI,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnC,UAAU,GAAG,EAAE,CAAC;QAClB,CAAC;aAAM,IAAI,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACxD,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK;iBACd,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;iBACZ,KAAK,CAAC,GAAG,CAAC;iBACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;iBAChD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IACD,IAAI,UAAU,KAAK,IAAI,IAAI,UAAU,EAAE,CAAC;QACtC,IAAI,CAAC,UAAU,CAAC,GAAG,UAAU,CAAC;IAChC,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC"}

package/dashboard/dist-server/dashboard/src/server/wiki/graph-analysis.d.ts

@@ -0,0 +1,48 @@
+import type { WikiEntry, WikiIndex } from './wiki-types.js';
+export interface BrokenLink {
+    sourceId: string;
+    target: string;
+}
+export interface WikiGraph {
+    /** source entry id → resolved target entry ids */
+    forwardLinks: Record<string, string[]>;
+    /** target entry id → source entry ids (mirrors WikiIndex.backlinks) */
+    backlinks: Record<string, string[]>;
+    /** unresolved `[[…]]` mentions */
+    brokenLinks: BrokenLink[];
+}
+export interface HubRank {
+    id: string;
+    inDegree: number;
+}
+export interface WikiHealth {
+    score: number;
+    totals: {
+        entries: number;
+        brokenLinks: number;
+        orphans: number;
+        missingTitles: number;
+    };
+    orphans: string[];
+    hubs: HubRank[];
+    brokenLinks: BrokenLink[];
+    lastUpdated: number;
+}
+/**
+ * Compute forward links + broken links from the current index. Backlinks are
+ * already computed by WikiIndexer; we reuse them so the graph is consistent.
+ */
+export declare function buildGraph(index: WikiIndex): WikiGraph;
+/**
+ * Entries with zero incoming and zero outgoing resolved links.
+ * Virtual entries are excluded — they have no body and no `related`, and would
+ * flood the list.
+ */
+export declare function detectOrphans(graph: WikiGraph, entries: WikiEntry[]): string[];
+export declare function detectHubs(graph: WikiGraph, topN?: number): HubRank[];
+export declare function detectDeadEnds(graph: WikiGraph): BrokenLink[];
+/**
+ * Heuristic health score: 100 minus weighted counts of broken links,
+ * orphaned entries, and entries missing titles. Floored at 0.
+ */
+export declare function computeHealth(index: WikiIndex, graph: WikiGraph): WikiHealth;

package/dashboard/dist-server/dashboard/src/server/wiki/graph-analysis.js

@@ -0,0 +1,103 @@
+const LINK_RE = /\[\[([^\]]+)\]\]/g;
+/**
+ * Compute forward links + broken links from the current index. Backlinks are
+ * already computed by WikiIndexer; we reuse them so the graph is consistent.
+ */
+export function buildGraph(index) {
+    const forwardLinks = {};
+    const broken = [];
+    const titleIndex = new Map();
+    for (const d of index.entries)
+        titleIndex.set(d.title.toLowerCase(), d.id);
+    const resolve = (target) => {
+        if (index.byId[target])
+            return target;
+        const hit = titleIndex.get(target.toLowerCase());
+        return hit ?? null;
+    };
+    const pushFwd = (source, targetId) => {
+        if (!forwardLinks[source])
+            forwardLinks[source] = [];
+        if (!forwardLinks[source].includes(targetId))
+            forwardLinks[source].push(targetId);
+    };
+    for (const d of index.entries) {
+        // `related` frontmatter
+        for (const rel of d.related) {
+            const hit = resolve(rel);
+            if (hit)
+                pushFwd(d.id, hit);
+            else
+                broken.push({ sourceId: d.id, target: rel });
+        }
+        // inline body wikilinks
+        if (d.body) {
+            LINK_RE.lastIndex = 0;
+            let m;
+            while ((m = LINK_RE.exec(d.body))) {
+                const hit = resolve(m[1]);
+                if (hit)
+                    pushFwd(d.id, hit);
+                else
+                    broken.push({ sourceId: d.id, target: m[1] });
+            }
+        }
+    }
+    return {
+        forwardLinks,
+        backlinks: index.backlinks,
+        brokenLinks: broken,
+    };
+}
+/**
+ * Entries with zero incoming and zero outgoing resolved links.
+ * Virtual entries are excluded — they have no body and no `related`, and would
+ * flood the list.
+ */
+export function detectOrphans(graph, entries) {
+    const out = [];
+    for (const d of entries) {
+        if (d.source.kind === 'virtual')
+            continue;
+        const outgoing = graph.forwardLinks[d.id]?.length ?? 0;
+        const incoming = graph.backlinks[d.id]?.length ?? 0;
+        if (outgoing === 0 && incoming === 0)
+            out.push(d.id);
+    }
+    return out;
+}
+export function detectHubs(graph, topN = 10) {
+    const ranked = Object.entries(graph.backlinks)
+        .map(([id, sources]) => ({ id, inDegree: sources.length }))
+        .sort((a, b) => b.inDegree - a.inDegree || a.id.localeCompare(b.id));
+    return ranked.slice(0, topN);
+}
+export function detectDeadEnds(graph) {
+    return graph.brokenLinks.slice();
+}
+/**
+ * Heuristic health score: 100 minus weighted counts of broken links,
+ * orphaned entries, and entries missing titles. Floored at 0.
+ */
+export function computeHealth(index, graph) {
+    const orphans = detectOrphans(graph, index.entries);
+    const hubs = detectHubs(graph, 10);
+    const missingTitles = index.entries.filter((d) => d.source.kind === 'file' && (!d.title || d.title === d.id.split('-').slice(1).join('-'))).length;
+    const brokenLinks = graph.brokenLinks;
+    const rawScore = 100 - 2 * brokenLinks.length - 1 * orphans.length - 3 * missingTitles;
+    const score = Math.max(0, Math.min(100, rawScore));
+    return {
+        score,
+        totals: {
+            entries: index.entries.length,
+            brokenLinks: brokenLinks.length,
+            orphans: orphans.length,
+            missingTitles,
+        },
+        orphans,
+        hubs,
+        brokenLinks,
+        lastUpdated: index.generatedAt,
+    };
+}
+//# sourceMappingURL=graph-analysis.js.map

package/dashboard/dist-server/dashboard/src/server/wiki/graph-analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-analysis.js","sourceRoot":"","sources":["../../../../../src/server/wiki/graph-analysis.ts"],"names":[],"mappings":"AAmCA,MAAM,OAAO,GAAG,mBAAmB,CAAC;AAEpC;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,KAAgB;IACzC,MAAM,YAAY,GAA6B,EAAE,CAAC;IAClD,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO;QAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAE3E,MAAM,OAAO,GAAG,CAAC,MAAc,EAAiB,EAAE;QAChD,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC;QACtC,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QACjD,OAAO,GAAG,IAAI,IAAI,CAAC;IACrB,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,CAAC,MAAc,EAAE,QAAgB,EAAE,EAAE;QACnD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;YAAE,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;QACrD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpF,CAAC,CAAC;IAEF,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAC9B,wBAAwB;QACxB,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;YACzB,IAAI,GAAG;gBAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;;gBACvB,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACpD,CAAC;QACD,wBAAwB;QACxB,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACX,OAAO,CAAC,SAAS,GAAG,CAAC,CAAC;YACtB,IAAI,CAAyB,CAAC;YAC9B,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAClC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,GAAG;oBAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;;oBACvB,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,YAAY;QACZ,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,WAAW,EAAE,MAAM;KACpB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAgB,EAAE,OAAoB;IAClE,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS;YAAE,SAAS;QAC1C,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;QACpD,IAAI,QAAQ,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAgB,EAAE,IAAI,GAAG,EAAE;IACpD,MAAM,MAAM,GAAc,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC;SACtD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;SAC1D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACvE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAgB;IAC7C,OAAO,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;AACnC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAgB,EAChB,KAAgB;IAEhB,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACnC,MAAM,aAAa,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAChG,CAAC,MAAM,CAAC;IACT,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC;IAEtC,MAAM,QAAQ,GAAG,GAAG,GAAG,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,GAAG,aAAa,CAAC;IACvF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;IAEnD,OAAO;QACL,KAAK;QACL,MAAM,EAAE;YACN,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM;YAC7B,WAAW,EAAE,WAAW,CAAC,MAAM;YAC/B,OAAO,EAAE,OAAO,CAAC,MAAM;YACvB,aAAa;SACd;QACD,OAAO;QACP,IAAI;QACJ,WAAW;QACX,WAAW,EAAE,KAAK,CAAC,WAAW;KAC/B,CAAC;AACJ,CAAC"}

package/dashboard/dist-server/dashboard/src/server/wiki/search.d.ts

@@ -0,0 +1,29 @@
+import type { WikiEntry } from './wiki-types.js';
+export interface Posting {
+    docId: string;
+    tf: number;
+}
+export interface InvertedIndex {
+    postings: Map<string, Posting[]>;
+    docLengths: Map<string, number>;
+    avgDocLength: number;
+    totalDocs: number;
+}
+export interface SearchResult {
+    docId: string;
+    score: number;
+}
+/**
+ * Tokenize into lowercase terms. Strips non-word chars, drops tokens shorter
+ * than 2 characters, and filters a tiny English stop-word set.
+ *
+ * CJK characters are not split by this regex; callers searching Chinese
+ * corpora should feed substrings directly — ranking is approximate then.
+ */
+export declare function tokenize(text: string): string[];
+export declare function buildInvertedIndex(entries: WikiEntry[]): InvertedIndex;
+/**
+ * BM25 score for a single query against a pre-built inverted index.
+ * Returns results sorted by score descending, limited to `limit`.
+ */
+export declare function searchBM25(index: InvertedIndex, query: string, limit?: number): SearchResult[];

package/dashboard/dist-server/dashboard/src/server/wiki/search.js

@@ -0,0 +1,94 @@
+/**
+ * BM25-lite full-text search.
+ * k1 and b are the standard Lucene defaults. Tweak if ranking feels off.
+ */
+const BM25_K1 = 1.5;
+const BM25_B = 0.75;
+const STOP_WORDS = new Set([
+    'the', 'a', 'an', 'and', 'or', 'of', 'to', 'in', 'on', 'for',
+    'is', 'it', 'with', 'as', 'at', 'by', 'be', 'are', 'was', 'were',
+    'this', 'that', 'from', 'but', 'not',
+]);
+/**
+ * Tokenize into lowercase terms. Strips non-word chars, drops tokens shorter
+ * than 2 characters, and filters a tiny English stop-word set.
+ *
+ * CJK characters are not split by this regex; callers searching Chinese
+ * corpora should feed substrings directly — ranking is approximate then.
+ */
+export function tokenize(text) {
+    if (!text)
+        return [];
+    const out = [];
+    const parts = text.toLowerCase().split(/[^\p{L}\p{N}]+/u);
+    for (const p of parts) {
+        if (p.length < 2)
+            continue;
+        if (STOP_WORDS.has(p))
+            continue;
+        out.push(p);
+    }
+    return out;
+}
+function documentText(entry) {
+    return [
+        entry.title,
+        entry.summary,
+        entry.tags.join(' '),
+        entry.body,
+    ].join(' ');
+}
+export function buildInvertedIndex(entries) {
+    const postings = new Map();
+    const docLengths = new Map();
+    let totalLength = 0;
+    for (const entry of entries) {
+        const tokens = tokenize(documentText(entry));
+        docLengths.set(entry.id, tokens.length);
+        totalLength += tokens.length;
+        const termCounts = new Map();
+        for (const t of tokens)
+            termCounts.set(t, (termCounts.get(t) ?? 0) + 1);
+        for (const [term, tf] of termCounts) {
+            let list = postings.get(term);
+            if (!list) {
+                list = [];
+                postings.set(term, list);
+            }
+            list.push({ docId: entry.id, tf });
+        }
+    }
+    const totalDocs = entries.length;
+    const avgDocLength = totalDocs === 0 ? 0 : totalLength / totalDocs;
+    return { postings, docLengths, avgDocLength, totalDocs };
+}
+/**
+ * BM25 score for a single query against a pre-built inverted index.
+ * Returns results sorted by score descending, limited to `limit`.
+ */
+export function searchBM25(index, query, limit = 50) {
+    const terms = tokenize(query);
+    if (terms.length === 0 || index.totalDocs === 0)
+        return [];
+    const scores = new Map();
+    for (const term of terms) {
+        const postings = index.postings.get(term);
+        if (!postings || postings.length === 0)
+            continue;
+        // BM25 idf: ln(1 + (N - df + 0.5) / (df + 0.5))
+        const df = postings.length;
+        const idf = Math.log(1 + (index.totalDocs - df + 0.5) / (df + 0.5));
+        for (const { docId, tf } of postings) {
+            const dl = index.docLengths.get(docId) ?? 0;
+            const denom = tf + BM25_K1 * (1 - BM25_B + (BM25_B * dl) / (index.avgDocLength || 1));
+            const termScore = idf * ((tf * (BM25_K1 + 1)) / (denom || 1));
+            scores.set(docId, (scores.get(docId) ?? 0) + termScore);
+        }
+    }
+    const ranked = [];
+    for (const [docId, score] of scores)
+        ranked.push({ docId, score });
+    ranked.sort((a, b) => b.score - a.score || a.docId.localeCompare(b.docId));
+    return ranked.slice(0, limit);
+}
+//# sourceMappingURL=search.js.map

package/dashboard/dist-server/dashboard/src/server/wiki/search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../../../../src/server/wiki/search.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,MAAM,OAAO,GAAG,GAAG,CAAC;AACpB,MAAM,MAAM,GAAG,IAAI,CAAC;AAEpB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;IAC5D,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IAChE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK;CACrC,CAAC,CAAC;AAmBH;;;;;;GAMG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAC1D,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,SAAS;QAC3B,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAChC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,YAAY,CAAC,KAAgB;IACpC,OAAO;QACL,KAAK,CAAC,KAAK;QACX,KAAK,CAAC,OAAO;QACb,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;QACpB,KAAK,CAAC,IAAI;KACX,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACd,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,OAAoB;IACrD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC9C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACxC,WAAW,IAAI,MAAM,CAAC,MAAM,CAAC;QAE7B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAExE,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC;YACpC,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,EAAE,CAAC;gBACV,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC3B,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC;IACjC,MAAM,YAAY,GAAG,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC;IAEnE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC;AAC3D,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,KAAoB,EACpB,KAAa,EACb,KAAK,GAAG,EAAE;IAEV,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC9B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEjD,gDAAgD;QAChD,MAAM,EAAE,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,SAAS,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;QAEpE,KAAK,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,QAAQ,EAAE,CAAC;YACrC,MAAM,EAAE,GAAG,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAmB,EAAE,CAAC;IAClC,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM;QAAE,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IACnE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3E,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AAChC,CAAC"}

package/dashboard/dist-server/dashboard/src/server/wiki/stress.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dashboard/dist-server/dashboard/src/server/wiki/stress.test.js

@@ -0,0 +1,245 @@
+import { describe, it, expect } from 'vitest';
+import { buildInvertedIndex, searchBM25, tokenize } from './search.js';
+import { buildGraph, detectOrphans, detectHubs, computeHealth } from './graph-analysis.js';
+// ---------------------------------------------------------------------------
+// Stress tests for BM25 search and graph analysis at scale.
+// No file I/O — these exercise the pure functions with synthetic corpora.
+// ---------------------------------------------------------------------------
+function makeEntry(id, title, body, related = [], tags = []) {
+    return {
+        id,
+        type: 'spec',
+        title,
+        summary: '',
+        tags,
+        status: 'active',
+        created: '',
+        updated: '',
+        phaseRef: null,
+        related,
+        source: { kind: 'file', path: `specs/${id}.md` },
+        body,
+        ext: {},
+    };
+}
+function makeIndex(entries) {
+    const byId = {};
+    const byType = {
+        project: [],
+        roadmap: [],
+        spec: [],
+        phase: [],
+        issue: [],
+        lesson: [],
+        memory: [],
+        note: [],
+    };
+    const backlinks = {};
+    for (const e of entries) {
+        byId[e.id] = e;
+        byType[e.type].push(e);
+    }
+    // compute naive backlinks mirror of what WikiIndexer would produce
+    for (const e of entries) {
+        const linkRe = /\[\[([^\]]+)\]\]/g;
+        let m;
+        while ((m = linkRe.exec(e.body))) {
+            const target = m[1];
+            if (byId[target]) {
+                if (!backlinks[target])
+                    backlinks[target] = [];
+                if (!backlinks[target].includes(e.id))
+                    backlinks[target].push(e.id);
+            }
+        }
+        for (const rel of e.related) {
+            if (byId[rel]) {
+                if (!backlinks[rel])
+                    backlinks[rel] = [];
+                if (!backlinks[rel].includes(e.id))
+                    backlinks[rel].push(e.id);
+            }
+        }
+    }
+    return { entries, byId, byType, backlinks, generatedAt: Date.now() };
+}
+// ---------------------------------------------------------------------------
+// BM25 stress
+// ---------------------------------------------------------------------------
+describe('BM25 stress — 2000-doc corpus', () => {
+    const VOCAB = [
+        'authentication', 'session', 'token', 'cookie', 'database', 'cache',
+        'redis', 'postgres', 'migration', 'schema', 'index', 'query', 'plan',
+        'performance', 'latency', 'memory', 'cpu', 'network', 'io', 'disk',
+        'http', 'grpc', 'websocket', 'api', 'route', 'middleware', 'guard',
+        'validation', 'serializer', 'parser', 'tokenizer', 'lexer', 'compiler',
+        'interpreter', 'runtime', 'gc', 'heap', 'stack', 'thread', 'process',
+    ];
+    function synthBody(seed) {
+        const parts = [];
+        for (let i = 0; i < 60; i++) {
+            parts.push(VOCAB[(seed * 31 + i * 7) % VOCAB.length]);
+        }
+        return parts.join(' ');
+    }
+    function synthTitle(seed) {
+        const a = VOCAB[seed % VOCAB.length];
+        const b = VOCAB[(seed * 3 + 1) % VOCAB.length];
+        return `${a} ${b}`;
+    }
+    const corpus = [];
+    for (let i = 0; i < 2000; i++) {
+        corpus.push(makeEntry(`spec-${i}`, synthTitle(i), synthBody(i)));
+    }
+    // Inject a canonical "authentication tutorial" entry that should win q=authentication
+    corpus.push(makeEntry('spec-canonical-auth', 'Authentication Tutorial', 'Full guide to authentication with sessions, tokens, cookies and bearer flows.', [], ['security']));
+    it('builds inverted index in under 200ms', () => {
+        const t0 = Date.now();
+        const inv = buildInvertedIndex(corpus);
+        const ms = Date.now() - t0;
+        expect(inv.totalDocs).toBe(2001);
+        expect(inv.postings.size).toBeGreaterThan(0);
+        expect(ms).toBeLessThan(500); // generous upper bound for CI
+    });
+    it('single-term query over 2000 docs returns results in <50ms', () => {
+        const inv = buildInvertedIndex(corpus);
+        const t0 = Date.now();
+        const results = searchBM25(inv, 'authentication', 20);
+        const ms = Date.now() - t0;
+        expect(results.length).toBeGreaterThan(0);
+        expect(ms).toBeLessThan(100);
+    });
+    it('canonical title-match entry ranks in top-3 for q=authentication', () => {
+        const inv = buildInvertedIndex(corpus);
+        const results = searchBM25(inv, 'authentication tutorial', 10);
+        const top = results.slice(0, 3).map((r) => r.docId);
+        expect(top).toContain('spec-canonical-auth');
+    });
+    it('multi-term query rewards docs with more matching terms', () => {
+        const inv = buildInvertedIndex(corpus);
+        const results = searchBM25(inv, 'authentication session token', 10);
+        expect(results.length).toBeGreaterThan(0);
+        // Scores should be monotonically decreasing
+        for (let i = 1; i < results.length; i++) {
+            expect(results[i - 1].score).toBeGreaterThanOrEqual(results[i].score);
+        }
+    });
+    it('stop-word-only query returns empty', () => {
+        const inv = buildInvertedIndex(corpus);
+        expect(searchBM25(inv, 'the and or a an')).toEqual([]);
+    });
+    it('unknown-term query returns empty', () => {
+        const inv = buildInvertedIndex(corpus);
+        expect(searchBM25(inv, 'zzzxxxyyyqqq')).toEqual([]);
+    });
+    it('score stability — same corpus twice yields identical top-10', () => {
+        const inv1 = buildInvertedIndex(corpus);
+        const inv2 = buildInvertedIndex(corpus);
+        const r1 = searchBM25(inv1, 'session token', 10);
+        const r2 = searchBM25(inv2, 'session token', 10);
+        expect(r1.map((r) => r.docId)).toEqual(r2.map((r) => r.docId));
+        expect(r1.map((r) => r.score)).toEqual(r2.map((r) => r.score));
+    });
+    it('tokenize handles Unicode letters and numbers', () => {
+        expect(tokenize('Hello Wörld 123 foo42bar')).toEqual([
+            'hello',
+            'wörld',
+            '123',
+            'foo42bar',
+        ]);
+    });
+    it('tokenize drops stop words and sub-2-char tokens', () => {
+        expect(tokenize('a The an Quick I am')).toEqual(['quick', 'am']);
+    });
+});
+// ---------------------------------------------------------------------------
+// Graph stress
+// ---------------------------------------------------------------------------
+describe('graph-analysis stress — dense 500-doc graph', () => {
+    // Build a ring + hub topology: every node links to the next, and everyone
+    // links to spec-hub. Expect spec-hub to dominate inDegree.
+    const N = 500;
+    const entries = [];
+    entries.push(makeEntry('spec-hub', 'Central Hub', 'Nothing outgoing.'));
+    for (let i = 0; i < N; i++) {
+        const next = `spec-${(i + 1) % N}`;
+        entries.push(makeEntry(`spec-${i}`, `Node ${i}`, `Links [[${next}]] and [[spec-hub]] and [[spec-missing-${i}]].`));
+    }
+    const index = makeIndex(entries);
+    it('builds graph in <100ms', () => {
+        const t0 = Date.now();
+        const g = buildGraph(index);
+        const ms = Date.now() - t0;
+        expect(g.forwardLinks['spec-0']).toContain('spec-hub');
+        expect(ms).toBeLessThan(200);
+    });
+    it('hub dominates inDegree ranking', () => {
+        const g = buildGraph(index);
+        const hubs = detectHubs(g, 5);
+        expect(hubs[0].id).toBe('spec-hub');
+        expect(hubs[0].inDegree).toBe(N);
+    });
+    it('reports N broken links (one per node)', () => {
+        const g = buildGraph(index);
+        expect(g.brokenLinks.length).toBe(N);
+        // every broken link target begins with `spec-missing-`
+        for (const b of g.brokenLinks) {
+            expect(b.target.startsWith('spec-missing-')).toBe(true);
+        }
+    });
+    it('detects no orphans in a fully-connected ring', () => {
+        const g = buildGraph(index);
+        const orphans = detectOrphans(g, index.entries);
+        // spec-hub has incoming but no outgoing → not orphan (incoming > 0)
+        // every ring node has both → not orphan
+        expect(orphans).toEqual([]);
+    });
+    it('health score floored at 0 when broken links exceed 50', () => {
+        const g = buildGraph(index);
+        const health = computeHealth(index, g);
+        // 500 broken * 2 = 1000 penalty → score = max(0, 100 - 1000) = 0
+        expect(health.score).toBe(0);
+        expect(health.totals.brokenLinks).toBe(N);
+        expect(health.totals.entries).toBe(N + 1);
+    });
+});
+describe('graph-analysis stress — disconnected islands', () => {
+    // Two disjoint cliques, plus 20 isolated orphans.
+    const entries = [];
+    // Clique A: 5 nodes, fully connected
+    for (let i = 0; i < 5; i++) {
+        const links = Array.from({ length: 5 }, (_, j) => j)
+            .filter((j) => j !== i)
+            .map((j) => `[[spec-a${j}]]`)
+            .join(' ');
+        entries.push(makeEntry(`spec-a${i}`, `A${i}`, links));
+    }
+    // Clique B: 5 nodes, fully connected
+    for (let i = 0; i < 5; i++) {
+        const links = Array.from({ length: 5 }, (_, j) => j)
+            .filter((j) => j !== i)
+            .map((j) => `[[spec-b${j}]]`)
+            .join(' ');
+        entries.push(makeEntry(`spec-b${i}`, `B${i}`, links));
+    }
+    // 20 orphans
+    for (let i = 0; i < 20; i++) {
+        entries.push(makeEntry(`spec-orph${i}`, `Orph${i}`, 'body with no links'));
+    }
+    const index = makeIndex(entries);
+    it('detects all 20 orphans exactly', () => {
+        const g = buildGraph(index);
+        const orphans = detectOrphans(g, index.entries);
+        expect(orphans.length).toBe(20);
+        for (const id of orphans) {
+            expect(id.startsWith('spec-orph')).toBe(true);
+        }
+    });
+    it('cliques have equal inDegree = 4', () => {
+        const g = buildGraph(index);
+        const hubs = detectHubs(g, 10);
+        const cliqueNodes = hubs.filter((h) => h.inDegree === 4);
+        expect(cliqueNodes.length).toBe(10); // 5 + 5 clique members
+    });
+});
+//# sourceMappingURL=stress.test.js.map

package/dashboard/dist-server/dashboard/src/server/wiki/stress.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stress.test.js","sourceRoot":"","sources":["../../../../../src/server/wiki/stress.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE9C,OAAO,EAAE,kBAAkB,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvE,OAAO,EAAE,UAAU,EAAE,aAAa,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAG3F,8EAA8E;AAC9E,4DAA4D;AAC5D,0EAA0E;AAC1E,8EAA8E;AAE9E,SAAS,SAAS,CAChB,EAAU,EACV,KAAa,EACb,IAAY,EACZ,UAAoB,EAAE,EACtB,OAAiB,EAAE;IAEnB,OAAO;QACL,EAAE;QACF,IAAI,EAAE,MAAsB;QAC5B,KAAK;QACL,OAAO,EAAE,EAAE;QACX,IAAI;QACJ,MAAM,EAAE,QAAQ;QAChB,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,EAAE;QACX,QAAQ,EAAE,IAAI;QACd,OAAO;QACP,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE;QAChD,IAAI;QACJ,GAAG,EAAE,EAAE;KACR,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,OAAoB;IACrC,MAAM,IAAI,GAA8B,EAAE,CAAC;IAC3C,MAAM,MAAM,GAAG;QACb,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,EAAE;QACX,IAAI,EAAE,EAAE;QACR,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;QACT,MAAM,EAAE,EAAE;QACV,MAAM,EAAE,EAAE;QACV,IAAI,EAAE,EAAE;KACc,CAAC;IACzB,MAAM,SAAS,GAA6B,EAAE,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;QACf,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,mEAAmE;IACnE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,MAAM,MAAM,GAAG,mBAAmB,CAAC;QACnC,IAAI,CAAyB,CAAC;QAC9B,OAAO,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;oBAAE,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;gBAC/C,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;YAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACd,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC;oBAAE,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;gBACzC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,WAAW,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;AACvE,CAAC;AAED,8EAA8E;AAC9E,cAAc;AACd,8EAA8E;AAE9E,QAAQ,CAAC,+BAA+B,EAAE,GAAG,EAAE;IAC7C,MAAM,KAAK,GAAG;QACZ,gBAAgB,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO;QACnE,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM;QACpE,aAAa,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM;QAClE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO;QAClE,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,EAAE,UAAU;QACtE,aAAa,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,SAAS;KACrE,CAAC;IAEF,SAAS,SAAS,CAAC,IAAY;QAC7B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,SAAS,UAAU,CAAC,IAAY;QAC9B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC/C,OAAO,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;IACrB,CAAC;IAED,MAAM,MAAM,GAAgB,EAAE,CAAC;IAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,sFAAsF;IACtF,MAAM,CAAC,IAAI,CACT,SAAS,CACP,qBAAqB,EACrB,yBAAyB,EACzB,+EAA+E,EAC/E,EAAE,EACF,CAAC,UAAU,CAAC,CACb,CACF,CAAC;IAEF,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,8BAA8B;IAC9D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE,gBAAgB,EAAE,EAAE,CAAC,CAAC;QACtD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC3B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;QACzE,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE,yBAAyB,EAAE,EAAE,CAAC,CAAC;QAC/D,MAAM,GAAG,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAE,8BAA8B,EAAE,EAAE,CAAC,CAAC;QACpE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC1C,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QACxE,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACvC,MAAM,CAAC,UAAU,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACrE,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,eAAe,EAAE,EAAE,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,eAAe,EAAE,EAAE,CAAC,CAAC;QACjD,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,QAAQ,CAAC,0BAA0B,CAAC,CAAC,CAAC,OAAO,CAAC;YACnD,OAAO;YACP,OAAO;YACP,KAAK;YACL,UAAU;SACX,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E,QAAQ,CAAC,6CAA6C,EAAE,GAAG,EAAE;IAC3D,0EAA0E;IAC1E,2DAA2D;IAC3D,MAAM,CAAC,GAAG,GAAG,CAAC;IACd,MAAM,OAAO,GAAgB,EAAE,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,aAAa,EAAE,mBAAmB,CAAC,CAAC,CAAC;IACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACnC,OAAO,CAAC,IAAI,CACV,SAAS,CACP,QAAQ,CAAC,EAAE,EACX,QAAQ,CAAC,EAAE,EACX,WAAW,IAAI,0CAA0C,CAAC,KAAK,CAChE,CACF,CAAC;IACJ,CAAC;IACD,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAEjC,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC;QAC3B,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACvD,MAAM,CAAC,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,uDAAuD;QACvD,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;YAC9B,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAChD,oEAAoE;QACpE,wCAAwC;QACxC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,aAAa,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACvC,iEAAiE;QACjE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,8CAA8C,EAAE,GAAG,EAAE;IAC5D,kDAAkD;IAClD,MAAM,OAAO,GAAgB,EAAE,CAAC;IAChC,qCAAqC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aACjD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;aACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC;aAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,qCAAqC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;aACjD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;aACtB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC;aAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,aAAa;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,oBAAoB,CAAC,CAAC,CAAC;IAC7E,CAAC;IACD,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAEjC,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;QAChD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;YACzB,MAAM,CAAC,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,uBAAuB;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dashboard/dist-server/dashboard/src/server/wiki/virtual-wiki-adapters.d.ts

@@ -0,0 +1,4 @@
+import type { WikiEntry } from './wiki-types.js';
+export declare function adaptIssueRow(row: unknown, sourcePath: string, line: number): WikiEntry | null;
+export declare function adaptLessonRow(row: unknown, sourcePath: string, line: number): WikiEntry | null;
+export declare function loadVirtualEntries(absPath: string, kind: 'issue' | 'lesson', relPath: string): Promise<WikiEntry[]>;