@drqedwards/pmll 2.0.4

package/dist/kv-store.d.ts

@@ -0,0 +1,32 @@
+/**
+ * kv-store.ts — In-process KV slot manager mirroring PMLL memory_silo_t semantics.
+ *
+ * Capacity: siloSize is enforced on set(). When at capacity and the key is new,
+ * the least-recently-used (LRU) slot is evicted. Updates never grow the silo.
+ *
+ * Concurrency: process-local; MCP assumes single-threaded / externally serialized access.
+ */
+export type PeekResult = [boolean, string | null, number | null];
+export declare class PMMemoryStore {
+    private _slots;
+    private _nextIndex;
+    private _accessSeq;
+    siloSize: number;
+    constructor(siloSize?: number);
+    private _touch;
+    peek(key: string): PeekResult;
+    /**
+     * Store key/value. New keys at capacity evict the LRU entry.
+     */
+    set(key: string, value: string): number;
+    private _evictLru;
+    flush(): number;
+    get size(): number;
+    has(key: string): boolean;
+}
+export declare function getStore(sessionId: string, siloSize?: number): PMMemoryStore;
+export declare function dropStore(sessionId: string): number;
+/** Clear existing silo and return a fresh store (clear_on_init). */
+export declare function resetStore(sessionId: string, siloSize?: number): PMMemoryStore;
+export declare const _sessionStoresMap: Map<string, PMMemoryStore>;
+//# sourceMappingURL=kv-store.d.ts.map

package/dist/kv-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"kv-store.d.ts","sourceRoot":"","sources":["../src/kv-store.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAWH,MAAM,MAAM,UAAU,GAAG,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;AAEjE,qBAAa,aAAa;IACxB,OAAO,CAAC,MAAM,CAAkC;IAChD,OAAO,CAAC,UAAU,CAAK;IACvB,OAAO,CAAC,UAAU,CAAK;IACvB,QAAQ,EAAE,MAAM,CAAC;gBAEL,QAAQ,GAAE,MAAY;IAIlC,OAAO,CAAC,MAAM;IAKd,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU;IAS7B;;OAEG;IACH,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IA0BvC,OAAO,CAAC,SAAS;IAYjB,KAAK,IAAI,MAAM;IAQf,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;CAG1B;AAID,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY,GAAG,aAAa,CAOjF;AAED,wBAAgB,SAAS,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAInD;AAED,oEAAoE;AACpE,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAY,GAAG,aAAa,CAKnF;AAED,eAAO,MAAM,iBAAiB,4BAAiB,CAAC"}

package/dist/kv-store.js

@@ -0,0 +1,103 @@
+/**
+ * kv-store.ts — In-process KV slot manager mirroring PMLL memory_silo_t semantics.
+ *
+ * Capacity: siloSize is enforced on set(). When at capacity and the key is new,
+ * the least-recently-used (LRU) slot is evicted. Updates never grow the silo.
+ *
+ * Concurrency: process-local; MCP assumes single-threaded / externally serialized access.
+ */
+export class PMMemoryStore {
+    _slots = new Map();
+    _nextIndex = 0;
+    _accessSeq = 0;
+    siloSize;
+    constructor(siloSize = 256) {
+        this.siloSize = Math.max(1, siloSize | 0);
+    }
+    _touch(slot) {
+        this._accessSeq += 1;
+        slot.lastAccessed = this._accessSeq;
+    }
+    peek(key) {
+        const slot = this._slots.get(key);
+        if (slot !== undefined && slot.resolved) {
+            this._touch(slot);
+            return [true, slot.value, slot.index];
+        }
+        return [false, null, null];
+    }
+    /**
+     * Store key/value. New keys at capacity evict the LRU entry.
+     */
+    set(key, value) {
+        const existing = this._slots.get(key);
+        if (existing !== undefined) {
+            existing.value = value;
+            existing.resolved = true;
+            this._touch(existing);
+            return existing.index;
+        }
+        if (this._slots.size >= this.siloSize) {
+            this._evictLru();
+        }
+        const index = this._nextIndex++;
+        const slot = {
+            index,
+            key,
+            value,
+            resolved: true,
+            lastAccessed: 0,
+        };
+        this._touch(slot);
+        this._slots.set(key, slot);
+        return index;
+    }
+    _evictLru() {
+        let victim = null;
+        let oldest = Infinity;
+        for (const [k, slot] of this._slots) {
+            if (slot.lastAccessed < oldest) {
+                oldest = slot.lastAccessed;
+                victim = k;
+            }
+        }
+        if (victim !== null)
+            this._slots.delete(victim);
+    }
+    flush() {
+        const count = this._slots.size;
+        this._slots.clear();
+        this._nextIndex = 0;
+        this._accessSeq = 0;
+        return count;
+    }
+    get size() {
+        return this._slots.size;
+    }
+    has(key) {
+        return this._slots.has(key);
+    }
+}
+const _sessionStores = new Map();
+export function getStore(sessionId, siloSize = 256) {
+    let store = _sessionStores.get(sessionId);
+    if (store === undefined) {
+        store = new PMMemoryStore(siloSize);
+        _sessionStores.set(sessionId, store);
+    }
+    return store;
+}
+export function dropStore(sessionId) {
+    const store = _sessionStores.get(sessionId);
+    _sessionStores.delete(sessionId);
+    return store !== undefined ? store.size : 0;
+}
+/** Clear existing silo and return a fresh store (clear_on_init). */
+export function resetStore(sessionId, siloSize = 256) {
+    _sessionStores.delete(sessionId);
+    const store = new PMMemoryStore(siloSize);
+    _sessionStores.set(sessionId, store);
+    return store;
+}
+export const _sessionStoresMap = _sessionStores;
+//# sourceMappingURL=kv-store.js.map

