agent-working-memory 0.3.0

package/dist/engine/consolidation.js

@@ -0,0 +1,368 @@
+/**
+ * Sleep Cycle — offline memory consolidation.
+ *
+ * Models the brain's consolidation during sleep:
+ *   1. Replay — find clusters of semantically similar memories
+ *   2. Strengthen — reinforce edges within clusters + access-weighted boost
+ *   3. Bridge — create cross-cluster shortcuts between related topic areas
+ *   4. Decay — weaken unused edges, prune dead ones
+ *   5. Homeostasis — normalize outgoing edge weights to prevent hub explosion
+ *   6. Forget — archive/delete memories that were never retrieved (age-gated)
+ *   7. Sweep — promote or discard uncertain (staging) memories
+ *
+ * No artificial "summary nodes" are created. Instead, the associative
+ * graph gets denser where knowledge overlaps and sparser where it doesn't.
+ * The beam search graph walk in activation.ts naturally propagates through
+ * these strengthened pathways.
+ *
+ * Run between sessions or on a timer (e.g., every few hours).
+ */
+import { cosineSimilarity } from '../core/embeddings.js';
+import { strengthenAssociation, decayAssociation } from '../core/hebbian.js';
+/** Cosine similarity threshold for considering two memories related */
+const SIMILARITY_THRESHOLD = 0.65;
+/** Lower threshold for cross-cluster bridge edges */
+const BRIDGE_THRESHOLD = 0.25;
+/** Minimum edge weight to form a new connection during replay */
+const INITIAL_EDGE_WEIGHT = 0.3;
+/** Boost factor for strengthening existing edges between cluster members */
+const CONSOLIDATION_SIGNAL = 0.5;
+/** Max new edges to create per sleep cycle (prevent graph explosion) */
+const MAX_NEW_EDGES_PER_CYCLE = 50;
+/** Max bridge edges per cycle (cross-cluster shortcuts) */
+const MAX_BRIDGE_EDGES_PER_CYCLE = 20;
+/** Edge weight below which we prune during decay */
+const PRUNE_THRESHOLD = 0.01;
+/** Target total outgoing edge weight per node (homeostasis) */
+const HOMEOSTASIS_TARGET = 10.0;
+/** Grace period before forgetting curve starts (days) */
+const FORGET_GRACE_DAYS = 7;
+/** Age at which never-retrieved memories get archived (days) */
+const FORGET_ARCHIVE_DAYS = 30;
+/** Age at which archived, never-retrieved, unconnected memories get deleted (days) */
+const FORGET_DELETE_DAYS = 90;
+/** Cosine similarity above which two low-confidence memories are considered redundant */
+const REDUNDANCY_THRESHOLD = 0.85;
+/** Max redundant memories to prune per cycle (gradual, not sudden) */
+const MAX_REDUNDANCY_PRUNE_PER_CYCLE = 10;
+export class ConsolidationEngine {
+    store;
+    constructor(store) {
+        this.store = store;
+    }
+    /**
+     * Run a full sleep cycle for an agent.
+     *
+     * Phase 1: Replay — find clusters of semantically similar memories
+     * Phase 2: Strengthen — reinforce edges within clusters (access-weighted)
+     * Phase 3: Bridge — create cross-cluster shortcuts
+     * Phase 4: Decay — weaken unused edges, prune dead ones
+     * Phase 5: Homeostasis — normalize outgoing edge weights per node
+     * Phase 6: Forget — archive/delete memories never retrieved (age-gated)
+     * Phase 7: Sweep — check staging buffer for resonance
+     */
+    consolidate(agentId) {
+        const result = {
+            clustersFound: 0,
+            edgesStrengthened: 0,
+            edgesCreated: 0,
+            bridgesCreated: 0,
+            edgesDecayed: 0,
+            edgesPruned: 0,
+            edgesNormalized: 0,
+            memoriesForgotten: 0,
+            memoriesArchived: 0,
+            redundancyPruned: 0,
+            stagingPromoted: 0,
+            stagingDiscarded: 0,
+            engramsProcessed: 0,
+        };
+        // --- Phase 1: Replay ---
+        // Get all active engrams with embeddings
+        const engrams = this.store.getEngramsByAgent(agentId, 'active')
+            .filter(e => e.embedding && e.embedding.length > 0);
+        result.engramsProcessed = engrams.length;
+        if (engrams.length < 2)
+            return result;
+        // Find clusters of related memories
+        const clusters = this.findClusters(engrams);
+        result.clustersFound = clusters.length;
+        // --- Phase 2: Strengthen (access-weighted) ---
+        // Memories that are retrieved more often get stronger consolidation.
+        // This mirrors how the brain preferentially consolidates practiced memories.
+        let newEdges = 0;
+        for (const cluster of clusters) {
+            for (let i = 0; i < cluster.length; i++) {
+                for (let j = i + 1; j < cluster.length; j++) {
+                    const a = cluster[i];
+                    const b = cluster[j];
+                    // Access-weighted signal: more retrieved = stronger consolidation
+                    const accessFactor = Math.min(1.0, 0.3 + 0.7 * Math.log1p(a.accessCount + b.accessCount) / Math.log1p(20));
+                    const existing = this.store.getAssociation(a.id, b.id);
+                    if (existing) {
+                        const newWeight = strengthenAssociation(existing.weight, CONSOLIDATION_SIGNAL * accessFactor, 0.25);
+                        this.store.upsertAssociation(a.id, b.id, newWeight, existing.type, existing.confidence);
+                        result.edgesStrengthened++;
+                    }
+                    else if (newEdges < MAX_NEW_EDGES_PER_CYCLE) {
+                        this.store.upsertAssociation(a.id, b.id, INITIAL_EDGE_WEIGHT * accessFactor, 'connection');
+                        newEdges++;
+                        result.edgesCreated++;
+                    }
+                }
+            }
+        }
+        // --- Phase 3: Cross-cluster bridge edges ---
+        // For each pair of clusters, compute centroid similarity. If moderate
+        // similarity exists but no direct edge, create a low-weight bridge.
+        // This is what enables cross-topic retrieval to improve over time.
+        if (clusters.length >= 2) {
+            let bridges = 0;
+            const centroids = clusters.map(cluster => this.computeCentroid(cluster));
+            for (let i = 0; i < clusters.length && bridges < MAX_BRIDGE_EDGES_PER_CYCLE; i++) {
+                for (let j = i + 1; j < clusters.length && bridges < MAX_BRIDGE_EDGES_PER_CYCLE; j++) {
+                    const sim = cosineSimilarity(centroids[i], centroids[j]);
+                    if (sim < BRIDGE_THRESHOLD || sim >= SIMILARITY_THRESHOLD)
+                        continue;
+                    // Find the best representative from each cluster (highest accessCount)
+                    const repA = clusters[i].reduce((best, e) => e.accessCount > best.accessCount ? e : best);
+                    const repB = clusters[j].reduce((best, e) => e.accessCount > best.accessCount ? e : best);
+                    const existing = this.store.getAssociation(repA.id, repB.id);
+                    if (!existing) {
+                        // Bridge weight proportional to inter-cluster similarity
+                        const bridgeWeight = 0.15 + 0.15 * ((sim - BRIDGE_THRESHOLD) / (SIMILARITY_THRESHOLD - BRIDGE_THRESHOLD));
+                        this.store.upsertAssociation(repA.id, repB.id, bridgeWeight, 'bridge');
+                        bridges++;
+                        result.bridgesCreated++;
+                    }
+                }
+            }
+        }
+        // --- Phase 4: Decay (confidence-modulated) ---
+        // High-confidence edges decay slower. This means edges between memories
+        // that received positive feedback are more durable — just like how
+        // practiced memories are more resistant to forgetting in the brain.
+        // Base half-life: 7 days. High-confidence (0.8+) gets up to 30 days.
+        const engramConfMap = new Map(engrams.map(e => [e.id, e.confidence]));
+        const associations = this.store.getAllAssociations(agentId);
+        for (const assoc of associations) {
+            const daysSince = (Date.now() - assoc.lastActivated.getTime()) / (1000 * 60 * 60 * 24);
+            if (daysSince < 0.5)
+                continue; // Skip recently activated
+            // Confidence-modulated half-life: higher confidence = slower decay (capped at 3x)
+            // Base: 7 days. Conf 0.5 → 7 days. Conf 0.8 → ~15 days. Conf 1.0 → 21 days (3x).
+            // Cap prevents any edge from becoming immortal.
+            const fromConf = engramConfMap.get(assoc.fromEngramId) ?? 0.5;
+            const toConf = engramConfMap.get(assoc.toEngramId) ?? 0.5;
+            const maxConf = Math.max(fromConf, toConf);
+            const halfLifeDays = Math.min(7 * (1 + 2 * Math.max(0, (maxConf - 0.5) / 0.5)), 21);
+            const newWeight = decayAssociation(assoc.weight, daysSince, halfLifeDays);
+            if (newWeight < PRUNE_THRESHOLD) {
+                this.store.deleteAssociation(assoc.id);
+                result.edgesPruned++;
+            }
+            else if (Math.abs(newWeight - assoc.weight) > 0.001) {
+                this.store.upsertAssociation(assoc.fromEngramId, assoc.toEngramId, newWeight, assoc.type, assoc.confidence);
+                result.edgesDecayed++;
+            }
+        }
+        // --- Phase 5: Synaptic homeostasis ---
+        // Normalize total outgoing edge weight per node to prevent hub explosion.
+        // Nodes with many strong edges get scaled down so relative weights stay meaningful.
+        const engramIds = new Set(engrams.map(e => e.id));
+        for (const id of engramIds) {
+            const edges = this.store.getAssociationsFor(id);
+            const totalWeight = edges.reduce((sum, a) => sum + a.weight, 0);
+            if (totalWeight > HOMEOSTASIS_TARGET) {
+                const scale = HOMEOSTASIS_TARGET / totalWeight;
+                for (const edge of edges) {
+                    const newWeight = edge.weight * scale;
+                    if (newWeight < PRUNE_THRESHOLD) {
+                        this.store.deleteAssociation(edge.id);
+                        result.edgesPruned++;
+                    }
+                    else {
+                        this.store.upsertAssociation(edge.fromEngramId, edge.toEngramId, newWeight, edge.type, edge.confidence);
+                    }
+                }
+                result.edgesNormalized++;
+            }
+        }
+        // --- Phase 6: Forgetting (age-gated) ---
+        // Models how human memory actually works:
+        // - New memories get a grace period (too new to judge)
+        // - Retrieval acts as rehearsal — resets the forgetting clock
+        // - Well-connected memories persist (edges = integration into knowledge)
+        // - Old, isolated, unretrieved memories fade to archive (not deleted)
+        // - Archived memories can still be recovered via deep search
+        // - Only truly orphaned, ancient memories get deleted
+        //
+        // Key insight: outdated memories still have value as historical context.
+        // "We used to use X" helps explain why we now use Y.
+        for (const engram of engrams) {
+            const ageDays = (Date.now() - engram.createdAt.getTime()) / (1000 * 60 * 60 * 24);
+            if (ageDays < FORGET_GRACE_DAYS)
+                continue; // Grace period — too new to judge
+            const edgeCount = this.store.countAssociationsFor(engram.id);
+            // Connections keep memories alive — well-integrated knowledge persists.
+            // High-confidence memories (feedback-confirmed) need fewer edges to survive.
+            // Models a senior dev who remembers standalone important facts.
+            // Default: 3 edges. At conf 0.7: 2 edges. At conf 0.8+: 1 edge.
+            const edgeProtectionThreshold = engram.confidence > 0.7
+                ? Math.max(1, Math.round(3 - 4 * (engram.confidence - 0.5)))
+                : 3;
+            if (edgeCount > edgeProtectionThreshold)
+                continue;
+            // Compute effective forgetting threshold based on memory strength signals.
+            // Rehearsal (access + feedback) extends protection but NEVER makes immortal.
+            // Models a sharp 20-year senior dev: confirmed knowledge persists for months/years.
+            // - Base: FORGET_ARCHIVE_DAYS (30 days)
+            // - Access extends by log-scaled factor: 5 accesses ≈ 2x, 10 ≈ 2.5x
+            // - Confidence modulates up to 4x (0.5→1x, 0.7→2.6x, 0.8→3.4x, 1.0→4x)
+            // - Hard cap: 12x base (360 days) — even the sharpest memory fades after a year
+            const accessFactor = 1 + Math.log1p(engram.accessCount) * 0.6;
+            const confFactor = 1 + 3 * Math.max(0, (engram.confidence - 0.5) / 0.5);
+            const effectiveArchiveDays = Math.min(FORGET_ARCHIVE_DAYS * accessFactor * confFactor, FORGET_ARCHIVE_DAYS * 12);
+            const daysSinceAccess = (Date.now() - engram.lastAccessed.getTime()) / (1000 * 60 * 60 * 24);
+            if (engram.accessCount === 0 && ageDays > FORGET_ARCHIVE_DAYS) {
+                // Never retrieved, old, weakly connected → archive
+                this.store.updateStage(engram.id, 'archived');
+                result.memoriesArchived++;
+            }
+            else if (engram.accessCount > 0 && daysSinceAccess > effectiveArchiveDays) {
+                // Accessed before but not recently enough given its strength — archive
+                this.store.updateStage(engram.id, 'archived');
+                result.memoriesArchived++;
+            }
+        }
+        // Check archived memories for deletion — only truly orphaned ancient ones
+        const archived = this.store.getEngramsByAgent(agentId, 'archived');
+        for (const engram of archived) {
+            const ageDays = (Date.now() - engram.createdAt.getTime()) / (1000 * 60 * 60 * 24);
+            const edgeCount = this.store.countAssociationsFor(engram.id);
+            if (engram.accessCount === 0 && ageDays > FORGET_DELETE_DAYS && edgeCount === 0) {
+                // Very old, never accessed, completely isolated → truly forgotten
+                this.store.deleteEngram(engram.id);
+                result.memoriesForgotten++;
+            }
+            // Otherwise: stay archived — still searchable, just not in active recall
+        }
+        // --- Phase 6.5: Redundancy pruning ---
+        // A senior dev doesn't store 30 nearly-identical memories. When multiple
+        // low-confidence memories are semantically redundant (cosine > 0.85), keep
+        // only the one with highest accessCount + confidence and archive the rest.
+        // This naturally defeats volume-based attacks (narcissistic interference,
+        // spam) while improving signal-to-noise ratio for linked memories.
+        // High-confidence memories (feedback-confirmed) are never pruned — they
+        // represent verified knowledge worth keeping even if similar.
+        // Only consider memories that are both low-confidence AND rarely accessed.
+        // Memories retrieved 3+ times have proven useful — they stay even if similar
+        // to others. This prevents pruning seed memories that match bulk templates.
+        const lowConfEngrams = engrams.filter(e => e.confidence < 0.6 && e.accessCount < 3 && e.embedding && e.embedding.length > 0);
+        const pruned = new Set();
+        let redundancyCount = 0;
+        // Sort by quality: highest accessCount + confidence first (survivors)
+        const sortedLow = [...lowConfEngrams].sort((a, b) => (b.accessCount + b.confidence * 10) - (a.accessCount + a.confidence * 10));
+        for (let i = 0; i < sortedLow.length && redundancyCount < MAX_REDUNDANCY_PRUNE_PER_CYCLE; i++) {
+            if (pruned.has(sortedLow[i].id))
+                continue;
+            for (let j = i + 1; j < sortedLow.length && redundancyCount < MAX_REDUNDANCY_PRUNE_PER_CYCLE; j++) {
+                if (pruned.has(sortedLow[j].id))
+                    continue;
+                if (!sortedLow[i].embedding || !sortedLow[j].embedding)
+                    continue;
+                const sim = cosineSimilarity(sortedLow[i].embedding, sortedLow[j].embedding);
+                if (sim >= REDUNDANCY_THRESHOLD) {
+                    // Archive the lower-quality duplicate
+                    this.store.updateStage(sortedLow[j].id, 'archived');
+                    pruned.add(sortedLow[j].id);
+                    redundancyCount++;
+                }
+            }
+        }
+        result.redundancyPruned = redundancyCount;
+        // --- Phase 7: Sweep staging ---
+        const staging = this.store.getEngramsByAgent(agentId, 'staging')
+            .filter(e => e.embedding && e.embedding.length > 0);
+        for (const staged of staging) {
+            const ageMs = Date.now() - staged.createdAt.getTime();
+            // Check if this staging memory resonates with any active memory
+            let maxSim = 0;
+            for (const active of engrams) {
+                if (!active.embedding || !staged.embedding)
+                    continue;
+                const sim = cosineSimilarity(staged.embedding, active.embedding);
+                if (sim > maxSim)
+                    maxSim = sim;
+            }
+            if (maxSim >= 0.6) {
+                // Resonates — promote to active
+                this.store.updateStage(staged.id, 'active');
+                result.stagingPromoted++;
+            }
+            else if (ageMs > 24 * 60 * 60 * 1000) {
+                // Over 24h and no resonance — discard
+                this.store.deleteEngram(staged.id);
+                result.stagingDiscarded++;
+            }
+            // Otherwise: leave in staging, maybe next cycle
+        }
+        return result;
+    }
+    /**
+     * Find clusters of semantically similar memories.
+     * Greedy agglomerative — each memory belongs to at most one cluster.
+     * Clusters of size 2+ are returned (pairs count — they link).
+     */
+    findClusters(engrams) {
+        const assigned = new Set();
+        const clusters = [];
+        // Seed clusters from most-accessed memories (strongest traces)
+        const sorted = [...engrams].sort((a, b) => b.accessCount - a.accessCount);
+        for (const seed of sorted) {
+            if (assigned.has(seed.id))
+                continue;
+            const cluster = [seed];
+            assigned.add(seed.id);
+            for (const candidate of sorted) {
+                if (assigned.has(candidate.id))
+                    continue;
+                if (!seed.embedding || !candidate.embedding)
+                    continue;
+                const sim = cosineSimilarity(seed.embedding, candidate.embedding);
+                if (sim >= SIMILARITY_THRESHOLD) {
+                    cluster.push(candidate);
+                    assigned.add(candidate.id);
+                }
+            }
+            if (cluster.length >= 2) {
+                clusters.push(cluster);
+            }
+            else {
+                for (const e of cluster)
+                    assigned.delete(e.id);
+            }
+        }
+        return clusters;
+    }
+    /**
+     * Compute the centroid (average embedding) of a cluster.
+     */
+    computeCentroid(cluster) {
+        const withEmbed = cluster.filter(e => e.embedding && e.embedding.length > 0);
+        if (withEmbed.length === 0)
+            return [];
+        const dim = withEmbed[0].embedding.length;
+        const centroid = new Array(dim).fill(0);
+        for (const e of withEmbed) {
+            for (let i = 0; i < dim; i++) {
+                centroid[i] += e.embedding[i];
+            }
+        }
+        for (let i = 0; i < dim; i++) {
+            centroid[i] /= withEmbed.length;
+        }
+        return centroid;
+    }
+}
+//# sourceMappingURL=consolidation.js.map

