ori-memory 0.2.0

package/dist/core/importance.d.ts

@@ -0,0 +1,49 @@
+import Graph from "graphology";
+import type { LinkGraph } from "./graph.js";
+export interface CommunityInfo {
+    size: number;
+    members: string[];
+    meanVitality?: number;
+    freshness?: number;
+}
+export interface GraphMetrics {
+    pagerank: Map<string, number>;
+    communities: Map<string, number>;
+    bridges: Set<string>;
+    betweenness: Map<string, number>;
+    communityStats: Map<number, CommunityInfo>;
+}
+export interface NoteIndex {
+    frontmatter: Map<string, Record<string, unknown>>;
+}
+/**
+ * Convert the simple LinkGraph from graph.ts into a graphology DirectedGraph.
+ */
+export declare function buildGraphologyGraph(linkGraph: LinkGraph): Graph;
+/**
+ * Compute PageRank scores for all nodes.
+ */
+export declare function computePageRank(graph: Graph, alpha?: number): Map<string, number>;
+/**
+ * Detect communities using Louvain algorithm.
+ */
+export declare function detectCommunities(graph: Graph): Map<string, number>;
+/**
+ * Find bridge notes: articulation points + high-degree hubs + map notes + cross-project connectors.
+ * Uses a simplified Tarjan's algorithm for articulation points.
+ */
+export declare function findBridgeNotes(graph: Graph, noteIndex?: NoteIndex): Set<string>;
+/**
+ * Compute betweenness centrality for all nodes.
+ */
+export declare function computeBetweenness(graph: Graph): Map<string, number>;
+/**
+ * Compute all graph metrics in one pass.
+ */
+export declare function computeGraphMetrics(linkGraph: LinkGraph, noteIndex?: NoteIndex): GraphMetrics;
+/**
+ * Personalized PageRank from seed nodes.
+ * Used for query-time graph traversal (Signal 3 in the retrieval pipeline).
+ */
+export declare function personalizedPageRank(graph: Graph, seeds: string[], alpha?: number, iterations?: number): Map<string, number>;
+//# sourceMappingURL=importance.d.ts.map

package/dist/core/importance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"importance.d.ts","sourceRoot":"","sources":["../../src/core/importance.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,YAAY,CAAC;AAI/B,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;CAC5C;AAED,MAAM,WAAW,SAAS;IACxB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;CACnD;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,SAAS,EAAE,SAAS,GAAG,KAAK,CA0BhE;AAED;;GAEG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,KAAK,EACZ,KAAK,GAAE,MAAa,GACnB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAOrB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAoBnE;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,KAAK,EACZ,SAAS,CAAC,EAAE,SAAS,GACpB,GAAG,CAAC,MAAM,CAAC,CAuFb;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAOpE;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,SAAS,EAAE,SAAS,EACpB,SAAS,CAAC,EAAE,SAAS,GACpB,YAAY,CAmBd;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,KAAK,EACZ,KAAK,EAAE,MAAM,EAAE,EACf,KAAK,GAAE,MAAa,EACpB,UAAU,GAAE,MAAW,GACtB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA4CrB"}

package/dist/core/importance.js

