shieldcortex 2.20.0 → 3.0.0

package/dist/__tests__/format-memory.test.js

@@ -1,69 +0,0 @@
-/**
- * formatMemory Tests
- *
- * Verifies that memory content is returned in full when verbose=true
- * and truncated to 200 chars when verbose=false.
- *
- * Regression test for GitHub issue #8:
- * https://github.com/Drakon-Systems-Ltd/ShieldCortex/issues/8
- */
-import { describe, it, expect } from '@jest/globals';
-import { formatMemory } from '../tools/recall.js';
-function makeMemory(overrides = {}) {
-    return {
-        id: 1,
-        type: 'long_term',
-        category: 'architecture',
-        title: 'Test Memory',
-        content: 'Short content',
-        project: 'test',
-        tags: [],
-        salience: 0.8,
-        accessCount: 1,
-        lastAccessed: new Date(),
-        createdAt: new Date(),
-        decayedScore: 0.7,
-        metadata: {},
-        scope: 'project',
-        transferable: false,
-        ...overrides,
-    };
-}
-describe('formatMemory', () => {
-    const longContent = 'A'.repeat(500);
-    const shortContent = 'Short content under 200 chars';
-    it('should return full content when verbose=true', () => {
-        const mem = makeMemory({ content: longContent });
-        const output = formatMemory(mem, true);
-        expect(output).toContain(longContent);
-        expect(output).not.toContain('...');
-    });
-    it('should truncate content to 200 chars when verbose=false', () => {
-        const mem = makeMemory({ content: longContent });
-        const output = formatMemory(mem, false);
-        expect(output).not.toContain(longContent);
-        expect(output).toContain('...');
-        expect(output).toContain('A'.repeat(200));
-    });
-    it('should truncate by default when verbose is omitted', () => {
-        const mem = makeMemory({ content: longContent });
-        const output = formatMemory(mem);
-        expect(output).not.toContain(longContent);
-        expect(output).toContain('...');
-    });
-    it('should not append ellipsis to short content', () => {
-        const mem = makeMemory({ content: shortContent });
-        const output = formatMemory(mem, false);
-        expect(output).toContain(shortContent);
-        expect(output).not.toContain('...');
-    });
-    it('should include metadata when verbose=true', () => {
-        const mem = makeMemory({ content: shortContent, tags: ['test-tag'], project: 'my-project' });
-        const output = formatMemory(mem, true);
-        expect(output).toContain('Type: long_term');
-        expect(output).toContain('Category: architecture');
-        expect(output).toContain('Tags: test-tag');
-        expect(output).toContain('Project: my-project');
-    });
-});
-//# sourceMappingURL=format-memory.test.js.map

