cognitive-core 0.0.2 → 0.1.2

package/dist/memory/playbook.js

@@ -0,0 +1,357 @@
+/**
+ * Playbook Library - Unified store for adaptive guidance
+ * Replaces StrategyBank + SkillStore with a single, evolvable abstraction
+ */
+import { createPlaybook, bumpPlaybookVersion } from '../types/index.js';
+import { JsonStore } from '../utils/storage.js';
+import { textSimilarity } from '../utils/similarity.js';
+/**
+ * Playbook Library - Store and retrieve adaptive guidance
+ */
+export class PlaybookLibrary {
+    store;
+    initialized = false;
+    constructor(baseDir) {
+        this.store = new JsonStore(baseDir, 'playbooks', {
+            autoSaveInterval: 60000,
+            pretty: true,
+        });
+    }
+    async init() {
+        if (this.initialized)
+            return;
+        await this.store.init();
+        this.initialized = true;
+    }
+    // === RETRIEVAL ===
+    /**
+     * Find playbooks matching a context
+     * Uses weighted scoring across situations, triggers, and anti-patterns
+     */
+    async findMatching(context, options) {
+        await this.init();
+        const k = options?.k ?? 5;
+        let playbooks = this.store.values();
+        // Filter by domains if specified
+        if (options?.domains && options.domains.length > 0) {
+            playbooks = playbooks.filter((p) => p.applicability.domains.some((d) => options.domains.includes(d)));
+        }
+        // Filter by minimum confidence
+        if (options?.minConfidence !== undefined) {
+            playbooks = playbooks.filter((p) => p.confidence >= options.minConfidence);
+        }
+        // Score playbooks
+        const scored = [];
+        for (const playbook of playbooks) {
+            // Check anti-patterns first (if enabled)
+            if (options?.excludeAntiPatterns !== false) {
+                const antiPatternMatch = playbook.applicability.antiPatterns.some((ap) => textSimilarity(context, ap) > 0.7);
+                if (antiPatternMatch)
+                    continue;
+            }
+            // Score against situations
+            const situationScores = playbook.applicability.situations.map((s) => textSimilarity(context, s));
+            const maxSituationScore = situationScores.length > 0 ? Math.max(...situationScores) : 0;
+            // Score against triggers (weighted higher for exact matches)
+            const triggerScores = playbook.applicability.triggers.map((t) => textSimilarity(context, t));
+            const maxTriggerScore = triggerScores.length > 0 ? Math.max(...triggerScores) * 1.2 : 0;
+            // Combine scores
+            const score = Math.max(maxSituationScore, maxTriggerScore);
+            const matchType = maxTriggerScore > maxSituationScore ? 'trigger' : 'situation';
+            if (score > 0) {
+                scored.push({ playbook, score, matchType });
+            }
+        }
+        // Sort by score and return top k
+        scored.sort((a, b) => b.score - a.score);
+        const results = scored.slice(0, k);
+        // Apply minimum score filter
+        if (options?.minScore !== undefined) {
+            return results.filter((r) => r.score >= options.minScore);
+        }
+        return results;
+    }
+    /**
+     * Find by specific trigger (for error messages, etc.)
+     */
+    async findByTrigger(trigger, threshold = 0.5) {
+        await this.init();
+        return this.store.values().filter((playbook) => playbook.applicability.triggers.some((t) => t.toLowerCase().includes(trigger.toLowerCase()) ||
+            textSimilarity(trigger, t) >= threshold));
+    }
+    /**
+     * Get playbooks with refinements for a specific context
+     */
+    async findWithRefinements(context) {
+        await this.init();
+        return this.store.values().filter((playbook) => playbook.evolution.refinements.some((r) => textSimilarity(context, r.context) > 0.6));
+    }
+    // === EVOLUTION ===
+    /**
+     * Record successful application
+     */
+    async recordSuccess(id, _trajectoryId) {
+        await this.init();
+        const playbook = this.store.get(id);
+        if (!playbook)
+            return;
+        playbook.evolution.successCount++;
+        playbook.evolution.lastUsed = new Date();
+        // Increase confidence (exponential moving average)
+        const alpha = 0.1;
+        playbook.confidence = playbook.confidence * (1 - alpha) + 1 * alpha;
+        playbook.confidence = Math.min(playbook.confidence, 0.99); // Cap at 0.99
+        playbook.updatedAt = new Date();
+        this.store.set(id, playbook);
+        await this.store.save(id);
+    }
+    /**
+     * Record failure and capture context
+     */
+    async recordFailure(id, trajectoryId, failureContext, failureMode) {
+        await this.init();
+        const playbook = this.store.get(id);
+        if (!playbook)
+            return;
+        playbook.evolution.failureCount++;
+        playbook.evolution.lastUsed = new Date();
+        // Add failure record
+        const failure = {
+            trajectoryId,
+            context: failureContext,
+            failureMode,
+            timestamp: new Date(),
+        };
+        playbook.evolution.failures.push(failure);
+        // Keep only last 10 failures
+        if (playbook.evolution.failures.length > 10) {
+            playbook.evolution.failures = playbook.evolution.failures.slice(-10);
+        }
+        // Decrease confidence
+        const alpha = 0.15; // Failures have slightly more impact
+        playbook.confidence = playbook.confidence * (1 - alpha) + 0 * alpha;
+        playbook.confidence = Math.max(playbook.confidence, 0.1); // Floor at 0.1
+        playbook.updatedAt = new Date();
+        this.store.set(id, playbook);
+        await this.store.save(id);
+    }
+    /**
+     * Add a context-specific refinement
+     */
+    async addRefinement(id, context, addition, source) {
+        await this.init();
+        const playbook = this.store.get(id);
+        if (!playbook)
+            return;
+        // Check if similar refinement exists
+        const exists = playbook.evolution.refinements.some((r) => textSimilarity(r.context, context) > 0.85);
+        if (exists)
+            return;
+        const refinement = {
+            context,
+            addition,
+            source,
+            addedAt: new Date(),
+        };
+        playbook.evolution.refinements.push(refinement);
+        // Bump patch version
+        playbook.evolution.version = bumpPlaybookVersion(playbook, 'patch');
+        playbook.updatedAt = new Date();
+        this.store.set(id, playbook);
+        await this.store.save(id);
+    }
+    /**
+     * Evolve playbook based on accumulated failures
+     * Should be called after several failures to update guidance
+     */
+    async evolve(id, newGuidance, newAntiPatterns) {
+        await this.init();
+        const playbook = this.store.get(id);
+        if (!playbook)
+            return undefined;
+        // Update guidance if provided
+        if (newGuidance) {
+            playbook.guidance = { ...playbook.guidance, ...newGuidance };
+        }
+        // Add new anti-patterns
+        if (newAntiPatterns) {
+            const unique = newAntiPatterns.filter((ap) => !playbook.applicability.antiPatterns.includes(ap));
+            playbook.applicability.antiPatterns.push(...unique);
+        }
+        // Bump minor version for evolution
+        playbook.evolution.version = bumpPlaybookVersion(playbook, 'minor');
+        playbook.updatedAt = new Date();
+        this.store.set(id, playbook);
+        await this.store.save(id);
+        return playbook;
+    }
+    // === LIFECYCLE ===
+    /**
+     * Add a new playbook
+     */
+    async add(playbook) {
+        await this.init();
+        this.store.set(playbook.id, playbook);
+        await this.store.save(playbook.id);
+    }
+    /**
+     * Create and add a new playbook
+     */
+    async create(input) {
+        const playbook = createPlaybook(input);
+        await this.add(playbook);
+        return playbook;
+    }
+    /**
+     * Get a playbook by ID
+     */
+    async get(id) {
+        await this.init();
+        return this.store.get(id);
+    }
+    /**
+     * Get playbook by name
+     */
+    async getByName(name) {
+        await this.init();
+        return this.store.values().find((p) => p.name === name);
+    }
+    /**
+     * Check if a similar playbook exists
+     */
+    async exists(description, threshold = 0.85) {
+        await this.init();
+        // Check by exact name match
+        const byName = this.store.values().find((p) => p.name === description.toLowerCase().replace(/\s+/g, '-'));
+        if (byName)
+            return byName;
+        // Check by situation similarity
+        for (const playbook of this.store.values()) {
+            for (const situation of playbook.applicability.situations) {
+                if (textSimilarity(description, situation) >= threshold) {
+                    return playbook;
+                }
+            }
+        }
+        return undefined;
+    }
+    /**
+     * Get playbooks by domain
+     */
+    async getByDomain(domain) {
+        await this.init();
+        return this.store.values().filter((p) => p.applicability.domains.includes(domain));
+    }
+    /**
+     * Get most effective playbooks (by success rate)
+     */
+    async getMostEffective(k = 10) {
+        await this.init();
+        return this.store
+            .values()
+            .filter((p) => p.evolution.successCount + p.evolution.failureCount >= 3)
+            .sort((a, b) => {
+            const rateA = a.evolution.successCount /
+                (a.evolution.successCount + a.evolution.failureCount);
+            const rateB = b.evolution.successCount /
+                (b.evolution.successCount + b.evolution.failureCount);
+            return rateB - rateA;
+        })
+            .slice(0, k);
+    }
+    /**
+     * Get playbooks by confidence threshold
+     */
+    async getHighConfidence(minConfidence = 0.8) {
+        await this.init();
+        return this.store.values().filter((p) => p.confidence >= minConfidence);
+    }
+    /**
+     * Get all playbooks
+     */
+    async getAll() {
+        await this.init();
+        return this.store.values();
+    }
+    /**
+     * Delete a playbook
+     */
+    async delete(id) {
+        await this.init();
+        const existed = this.store.has(id);
+        if (existed) {
+            this.store.delete(id);
+        }
+        return existed;
+    }
+    /**
+     * Get count
+     */
+    async count() {
+        await this.init();
+        return this.store.size();
+    }
+    /**
+     * Get all unique domains
+     */
+    async getDomains() {
+        await this.init();
+        const domains = new Set();
+        for (const playbook of this.store.values()) {
+            for (const domain of playbook.applicability.domains) {
+                domains.add(domain);
+            }
+        }
+        return Array.from(domains);
+    }
+    // === PROVENANCE ===
+    /**
+     * Get playbooks by origin type
+     */
+    async getByOrigin(origin) {
+        await this.init();
+        return this.store.values().filter((p) => p.provenance?.origin === origin);
+    }
+    /**
+     * Delete all playbooks with a specific origin
+     * Returns the number of playbooks deleted
+     */
+    async deleteByOrigin(origin) {
+        await this.init();
+        const toDelete = this.store.values().filter((p) => p.provenance?.origin === origin);
+        for (const playbook of toDelete) {
+            this.store.delete(playbook.id);
+        }
+        return toDelete.length;
+    }
+    /**
+     * Get provenance summary across all playbooks
+     */
+    async getProvenanceSummary() {
+        await this.init();
+        const summary = {
+            extracted: 0,
+            curated: 0,
+            imported: 0,
+            manual: 0,
+        };
+        for (const playbook of this.store.values()) {
+            const origin = playbook.provenance?.origin ?? 'extracted';
+            summary[origin] = (summary[origin] ?? 0) + 1;
+        }
+        return summary;
+    }
+    /**
+     * Close the store
+     */
+    async close() {
+        await this.store.close();
+    }
+}
+/**
+ * Create a playbook library
+ */
+export function createPlaybookLibrary(baseDir) {
+    return new PlaybookLibrary(baseDir);
+}
+//# sourceMappingURL=playbook.js.map