package/dist/engine/consolidation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidation.js","sourceRoot":"","sources":["../../src/engine/consolidation.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAI7E,uEAAuE;AACvE,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAElC,qDAAqD;AACrD,MAAM,gBAAgB,GAAG,IAAI,CAAC;AAE9B,iEAAiE;AACjE,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,4EAA4E;AAC5E,MAAM,oBAAoB,GAAG,GAAG,CAAC;AAEjC,wEAAwE;AACxE,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAEnC,2DAA2D;AAC3D,MAAM,0BAA0B,GAAG,EAAE,CAAC;AAEtC,oDAAoD;AACpD,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,+DAA+D;AAC/D,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEhC,yDAAyD;AACzD,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAE5B,gEAAgE;AAChE,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAE/B,sFAAsF;AACtF,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAE9B,yFAAyF;AACzF,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAElC,sEAAsE;AACtE,MAAM,8BAA8B,GAAG,EAAE,CAAC;AAkB1C,MAAM,OAAO,mBAAmB;IACtB,KAAK,CAAc;IAE3B,YAAY,KAAkB;QAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;;;;;;;;OAUG;IACH,WAAW,CAAC,OAAe;QACzB,MAAM,MAAM,GAAwB;YAClC,aAAa,EAAE,CAAC;YAChB,iBAAiB,EAAE,CAAC;YACpB,YAAY,EAAE,CAAC;YACf,cAAc,EAAE,CAAC;YACjB,YAAY,EAAE,CAAC;YACf,WAAW,EAAE,CAAC;YACd,eAAe,EAAE,CAAC;YAClB,iBAAiB,EAAE,CAAC;YACpB,gBAAgB,EAAE,CAAC;YACnB,gBAAgB,EAAE,CAAC;YACnB,eAAe,EAAE,CAAC;YAClB,gBAAgB,EAAE,CAAC;YACnB,gBAAgB,EAAE,CAAC;SACpB,CAAC;QAEF,0BAA0B;QAC1B,yCAAyC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,QAAQ,CAAC;aAC5D,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEtD,MAAM,CAAC,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC;QACzC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,MAAM,CAAC;QAEtC,oCAAoC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC5C,MAAM,CAAC,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC;QAEvC,gDAAgD;QAChD,qEAAqE;QACrE,6EAA6E;QAC7E,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;oBACrB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;oBAErB,kEAAkE;oBAClE,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,GAAG,EACH,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CACvE,CAAC;oBAEF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;oBACvD,IAAI,QAAQ,EAAE,CAAC;wBACb,MAAM,SAAS,GAAG,qBAAqB,CACrC,QAAQ,CAAC,MAAM,EAAE,oBAAoB,GAAG,YAAY,EAAE,IAAI,CAC3D,CAAC;wBACF,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAC1D,CAAC;wBACF,MAAM,CAAC,iBAAiB,EAAE,CAAC;oBAC7B,CAAC;yBAAM,IAAI,QAAQ,GAAG,uBAAuB,EAAE,CAAC;wBAC9C,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAC1B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,mBAAmB,GAAG,YAAY,EAAE,YAAY,CAC7D,CAAC;wBACF,QAAQ,EAAE,CAAC;wBACX,MAAM,CAAC,YAAY,EAAE,CAAC;oBACxB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,sEAAsE;QACtE,oEAAoE;QACpE,mEAAmE;QACnE,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACzB,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC;YAEzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,OAAO,GAAG,0BAA0B,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjF,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,OAAO,GAAG,0BAA0B,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrF,MAAM,GAAG,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBACzD,IAAI,GAAG,GAAG,gBAAgB,IAAI,GAAG,IAAI,oBAAoB;wBAAE,SAAS;oBAEpE,uEAAuE;oBACvE,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAC1F,MAAM,IAAI,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBAE1F,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC7D,IAAI,CAAC,QAAQ,EAAE,CAAC;wBACd,yDAAyD;wBACzD,MAAM,YAAY,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,oBAAoB,GAAG,gBAAgB,CAAC,CAAC,CAAC;wBAC1G,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC;wBACvE,OAAO,EAAE,CAAC;wBACV,MAAM,CAAC,cAAc,EAAE,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,gDAAgD;QAChD,wEAAwE;QACxE,mEAAmE;QACnE,oEAAoE;QACpE,qEAAqE;QACrE,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC5D,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,SAAS,GACb,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YACvE,IAAI,SAAS,GAAG,GAAG;gBAAE,SAAS,CAAC,0BAA0B;YAEzD,kFAAkF;YAClF,iFAAiF;YACjF,gDAAgD;YAChD,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,GAAG,CAAC;YAC9D,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC;YAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC3C,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,OAAO,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAEpF,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YAC1E,IAAI,SAAS,GAAG,eAAe,EAAE,CAAC;gBAChC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACvC,MAAM,CAAC,WAAW,EAAE,CAAC;YACvB,CAAC;iBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;gBACtD,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAC1B,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,UAAU,EACpC,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CACxC,CAAC;gBACF,MAAM,CAAC,YAAY,EAAE,CAAC;YACxB,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,0EAA0E;QAC1E,oFAAoF;QACpF,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAChD,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAChE,IAAI,WAAW,GAAG,kBAAkB,EAAE,CAAC;gBACrC,MAAM,KAAK,GAAG,kBAAkB,GAAG,WAAW,CAAC;gBAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;oBACtC,IAAI,SAAS,GAAG,eAAe,EAAE,CAAC;wBAChC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACtC,MAAM,CAAC,WAAW,EAAE,CAAC;oBACvB,CAAC;yBAAM,CAAC;wBACN,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAC1B,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,EAClC,SAAS,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CACtC,CAAC;oBACJ,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,eAAe,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,0CAA0C;QAC1C,uDAAuD;QACvD,8DAA8D;QAC9D,yEAAyE;QACzE,sEAAsE;QACtE,6DAA6D;QAC7D,sDAAsD;QACtD,EAAE;QACF,yEAAyE;QACzE,qDAAqD;QACrD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAClF,IAAI,OAAO,GAAG,iBAAiB;gBAAE,SAAS,CAAC,kCAAkC;YAE7E,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAE7D,wEAAwE;YACxE,6EAA6E;YAC7E,gEAAgE;YAChE,gEAAgE;YAChE,MAAM,uBAAuB,GAAG,MAAM,CAAC,UAAU,GAAG,GAAG;gBACrD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC;gBAC5D,CAAC,CAAC,CAAC,CAAC;YACN,IAAI,SAAS,GAAG,uBAAuB;gBAAE,SAAS;YAElD,2EAA2E;YAC3E,6EAA6E;YAC7E,oFAAoF;YACpF,wCAAwC;YACxC,oEAAoE;YACpE,uEAAuE;YACvE,gFAAgF;YAChF,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC;YAC9D,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,UAAU,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YACxE,MAAM,oBAAoB,GAAG,IAAI,CAAC,GAAG,CACnC,mBAAmB,GAAG,YAAY,GAAG,UAAU,EAC/C,mBAAmB,GAAG,EAAE,CACzB,CAAC;YAEF,MAAM,eAAe,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAE7F,IAAI,MAAM,CAAC,WAAW,KAAK,CAAC,IAAI,OAAO,GAAG,mBAAmB,EAAE,CAAC;gBAC9D,mDAAmD;gBACnD,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBAC9C,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC5B,CAAC;iBAAM,IAAI,MAAM,CAAC,WAAW,GAAG,CAAC,IAAI,eAAe,GAAG,oBAAoB,EAAE,CAAC;gBAC5E,uEAAuE;gBACvE,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBAC9C,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,0EAA0E;QAC1E,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACnE,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YAClF,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAE7D,IAAI,MAAM,CAAC,WAAW,KAAK,CAAC,IAAI,OAAO,GAAG,kBAAkB,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBAChF,kEAAkE;gBAClE,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnC,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC7B,CAAC;YACD,yEAAyE;QAC3E,CAAC;QAED,wCAAwC;QACxC,yEAAyE;QACzE,2EAA2E;QAC3E,2EAA2E;QAC3E,0EAA0E;QAC1E,mEAAmE;QACnE,wEAAwE;QACxE,8DAA8D;QAC9D,2EAA2E;QAC3E,6EAA6E;QAC7E,4EAA4E;QAC5E,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CACxC,CAAC,CAAC,UAAU,GAAG,GAAG,IAAI,CAAC,CAAC,WAAW,GAAG,CAAC,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,IAAI,eAAe,GAAG,CAAC,CAAC;QAExB,sEAAsE;QACtE,MAAM,SAAS,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAClD,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,UAAU,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,UAAU,GAAG,EAAE,CAAC,CAAC,CAAC;QAE7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,IAAI,eAAe,GAAG,8BAA8B,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9F,IAAI,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,IAAI,eAAe,GAAG,8BAA8B,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClG,IAAI,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC1C,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS;oBAAE,SAAS;gBAEjE,MAAM,GAAG,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAU,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,SAAU,CAAC,CAAC;gBAC/E,IAAI,GAAG,IAAI,oBAAoB,EAAE,CAAC;oBAChC,sCAAsC;oBACtC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;oBACpD,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBAC5B,eAAe,EAAE,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,MAAM,CAAC,gBAAgB,GAAG,eAAe,CAAC;QAE1C,iCAAiC;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC;aAC7D,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEtD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YAEtD,gEAAgE;YAChE,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,MAAM,CAAC,SAAS;oBAAE,SAAS;gBACrD,MAAM,GAAG,GAAG,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC;gBACjE,IAAI,GAAG,GAAG,MAAM;oBAAE,MAAM,GAAG,GAAG,CAAC;YACjC,CAAC;YAED,IAAI,MAAM,IAAI,GAAG,EAAE,CAAC;gBAClB,gCAAgC;gBAChC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBAC5C,MAAM,CAAC,eAAe,EAAE,CAAC;YAC3B,CAAC;iBAAM,IAAI,KAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;gBACvC,sCAAsC;gBACtC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnC,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC5B,CAAC;YACD,gDAAgD;QAClD,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACK,YAAY,CAAC,OAAiB;QACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,MAAM,QAAQ,GAAe,EAAE,CAAC;QAEhC,+DAA+D;QAC/D,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QAE1E,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEpC,MAAM,OAAO,GAAa,CAAC,IAAI,CAAC,CAAC;YACjC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAEtB,KAAK,MAAM,SAAS,IAAI,MAAM,EAAE,CAAC;gBAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAAE,SAAS;gBACzC,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,CAAC,SAAS,CAAC,SAAS;oBAAE,SAAS;gBAEtD,MAAM,GAAG,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;gBAClE,IAAI,GAAG,IAAI,oBAAoB,EAAE,CAAC;oBAChC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACxB,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAC7B,CAAC;YACH,CAAC;YAED,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBACxB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,KAAK,MAAM,CAAC,IAAI,OAAO;oBAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,OAAiB;QACvC,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC7E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEtC,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,SAAU,CAAC,MAAM,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,SAAU,CAAC,CAAC,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,QAAQ,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,MAAM,CAAC;QAClC,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF"}

