@framers/agentos 0.1.125 → 0.1.127

package/dist/memory/tools/MemoryMergeTool.d.ts

@@ -1,95 +0,0 @@
-/**
- * @fileoverview MemoryMergeTool — lets an agent merge multiple memory traces
- * into a single, consolidated trace.
- *
- * The merge process:
- * 1. Load all specified traces from the database.
- * 2. Select the survivor — the trace with the highest `retrieval_count`
- *    (most-frequently accessed, i.e. most valuable). Ties broken by taking
- *    the first trace in the provided `traceIds` array.
- * 3. Determine merged content — use `mergedContent` if the agent supplied it,
- *    otherwise concatenate all trace contents with ` | ` as separator.
- * 4. Update the survivor's content, clear its embedding (stale after merge),
- *    and union the tags from all merged traces (deduplicated).
- * 5. Soft-delete all non-survivor traces.
- *
- * @module memory/tools/MemoryMergeTool
- */
-import type { ITool, ToolExecutionResult, ToolExecutionContext, JSONSchemaObject } from '../../core/tools/ITool.js';
-import type { SqliteBrain } from '../store/SqliteBrain.js';
-/**
- * Input arguments for {@link MemoryMergeTool}.
- *
- * @property traceIds      - Array of trace IDs to merge. Must contain at least 2 IDs.
- * @property mergedContent - Optional pre-composed merged content. If omitted, the
- *                           contents of all traces are concatenated with ` | `.
- */
-export interface MemoryMergeInput extends Record<string, any> {
-    traceIds: string[];
-    mergedContent?: string;
-}
-/**
- * Output returned by {@link MemoryMergeTool} on success.
- *
- * @property survivorId  - The ID of the trace that survived the merge.
- * @property deletedIds  - IDs of all traces that were soft-deleted.
- */
-export interface MemoryMergeOutput {
-    survivorId: string;
-    deletedIds: string[];
-}
-/**
- * ITool implementation that merges multiple memory traces into one.
- *
- * **Usage:**
- * ```ts
- * const tool = new MemoryMergeTool(brain);
- * const result = await tool.execute(
- *   {
- *     traceIds: ['mt_1_0', 'mt_2_0', 'mt_3_0'],
- *     mergedContent: 'Consolidated insight from three related observations.',
- *   },
- *   context,
- * );
- * // result.output → { survivorId: 'mt_1_0', deletedIds: ['mt_2_0', 'mt_3_0'] }
- * ```
- */
-export declare class MemoryMergeTool implements ITool<MemoryMergeInput, MemoryMergeOutput> {
-    private readonly brain;
-    /** Globally unique tool identifier. */
-    readonly id = "memory-merge-v1";
-    /** LLM-facing tool name. */
-    readonly name = "memory_merge";
-    /** Human-readable display name. */
-    readonly displayName = "Merge Memories";
-    /** LLM-facing description. */
-    readonly description: string;
-    /** Logical category for discovery and grouping. */
-    readonly category = "memory";
-    /** This tool writes to the database. */
-    readonly hasSideEffects = true;
-    /** JSON schema for input validation and LLM tool-call construction. */
-    readonly inputSchema: JSONSchemaObject;
-    /**
-     * @param brain - The agent's shared SQLite brain database connection.
-     */
-    constructor(brain: SqliteBrain);
-    /**
-     * Merge the specified traces into one survivor.
-     *
-     * Steps:
-     * 1. Validate that at least 2 trace IDs were supplied.
-     * 2. Load all matching, non-deleted traces from the database.
-     * 3. Pick survivor by highest `retrieval_count`; fallback to first found.
-     * 4. Compute merged content (provided or concatenated).
-     * 5. Union all tags, deduplicate.
-     * 6. Update survivor: new content, cleared embedding, unioned tags.
-     * 7. Soft-delete all non-survivor traces.
-     *
-     * @param args     - Merge input (traceIds, optional mergedContent).
-     * @param _context - Tool execution context (not used by this tool).
-     * @returns `{ survivorId, deletedIds }` on success, or an error result.
-     */
-    execute(args: MemoryMergeInput, _context: ToolExecutionContext): Promise<ToolExecutionResult<MemoryMergeOutput>>;
-}
-//# sourceMappingURL=MemoryMergeTool.d.ts.map