package/dist/memory/playbook.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"playbook.js","sourceRoot":"","sources":["../../src/memory/playbook.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,EAAE,cAAc,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACxE,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAsBxD;;GAEG;AACH,MAAM,OAAO,eAAe;IAClB,KAAK,CAAsB;IAC3B,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,OAAe;QACzB,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,CAAW,OAAO,EAAE,WAAW,EAAE;YACzD,gBAAgB,EAAE,KAAK;YACvB,MAAM,EAAE,IAAI;SACb,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC1B,CAAC;IAED,oBAAoB;IAEpB;;;OAGG;IACH,KAAK,CAAC,YAAY,CAChB,OAAe,EACf,OAA6B;QAE7B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAElB,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QAEpC,iCAAiC;QACjC,IAAI,OAAO,EAAE,OAAO,IAAI,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACnD,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACjC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,OAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAClE,CAAC;QACJ,CAAC;QAED,+BAA+B;QAC/B,IAAI,OAAO,EAAE,aAAa,KAAK,SAAS,EAAE,CAAC;YACzC,SAAS,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,OAAO,CAAC,aAAc,CAAC,CAAC;QAC9E,CAAC;QAED,kBAAkB;QAClB,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,yCAAyC;YACzC,IAAI,OAAO,EAAE,mBAAmB,KAAK,KAAK,EAAE,CAAC;gBAC3C,MAAM,gBAAgB,GAAG,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,IAAI,CAC/D,CAAC,EAAE,EAAE,EAAE,CAAC,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC,GAAG,GAAG,CAC1C,CAAC;gBACF,IAAI,gBAAgB;oBAAE,SAAS;YACjC,CAAC;YAED,2BAA2B;YAC3B,MAAM,eAAe,GAAG,QAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClE,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,CAC3B,CAAC;YACF,MAAM,iBAAiB,GACrB,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhE,6DAA6D;YAC7D,MAAM,aAAa,GAAG,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAC9D,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,CAC3B,CAAC;YACF,MAAM,eAAe,GACnB,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAElE,iBAAiB;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,iBAAiB,EAAE,eAAe,CAAC,CAAC;YAC3D,MAAM,SAAS,GACb,eAAe,GAAG,iBAAiB,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC;YAEhE,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,iCAAiC;QACjC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEnC,6BAA6B;QAC7B,IAAI,OAAO,EAAE,QAAQ,KAAK,SAAS,EAAE,CAAC;YACpC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,OAAO,CAAC,QAAS,CAAC,CAAC;QAC7D,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,OAAe,EAAE,SAAS,GAAG,GAAG;QAClD,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAElB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAC7C,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,CAClC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YAC/C,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,SAAS,CAC1C,CACF,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,mBAAmB,CAAC,OAAe;QACvC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAElB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,EAAE,CAC7C,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CACjC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,GAAG,CAChD,CACF,CAAC;IACJ,CAAC;IAED,oBAAoB;IAEpB;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,EAAU,EAAE,aAAqB;QACnD,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,QAAQ,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC;QAClC,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;QAEzC,mDAAmD;QACnD,MAAM,KAAK,GAAG,GAAG,CAAC;QAClB,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACpE,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,cAAc;QAEzE,QAAQ,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,EAAU,EACV,YAAoB,EACpB,cAAsB,EACtB,WAAmB;QAEnB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,QAAQ,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC;QAClC,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;QAEzC,qBAAqB;QACrB,MAAM,OAAO,GAAkB;YAC7B,YAAY;YACZ,OAAO,EAAE,cAAc;YACvB,WAAW;YACX,SAAS,EAAE,IAAI,IAAI,EAAE;SACtB,CAAC;QACF,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAE1C,6BAA6B;QAC7B,IAAI,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YAC5C,QAAQ,CAAC,SAAS,CAAC,QAAQ,GAAG,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QACvE,CAAC;QAED,sBAAsB;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,qCAAqC;QACzD,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACpE,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAC,eAAe;QAEzE,QAAQ,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,EAAU,EACV,OAAe,EACf,QAAgB,EAChB,MAAwC;QAExC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,QAAQ;YAAE,OAAO;QAEtB,qCAAqC;QACrC,MAAM,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAChD,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,IAAI,CACjD,CAAC;QACF,IAAI,MAAM;YAAE,OAAO;QAEnB,MAAM,UAAU,GAAe;YAC7B,OAAO;YACP,QAAQ;YACR,MAAM;YACN,OAAO,EAAE,IAAI,IAAI,EAAE;SACpB,CAAC;QAEF,QAAQ,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEhD,qBAAqB;QACrB,QAAQ,CAAC,SAAS,CAAC,OAAO,GAAG,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACpE,QAAQ,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAEhC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAAM,CACV,EAAU,EACV,WAA2C,EAC3C,eAA0B;QAE1B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAEhC,8BAA8B;QAC9B,IAAI,WAAW,EAAE,CAAC;YAChB,QAAQ,CAAC,QAAQ,GAAG,EAAE,GAAG,QAAQ,CAAC,QAAQ,EAAE,GAAG,WAAW,EAAE,CAAC;QAC/D,CAAC;QAED,wBAAwB;QACxB,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CACnC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC,CAC1D,CAAC;YACF,QAAQ,CAAC,aAAa,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QACtD,CAAC;QAED,mCAAmC;QACnC,QAAQ,CAAC,SAAS,CAAC,OAAO,GAAG,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACpE,QAAQ,CAAC,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAEhC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAE1B,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,oBAAoB;IAEpB;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,QAAkB;QAC1B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACtC,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,KAA2C;QAE3C,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACzB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,IAAY;QAC1B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CACV,WAAmB,EACnB,SAAS,GAAG,IAAI;QAEhB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAElB,4BAA4B;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CACrC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACjE,CAAC;QACF,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAE1B,gCAAgC;QAChC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,aAAa,CAAC,UAAU,EAAE,CAAC;gBAC1D,IAAI,cAAc,CAAC,WAAW,EAAE,SAAS,CAAC,IAAI,SAAS,EAAE,CAAC;oBACxD,OAAO,QAAQ,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,MAAc;QAC9B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACtC,CAAC,CAAC,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CACzC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CAAC,CAAC,GAAG,EAAE;QAC3B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK;aACd,MAAM,EAAE;aACR,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,SAAS,CAAC,YAAY,IAAI,CAAC,CAAC;aACvE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACb,MAAM,KAAK,GACT,CAAC,CAAC,SAAS,CAAC,YAAY;gBACxB,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YACxD,MAAM,KAAK,GACT,CAAC,CAAC,SAAS,CAAC,YAAY;gBACxB,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,GAAG,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YACxD,OAAO,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,iBAAiB,CAAC,aAAa,GAAG,GAAG;QACzC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,aAAa,CAAC,CAAC;IAC1E,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM;QACV,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACnC,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,aAAa,CAAC,OAAO,EAAE,CAAC;gBACpD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,qBAAqB;IAErB;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,MAAsB;QACtC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,KAAK,MAAM,CAAC,CAAC;IAC5E,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,cAAc,CAAC,MAAsB;QACzC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,MAAM,KAAK,MAAM,CAAC,CAAC;QACpF,KAAK,MAAM,QAAQ,IAAI,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,QAAQ,CAAC,MAAM,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB;QACxB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,OAAO,GAA2B;YACtC,SAAS,EAAE,CAAC;YACZ,OAAO,EAAE,CAAC;YACV,QAAQ,EAAE,CAAC;YACX,MAAM,EAAE,CAAC;SACV,CAAC;QACF,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,EAAE,MAAM,IAAI,WAAW,CAAC;YAC1D,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,OAAyC,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,OAAe;IACnD,OAAO,IAAI,eAAe,CAAC,OAAO,CAAC,CAAC;AACtC,CAAC"}