package/dist/engine/eval.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Evaluation Engine — measures whether memory actually helps.
+ *
+ * Four dimensions (from Codex):
+ *   1. Retrieval quality — precision@k, latency
+ *   2. Connection quality — edge utility, stability
+ *   3. Staging accuracy — promotion precision, discard regret
+ *   4. Memory health — contamination tracking, confidence distribution
+ *
+ * Task impact (with/without memory) is measured externally via TaskTrial records.
+ */
+import type { EngramStore } from '../storage/sqlite.js';
+import type { EvalMetrics } from '../types/index.js';
+export declare class EvalEngine {
+    private store;
+    constructor(store: EngramStore);
+    /**
+     * Compute aggregate metrics for an agent over a time window.
+     */
+    computeMetrics(agentId: string, windowHours?: number): EvalMetrics;
+}
+//# sourceMappingURL=eval.d.ts.map

package/dist/engine/eval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"eval.d.ts","sourceRoot":"","sources":["../../src/engine/eval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAErD,qBAAa,UAAU;IACrB,OAAO,CAAC,KAAK,CAAc;gBAEf,KAAK,EAAE,WAAW;IAI9B;;OAEG;IACH,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,GAAE,MAAW,GAAG,WAAW;CA0EvE"}

package/dist/engine/eval.js