package/dist/memory/tools/MemoryMergeTool.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MemoryMergeTool.d.ts","sourceRoot":"","sources":["../../../src/memory/tools/MemoryMergeTool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AACpH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AA4B3D;;;;;;GAMG;AACH,MAAM,WAAW,gBAAiB,SAAQ,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC;IAC3D,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;;;GAKG;AACH,MAAM,WAAW,iBAAiB;IAChC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAMD;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,eAAgB,YAAW,KAAK,CAAC,gBAAgB,EAAE,iBAAiB,CAAC;IA4CpE,OAAO,CAAC,QAAQ,CAAC,KAAK;IA3ClC,uCAAuC;IACvC,QAAQ,CAAC,EAAE,qBAAqB;IAEhC,4BAA4B;IAC5B,QAAQ,CAAC,IAAI,kBAAkB;IAE/B,mCAAmC;IACnC,QAAQ,CAAC,WAAW,oBAAoB;IAExC,8BAA8B;IAC9B,QAAQ,CAAC,WAAW,SAGsE;IAE1F,mDAAmD;IACnD,QAAQ,CAAC,QAAQ,YAAY;IAE7B,wCAAwC;IACxC,QAAQ,CAAC,cAAc,QAAQ;IAE/B,uEAAuE;IACvE,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CAgBpC;IAEF;;OAEG;gBAC0B,KAAK,EAAE,WAAW;IAM/C;;;;;;;;;;;;;;;OAeG;IACG,OAAO,CACX,IAAI,EAAE,gBAAgB,EACtB,QAAQ,EAAE,oBAAoB,GAC7B,OAAO,CAAC,mBAAmB,CAAC,iBAAiB,CAAC,CAAC;CA0HnD"}

package/dist/memory/tools/MemoryMergeTool.js