package/dist/memory/search-provider.d.ts

@@ -0,0 +1,31 @@
+import type { KnowledgeNote } from '../types/knowledge.js';
+/**
+ * Result from a SearchProvider — maps a note ID to a relevance score.
+ */
+export interface SearchProviderResult {
+    noteId: string;
+    score: number;
+}
+/**
+ * Strategy interface for searching knowledge notes.
+ *
+ * Implementations receive pre-filtered candidate notes and return
+ * scored results. This allows swapping between text-based similarity
+ * (default) and external search backends (e.g., minimem).
+ */
+export interface SearchProvider {
+    /** Human-readable name for diagnostics / logging. */
+    readonly name: string;
+    /**
+     * Search pre-filtered candidates and return scored results.
+     *
+     * @param query      - The search query string.
+     * @param candidates - Pre-filtered KnowledgeNote array (already domain/stale-filtered).
+     * @param options    - Additional options like maxResults.
+     * @returns Scored results sorted by descending score.
+     */
+    search(query: string, candidates: KnowledgeNote[], options?: {
+        maxResults?: number;
+    }): SearchProviderResult[] | Promise<SearchProviderResult[]>;
+}
+//# sourceMappingURL=search-provider.d.ts.map

package/dist/memory/search-provider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-provider.d.ts","sourceRoot":"","sources":["../../src/memory/search-provider.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B,qDAAqD;IACrD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAEtB;;;;;;;OAOG;IACH,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,aAAa,EAAE,EAC3B,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GAChC,oBAAoB,EAAE,GAAG,OAAO,CAAC,oBAAoB,EAAE,CAAC,CAAC;CAC7D"}

