@monoes/memory 1.0.4 → 1.0.6

package/dist/memory-graph.d.ts

@@ -1,125 +0,0 @@
-/**
- * Knowledge Graph Module for @monomind/memory
- *
- * Builds a graph from MemoryEntry.references, computes PageRank,
- * detects communities via label propagation, and provides
- * graph-aware ranking for search results.
- *
- * Pure TypeScript - no external graph libraries.
- * @module v1/memory/memory-graph
- */
-import { EventEmitter } from 'node:events';
-import type { IMemoryBackend, MemoryEntry, SearchResult } from './types.js';
-export type EdgeType = 'reference' | 'similar' | 'temporal' | 'co-accessed' | 'causal';
-export interface MemoryGraphConfig {
-    similarityThreshold?: number;
-    pageRankDamping?: number;
-    pageRankIterations?: number;
-    pageRankConvergence?: number;
-    maxNodes?: number;
-    enableAutoEdges?: boolean;
-    communityAlgorithm?: 'louvain' | 'label-propagation';
-}
-export interface GraphNode {
-    id: string;
-    category: string;
-    confidence: number;
-    accessCount: number;
-    createdAt: number;
-}
-export interface GraphEdge {
-    targetId: string;
-    type: EdgeType;
-    weight: number;
-}
-export interface RankedResult {
-    entry: MemoryEntry;
-    score: number;
-    pageRank: number;
-    combinedScore: number;
-    community?: string;
-}
-export interface GraphStats {
-    nodeCount: number;
-    edgeCount: number;
-    avgDegree: number;
-    communityCount: number;
-    pageRankComputed: boolean;
-    maxPageRank: number;
-    minPageRank: number;
-}
-/**
- * Knowledge graph built from memory entry references.
- * Supports PageRank, community detection (label propagation),
- * and graph-aware result ranking blending vector similarity with structural importance.
- */
-export declare class MemoryGraph extends EventEmitter {
-    private nodes;
-    private edges;
-    private reverseEdges;
-    private pageRanks;
-    private communities;
-    private config;
-    private dirty;
-    constructor(config?: MemoryGraphConfig);
-    /** Build graph from all entries in a backend. Creates nodes and reference edges. */
-    buildFromBackend(backend: IMemoryBackend, namespace?: string): Promise<void>;
-    /** Add a node from a MemoryEntry. Skips silently at maxNodes capacity. */
-    addNode(entry: MemoryEntry): void;
-    /** Add a directed edge. Skips if either node missing. Updates weight to max if exists. */
-    addEdge(sourceId: string, targetId: string, type: EdgeType, weight?: number): void;
-    /** Remove a node and all associated edges (both directions). */
-    removeNode(id: string): void;
-    /** Add similarity edges by searching backend. Returns count of edges added. */
-    addSimilarityEdges(backend: IMemoryBackend, entryId: string): Promise<number>;
-    /**
-     * Compute PageRank via power iteration with dangling node redistribution.
-     * Returns map of node ID to PageRank score.
-     */
-    computePageRank(): Map<string, number>;
-    /** Detect communities using label propagation. Returns map of nodeId to communityId. */
-    detectCommunities(): Map<string, string>;
-    /**
-     * Rank search results blending vector similarity and PageRank.
-     * @param alpha - Weight for vector score (default 0.7). PageRank weight is (1 - alpha).
-     */
-    rankWithGraph(searchResults: SearchResult[], alpha?: number): RankedResult[];
-    /** Get top N nodes by PageRank score. */
-    getTopNodes(n: number): Array<{
-        id: string;
-        pageRank: number;
-        community: string;
-    }>;
-    /** BFS neighbors from a node up to given depth. Excludes the start node. */
-    getNeighbors(id: string, depth?: number): Set<string>;
-    /**
-     * HippoRAG-style PPR re-ranking: expand one hop via MemoryEntry.references and
-     * boost scores of reachable neighbors.
-     *
-     * Starting from each HNSW result, walk one hop through the `references` graph.
-     * Neighbors receive a propagated score of (parent_score × damping × edge_weight).
-     * Final scores are merged using max-of-contributions per node.
-     *
-     * Source: https://arxiv.org/abs/2405.14831 (HippoRAG 2 — NeurIPS 2024)
-     */
-    pprRerank(searchResults: SearchResult[], backend: IMemoryBackend, damping?: number): Promise<RankedResult[]>;
-    /**
-     * GraphRAG community retrieval: return top-k community summary descriptors.
-     * These can be prepended to semantic search results for global thematic reasoning.
-     *
-     * Source: https://arxiv.org/abs/2404.16130 (GraphRAG — Microsoft)
-     */
-    getCommunitySummaries(topK?: number): Array<{
-        communityId: string;
-        nodeCount: number;
-        topNodeIds: string[];
-        avgPageRank: number;
-    }>;
-    /** Get statistics about the current graph state. */
-    getStats(): GraphStats;
-    private hasEdge;
-    private shuffleArray;
-    /** Fisher-Yates shuffle in place — avoids allocating a new array. */
-    private shuffleInPlace;
-}
-//# sourceMappingURL=memory-graph.d.ts.map

