cognitive-core 0.1.0 → 0.2.0

package/dist/memory/reasoning-bank.d.ts

@@ -0,0 +1,130 @@
+/**
+ * ReasoningBank — Pre-clusters successful experiences for faster, more
+ * interpretable retrieval.
+ *
+ * Uses K-means++ on tokenized task descriptions (bag-of-words similarity).
+ * No embedding dependency — works with textSimilarity only.
+ *
+ * Clustering algorithm:
+ * 1. Initialize k centroids using K-means++ (farthest-point initialization)
+ * 2. Assign experiences to nearest centroid by textSimilarity
+ * 3. Recompute centroids (experience with highest avg similarity to members)
+ * 4. Repeat until convergence or maxIterations
+ * 5. Label clusters by top-3 most frequent non-stop tokens
+ */
+import type { Experience } from '../types/index.js';
+import type { SqlitePersistence } from '../persistence/index.js';
+/**
+ * A cluster of similar experiences
+ */
+export interface ExperienceCluster {
+    id: string;
+    /** Auto-generated label from common tokens */
+    label: string;
+    /** Representative taskInput (closest to cluster mean) */
+    centroid: string;
+    /** IDs of experiences in this cluster */
+    experienceIds: string[];
+    /** Aggregate success rate */
+    successRate: number;
+    /** Average access score (from Phase 0) */
+    avgAccessScore: number;
+    /** Domains represented */
+    domains: string[];
+}
+/**
+ * Cluster statistics
+ */
+export interface ClusterStats {
+    clusterId: string;
+    label: string;
+    successRate: number;
+    size: number;
+}
+/**
+ * Configuration for ReasoningBank
+ */
+export interface ReasoningBankConfig {
+    /** Maximum number of clusters (default: 20) */
+    maxClusters?: number;
+    /** Minimum experiences per cluster (default: 3) */
+    minClusterSize?: number;
+    /** Re-cluster after this many new experiences (default: 50) */
+    reclusterInterval?: number;
+    /** Max K-means iterations (default: 10) */
+    maxIterations?: number;
+}
+/**
+ * ReasoningBank — clustered experience retrieval
+ */
+export declare class ReasoningBank {
+    private clusters;
+    private experienceIndex;
+    private experiencesSinceLastCluster;
+    private config;
+    private persistence?;
+    constructor(config?: ReasoningBankConfig, persistence?: SqlitePersistence);
+    /**
+     * Build clusters from a set of experiences.
+     * Filters to successful experiences only.
+     */
+    buildClusters(experiences: Experience[]): void;
+    /**
+     * Find the nearest cluster for a query, then search within it.
+     */
+    findInCluster(query: string, options?: {
+        k?: number;
+        domain?: string;
+    }): Array<{
+        experience: Experience;
+        score: number;
+        clusterId: string;
+    }>;
+    /**
+     * Get all clusters.
+     */
+    getClusters(): ExperienceCluster[];
+    /**
+     * Get cluster-level statistics.
+     */
+    getClusterStats(): ClusterStats[];
+    /**
+     * Check whether re-clustering should be triggered.
+     */
+    shouldRecluster(): boolean;
+    /**
+     * Load persisted clusters. Call after persistence is initialized.
+     */
+    loadPersistedState(): void;
+    /**
+     * Notify that a new experience was added (for recluster tracking).
+     */
+    notifyNewExperience(): void;
+    /**
+     * Get the number of clusters.
+     */
+    get clusterCount(): number;
+    /**
+     * K-means++ clustering on experience taskInputs using textSimilarity.
+     * Returns a map of clusterId → memberIds.
+     */
+    private kMeansPlusPlus;
+    /**
+     * K-means++ initialization: select centroids using farthest-point heuristic.
+     */
+    private initCentroids;
+    /**
+     * Find the centroid of a cluster: the experience with highest average
+     * similarity to all other members.
+     */
+    private findCentroid;
+    /**
+     * Generate a cluster label from the top-3 most frequent non-stop tokens.
+     */
+    private generateLabel;
+}
+/**
+ * Create a ReasoningBank instance
+ */
+export declare function createReasoningBank(config?: ReasoningBankConfig, persistence?: SqlitePersistence): ReasoningBank;
+//# sourceMappingURL=reasoning-bank.d.ts.map