package/dist/memory/search-provider.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=search-provider.js.map

package/dist/memory/search-provider.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-provider.js","sourceRoot":"","sources":["../../src/memory/search-provider.ts"],"names":[],"mappings":""}

package/dist/memory/search-providers/index.d.ts

@@ -0,0 +1,3 @@
+export { TextSimilaritySearchProvider } from './text-similarity.js';
+export { MinimemSearchProvider, type MinimemSearchClient } from './minimem.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/memory/search-providers/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/memory/search-providers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,4BAA4B,EAAE,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,qBAAqB,EAAE,KAAK,mBAAmB,EAAE,MAAM,cAAc,CAAC"}

package/dist/memory/search-providers/index.js

@@ -0,0 +1,3 @@
+export { TextSimilaritySearchProvider } from './text-similarity.js';
+export { MinimemSearchProvider } from './minimem.js';
+//# sourceMappingURL=index.js.map

package/dist/memory/search-providers/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/memory/search-providers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,4BAA4B,EAAE,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,qBAAqB,EAA4B,MAAM,cAAc,CAAC"}

package/dist/memory/search-providers/minimem.d.ts

@@ -0,0 +1,43 @@
+import type { KnowledgeNote } from '../../types/knowledge.js';
+import type { SearchProvider, SearchProviderResult } from '../search-provider.js';
+/**
+ * Subset of the minimem search API that MinimemSearchProvider depends on.
+ * Structurally compatible with the Minimem class from the minimem package.
+ *
+ * Kept as a narrow interface (rather than importing Minimem directly) so
+ * tests can inject a lightweight mock without instantiating a full Minimem.
+ */
+export interface MinimemSearchClient {
+    search(query: string, options?: {
+        maxResults?: number;
+        minScore?: number;
+    }): Promise<Array<{
+        path: string;
+        startLine: number;
+        endLine: number;
+        score: number;
+        snippet: string;
+    }>>;
+}
+/**
+ * Search provider that delegates to a minimem instance.
+ *
+ * Maps minimem search results (which return file paths) back to
+ * KnowledgeNote IDs by matching against the candidate set.
+ *
+ * Falls back to returning an empty array on any error so that
+ * the KnowledgeBank can gracefully degrade.
+ */
+export declare class MinimemSearchProvider implements SearchProvider {
+    private readonly client;
+    readonly name = "minimem";
+    constructor(client: MinimemSearchClient);
+    /**
+     * Async search via minimem client.
+     * Maps minimem results back to note IDs from the candidate set.
+     */
+    search(query: string, candidates: KnowledgeNote[], options?: {
+        maxResults?: number;
+    }): Promise<SearchProviderResult[]>;
+}
+//# sourceMappingURL=minimem.d.ts.map