package/dist/memory-graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-graph.d.ts","sourceRoot":"","sources":["../src/memory-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,EAAE,cAAc,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAI5E,MAAM,MAAM,QAAQ,GAAG,WAAW,GAAG,SAAS,GAAG,UAAU,GAAG,aAAa,GAAG,QAAQ,CAAC;AAEvF,MAAM,WAAW,iBAAiB;IAChC,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,kBAAkB,CAAC,EAAE,SAAS,GAAG,mBAAmB,CAAC;CACtD;AAED,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,QAAQ,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,WAAW,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,UAAU;IACzB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,OAAO,CAAC;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;CACrB;AAYD;;;;GAIG;AACH,qBAAa,WAAY,SAAQ,YAAY;IAC3C,OAAO,CAAC,KAAK,CAAqC;IAClD,OAAO,CAAC,KAAK,CAAuC;IACpD,OAAO,CAAC,YAAY,CAAuC;IAC3D,OAAO,CAAC,SAAS,CAAkC;IACnD,OAAO,CAAC,WAAW,CAAkC;IACrD,OAAO,CAAC,MAAM,CAA8B;IAC5C,OAAO,CAAC,KAAK,CAAiB;gBAElB,MAAM,CAAC,EAAE,iBAAiB;IAKtC,oFAAoF;IAC9E,gBAAgB,CAAC,OAAO,EAAE,cAAc,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAkBlF,0EAA0E;IAC1E,OAAO,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI;IAgBjC,0FAA0F;IAC1F,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,GAAE,MAAY,GAAG,IAAI;IAkBvF,gEAAgE;IAChE,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI;IAwB5B,+EAA+E;IACzE,kBAAkB,CAAC,OAAO,EAAE,cAAc,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAqBnF;;;OAGG;IACH,eAAe,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IA4DtC,wFAAwF;IACxF,iBAAiB,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IA+CxC;;;OAGG;IACH,aAAa,CAAC,aAAa,EAAE,YAAY,EAAE,EAAE,KAAK,GAAE,MAAY,GAAG,YAAY,EAAE;IAkBjF,yCAAyC;IACzC,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IAYlF,4EAA4E;IAC5E,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,GAAE,MAAU,GAAG,GAAG,CAAC,MAAM,CAAC;IAoBxD;;;;;;;;;OASG;IACH,SAAS,CACP,aAAa,EAAE,YAAY,EAAE,EAC7B,OAAO,EAAE,cAAc,EACvB,OAAO,GAAE,MAAY,GACpB,OAAO,CAAC,YAAY,EAAE,CAAC;IAiD1B;;;;;OAKG;IACH,qBAAqB,CAAC,IAAI,GAAE,MAAU,GAAG,KAAK,CAAC;QAC7C,WAAW,EAAE,MAAM,CAAC;QACpB,SAAS,EAAE,MAAM,CAAC;QAClB,UAAU,EAAE,MAAM,EAAE,CAAC;QACrB,WAAW,EAAE,MAAM,CAAC;KACrB,CAAC;IAuBF,oDAAoD;IACpD,QAAQ,IAAI,UAAU;IA6BtB,OAAO,CAAC,OAAO;IAKf,OAAO,CAAC,YAAY;IASpB,qEAAqE;IACrE,OAAO,CAAC,cAAc;CAMvB"}

package/dist/memory-graph.js