@@ -1,183 +0,0 @@
-/**
- * @fileoverview MemoryMergeTool — lets an agent merge multiple memory traces
- * into a single, consolidated trace.
- *
- * The merge process:
- * 1. Load all specified traces from the database.
- * 2. Select the survivor — the trace with the highest `retrieval_count`
- *    (most-frequently accessed, i.e. most valuable). Ties broken by taking
- *    the first trace in the provided `traceIds` array.
- * 3. Determine merged content — use `mergedContent` if the agent supplied it,
- *    otherwise concatenate all trace contents with ` | ` as separator.
- * 4. Update the survivor's content, clear its embedding (stale after merge),
- *    and union the tags from all merged traces (deduplicated).
- * 5. Soft-delete all non-survivor traces.
- *
- * @module memory/tools/MemoryMergeTool
- */
-import { parseTraceMetadata, readPersistedDecayState, sha256Hex, withPersistedDecayState, } from '../store/tracePersistence.js';
-// ---------------------------------------------------------------------------
-// MemoryMergeTool
-// ---------------------------------------------------------------------------
-/**
- * ITool implementation that merges multiple memory traces into one.
- *
- * **Usage:**
- * ```ts
- * const tool = new MemoryMergeTool(brain);
- * const result = await tool.execute(
- *   {
- *     traceIds: ['mt_1_0', 'mt_2_0', 'mt_3_0'],
- *     mergedContent: 'Consolidated insight from three related observations.',
- *   },
- *   context,
- * );
- * // result.output → { survivorId: 'mt_1_0', deletedIds: ['mt_2_0', 'mt_3_0'] }
- * ```
- */
-export class MemoryMergeTool {
-    /**
-     * @param brain - The agent's shared SQLite brain database connection.
-     */
-    constructor(brain) {
-        this.brain = brain;
-        /** Globally unique tool identifier. */
-        this.id = 'memory-merge-v1';
-        /** LLM-facing tool name. */
-        this.name = 'memory_merge';
-        /** Human-readable display name. */
-        this.displayName = 'Merge Memories';
-        /** LLM-facing description. */
-        this.description = 'Merge two or more memory traces into a single consolidated trace. ' +
-            'The trace with the highest retrieval count survives; others are soft-deleted. ' +
-            'Optionally provide pre-composed merged content; otherwise, contents are concatenated.';
-        /** Logical category for discovery and grouping. */
-        this.category = 'memory';
-        /** This tool writes to the database. */
-        this.hasSideEffects = true;
-        /** JSON schema for input validation and LLM tool-call construction. */
-        this.inputSchema = {
-            type: 'object',
-            properties: {
-                traceIds: {
-                    type: 'array',
-                    items: { type: 'string' },
-                    minItems: 2,
-                    description: 'Array of trace IDs to merge. Must contain at least 2 IDs.',
-                },
-                mergedContent: {
-                    type: 'string',
-                    description: 'Optional pre-composed merged content. If omitted, trace contents are joined with " | ".',
-                },
-            },
-            required: ['traceIds'],
-        };
-    }
-    // ---------------------------------------------------------------------------
-    // execute
-    // ---------------------------------------------------------------------------
-    /**
-     * Merge the specified traces into one survivor.
-     *
-     * Steps:
-     * 1. Validate that at least 2 trace IDs were supplied.
-     * 2. Load all matching, non-deleted traces from the database.
-     * 3. Pick survivor by highest `retrieval_count`; fallback to first found.
-     * 4. Compute merged content (provided or concatenated).
-     * 5. Union all tags, deduplicate.
-     * 6. Update survivor: new content, cleared embedding, unioned tags.
-     * 7. Soft-delete all non-survivor traces.
-     *
-     * @param args     - Merge input (traceIds, optional mergedContent).
-     * @param _context - Tool execution context (not used by this tool).
-     * @returns `{ survivorId, deletedIds }` on success, or an error result.
-     */
-    async execute(args, _context) {
-        try {
-            const { traceIds, mergedContent } = args;
-            if (!traceIds || traceIds.length < 2) {
-                return {
-                    success: false,
-                    error: 'traceIds must contain at least 2 trace IDs.',
-                };
-            }
-            // Load all matching active traces.
-            const placeholders = traceIds.map(() => '?').join(', ');
-            const rows = await this.brain.all(`SELECT rowid AS rowid, id, content, retrieval_count, tags, metadata, last_accessed, created_at
-         FROM memory_traces
-         WHERE id IN (${placeholders}) AND deleted = 0`, traceIds);
-            if (rows.length < 2) {
-                return {
-                    success: false,
-                    error: `Found only ${rows.length} active trace(s) for the provided IDs. Need at least 2.`,
-                };
-            }
-            // Pick survivor — trace with highest retrieval_count.
-            // Stable sort: keeps original order for equal counts so the first traceId wins.
-            const sorted = [...rows].sort((a, b) => b.retrieval_count - a.retrieval_count);
-            const survivor = sorted[0];
-            // Determine merged content.
-            const finalContent = mergedContent !== undefined && mergedContent.trim().length > 0
-                ? mergedContent
-                : rows.map((r) => r.content).join(' | ');
-            // Union tags from all traces (deduplicated).
-            const allTags = new Set();
-            for (const row of rows) {
-                try {
-                    const parsed = JSON.parse(row.tags);
-                    for (const tag of parsed)
-                        allTags.add(tag);
-                }
-                catch {
-                    // Malformed JSON tag — skip gracefully.
-                }
-            }
-            const finalTags = JSON.stringify([...allTags]);
-            const survivorMetadata = parseTraceMetadata(survivor.metadata);
-            survivorMetadata.content_hash = sha256Hex(finalContent);
-            delete survivorMetadata.import_hash;
-            const mergedDecay = rows.map((row) => readPersistedDecayState(parseTraceMetadata(row.metadata), row.retrieval_count));
-            const mergedMetadata = JSON.stringify(withPersistedDecayState(survivorMetadata, {
-                stability: Math.max(...mergedDecay.map((state) => state.stability)),
-                accessCount: mergedDecay.reduce((sum, state) => sum + state.accessCount, 0),
-                reinforcementInterval: Math.max(...mergedDecay.map((state) => state.reinforcementInterval)),
-                ...(mergedDecay.some((state) => state.nextReinforcementAt !== undefined)
-                    ? {
-                        nextReinforcementAt: Math.max(...mergedDecay.map((state) => state.nextReinforcementAt ?? 0)),
-                    }
-                    : {}),
-            }));
-            const mergedRetrievalCount = rows.reduce((sum, row) => sum + row.retrieval_count, 0);
-            const mergedLastAccessed = Math.max(...rows.map((row) => row.last_accessed ?? row.created_at));
-            // Update survivor: new content, cleared embedding, unioned tags.
-            const deletedIds = [];
-            await this.brain.transaction(async (trx) => {
-                await trx.run(`INSERT INTO memory_traces_fts (memory_traces_fts, rowid, content, tags)
-           VALUES ('delete', ?, ?, ?)`, [survivor.rowid, survivor.content, survivor.tags]);
-                await trx.run(`UPDATE memory_traces
-           SET content = ?, embedding = NULL, tags = ?, metadata = ?, retrieval_count = ?, last_accessed = ?
-           WHERE id = ?`, [finalContent, finalTags, mergedMetadata, mergedRetrievalCount, mergedLastAccessed, survivor.id]);
-                await trx.run(`INSERT INTO memory_traces_fts (rowid, content, tags)
-           VALUES (?, ?, ?)`, [survivor.rowid, finalContent, finalTags]);
-                // Soft-delete all non-survivors.
-                for (const row of rows) {
-                    if (row.id !== survivor.id) {
-                        await trx.run(`UPDATE memory_traces SET deleted = 1 WHERE id = ?`, [row.id]);
-                        deletedIds.push(row.id);
-                    }
-                }
-            });
-            return {
-                success: true,
-                output: { survivorId: survivor.id, deletedIds },
-            };
-        }
-        catch (err) {
-            return {
-                success: false,
-                error: err instanceof Error ? err.message : String(err),
-            };
-        }
-    }
-}
-//# sourceMappingURL=MemoryMergeTool.js.map