package/dist/memory/reasoning-bank.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reasoning-bank.d.ts","sourceRoot":"","sources":["../../src/memory/reasoning-bank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAGjE;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,8CAA8C;IAC9C,KAAK,EAAE,MAAM,CAAC;IACd,yDAAyD;IACzD,QAAQ,EAAE,MAAM,CAAC;IACjB,yCAAyC;IACzC,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,6BAA6B;IAC7B,WAAW,EAAE,MAAM,CAAC;IACpB,0CAA0C;IAC1C,cAAc,EAAE,MAAM,CAAC;IACvB,0BAA0B;IAC1B,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,+CAA+C;IAC/C,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,mDAAmD;IACnD,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,+DAA+D;IAC/D,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,2CAA2C;IAC3C,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAiBD;;GAEG;AACH,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAA6C;IAC7D,OAAO,CAAC,eAAe,CAAsC;IAC7D,OAAO,CAAC,2BAA2B,CAAK;IACxC,OAAO,CAAC,MAAM,CAAgC;IAC9C,OAAO,CAAC,WAAW,CAAC,CAAoB;gBAE5B,MAAM,CAAC,EAAE,mBAAmB,EAAE,WAAW,CAAC,EAAE,iBAAiB;IAsBzE;;;OAGG;IACH,aAAa,CAAC,WAAW,EAAE,UAAU,EAAE,GAAG,IAAI;IA+D9C;;OAEG;IACH,aAAa,CACX,KAAK,EAAE,MAAM,EACb,OAAO,CAAC,EAAE;QAAE,CAAC,CAAC,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,GACxC,KAAK,CAAC;QAAE,UAAU,EAAE,UAAU,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IAqCtE;;OAEG;IACH,WAAW,IAAI,iBAAiB,EAAE;IAIlC;;OAEG;IACH,eAAe,IAAI,YAAY,EAAE;IASjC;;OAEG;IACH,eAAe,IAAI,OAAO;IAI1B;;OAEG;IACH,kBAAkB,IAAI,IAAI;IAa1B;;OAEG;IACH,mBAAmB,IAAI,IAAI;IAI3B;;OAEG;IACH,IAAI,YAAY,IAAI,MAAM,CAEzB;IAID;;;OAGG;IACH,OAAO,CAAC,cAAc;IA2EtB;;OAEG;IACH,OAAO,CAAC,aAAa;IAuCrB;;;OAGG;IACH,OAAO,CAAC,YAAY;IAsBpB;;OAEG;IACH,OAAO,CAAC,aAAa;CAoBtB;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,CAAC,EAAE,mBAAmB,EAC5B,WAAW,CAAC,EAAE,iBAAiB,GAC9B,aAAa,CAEf"}

package/dist/memory/reasoning-bank.js