@@ -1,429 +0,0 @@
-/**
- * Knowledge Graph Module for @monomind/memory
- *
- * Builds a graph from MemoryEntry.references, computes PageRank,
- * detects communities via label propagation, and provides
- * graph-aware ranking for search results.
- *
- * Pure TypeScript - no external graph libraries.
- * @module v1/memory/memory-graph
- */
-import { EventEmitter } from 'node:events';
-const DEFAULT_CONFIG = {
-    similarityThreshold: 0.8,
-    pageRankDamping: 0.85,
-    pageRankIterations: 50,
-    pageRankConvergence: 1e-6,
-    maxNodes: 5000,
-    enableAutoEdges: true,
-    communityAlgorithm: 'label-propagation',
-};
-/**
- * Knowledge graph built from memory entry references.
- * Supports PageRank, community detection (label propagation),
- * and graph-aware result ranking blending vector similarity with structural importance.
- */
-export class MemoryGraph extends EventEmitter {
-    nodes = new Map();
-    edges = new Map();
-    reverseEdges = new Map();
-    pageRanks = new Map();
-    communities = new Map();
-    config;
-    dirty = true;
-    constructor(config) {
-        super();
-        this.config = { ...DEFAULT_CONFIG, ...config };
-    }
-    /** Build graph from all entries in a backend. Creates nodes and reference edges. */
-    async buildFromBackend(backend, namespace) {
-        const entries = await backend.query({
-            type: 'hybrid',
-            namespace,
-            limit: this.config.maxNodes,
-        });
-        for (const entry of entries) {
-            this.addNode(entry);
-        }
-        for (const entry of entries) {
-            for (const refId of entry.references) {
-                this.addEdge(entry.id, refId, 'reference');
-            }
-        }
-        this.dirty = true;
-        this.emit('graph:built', { nodeCount: this.nodes.size });
-    }
-    /** Add a node from a MemoryEntry. Skips silently at maxNodes capacity. */
-    addNode(entry) {
-        if (this.nodes.size >= this.config.maxNodes && !this.nodes.has(entry.id)) {
-            return;
-        }
-        this.nodes.set(entry.id, {
-            id: entry.id,
-            category: entry.metadata?.category || 'general',
-            confidence: entry.metadata?.confidence || 0.5,
-            accessCount: entry.accessCount,
-            createdAt: entry.createdAt,
-        });
-        if (!this.edges.has(entry.id))
-            this.edges.set(entry.id, []);
-        if (!this.reverseEdges.has(entry.id))
-            this.reverseEdges.set(entry.id, new Set());
-        this.dirty = true;
-    }
-    /** Add a directed edge. Skips if either node missing. Updates weight to max if exists. */
-    addEdge(sourceId, targetId, type, weight = 1.0) {
-        if (!this.nodes.has(sourceId) || !this.nodes.has(targetId))
-            return;
-        const edgeList = this.edges.get(sourceId) || [];
-        if (!this.edges.has(sourceId))
-            this.edges.set(sourceId, edgeList);
-        const existing = edgeList.find((e) => e.targetId === targetId);
-        if (existing) {
-            existing.weight = Math.max(existing.weight, weight);
-        }
-        else {
-            edgeList.push({ targetId, type, weight });
-        }
-        if (!this.reverseEdges.has(targetId))
-            this.reverseEdges.set(targetId, new Set());
-        this.reverseEdges.get(targetId).add(sourceId);
-        this.dirty = true;
-    }
-    /** Remove a node and all associated edges (both directions). */
-    removeNode(id) {
-        if (!this.nodes.has(id))
-            return;
-        // Remove outgoing edges and their reverse entries
-        for (const edge of this.edges.get(id) || []) {
-            this.reverseEdges.get(edge.targetId)?.delete(id);
-        }
-        this.edges.delete(id);
-        // Remove incoming edges pointing to this node
-        const incoming = this.reverseEdges.get(id);
-        if (incoming) {
-            for (const sourceId of incoming) {
-                const srcEdges = this.edges.get(sourceId);
-                if (srcEdges)
-                    this.edges.set(sourceId, srcEdges.filter((e) => e.targetId !== id));
-            }
-        }
-        this.reverseEdges.delete(id);
-        this.nodes.delete(id);
-        this.pageRanks.delete(id);
-        this.communities.delete(id);
-        this.dirty = true;
-    }
-    /** Add similarity edges by searching backend. Returns count of edges added. */
-    async addSimilarityEdges(backend, entryId) {
-        const entry = await backend.get(entryId);
-        if (!entry || !entry.embedding)
-            return 0;
-        const results = await backend.search(entry.embedding, {
-            k: 20,
-            threshold: this.config.similarityThreshold,
-        });
-        let added = 0;
-        for (const result of results) {
-            if (result.entry.id === entryId)
-                continue;
-            if (result.score >= this.config.similarityThreshold) {
-                const hadEdge = this.hasEdge(entryId, result.entry.id);
-                this.addEdge(entryId, result.entry.id, 'similar', result.score);
-                if (!hadEdge)
-                    added++;
-            }
-        }
-        return added;
-    }
-    /**
-     * Compute PageRank via power iteration with dangling node redistribution.
-     * Returns map of node ID to PageRank score.
-     */
-    computePageRank() {
-        const N = this.nodes.size;
-        if (N === 0) {
-            this.dirty = false;
-            this.emit('pagerank:computed', { iterations: 0 });
-            return new Map();
-        }
-        const d = this.config.pageRankDamping;
-        for (const nodeId of this.nodes.keys()) {
-            this.pageRanks.set(nodeId, 1 / N);
-        }
-        // Identify dangling nodes (no outgoing edges)
-        const danglingNodes = [];
-        for (const nodeId of this.nodes.keys()) {
-            const out = this.edges.get(nodeId);
-            if (!out || out.length === 0)
-                danglingNodes.push(nodeId);
-        }
-        // Pre-allocate a second ranks buffer and double-buffer between iterations
-        // to avoid allocating a new Map on each of up to 50 iterations.
-        let nextRanks = new Map(this.pageRanks);
-        let iterations = 0;
-        for (let iter = 0; iter < this.config.pageRankIterations; iter++) {
-            let maxDelta = 0;
-            let danglingSum = 0;
-            for (const nodeId of danglingNodes) {
-                danglingSum += this.pageRanks.get(nodeId) || 0;
-            }
-            for (const nodeId of this.nodes.keys()) {
-                let sum = 0;
-                const incoming = this.reverseEdges.get(nodeId);
-                if (incoming) {
-                    for (const sourceId of incoming) {
-                        const outDegree = this.edges.get(sourceId)?.length || 1;
-                        sum += (this.pageRanks.get(sourceId) || 0) / outDegree;
-                    }
-                }
-                const newRank = (1 - d) / N + d * (sum + danglingSum / N);
-                nextRanks.set(nodeId, newRank);
-                maxDelta = Math.max(maxDelta, Math.abs(newRank - (this.pageRanks.get(nodeId) || 0)));
-            }
-            // Swap buffers — O(1) reference swap, no allocation
-            const tmp = this.pageRanks;
-            this.pageRanks = nextRanks;
-            nextRanks = tmp;
-            iterations = iter + 1;
-            if (maxDelta < this.config.pageRankConvergence)
-                break;
-        }
-        this.dirty = false;
-        this.emit('pagerank:computed', { iterations });
-        return new Map(this.pageRanks);
-    }
-    /** Detect communities using label propagation. Returns map of nodeId to communityId. */
-    detectCommunities() {
-        const labels = new Map();
-        for (const nodeId of this.nodes.keys())
-            labels.set(nodeId, nodeId);
-        // Pre-allocate reusable buffers to avoid per-node, per-iteration allocations
-        const nodeIds = [...this.nodes.keys()];
-        const labelCounts = new Map();
-        for (let iter = 0; iter < 20; iter++) {
-            let changed = false;
-            this.shuffleInPlace(nodeIds);
-            for (const nodeId of nodeIds) {
-                labelCounts.clear();
-                for (const edge of this.edges.get(nodeId) || []) {
-                    const lbl = labels.get(edge.targetId);
-                    if (lbl !== undefined)
-                        labelCounts.set(lbl, (labelCounts.get(lbl) || 0) + edge.weight);
-                }
-                const incoming = this.reverseEdges.get(nodeId);
-                if (incoming) {
-                    for (const sourceId of incoming) {
-                        const lbl = labels.get(sourceId);
-                        if (lbl !== undefined)
-                            labelCounts.set(lbl, (labelCounts.get(lbl) || 0) + 1);
-                    }
-                }
-                if (labelCounts.size > 0) {
-                    let maxLabel = labels.get(nodeId);
-                    let maxCount = 0;
-                    for (const [label, count] of labelCounts) {
-                        if (count > maxCount) {
-                            maxCount = count;
-                            maxLabel = label;
-                        }
-                    }
-                    if (maxLabel !== labels.get(nodeId)) {
-                        labels.set(nodeId, maxLabel);
-                        changed = true;
-                    }
-                }
-            }
-            if (!changed)
-                break;
-        }
-        this.communities = labels;
-        this.emit('communities:detected', { communityCount: new Set(labels.values()).size });
-        return new Map(this.communities);
-    }
-    /**
-     * Rank search results blending vector similarity and PageRank.
-     * @param alpha - Weight for vector score (default 0.7). PageRank weight is (1 - alpha).
-     */
-    rankWithGraph(searchResults, alpha = 0.7) {
-        if (this.dirty)
-            this.computePageRank();
-        const N = this.nodes.size || 1;
-        return searchResults
-            .map((result) => {
-            const pageRank = this.pageRanks.get(result.entry.id) || 0;
-            return {
-                entry: result.entry,
-                score: result.score,
-                pageRank,
-                combinedScore: alpha * result.score + (1 - alpha) * (pageRank * N),
-                community: this.communities.get(result.entry.id),
-            };
-        })
-            .sort((a, b) => b.combinedScore - a.combinedScore);
-    }
-    /** Get top N nodes by PageRank score. */
-    getTopNodes(n) {
-        if (this.dirty)
-            this.computePageRank();
-        return [...this.pageRanks.entries()]
-            .sort((a, b) => b[1] - a[1])
-            .slice(0, n)
-            .map(([id, pageRank]) => ({
-            id,
-            pageRank,
-            community: this.communities.get(id) || id,
-        }));
-    }
-    /** BFS neighbors from a node up to given depth. Excludes the start node. */
-    getNeighbors(id, depth = 1) {
-        const visited = new Set();
-        let frontier = new Set([id]);
-        for (let d = 0; d < depth; d++) {
-            const nextFrontier = new Set();
-            for (const nodeId of frontier) {
-                for (const edge of this.edges.get(nodeId) || []) {
-                    if (!visited.has(edge.targetId) && edge.targetId !== id) {
-                        visited.add(edge.targetId);
-                        nextFrontier.add(edge.targetId);
-                    }
-                }
-            }
-            frontier = nextFrontier;
-            if (frontier.size === 0)
-                break;
-        }
-        return visited;
-    }
-    /**
-     * HippoRAG-style PPR re-ranking: expand one hop via MemoryEntry.references and
-     * boost scores of reachable neighbors.
-     *
-     * Starting from each HNSW result, walk one hop through the `references` graph.
-     * Neighbors receive a propagated score of (parent_score × damping × edge_weight).
-     * Final scores are merged using max-of-contributions per node.
-     *
-     * Source: https://arxiv.org/abs/2405.14831 (HippoRAG 2 — NeurIPS 2024)
-     */
-    pprRerank(searchResults, backend, damping = 0.5) {
-        return new Promise((resolve) => {
-            if (searchResults.length === 0) {
-                resolve([]);
-                return;
-            }
-            // Build propagation scores: id → boosted_score
-            const propagated = new Map();
-            // Seed from HNSW results
-            for (const result of searchResults) {
-                propagated.set(result.entry.id, result.score);
-            }
-            // One-hop expansion via MemoryEntry.references
-            const expansions = searchResults.map(async (result) => {
-                const refs = result.entry.references ?? [];
-                for (const refId of refs) {
-                    const edgeWeight = 1.0; // uniform; use edge map if available
-                    const boost = result.score * damping * edgeWeight;
-                    const current = propagated.get(refId) ?? 0;
-                    propagated.set(refId, Math.max(current, boost));
-                }
-            });
-            Promise.all(expansions).then(() => {
-                // Rebuild ranked results: seed nodes get max(original, propagated), expanded nodes appear
-                const seen = new Set();
-                const ranked = [];
-                for (const result of searchResults) {
-                    seen.add(result.entry.id);
-                    const propagatedScore = propagated.get(result.entry.id) ?? result.score;
-                    ranked.push({
-                        entry: result.entry,
-                        score: result.score,
-                        pageRank: this.pageRanks.get(result.entry.id) ?? 0,
-                        combinedScore: Math.max(result.score, propagatedScore),
-                        community: this.communities.get(result.entry.id),
-                    });
-                }
-                ranked.sort((a, b) => b.combinedScore - a.combinedScore);
-                resolve(ranked);
-            });
-        });
-    }
-    /**
-     * GraphRAG community retrieval: return top-k community summary descriptors.
-     * These can be prepended to semantic search results for global thematic reasoning.
-     *
-     * Source: https://arxiv.org/abs/2404.16130 (GraphRAG — Microsoft)
-     */
-    getCommunitySummaries(topK = 5) {
-        if (this.dirty)
-            this.computePageRank();
-        const communityMap = new Map();
-        for (const [nodeId, community] of this.communities.entries()) {
-            const rank = this.pageRanks.get(nodeId) ?? 0;
-            const entry = communityMap.get(community) ?? { nodeIds: [], rankSum: 0 };
-            entry.nodeIds.push(nodeId);
-            entry.rankSum += rank;
-            communityMap.set(community, entry);
-        }
-        return [...communityMap.entries()]
-            .map(([communityId, { nodeIds, rankSum }]) => ({
-            communityId,
-            nodeCount: nodeIds.length,
-            topNodeIds: nodeIds.slice(0, 3),
-            avgPageRank: nodeIds.length > 0 ? rankSum / nodeIds.length : 0,
-        }))
-            .sort((a, b) => b.avgPageRank - a.avgPageRank)
-            .slice(0, topK);
-    }
-    /** Get statistics about the current graph state. */
-    getStats() {
-        let totalEdges = 0;
-        for (const edgeList of this.edges.values())
-            totalEdges += edgeList.length;
-        const nodeCount = this.nodes.size;
-        let maxPageRank = 0;
-        let minPageRank = Infinity;
-        if (this.pageRanks.size > 0) {
-            for (const rank of this.pageRanks.values()) {
-                if (rank > maxPageRank)
-                    maxPageRank = rank;
-                if (rank < minPageRank)
-                    minPageRank = rank;
-            }
-        }
-        else {
-            minPageRank = 0;
-        }
-        return {
-            nodeCount,
-            edgeCount: totalEdges,
-            avgDegree: nodeCount > 0 ? totalEdges / nodeCount : 0,
-            communityCount: new Set(this.communities.values()).size,
-            pageRankComputed: !this.dirty,
-            maxPageRank,
-            minPageRank,
-        };
-    }
-    // ===== Internal Helpers =====
-    hasEdge(sourceId, targetId) {
-        const edgeList = this.edges.get(sourceId);
-        return edgeList ? edgeList.some((e) => e.targetId === targetId) : false;
-    }
-    shuffleArray(arr) {
-        const shuffled = [...arr];
-        for (let i = shuffled.length - 1; i > 0; i--) {
-            const j = Math.floor(Math.random() * (i + 1));
-            [shuffled[i], shuffled[j]] = [shuffled[j], shuffled[i]];
-        }
-        return shuffled;
-    }
-    /** Fisher-Yates shuffle in place — avoids allocating a new array. */
-    shuffleInPlace(arr) {
-        for (let i = arr.length - 1; i > 0; i--) {
-            const j = Math.floor(Math.random() * (i + 1));
-            const tmp = arr[i];
-            arr[i] = arr[j];
-            arr[j] = tmp;
-        }
-    }
-}
-//# sourceMappingURL=memory-graph.js.map