package/dist/memory/tools/MemoryMergeTool.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"MemoryMergeTool.js","sourceRoot":"","sources":["../../../src/memory/tools/MemoryMergeTool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAIH,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,SAAS,EACT,uBAAuB,GACxB,MAAM,8BAA8B,CAAC;AA6CtC,8EAA8E;AAC9E,kBAAkB;AAClB,8EAA8E;AAE9E;;;;;;;;;;;;;;;GAeG;AACH,MAAM,OAAO,eAAe;IAyC1B;;OAEG;IACH,YAA6B,KAAkB;QAAlB,UAAK,GAAL,KAAK,CAAa;QA3C/C,uCAAuC;QAC9B,OAAE,GAAG,iBAAiB,CAAC;QAEhC,4BAA4B;QACnB,SAAI,GAAG,cAAc,CAAC;QAE/B,mCAAmC;QAC1B,gBAAW,GAAG,gBAAgB,CAAC;QAExC,8BAA8B;QACrB,gBAAW,GAClB,oEAAoE;YACpE,gFAAgF;YAChF,uFAAuF,CAAC;QAE1F,mDAAmD;QAC1C,aAAQ,GAAG,QAAQ,CAAC;QAE7B,wCAAwC;QAC/B,mBAAc,GAAG,IAAI,CAAC;QAE/B,uEAAuE;QAC9D,gBAAW,GAAqB;YACvC,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,QAAQ,EAAE;oBACR,IAAI,EAAE,OAAO;oBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;oBACzB,QAAQ,EAAE,CAAC;oBACX,WAAW,EAAE,2DAA2D;iBACzE;gBACD,aAAa,EAAE;oBACb,IAAI,EAAE,QAAQ;oBACd,WAAW,EACT,yFAAyF;iBAC5F;aACF;YACD,QAAQ,EAAE,CAAC,UAAU,CAAC;SACvB,CAAC;IAKgD,CAAC;IAEnD,8EAA8E;IAC9E,UAAU;IACV,8EAA8E;IAE9E;;;;;;;;;;;;;;;OAeG;IACH,KAAK,CAAC,OAAO,CACX,IAAsB,EACtB,QAA8B;QAE9B,IAAI,CAAC;YACH,MAAM,EAAE,QAAQ,EAAE,aAAa,EAAE,GAAG,IAAI,CAAC;YAEzC,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrC,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,6CAA6C;iBACrD,CAAC;YACJ,CAAC;YAED,mCAAmC;YACnC,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAC/B;;wBAEgB,YAAY,mBAAmB,EAC/C,QAAQ,CACT,CAAC;YAEF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,OAAO;oBACL,OAAO,EAAE,KAAK;oBACd,KAAK,EAAE,cAAc,IAAI,CAAC,MAAM,yDAAyD;iBAC1F,CAAC;YACJ,CAAC;YAED,sDAAsD;YACtD,gFAAgF;YAChF,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC;YAC/E,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YAE5B,4BAA4B;YAC5B,MAAM,YAAY,GAChB,aAAa,KAAK,SAAS,IAAI,aAAa,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC;gBAC5D,CAAC,CAAC,aAAa;gBACf,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAE7C,6CAA6C;YAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;YAClC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAa,CAAC;oBAChD,KAAK,MAAM,GAAG,IAAI,MAAM;wBAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC7C,CAAC;gBAAC,MAAM,CAAC;oBACP,wCAAwC;gBAC1C,CAAC;YACH,CAAC;YACD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;YAC/C,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC/D,gBAAgB,CAAC,YAAY,GAAG,SAAS,CAAC,YAAY,CAAC,CAAC;YACxD,OAAO,gBAAgB,CAAC,WAAW,CAAC;YAEpC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CACnC,uBAAuB,CAAC,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,eAAe,CAAC,CAC/E,CAAC;YACF,MAAM,cAAc,GAAG,IAAI,CAAC,SAAS,CACnC,uBAAuB,CAAC,gBAAgB,EAAE;gBACxC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;gBACnE,WAAW,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;gBAC3E,qBAAqB,EAAE,IAAI,CAAC,GAAG,CAC7B,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAC3D;gBACD,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,mBAAmB,KAAK,SAAS,CAAC;oBACtE,CAAC,CAAC;wBACE,mBAAmB,EAAE,IAAI,CAAC,GAAG,CAC3B,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,mBAAmB,IAAI,CAAC,CAAC,CAC9D;qBACF;oBACH,CAAC,CAAC,EAAE,CAAC;aACR,CAAC,CACH,CAAC;YACF,MAAM,oBAAoB,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;YACrF,MAAM,kBAAkB,GAAG,IAAI,CAAC,GAAG,CACjC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,aAAa,IAAI,GAAG,CAAC,UAAU,CAAC,CAC1D,CAAC;YAEF,iEAAiE;YACjE,MAAM,UAAU,GAAa,EAAE,CAAC;YAEhC,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;gBACzC,MAAM,GAAG,CAAC,GAAG,CACX;sCAC4B,EAC5B,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,CAAC,CAClD,CAAC;gBAEF,MAAM,GAAG,CAAC,GAAG,CACX;;wBAEc,EACd,CAAC,YAAY,EAAE,SAAS,EAAE,cAAc,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,QAAQ,CAAC,EAAE,CAAC,CACjG,CAAC;gBAEF,MAAM,GAAG,CAAC,GAAG,CACX;4BACkB,EAClB,CAAC,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,SAAS,CAAC,CAC1C,CAAC;gBAEF,iCAAiC;gBACjC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;oBACvB,IAAI,GAAG,CAAC,EAAE,KAAK,QAAQ,CAAC,EAAE,EAAE,CAAC;wBAC3B,MAAM,GAAG,CAAC,GAAG,CACX,mDAAmD,EACnD,CAAC,GAAG,CAAC,EAAE,CAAC,CACT,CAAC;wBACF,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC1B,CAAC;gBACH,CAAC;YACH,CAAC,CAAC,CAAC;YACH,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,MAAM,EAAE,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,EAAE,UAAU,EAAE;aAChD,CAAC;QACJ,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;aACxD,CAAC;QACJ,CAAC;IACH,CAAC;CACF"}