@@ -0,0 +1,230 @@
+import Graph from "graphology";
+import pagerank from "graphology-metrics/centrality/pagerank.js";
+import betweennessCentrality from "graphology-metrics/centrality/betweenness.js";
+import louvain from "graphology-communities-louvain";
+/**
+ * Convert the simple LinkGraph from graph.ts into a graphology DirectedGraph.
+ */
+export function buildGraphologyGraph(linkGraph) {
+    const graph = new Graph({ type: "directed", multi: false });
+    // Add all nodes (from both outgoing keys and incoming keys)
+    const allNodes = new Set();
+    for (const key of linkGraph.outgoing.keys())
+        allNodes.add(key);
+    for (const key of linkGraph.incoming.keys())
+        allNodes.add(key);
+    // Also add targets that might only appear as targets
+    for (const targets of linkGraph.outgoing.values()) {
+        for (const t of targets)
+            allNodes.add(t);
+    }
+    for (const node of allNodes) {
+        if (!graph.hasNode(node))
+            graph.addNode(node);
+    }
+    // Add edges
+    for (const [source, targets] of linkGraph.outgoing) {
+        for (const target of targets) {
+            if (!graph.hasEdge(source, target)) {
+                graph.addEdge(source, target);
+            }
+        }
+    }
+    return graph;
+}
+/**
+ * Compute PageRank scores for all nodes.
+ */
+export function computePageRank(graph, alpha = 0.85) {
+    const scores = pagerank(graph, { alpha, getEdgeWeight: null });
+    const result = new Map();
+    graph.forEachNode((node) => {
+        result.set(node, scores[node] ?? 0);
+    });
+    return result;
+}
+/**
+ * Detect communities using Louvain algorithm.
+ */
+export function detectCommunities(graph) {
+    // Louvain needs undirected — create undirected copy
+    const undirected = new Graph({ type: "undirected", multi: false });
+    graph.forEachNode((node) => {
+        if (!undirected.hasNode(node))
+            undirected.addNode(node);
+    });
+    graph.forEachEdge((_edge, _attrs, source, target) => {
+        if (!undirected.hasNode(source))
+            undirected.addNode(source);
+        if (!undirected.hasNode(target))
+            undirected.addNode(target);
+        if (source !== target && !undirected.hasEdge(source, target)) {
+            undirected.addEdge(source, target);
+        }
+    });
+    const communities = louvain(undirected);
+    const result = new Map();
+    for (const [node, community] of Object.entries(communities)) {
+        result.set(node, community);
+    }
+    return result;
+}
+/**
+ * Find bridge notes: articulation points + high-degree hubs + map notes + cross-project connectors.
+ * Uses a simplified Tarjan's algorithm for articulation points.
+ */
+export function findBridgeNotes(graph, noteIndex) {
+    const bridges = new Set();
+    // 1. Tarjan's algorithm for articulation points on undirected view
+    const visited = new Set();
+    const disc = new Map();
+    const low = new Map();
+    const parent = new Map();
+    let timer = 0;
+    function dfs(u) {
+        visited.add(u);
+        disc.set(u, timer);
+        low.set(u, timer);
+        timer++;
+        let children = 0;
+        // Get neighbors (both directions for undirected view)
+        const neighbors = new Set();
+        graph.forEachOutNeighbor(u, (n) => neighbors.add(n));
+        graph.forEachInNeighbor(u, (n) => neighbors.add(n));
+        for (const v of neighbors) {
+            if (!visited.has(v)) {
+                children++;
+                parent.set(v, u);
+                dfs(v);
+                low.set(u, Math.min(low.get(u), low.get(v)));
+                // u is an articulation point if:
+                // 1. u is root of DFS tree and has 2+ children
+                if (parent.get(u) === null && children > 1) {
+                    bridges.add(u);
+                }
+                // 2. u is not root and low[v] >= disc[u]
+                if (parent.get(u) !== null && low.get(v) >= disc.get(u)) {
+                    bridges.add(u);
+                }
+            }
+            else if (v !== parent.get(u)) {
+                low.set(u, Math.min(low.get(u), disc.get(v)));
+            }
+        }
+    }
+    graph.forEachNode((node) => {
+        if (!visited.has(node)) {
+            parent.set(node, null);
+            dfs(node);
+        }
+    });
+    // 2. High-degree hubs: in_degree > 2x median
+    const inDegrees = [];
+    graph.forEachNode((node) => {
+        inDegrees.push(graph.inDegree(node));
+    });
+    inDegrees.sort((a, b) => a - b);
+    const median = inDegrees.length > 0
+        ? inDegrees[Math.floor(inDegrees.length / 2)]
+        : 0;
+    const hubThreshold = median * 2;
+    graph.forEachNode((node) => {
+        if (graph.inDegree(node) > hubThreshold && hubThreshold > 0) {
+            bridges.add(node);
+        }
+    });
+    // 3. Map notes (title ends with " map")
+    graph.forEachNode((node) => {
+        if (node.endsWith(" map") || node === "index") {
+            bridges.add(node);
+        }
+    });
+    // 4. Cross-project connectors (2+ project tags AND in_degree >= 3)
+    if (noteIndex) {
+        for (const [title, fm] of noteIndex.frontmatter) {
+            const project = Array.isArray(fm.project) ? fm.project : [];
+            if (project.length >= 2 && graph.hasNode(title) && graph.inDegree(title) >= 3) {
+                bridges.add(title);
+            }
+        }
+    }
+    return bridges;
+}
+/**
+ * Compute betweenness centrality for all nodes.
+ */
+export function computeBetweenness(graph) {
+    const scores = betweennessCentrality(graph);
+    const result = new Map();
+    graph.forEachNode((node) => {
+        result.set(node, scores[node] ?? 0);
+    });
+    return result;
+}
+/**
+ * Compute all graph metrics in one pass.
+ */
+export function computeGraphMetrics(linkGraph, noteIndex) {
+    const graph = buildGraphologyGraph(linkGraph);
+    const pr = computePageRank(graph);
+    const communities = detectCommunities(graph);
+    const bridges = findBridgeNotes(graph, noteIndex);
+    const betweenness = computeBetweenness(graph);
+    // Build community stats
+    const communityStats = new Map();
+    for (const [node, communityId] of communities) {
+        if (!communityStats.has(communityId)) {
+            communityStats.set(communityId, { size: 0, members: [] });
+        }
+        const stat = communityStats.get(communityId);
+        stat.size++;
+        stat.members.push(node);
+    }
+    return { pagerank: pr, communities, bridges, betweenness, communityStats };
+}
+/**
+ * Personalized PageRank from seed nodes.
+ * Used for query-time graph traversal (Signal 3 in the retrieval pipeline).
+ */
+export function personalizedPageRank(graph, seeds, alpha = 0.85, iterations = 20) {
+    const N = graph.order;
+    if (N === 0)
+        return new Map();
+    // Initialize: seed nodes get equal personalization weight
+    const personalization = new Map();
+    const validSeeds = seeds.filter((s) => graph.hasNode(s));
+    if (validSeeds.length === 0) {
+        // Fallback to uniform
+        graph.forEachNode((node) => personalization.set(node, 1 / N));
+    }
+    else {
+        graph.forEachNode((node) => personalization.set(node, 0));
+        for (const seed of validSeeds) {
+            personalization.set(seed, 1 / validSeeds.length);
+        }
+    }
+    // Power iteration
+    let scores = new Map(personalization);
+    for (let iter = 0; iter < iterations; iter++) {
+        const newScores = new Map();
+        graph.forEachNode((node) => newScores.set(node, 0));
+        graph.forEachNode((node) => {
+            const outDeg = graph.outDegree(node);
+            if (outDeg === 0)
+                return;
+            const share = (scores.get(node) ?? 0) / outDeg;
+            graph.forEachOutNeighbor(node, (neighbor) => {
+                newScores.set(neighbor, (newScores.get(neighbor) ?? 0) + share);
+            });
+        });
+        // Apply damping + personalization restart
+        graph.forEachNode((node) => {
+            const dampedScore = alpha * (newScores.get(node) ?? 0);
+            const restart = (1 - alpha) * (personalization.get(node) ?? 0);
+            newScores.set(node, dampedScore + restart);
+        });
+        scores = newScores;
+    }
+    return scores;
+}
+//# sourceMappingURL=importance.js.map