@@ -0,0 +1,342 @@
+/**
+ * ReasoningBank — Pre-clusters successful experiences for faster, more
+ * interpretable retrieval.
+ *
+ * Uses K-means++ on tokenized task descriptions (bag-of-words similarity).
+ * No embedding dependency — works with textSimilarity only.
+ *
+ * Clustering algorithm:
+ * 1. Initialize k centroids using K-means++ (farthest-point initialization)
+ * 2. Assign experiences to nearest centroid by textSimilarity
+ * 3. Recompute centroids (experience with highest avg similarity to members)
+ * 4. Repeat until convergence or maxIterations
+ * 5. Label clusters by top-3 most frequent non-stop tokens
+ */
+import { textSimilarity, tokenize } from '../utils/similarity.js';
+// Stop words to exclude from cluster labels
+const STOP_WORDS = new Set([
+    'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'been', 'being',
+    'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'could',
+    'should', 'may', 'might', 'shall', 'can', 'need', 'dare', 'ought',
+    'and', 'but', 'or', 'nor', 'not', 'so', 'yet', 'both', 'either',
+    'neither', 'each', 'every', 'all', 'any', 'few', 'more', 'most',
+    'in', 'on', 'at', 'by', 'for', 'with', 'about', 'against', 'between',
+    'to', 'from', 'up', 'down', 'out', 'off', 'of', 'into', 'through',
+    'this', 'that', 'these', 'those', 'it', 'its', 'i', 'we', 'you', 'he',
+    'she', 'they', 'me', 'us', 'him', 'her', 'them', 'my', 'our', 'your',
+    'what', 'which', 'who', 'whom', 'when', 'where', 'why', 'how',
+    'if', 'then', 'else', 'than', 'as', 'no', 'yes',
+]);
+/**
+ * ReasoningBank — clustered experience retrieval
+ */
+export class ReasoningBank {
+    clusters = new Map();
+    experienceIndex = new Map();
+    experiencesSinceLastCluster = 0;
+    config;
+    persistence;
+    constructor(config, persistence) {
+        this.config = {
+            maxClusters: config?.maxClusters ?? 20,
+            minClusterSize: config?.minClusterSize ?? 3,
+            reclusterInterval: config?.reclusterInterval ?? 50,
+            maxIterations: config?.maxIterations ?? 10,
+        };
+        this.persistence = persistence;
+        // Load persisted clusters if available
+        if (persistence?.isInitialized) {
+            const saved = persistence.getSystemState('reasoning_bank');
+            if (saved) {
+                this.clusters = new Map(saved.clusters);
+                this.experiencesSinceLastCluster = saved.experiencesSinceLastCluster;
+            }
+        }
+    }
+    /**
+     * Build clusters from a set of experiences.
+     * Filters to successful experiences only.
+     */
+    buildClusters(experiences) {
+        this.experienceIndex.clear();
+        for (const exp of experiences) {
+            this.experienceIndex.set(exp.id, exp);
+        }
+        // Only cluster successful experiences
+        const successful = experiences.filter((e) => e.success);
+        if (successful.length < this.config.minClusterSize) {
+            this.clusters.clear();
+            return;
+        }
+        // Determine k: at most maxClusters, but scale with data size
+        const k = Math.min(this.config.maxClusters, Math.max(2, Math.floor(successful.length / this.config.minClusterSize)));
+        // Run K-means++
+        const assignments = this.kMeansPlusPlus(successful, k);
+        // Build cluster objects
+        this.clusters.clear();
+        for (const [clusterId, memberIds] of assignments.entries()) {
+            if (memberIds.length < this.config.minClusterSize)
+                continue;
+            const members = memberIds
+                .map((id) => this.experienceIndex.get(id))
+                .filter((e) => e !== undefined);
+            if (members.length === 0)
+                continue;
+            const centroid = this.findCentroid(members);
+            const label = this.generateLabel(members);
+            const domains = [...new Set(members.map((e) => e.domain))];
+            const successCount = members.filter((e) => e.success).length;
+            const avgAccessScore = members.reduce((sum, e) => sum + (e.accessScore ?? 0), 0) /
+                members.length;
+            this.clusters.set(clusterId, {
+                id: clusterId,
+                label,
+                centroid: centroid.taskInput,
+                experienceIds: members.map((e) => e.id),
+                successRate: members.length > 0 ? successCount / members.length : 0,
+                avgAccessScore,
+                domains,
+            });
+        }
+        this.experiencesSinceLastCluster = 0;
+        // Persist clusters
+        if (this.persistence) {
+            this.persistence.setSystemState('reasoning_bank', {
+                clusters: [...this.clusters.entries()],
+                experiencesSinceLastCluster: this.experiencesSinceLastCluster,
+            });
+        }
+    }
+    /**
+     * Find the nearest cluster for a query, then search within it.
+     */
+    findInCluster(query, options) {
+        const k = options?.k ?? 5;
+        if (this.clusters.size === 0)
+            return [];
+        // Find the best-matching cluster by centroid similarity
+        let bestCluster;
+        let bestClusterScore = -1;
+        for (const cluster of this.clusters.values()) {
+            // Filter by domain if specified
+            if (options?.domain && !cluster.domains.includes(options.domain))
+                continue;
+            const score = textSimilarity(query, cluster.centroid);
+            if (score > bestClusterScore) {
+                bestClusterScore = score;
+                bestCluster = cluster;
+            }
+        }
+        if (!bestCluster)
+            return [];
+        // Search within the cluster
+        const results = [];
+        for (const expId of bestCluster.experienceIds) {
+            const exp = this.experienceIndex.get(expId);
+            if (!exp)
+                continue;
+            if (options?.domain && exp.domain !== options.domain)
+                continue;
+            const score = textSimilarity(query, exp.taskInput);
+            results.push({ experience: exp, score, clusterId: bestCluster.id });
+        }
+        results.sort((a, b) => b.score - a.score);
+        return results.slice(0, k);
+    }
+    /**
+     * Get all clusters.
+     */
+    getClusters() {
+        return [...this.clusters.values()];
+    }
+    /**
+     * Get cluster-level statistics.
+     */
+    getClusterStats() {
+        return [...this.clusters.values()].map((c) => ({
+            clusterId: c.id,
+            label: c.label,
+            successRate: c.successRate,
+            size: c.experienceIds.length,
+        }));
+    }
+    /**
+     * Check whether re-clustering should be triggered.
+     */
+    shouldRecluster() {
+        return this.experiencesSinceLastCluster >= this.config.reclusterInterval;
+    }
+    /**
+     * Load persisted clusters. Call after persistence is initialized.
+     */
+    loadPersistedState() {
+        if (this.persistence?.isInitialized) {
+            const saved = this.persistence.getSystemState('reasoning_bank');
+            if (saved) {
+                this.clusters = new Map(saved.clusters);
+                this.experiencesSinceLastCluster = saved.experiencesSinceLastCluster;
+            }
+        }
+    }
+    /**
+     * Notify that a new experience was added (for recluster tracking).
+     */
+    notifyNewExperience() {
+        this.experiencesSinceLastCluster++;
+    }
+    /**
+     * Get the number of clusters.
+     */
+    get clusterCount() {
+        return this.clusters.size;
+    }
+    // === K-Means++ Implementation ===
+    /**
+     * K-means++ clustering on experience taskInputs using textSimilarity.
+     * Returns a map of clusterId → memberIds.
+     */
+    kMeansPlusPlus(experiences, k) {
+        if (experiences.length <= k) {
+            // Not enough data for clustering — each is its own cluster
+            const result = new Map();
+            for (let i = 0; i < experiences.length; i++) {
+                result.set(`cluster-${i}`, [experiences[i].id]);
+            }
+            return result;
+        }
+        // Step 1: Initialize centroids with K-means++ (farthest-point)
+        const centroidIndices = this.initCentroids(experiences, k);
+        let centroids = centroidIndices.map((i) => experiences[i]);
+        // Step 2-4: Iterative assignment and recomputation
+        let assignments = new Map();
+        for (let iter = 0; iter < this.config.maxIterations; iter++) {
+            // Assign each experience to nearest centroid
+            assignments = new Map();
+            for (let c = 0; c < centroids.length; c++) {
+                assignments.set(c, []);
+            }
+            for (const exp of experiences) {
+                let bestCentroid = 0;
+                let bestSim = -1;
+                for (let c = 0; c < centroids.length; c++) {
+                    const sim = textSimilarity(exp.taskInput, centroids[c].taskInput);
+                    if (sim > bestSim) {
+                        bestSim = sim;
+                        bestCentroid = c;
+                    }
+                }
+                assignments.get(bestCentroid).push(exp);
+            }
+            // Recompute centroids
+            const newCentroids = [];
+            let changed = false;
+            for (let c = 0; c < centroids.length; c++) {
+                const members = assignments.get(c) ?? [];
+                if (members.length === 0) {
+                    newCentroids.push(centroids[c]);
+                    continue;
+                }
+                const newCentroid = this.findCentroid(members);
+                if (newCentroid.id !== centroids[c].id) {
+                    changed = true;
+                }
+                newCentroids.push(newCentroid);
+            }
+            centroids = newCentroids;
+            // Converged
+            if (!changed)
+                break;
+        }
+        // Build result map
+        const result = new Map();
+        for (const [centroidIdx, members] of assignments.entries()) {
+            result.set(`cluster-${centroidIdx}`, members.map((e) => e.id));
+        }
+        return result;
+    }
+    /**
+     * K-means++ initialization: select centroids using farthest-point heuristic.
+     */
+    initCentroids(experiences, k) {
+        const indices = [];
+        // Pick first centroid randomly
+        indices.push(Math.floor(Math.random() * experiences.length));
+        for (let c = 1; c < k; c++) {
+            // For each remaining point, compute distance to nearest centroid
+            let maxDist = -1;
+            let bestIdx = 0;
+            for (let i = 0; i < experiences.length; i++) {
+                if (indices.includes(i))
+                    continue;
+                let minSimToCentroid = Infinity;
+                for (const ci of indices) {
+                    const sim = textSimilarity(experiences[i].taskInput, experiences[ci].taskInput);
+                    if (sim < minSimToCentroid) {
+                        minSimToCentroid = sim;
+                    }
+                }
+                // Distance = 1 - similarity (farthest point)
+                const dist = 1 - minSimToCentroid;
+                if (dist > maxDist) {
+                    maxDist = dist;
+                    bestIdx = i;
+                }
+            }
+            indices.push(bestIdx);
+        }
+        return indices;
+    }
+    /**
+     * Find the centroid of a cluster: the experience with highest average
+     * similarity to all other members.
+     */
+    findCentroid(members) {
+        if (members.length === 1)
+            return members[0];
+        let bestExp = members[0];
+        let bestAvgSim = -1;
+        for (const candidate of members) {
+            let totalSim = 0;
+            for (const other of members) {
+                if (other.id === candidate.id)
+                    continue;
+                totalSim += textSimilarity(candidate.taskInput, other.taskInput);
+            }
+            const avgSim = totalSim / (members.length - 1);
+            if (avgSim > bestAvgSim) {
+                bestAvgSim = avgSim;
+                bestExp = candidate;
+            }
+        }
+        return bestExp;
+    }
+    /**
+     * Generate a cluster label from the top-3 most frequent non-stop tokens.
+     */
+    generateLabel(members) {
+        const tokenCounts = new Map();
+        for (const exp of members) {
+            const tokens = tokenize(exp.taskInput);
+            for (const token of tokens) {
+                if (STOP_WORDS.has(token))
+                    continue;
+                if (token.length < 3)
+                    continue;
+                tokenCounts.set(token, (tokenCounts.get(token) ?? 0) + 1);
+            }
+        }
+        // Sort by frequency descending
+        const sorted = [...tokenCounts.entries()]
+            .sort((a, b) => b[1] - a[1])
+            .slice(0, 3)
+            .map(([token]) => token);
+        return sorted.length > 0 ? sorted.join('-') : 'unlabeled';
+    }
+}
+/**
+ * Create a ReasoningBank instance
+ */
+export function createReasoningBank(config, persistence) {
+    return new ReasoningBank(config, persistence);
+}
+//# sourceMappingURL=reasoning-bank.js.map