package/dist/memory/tools/MemoryReflectTool.d.ts

@@ -1,86 +0,0 @@
-/**
- * @fileoverview MemoryReflectTool — lets an agent trigger offline memory
- * consolidation on demand.
- *
- * Consolidation is the analogue of slow-wave-sleep memory processing:
- * - **Prune** — soft-delete traces whose Ebbinghaus strength has decayed below threshold.
- * - **Merge** — deduplicate near-identical traces (embedding similarity or hash).
- * - **Strengthen** — record Hebbian co-activation edges from retrieval feedback.
- * - **Derive** — synthesise higher-level insight traces from memory clusters (LLM-backed).
- * - **Compact** — promote old, high-retrieval episodic traces to semantic type.
- * - **Re-index** — rebuild FTS5 index and log the run to `consolidation_log`.
- *
- * The optional `topic` argument is accepted at the contract level but is not
- * yet threaded into the ConsolidationLoop (which currently runs globally).
- * It is reserved for a future topic-scoped consolidation mode.
- *
- * @module memory/tools/MemoryReflectTool
- */
-import type { ITool, ToolExecutionResult, ToolExecutionContext, JSONSchemaObject } from '../../core/tools/ITool.js';
-import type { ConsolidationLoop } from '../consolidation/ConsolidationLoop.js';
-import type { ConsolidationResult } from '../facade/types.js';
-import type { SqliteBrain } from '../store/SqliteBrain.js';
-/**
- * Input arguments for {@link MemoryReflectTool}.
- *
- * @property topic - Optional hint for the consolidation run. Currently reserved
- *                   for future topic-scoped consolidation; ignored at runtime.
- */
-export interface MemoryReflectInput extends Record<string, any> {
-    topic?: string;
-}
-/**
- * ITool implementation that triggers one full memory consolidation cycle via
- * {@link ConsolidationLoop.run()}.
- *
- * **Usage:**
- * ```ts
- * const tool = new MemoryReflectTool(brain, consolidationLoop);
- * const result = await tool.execute({}, context);
- * // result.output → { pruned: 3, merged: 1, derived: 0, compacted: 2, durationMs: 42 }
- * ```
- */
-export declare class MemoryReflectTool implements ITool<MemoryReflectInput, ConsolidationResult> {
-    private readonly brain;
-    private readonly consolidation;
-    /** Globally unique tool identifier. */
-    readonly id = "memory-reflect-v1";
-    /** LLM-facing tool name. */
-    readonly name = "memory_reflect";
-    /** Human-readable display name. */
-    readonly displayName = "Reflect on Memory";
-    /**
-     * Description shown to the LLM. The consolidation steps are described
-     * explicitly so the model understands what "reflect" means operationally.
-     */
-    readonly description: string;
-    /** Logical category for discovery and grouping. */
-    readonly category = "memory";
-    /**
-     * Consolidation writes to the database (pruning, merging, inserting insights).
-     * Mark as having side effects so callers may request confirmation if needed.
-     */
-    readonly hasSideEffects = true;
-    /** JSON schema for input validation and LLM tool-call construction. */
-    readonly inputSchema: JSONSchemaObject;
-    /**
-     * @param brain         - The agent's shared SQLite brain database connection.
-     *                        Accepted for symmetry with other memory tools and for
-     *                        future direct consolidation calls.
-     * @param consolidation - The {@link ConsolidationLoop} instance to invoke.
-     */
-    constructor(brain: SqliteBrain, consolidation: ConsolidationLoop);
-    /**
-     * Run one full consolidation cycle and return the statistics.
-     *
-     * If a consolidation cycle is already in progress (mutex guard in
-     * {@link ConsolidationLoop}), `run()` returns immediately with zero counts —
-     * this is surfaced as a successful result with all-zero statistics.
-     *
-     * @param _args    - Reflect input (optional topic hint, currently unused).
-     * @param _context - Tool execution context (not used by this tool).
-     * @returns {@link ConsolidationResult} on success, or an error result.
-     */
-    execute(_args: MemoryReflectInput, _context: ToolExecutionContext): Promise<ToolExecutionResult<ConsolidationResult>>;
-}
-//# sourceMappingURL=MemoryReflectTool.d.ts.map