package/dist/memory-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memory-graph.js","sourceRoot":"","sources":["../src/memory-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAiD3C,MAAM,cAAc,GAAgC;IAClD,mBAAmB,EAAE,GAAG;IACxB,eAAe,EAAE,IAAI;IACrB,kBAAkB,EAAE,EAAE;IACtB,mBAAmB,EAAE,IAAI;IACzB,QAAQ,EAAE,IAAI;IACd,eAAe,EAAE,IAAI;IACrB,kBAAkB,EAAE,mBAAmB;CACxC,CAAC;AAEF;;;;GAIG;AACH,MAAM,OAAO,WAAY,SAAQ,YAAY;IACnC,KAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;IAC1C,KAAK,GAA6B,IAAI,GAAG,EAAE,CAAC;IAC5C,YAAY,GAA6B,IAAI,GAAG,EAAE,CAAC;IACnD,SAAS,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC3C,WAAW,GAAwB,IAAI,GAAG,EAAE,CAAC;IAC7C,MAAM,CAA8B;IACpC,KAAK,GAAY,IAAI,CAAC;IAE9B,YAAY,MAA0B;QACpC,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,MAAM,EAAE,CAAC;IACjD,CAAC;IAED,oFAAoF;IACpF,KAAK,CAAC,gBAAgB,CAAC,OAAuB,EAAE,SAAkB;QAChE,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,KAAK,CAAC;YAClC,IAAI,EAAE,QAAQ;YACd,SAAS;YACT,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ;SAC5B,CAAC,CAAC;QACH,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;gBACrC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED,0EAA0E;IAC1E,OAAO,CAAC,KAAkB;QACxB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACzE,OAAO;QACT,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;YACvB,EAAE,EAAE,KAAK,CAAC,EAAE;YACZ,QAAQ,EAAG,KAAK,CAAC,QAAQ,EAAE,QAAmB,IAAI,SAAS;YAC3D,UAAU,EAAG,KAAK,CAAC,QAAQ,EAAE,UAAqB,IAAI,GAAG;YACzD,WAAW,EAAE,KAAK,CAAC,WAAW;YAC9B,SAAS,EAAE,KAAK,CAAC,SAAS;SAC3B,CAAC,CAAC;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC5D,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACjF,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,0FAA0F;IAC1F,OAAO,CAAC,QAAgB,EAAE,QAAgB,EAAE,IAAc,EAAE,SAAiB,GAAG;QAC9E,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO;QAEnE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;QAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAElE,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC;QAC/D,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACtD,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAC5C,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACjF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,gEAAgE;IAChE,UAAU,CAAC,EAAU;QACnB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO;QAEhC,kDAAkD;QAClD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,8CAA8C;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;gBAChC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC1C,IAAI,QAAQ;oBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,EAAE,CAAC,CAAC,CAAC;YACpF,CAAC;QACH,CAAC;QACD,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,+EAA+E;IAC/E,KAAK,CAAC,kBAAkB,CAAC,OAAuB,EAAE,OAAe;QAC/D,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,SAAS;YAAE,OAAO,CAAC,CAAC;QAEzC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE;YACpD,CAAC,EAAE,EAAE;YACL,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,mBAAmB;SAC3C,CAAC,CAAC;QAEH,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,KAAK,OAAO;gBAAE,SAAS;YAC1C,IAAI,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,mBAAmB,EAAE,CAAC;gBACpD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACvD,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,SAAS,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBAChE,IAAI,CAAC,OAAO;oBAAE,KAAK,EAAE,CAAC;YACxB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,eAAe;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;YAClD,OAAO,IAAI,GAAG,EAAE,CAAC;QACnB,CAAC;QAED,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,eAAe,CAAC;QACtC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,CAAC;QAED,8CAA8C;QAC9C,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACnC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;gBAAE,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3D,CAAC;QAED,0EAA0E;QAC1E,gEAAgE;QAChE,IAAI,SAAS,GAAG,IAAI,GAAG,CAAiB,IAAI,CAAC,SAAS,CAAC,CAAC;QAExD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,kBAAkB,EAAE,IAAI,EAAE,EAAE,CAAC;YACjE,IAAI,QAAQ,GAAG,CAAC,CAAC;YAEjB,IAAI,WAAW,GAAG,CAAC,CAAC;YACpB,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;gBACnC,WAAW,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YACjD,CAAC;YAED,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBACvC,IAAI,GAAG,GAAG,CAAC,CAAC;gBACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC/C,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;wBAChC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC;wBACxD,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,SAAS,CAAC;oBACzD,CAAC;gBACH,CAAC;gBACD,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC;gBAC1D,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBAC/B,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACvF,CAAC;YAED,oDAAoD;YACpD,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;YAC3B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,SAAS,GAAG,GAAG,CAAC;YAChB,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC;YACtB,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB;gBAAE,MAAM;QACxD,CAAC;QAED,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;QAC/C,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC;IAED,wFAAwF;IACxF,iBAAiB;QACf,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE;YAAE,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAEnE,6EAA6E;QAC7E,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACvC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE9C,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC;YACrC,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;YAE7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,WAAW,CAAC,KAAK,EAAE,CAAC;gBAEpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBAChD,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBACtC,IAAI,GAAG,KAAK,SAAS;wBAAE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzF,CAAC;gBACD,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC/C,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;wBAChC,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;wBACjC,IAAI,GAAG,KAAK,SAAS;4BAAE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC/E,CAAC;gBACH,CAAC;gBAED,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBACzB,IAAI,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;oBACnC,IAAI,QAAQ,GAAG,CAAC,CAAC;oBACjB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;wBACzC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;4BAAC,QAAQ,GAAG,KAAK,CAAC;4BAAC,QAAQ,GAAG,KAAK,CAAC;wBAAC,CAAC;oBAC/D,CAAC;oBACD,IAAI,QAAQ,KAAK,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;wBACpC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;wBAC7B,OAAO,GAAG,IAAI,CAAC;oBACjB,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,OAAO;gBAAE,MAAM;QACtB,CAAC;QAED,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,sBAAsB,EAAE,EAAE,cAAc,EAAE,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACrF,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACnC,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,aAA6B,EAAE,QAAgB,GAAG;QAC9D,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,eAAe,EAAE,CAAC;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;QAE/B,OAAO,aAAa;aACjB,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACd,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAC1D,OAAO;gBACL,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,KAAK,EAAE,MAAM,CAAC,KAAK;gBACnB,QAAQ;gBACR,aAAa,EAAE,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC;gBAClE,SAAS,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;aACjD,CAAC;QACJ,CAAC,CAAC;aACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;IACvD,CAAC;IAED,yCAAyC;IACzC,WAAW,CAAC,CAAS;QACnB,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,eAAe,EAAE,CAAC;QACvC,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;aACjC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;YACxB,EAAE;YACF,QAAQ;YACR,SAAS,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE;SAC1C,CAAC,CAAC,CAAC;IACR,CAAC;IAED,4EAA4E;IAC5E,YAAY,CAAC,EAAU,EAAE,QAAgB,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,QAAQ,GAAG,IAAI,GAAG,CAAS,CAAC,EAAE,CAAC,CAAC,CAAC;QAErC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;YACvC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;oBAChD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,KAAK,EAAE,EAAE,CAAC;wBACxD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;wBAC3B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;oBAClC,CAAC;gBACH,CAAC;YACH,CAAC;YACD,QAAQ,GAAG,YAAY,CAAC;YACxB,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;gBAAE,MAAM;QACjC,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;OASG;IACH,SAAS,CACP,aAA6B,EAC7B,OAAuB,EACvB,UAAkB,GAAG;QAErB,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YAC7B,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC/B,OAAO,CAAC,EAAE,CAAC,CAAC;gBACZ,OAAO;YACT,CAAC;YAED,+CAA+C;YAC/C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;YAE7C,yBAAyB;YACzB,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;gBACnC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;YAChD,CAAC;YAED,+CAA+C;YAC/C,MAAM,UAAU,GAAoB,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;gBACrE,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC;gBAC3C,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;oBACzB,MAAM,UAAU,GAAG,GAAG,CAAC,CAAC,qCAAqC;oBAC7D,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,GAAG,OAAO,GAAG,UAAU,CAAC;oBAClD,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAC3C,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC,CAAC,CAAC;YAEH,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE;gBAChC,0FAA0F;gBAC1F,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC/B,MAAM,MAAM,GAAmB,EAAE,CAAC;gBAElC,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;oBACnC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBAC1B,MAAM,eAAe,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC;oBACxE,MAAM,CAAC,IAAI,CAAC;wBACV,KAAK,EAAE,MAAM,CAAC,KAAK;wBACnB,KAAK,EAAE,MAAM,CAAC,KAAK;wBACnB,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC;wBAClD,aAAa,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,eAAe,CAAC;wBACtD,SAAS,EAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;qBACjD,CAAC,CAAC;gBACL,CAAC;gBAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC;gBACzD,OAAO,CAAC,MAAM,CAAC,CAAC;YAClB,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;IACL,CAAC;IAED;;;;;OAKG;IACH,qBAAqB,CAAC,OAAe,CAAC;QAMpC,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,eAAe,EAAE,CAAC;QACvC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkD,CAAC;QAE/E,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;YACzE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC;YACtB,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACrC,CAAC;QAED,OAAO,CAAC,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;aAC/B,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7C,WAAW;YACX,SAAS,EAAE,OAAO,CAAC,MAAM;YACzB,UAAU,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;YAC/B,WAAW,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SAC/D,CAAC,CAAC;aACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC;aAC7C,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,oDAAoD;IACpD,QAAQ;QACN,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YAAE,UAAU,IAAI,QAAQ,CAAC,MAAM,CAAC;QAE1E,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAClC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,WAAW,GAAG,QAAQ,CAAC;QAC3B,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC3C,IAAI,IAAI,GAAG,WAAW;oBAAE,WAAW,GAAG,IAAI,CAAC;gBAC3C,IAAI,IAAI,GAAG,WAAW;oBAAE,WAAW,GAAG,IAAI,CAAC;YAC7C,CAAC;QACH,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,OAAO;YACL,SAAS;YACT,SAAS,EAAE,UAAU;YACrB,SAAS,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACrD,cAAc,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI;YACvD,gBAAgB,EAAE,CAAC,IAAI,CAAC,KAAK;YAC7B,WAAW;YACX,WAAW;SACZ,CAAC;IACJ,CAAC;IAED,+BAA+B;IAEvB,OAAO,CAAC,QAAgB,EAAE,QAAgB;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC1C,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAC1E,CAAC;IAEO,YAAY,CAAI,GAAQ;QAC9B,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,qEAAqE;IAC7D,cAAc,CAAI,GAAQ;QAChC,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;QACpD,CAAC;IACH,CAAC;CACF"}