package/dist/kv-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kv-store.js","sourceRoot":"","sources":["../src/kv-store.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAaH,MAAM,OAAO,aAAa;IAChB,MAAM,GAAwB,IAAI,GAAG,EAAE,CAAC;IACxC,UAAU,GAAG,CAAC,CAAC;IACf,UAAU,GAAG,CAAC,CAAC;IACvB,QAAQ,CAAS;IAEjB,YAAY,WAAmB,GAAG;QAChC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC;IAEO,MAAM,CAAC,IAAY;QACzB,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC;IACtC,CAAC;IAED,IAAI,CAAC,GAAW;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAClB,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,GAAW,EAAE,KAAa;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC;YACvB,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACtB,OAAO,QAAQ,CAAC,KAAK,CAAC;QACxB,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACtC,IAAI,CAAC,SAAS,EAAE,CAAC;QACnB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAChC,MAAM,IAAI,GAAW;YACnB,KAAK;YACL,GAAG;YACH,KAAK;YACL,QAAQ,EAAE,IAAI;YACd,YAAY,EAAE,CAAC;SAChB,CAAC;QACF,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC3B,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,SAAS;QACf,IAAI,MAAM,GAAkB,IAAI,CAAC;QACjC,IAAI,MAAM,GAAG,QAAQ,CAAC;QACtB,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,IAAI,CAAC,YAAY,GAAG,MAAM,EAAE,CAAC;gBAC/B,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC;gBAC3B,MAAM,GAAG,CAAC,CAAC;YACb,CAAC;QACH,CAAC;QACD,IAAI,MAAM,KAAK,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAClD,CAAC;IAED,KAAK;QACH,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;CACF;AAED,MAAM,cAAc,GAA+B,IAAI,GAAG,EAAE,CAAC;AAE7D,MAAM,UAAU,QAAQ,CAAC,SAAiB,EAAE,WAAmB,GAAG;IAChE,IAAI,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC1C,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,KAAK,GAAG,IAAI,aAAa,CAAC,QAAQ,CAAC,CAAC;QACpC,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,SAAiB;IACzC,MAAM,KAAK,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC5C,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACjC,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,UAAU,CAAC,SAAiB,EAAE,WAAmB,GAAG;IAClE,cAAc,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,QAAQ,CAAC,CAAC;IAC1C,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACrC,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,CAAC,MAAM,iBAAiB,GAAG,cAAc,CAAC"}

package/dist/memory-graph.d.ts

