claudecode-rlm 1.0.0

package/dist/graph/traversal.js

@@ -0,0 +1,255 @@
+/**
+ * Graph traversal and search for RLM-Graph.
+ *
+ * Provides utilities for navigating and searching the knowledge graph:
+ * - GraphTraverser: Breadth-first and path-based traversal
+ * - GraphSearcher: Combined keyword and semantic search
+ */
+import { NodeType, RelationType, } from "./types.js";
+import { GraphStorage } from "./storage.js";
+/**
+ * Traverses the knowledge graph to find related context.
+ */
+export var GraphTraverser;
+(function (GraphTraverser) {
+    /**
+     * Get neighboring nodes.
+     */
+    function getNeighbors(sessionID, nodeID, direction = "outgoing", relationship) {
+        return GraphStorage.getNeighbors(sessionID, nodeID, direction, relationship);
+    }
+    GraphTraverser.getNeighbors = getNeighbors;
+    /**
+     * Expand context by traversing from given nodes using BFS.
+     */
+    function expandContext(sessionID, nodeIDs, maxDepth = 2, maxNodes = 20) {
+        const visited = new Set();
+        const result = [];
+        const queue = nodeIDs.map((nodeID) => ({ nodeID, depth: 0 }));
+        while (queue.length > 0 && result.length < maxNodes) {
+            const { nodeID, depth } = queue.shift();
+            if (visited.has(nodeID)) {
+                continue;
+            }
+            visited.add(nodeID);
+            const node = GraphStorage.getNode(sessionID, nodeID);
+            if (node) {
+                result.push(node);
+            }
+            if (depth < maxDepth) {
+                // Get neighbors from edges
+                const edges = GraphStorage.getEdges(sessionID, nodeID, "both");
+                for (const edge of edges) {
+                    const neighborID = edge.sourceID === nodeID ? edge.targetID : edge.sourceID;
+                    if (!visited.has(neighborID)) {
+                        queue.push({ nodeID: neighborID, depth: depth + 1 });
+                    }
+                }
+            }
+        }
+        return result;
+    }
+    GraphTraverser.expandContext = expandContext;
+    /**
+     * Find a path between two nodes using BFS.
+     */
+    function findPath(sessionID, startID, endID, maxDepth = 5) {
+        const visited = new Set();
+        const queue = [
+            { nodeID: startID, path: [startID] },
+        ];
+        while (queue.length > 0) {
+            const { nodeID, path } = queue.shift();
+            if (nodeID === endID) {
+                // Build node list from path
+                const nodes = [];
+                for (const id of path) {
+                    const node = GraphStorage.getNode(sessionID, id);
+                    if (node) {
+                        nodes.push(node);
+                    }
+                }
+                return nodes;
+            }
+            if (path.length >= maxDepth) {
+                continue;
+            }
+            visited.add(nodeID);
+            const edges = GraphStorage.getEdges(sessionID, nodeID, "both");
+            for (const edge of edges) {
+                const neighborID = edge.sourceID === nodeID ? edge.targetID : edge.sourceID;
+                if (!visited.has(neighborID)) {
+                    queue.push({ nodeID: neighborID, path: [...path, neighborID] });
+                }
+            }
+        }
+        return null;
+    }
+    GraphTraverser.findPath = findPath;
+    /**
+     * Get all chunks that mention a specific entity.
+     */
+    function getEntityContext(sessionID, entityName, maxChunks = 10) {
+        // Find entity nodes matching the name
+        const entities = GraphStorage.searchNodes(sessionID, entityName, NodeType.ENTITY, 5);
+        const chunkIDs = new Set();
+        for (const entity of entities) {
+            // Find chunks that mention this entity (incoming MENTIONS edges)
+            const edges = GraphStorage.getEdges(sessionID, entity.id, "incoming");
+            for (const edge of edges) {
+                if (edge.relationship === RelationType.MENTIONS) {
+                    chunkIDs.add(edge.sourceID);
+                }
+            }
+        }
+        // Get chunk nodes
+        const chunks = [];
+        for (const chunkID of Array.from(chunkIDs).slice(0, maxChunks)) {
+            const node = GraphStorage.getNode(sessionID, chunkID);
+            if (node) {
+                chunks.push(node);
+            }
+        }
+        return chunks;
+    }
+    GraphTraverser.getEntityContext = getEntityContext;
+    /**
+     * Get the parent document for a chunk.
+     */
+    function getDocumentForChunk(sessionID, chunkID) {
+        // Navigate up: chunk -> section -> document
+        const chunkEdges = GraphStorage.getEdges(sessionID, chunkID, "incoming");
+        for (const edge of chunkEdges) {
+            if (edge.relationship === RelationType.HAS_CHUNK) {
+                // Found the section
+                const sectionID = edge.sourceID;
+                // Now find the document
+                const sectionEdges = GraphStorage.getEdges(sessionID, sectionID, "incoming");
+                for (const sectionEdge of sectionEdges) {
+                    if (sectionEdge.relationship === RelationType.HAS_SECTION) {
+                        return GraphStorage.getNode(sessionID, sectionEdge.sourceID);
+                    }
+                }
+            }
+        }
+        return null;
+    }
+    GraphTraverser.getDocumentForChunk = getDocumentForChunk;
+})(GraphTraverser || (GraphTraverser = {}));
+/**
+ * Search the knowledge graph using combined strategies.
+ */
+export var GraphSearcher;
+(function (GraphSearcher) {
+    /**
+     * Search the graph for relevant nodes.
+     */
+    function search(sessionID, query, options = {}) {
+        const { limit = 10, expandContext = true, nodeType = NodeType.CHUNK } = options;
+        const results = new Map();
+        // 1. Keyword search
+        const keywordMatches = GraphStorage.searchNodes(sessionID, query, nodeType, limit * 2);
+        const queryTerms = new Set(query.toLowerCase().split(/\s+/));
+        for (const node of keywordMatches) {
+            const contentTerms = new Set(node.content.toLowerCase().split(/\s+/));
+            const overlap = [...queryTerms].filter((t) => contentTerms.has(t)).length;
+            const score = overlap / Math.max(queryTerms.size, 1);
+            results.set(node.id, {
+                node,
+                score: score * 0.4, // Keyword weight: 0.4
+                matchedOn: "content",
+            });
+        }
+        // 2. Entity-based search
+        const entities = extractQueryEntities(query);
+        for (const entityName of entities) {
+            const chunks = GraphTraverser.getEntityContext(sessionID, entityName, 5);
+            for (const chunk of chunks) {
+                if (results.has(chunk.id)) {
+                    // Boost existing result
+                    const existing = results.get(chunk.id);
+                    results.set(chunk.id, {
+                        ...existing,
+                        score: existing.score + 0.3,
+                    });
+                }
+                else {
+                    results.set(chunk.id, {
+                        node: chunk,
+                        score: 0.3,
+                        matchedOn: "entity",
+                    });
+                }
+            }
+        }
+        // 3. Expand context via graph traversal
+        if (expandContext && results.size > 0) {
+            const topIDs = [...results.entries()]
+                .sort((a, b) => b[1].score - a[1].score)
+                .slice(0, 3)
+                .map(([id]) => id);
+            const expanded = GraphTraverser.expandContext(sessionID, topIDs, 1, 5);
+            for (const node of expanded) {
+                if (!results.has(node.id)) {
+                    results.set(node.id, {
+                        node,
+                        score: 0.2,
+                        matchedOn: "traversal",
+                    });
+                }
+            }
+        }
+        // Sort by score and return
+        return [...results.values()]
+            .sort((a, b) => b.score - a.score)
+            .slice(0, limit);
+    }
+    GraphSearcher.search = search;
+    /**
+     * Search across all sessions.
+     */
+    function searchAllSessions(query, options = {}) {
+        const { limit = 10 } = options;
+        const allResults = [];
+        for (const sessionID of GraphStorage.getSessions()) {
+            const sessionResults = search(sessionID, query, {
+                ...options,
+                limit: Math.ceil(limit / 2),
+            });
+            allResults.push(...sessionResults);
+        }
+        // Sort by score and deduplicate
+        const seen = new Set();
+        return allResults
+            .sort((a, b) => b.score - a.score)
+            .filter((r) => {
+            if (seen.has(r.node.id))
+                return false;
+            seen.add(r.node.id);
+            return true;
+        })
+            .slice(0, limit);
+    }
+    GraphSearcher.searchAllSessions = searchAllSessions;
+    /**
+     * Extract potential entity names from a query.
+     */
+    function extractQueryEntities(query) {
+        const entities = [];
+        // Capitalized terms
+        const capitalizedPattern = /\b([A-Z][a-z]+(?:\s+[A-Z][a-z]+)*)\b/g;
+        let match;
+        while ((match = capitalizedPattern.exec(query)) !== null) {
+            entities.push(match[1]);
+        }
+        // Code elements (PascalCase, snake_case)
+        const codePattern = /\b([A-Z][a-zA-Z0-9]*|[a-z_][a-z0-9_]+)\b/g;
+        while ((match = codePattern.exec(query)) !== null) {
+            if (match[1].length > 3) {
+                entities.push(match[1]);
+            }
+        }
+        return [...new Set(entities)];
+    }
+})(GraphSearcher || (GraphSearcher = {}));
+//# sourceMappingURL=traversal.js.map