package/dist/memory/search-providers/minimem.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimem.d.ts","sourceRoot":"","sources":["../../../src/memory/search-providers/minimem.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAElF;;;;;;GAMG;AACH,MAAM,WAAW,mBAAmB;IAClC,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAClF,KAAK,CAAC;QACJ,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC,CACH,CAAC;CACH;AAED;;;;;;;;GAQG;AACH,qBAAa,qBAAsB,YAAW,cAAc;IAG9C,OAAO,CAAC,QAAQ,CAAC,MAAM;IAFnC,QAAQ,CAAC,IAAI,aAAa;gBAEG,MAAM,EAAE,mBAAmB;IAExD;;;OAGG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,aAAa,EAAE,EAC3B,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GAChC,OAAO,CAAC,oBAAoB,EAAE,CAAC;CAuCnC"}

package/dist/memory/search-providers/minimem.js

@@ -0,0 +1,56 @@
+/**
+ * Search provider that delegates to a minimem instance.
+ *
+ * Maps minimem search results (which return file paths) back to
+ * KnowledgeNote IDs by matching against the candidate set.
+ *
+ * Falls back to returning an empty array on any error so that
+ * the KnowledgeBank can gracefully degrade.
+ */
+export class MinimemSearchProvider {
+    client;
+    name = 'minimem';
+    constructor(client) {
+        this.client = client;
+    }
+    /**
+     * Async search via minimem client.
+     * Maps minimem results back to note IDs from the candidate set.
+     */
+    async search(query, candidates, options) {
+        try {
+            const maxResults = options?.maxResults ?? 10;
+            const minimemResults = await this.client.search(query, { maxResults });
+            // Build a lookup: normalize paths to match against candidate filePaths
+            const noteByPath = new Map();
+            for (const note of candidates) {
+                // Match on the full filePath or just the filename
+                noteByPath.set(note.filePath, note);
+                const filename = note.filePath.split('/').pop();
+                if (filename) {
+                    noteByPath.set(filename, note);
+                }
+            }
+            const results = [];
+            for (const mr of minimemResults) {
+                // Try matching by full path, then by filename portion
+                const pathParts = mr.path.split('/');
+                const filename = pathParts.pop();
+                const note = noteByPath.get(mr.path) ||
+                    (filename ? noteByPath.get(filename) : undefined);
+                if (note) {
+                    results.push({
+                        noteId: note.frontmatter.id,
+                        score: mr.score,
+                    });
+                }
+            }
+            return results;
+        }
+        catch {
+            // Gracefully degrade: return empty on any error
+            return [];
+        }
+    }
+}
+//# sourceMappingURL=minimem.js.map