@@ -0,0 +1,122 @@
+/**
+ * memory-graph.ts — In-memory property graph for long-term context memory.
+ *
+ * Adapted from Context+ (github.com/drQedwards/contextplus) memory-graph.ts.
+ * Provides a persistent memory graph with typed nodes, weighted edges, decay
+ * scoring, and graph traversal for the PMLL MCP solution engine.
+ *
+ * Architecture:
+ *   - Nodes: concept, file, symbol, note — each with TF-IDF embeddings
+ *   - Edges: typed relations with temporal decay (e^(-λt))
+ *   - Search: cosine similarity + graph neighbor traversal
+ *   - Persistence: in-process Map + JSON export/import (Python package uses SQLite;
+ *     TS durable backend may follow). Session IDs namespace the graph.
+ *
+ * Process-local / single-threaded MCP assumption: no cross-process locking.
+ *
+ * The graph serves as the long-term memory layer complementing the existing
+ * short-term KV store (init/peek/set/resolve/flush tools).
+ */
+export type NodeType = "concept" | "file" | "symbol" | "note";
+export type RelationType = "relates_to" | "depends_on" | "implements" | "references" | "similar_to" | "contains";
+export interface MemoryNode {
+    id: string;
+    type: NodeType;
+    label: string;
+    content: string;
+    embedding: number[];
+    createdAt: number;
+    lastAccessed: number;
+    accessCount: number;
+    metadata: Record<string, string>;
+}
+export interface MemoryEdge {
+    id: string;
+    source: string;
+    target: string;
+    relation: RelationType;
+    weight: number;
+    createdAt: number;
+    metadata: Record<string, string>;
+}
+export interface TraversalResult {
+    node: MemoryNode;
+    depth: number;
+    pathRelations: string[];
+    relevanceScore: number;
+}
+export interface GraphSearchResult {
+    direct: TraversalResult[];
+    neighbors: TraversalResult[];
+    totalNodes: number;
+    totalEdges: number;
+}
+interface GraphStore {
+    nodes: Record<string, MemoryNode>;
+    edges: Record<string, MemoryEdge>;
+}
+/** Exposed for testing: direct access to graph store registry. */
+export declare const _graphStoresMap: Map<string, GraphStore>;
+/**
+ * Create or update a memory node in the session graph.
+ * If a node with the same label and type exists, updates it in place.
+ */
+export declare function upsertNode(sessionId: string, type: NodeType, label: string, content: string, metadata?: Record<string, string>): MemoryNode;
+/**
+ * Create a typed edge between two nodes.
+ * Deduplicates: if the same source→target→relation already exists, updates weight.
+ */
+export declare function createRelation(sessionId: string, sourceId: string, targetId: string, relation: RelationType, weight?: number, metadata?: Record<string, string>): MemoryEdge | null;
+/**
+ * Semantic search with graph traversal — finds direct matches then walks
+ * 1st/2nd-degree neighbors.
+ */
+export declare function searchGraph(sessionId: string, query: string, maxDepth?: number, topK?: number, edgeFilter?: RelationType[]): GraphSearchResult;
+/**
+ * Remove decayed edges (e^(-λt) below threshold) and orphan nodes
+ * with low access counts.
+ */
+export declare function pruneStaleLinks(sessionId: string, threshold?: number): {
+    removed: number;
+    remaining: number;
+};
+/**
+ * Bulk-add nodes with auto-similarity linking (cosine ≥ 0.72 creates edges).
+ */
+export declare function addInterlinkedContext(sessionId: string, items: Array<{
+    type: NodeType;
+    label: string;
+    content: string;
+    metadata?: Record<string, string>;
+}>, autoLink?: boolean): {
+    nodes: MemoryNode[];
+    edges: MemoryEdge[];
+};
+/**
+ * Start from a node and walk outward — returns all reachable neighbors
+ * scored by decay and depth.
+ */
+export declare function retrieveWithTraversal(sessionId: string, startNodeId: string, maxDepth?: number, edgeFilter?: RelationType[]): TraversalResult[];
+/**
+ * Get summary statistics for the session's memory graph.
+ */
+export declare function getGraphStats(sessionId: string): {
+    nodes: number;
+    edges: number;
+    types: Record<string, number>;
+    relations: Record<string, number>;
+};
+/**
+ * Export the full graph for a session as a JSON-serializable object.
+ */
+export declare function exportGraph(sessionId: string): GraphStore;
+/**
+ * Import a graph from a JSON object into a session.
+ */
+export declare function importGraph(sessionId: string, data: GraphStore): void;
+/**
+ * Clear the graph for a session.
+ */
+export declare function clearGraph(sessionId: string): number;
+export {};
+//# sourceMappingURL=memory-graph.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph.d.ts","sourceRoot":"","sources":["../src/memory-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAQH,MAAM,MAAM,QAAQ,GAAG,SAAS,GAAG,MAAM,GAAG,QAAQ,GAAG,MAAM,CAAC;AAE9D,MAAM,MAAM,YAAY,GACpB,YAAY,GACZ,YAAY,GACZ,YAAY,GACZ,YAAY,GACZ,YAAY,GACZ,UAAU,CAAC;AAEf,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,QAAQ,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAClC;AAED,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,YAAY,CAAC;IACvB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAClC;AAED,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,UAAU,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,MAAM,WAAW,iBAAiB;IAChC,MAAM,EAAE,eAAe,EAAE,CAAC;IAC1B,SAAS,EAAE,eAAe,EAAE,CAAC;IAC7B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,UAAU,UAAU;IAClB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAClC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;CACnC;AAgBD,kEAAkE;AAClE,eAAO,MAAM,eAAe,yBAAe,CAAC;AAkC5C;;;GAGG;AACH,wBAAgB,UAAU,CACxB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,QAAQ,EACd,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,MAAM,EACf,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,UAAU,CA4BZ;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,YAAY,EACtB,MAAM,CAAC,EAAE,MAAM,EACf,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAChC,UAAU,GAAG,IAAI,CA4BnB;AAED;;;GAGG;AACH,wBAAgB,WAAW,CACzB,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,MAAM,EACb,QAAQ,GAAE,MAAU,EACpB,IAAI,GAAE,MAAU,EAChB,UAAU,CAAC,EAAE,YAAY,EAAE,GAC1B,iBAAiB,CAwCnB;AAiDD;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,SAAS,EAAE,MAAM,EACjB,SAAS,CAAC,EAAE,MAAM,GACjB;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAyBxC;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,KAAK,CAAC;IACX,IAAI,EAAE,QAAQ,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACnC,CAAC,EACF,QAAQ,GAAE,OAAc,GACvB;IAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IAAC,KAAK,EAAE,UAAU,EAAE,CAAA;CAAE,CAoD9C;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CACnC,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM,EACnB,QAAQ,GAAE,MAAU,EACpB,UAAU,CAAC,EAAE,YAAY,EAAE,GAC1B,eAAe,EAAE,CAwBnB;AAgDD;;GAEG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,MAAM,GAAG;IAChD,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACnC,CAkBA;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,CAEzD;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,GAAG,IAAI,CAErE;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAOpD"}