@@ -0,0 +1,79 @@
+/**
+ * Evaluation Engine — measures whether memory actually helps.
+ *
+ * Four dimensions (from Codex):
+ *   1. Retrieval quality — precision@k, latency
+ *   2. Connection quality — edge utility, stability
+ *   3. Staging accuracy — promotion precision, discard regret
+ *   4. Memory health — contamination tracking, confidence distribution
+ *
+ * Task impact (with/without memory) is measured externally via TaskTrial records.
+ */
+export class EvalEngine {
+    store;
+    constructor(store) {
+        this.store = store;
+    }
+    /**
+     * Compute aggregate metrics for an agent over a time window.
+     */
+    computeMetrics(agentId, windowHours = 24) {
+        const window = windowHours <= 24 ? '24h' : `${Math.round(windowHours / 24)}d`;
+        // Retrieval quality
+        const precision = this.store.getRetrievalPrecision(agentId, windowHours);
+        // Staging accuracy
+        const stagingMetrics = this.store.getStagingMetrics(agentId);
+        const totalStaged = stagingMetrics.promoted + stagingMetrics.discarded + stagingMetrics.expired;
+        const promotionPrecision = totalStaged > 0 ? stagingMetrics.promoted / totalStaged : 0;
+        // Memory health
+        const activeEngrams = this.store.getEngramsByAgent(agentId, 'active');
+        const stagingEngrams = this.store.getEngramsByAgent(agentId, 'staging');
+        const retractedEngrams = this.store.getEngramsByAgent(agentId, undefined, true)
+            .filter(e => e.retracted);
+        const allAssociations = this.store.getAllAssociations(agentId);
+        const avgConfidence = activeEngrams.length > 0
+            ? activeEngrams.reduce((sum, e) => sum + e.confidence, 0) / activeEngrams.length
+            : 0;
+        // Edge utility — % of edges that have been used in activation
+        const usedEdges = allAssociations.filter(a => a.activationCount > 0);
+        const edgeUtility = allAssociations.length > 0
+            ? usedEdges.length / allAssociations.length
+            : 0;
+        // Edge survival — average age of edges that are still above minimum weight
+        const livingEdges = allAssociations.filter(a => a.weight > 0.01);
+        const avgSurvival = livingEdges.length > 0
+            ? livingEdges.reduce((sum, a) => sum + (Date.now() - a.createdAt.getTime()) / (1000 * 60 * 60 * 24), 0) / livingEdges.length
+            : 0;
+        // Activation performance stats
+        const activationStats = this.store.getActivationStats(agentId, windowHours);
+        // Consolidated count
+        const consolidatedCount = this.store.getConsolidatedCount(agentId);
+        return {
+            agentId,
+            timestamp: new Date(),
+            window,
+            activationCount: activationStats.count,
+            avgPrecisionAtK: precision,
+            avgLatencyMs: activationStats.avgLatencyMs,
+            p95LatencyMs: activationStats.p95LatencyMs,
+            totalEdges: allAssociations.length,
+            edgesUsedInActivation: usedEdges.length,
+            edgeUtilityRate: edgeUtility,
+            avgEdgeSurvivalDays: avgSurvival,
+            totalStaged: totalStaged,
+            promotedCount: stagingMetrics.promoted,
+            discardedCount: stagingMetrics.discarded,
+            promotionPrecision,
+            discardRegret: 0, // Requires tracking discarded-then-rediscovered items
+            activeEngramCount: activeEngrams.length,
+            stagingEngramCount: stagingEngrams.length,
+            retractedCount: retractedEngrams.length,
+            consolidatedCount,
+            avgConfidence,
+            staleUsageCount: 0, // Requires per-activation age/confidence tracking
+            retractionRate: retractedEngrams.length /
+                Math.max(activeEngrams.length + retractedEngrams.length, 1),
+        };
+    }
+}
+//# sourceMappingURL=eval.js.map