package/dist/__tests__/format-memory.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"format-memory.test.js","sourceRoot":"","sources":["../../src/__tests__/format-memory.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,eAAe,CAAC;AAErD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD,SAAS,UAAU,CAAC,YAA6B,EAAE;IACjD,OAAO;QACL,EAAE,EAAE,CAAC;QACL,IAAI,EAAE,WAAW;QACjB,QAAQ,EAAE,cAAc;QACxB,KAAK,EAAE,aAAa;QACpB,OAAO,EAAE,eAAe;QACxB,OAAO,EAAE,MAAM;QACf,IAAI,EAAE,EAAE;QACR,QAAQ,EAAE,GAAG;QACb,WAAW,EAAE,CAAC;QACd,YAAY,EAAE,IAAI,IAAI,EAAE;QACxB,SAAS,EAAE,IAAI,IAAI,EAAE;QACrB,YAAY,EAAE,GAAG;QACjB,QAAQ,EAAE,EAAE;QACZ,KAAK,EAAE,SAAS;QAChB,YAAY,EAAE,KAAK;QACnB,GAAG,SAAS;KACb,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,YAAY,GAAG,+BAA+B,CAAC;IAErD,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,GAAG,GAAG,UAAU,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,CAAC,CAAC;QAC7F,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,wBAAwB,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/__tests__/salience-evolution.test.d.ts

@@ -1,7 +0,0 @@
-/**
- * Salience Evolution Tests
- *
- * Tests that salience evolves over time based on structural importance.
- */
-export {};
-//# sourceMappingURL=salience-evolution.test.d.ts.map

package/dist/__tests__/salience-evolution.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"salience-evolution.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/salience-evolution.test.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}

package/dist/__tests__/salience-evolution.test.js

@@ -1,151 +0,0 @@
-/**
- * Salience Evolution Tests
- *
- * Tests that salience evolves over time based on structural importance.
- */
-import { describe, it, expect, beforeAll, afterAll } from '@jest/globals';
-import Database from 'better-sqlite3';
-import path from 'path';
-import fs from 'fs';
-import os from 'os';
-describe('Salience Evolution', () => {
-    let db;
-    let dbPath;
-    beforeAll(() => {
-        // Create a temp database for testing
-        dbPath = path.join(os.tmpdir(), `shieldcortex-test-${Date.now()}.db`);
-        db = new Database(dbPath);
-        // Create minimal schema
-        db.exec(`
-      CREATE TABLE IF NOT EXISTS memories (
-        id INTEGER PRIMARY KEY AUTOINCREMENT,
-        type TEXT NOT NULL DEFAULT 'short_term',
-        category TEXT NOT NULL DEFAULT 'note',
-        title TEXT NOT NULL,
-        content TEXT NOT NULL,
-        project TEXT,
-        tags TEXT DEFAULT '[]',
-        salience REAL DEFAULT 0.5,
-        decayed_score REAL DEFAULT 0.5,
-        access_count INTEGER DEFAULT 0,
-        metadata TEXT DEFAULT '{}',
-        created_at DATETIME DEFAULT CURRENT_TIMESTAMP,
-        last_accessed DATETIME DEFAULT CURRENT_TIMESTAMP
-      );
-
-      CREATE TABLE IF NOT EXISTS memory_links (
-        id INTEGER PRIMARY KEY AUTOINCREMENT,
-        source_id INTEGER NOT NULL,
-        target_id INTEGER NOT NULL,
-        relationship TEXT NOT NULL DEFAULT 'related',
-        strength REAL DEFAULT 0.5,
-        created_at DATETIME DEFAULT CURRENT_TIMESTAMP,
-        FOREIGN KEY (source_id) REFERENCES memories(id) ON DELETE CASCADE,
-        FOREIGN KEY (target_id) REFERENCES memories(id) ON DELETE CASCADE,
-        UNIQUE(source_id, target_id, relationship)
-      );
-    `);
-    });
-    afterAll(() => {
-        db.close();
-        try {
-            fs.unlinkSync(dbPath);
-        }
-        catch { }
-    });
-    it('should boost salience of hub memories with many links', () => {
-        // Create a hub memory
-        const hubResult = db.prepare(`
-      INSERT INTO memories (type, category, title, content, salience)
-      VALUES ('long_term', 'architecture', 'Hub Memory', 'Central architecture decision', 0.5)
-    `).run();
-        const hubId = hubResult.lastInsertRowid;
-        // Create 5 linked memories
-        const linkedIds = [];
-        for (let i = 0; i < 5; i++) {
-            const r = db.prepare(`
-        INSERT INTO memories (type, category, title, content, salience)
-        VALUES ('long_term', 'note', 'Linked ${i}', 'Related content ${i}', 0.4)
-      `).run();
-            linkedIds.push(r.lastInsertRowid);
-            db.prepare(`
-        INSERT INTO memory_links (source_id, target_id, relationship, strength)
-        VALUES (?, ?, 'related', 0.5)
-      `).run(linkedIds[i], hubId);
-        }
-        const originalSalience = db.prepare('SELECT salience FROM memories WHERE id = ?').get(hubId).salience;
-        // Run evolveSalience logic inline (same as the function)
-        const hubs = db.prepare(`
-      SELECT m.id, m.salience,
-        (SELECT COUNT(*) FROM memory_links WHERE source_id = m.id OR target_id = m.id) as link_count
-      FROM memories m
-      WHERE m.type IN ('long_term', 'episodic')
-    `).all();
-        for (const hub of hubs) {
-            if (hub.link_count < 2)
-                continue;
-            const linkBonus = Math.min(0.1, Math.log2(hub.link_count) * 0.03);
-            const newSalience = Math.min(1.0, hub.salience + linkBonus);
-            if (newSalience > hub.salience) {
-                db.prepare('UPDATE memories SET salience = ? WHERE id = ?').run(newSalience, hub.id);
-            }
-        }
-        const newSalience = db.prepare('SELECT salience FROM memories WHERE id = ?').get(hubId).salience;
-        expect(newSalience).toBeGreaterThan(originalSalience);
-    });
-    it('should penalize contradicted memories', () => {
-        // Create two contradicting memories
-        const m1 = db.prepare(`
-      INSERT INTO memories (type, category, title, content, salience)
-      VALUES ('long_term', 'architecture', 'Use REST', 'We should use REST APIs', 0.6)
-    `).run();
-        const m2 = db.prepare(`
-      INSERT INTO memories (type, category, title, content, salience)
-      VALUES ('long_term', 'architecture', 'Use GraphQL', 'We should use GraphQL', 0.6)
-    `).run();
-        db.prepare(`
-      INSERT INTO memory_links (source_id, target_id, relationship, strength)
-      VALUES (?, ?, 'contradicts', 0.8)
-    `).run(m1.lastInsertRowid, m2.lastInsertRowid);
-        // Run contradiction penalty logic
-        const contradicted = db.prepare(`
-      SELECT DISTINCT source_id, target_id
-      FROM memory_links
-      WHERE relationship = 'contradicts'
-    `).all();
-        for (const pair of contradicted) {
-            for (const id of [pair.source_id, pair.target_id]) {
-                const mem = db.prepare('SELECT salience FROM memories WHERE id = ?').get(id);
-                if (mem && mem.salience > 0.3) {
-                    db.prepare('UPDATE memories SET salience = ? WHERE id = ?')
-                        .run(mem.salience - 0.02, id);
-                }
-            }
-        }
-        const s1 = db.prepare('SELECT salience FROM memories WHERE id = ?').get(m1.lastInsertRowid).salience;
-        const s2 = db.prepare('SELECT salience FROM memories WHERE id = ?').get(m2.lastInsertRowid).salience;
-        expect(s1).toBeCloseTo(0.58, 2);
-        expect(s2).toBeCloseTo(0.58, 2);
-    });
-});
-describe('Mention Count', () => {
-    it('should count keyword mentions in text', async () => {
-        const { analyzeSalienceFactors } = await import('../memory/salience.js');
-        // Text with multiple keyword matches
-        const factors = analyzeSalienceFactors({
-            title: 'Architecture fix',
-            content: 'Fixed a bug in the database schema pattern using a workaround strategy',
-        });
-        // Should match multiple keywords across categories
-        expect(factors.mentionCount).toBeGreaterThan(1);
-    });
-    it('should return at least 1 for text with no keywords', async () => {
-        const { analyzeSalienceFactors } = await import('../memory/salience.js');
-        const factors = analyzeSalienceFactors({
-            title: 'Hello',
-            content: 'Just a simple note',
-        });
-        expect(factors.mentionCount).toBeGreaterThanOrEqual(1);
-    });
-});
-//# sourceMappingURL=salience-evolution.test.js.map

package/dist/__tests__/salience-evolution.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"salience-evolution.test.js","sourceRoot":"","sources":["../../src/__tests__/salience-evolution.test.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC1E,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,IAAI,MAAM,MAAM,CAAC;AACxB,OAAO,EAAE,MAAM,IAAI,CAAC;AACpB,OAAO,EAAE,MAAM,IAAI,CAAC;AAEpB,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,IAAI,EAAiC,CAAC;IACtC,IAAI,MAAc,CAAC;IAEnB,SAAS,CAAC,GAAG,EAAE;QACb,qCAAqC;QACrC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,qBAAqB,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACtE,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QAE1B,wBAAwB;QACxB,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;KA4BP,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,GAAG,EAAE;QACZ,EAAE,CAAC,KAAK,EAAE,CAAC;QACX,IAAI,CAAC;YAAC,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC,CAAA,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,sBAAsB;QACtB,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAG5B,CAAC,CAAC,GAAG,EAAE,CAAC;QACT,MAAM,KAAK,GAAG,SAAS,CAAC,eAAyB,CAAC;QAElD,2BAA2B;QAC3B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC;;+CAEoB,CAAC,uBAAuB,CAAC;OACjE,CAAC,CAAC,GAAG,EAAE,CAAC;YACT,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,eAAyB,CAAC,CAAC;YAE5C,EAAE,CAAC,OAAO,CAAC;;;OAGV,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC;QAED,MAAM,gBAAgB,GAAI,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC,GAAG,CAAC,KAAK,CAAS,CAAC,QAAQ,CAAC;QAE/G,yDAAyD;QACzD,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAKvB,CAAC,CAAC,GAAG,EAA4D,CAAC;QAEnE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,UAAU,GAAG,CAAC;gBAAE,SAAS;YACjC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,CAAC;YAClE,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,QAAQ,GAAG,SAAS,CAAC,CAAC;YAC5D,IAAI,WAAW,GAAG,GAAG,CAAC,QAAQ,EAAE,CAAC;gBAC/B,EAAE,CAAC,OAAO,CAAC,+CAA+C,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QAED,MAAM,WAAW,GAAI,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC,GAAG,CAAC,KAAK,CAAS,CAAC,QAAQ,CAAC;QAC1G,MAAM,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,gBAAgB,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,oCAAoC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGrB,CAAC,CAAC,GAAG,EAAE,CAAC;QACT,MAAM,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGrB,CAAC,CAAC,GAAG,EAAE,CAAC;QAET,EAAE,CAAC,OAAO,CAAC;;;KAGV,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,eAAe,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC;QAE/C,kCAAkC;QAClC,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC;;;;KAI/B,CAAC,CAAC,GAAG,EAAgD,CAAC;QAEvD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,KAAK,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAClD,MAAM,GAAG,GAAG,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC,GAAG,CAAC,EAAE,CAAQ,CAAC;gBACpF,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,GAAG,GAAG,EAAE,CAAC;oBAC9B,EAAE,CAAC,OAAO,CAAC,+CAA+C,CAAC;yBACxD,GAAG,CAAC,GAAG,CAAC,QAAQ,GAAG,IAAI,EAAE,EAAE,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,EAAE,GAAI,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,eAAe,CAAS,CAAC,QAAQ,CAAC;QAC9G,MAAM,EAAE,GAAI,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,eAAe,CAAS,CAAC,QAAQ,CAAC;QAE9G,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,EAAE,CAAC,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,EAAE,CAAC,uCAAuC,EAAE,KAAK,IAAI,EAAE;QACrD,MAAM,EAAE,sBAAsB,EAAE,GAAG,MAAM,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAEzE,qCAAqC;QACrC,MAAM,OAAO,GAAG,sBAAsB,CAAC;YACrC,KAAK,EAAE,kBAAkB;YACzB,OAAO,EAAE,wEAAwE;SAClF,CAAC,CAAC;QAEH,mDAAmD;QACnD,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;QAClE,MAAM,EAAE,sBAAsB,EAAE,GAAG,MAAM,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAEzE,MAAM,OAAO,GAAG,sBAAsB,CAAC;YACrC,KAAK,EAAE,OAAO;YACd,OAAO,EAAE,oBAAoB;SAC9B,CAAC,CAAC;QAEH,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/__tests__/store.test.d.ts

@@ -1,7 +0,0 @@
-/**
- * Memory Store Tests
- *
- * Tests for core memory operations, salience detection, and decay calculations.
- */
-export {};
-//# sourceMappingURL=store.test.d.ts.map

package/dist/__tests__/store.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"store.test.d.ts","sourceRoot":"","sources":["../../src/__tests__/store.test.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}