package/dist/memory/search-providers/minimem.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minimem.js","sourceRoot":"","sources":["../../../src/memory/search-providers/minimem.ts"],"names":[],"mappings":"AAsBA;;;;;;;;GAQG;AACH,MAAM,OAAO,qBAAqB;IAGH;IAFpB,IAAI,GAAG,SAAS,CAAC;IAE1B,YAA6B,MAA2B;QAA3B,WAAM,GAAN,MAAM,CAAqB;IAAG,CAAC;IAE5D;;;OAGG;IACH,KAAK,CAAC,MAAM,CACV,KAAa,EACb,UAA2B,EAC3B,OAAiC;QAEjC,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,EAAE,CAAC;YAC7C,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,CAAC,CAAC;YAEvE,uEAAuE;YACvE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyB,CAAC;YACpD,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;gBAC9B,kDAAkD;gBAClD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC;gBAChD,IAAI,QAAQ,EAAE,CAAC;oBACb,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,MAAM,OAAO,GAA2B,EAAE,CAAC;YAC3C,KAAK,MAAM,EAAE,IAAI,cAAc,EAAE,CAAC;gBAChC,sDAAsD;gBACtD,MAAM,SAAS,GAAG,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACrC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;gBACjC,MAAM,IAAI,GACR,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;oBACvB,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAEpD,IAAI,IAAI,EAAE,CAAC;oBACT,OAAO,CAAC,IAAI,CAAC;wBACX,MAAM,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE;wBAC3B,KAAK,EAAE,EAAE,CAAC,KAAK;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,OAAO,OAAO,CAAC;QACjB,CAAC;QAAC,MAAM,CAAC;YACP,gDAAgD;YAChD,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;CACF"}

