claudecode-rlm 1.0.0 → 1.1.0

package/README.md

@@ -1,132 +1,81 @@
 # claudecode-rlm
 
-**Advanced RLM (Recursive Language Model) plugin for [Claude Code](https://github.com/tekcin/claude-code) - Knowledge graph-based context storage with 74x faster reads.**
+**MCP server for Claude Code - Knowledge graph-based context storage with 74x faster reads.**
 
 **Author:** Michael Thornton (tekcin@yahoo.com)
 **Repository:** https://github.com/tekcin/claudecode-rlm
 
 ## Features
 
-- **Automatic Context Injection** - Proactively injects relevant context when reference patterns detected
+- **MCP Server** - Works directly with Claude Code via Model Context Protocol
 - **Knowledge Graph Storage** - Hierarchical context storage (Document → Section → Chunk → Entity)
 - **74x Faster Reads** - LRU cache with inverted index for instant retrieval
-- **40+ Reference Patterns** - Extended pattern detection for context references
-- **Enhanced Hybrid Search** - Keyword matching with recency weighting and entity boost
 - **Entity Extraction** - Automatic extraction of code elements, files, and concepts
-- **Custom Tools** - `graph_query`, `memory_enhanced`, `list_entities`, `graph_stats`
+- **Enhanced Search** - Keyword matching with recency weighting and entity boost
 
 ## Installation
 
 ```bash
-npm install claudecode-rlm
+npm install -g claudecode-rlm
 ```
 
-Or add to your Claude Code configuration:
+## Usage with Claude Code
 
-```jsonc
-// .claude/claudecode.jsonc
+Add to your Claude Code MCP settings (`~/.claude/claude_desktop_config.json`):
+
+```json
 {
-  "plugin": ["claudecode-rlm"],
-  "claudecode-rlm": {
-    "graph": {
-      "enabled": true,
-      "auto_ingest": true
-    },
-    "enhanced_search": {
-      "additional_patterns": true,
-      "recency_weight": 0.3,
-      "entity_boost": 0.2
+  "mcpServers": {
+    "claudecode-rlm": {
+      "command": "claudecode-rlm",
+      "env": {
+        "CLAUDECODE_RLM_WORKDIR": "/path/to/your/project"
+      }
     }
   }
 }
 ```
 
-## Performance
-
-Benchmarks comparing basic vs optimized storage (10,000 nodes):
+Or with npx (no global install):
 
-| Operation | Basic | Optimized | Speedup |
-|-----------|-------|-----------|---------|
-| Node reads | 21.3µs | 0.3µs | **74x** |
-| Get by type | 1.1ms | 21µs | **54x** |
-| Bulk insert | 6.07s | 1.21s | **5x** |
-| Search | 0.45ms | 0.65ms | ~1x |
+```json
+{
+  "mcpServers": {
+    "claudecode-rlm": {
+      "command": "npx",
+      "args": ["claudecode-rlm"],
+      "env": {
+        "CLAUDECODE_RLM_WORKDIR": "/path/to/your/project"
+      }
+    }
+  }
+}
+```
 
-The LRU cache achieves **100% hit rate** after initial population, ideal for read-heavy RLM workloads.
+## Available Tools
 
-## Architecture
+### memory_store
 
-### Knowledge Graph Structure
+Store content in the knowledge graph for later retrieval.
 
 ```
-Document (archived context block)
-├── Section (markdown header or paragraph group)
-│   ├── Chunk (retrieval unit, ~300 chars)
-│   │   ├── Entity (code element)
-│   │   ├── Entity (file path)
-│   │   └── Entity (concept)
-│   └── Chunk
-│       └── [FOLLOWS] → next chunk
-└── Section
+Store important context, decisions, or code discussions.
+Automatically extracts entities and creates searchable chunks.
 ```
 
-### Storage Optimizations
-
-1. **LRU Cache** (2000 nodes/session) - Eliminates repeated disk reads
-2. **Inverted Index** - O(1) keyword lookup instead of O(n) scan
-3. **Batched Writes** - Flushes every 100ms or 50 ops, reducing I/O ~90%
+### memory_search
 
-### Reference Patterns
+Search stored content with enhanced scoring.
 
-The plugin detects 40+ patterns that trigger proactive context retrieval:
-
-```javascript
-// Explicit memory references
-"do you remember..."
-"we discussed..."
-"earlier we..."
-
-// Task references
-"what did we do..."
-"where were we..."
-"let's continue..."
-
-// Code references
-"that function we..."
-"the class that..."
-"the file where..."
 ```
-
-## Configuration
-
-```jsonc
-{
-  "claudecode-rlm": {
-    "graph": {
-      "enabled": true,           // Enable graph features
-      "auto_ingest": true,       // Auto-ingest archived context
-      "max_traversal_nodes": 50, // Max nodes in traversal
-      "max_traversal_depth": 3   // Max BFS depth
-    },
-    "enhanced_search": {
-      "additional_patterns": true, // Use extended patterns
-      "recency_weight": 0.3,       // Recency scoring weight (0-1)
-      "entity_boost": 0.2,         // Entity match boost (0-1)
-      "max_age_days": 30,          // Max age for recency
-      "min_score_threshold": 0.3   // Min score for results
-    },
-    "task_detection": {
-      "auto_archive_on_completion": true
-    }
-  }
-}
+- Keyword matching with recency weighting
+- Entity-aware boosting
+- Configurable scoring parameters
 ```
 
-## Tools
-
 ### graph_query
 
-Query the knowledge graph directly:
+Query the knowledge graph directly.
 
 ```
 Operations:
@@ -136,23 +85,81 @@ Operations:
 - path: Find connection between entities
 ```
 
-### memory_enhanced
+### list_entities
+
+List tracked entities (code elements, files, concepts).
+
+### graph_stats
+
+Get knowledge graph statistics and cache performance.
+
+## Environment Variables
+
+| Variable | Description | Default |
+|----------|-------------|---------|
+| `CLAUDECODE_RLM_WORKDIR` | Working directory for storage | Current directory |
+| `CLAUDECODE_RLM_SESSION` | Default session ID | `default` |
+
+## Architecture
+
+### Knowledge Graph Structure
+
+```
+Document (stored content block)
+├── Section (markdown header or paragraph group)
+│   ├── Chunk (retrieval unit, ~300 chars)
+│   │   ├── Entity (code element)
+│   │   ├── Entity (file path)
+│   │   └── Entity (concept)
+│   └── Chunk
+│       └── [FOLLOWS] → next chunk
+└── Section
+```
+
+### Storage
 
-Search with enhanced scoring:
+Data persists to `.claude/claudecode-rlm/graph/{sessionID}/`:
 
 ```
-- Keyword matching with recency weighting
-- Entity-aware boosting
-- Graph traversal for related context
+nodes/*.json    - Individual node files
+edges/*.json    - Adjacency lists per node
+indexes/*.json  - Type, entity, and inverted word indexes
 ```
 
-### list_entities
+## Performance
 
-List tracked entities (code elements, files, concepts).
+Benchmarks comparing basic vs optimized storage (10,000 nodes):
 
-### graph_stats
+| Operation | Basic | Optimized | Speedup |
+|-----------|-------|-----------|---------|
+| Node reads | 21.3µs | 0.3µs | **74x** |
+| Get by type | 1.1ms | 21µs | **54x** |
+| Bulk insert | 6.07s | 1.21s | **5x** |
+| Search | 0.45ms | 0.65ms | ~1x |
 
-Get knowledge graph statistics and cache performance.
+## Library Usage
+
+You can also use claudecode-rlm as a library:
+
+```javascript
+import { GraphStorage, GraphIngester, EnhancedSearch } from 'claudecode-rlm'
+
+// Initialize
+GraphStorage.init('/path/to/project')
+
+// Store content
+GraphIngester.ingestContextBlock({
+  id: 'block-1',
+  sessionID: 'my-session',
+  content: 'Your conversation content...',
+  summary: 'Summary',
+  tokens: 1000,
+  createdAt: Date.now()
+})
+
+// Search
+const results = EnhancedSearch.search('my-session', 'your query')
+```
 
 ## Development
 
@@ -160,37 +167,15 @@ Get knowledge graph statistics and cache performance.
 # Install dependencies
 npm install
 
-# Type check
-npm run typecheck
-
 # Build
 npm run build
 
-# Run benchmarks
-npm run test
-npm run test:optimized
-```
-
-## How It Works
+# Run MCP server locally
+npm start
 
-1. **Context Archival**: When Claude Code archives context (RLM threshold reached), claudecode-rlm:
-   - Creates a Document node for the archived block
-   - Splits content into Sections (by headers or paragraphs)
-   - Chunks sections into retrieval units (~300 chars with overlap)
-   - Extracts entities (code elements, file paths, concepts)
-   - Links everything with typed edges
-
-2. **Context Injection**: When a user message matches reference patterns (e.g., "do you remember...", "we discussed..."):
-   - claudecode-rlm detects the pattern via `experimental.chat.messages.transform` hook
-   - Searches the inverted index for matching chunks
-   - Boosts results by entity matches and recency
-   - Expands context via graph traversal
-   - **Injects relevant context into the message stream before the LLM sees it**
-
-3. **Caching**: The LRU cache ensures:
-   - Recently accessed nodes are instant to retrieve
-   - Cache hit rate approaches 100% in typical usage
-   - Memory usage bounded by cache size (2000 nodes)
+# Type check
+npm run typecheck
+```
 
 ## License
 
@@ -204,6 +189,6 @@ MIT
 
 ## Links
 
-- [claudecode-rlm Repository](https://github.com/tekcin/claudecode-rlm)
-- [Claude Code](https://github.com/tekcin/claude-code)
+- [claudecode-rlm on npm](https://www.npmjs.com/package/claudecode-rlm)
+- [GitHub Repository](https://github.com/tekcin/claudecode-rlm)
 - [Issues](https://github.com/tekcin/claudecode-rlm/issues)

package/dist/mcp-server.d.ts

@@ -0,0 +1,17 @@
+#!/usr/bin/env node
+/**
+ * claudecode-rlm MCP Server
+ *
+ * Provides knowledge graph-based context storage for Claude Code via MCP.
+ *
+ * Tools:
+ * - graph_query: Query the knowledge graph
+ * - memory_store: Store content in the knowledge graph
+ * - memory_search: Search stored content with enhanced scoring
+ * - list_entities: List tracked entities
+ * - graph_stats: Get graph statistics
+ *
+ * @module claudecode-rlm/mcp-server
+ */
+export {};
+//# sourceMappingURL=mcp-server.d.ts.map

package/dist/mcp-server.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mcp-server.d.ts","sourceRoot":"","sources":["../src/mcp-server.ts"],"names":[],"mappings":";AACA;;;;;;;;;;;;;GAaG"}

package/dist/mcp-server.js

@@ -0,0 +1,393 @@
+#!/usr/bin/env node
+/**
+ * claudecode-rlm MCP Server
+ *
+ * Provides knowledge graph-based context storage for Claude Code via MCP.
+ *
+ * Tools:
+ * - graph_query: Query the knowledge graph
+ * - memory_store: Store content in the knowledge graph
+ * - memory_search: Search stored content with enhanced scoring
+ * - list_entities: List tracked entities
+ * - graph_stats: Get graph statistics
+ *
+ * @module claudecode-rlm/mcp-server
+ */
+import { Server } from "@modelcontextprotocol/sdk/server/index.js";
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import { CallToolRequestSchema, ListToolsRequestSchema, } from "@modelcontextprotocol/sdk/types.js";
+import { GraphStorage, GraphIngester, GraphTraverser, GraphSearcher } from "./graph/index.js";
+import { EnhancedSearch } from "./search/index.js";
+import { NodeType } from "./graph/types.js";
+// Initialize storage with current working directory
+const workdir = process.env.CLAUDECODE_RLM_WORKDIR || process.cwd();
+GraphStorage.init(workdir);
+// Default session ID (can be overridden per-call)
+const DEFAULT_SESSION = process.env.CLAUDECODE_RLM_SESSION || "default";
+/**
+ * MCP Tool definitions
+ */
+const TOOLS = [
+    {
+        name: "graph_query",
+        description: "Query the knowledge graph. Operations: search (keyword search), entity (find by entity name), expand (get related context), path (find connection between entities)",
+        inputSchema: {
+            type: "object",
+            properties: {
+                operation: {
+                    type: "string",
+                    enum: ["search", "entity", "expand", "path"],
+                    description: "The operation to perform"
+                },
+                query: {
+                    type: "string",
+                    description: "Search query, entity name, or node ID depending on operation"
+                },
+                target: {
+                    type: "string",
+                    description: "Target entity for 'path' operation"
+                },
+                limit: {
+                    type: "number",
+                    description: "Maximum results to return (default: 10)"
+                },
+                session: {
+                    type: "string",
+                    description: "Session ID (default: 'default')"
+                }
+            },
+            required: ["operation", "query"]
+        }
+    },
+    {
+        name: "memory_store",
+        description: "Store content in the knowledge graph for later retrieval. Automatically extracts entities and creates searchable chunks.",
+        inputSchema: {
+            type: "object",
+            properties: {
+                content: {
+                    type: "string",
+                    description: "The content to store"
+                },
+                summary: {
+                    type: "string",
+                    description: "Optional summary of the content"
+                },
+                session: {
+                    type: "string",
+                    description: "Session ID (default: 'default')"
+                }
+            },
+            required: ["content"]
+        }
+    },
+    {
+        name: "memory_search",
+        description: "Search stored content with enhanced scoring including recency weighting and entity boosting.",
+        inputSchema: {
+            type: "object",
+            properties: {
+                query: {
+                    type: "string",
+                    description: "Search query"
+                },
+                limit: {
+                    type: "number",
+                    description: "Maximum results (default: 10)"
+                },
+                recency_weight: {
+                    type: "number",
+                    description: "Recency weight 0-1 (default: 0.3)"
+                },
+                entity_boost: {
+                    type: "number",
+                    description: "Entity match boost 0-1 (default: 0.2)"
+                },
+                session: {
+                    type: "string",
+                    description: "Session ID (default: 'default')"
+                }
+            },
+            required: ["query"]
+        }
+    },
+    {
+        name: "list_entities",
+        description: "List all tracked entities (code elements, files, concepts) in the knowledge graph.",
+        inputSchema: {
+            type: "object",
+            properties: {
+                filter: {
+                    type: "string",
+                    description: "Optional filter string to match entity names"
+                },
+                limit: {
+                    type: "number",
+                    description: "Maximum entities to return (default: 50)"
+                },
+                session: {
+                    type: "string",
+                    description: "Session ID (default: 'default')"
+                }
+            }
+        }
+    },
+    {
+        name: "graph_stats",
+        description: "Get knowledge graph statistics including node counts, cache performance, and storage info.",
+        inputSchema: {
+            type: "object",
+            properties: {
+                session: {
+                    type: "string",
+                    description: "Session ID (default: 'default')"
+                }
+            }
+        }
+    }
+];
+/**
+ * Handle tool execution
+ */
+async function handleToolCall(name, args) {
+    const session = args.session || DEFAULT_SESSION;
+    switch (name) {
+        case "graph_query": {
+            const operation = args.operation;
+            const query = args.query;
+            const limit = args.limit || 10;
+            switch (operation) {
+                case "search": {
+                    const results = GraphSearcher.search(session, query, { limit });
+                    if (results.length === 0) {
+                        return `No results found for "${query}"`;
+                    }
+                    return formatSearchResults(results, query);
+                }
+                case "entity": {
+                    const chunks = GraphTraverser.getEntityContext(session, query, limit);
+                    if (chunks.length === 0) {
+                        return `No content found mentioning "${query}"`;
+                    }
+                    return formatEntityResults(chunks, query);
+                }
+                case "expand": {
+                    const expanded = GraphTraverser.expandContext(session, [query], 2, limit);
+                    if (expanded.length === 0) {
+                        return `No related context found for node "${query}"`;
+                    }
+                    return formatExpandResults(expanded);
+                }
+                case "path": {
+                    const target = args.target;
+                    if (!target) {
+                        return "Error: 'target' is required for path operation";
+                    }
+                    const path = GraphTraverser.findPath(session, query, target, 5);
+                    if (!path) {
+                        return `No path found between "${query}" and "${target}"`;
+                    }
+                    return formatPathResults(path, query, target);
+                }
+                default:
+                    return `Unknown operation: ${operation}`;
+            }
+        }
+        case "memory_store": {
+            const content = args.content;
+            const summary = args.summary || "";
+            const block = {
+                id: `block-${Date.now()}-${Math.random().toString(36).slice(2, 8)}`,
+                sessionID: session,
+                content,
+                summary,
+                tokens: Math.ceil(content.length / 4), // rough estimate
+                createdAt: Date.now()
+            };
+            const docNode = GraphIngester.ingestContextBlock(block);
+            GraphStorage.flush();
+            const stats = GraphStorage.getStats(session);
+            return `Stored content successfully.\n\nDocument ID: ${docNode.id}\nChunks created: ${stats.nodesByType["chunk"] || 0}\nEntities extracted: ${stats.nodesByType["entity"] || 0}`;
+        }
+        case "memory_search": {
+            const query = args.query;
+            const limit = args.limit || 10;
+            const recencyWeight = args.recency_weight || 0.3;
+            const entityBoost = args.entity_boost || 0.2;
+            const results = EnhancedSearch.search(session, query, {
+                limit,
+                recencyWeight,
+                entityBoost,
+                minScoreThreshold: 0.1
+            });
+            if (results.length === 0) {
+                return `No results found for "${query}"`;
+            }
+            return formatEnhancedResults(results, query);
+        }
+        case "list_entities": {
+            const filter = args.filter;
+            const limit = args.limit || 50;
+            const entities = GraphStorage.getNodesByType(session, NodeType.ENTITY, limit);
+            let filtered = entities;
+            if (filter) {
+                const filterLower = filter.toLowerCase();
+                filtered = entities.filter(e => e.content.toLowerCase().includes(filterLower));
+            }
+            if (filtered.length === 0) {
+                return filter
+                    ? `No entities found matching "${filter}"`
+                    : "No entities tracked yet. Store some content first.";
+            }
+            const grouped = {};
+            for (const entity of filtered) {
+                const type = entity.metadata?.entityType || "unknown";
+                if (!grouped[type])
+                    grouped[type] = [];
+                grouped[type].push(entity.content);
+            }
+            let output = `Found ${filtered.length} entities:\n\n`;
+            for (const [type, names] of Object.entries(grouped)) {
+                output += `**${type}** (${names.length}):\n`;
+                output += names.slice(0, 20).map(n => `  - ${n}`).join("\n");
+                if (names.length > 20)
+                    output += `\n  ... and ${names.length - 20} more`;
+                output += "\n\n";
+            }
+            return output.trim();
+        }
+        case "graph_stats": {
+            const stats = GraphStorage.getStats(session);
+            const sessions = GraphStorage.getSessions();
+            return `**Knowledge Graph Statistics**
+
+Session: ${session}
+Total Sessions: ${sessions.length}
+
+**Nodes:**
+- Documents: ${stats.nodesByType["document"] || 0}
+- Sections: ${stats.nodesByType["section"] || 0}
+- Chunks: ${stats.nodesByType["chunk"] || 0}
+- Entities: ${stats.nodesByType["entity"] || 0}
+- Total: ${stats.nodeCount}
+
+**Edges:** ${stats.edgeCount}
+
+**Cache Performance:**
+- Hits: ${stats.cacheStats.hits}
+- Misses: ${stats.cacheStats.misses}
+- Hit Rate: ${stats.cacheStats.hitRate}
+
+**Storage:** .claude/claudecode-rlm/graph/${session}/`;
+        }
+        default:
+            return `Unknown tool: ${name}`;
+    }
+}
+/**
+ * Format search results
+ */
+function formatSearchResults(results, query) {
+    let output = `Found ${results.length} results for "${query}":\n\n`;
+    for (let i = 0; i < results.length; i++) {
+        const { node, score } = results[i];
+        const date = new Date(node.createdAt).toLocaleDateString();
+        const preview = node.content.slice(0, 200).replace(/\n/g, " ");
+        output += `**[${i + 1}]** (score: ${score.toFixed(2)}, ${date})\n${preview}${node.content.length > 200 ? "..." : ""}\n\n`;
+    }
+    return output.trim();
+}
+/**
+ * Format entity results
+ */
+function formatEntityResults(chunks, entity) {
+    let output = `Found ${chunks.length} mentions of "${entity}":\n\n`;
+    for (let i = 0; i < chunks.length; i++) {
+        const chunk = chunks[i];
+        const date = new Date(chunk.createdAt).toLocaleDateString();
+        const preview = chunk.content.slice(0, 200).replace(/\n/g, " ");
+        output += `**[${i + 1}]** (${date})\n${preview}${chunk.content.length > 200 ? "..." : ""}\n\n`;
+    }
+    return output.trim();
+}
+/**
+ * Format expand results
+ */
+function formatExpandResults(nodes) {
+    let output = `Related context (${nodes.length} nodes):\n\n`;
+    for (const node of nodes) {
+        const preview = node.content.slice(0, 150).replace(/\n/g, " ");
+        output += `- [${node.type}] ${preview}${node.content.length > 150 ? "..." : ""}\n`;
+    }
+    return output.trim();
+}
+/**
+ * Format path results
+ */
+function formatPathResults(path, start, end) {
+    let output = `Path from "${start}" to "${end}" (${path.length} nodes):\n\n`;
+    for (let i = 0; i < path.length; i++) {
+        const node = path[i];
+        const preview = node.content.slice(0, 100).replace(/\n/g, " ");
+        output += `${i + 1}. [${node.type}] ${preview}\n`;
+        if (i < path.length - 1)
+            output += "   ↓\n";
+    }
+    return output.trim();
+}
+/**
+ * Format enhanced search results
+ */
+function formatEnhancedResults(results, query) {
+    let output = `Found ${results.length} results for "${query}":\n\n`;
+    for (let i = 0; i < results.length; i++) {
+        const { node, finalScore, recencyScore } = results[i];
+        const date = new Date(node.createdAt).toLocaleDateString();
+        const preview = node.content.slice(0, 200).replace(/\n/g, " ");
+        output += `**[${i + 1}]** (score: ${finalScore.toFixed(2)}, recency: ${recencyScore.toFixed(2)}, ${date})\n${preview}${node.content.length > 200 ? "..." : ""}\n\n`;
+    }
+    return output.trim();
+}
+/**
+ * Main MCP server
+ */
+async function main() {
+    const server = new Server({
+        name: "claudecode-rlm",
+        version: "1.0.0"
+    }, {
+        capabilities: {
+            tools: {}
+        }
+    });
+    // List available tools
+    server.setRequestHandler(ListToolsRequestSchema, async () => {
+        return { tools: TOOLS };
+    });
+    // Handle tool calls
+    server.setRequestHandler(CallToolRequestSchema, async (request) => {
+        const { name, arguments: args } = request.params;
+        try {
+            const result = await handleToolCall(name, args || {});
+            return {
+                content: [{ type: "text", text: result }]
+            };
+        }
+        catch (error) {
+            const message = error instanceof Error ? error.message : String(error);
+            return {
+                content: [{ type: "text", text: `Error: ${message}` }],
+                isError: true
+            };
+        }
+    });
+    // Start server
+    const transport = new StdioServerTransport();
+    await server.connect(transport);
+    console.error("[claudecode-rlm] MCP server started");
+}
+main().catch((error) => {
+    console.error("[claudecode-rlm] Fatal error:", error);
+    process.exit(1);
+});
+//# sourceMappingURL=mcp-server.js.map

package/dist/mcp-server.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mcp-server.js","sourceRoot":"","sources":["../src/mcp-server.ts"],"names":[],"mappings":";AACA;;;;;;;;;;;;;GAaG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,2CAA2C,CAAA;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAA;AAChF,OAAO,EACL,qBAAqB,EACrB,sBAAsB,GAEvB,MAAM,oCAAoC,CAAA;AAE3C,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AAC7F,OAAO,EAAE,cAAc,EAAoB,MAAM,mBAAmB,CAAA;AACpE,OAAO,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAA;AAE3C,oDAAoD;AACpD,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,sBAAsB,IAAI,OAAO,CAAC,GAAG,EAAE,CAAA;AACnE,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;AAE1B,kDAAkD;AAClD,MAAM,eAAe,GAAG,OAAO,CAAC,GAAG,CAAC,sBAAsB,IAAI,SAAS,CAAA;AAEvE;;GAEG;AACH,MAAM,KAAK,GAAW;IACpB;QACE,IAAI,EAAE,aAAa;QACnB,WAAW,EAAE,qKAAqK;QAClL,WAAW,EAAE;YACX,IAAI,EAAE,QAAiB;YACvB,UAAU,EAAE;gBACV,SAAS,EAAE;oBACT,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC;oBAC5C,WAAW,EAAE,0BAA0B;iBACxC;gBACD,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,8DAA8D;iBAC5E;gBACD,MAAM,EAAE;oBACN,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,oCAAoC;iBAClD;gBACD,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,yCAAyC;iBACvD;gBACD,OAAO,EAAE;oBACP,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,iCAAiC;iBAC/C;aACF;YACD,QAAQ,EAAE,CAAC,WAAW,EAAE,OAAO,CAAC;SACjC;KACF;IACD;QACE,IAAI,EAAE,cAAc;QACpB,WAAW,EAAE,0HAA0H;QACvI,WAAW,EAAE;YACX,IAAI,EAAE,QAAiB;YACvB,UAAU,EAAE;gBACV,OAAO,EAAE;oBACP,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,sBAAsB;iBACpC;gBACD,OAAO,EAAE;oBACP,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,iCAAiC;iBAC/C;gBACD,OAAO,EAAE;oBACP,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,iCAAiC;iBAC/C;aACF;YACD,QAAQ,EAAE,CAAC,SAAS,CAAC;SACtB;KACF;IACD;QACE,IAAI,EAAE,eAAe;QACrB,WAAW,EAAE,8FAA8F;QAC3G,WAAW,EAAE;YACX,IAAI,EAAE,QAAiB;YACvB,UAAU,EAAE;gBACV,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,cAAc;iBAC5B;gBACD,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,+BAA+B;iBAC7C;gBACD,cAAc,EAAE;oBACd,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,mCAAmC;iBACjD;gBACD,YAAY,EAAE;oBACZ,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,uCAAuC;iBACrD;gBACD,OAAO,EAAE;oBACP,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,iCAAiC;iBAC/C;aACF;YACD,QAAQ,EAAE,CAAC,OAAO,CAAC;SACpB;KACF;IACD;QACE,IAAI,EAAE,eAAe;QACrB,WAAW,EAAE,oFAAoF;QACjG,WAAW,EAAE;YACX,IAAI,EAAE,QAAiB;YACvB,UAAU,EAAE;gBACV,MAAM,EAAE;oBACN,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,8CAA8C;iBAC5D;gBACD,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,0CAA0C;iBACxD;gBACD,OAAO,EAAE;oBACP,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,iCAAiC;iBAC/C;aACF;SACF;KACF;IACD;QACE,IAAI,EAAE,aAAa;QACnB,WAAW,EAAE,4FAA4F;QACzG,WAAW,EAAE;YACX,IAAI,EAAE,QAAiB;YACvB,UAAU,EAAE;gBACV,OAAO,EAAE;oBACP,IAAI,EAAE,QAAQ;oBACd,WAAW,EAAE,iCAAiC;iBAC/C;aACF;SACF;KACF;CACF,CAAA;AAED;;GAEG;AACH,KAAK,UAAU,cAAc,CAAC,IAAY,EAAE,IAA6B;IACvE,MAAM,OAAO,GAAI,IAAI,CAAC,OAAkB,IAAI,eAAe,CAAA;IAE3D,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAmB,CAAA;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAe,CAAA;YAClC,MAAM,KAAK,GAAI,IAAI,CAAC,KAAgB,IAAI,EAAE,CAAA;YAE1C,QAAQ,SAAS,EAAE,CAAC;gBAClB,KAAK,QAAQ,CAAC,CAAC,CAAC;oBACd,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;oBAC/D,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBACzB,OAAO,yBAAyB,KAAK,GAAG,CAAA;oBAC1C,CAAC;oBACD,OAAO,mBAAmB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;gBAC5C,CAAC;gBACD,KAAK,QAAQ,CAAC,CAAC,CAAC;oBACd,MAAM,MAAM,GAAG,cAAc,CAAC,gBAAgB,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;oBACrE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBACxB,OAAO,gCAAgC,KAAK,GAAG,CAAA;oBACjD,CAAC;oBACD,OAAO,mBAAmB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;gBAC3C,CAAC;gBACD,KAAK,QAAQ,CAAC,CAAC,CAAC;oBACd,MAAM,QAAQ,GAAG,cAAc,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAA;oBACzE,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;wBAC1B,OAAO,sCAAsC,KAAK,GAAG,CAAA;oBACvD,CAAC;oBACD,OAAO,mBAAmB,CAAC,QAAQ,CAAC,CAAA;gBACtC,CAAC;gBACD,KAAK,MAAM,CAAC,CAAC,CAAC;oBACZ,MAAM,MAAM,GAAG,IAAI,CAAC,MAAgB,CAAA;oBACpC,IAAI,CAAC,MAAM,EAAE,CAAC;wBACZ,OAAO,gDAAgD,CAAA;oBACzD,CAAC;oBACD,MAAM,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;oBAC/D,IAAI,CAAC,IAAI,EAAE,CAAC;wBACV,OAAO,0BAA0B,KAAK,UAAU,MAAM,GAAG,CAAA;oBAC3D,CAAC;oBACD,OAAO,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAA;gBAC/C,CAAC;gBACD;oBACE,OAAO,sBAAsB,SAAS,EAAE,CAAA;YAC5C,CAAC;QACH,CAAC;QAED,KAAK,cAAc,CAAC,CAAC,CAAC;YACpB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAiB,CAAA;YACtC,MAAM,OAAO,GAAI,IAAI,CAAC,OAAkB,IAAI,EAAE,CAAA;YAE9C,MAAM,KAAK,GAAG;gBACZ,EAAE,EAAE,SAAS,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;gBACnE,SAAS,EAAE,OAAO;gBAClB,OAAO;gBACP,OAAO;gBACP,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,iBAAiB;gBACxD,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;aACtB,CAAA;YAED,MAAM,OAAO,GAAG,aAAa,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAA;YACvD,YAAY,CAAC,KAAK,EAAE,CAAA;YAEpB,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;YAC5C,OAAO,gDAAgD,OAAO,CAAC,EAAE,qBAAqB,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAA;QAClL,CAAC;QAED,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAe,CAAA;YAClC,MAAM,KAAK,GAAI,IAAI,CAAC,KAAgB,IAAI,EAAE,CAAA;YAC1C,MAAM,aAAa,GAAI,IAAI,CAAC,cAAyB,IAAI,GAAG,CAAA;YAC5D,MAAM,WAAW,GAAI,IAAI,CAAC,YAAuB,IAAI,GAAG,CAAA;YAExD,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,EAAE;gBACpD,KAAK;gBACL,aAAa;gBACb,WAAW;gBACX,iBAAiB,EAAE,GAAG;aACvB,CAAC,CAAA;YAEF,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,OAAO,yBAAyB,KAAK,GAAG,CAAA;YAC1C,CAAC;YAED,OAAO,qBAAqB,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;QAC9C,CAAC;QAED,KAAK,eAAe,CAAC,CAAC,CAAC;YACrB,MAAM,MAAM,GAAG,IAAI,CAAC,MAA4B,CAAA;YAChD,MAAM,KAAK,GAAI,IAAI,CAAC,KAAgB,IAAI,EAAE,CAAA;YAE1C,MAAM,QAAQ,GAAG,YAAY,CAAC,cAAc,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;YAE7E,IAAI,QAAQ,GAAG,QAAQ,CAAA;YACvB,IAAI,MAAM,EAAE,CAAC;gBACX,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,EAAE,CAAA;gBACxC,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;YAChF,CAAC;YAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,OAAO,MAAM;oBACX,CAAC,CAAC,+BAA+B,MAAM,GAAG;oBAC1C,CAAC,CAAC,oDAAoD,CAAA;YAC1D,CAAC;YAED,MAAM,OAAO,GAA6B,EAAE,CAAA;YAC5C,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAI,MAAM,CAAC,QAAQ,EAAE,UAAqB,IAAI,SAAS,CAAA;gBACjE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;oBAAE,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;gBACtC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;YACpC,CAAC;YAED,IAAI,MAAM,GAAG,SAAS,QAAQ,CAAC,MAAM,gBAAgB,CAAA;YACrD,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;gBACpD,MAAM,IAAI,KAAK,IAAI,OAAO,KAAK,CAAC,MAAM,MAAM,CAAA;gBAC5C,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC5D,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE;oBAAE,MAAM,IAAI,eAAe,KAAK,CAAC,MAAM,GAAG,EAAE,OAAO,CAAA;gBACxE,MAAM,IAAI,MAAM,CAAA;YAClB,CAAC;YAED,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;QACtB,CAAC;QAED,KAAK,aAAa,CAAC,CAAC,CAAC;YACnB,MAAM,KAAK,GAAG,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAA;YAC5C,MAAM,QAAQ,GAAG,YAAY,CAAC,WAAW,EAAE,CAAA;YAE3C,OAAO;;WAEF,OAAO;kBACA,QAAQ,CAAC,MAAM;;;eAGlB,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC;cACnC,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,IAAI,CAAC;YACnC,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC;cAC7B,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC;WACnC,KAAK,CAAC,SAAS;;aAEb,KAAK,CAAC,SAAS;;;UAGlB,KAAK,CAAC,UAAU,CAAC,IAAI;YACnB,KAAK,CAAC,UAAU,CAAC,MAAM;cACrB,KAAK,CAAC,UAAU,CAAC,OAAO;;4CAEM,OAAO,GAAG,CAAA;QAClD,CAAC;QAED;YACE,OAAO,iBAAiB,IAAI,EAAE,CAAA;IAClC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,OAA+E,EAAE,KAAa;IACzH,IAAI,MAAM,GAAG,SAAS,OAAO,CAAC,MAAM,iBAAiB,KAAK,QAAQ,CAAA;IAElE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QAClC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,kBAAkB,EAAE,CAAA;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QAC9D,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC,eAAe,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAA;IAC3H,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;AACtB,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,MAAqD,EAAE,MAAc;IAChG,IAAI,MAAM,GAAG,SAAS,MAAM,CAAC,MAAM,iBAAiB,MAAM,QAAQ,CAAA;IAElE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;QACvB,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,kBAAkB,EAAE,CAAA;QAC3D,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QAC/D,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC,QAAQ,IAAI,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAA;IAChG,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;AACtB,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,KAA+C;IAC1E,IAAI,MAAM,GAAG,oBAAoB,KAAK,CAAC,MAAM,cAAc,CAAA;IAE3D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QAC9D,MAAM,IAAI,MAAM,IAAI,CAAC,IAAI,KAAK,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAA;IACpF,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;AACtB,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,IAA8C,EAAE,KAAa,EAAE,GAAW;IACnG,IAAI,MAAM,GAAG,cAAc,KAAK,SAAS,GAAG,MAAM,IAAI,CAAC,MAAM,cAAc,CAAA;IAE3E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACpB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QAC9D,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,CAAA;QACjD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM,IAAI,QAAQ,CAAA;IAC7C,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;AACtB,CAAC;AAED;;GAEG;AACH,SAAS,qBAAqB,CAAC,OAA0G,EAAE,KAAa;IACtJ,IAAI,MAAM,GAAG,SAAS,OAAO,CAAC,MAAM,iBAAiB,KAAK,QAAQ,CAAA;IAElE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACrD,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,kBAAkB,EAAE,CAAA;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;QAC9D,MAAM,IAAI,MAAM,CAAC,GAAG,CAAC,eAAe,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,IAAI,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAA;IACrK,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;AACtB,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,IAAI;IACjB,MAAM,MAAM,GAAG,IAAI,MAAM,CACvB;QACE,IAAI,EAAE,gBAAgB;QACtB,OAAO,EAAE,OAAO;KACjB,EACD;QACE,YAAY,EAAE;YACZ,KAAK,EAAE,EAAE;SACV;KACF,CACF,CAAA;IAED,uBAAuB;IACvB,MAAM,CAAC,iBAAiB,CAAC,sBAAsB,EAAE,KAAK,IAAI,EAAE;QAC1D,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IACzB,CAAC,CAAC,CAAA;IAEF,oBAAoB;IACpB,MAAM,CAAC,iBAAiB,CAAC,qBAAqB,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE;QAChE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,CAAA;QAEhD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,IAAI,EAAE,IAA+B,IAAI,EAAE,CAAC,CAAA;YAChF,OAAO;gBACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;aAC1C,CAAA;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;YACtE,OAAO;gBACL,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,OAAO,EAAE,EAAE,CAAC;gBACtD,OAAO,EAAE,IAAI;aACd,CAAA;QACH,CAAC;IACH,CAAC,CAAC,CAAA;IAEF,eAAe;IACf,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAA;IAC5C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;IAE/B,OAAO,CAAC,KAAK,CAAC,qCAAqC,CAAC,CAAA;AACtD,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;IACrB,OAAO,CAAC,KAAK,CAAC,+BAA+B,EAAE,KAAK,CAAC,CAAA;IACrD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;AACjB,CAAC,CAAC,CAAA"}

package/package.json

@@ -1,8 +1,8 @@
 {
   "$schema": "https://json.schemastore.org/package.json",
   "name": "claudecode-rlm",
-  "version": "1.0.0",
-  "description": "Advanced RLM (Recursive Language Model) plugin for Claude Code - Knowledge graph-based context storage with 74x faster reads",
+  "version": "1.1.0",
+  "description": "MCP server for Claude Code - Knowledge graph-based context storage with 74x faster reads",
   "type": "module",
   "license": "MIT",
   "author": "Michael Thornton <tekcin@yahoo.com>",
@@ -15,22 +15,29 @@
     "url": "https://github.com/tekcin/claudecode-rlm/issues"
   },
   "keywords": [
+    "mcp",
+    "mcp-server",
     "claude-code",
-    "claudecode",
-    "plugin",
-    "rlm",
-    "context",
+    "claude",
+    "anthropic",
     "knowledge-graph",
+    "context",
+    "memory",
     "ai",
-    "llm",
-    "anthropic"
+    "llm"
   ],
   "main": "./dist/index.js",
   "types": "./dist/index.d.ts",
+  "bin": {
+    "claudecode-rlm": "./dist/mcp-server.js"
+  },
   "exports": {
     ".": {
       "import": "./dist/index.js",
       "types": "./dist/index.d.ts"
+    },
+    "./mcp-server": {
+      "import": "./dist/mcp-server.js"
     }
   },
   "files": [
@@ -41,21 +48,15 @@
     "build": "tsc",
     "dev": "tsc --watch",
     "typecheck": "tsc --noEmit",
+    "start": "node dist/mcp-server.js",
     "test": "node test/benchmark.cjs",
     "test:optimized": "node test/benchmark-optimized.cjs",
     "prepublishOnly": "npm run build"
   },
   "dependencies": {
+    "@modelcontextprotocol/sdk": "^1.25.3",
     "zod": "^3.23.0"
   },
-  "peerDependencies": {
-    "@anthropic-ai/claude-code": ">=1.0.0"
-  },
-  "peerDependenciesMeta": {
-    "@anthropic-ai/claude-code": {
-      "optional": true
-    }
-  },
   "devDependencies": {
     "@types/node": "^22.0.0",
     "typescript": "^5.6.0"

package/src/mcp-server.ts

@@ -0,0 +1,443 @@
+#!/usr/bin/env node
+/**
+ * claudecode-rlm MCP Server
+ *
+ * Provides knowledge graph-based context storage for Claude Code via MCP.
+ *
+ * Tools:
+ * - graph_query: Query the knowledge graph
+ * - memory_store: Store content in the knowledge graph
+ * - memory_search: Search stored content with enhanced scoring
+ * - list_entities: List tracked entities
+ * - graph_stats: Get graph statistics
+ *
+ * @module claudecode-rlm/mcp-server
+ */
+
+import { Server } from "@modelcontextprotocol/sdk/server/index.js"
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js"
+import {
+  CallToolRequestSchema,
+  ListToolsRequestSchema,
+  type Tool,
+} from "@modelcontextprotocol/sdk/types.js"
+
+import { GraphStorage, GraphIngester, GraphTraverser, GraphSearcher } from "./graph/index.js"
+import { EnhancedSearch, detectsReference } from "./search/index.js"
+import { NodeType } from "./graph/types.js"
+
+// Initialize storage with current working directory
+const workdir = process.env.CLAUDECODE_RLM_WORKDIR || process.cwd()
+GraphStorage.init(workdir)
+
+// Default session ID (can be overridden per-call)
+const DEFAULT_SESSION = process.env.CLAUDECODE_RLM_SESSION || "default"
+
+/**
+ * MCP Tool definitions
+ */
+const TOOLS: Tool[] = [
+  {
+    name: "graph_query",
+    description: "Query the knowledge graph. Operations: search (keyword search), entity (find by entity name), expand (get related context), path (find connection between entities)",
+    inputSchema: {
+      type: "object" as const,
+      properties: {
+        operation: {
+          type: "string",
+          enum: ["search", "entity", "expand", "path"],
+          description: "The operation to perform"
+        },
+        query: {
+          type: "string",
+          description: "Search query, entity name, or node ID depending on operation"
+        },
+        target: {
+          type: "string",
+          description: "Target entity for 'path' operation"
+        },
+        limit: {
+          type: "number",
+          description: "Maximum results to return (default: 10)"
+        },
+        session: {
+          type: "string",
+          description: "Session ID (default: 'default')"
+        }
+      },
+      required: ["operation", "query"]
+    }
+  },
+  {
+    name: "memory_store",
+    description: "Store content in the knowledge graph for later retrieval. Automatically extracts entities and creates searchable chunks.",
+    inputSchema: {
+      type: "object" as const,
+      properties: {
+        content: {
+          type: "string",
+          description: "The content to store"
+        },
+        summary: {
+          type: "string",
+          description: "Optional summary of the content"
+        },
+        session: {
+          type: "string",
+          description: "Session ID (default: 'default')"
+        }
+      },
+      required: ["content"]
+    }
+  },
+  {
+    name: "memory_search",
+    description: "Search stored content with enhanced scoring including recency weighting and entity boosting.",
+    inputSchema: {
+      type: "object" as const,
+      properties: {
+        query: {
+          type: "string",
+          description: "Search query"
+        },
+        limit: {
+          type: "number",
+          description: "Maximum results (default: 10)"
+        },
+        recency_weight: {
+          type: "number",
+          description: "Recency weight 0-1 (default: 0.3)"
+        },
+        entity_boost: {
+          type: "number",
+          description: "Entity match boost 0-1 (default: 0.2)"
+        },
+        session: {
+          type: "string",
+          description: "Session ID (default: 'default')"
+        }
+      },
+      required: ["query"]
+    }
+  },
+  {
+    name: "list_entities",
+    description: "List all tracked entities (code elements, files, concepts) in the knowledge graph.",
+    inputSchema: {
+      type: "object" as const,
+      properties: {
+        filter: {
+          type: "string",
+          description: "Optional filter string to match entity names"
+        },
+        limit: {
+          type: "number",
+          description: "Maximum entities to return (default: 50)"
+        },
+        session: {
+          type: "string",
+          description: "Session ID (default: 'default')"
+        }
+      }
+    }
+  },
+  {
+    name: "graph_stats",
+    description: "Get knowledge graph statistics including node counts, cache performance, and storage info.",
+    inputSchema: {
+      type: "object" as const,
+      properties: {
+        session: {
+          type: "string",
+          description: "Session ID (default: 'default')"
+        }
+      }
+    }
+  }
+]
+
+/**
+ * Handle tool execution
+ */
+async function handleToolCall(name: string, args: Record<string, unknown>): Promise<string> {
+  const session = (args.session as string) || DEFAULT_SESSION
+
+  switch (name) {
+    case "graph_query": {
+      const operation = args.operation as string
+      const query = args.query as string
+      const limit = (args.limit as number) || 10
+
+      switch (operation) {
+        case "search": {
+          const results = GraphSearcher.search(session, query, { limit })
+          if (results.length === 0) {
+            return `No results found for "${query}"`
+          }
+          return formatSearchResults(results, query)
+        }
+        case "entity": {
+          const chunks = GraphTraverser.getEntityContext(session, query, limit)
+          if (chunks.length === 0) {
+            return `No content found mentioning "${query}"`
+          }
+          return formatEntityResults(chunks, query)
+        }
+        case "expand": {
+          const expanded = GraphTraverser.expandContext(session, [query], 2, limit)
+          if (expanded.length === 0) {
+            return `No related context found for node "${query}"`
+          }
+          return formatExpandResults(expanded)
+        }
+        case "path": {
+          const target = args.target as string
+          if (!target) {
+            return "Error: 'target' is required for path operation"
+          }
+          const path = GraphTraverser.findPath(session, query, target, 5)
+          if (!path) {
+            return `No path found between "${query}" and "${target}"`
+          }
+          return formatPathResults(path, query, target)
+        }
+        default:
+          return `Unknown operation: ${operation}`
+      }
+    }
+
+    case "memory_store": {
+      const content = args.content as string
+      const summary = (args.summary as string) || ""
+
+      const block = {
+        id: `block-${Date.now()}-${Math.random().toString(36).slice(2, 8)}`,
+        sessionID: session,
+        content,
+        summary,
+        tokens: Math.ceil(content.length / 4), // rough estimate
+        createdAt: Date.now()
+      }
+
+      const docNode = GraphIngester.ingestContextBlock(block)
+      GraphStorage.flush()
+
+      const stats = GraphStorage.getStats(session)
+      return `Stored content successfully.\n\nDocument ID: ${docNode.id}\nChunks created: ${stats.nodesByType["chunk"] || 0}\nEntities extracted: ${stats.nodesByType["entity"] || 0}`
+    }
+
+    case "memory_search": {
+      const query = args.query as string
+      const limit = (args.limit as number) || 10
+      const recencyWeight = (args.recency_weight as number) || 0.3
+      const entityBoost = (args.entity_boost as number) || 0.2
+
+      const results = EnhancedSearch.search(session, query, {
+        limit,
+        recencyWeight,
+        entityBoost,
+        minScoreThreshold: 0.1
+      })
+
+      if (results.length === 0) {
+        return `No results found for "${query}"`
+      }
+
+      return formatEnhancedResults(results, query)
+    }
+
+    case "list_entities": {
+      const filter = args.filter as string | undefined
+      const limit = (args.limit as number) || 50
+
+      const entities = GraphStorage.getNodesByType(session, NodeType.ENTITY, limit)
+
+      let filtered = entities
+      if (filter) {
+        const filterLower = filter.toLowerCase()
+        filtered = entities.filter(e => e.content.toLowerCase().includes(filterLower))
+      }
+
+      if (filtered.length === 0) {
+        return filter
+          ? `No entities found matching "${filter}"`
+          : "No entities tracked yet. Store some content first."
+      }
+
+      const grouped: Record<string, string[]> = {}
+      for (const entity of filtered) {
+        const type = (entity.metadata?.entityType as string) || "unknown"
+        if (!grouped[type]) grouped[type] = []
+        grouped[type].push(entity.content)
+      }
+
+      let output = `Found ${filtered.length} entities:\n\n`
+      for (const [type, names] of Object.entries(grouped)) {
+        output += `**${type}** (${names.length}):\n`
+        output += names.slice(0, 20).map(n => `  - ${n}`).join("\n")
+        if (names.length > 20) output += `\n  ... and ${names.length - 20} more`
+        output += "\n\n"
+      }
+
+      return output.trim()
+    }
+
+    case "graph_stats": {
+      const stats = GraphStorage.getStats(session)
+      const sessions = GraphStorage.getSessions()
+
+      return `**Knowledge Graph Statistics**
+
+Session: ${session}
+Total Sessions: ${sessions.length}
+
+**Nodes:**
+- Documents: ${stats.nodesByType["document"] || 0}
+- Sections: ${stats.nodesByType["section"] || 0}
+- Chunks: ${stats.nodesByType["chunk"] || 0}
+- Entities: ${stats.nodesByType["entity"] || 0}
+- Total: ${stats.nodeCount}
+
+**Edges:** ${stats.edgeCount}
+
+**Cache Performance:**
+- Hits: ${stats.cacheStats.hits}
+- Misses: ${stats.cacheStats.misses}
+- Hit Rate: ${stats.cacheStats.hitRate}
+
+**Storage:** .claude/claudecode-rlm/graph/${session}/`
+    }
+
+    default:
+      return `Unknown tool: ${name}`
+  }
+}
+
+/**
+ * Format search results
+ */
+function formatSearchResults(results: Array<{ node: { content: string; createdAt: number }; score: number }>, query: string): string {
+  let output = `Found ${results.length} results for "${query}":\n\n`
+
+  for (let i = 0; i < results.length; i++) {
+    const { node, score } = results[i]
+    const date = new Date(node.createdAt).toLocaleDateString()
+    const preview = node.content.slice(0, 200).replace(/\n/g, " ")
+    output += `**[${i + 1}]** (score: ${score.toFixed(2)}, ${date})\n${preview}${node.content.length > 200 ? "..." : ""}\n\n`
+  }
+
+  return output.trim()
+}
+
+/**
+ * Format entity results
+ */
+function formatEntityResults(chunks: Array<{ content: string; createdAt: number }>, entity: string): string {
+  let output = `Found ${chunks.length} mentions of "${entity}":\n\n`
+
+  for (let i = 0; i < chunks.length; i++) {
+    const chunk = chunks[i]
+    const date = new Date(chunk.createdAt).toLocaleDateString()
+    const preview = chunk.content.slice(0, 200).replace(/\n/g, " ")
+    output += `**[${i + 1}]** (${date})\n${preview}${chunk.content.length > 200 ? "..." : ""}\n\n`
+  }
+
+  return output.trim()
+}
+
+/**
+ * Format expand results
+ */
+function formatExpandResults(nodes: Array<{ type: string; content: string }>): string {
+  let output = `Related context (${nodes.length} nodes):\n\n`
+
+  for (const node of nodes) {
+    const preview = node.content.slice(0, 150).replace(/\n/g, " ")
+    output += `- [${node.type}] ${preview}${node.content.length > 150 ? "..." : ""}\n`
+  }
+
+  return output.trim()
+}
+
+/**
+ * Format path results
+ */
+function formatPathResults(path: Array<{ type: string; content: string }>, start: string, end: string): string {
+  let output = `Path from "${start}" to "${end}" (${path.length} nodes):\n\n`
+
+  for (let i = 0; i < path.length; i++) {
+    const node = path[i]
+    const preview = node.content.slice(0, 100).replace(/\n/g, " ")
+    output += `${i + 1}. [${node.type}] ${preview}\n`
+    if (i < path.length - 1) output += "   ↓\n"
+  }
+
+  return output.trim()
+}
+
+/**
+ * Format enhanced search results
+ */
+function formatEnhancedResults(results: Array<{ node: { content: string; createdAt: number }; finalScore: number; recencyScore: number }>, query: string): string {
+  let output = `Found ${results.length} results for "${query}":\n\n`
+
+  for (let i = 0; i < results.length; i++) {
+    const { node, finalScore, recencyScore } = results[i]
+    const date = new Date(node.createdAt).toLocaleDateString()
+    const preview = node.content.slice(0, 200).replace(/\n/g, " ")
+    output += `**[${i + 1}]** (score: ${finalScore.toFixed(2)}, recency: ${recencyScore.toFixed(2)}, ${date})\n${preview}${node.content.length > 200 ? "..." : ""}\n\n`
+  }
+
+  return output.trim()
+}
+
+/**
+ * Main MCP server
+ */
+async function main() {
+  const server = new Server(
+    {
+      name: "claudecode-rlm",
+      version: "1.0.0"
+    },
+    {
+      capabilities: {
+        tools: {}
+      }
+    }
+  )
+
+  // List available tools
+  server.setRequestHandler(ListToolsRequestSchema, async () => {
+    return { tools: TOOLS }
+  })
+
+  // Handle tool calls
+  server.setRequestHandler(CallToolRequestSchema, async (request) => {
+    const { name, arguments: args } = request.params
+
+    try {
+      const result = await handleToolCall(name, args as Record<string, unknown> || {})
+      return {
+        content: [{ type: "text", text: result }]
+      }
+    } catch (error) {
+      const message = error instanceof Error ? error.message : String(error)
+      return {
+        content: [{ type: "text", text: `Error: ${message}` }],
+        isError: true
+      }
+    }
+  })
+
+  // Start server
+  const transport = new StdioServerTransport()
+  await server.connect(transport)
+
+  console.error("[claudecode-rlm] MCP server started")
+}
+
+main().catch((error) => {
+  console.error("[claudecode-rlm] Fatal error:", error)
+  process.exit(1)
+})