package/dist/core/importance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"importance.js","sourceRoot":"","sources":["../../src/core/importance.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,YAAY,CAAC;AAC/B,OAAO,QAAQ,MAAM,2CAA2C,CAAC;AACjE,OAAO,qBAAqB,MAAM,8CAA8C,CAAC;AACjF,OAAO,OAAO,MAAM,gCAAgC,CAAC;AAsBrD;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,SAAoB;IACvD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IAE5D,4DAA4D;IAC5D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,GAAG,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE;QAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/D,KAAK,MAAM,GAAG,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE;QAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/D,qDAAqD;IACrD,KAAK,MAAM,OAAO,IAAI,SAAS,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QAClD,KAAK,MAAM,CAAC,IAAI,OAAO;YAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,YAAY;IACZ,KAAK,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;QACnD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;gBACnC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAY,EACZ,QAAgB,IAAI;IAEpB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAY;IAC5C,oDAAoD;IACpD,MAAM,UAAU,GAAG,IAAI,KAAK,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;IACnE,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC;YAAE,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IACH,KAAK,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;QAClD,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5D,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5D,IAAI,MAAM,KAAK,MAAM,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC;YAC7D,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACrC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,SAAmB,CAAC,CAAC;IACxC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAY,EACZ,SAAqB;IAErB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,mEAAmE;IACnE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAChD,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,SAAS,GAAG,CAAC,CAAS;QACpB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACnB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAClB,KAAK,EAAE,CAAC;QACR,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,sDAAsD;QACtD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,KAAK,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,KAAK,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEpD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpB,QAAQ,EAAE,CAAC;gBACX,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACjB,GAAG,CAAC,CAAC,CAAC,CAAC;gBAEP,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAE/C,iCAAiC;gBACjC,+CAA+C;gBAC/C,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;oBAC3C,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC;gBACD,yCAAyC;gBACzC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,CAAC;oBAC1D,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC;iBAAM,IAAI,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/B,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACvB,GAAG,CAAC,IAAI,CAAC,CAAC;QACZ,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,6CAA6C;IAC7C,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IACH,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChC,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC;QACjC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC,CAAC;IACN,MAAM,YAAY,GAAG,MAAM,GAAG,CAAC,CAAC;IAEhC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,YAAY,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;YAC5D,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,wCAAwC;IACxC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,IAAI,KAAK,OAAO,EAAE,CAAC;YAC9C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,mEAAmE;IACnE,IAAI,SAAS,EAAE,CAAC;QACd,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;YAChD,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5D,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9E,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAY;IAC7C,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;QACzB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,SAAoB,EACpB,SAAqB;IAErB,MAAM,KAAK,GAAG,oBAAoB,CAAC,SAAS,CAAC,CAAC;IAC9C,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,WAAW,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAClD,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;IAE9C,wBAAwB;IACxB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAyB,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,WAAW,EAAE,CAAC;QAC9C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACrC,cAAc,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5D,CAAC;QACD,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;QAC9C,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,CAAC;AAC7E,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAY,EACZ,KAAe,EACf,QAAgB,IAAI,EACpB,aAAqB,EAAE;IAEvB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC;IACtB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,GAAG,EAAE,CAAC;IAE9B,0DAA0D;IAC1D,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,sBAAsB;QACtB,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1D,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,kBAAkB;IAClB,IAAI,MAAM,GAAG,IAAI,GAAG,CAAiB,eAAe,CAAC,CAAC;IAEtD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAEpD,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;YACzB,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACrC,IAAI,MAAM,KAAK,CAAC;gBAAE,OAAO;YACzB,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;YAC/C,KAAK,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,EAAE;gBAC1C,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;YAClE,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,0CAA0C;QAC1C,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,EAAE;YACzB,MAAM,WAAW,GAAG,KAAK,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACvD,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/D,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,GAAG,OAAO,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,MAAM,GAAG,SAAS,CAAC;IACrB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/core/intent.d.ts

@@ -0,0 +1,36 @@
+export type QueryIntent = "episodic" | "procedural" | "semantic" | "decision";
+export interface SpaceWeights {
+    text: number;
+    temporal: number;
+    vitality: number;
+    importance: number;
+    type: number;
+    community: number;
+}
+export interface SplitWeights {
+    title: number;
+    description: number;
+    body: number;
+}
+export interface ClassifiedQuery {
+    intent: QueryIntent;
+    confidence: number;
+    query: string;
+    entities: string[];
+    spaceWeights: SpaceWeights;
+    splitWeights: SplitWeights;
+}
+/**
+ * Classify query intent using heuristic pattern matching.
+ * Returns classified query with weight profiles for the retrieval engine.
+ */
+export declare function classifyIntent(query: string, noteIndex?: string[]): ClassifiedQuery;
+/**
+ * Get space weight profile for a given intent.
+ */
+export declare function getSpaceWeights(intent: QueryIntent): SpaceWeights;
+/**
+ * Get split vector weight profile for a given intent.
+ */
+export declare function getSplitWeights(intent: QueryIntent): SplitWeights;
+//# sourceMappingURL=intent.d.ts.map

package/dist/core/intent.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent.d.ts","sourceRoot":"","sources":["../../src/core/intent.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,YAAY,GAAG,UAAU,GAAG,UAAU,CAAC;AAE9E,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,eAAe;IAC9B,MAAM,EAAE,WAAW,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,YAAY,EAAE,YAAY,CAAC;IAC3B,YAAY,EAAE,YAAY,CAAC;CAC5B;AA8ED;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,MAAM,EACb,SAAS,GAAE,MAAM,EAAO,GACvB,eAAe,CAuBjB;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,WAAW,GAAG,YAAY,CAEjE;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,WAAW,GAAG,YAAY,CAEjE"}

package/dist/core/intent.js

@@ -0,0 +1,108 @@
+const INTENT_PATTERNS = [
+    {
+        intent: "episodic",
+        patterns: [
+            /\bwhen\s+did\b/i,
+            /\blast\s+time\b/i,
+            /\bwhat\s+happened\b/i,
+            /\brecently\b/i,
+            /\bhistory\s+of\b/i,
+            /\btimeline\b/i,
+            /\bwhen\s+was\b/i,
+            /\bremember\s+when\b/i,
+        ],
+    },
+    {
+        intent: "procedural",
+        patterns: [
+            /\bhow\s+to\b/i,
+            /\bsteps?\s+for\b/i,
+            /\bprocess\b/i,
+            /\bprocedure\b/i,
+            /\binstructions?\b/i,
+            /\bworkflow\b/i,
+            /\bhow\s+do\b/i,
+            /\bguide\b/i,
+        ],
+    },
+    {
+        intent: "decision",
+        patterns: [
+            /\bwhy\s+did\s+we\b/i,
+            /\bdecision\b/i,
+            /\bchose\b/i,
+            /\bchoose\b/i,
+            /\balternatives?\b/i,
+            /\btrade-?off\b/i,
+            /\brationale\b/i,
+            /\bdecided\b/i,
+        ],
+    },
+    // semantic is the default — no specific patterns needed
+];
+const SPACE_WEIGHTS = {
+    episodic: { text: 0.40, temporal: 0.25, vitality: 0.15, importance: 0.05, type: 0.05, community: 0.10 },
+    procedural: { text: 0.30, temporal: 0.05, vitality: 0.10, importance: 0.30, type: 0.10, community: 0.15 },
+    semantic: { text: 0.65, temporal: 0.05, vitality: 0.10, importance: 0.10, type: 0.05, community: 0.05 },
+    decision: { text: 0.30, temporal: 0.15, vitality: 0.10, importance: 0.10, type: 0.30, community: 0.05 },
+};
+const SPLIT_WEIGHTS = {
+    semantic: { title: 0.5, description: 0.3, body: 0.2 },
+    episodic: { title: 0.2, description: 0.2, body: 0.6 },
+    decision: { title: 0.4, description: 0.4, body: 0.2 },
+    procedural: { title: 0.3, description: 0.3, body: 0.4 },
+};
+/**
+ * Extract note title entities from query by fuzzy matching against known titles.
+ */
+function extractEntities(query, noteIndex) {
+    const queryLower = query.toLowerCase();
+    const entities = [];
+    for (const title of noteIndex) {
+        const titleLower = title.toLowerCase();
+        // Direct substring match
+        if (queryLower.includes(titleLower) && titleLower.length >= 3) {
+            entities.push(title);
+        }
+    }
+    // Sort by length descending (prefer longer/more specific matches)
+    return entities.sort((a, b) => b.length - a.length);
+}
+/**
+ * Classify query intent using heuristic pattern matching.
+ * Returns classified query with weight profiles for the retrieval engine.
+ */
+export function classifyIntent(query, noteIndex = []) {
+    let bestIntent = "semantic"; // default
+    let bestScore = 0;
+    for (const { intent, patterns } of INTENT_PATTERNS) {
+        const matchCount = patterns.filter((p) => p.test(query)).length;
+        if (matchCount > bestScore) {
+            bestScore = matchCount;
+            bestIntent = intent;
+        }
+    }
+    const confidence = bestScore >= 2 ? 1.0 : bestScore === 1 ? 0.7 : 0.5;
+    const entities = extractEntities(query, noteIndex);
+    return {
+        intent: bestIntent,
+        confidence,
+        query,
+        entities,
+        spaceWeights: SPACE_WEIGHTS[bestIntent],
+        splitWeights: SPLIT_WEIGHTS[bestIntent],
+    };
+}
+/**
+ * Get space weight profile for a given intent.
+ */
+export function getSpaceWeights(intent) {
+    return SPACE_WEIGHTS[intent];
+}
+/**
+ * Get split vector weight profile for a given intent.
+ */
+export function getSplitWeights(intent) {
+    return SPLIT_WEIGHTS[intent];
+}
+//# sourceMappingURL=intent.js.map

package/dist/core/intent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intent.js","sourceRoot":"","sources":["../../src/core/intent.ts"],"names":[],"mappings":"AA0BA,MAAM,eAAe,GAAuD;IAC1E;QACE,MAAM,EAAE,UAAU;QAClB,QAAQ,EAAE;YACR,iBAAiB;YACjB,kBAAkB;YAClB,sBAAsB;YACtB,eAAe;YACf,mBAAmB;YACnB,eAAe;YACf,iBAAiB;YACjB,sBAAsB;SACvB;KACF;IACD;QACE,MAAM,EAAE,YAAY;QACpB,QAAQ,EAAE;YACR,eAAe;YACf,mBAAmB;YACnB,cAAc;YACd,gBAAgB;YAChB,oBAAoB;YACpB,eAAe;YACf,eAAe;YACf,YAAY;SACb;KACF;IACD;QACE,MAAM,EAAE,UAAU;QAClB,QAAQ,EAAE;YACR,qBAAqB;YACrB,eAAe;YACf,YAAY;YACZ,aAAa;YACb,oBAAoB;YACpB,iBAAiB;YACjB,gBAAgB;YAChB,cAAc;SACf;KACF;IACD,wDAAwD;CACzD,CAAC;AAEF,MAAM,aAAa,GAAsC;IACvD,QAAQ,EAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE;IACzG,UAAU,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE;IACzG,QAAQ,EAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE;IACzG,QAAQ,EAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE;CAC1G,CAAC;AAEF,MAAM,aAAa,GAAsC;IACvD,QAAQ,EAAI,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;IACvD,QAAQ,EAAI,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;IACvD,QAAQ,EAAI,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;IACvD,UAAU,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE;CACxD,CAAC;AAEF;;GAEG;AACH,SAAS,eAAe,CAAC,KAAa,EAAE,SAAmB;IACzD,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QACvC,yBAAyB;QACzB,IAAI,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC9D,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AACtD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAa,EACb,YAAsB,EAAE;IAExB,IAAI,UAAU,GAAgB,UAAU,CAAC,CAAC,UAAU;IACpD,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,eAAe,EAAE,CAAC;QACnD,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC;QAChE,IAAI,UAAU,GAAG,SAAS,EAAE,CAAC;YAC3B,SAAS,GAAG,UAAU,CAAC;YACvB,UAAU,GAAG,MAAM,CAAC;QACtB,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,SAAS,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IACtE,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAEnD,OAAO;QACL,MAAM,EAAE,UAAU;QAClB,UAAU;QACV,KAAK;QACL,QAAQ;QACR,YAAY,EAAE,aAAa,CAAC,UAAU,CAAC;QACvC,YAAY,EAAE,aAAa,CAAC,UAAU,CAAC;KACxC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAmB;IACjD,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,MAAmB;IACjD,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC"}

package/dist/core/linkdetect.d.ts

@@ -0,0 +1,34 @@
+import type { LinkGraph } from "./graph.js";
+export type DetectedLink = {
+    title: string;
+    offset: number;
+    length: number;
+    alreadyLinked: boolean;
+};
+export type LinkSuggestion = {
+    title: string;
+    reason: "title-match" | "tag-overlap" | "project-overlap" | "shared-neighborhood";
+    confidence: number;
+};
+export type VaultIndex = {
+    titles: string[];
+    frontmatter: Map<string, Record<string, unknown>>;
+    graph: LinkGraph;
+};
+/**
+ * Scan body text for mentions of existing note titles.
+ * Returns detected mentions sorted by offset.
+ * Skips mentions already wrapped in [[]].
+ */
+export declare function detectLinks(body: string, existingTitles: string[]): DetectedLink[];
+/**
+ * Apply detected links to body text, wrapping unlinked mentions in [[]].
+ * Processes from end to start to preserve offsets.
+ */
+export declare function applyLinks(body: string, links: DetectedLink[]): string;
+/**
+ * Suggest structural connections via graph heuristics.
+ * No LLM — pure computation over vault metadata and link graph.
+ */
+export declare function suggestLinks(frontmatter: Record<string, unknown>, body: string, vaultIndex: VaultIndex): LinkSuggestion[];
+//# sourceMappingURL=linkdetect.d.ts.map

package/dist/core/linkdetect.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"linkdetect.d.ts","sourceRoot":"","sources":["../../src/core/linkdetect.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C,MAAM,MAAM,YAAY,GAAG;IACzB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,aAAa,EAAE,OAAO,CAAC;CACxB,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EACF,aAAa,GACb,aAAa,GACb,iBAAiB,GACjB,qBAAqB,CAAC;IAC1B,UAAU,EAAE,MAAM,CAAC;CACpB,CAAC;AAEF,MAAM,MAAM,UAAU,GAAG;IACvB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAClD,KAAK,EAAE,SAAS,CAAC;CAClB,CAAC;AAuCF;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,MAAM,EACZ,cAAc,EAAE,MAAM,EAAE,GACvB,YAAY,EAAE,CAoChB;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,MAAM,CAatE;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAC1B,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACpC,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,UAAU,GACrB,cAAc,EAAE,CA2FlB"}