mcp-super-memory 0.4.4

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Donggyun Seo
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,290 @@
+# mcp-super-memory
+
+[![PyPI version](https://img.shields.io/pypi/v/mcp-super-memory)](https://pypi.org/project/mcp-super-memory/)
+[![Python](https://img.shields.io/pypi/pyversions/mcp-super-memory)](https://pypi.org/project/mcp-super-memory/)
+[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)
+
+**N:M associative memory graph for LLM agents — delivered as an MCP server.**
+
+> Search **"Newton"** → reach **"strawberry"** through shared keys.
+> Embedding similarity alone can't do this.
+
+`mcp-super-memory` is an associative memory system for LLM agents built on a **Key/Value graph** — not a vector store. Memories live in a **Value Space**, accessed through a separate **Key Space** — one memory reachable via many keys, one key leading to many memories. This enables human-like associative leaps (multi-hop graph traversal) that pure embedding search fundamentally cannot replicate.
+
+**Works with:** Claude Desktop · Claude Code · any MCP-compatible LLM agent
+
+---
+
+## Why Not Just Embeddings?
+
+Every existing memory system (Mem0, A-MEM, MemGPT) stores memories as nodes and retrieves them by embedding similarity. This works until it doesn't:
+
+```
+Query: "Newton"
+Embedding search finds: "Newton discovered gravity" ✅
+Embedding search misses: "user likes strawberries"   ❌
+```
+
+Super Memory finds both — because "Newton" → apple memory → fruit key → strawberry memory. The **path exists in the key graph**, not in embedding space.
+
+---
+
+## How It Works
+
+```
+Key Space (concepts)         Value Space (memories)
+─────────────────────        ──────────────────────────────
+[Newton]  ──────────────────→ "Newton discovered gravity"
+[apple]   ────────┬─────────→      ↑ same memory
+[gravity] ────────┘
+                  │
+[apple]   ────────┼─────────→ "apples are red fruit"
+[fruit]   ──────┬─┘
+[red]     ──────┤
+                │
+[fruit]   ──────┼─────────→ "user likes strawberries"
+[strawberry]────┘
+```
+
+Search `"Newton"` → matches `[Newton]`, `[apple]` keys (1-hop) → follows shared `[fruit]` key → reaches strawberry memory (2-hop, score decayed by 0.3×).
+
+**Results include `hop` field** — you always know if a result is direct or associative.
+
+---
+
+## Key Features
+
+| Feature | Super Memory | A-MEM | Mem0 | MemGPT |
+|---------|-------------|-------|------|--------|
+| Key/Value separation | ✅ N:M | ❌ | ❌ | ❌ |
+| Associative multi-hop | ✅ built-in | ❌ | ❌ | ❌ |
+| Depth system | ✅ | ❌ | ❌ | partial |
+| Memory versioning | ✅ supersede | overwrites | overwrites | ❌ |
+| Time decay | ✅ depth-weighted | ❌ | ❌ | ❌ |
+| Key types | ✅ concept/name/proper_noun | ❌ | ❌ | ❌ |
+| Key merge (IDF) | ✅ | ❌ | ❌ | ❌ |
+| Dual-path recall | ✅ key + content | ❌ | ❌ | ❌ |
+
+### Depth System
+
+Every memory has a depth score `0.0 → 1.0`:
+
+| Stage | Depth | Behavior |
+|-------|-------|----------|
+| Shallow | `< 0.3` | Recent, unverified. Easy to update or forget. |
+| Medium | `0.3–0.7` | Confirmed multiple times. Stable. |
+| Deep | `> 0.7` | Well-established fact. Resists correction. |
+
+Depth increases `+0.05` each recall. Deep memories decay slower over time. If you try to correct a deep memory, it resists — its depth stays higher even after supersede.
+
+### Key Types
+
+Not all keys should behave the same. Names shouldn't match semantically — "동건" shouldn't match "뉴턴" just because they're both short Korean words.
+
+| Type | Matching | Use Case |
+|------|----------|----------|
+| `concept` (default) | Embedding similarity ≥ 0.35 | Topics, categories, attributes |
+| `name` | Exact match only | Person names |
+| `proper_noun` | Exact match only | Brands, places |
+
+Name/proper_noun keys also get IDF penalty (`×0.5`) when they become hub keys connected to many memories, preventing them from polluting unrelated searches.
+
+### Versioning (not overwriting)
+
+```
+"user lives in Seoul"   (depth: 0.4 → weakened to 0.12, preserved)
+        ↑ superseded by
+"user moved to Busan"   (depth: 0.0, new)
+```
+
+Unlike A-MEM which overwrites memory on evolution, Super Memory keeps the full history. Every correction is traceable — when did the belief change, and from what session?
+
+### Key Merging
+
+```
+Add key "파이썬"  → finds existing "Python" (similarity 0.87 > threshold 0.85)
+                 → reuses existing key instead of creating duplicate
+```
+
+Prevents key space fragmentation. Same concept across languages or phrasing stays unified.
+
+### Dual-Path Recall
+
+Recall searches two paths simultaneously:
+
+- **Path A (key matching):** Query embedding → match keys → follow links → memories
+- **Path B (content matching):** Query embedding → directly compare against memory content embeddings
+
+Scores from both paths are summed. This ensures memories are found even when they weren't tagged with the right keys.
+
+---
+
+## Architecture
+
+```
+┌─────────────────────────────────────────────────────────┐
+│                      Key Space                          │
+│   [name] [동건] [programming] [python] [fruit] [red]   │
+│      ↓      ↓         ↓           ↓       ↓      ↓     │
+│   [vec]  [exact]    [vec]       [vec]   [vec]  [vec]   │
+└────────────────────────┬────────────────────────────────┘
+                         │ N:M links
+                         ↓
+┌─────────────────────────────────────────────────────────┐
+│                     Value Space                         │
+│   "user's name is Donggeon"     depth: 0.85  (deep)    │
+│   "user likes Python"           depth: 0.30  (medium)  │
+│   "user likes strawberries"     depth: 0.05  (shallow) │
+└─────────────────────────────────────────────────────────┘
+```
+
+**Recall algorithm (2-hop):**
+1. Embed query → find matching keys (concept: similarity ≥ 0.35, name/proper_noun: exact match)
+2. Also compare query embedding directly against memory content embeddings (≥ 0.3)
+3. Follow links → collect memories, aggregate scores (multiple key matches sum up, IDF-weighted)
+4. For each 1-hop memory: follow *its* keys → find 2-hop memories (score × `HOP_DECAY = 0.3`)
+5. Apply depth factor (`0.5 + depth × 0.5`) and time decay (depth-weighted, 30-day half-life)
+6. Return ranked results with `hop` field
+
+---
+
+## MCP Tools
+
+The memory system exposes 8 tools via MCP:
+
+| Tool | Description |
+|------|-------------|
+| `recall(query, top_k)` | N:M search with 2-hop associative traversal + content matching |
+| `remember(content, keys, key_types?)` | Save memory with key concepts and optional type annotations |
+| `correct(memory_id, content, keys?)` | Versioned update — old memory preserved but weakened |
+| `related(memory_id)` | Find memories sharing keys (associative exploration) |
+| `forget(memory_id)` | Permanently delete |
+| `get_conversation(session_id, turn?)` | Load original conversation turns |
+| `list_memories()` | List all stored memories with keys, depth, access count |
+| `memory_stats()` | Get current key/memory/link counts |
+
+A system prompt template is also available via `memory_system_prompt` MCP prompt — include it to instruct the agent to recall silently, use diverse keys, and never mention the memory system to users.
+
+---
+
+## Quick Start (MCP Server)
+
+### Claude Desktop
+
+Add to `claude_desktop_config.json`:
+
+**OpenAI embeddings:**
+```json
+{
+  "mcpServers": {
+    "mcp-super-memory": {
+      "command": "uvx",
+      "args": ["mcp-super-memory"],
+      "env": {
+        "OPENAI_API_KEY": "your-openai-api-key"
+      }
+    }
+  }
+}
+```
+
+**Local embeddings (no API key required):**
+```json
+{
+  "mcpServers": {
+    "mcp-super-memory": {
+      "command": "uvx",
+      "args": ["mcp-super-memory[local]"],
+      "env": {
+        "EMBEDDING_BACKEND": "local"
+      }
+    }
+  }
+}
+```
+
+### Claude Code
+
+```bash
+# OpenAI embeddings
+claude mcp add mcp-super-memory -e OPENAI_API_KEY=your-openai-api-key -- uvx mcp-super-memory
+
+# Local embeddings (no API key required)
+claude mcp add mcp-super-memory -e EMBEDDING_BACKEND=local -- uvx "mcp-super-memory[local]"
+```
+
+### Manual / Development
+
+```bash
+git clone https://github.com/donggyun112/mcp-super-memory
+cd super-memory
+```
+
+Create `.env`:
+```
+OPENAI_API_KEY=your-openai-api-key
+OPENAI_EMBEDDING_MODEL=text-embedding-3-small
+```
+
+Or use local embeddings (no API key required):
+```
+EMBEDDING_BACKEND=local
+LOCAL_EMBEDDING_MODEL=paraphrase-multilingual-MiniLM-L12-v2  # optional, this is the default
+```
+
+> **Note:** Mixing backends on existing data will break recall. If switching backends, clear `~/.super-memory/graph.json` first.
+
+```bash
+uv sync
+uv run mcp-super-memory
+```
+
+**Requirements:**
+- Python 3.12+
+- OpenAI API key (for embeddings) — or `sentence-transformers` for local embeddings
+
+---
+
+## Data Storage
+
+All data is local. No external database required.
+
+```
+data/
+├── graph.json          # keys, memories, links
+└── conversations/
+    └── {session_id}.jsonl   # original conversation turns
+```
+
+---
+
+## Limitations
+
+- **Linear scan** — suitable for personal use (~10k memories). FAISS/ChromaDB integration planned for larger scale.
+- **2-hop max** — deeper associative chains require `related()` tool calls by the agent.
+- **Agent quality matters** — key selection on `remember` affects retrieval quality. System prompt tuning is important.
+
+---
+
+## Comparison with A-MEM
+
+A-MEM (NeurIPS 2025) focuses on *memory evolution* — when new memories arrive, existing memories' descriptions update. Super Memory focuses on *memory access* — how to reach the right memory through associative paths.
+
+They solve different problems. A-MEM asks "how do we keep memories well-organized?" Super Memory asks "how do we find memories the way humans actually think?"
+
+The versioning approach also differs: A-MEM overwrites on evolution (current state only), Super Memory preserves history (full timeline).
+
+---
+
+## Roadmap
+
+- [ ] FAISS/ChromaDB for scale
+- [ ] Coding agent profile (different key strategies for code context)
+- [ ] Memory export/import
+- [ ] Multi-user support
+
+---
+
+## License
+
+MIT

package/dist/embedding.d.ts

@@ -0,0 +1,5 @@
+export declare const OPENAI_API_KEY: string;
+export declare const OPENAI_EMBEDDING_MODEL: string;
+export declare const EMBEDDING_BACKEND: string;
+export declare function embedTextAsync(text: string): Promise<number[]>;
+//# sourceMappingURL=embedding.d.ts.map

package/dist/embedding.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding.d.ts","sourceRoot":"","sources":["../src/embedding.ts"],"names":[],"mappings":"AAKA,eAAO,MAAM,cAAc,QAAmC,CAAC;AAC/D,eAAO,MAAM,sBAAsB,QAC6B,CAAC;AAKjE,eAAO,MAAM,iBAAiB,QACqB,CAAC;AAsCpD,wBAAsB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAqBpE"}

package/dist/embedding.js

@@ -0,0 +1,59 @@
+import { config } from "dotenv";
+config();
+import OpenAI from "openai";
+export const OPENAI_API_KEY = process.env.OPENAI_API_KEY ?? "";
+export const OPENAI_EMBEDDING_MODEL = process.env.OPENAI_EMBEDDING_MODEL ?? "text-embedding-3-small";
+const LOCAL_EMBEDDING_MODEL = process.env.LOCAL_EMBEDDING_MODEL ?? "paraphrase-multilingual-MiniLM-L12-v2";
+const _DEFAULT_BACKEND = OPENAI_API_KEY ? "openai" : "local";
+export const EMBEDDING_BACKEND = process.env.EMBEDDING_BACKEND ?? _DEFAULT_BACKEND;
+const EMBED_RETRIES = 3;
+let _openaiClient = null;
+function getOpenAIClient() {
+    if (!_openaiClient) {
+        _openaiClient = new OpenAI({ apiKey: OPENAI_API_KEY });
+    }
+    return _openaiClient;
+}
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+let _localModel = null;
+async function getLocalModel() {
+    if (!_localModel) {
+        try {
+            const { pipeline } = await import("@xenova/transformers");
+            _localModel = await pipeline("feature-extraction", LOCAL_EMBEDDING_MODEL);
+        }
+        catch {
+            throw new Error("@xenova/transformers is not installed.\n" +
+                "Install it with: npm install @xenova/transformers\n" +
+                "Or set OPENAI_API_KEY to use OpenAI embeddings.");
+        }
+    }
+    return _localModel;
+}
+async function embedLocal(text) {
+    const model = await getLocalModel();
+    const output = await model(text, { pooling: "mean", normalize: true });
+    return Array.from(output.data[0]);
+}
+export async function embedTextAsync(text) {
+    if (EMBEDDING_BACKEND === "local") {
+        return embedLocal(text);
+    }
+    const client = getOpenAIClient();
+    for (let attempt = 0; attempt < EMBED_RETRIES; attempt++) {
+        try {
+            const resp = await client.embeddings.create({
+                model: OPENAI_EMBEDDING_MODEL,
+                input: text,
+            });
+            return resp.data[0].embedding;
+        }
+        catch (err) {
+            if (attempt === EMBED_RETRIES - 1)
+                throw err;
+            await new Promise((resolve) => setTimeout(resolve, Math.pow(2, attempt) * 1000));
+        }
+    }
+    throw new Error("unreachable");
+}
+//# sourceMappingURL=embedding.js.map

package/dist/embedding.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedding.js","sourceRoot":"","sources":["../src/embedding.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChC,MAAM,EAAE,CAAC;AAET,OAAO,MAAM,MAAM,QAAQ,CAAC;AAE5B,MAAM,CAAC,MAAM,cAAc,GAAG,OAAO,CAAC,GAAG,CAAC,cAAc,IAAI,EAAE,CAAC;AAC/D,MAAM,CAAC,MAAM,sBAAsB,GACjC,OAAO,CAAC,GAAG,CAAC,sBAAsB,IAAI,wBAAwB,CAAC;AACjE,MAAM,qBAAqB,GACzB,OAAO,CAAC,GAAG,CAAC,qBAAqB,IAAI,uCAAuC,CAAC;AAE/E,MAAM,gBAAgB,GAAG,cAAc,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;AAC7D,MAAM,CAAC,MAAM,iBAAiB,GAC5B,OAAO,CAAC,GAAG,CAAC,iBAAiB,IAAI,gBAAgB,CAAC;AAEpD,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB,IAAI,aAAa,GAAkB,IAAI,CAAC;AAExC,SAAS,eAAe;IACtB,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,aAAa,GAAG,IAAI,MAAM,CAAC,EAAE,MAAM,EAAE,cAAc,EAAE,CAAC,CAAC;IACzD,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,8DAA8D;AAC9D,IAAI,WAAW,GAAQ,IAAI,CAAC;AAE5B,KAAK,UAAU,aAAa;IAC1B,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,IAAI,CAAC;YACH,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,MAAM,CAAC,sBAAsB,CAAC,CAAC;YAC1D,WAAW,GAAG,MAAM,QAAQ,CAAC,oBAAoB,EAAE,qBAAqB,CAAC,CAAC;QAC5E,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,IAAI,KAAK,CACb,0CAA0C;gBACxC,qDAAqD;gBACrD,iDAAiD,CACpD,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,KAAK,UAAU,UAAU,CAAC,IAAY;IACpC,MAAM,KAAK,GAAG,MAAM,aAAa,EAAE,CAAC;IACpC,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACvE,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAa,CAAC;AAChD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,IAAY;IAC/C,IAAI,iBAAiB,KAAK,OAAO,EAAE,CAAC;QAClC,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,MAAM,MAAM,GAAG,eAAe,EAAE,CAAC;IACjC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,aAAa,EAAE,OAAO,EAAE,EAAE,CAAC;QACzD,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC;gBAC1C,KAAK,EAAE,sBAAsB;gBAC7B,KAAK,EAAE,IAAI;aACZ,CAAC,CAAC;YACH,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,IAAI,OAAO,KAAK,aAAa,GAAG,CAAC;gBAAE,MAAM,GAAG,CAAC;YAC7C,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAC5B,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC,CACjD,CAAC;QACJ,CAAC;IACH,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;AACjC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# 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":""}

package/dist/index.js

@@ -0,0 +1,13 @@
+#!/usr/bin/env node
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import { graph, server } from "./server.js";
+async function main() {
+    await graph.load();
+    const transport = new StdioServerTransport();
+    await server.connect(transport);
+}
+main().catch((err) => {
+    console.error("[fatal]", err);
+    process.exit(1);
+});
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AACA,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAE5C,KAAK,UAAU,IAAI;IACjB,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC;IACnB,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;AAClC,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;IACnB,OAAO,CAAC,KAAK,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;IAC9B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC"}

package/dist/memoryGraph.d.ts

@@ -0,0 +1,53 @@
+import type { Key, Memory } from "./types.js";
+export declare function sanitizeKeys(keys: unknown): string[];
+export declare class MemoryGraph {
+    keys: Record<string, Key>;
+    memories: Record<string, Memory>;
+    private _keyToMems;
+    private _memToKeys;
+    private _supersededBy;
+    private _storedDim;
+    private _lock;
+    private _dirty;
+    static readonly HOP_DECAY = 0.3;
+    static readonly TIME_HALF_LIFE: number;
+    get linkCount(): number;
+    private _link;
+    private _hasLink;
+    private _unlinkMemory;
+    private _pruneOrphanKeys;
+    private _checkDim;
+    private _isExpired;
+    private _timeFactor;
+    private _keyIdf;
+    private _findDuplicate;
+    private _autoLinkKeys;
+    getKeysForMemory(memId: string): string[];
+    load(): Promise<void>;
+    save(): Promise<void>;
+    markDirty(): void;
+    flush(): Promise<void>;
+    findOrCreateKey(concept: string, keyType?: "concept" | "name" | "proper_noun"): Promise<string>;
+    add(content: string, keyConcepts: string[], options?: {
+        keyTypes?: Record<string, string> | null;
+        source?: Record<string, unknown> | null;
+        namespace?: string;
+        ttlSeconds?: number | null;
+        relatedTo?: string[] | null;
+    }): Promise<[string, boolean]>;
+    supersede(oldId: string, newContent: string, options?: {
+        keyConcepts?: string[] | null;
+        keyTypes?: Record<string, string> | null;
+        source?: Record<string, unknown> | null;
+        namespace?: string | null;
+        relatedTo?: string[] | null;
+    }): Promise<string>;
+    recall(query: string, topK?: number, namespace?: string | null, expand?: boolean): Promise<object[]>;
+    getRelated(memoryId: string): object[];
+    delete(memoryId: string): Promise<boolean>;
+    listAll(namespace?: string | null): object[];
+    cleanupExpired(): Promise<number>;
+}
+export declare function saveTurn(sessionId: string, role: string, content: string): Promise<number>;
+export declare function loadConversation(sessionId: string, turn?: number | null): Promise<object[]>;
+//# sourceMappingURL=memoryGraph.d.ts.map

package/dist/memoryGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryGraph.d.ts","sourceRoot":"","sources":["../src/memoryGraph.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,EAAa,MAAM,YAAY,CAAC;AAwCzD,wBAAgB,YAAY,CAAC,IAAI,EAAE,OAAO,GAAG,MAAM,EAAE,CAgBpD;AAID,qBAAa,WAAW;IACtB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAM;IAC/B,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAM;IAEtC,OAAO,CAAC,UAAU,CAAmC;IACrD,OAAO,CAAC,UAAU,CAAmC;IACrD,OAAO,CAAC,aAAa,CAA8B;IACnD,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,KAAK,CAAe;IAC5B,OAAO,CAAC,MAAM,CAAS;IAEvB,MAAM,CAAC,QAAQ,CAAC,SAAS,OAAO;IAChC,MAAM,CAAC,QAAQ,CAAC,cAAc,SAAkB;IAEhD,IAAI,SAAS,IAAI,MAAM,CAKtB;IAED,OAAO,CAAC,KAAK;IAOb,OAAO,CAAC,QAAQ;IAIhB,OAAO,CAAC,aAAa;IAcrB,OAAO,CAAC,gBAAgB;IAOxB,OAAO,CAAC,SAAS;IAejB,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,WAAW;IAOnB,OAAO,CAAC,OAAO;IASf,OAAO,CAAC,cAAc;IAkBtB,OAAO,CAAC,aAAa;IAYrB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE;IAUnC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAoDrB,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAiB3B,SAAS,IAAI,IAAI;IAIX,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAMtB,eAAe,CACnB,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,SAAS,GAAG,MAAM,GAAG,aAAyB,GACtD,OAAO,CAAC,MAAM,CAAC;IAwCZ,GAAG,CACP,OAAO,EAAE,MAAM,EACf,WAAW,EAAE,MAAM,EAAE,EACrB,OAAO,GAAE;QACP,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;QACzC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;QACxC,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,UAAU,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC3B,SAAS,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;KACxB,GACL,OAAO,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAkEvB,SAAS,CACb,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,MAAM,EAClB,OAAO,GAAE;QACP,WAAW,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;QACzC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;QACxC,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC1B,SAAS,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;KACxB,GACL,OAAO,CAAC,MAAM,CAAC;IA8EZ,MAAM,CACV,KAAK,EAAE,MAAM,EACb,IAAI,SAAI,EACR,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,EACzB,MAAM,UAAQ,GACb,OAAO,CAAC,MAAM,EAAE,CAAC;IAsKpB,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAiFhC,MAAM,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAiBhD,OAAO,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,EAAE;IAwBtC,cAAc,IAAI,OAAO,CAAC,MAAM,CAAC;CAmBxC;AAID,wBAAsB,QAAQ,CAC5B,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,MAAM,CAAC,CAkBjB;AAED,wBAAsB,gBAAgB,CACpC,SAAS,EAAE,MAAM,EACjB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,GACnB,OAAO,CAAC,MAAM,EAAE,CAAC,CAkBnB"}