package/dist/graph/traversal.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.js","sourceRoot":"","sources":["../../src/graph/traversal.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAGL,QAAQ,EACR,YAAY,GACb,MAAM,YAAY,CAAA;AACnB,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAA;AAE3C;;GAEG;AACH,MAAM,KAAW,cAAc,CAgL9B;AAhLD,WAAiB,cAAc;IAC7B;;OAEG;IACH,SAAgB,YAAY,CAC1B,SAAiB,EACjB,MAAc,EACd,YAA8C,UAAU,EACxD,YAA2B;QAE3B,OAAO,YAAY,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAA;IAC9E,CAAC;IAPe,2BAAY,eAO3B,CAAA;IAED;;OAEG;IACH,SAAgB,aAAa,CAC3B,SAAiB,EACjB,OAAiB,EACjB,WAAmB,CAAC,EACpB,WAAmB,EAAE;QAErB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,MAAM,GAAgB,EAAE,CAAA;QAC9B,MAAM,KAAK,GAA6C,OAAO,CAAC,GAAG,CACjE,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CACnC,CAAA;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;YACpD,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;YAExC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxB,SAAQ;YACV,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YAEnB,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,CAAA;YACpD,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnB,CAAC;YAED,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,2BAA2B;gBAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;gBAC9D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,UAAU,GACd,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;oBAC1D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;wBAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAA;oBACtD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAxCe,4BAAa,gBAwC5B,CAAA;IAED;;OAEG;IACH,SAAgB,QAAQ,CACtB,SAAiB,EACjB,OAAe,EACf,KAAa,EACb,WAAmB,CAAC;QAEpB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,KAAK,GAA8C;YACvD,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,OAAO,CAAC,EAAE;SACrC,CAAA;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;YAEvC,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;gBACrB,4BAA4B;gBAC5B,MAAM,KAAK,GAAgB,EAAE,CAAA;gBAC7B,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;oBACtB,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAA;oBAChD,IAAI,IAAI,EAAE,CAAC;wBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBAClB,CAAC;gBACH,CAAC;gBACD,OAAO,KAAK,CAAA;YACd,CAAC;YAED,IAAI,IAAI,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC5B,SAAQ;YACV,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YAEnB,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CAAA;YAC9D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,UAAU,GACd,IAAI,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;gBAC1D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,EAAE,CAAC,CAAA;gBACjE,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IA3Ce,uBAAQ,WA2CvB,CAAA;IAED;;OAEG;IACH,SAAgB,gBAAgB,CAC9B,SAAiB,EACjB,UAAkB,EAClB,YAAoB,EAAE;QAEtB,sCAAsC;QACtC,MAAM,QAAQ,GAAG,YAAY,CAAC,WAAW,CACvC,SAAS,EACT,UAAU,EACV,QAAQ,CAAC,MAAM,EACf,CAAC,CACF,CAAA;QAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;QAElC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,iEAAiE;YACjE,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,CAAA;YACrE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,YAAY,KAAK,YAAY,CAAC,QAAQ,EAAE,CAAC;oBAChD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;gBAC7B,CAAC;YACH,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,MAAM,MAAM,GAAgB,EAAE,CAAA;QAC9B,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;YAC/D,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;YACrD,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAA;IACf,CAAC;IAnCe,+BAAgB,mBAmC/B,CAAA;IAED;;OAEG;IACH,SAAgB,mBAAmB,CACjC,SAAiB,EACjB,OAAe;QAEf,4CAA4C;QAC5C,MAAM,UAAU,GAAG,YAAY,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,EAAE,UAAU,CAAC,CAAA;QACxE,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,YAAY,KAAK,YAAY,CAAC,SAAS,EAAE,CAAC;gBACjD,oBAAoB;gBACpB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAA;gBAE/B,wBAAwB;gBACxB,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CACxC,SAAS,EACT,SAAS,EACT,UAAU,CACX,CAAA;gBACD,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE,CAAC;oBACvC,IAAI,WAAW,CAAC,YAAY,KAAK,YAAY,CAAC,WAAW,EAAE,CAAC;wBAC1D,OAAO,YAAY,CAAC,OAAO,CAAC,SAAS,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAA;oBAC9D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IA1Be,kCAAmB,sBA0BlC,CAAA;AACH,CAAC,EAhLgB,cAAc,KAAd,cAAc,QAgL9B;AAED;;GAEG;AACH,MAAM,KAAW,aAAa,CAmJ7B;AAnJD,WAAiB,aAAa;IAC5B;;OAEG;IACH,SAAgB,MAAM,CACpB,SAAiB,EACjB,KAAa,EACb,UAII,EAAE;QAEN,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,aAAa,GAAG,IAAI,EAAE,QAAQ,GAAG,QAAQ,CAAC,KAAK,EAAE,GAAG,OAAO,CAAA;QAC/E,MAAM,OAAO,GAAG,IAAI,GAAG,EAA6B,CAAA;QAEpD,oBAAoB;QACpB,MAAM,cAAc,GAAG,YAAY,CAAC,WAAW,CAC7C,SAAS,EACT,KAAK,EACL,QAAQ,EACR,KAAK,GAAG,CAAC,CACV,CAAA;QAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;QAE5D,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;YAClC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;YACrE,MAAM,OAAO,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;YACzE,MAAM,KAAK,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YAEpD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;gBACnB,IAAI;gBACJ,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE,sBAAsB;gBAC1C,SAAS,EAAE,SAAS;aACrB,CAAC,CAAA;QACJ,CAAC;QAED,yBAAyB;QACzB,MAAM,QAAQ,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAA;QAC5C,KAAK,MAAM,UAAU,IAAI,QAAQ,EAAE,CAAC;YAClC,MAAM,MAAM,GAAG,cAAc,CAAC,gBAAgB,CAAC,SAAS,EAAE,UAAU,EAAE,CAAC,CAAC,CAAA;YACxE,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1B,wBAAwB;oBACxB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAE,CAAA;oBACvC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;wBACpB,GAAG,QAAQ;wBACX,KAAK,EAAE,QAAQ,CAAC,KAAK,GAAG,GAAG;qBAC5B,CAAC,CAAA;gBACJ,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;wBACpB,IAAI,EAAE,KAAK;wBACX,KAAK,EAAE,GAAG;wBACV,SAAS,EAAE,QAAQ;qBACpB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,IAAI,aAAa,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC;iBAClC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;iBACvC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;iBACX,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;YAEpB,MAAM,QAAQ,GAAG,cAAc,CAAC,aAAa,CAC3C,SAAS,EACT,MAAM,EACN,CAAC,EACD,CAAC,CACF,CAAA;YAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;wBACnB,IAAI;wBACJ,KAAK,EAAE,GAAG;wBACV,SAAS,EAAE,WAAW;qBACvB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;aACzB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACpB,CAAC;IArFe,oBAAM,SAqFrB,CAAA;IAED;;OAEG;IACH,SAAgB,iBAAiB,CAC/B,KAAa,EACb,UAGI,EAAE;QAEN,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,GAAG,OAAO,CAAA;QAC9B,MAAM,UAAU,GAAwB,EAAE,CAAA;QAE1C,KAAK,MAAM,SAAS,IAAI,YAAY,CAAC,WAAW,EAAE,EAAE,CAAC;YACnD,MAAM,cAAc,GAAG,MAAM,CAAC,SAAS,EAAE,KAAK,EAAE;gBAC9C,GAAG,OAAO;gBACV,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;aAC5B,CAAC,CAAA;YACF,UAAU,CAAC,IAAI,CAAC,GAAG,cAAc,CAAC,CAAA;QACpC,CAAC;QAED,gCAAgC;QAChC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;QAC9B,OAAO,UAAU;aACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACZ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,OAAO,KAAK,CAAA;YACrC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YACnB,OAAO,IAAI,CAAA;QACb,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACpB,CAAC;IA5Be,+BAAiB,oBA4BhC,CAAA;IAED;;OAEG;IACH,SAAS,oBAAoB,CAAC,KAAa;QACzC,MAAM,QAAQ,GAAa,EAAE,CAAA;QAE7B,oBAAoB;QACpB,MAAM,kBAAkB,GAAG,uCAAuC,CAAA;QAClE,IAAI,KAA6B,CAAA;QACjC,OAAO,CAAC,KAAK,GAAG,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACzD,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;QACzB,CAAC;QAED,yCAAyC;QACzC,MAAM,WAAW,GAAG,2CAA2C,CAAA;QAC/D,OAAO,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAClD,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACzB,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAA;IAC/B,CAAC;AACH,CAAC,EAnJgB,aAAa,KAAb,aAAa,QAmJ7B"}

