@swarmdo/cli 1.4.8

package/vendor/memory/dist/domain/services/memory-domain-service.js

@@ -0,0 +1,297 @@
+/**
+ * Memory Domain Service - Domain Layer
+ *
+ * Contains domain logic that doesn't naturally fit within a single entity.
+ * Coordinates between multiple memory entries and enforces domain rules.
+ *
+ * @module v3/memory/domain/services
+ */
+import { MemoryEntry } from '../entities/memory-entry.js';
+/**
+ * Memory Domain Service
+ *
+ * Provides domain-level operations that span multiple entities.
+ * Implements business rules for memory management.
+ */
+export class MemoryDomainService {
+    repository;
+    constructor(repository) {
+        this.repository = repository;
+    }
+    /**
+     * Store a new memory with automatic type detection
+     */
+    async storeWithTypeDetection(namespace, key, value, vector) {
+        const type = this.detectMemoryType(value);
+        const entry = MemoryEntry.create({
+            namespace,
+            key,
+            value,
+            type,
+            vector,
+        });
+        await this.repository.save(entry);
+        return entry;
+    }
+    /**
+     * Retrieve and record access
+     */
+    async retrieveWithAccessTracking(namespace, key) {
+        const entry = await this.repository.findByKey(namespace, key);
+        if (entry && entry.isAccessible()) {
+            entry.recordAccess();
+            await this.repository.save(entry);
+        }
+        return entry;
+    }
+    /**
+     * Search for similar memories and record access
+     */
+    async searchSimilarWithTracking(vector, namespace, limit = 10) {
+        const results = await this.repository.searchByVector({
+            vector,
+            namespace,
+            limit,
+        });
+        // Record access for all returned entries
+        await Promise.all(results.map(async (result) => {
+            result.entry.recordAccess();
+            await this.repository.save(result.entry);
+        }));
+        return results;
+    }
+    /**
+     * Consolidate memories based on strategy
+     */
+    async consolidate(options) {
+        const entries = await this.repository.findByNamespace(options.namespace ?? 'default', { status: 'active' });
+        let result = {
+            processed: entries.length,
+            consolidated: 0,
+            removed: 0,
+            newEntries: [],
+        };
+        switch (options.strategy) {
+            case 'prune':
+                result = await this.pruneOldMemories(entries, options);
+                break;
+            case 'dedupe':
+                const dedupeResult = await this.deduplicateMemories(entries, options);
+                result.removed = dedupeResult.duplicatesRemoved;
+                break;
+            case 'merge':
+                result = await this.mergeRelatedMemories(entries, options);
+                break;
+            default:
+            // No-op for unknown strategies
+        }
+        return result;
+    }
+    /**
+     * Detect memory type based on value structure
+     */
+    detectMemoryType(value) {
+        if (typeof value === 'string') {
+            // Long text is likely semantic
+            if (value.length > 500)
+                return 'semantic';
+            // Short instructions are procedural
+            if (value.includes('->') || value.includes('then'))
+                return 'procedural';
+        }
+        if (typeof value === 'object' && value !== null) {
+            const obj = value;
+            // Objects with timestamps are episodic
+            if ('timestamp' in obj || 'when' in obj || 'date' in obj)
+                return 'episodic';
+            // Objects with steps are procedural
+            if ('steps' in obj || 'actions' in obj)
+                return 'procedural';
+        }
+        // Default to working memory for short-term storage
+        return 'working';
+    }
+    /**
+     * Prune old, rarely accessed memories
+     */
+    async pruneOldMemories(entries, options) {
+        const maxAge = options.maxAge ?? 7 * 24 * 60 * 60 * 1000; // 7 days default
+        const threshold = options.threshold ?? 5; // Minimum access count to keep
+        const now = Date.now();
+        const toRemove = [];
+        for (const entry of entries) {
+            const age = now - entry.createdAt.getTime();
+            const isOld = age > maxAge;
+            const isRarelyAccessed = entry.accessCount < threshold;
+            // Keep hot memories if requested
+            if (options.keepHot && entry.isHot())
+                continue;
+            if (isOld && isRarelyAccessed) {
+                entry.archive();
+                toRemove.push(entry.id);
+            }
+        }
+        if (toRemove.length > 0) {
+            await this.repository.deleteMany(toRemove);
+        }
+        return {
+            processed: entries.length,
+            consolidated: 0,
+            removed: toRemove.length,
+            newEntries: [],
+        };
+    }
+    /**
+     * Find and remove duplicate memories
+     */
+    async deduplicateMemories(entries, options) {
+        const threshold = options.threshold ?? 0.95; // Similarity threshold
+        const duplicates = [];
+        const processed = new Set();
+        for (let i = 0; i < entries.length; i++) {
+            if (processed.has(entries[i].id))
+                continue;
+            const entry = entries[i];
+            if (!entry.vector)
+                continue;
+            // Find similar entries
+            const similar = await this.repository.searchByVector({
+                vector: entry.vector,
+                namespace: entry.namespace,
+                limit: 10,
+                threshold,
+            });
+            // Mark duplicates (keep the one with highest access count)
+            const group = similar
+                .filter((s) => s.entry.id !== entry.id && s.similarity >= threshold)
+                .sort((a, b) => b.entry.accessCount - a.entry.accessCount);
+            for (const dup of group.slice(1)) {
+                duplicates.push(dup.entry.id);
+                processed.add(dup.entry.id);
+            }
+            processed.add(entry.id);
+        }
+        if (duplicates.length > 0) {
+            await this.repository.deleteMany(duplicates);
+        }
+        return {
+            duplicatesFound: duplicates.length,
+            duplicatesRemoved: duplicates.length,
+            groupsProcessed: processed.size,
+        };
+    }
+    /**
+     * Merge related memories into consolidated entries
+     */
+    async mergeRelatedMemories(entries, options) {
+        const threshold = options.threshold ?? 0.8;
+        const newEntries = [];
+        const toRemove = [];
+        const processed = new Set();
+        for (const entry of entries) {
+            if (processed.has(entry.id))
+                continue;
+            if (!entry.vector) {
+                processed.add(entry.id);
+                continue;
+            }
+            // Find related entries
+            const related = await this.repository.searchByVector({
+                vector: entry.vector,
+                namespace: entry.namespace,
+                limit: 5,
+                threshold,
+            });
+            if (related.length > 1) {
+                // Merge related entries
+                const merged = this.mergeEntries(related.map((r) => r.entry));
+                newEntries.push(merged);
+                for (const r of related) {
+                    toRemove.push(r.entry.id);
+                    processed.add(r.entry.id);
+                }
+            }
+            else {
+                processed.add(entry.id);
+            }
+        }
+        // Remove old entries and save merged ones
+        if (toRemove.length > 0) {
+            await this.repository.deleteMany(toRemove);
+        }
+        if (newEntries.length > 0) {
+            await this.repository.saveMany(newEntries);
+        }
+        return {
+            processed: entries.length,
+            consolidated: newEntries.length,
+            removed: toRemove.length,
+            newEntries,
+        };
+    }
+    /**
+     * Merge multiple entries into one
+     */
+    mergeEntries(entries) {
+        // Sort by access count to prioritize most accessed
+        const sorted = [...entries].sort((a, b) => b.accessCount - a.accessCount);
+        const primary = sorted[0];
+        // Combine metadata
+        const combinedMetadata = {};
+        for (const entry of entries) {
+            Object.assign(combinedMetadata, entry.metadata);
+        }
+        combinedMetadata.mergedFrom = entries.map((e) => e.id);
+        combinedMetadata.mergedAt = new Date().toISOString();
+        // Create merged entry
+        return MemoryEntry.create({
+            namespace: primary.namespace,
+            key: `merged_${Date.now()}`,
+            value: {
+                primary: primary.value,
+                related: sorted.slice(1).map((e) => e.value),
+            },
+            type: primary.type,
+            vector: primary.vector,
+            metadata: combinedMetadata,
+            accessCount: entries.reduce((sum, e) => sum + e.accessCount, 0),
+        });
+    }
+    /**
+     * Analyze a namespace
+     */
+    async analyzeNamespace(namespace) {
+        const entries = await this.repository.findByNamespace(namespace);
+        const active = entries.filter((e) => e.status === 'active');
+        const typeDistribution = {
+            semantic: 0,
+            episodic: 0,
+            procedural: 0,
+            working: 0,
+        };
+        let totalAccessCount = 0;
+        let totalSize = 0;
+        let oldestDate = new Date();
+        let newestDate = new Date(0);
+        for (const entry of entries) {
+            typeDistribution[entry.type]++;
+            totalAccessCount += entry.accessCount;
+            totalSize += JSON.stringify(entry.value).length;
+            if (entry.createdAt < oldestDate)
+                oldestDate = entry.createdAt;
+            if (entry.createdAt > newestDate)
+                newestDate = entry.createdAt;
+        }
+        return {
+            namespace,
+            totalEntries: entries.length,
+            activeEntries: active.length,
+            totalSize,
+            averageAccessCount: entries.length > 0 ? totalAccessCount / entries.length : 0,
+            oldestEntry: oldestDate,
+            newestEntry: newestDate,
+            typeDistribution,
+        };
+    }
+}
+//# sourceMappingURL=memory-domain-service.js.map