package/dist/memory/reasoning-bank.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reasoning-bank.js","sourceRoot":"","sources":["../../src/memory/reasoning-bank.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AA6ClE,4CAA4C;AAC5C,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IACjE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ;IAC/D,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IAC/D,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS;IACpE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS;IACjE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI;IACrE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM;IACpE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK;IAC7D,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;CAChD,CAAC,CAAC;AAEH;;GAEG;AACH,MAAM,OAAO,aAAa;IAChB,QAAQ,GAAmC,IAAI,GAAG,EAAE,CAAC;IACrD,eAAe,GAA4B,IAAI,GAAG,EAAE,CAAC;IACrD,2BAA2B,GAAG,CAAC,CAAC;IAChC,MAAM,CAAgC;IACtC,WAAW,CAAqB;IAExC,YAAY,MAA4B,EAAE,WAA+B;QACvE,IAAI,CAAC,MAAM,GAAG;YACZ,WAAW,EAAE,MAAM,EAAE,WAAW,IAAI,EAAE;YACtC,cAAc,EAAE,MAAM,EAAE,cAAc,IAAI,CAAC;YAC3C,iBAAiB,EAAE,MAAM,EAAE,iBAAiB,IAAI,EAAE;YAClD,aAAa,EAAE,MAAM,EAAE,aAAa,IAAI,EAAE;SAC3C,CAAC;QACF,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAE/B,uCAAuC;QACvC,IAAI,WAAW,EAAE,aAAa,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,WAAW,CAAC,cAAc,CAGrC,gBAAgB,CAAC,CAAC;YACrB,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACxC,IAAI,CAAC,2BAA2B,GAAG,KAAK,CAAC,2BAA2B,CAAC;YACvE,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,WAAyB;QACrC,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;YAC9B,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACxC,CAAC;QAED,sCAAsC;QACtC,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QACxD,IAAI,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YACnD,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;YACtB,OAAO;QACT,CAAC;QAED,6DAA6D;QAC7D,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAChB,IAAI,CAAC,MAAM,CAAC,WAAW,EACvB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CACxE,CAAC;QAEF,gBAAgB;QAChB,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;QAEvD,wBAAwB;QACxB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YAC3D,IAAI,SAAS,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc;gBAAE,SAAS;YAE5D,MAAM,OAAO,GAAG,SAAS;iBACtB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;iBACzC,MAAM,CAAC,CAAC,CAAC,EAAmB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;YAEnD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAEnC,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC1C,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3D,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;YAC7D,MAAM,cAAc,GAClB,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;gBACzD,OAAO,CAAC,MAAM,CAAC;YAEjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,EAAE;gBAC3B,EAAE,EAAE,SAAS;gBACb,KAAK;gBACL,QAAQ,EAAE,QAAQ,CAAC,SAAS;gBAC5B,aAAa,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvC,WAAW,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACnE,cAAc;gBACd,OAAO;aACR,CAAC,CAAC;QACL,CAAC;QAED,IAAI,CAAC,2BAA2B,GAAG,CAAC,CAAC;QAErC,mBAAmB;QACnB,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,gBAAgB,EAAE;gBAChD,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC;gBACtC,2BAA2B,EAAE,IAAI,CAAC,2BAA2B;aAC9D,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;OAEG;IACH,aAAa,CACX,KAAa,EACb,OAAyC;QAEzC,MAAM,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC;QAE1B,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAExC,wDAAwD;QACxD,IAAI,WAA0C,CAAC;QAC/C,IAAI,gBAAgB,GAAG,CAAC,CAAC,CAAC;QAE1B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,gCAAgC;YAChC,IAAI,OAAO,EAAE,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC;gBAAE,SAAS;YAE3E,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;YACtD,IAAI,KAAK,GAAG,gBAAgB,EAAE,CAAC;gBAC7B,gBAAgB,GAAG,KAAK,CAAC;gBACzB,WAAW,GAAG,OAAO,CAAC;YACxB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,WAAW;YAAE,OAAO,EAAE,CAAC;QAE5B,4BAA4B;QAC5B,MAAM,OAAO,GAAwE,EAAE,CAAC;QACxF,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,aAAa,EAAE,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,CAAC,GAAG;gBAAE,SAAS;YACnB,IAAI,OAAO,EAAE,MAAM,IAAI,GAAG,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;gBAAE,SAAS;YAE/D,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,OAAO,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,WAAW,CAAC,EAAE,EAAE,CAAC,CAAC;QACtE,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7C,SAAS,EAAE,CAAC,CAAC,EAAE;YACf,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,MAAM;SAC7B,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,eAAe;QACb,OAAO,IAAI,CAAC,2BAA2B,IAAI,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;IAC3E,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,IAAI,IAAI,CAAC,WAAW,EAAE,aAAa,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,CAG1C,gBAAgB,CAAC,CAAC;YACrB,IAAI,KAAK,EAAE,CAAC;gBACV,IAAI,CAAC,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBACxC,IAAI,CAAC,2BAA2B,GAAG,KAAK,CAAC,2BAA2B,CAAC;YACvE,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,mBAAmB;QACjB,IAAI,CAAC,2BAA2B,EAAE,CAAC;IACrC,CAAC;IAED;;OAEG;IACH,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED,mCAAmC;IAEnC;;;OAGG;IACK,cAAc,CACpB,WAAyB,EACzB,CAAS;QAET,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC5B,2DAA2D;YAC3D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;YAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,CAAC;YACD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,+DAA+D;QAC/D,MAAM,eAAe,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QAC3D,IAAI,SAAS,GAAG,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3D,mDAAmD;QACnD,IAAI,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;QAElD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;YAC5D,6CAA6C;YAC7C,WAAW,GAAG,IAAI,GAAG,EAAwB,CAAC;YAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACzB,CAAC;YAED,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;gBAC9B,IAAI,YAAY,GAAG,CAAC,CAAC;gBACrB,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;gBAEjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,MAAM,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAClE,IAAI,GAAG,GAAG,OAAO,EAAE,CAAC;wBAClB,OAAO,GAAG,GAAG,CAAC;wBACd,YAAY,GAAG,CAAC,CAAC;oBACnB,CAAC;gBACH,CAAC;gBAED,WAAW,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3C,CAAC;YAED,sBAAsB;YACtB,MAAM,YAAY,GAAiB,EAAE,CAAC;YACtC,IAAI,OAAO,GAAG,KAAK,CAAC;YAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACzB,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChC,SAAS;gBACX,CAAC;gBAED,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBAC/C,IAAI,WAAW,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;oBACvC,OAAO,GAAG,IAAI,CAAC;gBACjB,CAAC;gBACD,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,CAAC;YAED,SAAS,GAAG,YAAY,CAAC;YAEzB,YAAY;YACZ,IAAI,CAAC,OAAO;gBAAE,MAAM;QACtB,CAAC;QAED,mBAAmB;QACnB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,KAAK,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;YAC3D,MAAM,CAAC,GAAG,CAAC,WAAW,WAAW,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,WAAyB,EAAE,CAAS;QACxD,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,+BAA+B;QAC/B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;QAE7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,iEAAiE;YACjE,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;YACjB,IAAI,OAAO,GAAG,CAAC,CAAC;YAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAElC,IAAI,gBAAgB,GAAG,QAAQ,CAAC;gBAChC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;oBACzB,MAAM,GAAG,GAAG,cAAc,CACxB,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,EACxB,WAAW,CAAC,EAAE,CAAC,CAAC,SAAS,CAC1B,CAAC;oBACF,IAAI,GAAG,GAAG,gBAAgB,EAAE,CAAC;wBAC3B,gBAAgB,GAAG,GAAG,CAAC;oBACzB,CAAC;gBACH,CAAC;gBAED,6CAA6C;gBAC7C,MAAM,IAAI,GAAG,CAAC,GAAG,gBAAgB,CAAC;gBAClC,IAAI,IAAI,GAAG,OAAO,EAAE,CAAC;oBACnB,OAAO,GAAG,IAAI,CAAC;oBACf,OAAO,GAAG,CAAC,CAAC;gBACd,CAAC;YACH,CAAC;YAED,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACxB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACK,YAAY,CAAC,OAAqB;QACxC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;QAE5C,IAAI,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,UAAU,GAAG,CAAC,CAAC,CAAC;QAEpB,KAAK,MAAM,SAAS,IAAI,OAAO,EAAE,CAAC;YAChC,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,IAAI,KAAK,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;oBAAE,SAAS;gBACxC,QAAQ,IAAI,cAAc,CAAC,SAAS,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YACnE,CAAC;YACD,MAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,MAAM,GAAG,UAAU,EAAE,CAAC;gBACxB,UAAU,GAAG,MAAM,CAAC;gBACpB,OAAO,GAAG,SAAS,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,OAAqB;QACzC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE9C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAS;gBACpC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;oBAAE,SAAS;gBAC/B,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,MAAM,MAAM,GAAG,CAAC,GAAG,WAAW,CAAC,OAAO,EAAE,CAAC;aACtC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;QAE3B,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;IAC5D,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAA4B,EAC5B,WAA+B;IAE/B,OAAO,IAAI,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;AAChD,CAAC"}