package/dist/graph/types.d.ts

@@ -0,0 +1,152 @@
+/**
+ * Graph types for RLM-Graph knowledge storage.
+ *
+ * Defines the node and edge types for the knowledge graph that stores
+ * archived conversation context.
+ */
+import { z } from "zod";
+/**
+ * Node types in the knowledge graph.
+ */
+export declare const NodeType: {
+    /** Top-level document representing an archived context block */
+    readonly DOCUMENT: "document";
+    /** Section within a document (e.g., markdown header section) */
+    readonly SECTION: "section";
+    /** Individual content chunk for retrieval */
+    readonly CHUNK: "chunk";
+    /** Named entity (code element, file path, concept) */
+    readonly ENTITY: "entity";
+};
+export type NodeType = (typeof NodeType)[keyof typeof NodeType];
+/**
+ * Relationship types between nodes.
+ */
+export declare const RelationType: {
+    /** Document contains section */
+    readonly HAS_SECTION: "has_section";
+    /** Section/Document contains chunk */
+    readonly HAS_CHUNK: "has_chunk";
+    /** Chunk mentions entity */
+    readonly MENTIONS: "mentions";
+    /** Related concepts */
+    readonly RELATED_TO: "related_to";
+    /** Temporal ordering (chunk follows chunk) */
+    readonly FOLLOWS: "follows";
+    /** Parent-child relationship */
+    readonly PARENT_OF: "parent_of";
+};
+export type RelationType = (typeof RelationType)[keyof typeof RelationType];
+/**
+ * Entity types for extracted entities.
+ */
+export declare const EntityType: {
+    /** Code element (class, function, variable) */
+    readonly CODE_ELEMENT: "code_element";
+    /** File path */
+    readonly FILE_PATH: "file_path";
+    /** Proper noun / named concept */
+    readonly PROPER_NOUN: "proper_noun";
+    /** Reference (link, citation) */
+    readonly REFERENCE: "reference";
+};
+export type EntityType = (typeof EntityType)[keyof typeof EntityType];
+/**
+ * Graph node schema.
+ */
+export declare const GraphNodeSchema: z.ZodObject<{
+    /** Unique node identifier */
+    id: z.ZodString;
+    /** Session this node belongs to */
+    sessionID: z.ZodString;
+    /** Node type */
+    type: z.ZodEnum<["document", "section", "chunk", "entity"]>;
+    /** Node content (text, entity name, etc.) */
+    content: z.ZodString;
+    /** Additional metadata */
+    metadata: z.ZodDefault<z.ZodRecord<z.ZodString, z.ZodAny>>;
+    /** Optional embedding vector */
+    embedding: z.ZodOptional<z.ZodArray<z.ZodNumber, "many">>;
+    /** Creation timestamp */
+    createdAt: z.ZodNumber;
+}, "strip", z.ZodTypeAny, {
+    type: "document" | "section" | "chunk" | "entity";
+    id: string;
+    sessionID: string;
+    content: string;
+    metadata: Record<string, any>;
+    createdAt: number;
+    embedding?: number[] | undefined;
+}, {
+    type: "document" | "section" | "chunk" | "entity";
+    id: string;
+    sessionID: string;
+    content: string;
+    createdAt: number;
+    metadata?: Record<string, any> | undefined;
+    embedding?: number[] | undefined;
+}>;
+export type GraphNode = z.infer<typeof GraphNodeSchema>;
+/**
+ * Graph edge schema.
+ */
+export declare const GraphEdgeSchema: z.ZodObject<{
+    /** Source node ID */
+    sourceID: z.ZodString;
+    /** Target node ID */
+    targetID: z.ZodString;
+    /** Relationship type */
+    relationship: z.ZodEnum<["has_section", "has_chunk", "mentions", "related_to", "follows", "parent_of"]>;
+    /** Edge weight (0-1) */
+    weight: z.ZodDefault<z.ZodNumber>;
+    /** Additional metadata */
+    metadata: z.ZodDefault<z.ZodRecord<z.ZodString, z.ZodAny>>;
+    /** Creation timestamp */
+    createdAt: z.ZodNumber;
+}, "strip", z.ZodTypeAny, {
+    metadata: Record<string, any>;
+    createdAt: number;
+    sourceID: string;
+    targetID: string;
+    relationship: "has_section" | "has_chunk" | "mentions" | "related_to" | "follows" | "parent_of";
+    weight: number;
+}, {
+    createdAt: number;
+    sourceID: string;
+    targetID: string;
+    relationship: "has_section" | "has_chunk" | "mentions" | "related_to" | "follows" | "parent_of";
+    metadata?: Record<string, any> | undefined;
+    weight?: number | undefined;
+}>;
+export type GraphEdge = z.infer<typeof GraphEdgeSchema>;
+/**
+ * Entity extracted from text.
+ */
+export interface Entity {
+    name: string;
+    type: EntityType;
+}
+/**
+ * Search result with relevance score.
+ */
+export interface GraphSearchResult {
+    node: GraphNode;
+    score: number;
+    matchedOn: "content" | "entity" | "traversal" | "embedding";
+}
+/**
+ * Edge adjacency list for storage.
+ */
+export interface EdgeAdjacencyList {
+    outgoing: GraphEdge[];
+    incoming: GraphEdge[];
+}
+/**
+ * Type index mapping node types to node IDs.
+ */
+export type TypeIndex = Record<string, string[]>;
+/**
+ * Entity index mapping entity names to node IDs.
+ */
+export type EntityIndex = Record<string, string[]>;
+//# sourceMappingURL=types.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/graph/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAA;AAEvB;;GAEG;AACH,eAAO,MAAM,QAAQ;IACnB,gEAAgE;;IAEhE,gEAAgE;;IAEhE,6CAA6C;;IAE7C,sDAAsD;;CAE9C,CAAA;AAEV,MAAM,MAAM,QAAQ,GAAG,CAAC,OAAO,QAAQ,CAAC,CAAC,MAAM,OAAO,QAAQ,CAAC,CAAA;AAE/D;;GAEG;AACH,eAAO,MAAM,YAAY;IACvB,gCAAgC;;IAEhC,sCAAsC;;IAEtC,4BAA4B;;IAE5B,uBAAuB;;IAEvB,8CAA8C;;IAE9C,gCAAgC;;CAExB,CAAA;AAEV,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,YAAY,CAAC,CAAC,MAAM,OAAO,YAAY,CAAC,CAAA;AAE3E;;GAEG;AACH,eAAO,MAAM,UAAU;IACrB,+CAA+C;;IAE/C,gBAAgB;;IAEhB,kCAAkC;;IAElC,iCAAiC;;CAEzB,CAAA;AAEV,MAAM,MAAM,UAAU,GAAG,CAAC,OAAO,UAAU,CAAC,CAAC,MAAM,OAAO,UAAU,CAAC,CAAA;AAErE;;GAEG;AACH,eAAO,MAAM,eAAe;IAC1B,6BAA6B;;IAE7B,mCAAmC;;IAEnC,gBAAgB;;IAEhB,6CAA6C;;IAE7C,0BAA0B;;IAE1B,gCAAgC;;IAEhC,yBAAyB;;;;;;;;;;;;;;;;;;EAEzB,CAAA;AAEF,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,eAAe,CAAC,CAAA;AAEvD;;GAEG;AACH,eAAO,MAAM,eAAe;IAC1B,qBAAqB;;IAErB,qBAAqB;;IAErB,wBAAwB;;IASxB,wBAAwB;;IAExB,0BAA0B;;IAE1B,yBAAyB;;;;;;;;;;;;;;;;EAEzB,CAAA;AAEF,MAAM,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,eAAe,CAAC,CAAA;AAEvD;;GAEG;AACH,MAAM,WAAW,MAAM;IACrB,IAAI,EAAE,MAAM,CAAA;IACZ,IAAI,EAAE,UAAU,CAAA;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,SAAS,CAAA;IACf,KAAK,EAAE,MAAM,CAAA;IACb,SAAS,EAAE,SAAS,GAAG,QAAQ,GAAG,WAAW,GAAG,WAAW,CAAA;CAC5D;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,QAAQ,EAAE,SAAS,EAAE,CAAA;CACtB;AAED;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA;AAEhD;;GAEG;AACH,MAAM,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAA"}