package/dist/memory-graph.js

@@ -0,0 +1,345 @@
+/**
+ * memory-graph.ts — In-memory property graph for long-term context memory.
+ *
+ * Adapted from Context+ (github.com/drQedwards/contextplus) memory-graph.ts.
+ * Provides a persistent memory graph with typed nodes, weighted edges, decay
+ * scoring, and graph traversal for the PMLL MCP solution engine.
+ *
+ * Architecture:
+ *   - Nodes: concept, file, symbol, note — each with TF-IDF embeddings
+ *   - Edges: typed relations with temporal decay (e^(-λt))
+ *   - Search: cosine similarity + graph neighbor traversal
+ *   - Persistence: in-process Map + JSON export/import (Python package uses SQLite;
+ *     TS durable backend may follow). Session IDs namespace the graph.
+ *
+ * Process-local / single-threaded MCP assumption: no cross-process locking.
+ *
+ * The graph serves as the long-term memory layer complementing the existing
+ * short-term KV store (init/peek/set/resolve/flush tools).
+ */
+import { embed, cosineSimilarity } from "./embeddings.js";
+// ---------------------------------------------------------------------------
+// Constants
+// ---------------------------------------------------------------------------
+const DECAY_LAMBDA = 0.05;
+const SIMILARITY_THRESHOLD = 0.72;
+const STALE_THRESHOLD = 0.15;
+// ---------------------------------------------------------------------------
+// Graph registry (session-scoped)
+// ---------------------------------------------------------------------------
+const _graphStores = new Map();
+/** Exposed for testing: direct access to graph store registry. */
+export const _graphStoresMap = _graphStores;
+function generateId(prefix) {
+    return `${prefix}-${Date.now()}-${Math.random().toString(36).slice(2, 8)}`;
+}
+function getGraph(sessionId) {
+    let store = _graphStores.get(sessionId);
+    if (!store) {
+        store = { nodes: {}, edges: {} };
+        _graphStores.set(sessionId, store);
+    }
+    return store;
+}
+function decayWeight(edge) {
+    const daysSinceCreation = (Date.now() - edge.createdAt) / 86_400_000;
+    return edge.weight * Math.exp(-DECAY_LAMBDA * daysSinceCreation);
+}
+function getEdgesForNode(graph, nodeId) {
+    return Object.values(graph.edges).filter((e) => e.source === nodeId || e.target === nodeId);
+}
+function getNeighborId(edge, fromId) {
+    return edge.source === fromId ? edge.target : edge.source;
+}
+// ---------------------------------------------------------------------------
+// Core graph operations
+// ---------------------------------------------------------------------------
+/**
+ * Create or update a memory node in the session graph.
+ * If a node with the same label and type exists, updates it in place.
+ */
+export function upsertNode(sessionId, type, label, content, metadata) {
+    const graph = getGraph(sessionId);
+    const existing = Object.values(graph.nodes).find((n) => n.label === label && n.type === type);
+    if (existing) {
+        existing.content = content;
+        existing.lastAccessed = Date.now();
+        existing.accessCount++;
+        if (metadata)
+            Object.assign(existing.metadata, metadata);
+        existing.embedding = embed(`${label} ${content}`);
+        return existing;
+    }
+    const node = {
+        id: generateId("mn"),
+        type,
+        label,
+        content,
+        embedding: embed(`${label} ${content}`),
+        createdAt: Date.now(),
+        lastAccessed: Date.now(),
+        accessCount: 1,
+        metadata: metadata ?? {},
+    };
+    graph.nodes[node.id] = node;
+    return node;
+}
+/**
+ * Create a typed edge between two nodes.
+ * Deduplicates: if the same source→target→relation already exists, updates weight.
+ */
+export function createRelation(sessionId, sourceId, targetId, relation, weight, metadata) {
+    const graph = getGraph(sessionId);
+    if (!graph.nodes[sourceId] || !graph.nodes[targetId])
+        return null;
+    const duplicate = Object.values(graph.edges).find((e) => e.source === sourceId &&
+        e.target === targetId &&
+        e.relation === relation);
+    if (duplicate) {
+        duplicate.weight = weight ?? duplicate.weight;
+        if (metadata)
+            Object.assign(duplicate.metadata, metadata);
+        return duplicate;
+    }
+    const edge = {
+        id: generateId("me"),
+        source: sourceId,
+        target: targetId,
+        relation,
+        weight: weight ?? 1.0,
+        createdAt: Date.now(),
+        metadata: metadata ?? {},
+    };
+    graph.edges[edge.id] = edge;
+    return edge;
+}
+/**
+ * Semantic search with graph traversal — finds direct matches then walks
+ * 1st/2nd-degree neighbors.
+ */
+export function searchGraph(sessionId, query, maxDepth = 1, topK = 5, edgeFilter) {
+    const graph = getGraph(sessionId);
+    const nodes = Object.values(graph.nodes);
+    if (nodes.length === 0) {
+        return { direct: [], neighbors: [], totalNodes: 0, totalEdges: 0 };
+    }
+    const queryVec = embed(query);
+    const scored = nodes
+        .map((n) => ({ node: n, score: cosineSimilarity(queryVec, n.embedding) }))
+        .sort((a, b) => b.score - a.score);
+    const directHits = scored.slice(0, topK).map(({ node, score }) => {
+        node.lastAccessed = Date.now();
+        return {
+            node,
+            depth: 0,
+            pathRelations: [],
+            relevanceScore: Math.round(score * 1000) / 10,
+        };
+    });
+    const neighborResults = [];
+    const visited = new Set(directHits.map((h) => h.node.id));
+    for (const hit of directHits) {
+        traverseNeighbors(graph, hit.node.id, queryVec, 1, maxDepth, [hit.node.label], visited, neighborResults, edgeFilter);
+    }
+    neighborResults.sort((a, b) => b.relevanceScore - a.relevanceScore);
+    return {
+        direct: directHits,
+        neighbors: neighborResults.slice(0, topK * 2),
+        totalNodes: nodes.length,
+        totalEdges: Object.keys(graph.edges).length,
+    };
+}
+function traverseNeighbors(graph, nodeId, queryVec, depth, maxDepth, pathLabels, visited, results, edgeFilter) {
+    if (depth > maxDepth)
+        return;
+    for (const edge of getEdgesForNode(graph, nodeId)) {
+        if (edgeFilter && !edgeFilter.includes(edge.relation))
+            continue;
+        const neighborId = getNeighborId(edge, nodeId);
+        if (visited.has(neighborId))
+            continue;
+        const neighbor = graph.nodes[neighborId];
+        if (!neighbor)
+            continue;
+        visited.add(neighborId);
+        const similarity = cosineSimilarity(queryVec, neighbor.embedding);
+        const edgeDecay = decayWeight(edge);
+        const relevance = similarity * 0.6 + (edgeDecay / Math.max(edge.weight, 0.01)) * 0.4;
+        results.push({
+            node: neighbor,
+            depth,
+            pathRelations: [
+                ...pathLabels,
+                `--[${edge.relation}]-->`,
+                neighbor.label,
+            ],
+            relevanceScore: Math.round(relevance * 1000) / 10,
+        });
+        neighbor.lastAccessed = Date.now();
+        traverseNeighbors(graph, neighborId, queryVec, depth + 1, maxDepth, [...pathLabels, `--[${edge.relation}]-->`, neighbor.label], visited, results, edgeFilter);
+    }
+}
+/**
+ * Remove decayed edges (e^(-λt) below threshold) and orphan nodes
+ * with low access counts.
+ */
+export function pruneStaleLinks(sessionId, threshold) {
+    const graph = getGraph(sessionId);
+    const cutoff = threshold ?? STALE_THRESHOLD;
+    const toRemove = [];
+    for (const [edgeId, edge] of Object.entries(graph.edges)) {
+        if (decayWeight(edge) < cutoff)
+            toRemove.push(edgeId);
+    }
+    for (const id of toRemove)
+        delete graph.edges[id];
+    const orphanNodeIds = Object.keys(graph.nodes).filter((nodeId) => {
+        const n = graph.nodes[nodeId];
+        return (getEdgesForNode(graph, nodeId).length === 0 &&
+            n.accessCount <= 1 &&
+            Date.now() - n.lastAccessed > 7 * 86_400_000);
+    });
+    for (const id of orphanNodeIds)
+        delete graph.nodes[id];
+    return {
+        removed: toRemove.length + orphanNodeIds.length,
+        remaining: Object.keys(graph.edges).length,
+    };
+}
+/**
+ * Bulk-add nodes with auto-similarity linking (cosine ≥ 0.72 creates edges).
+ */
+export function addInterlinkedContext(sessionId, items, autoLink = true) {
+    const createdNodes = [];
+    for (const item of items) {
+        createdNodes.push(upsertNode(sessionId, item.type, item.label, item.content, item.metadata));
+    }
+    const createdEdges = [];
+    if (autoLink && createdNodes.length > 1) {
+        for (let i = 0; i < createdNodes.length; i++) {
+            for (let j = i + 1; j < createdNodes.length; j++) {
+                const similarity = cosineSimilarity(createdNodes[i].embedding, createdNodes[j].embedding);
+                if (similarity >= SIMILARITY_THRESHOLD) {
+                    const edge = createRelation(sessionId, createdNodes[i].id, createdNodes[j].id, "similar_to", similarity);
+                    if (edge)
+                        createdEdges.push(edge);
+                }
+            }
+        }
+    }
+    // Also link to existing nodes
+    const graph = getGraph(sessionId);
+    const existingNodes = Object.values(graph.nodes)
+        .filter((n) => !createdNodes.find((cn) => cn.id === n.id))
+        .slice(0, 200);
+    if (autoLink) {
+        for (const newNode of createdNodes) {
+            for (const existing of existingNodes) {
+                const similarity = cosineSimilarity(newNode.embedding, existing.embedding);
+                if (similarity >= SIMILARITY_THRESHOLD) {
+                    const edge = createRelation(sessionId, newNode.id, existing.id, "similar_to", similarity);
+                    if (edge)
+                        createdEdges.push(edge);
+                }
+            }
+        }
+    }
+    return { nodes: createdNodes, edges: createdEdges };
+}
+/**
+ * Start from a node and walk outward — returns all reachable neighbors
+ * scored by decay and depth.
+ */
+export function retrieveWithTraversal(sessionId, startNodeId, maxDepth = 2, edgeFilter) {
+    const graph = getGraph(sessionId);
+    const startNode = graph.nodes[startNodeId];
+    if (!startNode)
+        return [];
+    startNode.lastAccessed = Date.now();
+    startNode.accessCount++;
+    const results = [
+        {
+            node: startNode,
+            depth: 0,
+            pathRelations: [startNode.label],
+            relevanceScore: 100,
+        },
+    ];
+    const visited = new Set([startNodeId]);
+    collectTraversal(graph, startNodeId, 1, maxDepth, [startNode.label], visited, results, edgeFilter);
+    return results;
+}
+function collectTraversal(graph, nodeId, depth, maxDepth, pathLabels, visited, results, edgeFilter) {
+    if (depth > maxDepth)
+        return;
+    for (const edge of getEdgesForNode(graph, nodeId)) {
+        if (edgeFilter && !edgeFilter.includes(edge.relation))
+            continue;
+        const neighborId = getNeighborId(edge, nodeId);
+        if (visited.has(neighborId))
+            continue;
+        const neighbor = graph.nodes[neighborId];
+        if (!neighbor)
+            continue;
+        visited.add(neighborId);
+        neighbor.lastAccessed = Date.now();
+        const decayed = decayWeight(edge);
+        const depthPenalty = 1 / (1 + depth * 0.3);
+        const score = decayed * depthPenalty * 100;
+        results.push({
+            node: neighbor,
+            depth,
+            pathRelations: [
+                ...pathLabels,
+                `--[${edge.relation}]-->`,
+                neighbor.label,
+            ],
+            relevanceScore: Math.round(score * 10) / 10,
+        });
+        collectTraversal(graph, neighborId, depth + 1, maxDepth, [...pathLabels, `--[${edge.relation}]-->`, neighbor.label], visited, results, edgeFilter);
+    }
+}
+/**
+ * Get summary statistics for the session's memory graph.
+ */
+export function getGraphStats(sessionId) {
+    const graph = getGraph(sessionId);
+    const types = {};
+    const relations = {};
+    for (const node of Object.values(graph.nodes)) {
+        types[node.type] = (types[node.type] ?? 0) + 1;
+    }
+    for (const edge of Object.values(graph.edges)) {
+        relations[edge.relation] = (relations[edge.relation] ?? 0) + 1;
+    }
+    return {
+        nodes: Object.keys(graph.nodes).length,
+        edges: Object.keys(graph.edges).length,
+        types,
+        relations,
+    };
+}
+/**
+ * Export the full graph for a session as a JSON-serializable object.
+ */
+export function exportGraph(sessionId) {
+    return getGraph(sessionId);
+}
+/**
+ * Import a graph from a JSON object into a session.
+ */
+export function importGraph(sessionId, data) {
+    _graphStores.set(sessionId, data);
+}
+/**
+ * Clear the graph for a session.
+ */
+export function clearGraph(sessionId) {
+    const graph = _graphStores.get(sessionId);
+    if (!graph)
+        return 0;
+    const count = Object.keys(graph.nodes).length + Object.keys(graph.edges).length;
+    _graphStores.delete(sessionId);
+    return count;
+}
+//# sourceMappingURL=memory-graph.js.map