package/vendor/memory/dist/domain/services/memory-domain-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-domain-service.js","sourceRoot":"","sources":["../../../src/domain/services/memory-domain-service.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,WAAW,EAAgC,MAAM,6BAA6B,CAAC;AAoDxF;;;;;GAKG;AACH,MAAM,OAAO,mBAAmB;IACD;IAA7B,YAA6B,UAA6B;QAA7B,eAAU,GAAV,UAAU,CAAmB;IAAG,CAAC;IAE9D;;OAEG;IACH,KAAK,CAAC,sBAAsB,CAC1B,SAAiB,EACjB,GAAW,EACX,KAAc,EACd,MAAqB;QAErB,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;YAC/B,SAAS;YACT,GAAG;YACH,KAAK;YACL,IAAI;YACJ,MAAM;SACP,CAAC,CAAC;QACH,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,0BAA0B,CAC9B,SAAiB,EACjB,GAAW;QAEX,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAC9D,IAAI,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE,EAAE,CAAC;YAClC,KAAK,CAAC,YAAY,EAAE,CAAC;YACrB,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,yBAAyB,CAC7B,MAAoB,EACpB,SAAkB,EAClB,QAAgB,EAAE;QAElB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC;YACnD,MAAM;YACN,SAAS;YACT,KAAK;SACN,CAAC,CAAC;QAEH,yCAAyC;QACzC,MAAM,OAAO,CAAC,GAAG,CACf,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;YAC3B,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC5B,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC,CAAC,CACH,CAAC;QAEF,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,OAA6B;QAC7C,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,eAAe,CACnD,OAAO,CAAC,SAAS,IAAI,SAAS,EAC9B,EAAE,MAAM,EAAE,QAAQ,EAAE,CACrB,CAAC;QAEF,IAAI,MAAM,GAAwB;YAChC,SAAS,EAAE,OAAO,CAAC,MAAM;YACzB,YAAY,EAAE,CAAC;YACf,OAAO,EAAE,CAAC;YACV,UAAU,EAAE,EAAE;SACf,CAAC;QAEF,QAAQ,OAAO,CAAC,QAAQ,EAAE,CAAC;YACzB,KAAK,OAAO;gBACV,MAAM,GAAG,MAAM,IAAI,CAAC,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACvD,MAAM;YACR,KAAK,QAAQ;gBACX,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBACtE,MAAM,CAAC,OAAO,GAAG,YAAY,CAAC,iBAAiB,CAAC;gBAChD,MAAM;YACR,KAAK,OAAO;gBACV,MAAM,GAAG,MAAM,IAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;gBAC3D,MAAM;YACR,QAAQ;YACN,+BAA+B;QACnC,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,gBAAgB,CAAC,KAAc;QACrC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,+BAA+B;YAC/B,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG;gBAAE,OAAO,UAAU,CAAC;YAC1C,oCAAoC;YACpC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;gBAAE,OAAO,YAAY,CAAC;QAC1E,CAAC;QAED,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YAChD,MAAM,GAAG,GAAG,KAAgC,CAAC;YAC7C,uCAAuC;YACvC,IAAI,WAAW,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG;gBAAE,OAAO,UAAU,CAAC;YAC5E,oCAAoC;YACpC,IAAI,OAAO,IAAI,GAAG,IAAI,SAAS,IAAI,GAAG;gBAAE,OAAO,YAAY,CAAC;QAC9D,CAAC;QAED,mDAAmD;QACnD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB,CAC5B,OAAsB,EACtB,OAA6B;QAE7B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,iBAAiB;QAC3E,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC,CAAC,+BAA+B;QACzE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YAC5C,MAAM,KAAK,GAAG,GAAG,GAAG,MAAM,CAAC;YAC3B,MAAM,gBAAgB,GAAG,KAAK,CAAC,WAAW,GAAG,SAAS,CAAC;YAEvD,iCAAiC;YACjC,IAAI,OAAO,CAAC,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE;gBAAE,SAAS;YAE/C,IAAI,KAAK,IAAI,gBAAgB,EAAE,CAAC;gBAC9B,KAAK,CAAC,OAAO,EAAE,CAAC;gBAChB,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO;YACL,SAAS,EAAE,OAAO,CAAC,MAAM;YACzB,YAAY,EAAE,CAAC;YACf,OAAO,EAAE,QAAQ,CAAC,MAAM;YACxB,UAAU,EAAE,EAAE;SACf,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,mBAAmB,CAC/B,OAAsB,EACtB,OAA6B;QAE7B,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,IAAI,CAAC,CAAC,uBAAuB;QACpE,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAE3C,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,MAAM;gBAAE,SAAS;YAE5B,uBAAuB;YACvB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC;gBACnD,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,KAAK,EAAE,EAAE;gBACT,SAAS;aACV,CAAC,CAAC;YAEH,2DAA2D;YAC3D,MAAM,KAAK,GAAG,OAAO;iBAClB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,UAAU,IAAI,SAAS,CAAC;iBACnE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAE7D,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC9B,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC9B,CAAC;YAED,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1B,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAC/C,CAAC;QAED,OAAO;YACL,eAAe,EAAE,UAAU,CAAC,MAAM;YAClC,iBAAiB,EAAE,UAAU,CAAC,MAAM;YACpC,eAAe,EAAE,SAAS,CAAC,IAAI;SAChC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,oBAAoB,CAChC,OAAsB,EACtB,OAA6B;QAE7B,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,GAAG,CAAC;QAC3C,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QAEpC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,SAAS;YACtC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;gBAClB,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBACxB,SAAS;YACX,CAAC;YAED,uBAAuB;YACvB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC;gBACnD,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,KAAK,EAAE,CAAC;gBACR,SAAS;aACV,CAAC,CAAC;YAEH,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,wBAAwB;gBACxB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC9D,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAExB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;oBACxB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;oBAC1B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO;YACL,SAAS,EAAE,OAAO,CAAC,MAAM;YACzB,YAAY,EAAE,UAAU,CAAC,MAAM;YAC/B,OAAO,EAAE,QAAQ,CAAC,MAAM;YACxB,UAAU;SACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY,CAAC,OAAsB;QACzC,mDAAmD;QACnD,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;QAC1E,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAE1B,mBAAmB;QACnB,MAAM,gBAAgB,GAA4B,EAAE,CAAC;QACrD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,gBAAgB,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;QAClD,CAAC;QACD,gBAAgB,CAAC,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvD,gBAAgB,CAAC,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErD,sBAAsB;QACtB,OAAO,WAAW,CAAC,MAAM,CAAC;YACxB,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,GAAG,EAAE,UAAU,IAAI,CAAC,GAAG,EAAE,EAAE;YAC3B,KAAK,EAAE;gBACL,OAAO,EAAE,OAAO,CAAC,KAAK;gBACtB,OAAO,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;aAC7C;YACD,IAAI,EAAE,OAAO,CAAC,IAAI;YAClB,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,QAAQ,EAAE,gBAAgB;YAC1B,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;SAChE,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CAAC,SAAiB;QACtC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,SAAS,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC;QAE5D,MAAM,gBAAgB,GAA+B;YACnD,QAAQ,EAAE,CAAC;YACX,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,CAAC;YACb,OAAO,EAAE,CAAC;SACX,CAAC;QAEF,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC;QAC5B,IAAI,UAAU,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC;QAE7B,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,gBAAgB,IAAI,KAAK,CAAC,WAAW,CAAC;YACtC,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;YAEhD,IAAI,KAAK,CAAC,SAAS,GAAG,UAAU;gBAAE,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC;YAC/D,IAAI,KAAK,CAAC,SAAS,GAAG,UAAU;gBAAE,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC;QACjE,CAAC;QAED,OAAO;YACL,SAAS;YACT,YAAY,EAAE,OAAO,CAAC,MAAM;YAC5B,aAAa,EAAE,MAAM,CAAC,MAAM;YAC5B,SAAS;YACT,kBAAkB,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC9E,WAAW,EAAE,UAAU;YACvB,WAAW,EAAE,UAAU;YACvB,gBAAgB;SACjB,CAAC;IACJ,CAAC;CACF"}