package/dist/graph/types.js

@@ -0,0 +1,94 @@
+/**
+ * Graph types for RLM-Graph knowledge storage.
+ *
+ * Defines the node and edge types for the knowledge graph that stores
+ * archived conversation context.
+ */
+import { z } from "zod";
+/**
+ * Node types in the knowledge graph.
+ */
+export const NodeType = {
+    /** Top-level document representing an archived context block */
+    DOCUMENT: "document",
+    /** Section within a document (e.g., markdown header section) */
+    SECTION: "section",
+    /** Individual content chunk for retrieval */
+    CHUNK: "chunk",
+    /** Named entity (code element, file path, concept) */
+    ENTITY: "entity",
+};
+/**
+ * Relationship types between nodes.
+ */
+export const RelationType = {
+    /** Document contains section */
+    HAS_SECTION: "has_section",
+    /** Section/Document contains chunk */
+    HAS_CHUNK: "has_chunk",
+    /** Chunk mentions entity */
+    MENTIONS: "mentions",
+    /** Related concepts */
+    RELATED_TO: "related_to",
+    /** Temporal ordering (chunk follows chunk) */
+    FOLLOWS: "follows",
+    /** Parent-child relationship */
+    PARENT_OF: "parent_of",
+};
+/**
+ * Entity types for extracted entities.
+ */
+export const EntityType = {
+    /** Code element (class, function, variable) */
+    CODE_ELEMENT: "code_element",
+    /** File path */
+    FILE_PATH: "file_path",
+    /** Proper noun / named concept */
+    PROPER_NOUN: "proper_noun",
+    /** Reference (link, citation) */
+    REFERENCE: "reference",
+};
+/**
+ * Graph node schema.
+ */
+export const GraphNodeSchema = z.object({
+    /** Unique node identifier */
+    id: z.string(),
+    /** Session this node belongs to */
+    sessionID: z.string(),
+    /** Node type */
+    type: z.enum(["document", "section", "chunk", "entity"]),
+    /** Node content (text, entity name, etc.) */
+    content: z.string(),
+    /** Additional metadata */
+    metadata: z.record(z.any()).default({}),
+    /** Optional embedding vector */
+    embedding: z.array(z.number()).optional(),
+    /** Creation timestamp */
+    createdAt: z.number(),
+});
+/**
+ * Graph edge schema.
+ */
+export const GraphEdgeSchema = z.object({
+    /** Source node ID */
+    sourceID: z.string(),
+    /** Target node ID */
+    targetID: z.string(),
+    /** Relationship type */
+    relationship: z.enum([
+        "has_section",
+        "has_chunk",
+        "mentions",
+        "related_to",
+        "follows",
+        "parent_of",
+    ]),
+    /** Edge weight (0-1) */
+    weight: z.number().min(0).max(1).default(1.0),
+    /** Additional metadata */
+    metadata: z.record(z.any()).default({}),
+    /** Creation timestamp */
+    createdAt: z.number(),
+});
+//# sourceMappingURL=types.js.map