package/dist/memory-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-graph.js","sourceRoot":"","sources":["../src/memory-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,KAAK,EAAE,gBAAgB,EAAE,MAAM,iBAAiB,CAAC;AAyD1D,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,MAAM,YAAY,GAAG,IAAI,CAAC;AAC1B,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAClC,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,8EAA8E;AAC9E,kCAAkC;AAClC,8EAA8E;AAE9E,MAAM,YAAY,GAA4B,IAAI,GAAG,EAAE,CAAC;AAExD,kEAAkE;AAClE,MAAM,CAAC,MAAM,eAAe,GAAG,YAAY,CAAC;AAE5C,SAAS,UAAU,CAAC,MAAc;IAChC,OAAO,GAAG,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AAC7E,CAAC;AAED,SAAS,QAAQ,CAAC,SAAiB;IACjC,IAAI,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACxC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,KAAK,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QACjC,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,WAAW,CAAC,IAAgB;IACnC,MAAM,iBAAiB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC;IACrE,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,YAAY,GAAG,iBAAiB,CAAC,CAAC;AACnE,CAAC;AAED,SAAS,eAAe,CAAC,KAAiB,EAAE,MAAc;IACxD,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAClD,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,IAAgB,EAAE,MAAc;IACrD,OAAO,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;AAC5D,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,SAAiB,EACjB,IAAc,EACd,KAAa,EACb,OAAe,EACf,QAAiC;IAEjC,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAC5C,CAAC;IAEF,IAAI,QAAQ,EAAE,CAAC;QACb,QAAQ,CAAC,OAAO,GAAG,OAAO,CAAC;QAC3B,QAAQ,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACnC,QAAQ,CAAC,WAAW,EAAE,CAAC;QACvB,IAAI,QAAQ;YAAE,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACzD,QAAQ,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,KAAK,IAAI,OAAO,EAAE,CAAC,CAAC;QAClD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM,IAAI,GAAe;QACvB,EAAE,EAAE,UAAU,CAAC,IAAI,CAAC;QACpB,IAAI;QACJ,KAAK;QACL,OAAO;QACP,SAAS,EAAE,KAAK,CAAC,GAAG,KAAK,IAAI,OAAO,EAAE,CAAC;QACvC,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;QACrB,YAAY,EAAE,IAAI,CAAC,GAAG,EAAE;QACxB,WAAW,EAAE,CAAC;QACd,QAAQ,EAAE,QAAQ,IAAI,EAAE;KACzB,CAAC;IACF,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IAC5B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,SAAiB,EACjB,QAAgB,EAChB,QAAgB,EAChB,QAAsB,EACtB,MAAe,EACf,QAAiC;IAEjC,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAElE,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAC/C,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,MAAM,KAAK,QAAQ;QACrB,CAAC,CAAC,MAAM,KAAK,QAAQ;QACrB,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAC1B,CAAC;IAEF,IAAI,SAAS,EAAE,CAAC;QACd,SAAS,CAAC,MAAM,GAAG,MAAM,IAAI,SAAS,CAAC,MAAM,CAAC;QAC9C,IAAI,QAAQ;YAAE,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC1D,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,IAAI,GAAe;QACvB,EAAE,EAAE,UAAU,CAAC,IAAI,CAAC;QACpB,MAAM,EAAE,QAAQ;QAChB,MAAM,EAAE,QAAQ;QAChB,QAAQ;QACR,MAAM,EAAE,MAAM,IAAI,GAAG;QACrB,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;QACrB,QAAQ,EAAE,QAAQ,IAAI,EAAE;KACzB,CAAC;IACF,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IAC5B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,SAAiB,EACjB,KAAa,EACb,WAAmB,CAAC,EACpB,OAAe,CAAC,EAChB,UAA2B;IAE3B,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACzC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACrE,CAAC;IAED,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IAC9B,MAAM,MAAM,GAAG,KAAK;SACjB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,gBAAgB,CAAC,QAAQ,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;SACzE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAErC,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;QAC/D,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC/B,OAAO;YACL,IAAI;YACJ,KAAK,EAAE,CAAC;YACR,aAAa,EAAE,EAAc;YAC7B,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE;SAC9C,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,eAAe,GAAsB,EAAE,CAAC;IAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1D,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,iBAAiB,CACf,KAAK,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EACzC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,eAAe,EAAE,UAAU,CACvD,CAAC;IACJ,CAAC;IAED,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;IAEpE,OAAO;QACL,MAAM,EAAE,UAAU;QAClB,SAAS,EAAE,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC;QAC7C,UAAU,EAAE,KAAK,CAAC,MAAM;QACxB,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM;KAC5C,CAAC;AACJ,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAiB,EACjB,MAAc,EACd,QAAkB,EAClB,KAAa,EACb,QAAgB,EAChB,UAAoB,EACpB,OAAoB,EACpB,OAA0B,EAC1B,UAA2B;IAE3B,IAAI,KAAK,GAAG,QAAQ;QAAE,OAAO;IAE7B,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;QAClD,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,SAAS;QAChE,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC/C,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,SAAS;QAEtC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACxB,MAAM,UAAU,GAAG,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,CAAC;QAClE,MAAM,SAAS,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,SAAS,GACb,UAAU,GAAG,GAAG,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC;QAErE,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,KAAK;YACL,aAAa,EAAE;gBACb,GAAG,UAAU;gBACb,MAAM,IAAI,CAAC,QAAQ,MAAM;gBACzB,QAAQ,CAAC,KAAK;aACf;YACD,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE;SAClD,CAAC,CAAC;QAEH,QAAQ,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACnC,iBAAiB,CACf,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,EAChD,CAAC,GAAG,UAAU,EAAE,MAAM,IAAI,CAAC,QAAQ,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,EAC1D,OAAO,EAAE,OAAO,EAAE,UAAU,CAC7B,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,SAAiB,EACjB,SAAkB;IAElB,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,MAAM,MAAM,GAAG,SAAS,IAAI,eAAe,CAAC;IAC5C,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACzD,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxD,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,QAAQ;QAAE,OAAO,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAElD,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;QAC/D,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC9B,OAAO,CACL,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC;YAC3C,CAAC,CAAC,WAAW,IAAI,CAAC;YAClB,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,YAAY,GAAG,CAAC,GAAG,UAAU,CAC7C,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,KAAK,MAAM,EAAE,IAAI,aAAa;QAAE,OAAO,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAEvD,OAAO;QACL,OAAO,EAAE,QAAQ,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM;QAC/C,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM;KAC3C,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACnC,SAAiB,EACjB,KAKE,EACF,WAAoB,IAAI;IAExB,MAAM,YAAY,GAAiB,EAAE,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,YAAY,CAAC,IAAI,CACf,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAC1E,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAiB,EAAE,CAAC;IAEtC,IAAI,QAAQ,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,MAAM,UAAU,GAAG,gBAAgB,CACjC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,EACzB,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAC1B,CAAC;gBACF,IAAI,UAAU,IAAI,oBAAoB,EAAE,CAAC;oBACvC,MAAM,IAAI,GAAG,cAAc,CACzB,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,EACjD,YAAY,EAAE,UAAU,CACzB,CAAC;oBACF,IAAI,IAAI;wBAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;SAC7C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;SACzD,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAEjB,IAAI,QAAQ,EAAE,CAAC;QACb,KAAK,MAAM,OAAO,IAAI,YAAY,EAAE,CAAC;YACnC,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;gBACrC,MAAM,UAAU,GAAG,gBAAgB,CACjC,OAAO,CAAC,SAAS,EACjB,QAAQ,CAAC,SAAS,CACnB,CAAC;gBACF,IAAI,UAAU,IAAI,oBAAoB,EAAE,CAAC;oBACvC,MAAM,IAAI,GAAG,cAAc,CACzB,SAAS,EAAE,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,YAAY,EAAE,UAAU,CAC7D,CAAC;oBACF,IAAI,IAAI;wBAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;AACtD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACnC,SAAiB,EACjB,WAAmB,EACnB,WAAmB,CAAC,EACpB,UAA2B;IAE3B,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;IAC3C,IAAI,CAAC,SAAS;QAAE,OAAO,EAAE,CAAC;IAE1B,SAAS,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACpC,SAAS,CAAC,WAAW,EAAE,CAAC;IAExB,MAAM,OAAO,GAAsB;QACjC;YACE,IAAI,EAAE,SAAS;YACf,KAAK,EAAE,CAAC;YACR,aAAa,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC;YAChC,cAAc,EAAE,GAAG;SACpB;KACF,CAAC;IAEF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IACvC,gBAAgB,CACd,KAAK,EAAE,WAAW,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,EAClD,OAAO,EAAE,OAAO,EAAE,UAAU,CAC7B,CAAC;IAEF,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAiB,EACjB,MAAc,EACd,KAAa,EACb,QAAgB,EAChB,UAAoB,EACpB,OAAoB,EACpB,OAA0B,EAC1B,UAA2B;IAE3B,IAAI,KAAK,GAAG,QAAQ;QAAE,OAAO;IAE7B,KAAK,MAAM,IAAI,IAAI,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;QAClD,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,SAAS;QAChE,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC/C,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,SAAS;QAEtC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACxB,QAAQ,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEnC,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,YAAY,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,OAAO,GAAG,YAAY,GAAG,GAAG,CAAC;QAE3C,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,QAAQ;YACd,KAAK;YACL,aAAa,EAAE;gBACb,GAAG,UAAU;gBACb,MAAM,IAAI,CAAC,QAAQ,MAAM;gBACzB,QAAQ,CAAC,KAAK;aACf;YACD,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE;SAC5C,CAAC,CAAC;QAEH,gBAAgB,CACd,KAAK,EAAE,UAAU,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,EACtC,CAAC,GAAG,UAAU,EAAE,MAAM,IAAI,CAAC,QAAQ,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,EAC1D,OAAO,EAAE,OAAO,EAAE,UAAU,CAC7B,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,SAAiB;IAM7C,MAAM,KAAK,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,MAAM,KAAK,GAA2B,EAAE,CAAC;IACzC,MAAM,SAAS,GAA2B,EAAE,CAAC;IAE7C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACjD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9C,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IACjE,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM;QACtC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM;QACtC,KAAK;QACL,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB;IAC3C,OAAO,QAAQ,CAAC,SAAS,CAAC,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,IAAgB;IAC7D,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AACpC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,SAAiB;IAC1C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC1C,IAAI,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC;IACrB,MAAM,KAAK,GACT,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IACpE,YAAY,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC/B,OAAO,KAAK,CAAC;AACf,CAAC"}