package/dist/engine/eval.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eval.js","sourceRoot":"","sources":["../../src/engine/eval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,MAAM,OAAO,UAAU;IACb,KAAK,CAAc;IAE3B,YAAY,KAAkB;QAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,OAAe,EAAE,cAAsB,EAAE;QACtD,MAAM,MAAM,GAAG,WAAW,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,EAAE,CAAC,GAAG,CAAC;QAE9E,oBAAoB;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QAEzE,mBAAmB;QACnB,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAC7D,MAAM,WAAW,GAAG,cAAc,CAAC,QAAQ,GAAG,cAAc,CAAC,SAAS,GAAG,cAAc,CAAC,OAAO,CAAC;QAChG,MAAM,kBAAkB,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAEvF,gBAAgB;QAChB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACtE,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACxE,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC;aAC5E,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAC5B,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAE/D,MAAM,aAAa,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC;YAC5C,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,aAAa,CAAC,MAAM;YAChF,CAAC,CAAC,CAAC,CAAC;QAEN,8DAA8D;QAC9D,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;QACrE,MAAM,WAAW,GAAG,eAAe,CAAC,MAAM,GAAG,CAAC;YAC5C,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM;YAC3C,CAAC,CAAC,CAAC,CAAC;QAEN,2EAA2E;QAC3E,MAAM,WAAW,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;QACjE,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC;YACxC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAC5B,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CACtE,GAAG,WAAW,CAAC,MAAM;YACxB,CAAC,CAAC,CAAC,CAAC;QAEN,+BAA+B;QAC/B,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;QAE5E,qBAAqB;QACrB,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;QAEnE,OAAO;YACL,OAAO;YACP,SAAS,EAAE,IAAI,IAAI,EAAE;YACrB,MAAM;YAEN,eAAe,EAAE,eAAe,CAAC,KAAK;YACtC,eAAe,EAAE,SAAS;YAC1B,YAAY,EAAE,eAAe,CAAC,YAAY;YAC1C,YAAY,EAAE,eAAe,CAAC,YAAY;YAE1C,UAAU,EAAE,eAAe,CAAC,MAAM;YAClC,qBAAqB,EAAE,SAAS,CAAC,MAAM;YACvC,eAAe,EAAE,WAAW;YAC5B,mBAAmB,EAAE,WAAW;YAEhC,WAAW,EAAE,WAAW;YACxB,aAAa,EAAE,cAAc,CAAC,QAAQ;YACtC,cAAc,EAAE,cAAc,CAAC,SAAS;YACxC,kBAAkB;YAClB,aAAa,EAAE,CAAC,EAAE,sDAAsD;YAExE,iBAAiB,EAAE,aAAa,CAAC,MAAM;YACvC,kBAAkB,EAAE,cAAc,CAAC,MAAM;YACzC,cAAc,EAAE,gBAAgB,CAAC,MAAM;YACvC,iBAAiB;YACjB,aAAa;YAEb,eAAe,EAAE,CAAC,EAAE,kDAAkD;YACtE,cAAc,EAAE,gBAAgB,CAAC,MAAM;gBACrC,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC;SAC9D,CAAC;IACJ,CAAC;CACF"}