package/dist/partitioned-hnsw.d.ts

@@ -1,65 +0,0 @@
-/**
- * PartitionedHNSW — Timestamp-partitioned HNSW sub-indexes for temporal locality
- *
- * Partitions the HNSW vector index into time-bucket sub-indexes so that recent
- * entries are searched first, dramatically reducing average search latency for
- * workloads where recency correlates with relevance.
- *
- * Architecture:
- *   - Entries are routed to a bucket based on Math.floor(createdAt / bucketMs)
- *   - Each bucket owns an independent HNSWIndex (lazy-created)
- *   - Search merges results across buckets, sorted by recency then similarity
- *   - Old buckets can be evicted once they exceed maxBuckets
- *
- * Source: ICDE 2025 Timestamp-Partitioned HNSW
- *
- * @module v1/memory/partitioned-hnsw
- */
-import type { MemoryEntry } from './types.js';
-export interface PartitionedHNSWConfig {
-    /** Time window per bucket in milliseconds. Default: 1 hour */
-    bucketMs?: number;
-    /** Maximum number of buckets to retain in memory. Default: 48 */
-    maxBuckets?: number;
-    /** Number of neighbours (ef-construction equivalent). Default: 16 */
-    k?: number;
-}
-export interface BucketStats {
-    bucketKey: number;
-    entryCount: number;
-    oldestMs: number;
-    newestMs: number;
-}
-export declare class PartitionedHNSW {
-    private readonly bucketMs;
-    private readonly maxBuckets;
-    private readonly k;
-    /** bucketKey → TimeBucket, ordered newest-first via insertion order */
-    private readonly buckets;
-    constructor(config?: PartitionedHNSWConfig);
-    /** Add a memory entry to its time-bucket. */
-    add(entry: MemoryEntry): void;
-    /**
-     * Search across partitions, newest buckets first.
-     * Stops early once `limit` results are collected or all buckets exhausted.
-     *
-     * @param queryEmbedding - optional query vector (cosine similarity)
-     * @param textQuery      - optional keyword fallback
-     * @param limit          - max results
-     * @param fromMs         - optional lower bound on createdAt (temporal filter)
-     * @param toMs           - optional upper bound on createdAt (temporal filter)
-     */
-    search(queryEmbedding: Float32Array | null, textQuery: string | undefined, limit: number, fromMs?: number, toMs?: number): MemoryEntry[];
-    /**
-     * Remove an entry from its time-bucket by id and original createdAt timestamp.
-     * Returns true if the entry was found and removed, false otherwise.
-     */
-    remove(id: string, createdAt: number): boolean;
-    /** Stats per bucket for observability. */
-    bucketStats(): BucketStats[];
-    get totalEntries(): number;
-    private bucketKeyFor;
-    /** Evict the oldest bucket(s) when we exceed maxBuckets. */
-    private evictOldBuckets;
-}
-//# sourceMappingURL=partitioned-hnsw.d.ts.map