package/dist/memory/search-providers/text-similarity.d.ts

@@ -0,0 +1,15 @@
+import type { KnowledgeNote } from '../../types/knowledge.js';
+import type { SearchProvider, SearchProviderResult } from '../search-provider.js';
+/**
+ * Default search provider using Jaccard + n-gram text similarity.
+ *
+ * This is the original search logic extracted from KnowledgeBank.search().
+ * Scores each candidate note against the query using `findTopK()`.
+ */
+export declare class TextSimilaritySearchProvider implements SearchProvider {
+    readonly name = "text-similarity";
+    search(query: string, candidates: KnowledgeNote[], options?: {
+        maxResults?: number;
+    }): SearchProviderResult[];
+}
+//# sourceMappingURL=text-similarity.d.ts.map

package/dist/memory/search-providers/text-similarity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-similarity.d.ts","sourceRoot":"","sources":["../../../src/memory/search-providers/text-similarity.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,oBAAoB,EAAE,MAAM,uBAAuB,CAAC;AAGlF;;;;;GAKG;AACH,qBAAa,4BAA6B,YAAW,cAAc;IACjE,QAAQ,CAAC,IAAI,qBAAqB;IAElC,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,aAAa,EAAE,EAC3B,OAAO,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GAChC,oBAAoB,EAAE;CAiB1B"}