package/dist/graph/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/graph/types.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAA;AAEvB;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG;IACtB,gEAAgE;IAChE,QAAQ,EAAE,UAAU;IACpB,gEAAgE;IAChE,OAAO,EAAE,SAAS;IAClB,6CAA6C;IAC7C,KAAK,EAAE,OAAO;IACd,sDAAsD;IACtD,MAAM,EAAE,QAAQ;CACR,CAAA;AAIV;;GAEG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG;IAC1B,gCAAgC;IAChC,WAAW,EAAE,aAAa;IAC1B,sCAAsC;IACtC,SAAS,EAAE,WAAW;IACtB,4BAA4B;IAC5B,QAAQ,EAAE,UAAU;IACpB,uBAAuB;IACvB,UAAU,EAAE,YAAY;IACxB,8CAA8C;IAC9C,OAAO,EAAE,SAAS;IAClB,gCAAgC;IAChC,SAAS,EAAE,WAAW;CACd,CAAA;AAIV;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,+CAA+C;IAC/C,YAAY,EAAE,cAAc;IAC5B,gBAAgB;IAChB,SAAS,EAAE,WAAW;IACtB,kCAAkC;IAClC,WAAW,EAAE,aAAa;IAC1B,iCAAiC;IACjC,SAAS,EAAE,WAAW;CACd,CAAA;AAIV;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IACtC,6BAA6B;IAC7B,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE;IACd,mCAAmC;IACnC,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE;IACrB,gBAAgB;IAChB,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;IACxD,6CAA6C;IAC7C,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;IACnB,0BAA0B;IAC1B,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IACvC,gCAAgC;IAChC,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,QAAQ,EAAE;IACzC,yBAAyB;IACzB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE;CACtB,CAAC,CAAA;AAIF;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IACtC,qBAAqB;IACrB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;IACpB,qBAAqB;IACrB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;IACpB,wBAAwB;IACxB,YAAY,EAAE,CAAC,CAAC,IAAI,CAAC;QACnB,aAAa;QACb,WAAW;QACX,UAAU;QACV,YAAY;QACZ,SAAS;QACT,WAAW;KACZ,CAAC;IACF,wBAAwB;IACxB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC;IAC7C,0BAA0B;IAC1B,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;IACvC,yBAAyB;IACzB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE;CACtB,CAAC,CAAA"}