package/vendor/memory/dist/entity-tagger.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Entity tagger — regex-based proper-noun / structured-token extractor.
+ *
+ * Used by the `hybridSearch` controller as a third RRF arm alongside the
+ * dense (vector) and sparse (BM25/FTS5) signals (ADR-147, upstream/swarmdo#2317).
+ *
+ * Entity matching is a distinct signal because BM25 weights documents by
+ * overall token frequency; a per-entity exact match avoids downweighting
+ * for tokens that happen to be common but mention an entity by name.
+ * Example: querying "Alice OAuth tokens" — BM25 may rank a doc about
+ * generic OAuth above one mentioning Alice specifically; entity arm
+ * surfaces the Alice doc independently.
+ *
+ * P1 is regex-only — no NLP model dependency. Tags:
+ *   - Emails: foo@bar.com
+ *   - URLs: http(s)://...
+ *   - File paths: ./foo/bar.ts, C:\foo\bar.ts, src/foo
+ *   - Quoted phrases: "..." or '...'
+ *   - Proper-noun 2-grams: "Alice Smith", "Acme Corp"
+ *
+ * Deliberately conservative — false negatives are fine (the dense + sparse
+ * arms still cover the query); false positives would dilute the RRF score
+ * by adding noise rows. A future P2 can swap this for a CRF/spaCy tagger
+ * behind the same `extractEntities(text)` contract.
+ */
+/**
+ * Extract entity-like tokens from free text. Returns a unique list,
+ * trimmed and deduplicated, in extraction order.
+ */
+export declare function extractEntities(text: string): string[];
+//# sourceMappingURL=entity-tagger.d.ts.map

package/vendor/memory/dist/entity-tagger.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-tagger.d.ts","sourceRoot":"","sources":["../src/entity-tagger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAiDtD"}

package/vendor/memory/dist/entity-tagger.js

@@ -0,0 +1,80 @@
+/**
+ * Entity tagger — regex-based proper-noun / structured-token extractor.
+ *
+ * Used by the `hybridSearch` controller as a third RRF arm alongside the
+ * dense (vector) and sparse (BM25/FTS5) signals (ADR-147, upstream/swarmdo#2317).
+ *
+ * Entity matching is a distinct signal because BM25 weights documents by
+ * overall token frequency; a per-entity exact match avoids downweighting
+ * for tokens that happen to be common but mention an entity by name.
+ * Example: querying "Alice OAuth tokens" — BM25 may rank a doc about
+ * generic OAuth above one mentioning Alice specifically; entity arm
+ * surfaces the Alice doc independently.
+ *
+ * P1 is regex-only — no NLP model dependency. Tags:
+ *   - Emails: foo@bar.com
+ *   - URLs: http(s)://...
+ *   - File paths: ./foo/bar.ts, C:\foo\bar.ts, src/foo
+ *   - Quoted phrases: "..." or '...'
+ *   - Proper-noun 2-grams: "Alice Smith", "Acme Corp"
+ *
+ * Deliberately conservative — false negatives are fine (the dense + sparse
+ * arms still cover the query); false positives would dilute the RRF score
+ * by adding noise rows. A future P2 can swap this for a CRF/spaCy tagger
+ * behind the same `extractEntities(text)` contract.
+ */
+/**
+ * Extract entity-like tokens from free text. Returns a unique list,
+ * trimmed and deduplicated, in extraction order.
+ */
+export function extractEntities(text) {
+    if (!text)
+        return [];
+    const seen = new Set();
+    const ordered = [];
+    const add = (raw) => {
+        if (!raw)
+            return;
+        const trimmed = raw.trim();
+        if (trimmed.length < 2)
+            return;
+        if (seen.has(trimmed))
+            return;
+        seen.add(trimmed);
+        ordered.push(trimmed);
+    };
+    // Emails — anchored on @ so we don't pick up arbitrary handles.
+    for (const m of text.matchAll(/[\w.+-]+@[\w-]+(?:\.[\w-]+)+/g))
+        add(m[0]);
+    // URLs — http(s) only. Stop at whitespace and common boundary chars.
+    for (const m of text.matchAll(/https?:\/\/[^\s)>"'`]+/g))
+        add(m[0]);
+    // File paths — two complementary patterns:
+    //
+    //   (a) Path with a file extension. Catches `src/foo/bar.ts`, the most
+    //       common case. The extension (`.\w{1,5}`) is what separates a
+    //       real path from prose like `and/or`.
+    //
+    //   (b) Path with an explicit leading sentinel: `./...`, `../...`, `/...`,
+    //       or `C:\...`. Catches extensionless paths the user clearly meant
+    //       (like `./scripts/build` or `/etc/hosts`).
+    for (const m of text.matchAll(/(?:[A-Za-z]:[\\/])?(?:[\w.-]+[\\/])+[\w-]+\.\w{1,5}\b/g)) {
+        add(m[0]);
+    }
+    for (const m of text.matchAll(/(?:\.{1,2}|[A-Za-z]:)[\\/][\w./\\-]+/g))
+        add(m[0]);
+    // Quoted phrases. Inner content only, both quote styles. The
+    // (?<!\w)/(?!\w) guards keep us from pairing a *closing* quote of one
+    // phrase with the *opening* quote of the next — e.g. `"a" over "b"`
+    // should NOT capture ` over ` from positions 9–16.
+    for (const m of text.matchAll(/(?<!\w)"([^"]{2,})"(?!\w)/g))
+        add(m[1]);
+    for (const m of text.matchAll(/(?<!\w)'([^']{2,})'(?!\w)/g))
+        add(m[1]);
+    // Proper-noun 2+ grams — capitalized words with capitalized neighbours.
+    // Skip single capitals (too noisy: sentence-initial common nouns).
+    for (const m of text.matchAll(/\b[A-Z][a-z]+(?:\s+[A-Z][a-z]+)+\b/g))
+        add(m[0]);
+    return ordered;
+}
+//# sourceMappingURL=entity-tagger.js.map

package/vendor/memory/dist/entity-tagger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-tagger.js","sourceRoot":"","sources":["../src/entity-tagger.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,IAAY;IAC1C,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IAErB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,MAAM,GAAG,GAAG,CAAC,GAAuB,EAAQ,EAAE;QAC5C,IAAI,CAAC,GAAG;YAAE,OAAO;QACjB,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO;QAC/B,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;YAAE,OAAO;QAC9B,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClB,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACxB,CAAC,CAAC;IAEF,gEAAgE;IAChE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,+BAA+B,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE1E,qEAAqE;IACrE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,yBAAyB,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpE,2CAA2C;IAC3C,EAAE;IACF,uEAAuE;IACvE,oEAAoE;IACpE,4CAA4C;IAC5C,EAAE;IACF,2EAA2E;IAC3E,wEAAwE;IACxE,kDAAkD;IAClD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAC3B,wDAAwD,CACzD,EAAE,CAAC;QACF,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACZ,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,uCAAuC,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAElF,6DAA6D;IAC7D,sEAAsE;IACtE,oEAAoE;IACpE,mDAAmD;IACnD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,4BAA4B,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,4BAA4B,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvE,wEAAwE;IACxE,mEAAmE;IACnE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,qCAAqC,CAAC;QAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhF,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/vendor/memory/dist/entity-tagger.test.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Tests for the regex entity tagger (ADR-147 P2, upstream/swarmdo#2317).
+ *
+ * Goal of the tagger: a conservative third signal for hybridSearch.
+ * False negatives are fine (dense + sparse cover the rest); false
+ * positives would dilute the RRF score by adding noise rows. These
+ * tests pin the conservatism — generic prose returns nothing, and
+ * concrete structured tokens (email, URL, path, quote, proper-noun
+ * bigram) round-trip cleanly.
+ */
+export {};
+//# sourceMappingURL=entity-tagger.test.d.ts.map

package/vendor/memory/dist/entity-tagger.test.d.ts.map

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

package/vendor/memory/dist/entity-tagger.test.js

@@ -0,0 +1,70 @@
+/**
+ * Tests for the regex entity tagger (ADR-147 P2, upstream/swarmdo#2317).
+ *
+ * Goal of the tagger: a conservative third signal for hybridSearch.
+ * False negatives are fine (dense + sparse cover the rest); false
+ * positives would dilute the RRF score by adding noise rows. These
+ * tests pin the conservatism — generic prose returns nothing, and
+ * concrete structured tokens (email, URL, path, quote, proper-noun
+ * bigram) round-trip cleanly.
+ */
+import { describe, it, expect } from 'vitest';
+import { extractEntities } from './entity-tagger.js';
+describe('extractEntities', () => {
+    it('returns empty for empty / nullish input', () => {
+        expect(extractEntities('')).toEqual([]);
+        expect(extractEntities(undefined)).toEqual([]);
+    });
+    it('returns empty for plain prose with no entities', () => {
+        expect(extractEntities('how do i debug this very slow query')).toEqual([]);
+    });
+    it('extracts email addresses', () => {
+        const got = extractEntities('contact alice@example.com or bob+ops@team.io');
+        expect(got).toContain('alice@example.com');
+        expect(got).toContain('bob+ops@team.io');
+    });
+    it('extracts URLs', () => {
+        const got = extractEntities('see https://example.com/path?x=1 and http://internal');
+        expect(got).toContain('https://example.com/path?x=1');
+        expect(got).toContain('http://internal');
+    });
+    it('extracts POSIX file paths', () => {
+        const got = extractEntities('open src/foo/bar.ts and ./scripts/build.mjs');
+        expect(got).toContain('src/foo/bar.ts');
+        expect(got).toContain('./scripts/build.mjs');
+    });
+    it('extracts Windows file paths', () => {
+        const got = extractEntities(String.raw `look at C:\Users\ruv\repo\file.ts`);
+        expect(got.some((e) => e.includes(String.raw `C:\Users\ruv\repo\file.ts`))).toBe(true);
+    });
+    it('does not pick up "and/or" style false positives', () => {
+        expect(extractEntities('proceed and/or stop')).not.toContain('and/or');
+    });
+    it('extracts quoted phrases (both quote styles)', () => {
+        const got = extractEntities(`open "config alpha" then 'session beta'`);
+        expect(got).toContain('config alpha');
+        expect(got).toContain('session beta');
+    });
+    it('extracts proper-noun 2-grams', () => {
+        const got = extractEntities('hand off to Alice Smith and notify Acme Corp');
+        expect(got).toContain('Alice Smith');
+        expect(got).toContain('Acme Corp');
+    });
+    it('does not extract single capitalized words (too noisy)', () => {
+        expect(extractEntities('Reset the database now')).toEqual([]);
+    });
+    it('deduplicates repeats while preserving first-seen order', () => {
+        const got = extractEntities('Alice Smith filed Alice Smith again at alice@x.io. Alice Smith.');
+        // 'Alice Smith' should appear exactly once even though the source
+        // mentions it three times.
+        expect(got.filter((e) => e === 'Alice Smith').length).toBe(1);
+        // Both entity types are present.
+        expect(got).toContain('Alice Smith');
+        expect(got).toContain('alice@x.io');
+    });
+    it('drops trimmed-to-shorter-than-2 fragments', () => {
+        // Quoted single-char phrase ("a") should be filtered by the min-length guard.
+        expect(extractEntities(`prefer "a" over "b"`)).toEqual([]);
+    });
+});
+//# sourceMappingURL=entity-tagger.test.js.map

package/vendor/memory/dist/entity-tagger.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-tagger.test.js","sourceRoot":"","sources":["../src/entity-tagger.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAErD,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,eAAe,CAAC,SAA8B,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,eAAe,CAAC,qCAAqC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,GAAG,GAAG,eAAe,CAAC,8CAA8C,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,eAAe,EAAE,GAAG,EAAE;QACvB,MAAM,GAAG,GAAG,eAAe,CAAC,sDAAsD,CAAC,CAAC;QACpF,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,8BAA8B,CAAC,CAAC;QACtD,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,iBAAiB,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,GAAG,GAAG,eAAe,CAAC,6CAA6C,CAAC,CAAC;QAC3E,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,GAAG,GAAG,eAAe,CAAC,MAAM,CAAC,GAAG,CAAA,mCAAmC,CAAC,CAAC;QAC3E,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAA,2BAA2B,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,eAAe,CAAC,qBAAqB,CAAC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,GAAG,GAAG,eAAe,CAAC,yCAAyC,CAAC,CAAC;QACvE,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,cAAc,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,eAAe,CAAC,8CAA8C,CAAC,CAAC;QAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,eAAe,CAAC,wBAAwB,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,GAAG,GAAG,eAAe,CACzB,iEAAiE,CAClE,CAAC;QACF,kEAAkE;QAClE,2BAA2B;QAC3B,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9D,iCAAiC;QACjC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,8EAA8E;QAC9E,MAAM,CAAC,eAAe,CAAC,qBAAqB,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/vendor/memory/dist/fts5.test.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Phase 5 — FTS5 keyword index (ADR-125)
+ *
+ * Verifies the FTS5 wiring on the two SQL backends:
+ * - SqlJsBackend  (sql.js — WASM, ships FTS5 since 1.10)
+ * - SQLiteBackend (better-sqlite3 — bundles FTS5 since 11.x)
+ *
+ * The SQLiteBackend test is conditional: better-sqlite3 is an optional
+ * dependency. If it isn't installable in the current env, that test is
+ * skipped.
+ */
+export {};
+//# sourceMappingURL=fts5.test.d.ts.map

package/vendor/memory/dist/fts5.test.d.ts.map

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