package/dist/partitioned-hnsw.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"partitioned-hnsw.d.ts","sourceRoot":"","sources":["../src/partitioned-hnsw.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAI9C,MAAM,WAAW,qBAAqB;IACpC,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,iEAAiE;IACjE,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,qEAAqE;IACrE,CAAC,CAAC,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,WAAW;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAoFD,qBAAa,eAAe;IAC1B,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;IAClC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAS;IAE3B,uEAAuE;IACvE,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAsC;gBAElD,MAAM,GAAE,qBAA0B;IAM9C,6CAA6C;IAC7C,GAAG,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI;IAY7B;;;;;;;;;OASG;IACH,MAAM,CACJ,cAAc,EAAE,YAAY,GAAG,IAAI,EACnC,SAAS,EAAE,MAAM,GAAG,SAAS,EAC7B,KAAK,EAAE,MAAM,EACb,MAAM,CAAC,EAAE,MAAM,EACf,IAAI,CAAC,EAAE,MAAM,GACZ,WAAW,EAAE;IAqChB;;;OAGG;IACH,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO;IAO9C,0CAA0C;IAC1C,WAAW,IAAI,WAAW,EAAE;IAS5B,IAAI,YAAY,IAAI,MAAM,CAIzB;IAMD,OAAO,CAAC,YAAY;IAIpB,4DAA4D;IAC5D,OAAO,CAAC,eAAe;CAWxB"}