package/dist/index.d.ts

@@ -0,0 +1,30 @@
+/**
+ * ClaudeCode RLM Plugin for Claude Code
+ *
+ * Enhances Claude Code's RLM system with:
+ * - Knowledge graph-based context storage (74x faster reads)
+ * - Extended reference patterns (40+ patterns)
+ * - Enhanced hybrid search with recency weighting
+ * - Entity extraction and linking
+ * - Custom tools for graph query and memory search
+ *
+ * @module claudecode-rlm
+ */
+import type { Plugin } from "./plugin-types.js";
+export * from "./graph/index.js";
+export * from "./search/index.js";
+export * from "./tools/index.js";
+export { parseConfig, type PluginConfig } from "./config.js";
+export type { Plugin, Hooks, PluginInput } from "./plugin-types.js";
+/**
+ * ClaudeCode RLM Plugin entry point.
+ *
+ * Registers hooks for:
+ * - experimental.chat.messages.transform: Inject graph-based context
+ * - experimental.session.compacting: Add entity summaries
+ * - event: Listen for rlm.archived to ingest into graph
+ * - tool: Register graph_query and memory_enhanced tools
+ */
+export declare const ClaudeCodeRLMPlugin: Plugin;
+export default ClaudeCodeRLMPlugin;
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAsB,MAAM,mBAAmB,CAAA;AAYnE,cAAc,kBAAkB,CAAA;AAChC,cAAc,mBAAmB,CAAA;AACjC,cAAc,kBAAkB,CAAA;AAChC,OAAO,EAAE,WAAW,EAAE,KAAK,YAAY,EAAE,MAAM,aAAa,CAAA;AAC5D,YAAY,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAenE;;;;;;;;GAQG;AACH,eAAO,MAAM,mBAAmB,EAAE,MAqLjC,CAAA;AAGD,eAAe,mBAAmB,CAAA"}