package/dist/memory/search-providers/text-similarity.js

@@ -0,0 +1,21 @@
+import { findTopK } from '../../utils/similarity.js';
+/**
+ * Default search provider using Jaccard + n-gram text similarity.
+ *
+ * This is the original search logic extracted from KnowledgeBank.search().
+ * Scores each candidate note against the query using `findTopK()`.
+ */
+export class TextSimilaritySearchProvider {
+    name = 'text-similarity';
+    search(query, candidates, options) {
+        const maxResults = options?.maxResults ?? 10;
+        const results = findTopK(query, candidates, (note) => `${note.frontmatter.id} ${note.body}`, maxResults);
+        return results
+            .filter((r) => r.score > 0)
+            .map((r) => ({
+            noteId: r.item.frontmatter.id,
+            score: r.score,
+        }));
+    }
+}
+//# sourceMappingURL=text-similarity.js.map

package/dist/memory/search-providers/text-similarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"text-similarity.js","sourceRoot":"","sources":["../../../src/memory/search-providers/text-similarity.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,2BAA2B,CAAC;AAErD;;;;;GAKG;AACH,MAAM,OAAO,4BAA4B;IAC9B,IAAI,GAAG,iBAAiB,CAAC;IAElC,MAAM,CACJ,KAAa,EACb,UAA2B,EAC3B,OAAiC;QAEjC,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,EAAE,CAAC;QAE7C,MAAM,OAAO,GAAG,QAAQ,CACtB,KAAK,EACL,UAAU,EACV,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,EAAE,EAC/C,UAAU,CACX,CAAC;QAEF,OAAO,OAAO;aACX,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;aAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACX,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE;YAC7B,KAAK,EAAE,CAAC,CAAC,KAAK;SACf,CAAC,CAAC,CAAC;IACR,CAAC;CACF"}