package/dist/memory/reflexion.d.ts

@@ -0,0 +1,59 @@
+/**
+ * ReflexionMemory — Store and retrieve reflexion episodes.
+ *
+ * Each episode captures structured self-reflection on a completed trajectory:
+ * critique, key insights, strategy assessment, and suggested playbook updates.
+ *
+ * Backed by SqlitePersistence for unified database storage.
+ */
+import type { ReflexionEpisode } from '../types/index.js';
+import type { SqlitePersistence } from '../persistence/index.js';
+/**
+ * Options for querying recent reflexion episodes
+ */
+export interface ReflexionQueryOptions {
+    /** Maximum number of episodes to return (default: 10) */
+    k?: number;
+    /** Filter by domain */
+    domain?: string;
+    /** Filter by outcome */
+    outcome?: 'success' | 'partial' | 'failure';
+}
+/**
+ * ReflexionMemory — persistent store for reflexion episodes
+ */
+export declare class ReflexionMemory {
+    private persistence;
+    private initialized;
+    constructor(persistence: SqlitePersistence);
+    init(): Promise<void>;
+    /**
+     * Store a reflexion episode
+     */
+    add(episode: ReflexionEpisode): Promise<void>;
+    /**
+     * Get the reflexion episode for a specific trajectory
+     */
+    getByTrajectory(trajectoryId: string): Promise<ReflexionEpisode | undefined>;
+    /**
+     * Get a reflexion episode by ID
+     */
+    get(id: string): Promise<ReflexionEpisode | undefined>;
+    /**
+     * Get recent reflexion episodes, optionally filtered
+     */
+    getRecent(options?: ReflexionQueryOptions): Promise<ReflexionEpisode[]>;
+    /**
+     * Get the total number of stored episodes
+     */
+    count(): Promise<number>;
+    /**
+     * Close the store (no-op — SqlitePersistence lifecycle is managed externally)
+     */
+    close(): Promise<void>;
+}
+/**
+ * Create a ReflexionMemory instance
+ */
+export declare function createReflexionMemory(persistence: SqlitePersistence): ReflexionMemory;
+//# sourceMappingURL=reflexion.d.ts.map