package/dist/engine/eviction.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Eviction Engine — capacity enforcement and edge pruning.
+ *
+ * When memory budgets are exceeded:
+ *   1. Archive lowest-value active engrams
+ *   2. Delete expired staging engrams
+ *   3. Prune weakest edges when per-engram cap exceeded
+ *   4. Decay unused association weights over time
+ */
+import type { EngramStore } from '../storage/sqlite.js';
+import type { AgentConfig } from '../types/agent.js';
+export declare class EvictionEngine {
+    private store;
+    constructor(store: EngramStore);
+    /**
+     * Check capacity budgets and evict if needed.
+     * Returns count of evicted engrams.
+     */
+    enforceCapacity(agentId: string, config: AgentConfig): {
+        evicted: number;
+        edgesPruned: number;
+    };
+    /**
+     * Decay all association weights based on time since last activation.
+     * Run periodically (e.g., daily).
+     */
+    decayEdges(agentId: string, halfLifeDays?: number): number;
+}
+//# sourceMappingURL=eviction.d.ts.map

package/dist/engine/eviction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"eviction.d.ts","sourceRoot":"","sources":["../../src/engine/eviction.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACxD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAGrD,qBAAa,cAAc;IACzB,OAAO,CAAC,KAAK,CAAc;gBAEf,KAAK,EAAE,WAAW;IAI9B;;;OAGG;IACH,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAA;KAAE;IA8C/F;;;OAGG;IACH,UAAU,CAAC,OAAO,EAAE,MAAM,EAAE,YAAY,GAAE,MAAU,GAAG,MAAM;CAuB9D"}