package/dist/memory/tools/MemoryReflectTool.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MemoryReflectTool.d.ts","sourceRoot":"","sources":["../../../src/memory/tools/MemoryReflectTool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AACpH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,uCAAuC,CAAC;AAC/E,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAC9D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAM3D;;;;;GAKG;AACH,MAAM,WAAW,kBAAmB,SAAQ,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC;IAC7D,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAMD;;;;;;;;;;GAUG;AACH,qBAAa,iBAAkB,YAAW,KAAK,CAAC,kBAAkB,EAAE,mBAAmB,CAAC;IAgDpF,OAAO,CAAC,QAAQ,CAAC,KAAK;IACtB,OAAO,CAAC,QAAQ,CAAC,aAAa;IAhDhC,uCAAuC;IACvC,QAAQ,CAAC,EAAE,uBAAuB;IAElC,4BAA4B;IAC5B,QAAQ,CAAC,IAAI,oBAAoB;IAEjC,mCAAmC;IACnC,QAAQ,CAAC,WAAW,uBAAuB;IAE3C;;;OAGG;IACH,QAAQ,CAAC,WAAW,SAIgF;IAEpG,mDAAmD;IACnD,QAAQ,CAAC,QAAQ,YAAY;IAE7B;;;OAGG;IACH,QAAQ,CAAC,cAAc,QAAQ;IAE/B,uEAAuE;IACvE,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CASpC;IAEF;;;;;OAKG;gBAEgB,KAAK,EAAE,WAAW,EAClB,aAAa,EAAE,iBAAiB;IAOnD;;;;;;;;;;OAUG;IACG,OAAO,CACX,KAAK,EAAE,kBAAkB,EACzB,QAAQ,EAAE,oBAAoB,GAC7B,OAAO,CAAC,mBAAmB,CAAC,mBAAmB,CAAC,CAAC;CAWrD"}