package/dist/memory/reflexion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reflexion.d.ts","sourceRoot":"","sources":["../../src/memory/reflexion.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,mBAAmB,CAAC;AAC1D,OAAO,KAAK,EAAE,iBAAiB,EAAgB,MAAM,yBAAyB,CAAC;AAG/E;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACpC,yDAAyD;IACzD,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,uBAAuB;IACvB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,wBAAwB;IACxB,OAAO,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;CAC7C;AAoBD;;GAEG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,WAAW,CAAS;gBAEhB,WAAW,EAAE,iBAAiB;IAIpC,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAK3B;;OAEG;IACG,GAAG,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAAC,IAAI,CAAC;IAKnD;;OAEG;IACG,eAAe,CAAC,YAAY,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,GAAG,SAAS,CAAC;IAMlF;;OAEG;IACG,GAAG,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,gBAAgB,GAAG,SAAS,CAAC;IAM5D;;OAEG;IACG,SAAS,CAAC,OAAO,CAAC,EAAE,qBAAqB,GAAG,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAY7E;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;IAK9B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAG7B;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,iBAAiB,GAAG,eAAe,CAErF"}

package/dist/memory/reflexion.js

@@ -0,0 +1,96 @@
+/**
+ * ReflexionMemory — Store and retrieve reflexion episodes.
+ *
+ * Each episode captures structured self-reflection on a completed trajectory:
+ * critique, key insights, strategy assessment, and suggested playbook updates.
+ *
+ * Backed by SqlitePersistence for unified database storage.
+ */
+import { fromJSON, fromISO } from '../persistence/index.js';
+/**
+ * Convert a ReflexionRow to a ReflexionEpisode.
+ */
+function rowToReflexion(row) {
+    return {
+        id: row.id,
+        trajectoryId: row.trajectory_id,
+        taskSummary: row.task_summary,
+        outcome: row.outcome,
+        selfCritique: row.self_critique,
+        keyInsights: fromJSON(row.key_insights, []),
+        strategyAssessment: row.strategy_assessment,
+        suggestedPlaybookUpdates: fromJSON(row.suggested_playbook_updates, []),
+        domain: row.domain,
+        createdAt: fromISO(row.created_at) ?? new Date(),
+    };
+}
+/**
+ * ReflexionMemory — persistent store for reflexion episodes
+ */
+export class ReflexionMemory {
+    persistence;
+    initialized = false;
+    constructor(persistence) {
+        this.persistence = persistence;
+    }
+    async init() {
+        if (this.initialized)
+            return;
+        this.initialized = true;
+    }
+    /**
+     * Store a reflexion episode
+     */
+    async add(episode) {
+        await this.init();
+        this.persistence.insertReflexionEpisode(episode);
+    }
+    /**
+     * Get the reflexion episode for a specific trajectory
+     */
+    async getByTrajectory(trajectoryId) {
+        await this.init();
+        const rows = this.persistence.getReflexionByTrajectory(trajectoryId);
+        return rows.length > 0 ? rowToReflexion(rows[0]) : undefined;
+    }
+    /**
+     * Get a reflexion episode by ID
+     */
+    async get(id) {
+        await this.init();
+        const row = this.persistence.getReflexionEpisode(id);
+        return row ? rowToReflexion(row) : undefined;
+    }
+    /**
+     * Get recent reflexion episodes, optionally filtered
+     */
+    async getRecent(options) {
+        await this.init();
+        const rows = this.persistence.getReflexionEpisodes({
+            domain: options?.domain,
+            outcome: options?.outcome,
+            limit: options?.k ?? 10,
+        });
+        return rows.map(rowToReflexion);
+    }
+    /**
+     * Get the total number of stored episodes
+     */
+    async count() {
+        await this.init();
+        return this.persistence.getReflexionEpisodes().length;
+    }
+    /**
+     * Close the store (no-op — SqlitePersistence lifecycle is managed externally)
+     */
+    async close() {
+        // SqlitePersistence lifecycle is managed by MemorySystem/Atlas
+    }
+}
+/**
+ * Create a ReflexionMemory instance
+ */
+export function createReflexionMemory(persistence) {
+    return new ReflexionMemory(persistence);
+}
+//# sourceMappingURL=reflexion.js.map