package/dist/engine/eviction.js

@@ -0,0 +1,86 @@
+/**
+ * Eviction Engine — capacity enforcement and edge pruning.
+ *
+ * When memory budgets are exceeded:
+ *   1. Archive lowest-value active engrams
+ *   2. Delete expired staging engrams
+ *   3. Prune weakest edges when per-engram cap exceeded
+ *   4. Decay unused association weights over time
+ */
+import { decayAssociation } from '../core/hebbian.js';
+export class EvictionEngine {
+    store;
+    constructor(store) {
+        this.store = store;
+    }
+    /**
+     * Check capacity budgets and evict if needed.
+     * Returns count of evicted engrams.
+     */
+    enforceCapacity(agentId, config) {
+        let evicted = 0;
+        let edgesPruned = 0;
+        // Active engram budget
+        const activeCount = this.store.getActiveCount(agentId);
+        if (activeCount > config.maxActiveEngrams) {
+            const excess = activeCount - config.maxActiveEngrams;
+            const candidates = this.store.getEvictionCandidates(agentId, excess);
+            for (const engram of candidates) {
+                this.store.updateStage(engram.id, 'archived');
+                evicted++;
+            }
+        }
+        // Staging budget
+        const stagingCount = this.store.getStagingCount(agentId);
+        if (stagingCount > config.maxStagingEngrams) {
+            const expired = this.store.getExpiredStaging();
+            for (const engram of expired) {
+                this.store.deleteEngram(engram.id);
+                evicted++;
+            }
+        }
+        // Edge pruning — cap per engram
+        const engrams = this.store.getEngramsByAgent(agentId, 'active');
+        for (const engram of engrams) {
+            const edgeCount = this.store.countAssociationsFor(engram.id);
+            if (edgeCount > config.maxEdgesPerEngram) {
+                // Remove weakest edges until under cap
+                let toRemove = edgeCount - config.maxEdgesPerEngram;
+                while (toRemove > 0) {
+                    const weakest = this.store.getWeakestAssociation(engram.id);
+                    if (weakest) {
+                        this.store.deleteAssociation(weakest.id);
+                        edgesPruned++;
+                    }
+                    toRemove--;
+                }
+            }
+        }
+        return { evicted, edgesPruned };
+    }
+    /**
+     * Decay all association weights based on time since last activation.
+     * Run periodically (e.g., daily).
+     */
+    decayEdges(agentId, halfLifeDays = 7) {
+        const associations = this.store.getAllAssociations(agentId);
+        let decayed = 0;
+        for (const assoc of associations) {
+            const daysSince = (Date.now() - assoc.lastActivated.getTime()) / (1000 * 60 * 60 * 24);
+            if (daysSince < 0.5)
+                continue; // Skip recently activated
+            const newWeight = decayAssociation(assoc.weight, daysSince, halfLifeDays);
+            if (newWeight < 0.01) {
+                // Below minimum useful weight — prune
+                this.store.deleteAssociation(assoc.id);
+                decayed++;
+            }
+            else if (Math.abs(newWeight - assoc.weight) > 0.001) {
+                this.store.upsertAssociation(assoc.fromEngramId, assoc.toEngramId, newWeight, assoc.type, assoc.confidence);
+                decayed++;
+            }
+        }
+        return decayed;
+    }
+}
+//# sourceMappingURL=eviction.js.map