package/dist/memory/tools/MemoryReflectTool.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"MemoryReflectTool.js","sourceRoot":"","sources":["../../../src/memory/tools/MemoryReflectTool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAqBH,8EAA8E;AAC9E,oBAAoB;AACpB,8EAA8E;AAE9E;;;;;;;;;;GAUG;AACH,MAAM,OAAO,iBAAiB;IAyC5B;;;;;OAKG;IACH,YACmB,KAAkB,EAClB,aAAgC;QADhC,UAAK,GAAL,KAAK,CAAa;QAClB,kBAAa,GAAb,aAAa,CAAmB;QAhDnD,uCAAuC;QAC9B,OAAE,GAAG,mBAAmB,CAAC;QAElC,4BAA4B;QACnB,SAAI,GAAG,gBAAgB,CAAC;QAEjC,mCAAmC;QAC1B,gBAAW,GAAG,mBAAmB,CAAC;QAE3C;;;WAGG;QACM,gBAAW,GAClB,uGAAuG;YACvG,sGAAsG;YACtG,gGAAgG;YAChG,iGAAiG,CAAC;QAEpG,mDAAmD;QAC1C,aAAQ,GAAG,QAAQ,CAAC;QAE7B;;;WAGG;QACM,mBAAc,GAAG,IAAI,CAAC;QAE/B,uEAAuE;QAC9D,gBAAW,GAAqB;YACvC,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE;gBACV,KAAK,EAAE;oBACL,IAAI,EAAE,QAAQ;oBACd,WAAW,EACT,gGAAgG;iBACnG;aACF;SACF,CAAC;IAWC,CAAC;IAEJ,8EAA8E;IAC9E,UAAU;IACV,8EAA8E;IAE9E;;;;;;;;;;OAUG;IACH,KAAK,CAAC,OAAO,CACX,KAAyB,EACzB,QAA8B;QAE9B,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC;YAC9C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;QAC3C,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;aACxD,CAAC;QACJ,CAAC;IACH,CAAC;CACF"}

package/dist/memory/tools/MemorySearchTool.d.ts