package/dist/memory/reflexion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reflexion.js","sourceRoot":"","sources":["../../src/memory/reflexion.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,yBAAyB,CAAC;AAc5D;;GAEG;AACH,SAAS,cAAc,CAAC,GAAiB;IACvC,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,YAAY,EAAE,GAAG,CAAC,aAAa;QAC/B,WAAW,EAAE,GAAG,CAAC,YAAY;QAC7B,OAAO,EAAE,GAAG,CAAC,OAA4C;QACzD,YAAY,EAAE,GAAG,CAAC,aAAa;QAC/B,WAAW,EAAE,QAAQ,CAAC,GAAG,CAAC,YAAY,EAAE,EAAE,CAAC;QAC3C,kBAAkB,EAAE,GAAG,CAAC,mBAAmB;QAC3C,wBAAwB,EAAE,QAAQ,CAAC,GAAG,CAAC,0BAA0B,EAAE,EAAE,CAAC;QACtE,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,IAAI,IAAI,EAAE;KACjD,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,OAAO,eAAe;IAClB,WAAW,CAAoB;IAC/B,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,WAA8B;QACxC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,OAAyB;QACjC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,IAAI,CAAC,WAAW,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CAAC,YAAoB;QACxC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,wBAAwB,CAAC,YAAY,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/D,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,EAAU;QAClB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QACrD,OAAO,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC/C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,OAA+B;QAC7C,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAElB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,oBAAoB,CAAC;YACjD,MAAM,EAAE,OAAO,EAAE,MAAM;YACvB,OAAO,EAAE,OAAO,EAAE,OAAO;YACzB,KAAK,EAAE,OAAO,EAAE,CAAC,IAAI,EAAE;SACxB,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,WAAW,CAAC,oBAAoB,EAAE,CAAC,MAAM,CAAC;IACxD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,+DAA+D;IACjE,CAAC;CACF;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,WAA8B;IAClE,OAAO,IAAI,eAAe,CAAC,WAAW,CAAC,CAAC;AAC1C,CAAC"}