package/dist/engine/eviction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"eviction.js","sourceRoot":"","sources":["../../src/engine/eviction.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,MAAM,OAAO,cAAc;IACjB,KAAK,CAAc;IAE3B,YAAY,KAAkB;QAC5B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,OAAe,EAAE,MAAmB;QAClD,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,uBAAuB;QACvB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvD,IAAI,WAAW,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,WAAW,GAAG,MAAM,CAAC,gBAAgB,CAAC;YACrD,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACrE,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;gBAChC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBAC9C,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,iBAAiB;QACjB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QACzD,IAAI,YAAY,GAAG,MAAM,CAAC,iBAAiB,EAAE,CAAC;YAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAC/C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACnC,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QAChE,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAC7D,IAAI,SAAS,GAAG,MAAM,CAAC,iBAAiB,EAAE,CAAC;gBACzC,uCAAuC;gBACvC,IAAI,QAAQ,GAAG,SAAS,GAAG,MAAM,CAAC,iBAAiB,CAAC;gBACpD,OAAO,QAAQ,GAAG,CAAC,EAAE,CAAC;oBACpB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;oBAC5D,IAAI,OAAO,EAAE,CAAC;wBACZ,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;wBACzC,WAAW,EAAE,CAAC;oBAChB,CAAC;oBACD,QAAQ,EAAE,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,OAAe,EAAE,eAAuB,CAAC;QAClD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;QAC5D,IAAI,OAAO,GAAG,CAAC,CAAC;QAEhB,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;YACvF,IAAI,SAAS,GAAG,GAAG;gBAAE,SAAS,CAAC,0BAA0B;YAEzD,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;YAC1E,IAAI,SAAS,GAAG,IAAI,EAAE,CAAC;gBACrB,sCAAsC;gBACtC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACvC,OAAO,EAAE,CAAC;YACZ,CAAC;iBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;gBACtD,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAC1B,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAC9E,CAAC;gBACF,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/engine/index.d.ts

@@ -0,0 +1,7 @@
+export * from './activation.js';
+export * from './staging.js';
+export * from './connections.js';
+export * from './eviction.js';
+export * from './retraction.js';
+export * from './eval.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/engine/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/engine/index.ts"],"names":[],"mappings":"AAAA,cAAc,iBAAiB,CAAC;AAChC,cAAc,cAAc,CAAC;AAC7B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,iBAAiB,CAAC;AAChC,cAAc,WAAW,CAAC"}