@@ -1,117 +0,0 @@
-/**
- * @fileoverview MemorySearchTool — lets an agent search its own memory traces
- * using FTS5 full-text search.
- *
- * The tool queries the `memory_traces_fts` FTS5 virtual table (backed by the
- * `memory_traces` content table) and joins back to `memory_traces` for
- * metadata fields (type, scope, strength, tags). Optional `type` and `scope`
- * filters narrow the result set via SQL WHERE clauses applied to the join.
- *
- * FTS5 matching uses the Porter-stemmed tokenizer configured at DDL time, so
- * queries like `"retrieve"` will also match `"retrieval"`, `"retrieved"`, etc.
- *
- * @module memory/tools/MemorySearchTool
- */
-import type { ITool, ToolExecutionResult, ToolExecutionContext, JSONSchemaObject } from '../../core/tools/ITool.js';
-import type { SqliteBrain } from '../store/SqliteBrain.js';
-/**
- * Input arguments for {@link MemorySearchTool}.
- *
- * @property query - The full-text search query string. Supports FTS5 syntax
- *                   (phrase queries in quotes, boolean operators, prefix matching).
- * @property type  - Optional filter: only return traces of this Tulving memory type.
- * @property scope - Optional filter: only return traces with this visibility scope.
- * @property limit - Maximum number of results to return. Defaults to 10.
- */
-export interface MemorySearchInput extends Record<string, any> {
-    query: string;
-    type?: string;
-    scope?: string;
-    limit?: number;
-}
-/**
- * A single result item in the {@link MemorySearchOutput} results array.
- *
- * @property id       - Trace ID.
- * @property content  - Full text content of the trace.
- * @property type     - Tulving memory type.
- * @property scope    - Visibility scope.
- * @property strength - Current Ebbinghaus encoding strength (0–1).
- * @property tags     - Array of tag strings.
- */
-export interface MemorySearchResult {
-    id: string;
-    content: string;
-    type: string;
-    scope: string;
-    strength: number;
-    tags: string[];
-}
-/**
- * Output returned by {@link MemorySearchTool} on success.
- *
- * @property results - Array of matching memory traces ordered by FTS5 relevance (BM25).
- */
-export interface MemorySearchOutput {
-    results: MemorySearchResult[];
-}
-/**
- * ITool implementation that searches the agent's memory traces using FTS5.
- *
- * **Usage:**
- * ```ts
- * const tool = new MemorySearchTool(brain);
- * const result = await tool.execute(
- *   { query: 'dark mode preference', scope: 'user', limit: 5 },
- *   context,
- * );
- * // result.output.results → [{ id, content, type, scope, strength, tags }, ...]
- * ```
- */
-export declare class MemorySearchTool implements ITool<MemorySearchInput, MemorySearchOutput> {
-    private readonly brain;
-    /** Globally unique tool identifier. */
-    readonly id = "memory-search-v1";
-    /** LLM-facing tool name. */
-    readonly name = "memory_search";
-    /** Human-readable display name. */
-    readonly displayName = "Search Memory";
-    /** LLM-facing description. */
-    readonly description: string;
-    /** Logical category for discovery and grouping. */
-    readonly category = "memory";
-    /** This tool only reads from the database — no side effects. */
-    readonly hasSideEffects = false;
-    /** JSON schema for input validation and LLM tool-call construction. */
-    readonly inputSchema: JSONSchemaObject;
-    /**
-     * @param brain - The agent's shared SQLite brain database connection.
-     */
-    constructor(brain: SqliteBrain);
-    /**
-     * Run a full-text search against `memory_traces_fts` and join back to
-     * `memory_traces` for metadata.
-     *
-     * The SQL pattern:
-     * ```sql
-     * SELECT mt.id, mt.content, mt.type, mt.scope, mt.strength, mt.tags
-     * FROM memory_traces_fts fts
-     * JOIN memory_traces mt ON mt.rowid = fts.rowid
-     * WHERE fts.memory_traces_fts MATCH ?
-     *   AND mt.deleted = 0
-     *   [AND mt.type = ?]    -- when type filter provided
-     *   [AND mt.scope = ?]   -- when scope filter provided
-     * ORDER BY rank          -- FTS5 BM25 relevance (lower = more relevant)
-     * LIMIT ?
-     * ```
-     *
-     * Tags are stored as JSON arrays; they are parsed and returned as string[].
-     * Malformed tag JSON returns an empty array rather than throwing.
-     *
-     * @param args    - Search input (query, optional type/scope/limit).
-     * @param context - Tool execution context used to resolve scoped searches.
-     * @returns `{ results }` array on success, or an error result.
-     */
-    execute(args: MemorySearchInput, context: ToolExecutionContext): Promise<ToolExecutionResult<MemorySearchOutput>>;
-}
-//# sourceMappingURL=MemorySearchTool.d.ts.map

package/dist/memory/tools/MemorySearchTool.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"MemorySearchTool.d.ts","sourceRoot":"","sources":["../../../src/memory/tools/MemorySearchTool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EACV,KAAK,EACL,mBAAmB,EACnB,oBAAoB,EACpB,gBAAgB,EACjB,MAAM,2BAA2B,CAAC;AACnC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAsB3D;;;;;;;;GAQG;AACH,MAAM,WAAW,iBAAkB,SAAQ,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC;IAC5D,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;GASG;AACH,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED;;;;GAIG;AACH,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,kBAAkB,EAAE,CAAC;CAC/B;AAMD;;;;;;;;;;;;GAYG;AACH,qBAAa,gBAAiB,YAAW,KAAK,CAAC,iBAAiB,EAAE,kBAAkB,CAAC;IAsDvE,OAAO,CAAC,QAAQ,CAAC,KAAK;IArDlC,uCAAuC;IACvC,QAAQ,CAAC,EAAE,sBAAsB;IAEjC,4BAA4B;IAC5B,QAAQ,CAAC,IAAI,mBAAmB;IAEhC,mCAAmC;IACnC,QAAQ,CAAC,WAAW,mBAAmB;IAEvC,8BAA8B;IAC9B,QAAQ,CAAC,WAAW,SAGuF;IAE3G,mDAAmD;IACnD,QAAQ,CAAC,QAAQ,YAAY;IAE7B,gEAAgE;IAChE,QAAQ,CAAC,cAAc,SAAS;IAEhC,uEAAuE;IACvE,QAAQ,CAAC,WAAW,EAAE,gBAAgB,CA0BpC;IAEF;;OAEG;gBAC0B,KAAK,EAAE,WAAW;IAM/C;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACG,OAAO,CACX,IAAI,EAAE,iBAAiB,EACvB,OAAO,EAAE,oBAAoB,GAC5B,OAAO,CAAC,mBAAmB,CAAC,kBAAkB,CAAC,CAAC;CAoFpD"}