@monoes/monomindcli 2.16.12 → 2.16.14

package/dist/src/mcp-tools/hooks-task.js

@@ -0,0 +1,427 @@
+/**
+ * Hooks MCP Tools — pre-task and post-task.
+ * Extracted from hooks-routing.ts.
+ */
+import { deriveRecentSuccess } from '../monovector/command-outcomes.js';
+import { joinLatestUnresolved, joinOutcome } from '../monovector/route-outcomes.js';
+import { pickAgents } from '../routing/agent-pick.js';
+import { validateMcpString } from '../utils/input-guards.js';
+import { extractKeywords, getRealSearchFunction, getRealStoreFunction, getRouteOutcomesBaseDir, loadRoutingOutcomes, saveRoutingOutcomes, } from './hooks-embedding.js';
+import { estimatedDuration, taskComplexity } from './hooks-route.js';
+export const hooksPreTask = {
+    name: 'hooks_pre-task',
+    description: 'Record task start and get agent suggestions with intelligent model routing (ADR-026)',
+    inputSchema: {
+        type: 'object',
+        properties: {
+            taskId: { type: 'string', description: 'Task identifier' },
+            description: { type: 'string', description: 'Task description' },
+            filePath: { type: 'string', description: 'Optional file path for AST analysis' },
+        },
+        required: ['taskId', 'description'],
+    },
+    handler: async (params) => {
+        // Cap taskId: it is used as a suffix in SQLite memory keys (heuristic:${taskId},
+        // routing-decision:${taskId}, textual_gradient:${taskId}) and as sourceId/targetId
+        // in causal-graph edges persisted to SQLite. An uncapped ID can inflate the DB key
+        // column and every JSON payload that includes the ID.
+        const MAX_TASK_ID_LEN = 256;
+        const taskId = validateMcpString(params.taskId, 'taskId', MAX_TASK_ID_LEN);
+        if (!taskId) {
+            return { error: 'taskId is required (non-empty string, no control chars, max 256 chars)' };
+        }
+        // Cap description: it is forwarded to generateEmbedding twice (ERL heuristics
+        // + TextGrad gradient queries) and used in O(n) keyword extraction.
+        // 16 KB matches the cap applied in hooks_route and hooksPatternSearch.
+        const MAX_PRE_TASK_DESC_LEN = 16 * 1024;
+        const description = validateMcpString(params.description, 'description', MAX_PRE_TASK_DESC_LEN);
+        if (!description) {
+            return { error: 'description is required (non-empty string, no control chars, max 16KB)' };
+        }
+        const _filePath = validateMcpString(params.filePath, 'filePath', 4 * 1024) ?? undefined;
+        const suggestion = await pickAgents(description, 3);
+        const complexity = taskComplexity(description);
+        // Enhanced model routing module was never shipped — modelRouting stays undefined.
+        const modelRouting = undefined;
+        // ERL: Retrieve past heuristics to inject into recommendations
+        // Source: https://arxiv.org/abs/2603.24639
+        const erlHints = [];
+        try {
+            const searchFn = await getRealSearchFunction();
+            if (searchFn) {
+                const heuristicResults = await searchFn({
+                    query: description,
+                    namespace: 'heuristics',
+                    limit: 3,
+                    threshold: 0.6,
+                });
+                for (const r of heuristicResults?.results ?? []) {
+                    try {
+                        const h = JSON.parse(r.content ?? '{}');
+                        if (h.action && h.confidence !== undefined && h.confidence >= 0.6) {
+                            erlHints.push(`ERL hint (conf=${h.confidence.toFixed(2)}): use "${h.action}" for tasks involving "${h.condition ?? 'similar context'}"`);
+                        }
+                    }
+                    catch {
+                        /* skip malformed */
+                    }
+                }
+                // TextGrad: also inject relevant past failure gradients to guide away from known pitfalls
+                // Source: https://arxiv.org/abs/2406.07496
+                const gradientResults = await searchFn({
+                    query: description,
+                    namespace: 'gradients',
+                    limit: 2,
+                    threshold: 0.55,
+                });
+                for (const r of gradientResults?.results ?? []) {
+                    const critique = r.content ?? '';
+                    if (critique && critique.length > 10) {
+                        erlHints.push(`TextGrad warning: ${critique.slice(0, 120)}`);
+                    }
+                }
+            }
+        }
+        catch {
+            /* non-critical */
+        }
+        // NOTE: a LATS planning pass used to be attempted here via
+        // `import('@monoes/hooks').buildLATSPlan` — that function never existed
+        // in the package (the planning module was removed), so the import failed
+        // silently on every call. The dead block was removed.
+        let plan;
+        // P2-15: Retrieve Reflexion reflections for this task — past failures
+        // on similar tasks are injected as recommendations so the agent avoids
+        // repeating mistakes. This closes the self-learning loop.
+        let reflexionWarnings = [];
+        try {
+            const hooksPkg = await import('@monoes/hooks').catch(() => null);
+            const fn = hooksPkg?.getReflectionsForTask;
+            if (typeof fn === 'function') {
+                const cwd = process.cwd();
+                const reflections = await fn(cwd, description, 3);
+                reflexionWarnings = reflections.map((r) => `⚠ Past failure: ${r.reflection.slice(0, 200)}`);
+            }
+        }
+        catch {
+            /* non-critical — reflexion store may not exist yet */
+        }
+        return {
+            taskId,
+            description,
+            suggestedAgents: suggestion.agents,
+            complexity,
+            estimatedDuration: estimatedDuration(complexity),
+            risks: complexity === 'high' ? ['Complex task may require multiple iterations'] : [],
+            recommendations: [
+                `Use ${suggestion.agents[0].type} as primary agent`,
+                suggestion.agents.length > 2
+                    ? 'Consider using swarm coordination'
+                    : 'Single agent recommended',
+                ...erlHints,
+                ...reflexionWarnings,
+            ],
+            modelRouting,
+            plan,
+            timestamp: new Date().toISOString(),
+        };
+    },
+};
+/** Provenance ref for the causal edge this hook writes.
+ *
+ *  Every post-task hook used to ingest under the bare string
+ *  `hooks-post-task`, so a graph rollback aimed at one bad task withdrew the
+ *  causal record of every task the hook had ever seen, and there was no ref
+ *  that named a single one. Keying on the task id makes the ref unique per
+ *  operation and stable for it: re-running post-task for the same task
+ *  re-asserts the same support rather than minting a second one. */
+export function postTaskOriginRef(taskId) {
+    return `hooks-post-task:${taskId}`;
+}
+export const hooksPostTask = {
+    name: 'hooks_post-task',
+    description: 'Record task completion for learning',
+    inputSchema: {
+        type: 'object',
+        properties: {
+            taskId: { type: 'string', description: 'Task identifier' },
+            success: { type: 'boolean', description: 'Whether task was successful' },
+            agent: { type: 'string', description: 'Agent that completed the task' },
+            quality: { type: 'number', description: 'Quality score (0-1)' },
+            task: {
+                type: 'string',
+                description: 'Task description text (used for learning keyword extraction)',
+            },
+            storeDecisions: { type: 'boolean', description: 'Also store routing decision in memory DB' },
+            routeId: {
+                type: 'string',
+                description: 'Route ID from a prior hooks_route call — joins the recommendation to this outcome',
+            },
+        },
+        required: ['taskId'],
+    },
+    handler: async (params) => {
+        // Cap taskId for the same reason as hooks_pre_task: it flows into SQLite memory keys
+        // (heuristic:${taskId}, routing-decision:${taskId}, textual_gradient:${taskId}) and
+        // into causal-graph edge IDs persisted to the DB.  Without a cap an attacker can
+        // inflate every row that stores the raw ID.
+        const MAX_POST_TASK_ID_LEN = 256;
+        const taskId = validateMcpString(params.taskId, 'taskId', MAX_POST_TASK_ID_LEN);
+        if (!taskId) {
+            return { error: 'taskId is required (non-empty string, no control chars, max 256 chars)' };
+        }
+        // The success flag, when the caller asserts it (--success true), is taken as
+        // ground truth. But callers usually do NOT pass it. Rather than treating every
+        // unverified task as "unknown" (and thus excluding it from learning), we now
+        // derive a MEASURED success signal from the real command exit codes recorded by
+        // post-command within a recent time window. post-command appends each exit code
+        // to the command-outcome store keyed by timestamp; deriveRecentSuccess returns:
+        //   true  → recent commands exist and the LAST command exited 0 (final-state heuristic)
+        //   false → recent commands exist and the LAST command exited non-zero
+        //   null  → no recent commands (genuinely no signal → stays unknown)
+        // Note: "final-state" not "all must pass" — intermediate failures (e.g. grep no-match,
+        // test-then-fix cycles) are intentionally ignored; the last exit code decides.
+        // Precedence: an explicit --success ALWAYS wins; the derived signal only fills
+        // in when no explicit flag is given; only when there is also no recent command
+        // signal does the outcome stay unknown (and excluded from SONA + route join,
+        // per the existing "unknown ≠ success" principle).
+        const explicitSuccess = typeof params.success === 'boolean';
+        let outcomeKnown = explicitSuccess;
+        let success = params.success !== false;
+        let successSource = explicitSuccess
+            ? 'explicit'
+            : 'unknown';
+        if (!explicitSuccess) {
+            const derived = await deriveRecentSuccess(getRouteOutcomesBaseDir());
+            if (derived !== null) {
+                outcomeKnown = true;
+                success = derived;
+                successSource = 'derived-commands';
+            }
+        }
+        // Cap agent: forwarded to bridgeRecordFeedback where it is stored in the
+        // feedback record and used as a tag string in the JSON store.  An uncapped
+        // agent value inflates the on-disk store entry.
+        const MAX_POST_TASK_AGENT_LEN = 256;
+        const agent = validateMcpString(params.agent, 'agent', MAX_POST_TASK_AGENT_LEN) ?? undefined;
+        const quality = typeof params.quality === 'number' && Number.isFinite(params.quality)
+            ? Math.max(0, Math.min(1, params.quality))
+            : success
+                ? 0.85
+                : 0.3;
+        const startTime = Date.now();
+        // Cap task description: passed to generateEmbedding via bridgeRecordFeedback
+        // and persisted to route-outcomes.jsonl.  16 KB matches hooks_route cap.
+        const MAX_POST_TASK_LEN = 16 * 1024;
+        const cappedPostTask = validateMcpString(params.task, 'task', MAX_POST_TASK_LEN) ?? undefined;
+        // Phase 3: Wire recordFeedback through bridge → LearningSystem + ReasoningBank
+        let feedbackResult = null;
+        try {
+            const bridge = await import('../memory/memory-bridge.js');
+            feedbackResult = await bridge.bridgeRecordFeedback({
+                taskType: agent ?? 'task',
+                action: cappedPostTask?.slice(0, 80) ?? taskId,
+                outcome: success ? 'success' : outcomeKnown ? 'failure' : 'partial',
+                confidence: quality,
+                metadata: {
+                    taskId,
+                    duration: typeof params.duration === 'number' && Number.isFinite(params.duration)
+                        ? params.duration
+                        : undefined,
+                    patterns: Array.isArray(params.patterns)
+                        ? params.patterns
+                            .filter((p) => typeof p === 'string' && p.length > 0 && p.length <= 200)
+                            .slice(0, 50)
+                        : undefined,
+                },
+            });
+        }
+        catch (e) {
+            // Bridge not available — continue with basic response
+            if (process.env.DEBUG || process.env.MONOMIND_DEBUG)
+                console.error('[hooks-post-task] memory bridge feedback failed:', e);
+        }
+        // Phase 3: Record causal edge (task → outcome) as a real, traversable
+        // knowledge-graph edge (via memory_kg_ingest — same path as the
+        // memory_causal-edge MCP tool), not the opaque write-only `causal:` bridge namespace.
+        try {
+            const kg = await import('../memory/memory-kg.js');
+            const outcomeId = `outcome-${taskId}`;
+            await kg.kgIngest({
+                nodes: [{ name: taskId }, { name: outcomeId }],
+                edges: [
+                    {
+                        source: taskId,
+                        target: outcomeId,
+                        relation: success ? 'succeeded' : 'failed',
+                    },
+                ],
+                originRef: postTaskOriginRef(taskId),
+            });
+        }
+        catch (e) {
+            // Non-fatal
+            if (process.env.DEBUG || process.env.MONOMIND_DEBUG)
+                console.error('[hooks-post-task] causal edge record failed:', e);
+        }
+        // Persist routing outcome for runtime learning (file-based, always reliable).
+        // B1.3: also gate this sibling learning sink on a known outcome — an unverified
+        // task must not train the router as a success either. When the caller did not
+        // assert success, the outcome is unknown and we skip persisting a labeled sample.
+        const taskText = cappedPostTask || '';
+        const outcomeKeywords = extractKeywords(taskText);
+        let outcomePersisted = false;
+        if (outcomeKnown &&
+            taskText &&
+            agent &&
+            agent.length <= 100 &&
+            /^[a-zA-Z0-9_-]+$/.test(agent)) {
+            try {
+                const outcomes = loadRoutingOutcomes();
+                outcomes.push({
+                    task: taskText,
+                    agent,
+                    success,
+                    quality,
+                    keywords: outcomeKeywords,
+                    timestamp: new Date().toISOString(),
+                });
+                outcomePersisted = saveRoutingOutcomes(outcomes);
+            }
+            catch {
+                /* non-critical */
+            }
+        }
+        // Join this outcome back onto the original route recommendation. This is the
+        // recommendation→actual→success link that routing-accuracy metrics and SONA
+        // labels depend on. When the caller threads an explicit routeId we join that
+        // record; otherwise we auto-correlate to the most recent unresolved route
+        // (within a 10-min window) so the loop closes without the LLM manually
+        // threading the routeId. Only join when the outcome is actually measured —
+        // per "unknown ≠ success", an unverified task must not pollute the metric.
+        if (outcomeKnown) {
+            const outcome = {
+                agentActuallyUsed: agent,
+                measuredSuccess: success,
+                quality: typeof params.quality === 'number' ? params.quality : undefined,
+            };
+            if (params.routeId) {
+                const routeId = validateMcpString(params.routeId, 'routeId', 256);
+                if (routeId) {
+                    await joinOutcome(getRouteOutcomesBaseDir(), routeId, outcome);
+                }
+            }
+            else {
+                await joinLatestUnresolved(getRouteOutcomesBaseDir(), outcome);
+            }
+        }
+        // ERL: Extract and persist structured heuristic for future pre-task injection
+        // Source: https://arxiv.org/abs/2603.24639
+        if (taskText && agent && success !== undefined) {
+            try {
+                const storeFn = await getRealStoreFunction();
+                if (storeFn) {
+                    const heuristic = {
+                        condition: outcomeKeywords.slice(0, 3).join(', ') || taskText.slice(0, 60),
+                        action: agent,
+                        confidence: success ? (quality ?? 0.8) : 0.2,
+                    };
+                    await storeFn({
+                        key: `heuristic:${taskId}`,
+                        value: JSON.stringify(heuristic),
+                        namespace: 'heuristics',
+                        tags: ['erl', agent, success ? 'success' : 'failure'],
+                    });
+                }
+            }
+            catch {
+                /* non-critical */
+            }
+        }
+        // Optionally store in memory DB for cross-session vector retrieval
+        if (params.storeDecisions && taskText && agent) {
+            try {
+                const storeFn = await getRealStoreFunction();
+                if (storeFn) {
+                    await storeFn({
+                        key: `routing-decision:${taskId}`,
+                        namespace: 'patterns',
+                        value: JSON.stringify({
+                            task: taskText,
+                            agent,
+                            success,
+                            quality,
+                            keywords: outcomeKeywords,
+                        }),
+                        tags: ['routing-decision'],
+                    });
+                }
+            }
+            catch {
+                /* non-critical */
+            }
+        }
+        const duration = Date.now() - startTime;
+        // TextGrad: Store textual gradient critique for failed tasks
+        // Source: https://arxiv.org/abs/2406.07496 (TextGrad — Nature)
+        if (!success && taskText) {
+            try {
+                const storeFn = await getRealStoreFunction();
+                if (storeFn) {
+                    const critique = `Task "${taskText.slice(0, 80)}" failed with agent "${agent}". ` +
+                        `Quality score: ${quality ?? 'unknown'}. ` +
+                        `Improvement direction: review agent selection, consider more capable agent or task decomposition.`;
+                    await storeFn({
+                        key: `textual_gradient:${taskId}`,
+                        value: critique,
+                        namespace: 'gradients',
+                        tags: ['textual_gradient', agent ?? 'unknown', 'failure'],
+                    });
+                }
+            }
+            catch {
+                /* non-critical */
+            }
+        }
+        // MAR: Structured multi-agent reflection on failure
+        // Source: https://arxiv.org/html/2512.20845 (MAR — December 2025)
+        const marReflection = !success
+            ? {
+                needed: true,
+                suggestedAgents: [
+                    { role: 'diagnoser', description: 'Analyze root cause of task failure' },
+                    { role: 'critic-1', description: 'Critique from correctness angle (temperature 0.3)' },
+                    { role: 'critic-2', description: 'Critique from efficiency angle (temperature 0.8)' },
+                    {
+                        role: 'aggregator',
+                        description: 'Synthesize critiques into actionable reflection heuristic',
+                    },
+                ],
+                storeAs: 'heuristics',
+                note: 'Spawn agents sequentially: Diagnoser → Critics in parallel → Aggregator',
+            }
+            : { needed: false };
+        return {
+            taskId,
+            success,
+            outcomeKnown,
+            successSource,
+            duration,
+            learningUpdates: {
+                controller: feedbackResult?.success ? 'sqlite' : 'none',
+                outcomePersisted,
+            },
+            quality,
+            feedback: feedbackResult
+                ? {
+                    recorded: feedbackResult.success,
+                    controller: feedbackResult.success ? 'sqlite' : 'unavailable',
+                    updates: feedbackResult.success ? 1 : 0,
+                }
+                : { recorded: false, controller: 'unavailable', updates: 0 },
+            marReflection,
+            timestamp: new Date().toISOString(),
+        };
+    },
+};
+//# sourceMappingURL=hooks-task.js.map

package/dist/src/mcp-tools/hooks-task.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hooks-task.js","sourceRoot":"","sources":["../../../src/mcp-tools/hooks-task.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AACxE,OAAO,EAAE,oBAAoB,EAAE,WAAW,EAAE,MAAM,iCAAiC,CAAC;AACpF,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EACL,eAAe,EACf,qBAAqB,EACrB,oBAAoB,EACpB,uBAAuB,EACvB,mBAAmB,EACnB,mBAAmB,GACpB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EAAE,iBAAiB,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGrE,MAAM,CAAC,MAAM,YAAY,GAAY;IACnC,IAAI,EAAE,gBAAgB;IACtB,WAAW,EACT,sFAAsF;IACxF,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,EAAE;YAC1D,WAAW,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,kBAAkB,EAAE;YAChE,QAAQ,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,qCAAqC,EAAE;SACjF;QACD,QAAQ,EAAE,CAAC,QAAQ,EAAE,aAAa,CAAC;KACpC;IACD,OAAO,EAAE,KAAK,EAAE,MAA+B,EAAE,EAAE;QACjD,iFAAiF;QACjF,mFAAmF;QACnF,mFAAmF;QACnF,sDAAsD;QACtD,MAAM,eAAe,GAAG,GAAG,CAAC;QAC5B,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC;QAC3E,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,EAAE,KAAK,EAAE,wEAAwE,EAAE,CAAC;QAC7F,CAAC;QACD,8EAA8E;QAC9E,oEAAoE;QACpE,uEAAuE;QACvE,MAAM,qBAAqB,GAAG,EAAE,GAAG,IAAI,CAAC;QACxC,MAAM,WAAW,GAAG,iBAAiB,CAAC,MAAM,CAAC,WAAW,EAAE,aAAa,EAAE,qBAAqB,CAAC,CAAC;QAChG,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,OAAO,EAAE,KAAK,EAAE,wEAAwE,EAAE,CAAC;QAC7F,CAAC;QACD,MAAM,SAAS,GAAG,iBAAiB,CAAC,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,SAAS,CAAC;QACxF,MAAM,UAAU,GAAG,MAAM,UAAU,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;QACpD,MAAM,UAAU,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC;QAE/C,kFAAkF;QAClF,MAAM,YAAY,GAAwC,SAAS,CAAC;QAEpE,+DAA+D;QAC/D,2CAA2C;QAC3C,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,qBAAqB,EAAE,CAAC;YAC/C,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,gBAAgB,GAAG,MAAM,QAAQ,CAAC;oBACtC,KAAK,EAAE,WAAW;oBAClB,SAAS,EAAE,YAAY;oBACvB,KAAK,EAAE,CAAC;oBACR,SAAS,EAAE,GAAG;iBACf,CAAC,CAAC;gBACH,KAAK,MAAM,CAAC,IAAI,gBAAgB,EAAE,OAAO,IAAI,EAAE,EAAE,CAAC;oBAChD,IAAI,CAAC;wBACH,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,IAAI,IAAI,CAIrC,CAAC;wBACF,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,SAAS,IAAI,CAAC,CAAC,UAAU,IAAI,GAAG,EAAE,CAAC;4BAClE,QAAQ,CAAC,IAAI,CACX,kBAAkB,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,MAAM,0BAA0B,CAAC,CAAC,SAAS,IAAI,iBAAiB,GAAG,CAC1H,CAAC;wBACJ,CAAC;oBACH,CAAC;oBAAC,MAAM,CAAC;wBACP,oBAAoB;oBACtB,CAAC;gBACH,CAAC;gBAED,0FAA0F;gBAC1F,2CAA2C;gBAC3C,MAAM,eAAe,GAAG,MAAM,QAAQ,CAAC;oBACrC,KAAK,EAAE,WAAW;oBAClB,SAAS,EAAE,WAAW;oBACtB,KAAK,EAAE,CAAC;oBACR,SAAS,EAAE,IAAI;iBAChB,CAAC,CAAC;gBACH,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,OAAO,IAAI,EAAE,EAAE,CAAC;oBAC/C,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC;oBACjC,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;wBACrC,QAAQ,CAAC,IAAI,CAAC,qBAAqB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC/D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,kBAAkB;QACpB,CAAC;QAED,2DAA2D;QAC3D,wEAAwE;QACxE,yEAAyE;QACzE,sDAAsD;QACtD,IAAI,IAAwB,CAAC;QAE7B,sEAAsE;QACtE,uEAAuE;QACvE,0DAA0D;QAC1D,IAAI,iBAAiB,GAAa,EAAE,CAAC;QACrC,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,eAAe,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YACjE,MAAM,EAAE,GAAI,QAA2C,EAAE,qBAAqB,CAAC;YAC/E,IAAI,OAAO,EAAE,KAAK,UAAU,EAAE,CAAC;gBAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,EAAE,CAAC;gBAC1B,MAAM,WAAW,GAAG,MAClB,EAKD,CAAC,GAAG,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;gBACvB,iBAAiB,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9F,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,sDAAsD;QACxD,CAAC;QAED,OAAO;YACL,MAAM;YACN,WAAW;YACX,eAAe,EAAE,UAAU,CAAC,MAAM;YAClC,UAAU;YACV,iBAAiB,EAAE,iBAAiB,CAAC,UAAU,CAAC;YAChD,KAAK,EAAE,UAAU,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,8CAA8C,CAAC,CAAC,CAAC,CAAC,EAAE;YACpF,eAAe,EAAE;gBACf,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,mBAAmB;gBACnD,UAAU,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;oBAC1B,CAAC,CAAC,mCAAmC;oBACrC,CAAC,CAAC,0BAA0B;gBAC9B,GAAG,QAAQ;gBACX,GAAG,iBAAiB;aACrB;YACD,YAAY;YACZ,IAAI;YACJ,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAC;IACJ,CAAC;CACF,CAAC;AAEF;;;;;;;oEAOoE;AACpE,MAAM,UAAU,iBAAiB,CAAC,MAAc;IAC9C,OAAO,mBAAmB,MAAM,EAAE,CAAC;AACrC,CAAC;AAED,MAAM,CAAC,MAAM,aAAa,GAAY;IACpC,IAAI,EAAE,iBAAiB;IACvB,WAAW,EAAE,qCAAqC;IAClD,WAAW,EAAE;QACX,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,EAAE;YAC1D,OAAO,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,6BAA6B,EAAE;YACxE,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,+BAA+B,EAAE;YACvE,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,qBAAqB,EAAE;YAC/D,IAAI,EAAE;gBACJ,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,8DAA8D;aAC5E;YACD,cAAc,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,0CAA0C,EAAE;YAC5F,OAAO,EAAE;gBACP,IAAI,EAAE,QAAQ;gBACd,WAAW,EACT,mFAAmF;aACtF;SACF;QACD,QAAQ,EAAE,CAAC,QAAQ,CAAC;KACrB;IACD,OAAO,EAAE,KAAK,EAAE,MAA+B,EAAE,EAAE;QACjD,qFAAqF;QACrF,oFAAoF;QACpF,iFAAiF;QACjF,4CAA4C;QAC5C,MAAM,oBAAoB,GAAG,GAAG,CAAC;QACjC,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,EAAE,oBAAoB,CAAC,CAAC;QAChF,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,EAAE,KAAK,EAAE,wEAAwE,EAAE,CAAC;QAC7F,CAAC;QACD,6EAA6E;QAC7E,+EAA+E;QAC/E,6EAA6E;QAC7E,gFAAgF;QAChF,gFAAgF;QAChF,gFAAgF;QAChF,wFAAwF;QACxF,uEAAuE;QACvE,qEAAqE;QACrE,uFAAuF;QACvF,+EAA+E;QAC/E,+EAA+E;QAC/E,+EAA+E;QAC/E,6EAA6E;QAC7E,mDAAmD;QACnD,MAAM,eAAe,GAAG,OAAO,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC;QAC5D,IAAI,YAAY,GAAG,eAAe,CAAC;QACnC,IAAI,OAAO,GAAG,MAAM,CAAC,OAAO,KAAK,KAAK,CAAC;QACvC,IAAI,aAAa,GAAgD,eAAe;YAC9E,CAAC,CAAC,UAAU;YACZ,CAAC,CAAC,SAAS,CAAC;QAEd,IAAI,CAAC,eAAe,EAAE,CAAC;YACrB,MAAM,OAAO,GAAG,MAAM,mBAAmB,CAAC,uBAAuB,EAAE,CAAC,CAAC;YACrE,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,YAAY,GAAG,IAAI,CAAC;gBACpB,OAAO,GAAG,OAAO,CAAC;gBAClB,aAAa,GAAG,kBAAkB,CAAC;YACrC,CAAC;QACH,CAAC;QACD,yEAAyE;QACzE,2EAA2E;QAC3E,gDAAgD;QAChD,MAAM,uBAAuB,GAAG,GAAG,CAAC;QACpC,MAAM,KAAK,GAAG,iBAAiB,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,uBAAuB,CAAC,IAAI,SAAS,CAAC;QAC7F,MAAM,OAAO,GACX,OAAO,MAAM,CAAC,OAAO,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,CAAC;YACnE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,OAAiB,CAAC,CAAC;YACpD,CAAC,CAAC,OAAO;gBACP,CAAC,CAAC,IAAI;gBACN,CAAC,CAAC,GAAG,CAAC;QACZ,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,6EAA6E;QAC7E,yEAAyE;QACzE,MAAM,iBAAiB,GAAG,EAAE,GAAG,IAAI,CAAC;QACpC,MAAM,cAAc,GAAG,iBAAiB,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,iBAAiB,CAAC,IAAI,SAAS,CAAC;QAE9F,+EAA+E;QAC/E,IAAI,cAAc,GAA6D,IAAI,CAAC;QACpF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,4BAA4B,CAAC,CAAC;YAC1D,cAAc,GAAG,MAAM,MAAM,CAAC,oBAAoB,CAAC;gBACjD,QAAQ,EAAE,KAAK,IAAI,MAAM;gBACzB,MAAM,EAAE,cAAc,EAAE,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,MAAM;gBAC9C,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;gBACnE,UAAU,EAAE,OAAO;gBACnB,QAAQ,EAAE;oBACR,MAAM;oBACN,QAAQ,EACN,OAAO,MAAM,CAAC,QAAQ,KAAK,QAAQ,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC;wBACrE,CAAC,CAAC,MAAM,CAAC,QAAQ;wBACjB,CAAC,CAAC,SAAS;oBACf,QAAQ,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC;wBACtC,CAAC,CAAE,MAAM,CAAC,QAAsB;6BAC3B,MAAM,CACL,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG,CAC7E;6BACA,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;wBACjB,CAAC,CAAC,SAAS;iBACd;aACF,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,sDAAsD;YACtD,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,cAAc;gBACjD,OAAO,CAAC,KAAK,CAAC,kDAAkD,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;QAED,sEAAsE;QACtE,gEAAgE;QAChE,sFAAsF;QACtF,IAAI,CAAC;YACH,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,wBAAwB,CAAC,CAAC;YAClD,MAAM,SAAS,GAAG,WAAW,MAAM,EAAE,CAAC;YACtC,MAAM,EAAE,CAAC,QAAQ,CAAC;gBAChB,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;gBAC9C,KAAK,EAAE;oBACL;wBACE,MAAM,EAAE,MAAM;wBACd,MAAM,EAAE,SAAS;wBACjB,QAAQ,EAAE,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ;qBAC3C;iBACF;gBACD,SAAS,EAAE,iBAAiB,CAAC,MAAM,CAAC;aACrC,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,YAAY;YACZ,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,OAAO,CAAC,GAAG,CAAC,cAAc;gBACjD,OAAO,CAAC,KAAK,CAAC,8CAA8C,EAAE,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,8EAA8E;QAC9E,gFAAgF;QAChF,8EAA8E;QAC9E,kFAAkF;QAClF,MAAM,QAAQ,GAAG,cAAc,IAAI,EAAE,CAAC;QACtC,MAAM,eAAe,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAC;QAClD,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAC7B,IACE,YAAY;YACZ,QAAQ;YACR,KAAK;YACL,KAAK,CAAC,MAAM,IAAI,GAAG;YACnB,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,EAC9B,CAAC;YACD,IAAI,CAAC;gBACH,MAAM,QAAQ,GAAG,mBAAmB,EAAE,CAAC;gBACvC,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,QAAQ;oBACd,KAAK;oBACL,OAAO;oBACP,OAAO;oBACP,QAAQ,EAAE,eAAe;oBACzB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;iBACpC,CAAC,CAAC;gBACH,gBAAgB,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC;YACnD,CAAC;YAAC,MAAM,CAAC;gBACP,kBAAkB;YACpB,CAAC;QACH,CAAC;QAED,6EAA6E;QAC7E,4EAA4E;QAC5E,6EAA6E;QAC7E,0EAA0E;QAC1E,uEAAuE;QACvE,2EAA2E;QAC3E,2EAA2E;QAC3E,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,OAAO,GAAG;gBACd,iBAAiB,EAAE,KAAK;gBACxB,eAAe,EAAE,OAAO;gBACxB,OAAO,EAAE,OAAO,MAAM,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAE,MAAM,CAAC,OAAkB,CAAC,CAAC,CAAC,SAAS;aACrF,CAAC;YACF,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBACnB,MAAM,OAAO,GAAG,iBAAiB,CAAC,MAAM,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;gBAClE,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,WAAW,CAAC,uBAAuB,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;gBACjE,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,oBAAoB,CAAC,uBAAuB,EAAE,EAAE,OAAO,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QAED,8EAA8E;QAC9E,2CAA2C;QAC3C,IAAI,QAAQ,IAAI,KAAK,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC/C,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,oBAAoB,EAAE,CAAC;gBAC7C,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,SAAS,GAAG;wBAChB,SAAS,EAAE,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;wBAC1E,MAAM,EAAE,KAAK;wBACb,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG;qBAC7C,CAAC;oBACF,MAAM,OAAO,CAAC;wBACZ,GAAG,EAAE,aAAa,MAAM,EAAE;wBAC1B,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC;wBAChC,SAAS,EAAE,YAAY;wBACvB,IAAI,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;qBACtD,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,kBAAkB;YACpB,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,IAAI,MAAM,CAAC,cAAc,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;YAC/C,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,oBAAoB,EAAE,CAAC;gBAC7C,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,OAAO,CAAC;wBACZ,GAAG,EAAE,oBAAoB,MAAM,EAAE;wBACjC,SAAS,EAAE,UAAU;wBACrB,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC;4BACpB,IAAI,EAAE,QAAQ;4BACd,KAAK;4BACL,OAAO;4BACP,OAAO;4BACP,QAAQ,EAAE,eAAe;yBAC1B,CAAC;wBACF,IAAI,EAAE,CAAC,kBAAkB,CAAC;qBAC3B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,kBAAkB;YACpB,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAExC,6DAA6D;QAC7D,+DAA+D;QAC/D,IAAI,CAAC,OAAO,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,oBAAoB,EAAE,CAAC;gBAC7C,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,QAAQ,GACZ,SAAS,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,wBAAwB,KAAK,KAAK;wBAChE,kBAAkB,OAAO,IAAI,SAAS,IAAI;wBAC1C,mGAAmG,CAAC;oBACtG,MAAM,OAAO,CAAC;wBACZ,GAAG,EAAE,oBAAoB,MAAM,EAAE;wBACjC,KAAK,EAAE,QAAQ;wBACf,SAAS,EAAE,WAAW;wBACtB,IAAI,EAAE,CAAC,kBAAkB,EAAE,KAAK,IAAI,SAAS,EAAE,SAAS,CAAC;qBAC1D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,kBAAkB;YACpB,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,kEAAkE;QAClE,MAAM,aAAa,GAAG,CAAC,OAAO;YAC5B,CAAC,CAAC;gBACE,MAAM,EAAE,IAAI;gBACZ,eAAe,EAAE;oBACf,EAAE,IAAI,EAAE,WAAW,EAAE,WAAW,EAAE,oCAAoC,EAAE;oBACxE,EAAE,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,mDAAmD,EAAE;oBACtF,EAAE,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,kDAAkD,EAAE;oBACrF;wBACE,IAAI,EAAE,YAAY;wBAClB,WAAW,EAAE,2DAA2D;qBACzE;iBACF;gBACD,OAAO,EAAE,YAAY;gBACrB,IAAI,EAAE,yEAAyE;aAChF;YACH,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;QAEtB,OAAO;YACL,MAAM;YACN,OAAO;YACP,YAAY;YACZ,aAAa;YACb,QAAQ;YACR,eAAe,EAAE;gBACf,UAAU,EAAE,cAAc,EAAE,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM;gBACvD,gBAAgB;aACjB;YACD,OAAO;YACP,QAAQ,EAAE,cAAc;gBACtB,CAAC,CAAC;oBACE,QAAQ,EAAE,cAAc,CAAC,OAAO;oBAChC,UAAU,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,aAAa;oBAC7D,OAAO,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACxC;gBACH,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,OAAO,EAAE,CAAC,EAAE;YAC9D,aAAa;YACb,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAC;IACJ,CAAC;CACF,CAAC"}

package/dist/src/mcp-tools/hooks-tools.d.ts

@@ -1,7 +1,8 @@
 /**
  * Hooks MCP Tools — Registration Layer
  * Thin registration module that aggregates all hooks MCP tools into a single array.
- * Business logic lives in hooks-embedding.ts, hooks-routing.ts, and hooks-intelligence.ts.
+ * Business logic lives in hooks-embedding.ts, hooks-routing.ts (re-exporting the
+ * hooks-*.ts tool modules), and hooks-intelligence.ts.
  */
 import type { MCPTool } from './types.js';
 export declare const hooksTools: MCPTool[];

package/dist/src/mcp-tools/hooks-tools.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"hooks-tools.d.ts","sourceRoot":"","sources":["../../../src/mcp-tools/hooks-tools.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAmCH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAG1C,eAAO,MAAM,UAAU,EAAE,OAAO,EAsC/B,CAAC;eAEa,UAAU"}
+{"version":3,"file":"hooks-tools.d.ts","sourceRoot":"","sources":["../../../src/mcp-tools/hooks-tools.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAmCH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAG1C,eAAO,MAAM,UAAU,EAAE,OAAO,EAsC/B,CAAC;eAEa,UAAU"}

package/dist/src/mcp-tools/hooks-tools.js

@@ -1,7 +1,8 @@
 /**
  * Hooks MCP Tools — Registration Layer
  * Thin registration module that aggregates all hooks MCP tools into a single array.
- * Business logic lives in hooks-embedding.ts, hooks-routing.ts, and hooks-intelligence.ts.
+ * Business logic lives in hooks-embedding.ts, hooks-routing.ts (re-exporting the
+ * hooks-*.ts tool modules), and hooks-intelligence.ts.
  */
 import { hooksIntelligenceLearn, hooksIntelligenceReset, hooksIntelligenceStats, hooksModelOutcome, hooksModelRoute, hooksModelStats, hooksPatternSearch, hooksPatternStore, hooksTrajectoryEnd, hooksTrajectoryStart, hooksTrajectoryStep, } from './hooks-intelligence.js';
 import { hooksExplain, hooksIntelligence, hooksList, hooksMetrics, hooksPostCommand, hooksPostEdit, hooksPostTask, hooksPreCommand, hooksPreEdit, hooksPreTask, hooksPretrain, hooksRoute, hooksRouteSemantic, hooksSessionEnd, hooksSessionRestore, hooksSessionStart, hooksTransfer, } from './hooks-routing.js';

package/dist/src/mcp-tools/hooks-tools.js.map

@@ -1 +1 @@
-{"version":3,"file":"hooks-tools.js","sourceRoot":"","sources":["../../../src/mcp-tools/hooks-tools.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EACL,sBAAsB,EACtB,sBAAsB,EACtB,sBAAsB,EACtB,iBAAiB,EACjB,eAAe,EACf,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EACjB,kBAAkB,EAClB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACL,YAAY,EACZ,iBAAiB,EACjB,SAAS,EACT,YAAY,EACZ,gBAAgB,EAChB,aAAa,EACb,aAAa,EACb,eAAe,EACf,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,UAAU,EACV,kBAAkB,EAClB,eAAe,EACf,mBAAmB,EACnB,iBAAiB,EACjB,aAAa,GACd,MAAM,oBAAoB,CAAC;AAG5B,yBAAyB;AACzB,MAAM,CAAC,MAAM,UAAU,GAAc;IACnC,YAAY;IACZ,aAAa;IACb,eAAe;IACf,gBAAgB;IAChB,UAAU;IACV,kBAAkB;IAClB,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,aAAa;IACb,YAAY;IACZ,YAAY;IACZ,aAAa;IACb,aAAa;IACb,iBAAiB;IACjB,mBAAmB;IACnB,eAAe;IACf,iBAAiB;IACjB,sBAAsB;IACtB,oBAAoB;IACpB,mBAAmB;IACnB,kBAAkB;IAClB,iBAAiB;IACjB,kBAAkB;IAClB,sBAAsB;IACtB,sBAAsB;IACtB,sBAAsB;IACtB,eAAe;IACf,iBAAiB;IACjB,eAAe;IACf,yEAAyE;IACzE,iFAAiF;IACjF,8EAA8E;IAC9E,yEAAyE;IACzE,6EAA6E;IAC7E,8EAA8E;IAC9E,qBAAqB;CACtB,CAAC;AAEF,eAAe,UAAU,CAAC"}
+{"version":3,"file":"hooks-tools.js","sourceRoot":"","sources":["../../../src/mcp-tools/hooks-tools.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,sBAAsB,EACtB,sBAAsB,EACtB,sBAAsB,EACtB,iBAAiB,EACjB,eAAe,EACf,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EACjB,kBAAkB,EAClB,oBAAoB,EACpB,mBAAmB,GACpB,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACL,YAAY,EACZ,iBAAiB,EACjB,SAAS,EACT,YAAY,EACZ,gBAAgB,EAChB,aAAa,EACb,aAAa,EACb,eAAe,EACf,YAAY,EACZ,YAAY,EACZ,aAAa,EACb,UAAU,EACV,kBAAkB,EAClB,eAAe,EACf,mBAAmB,EACnB,iBAAiB,EACjB,aAAa,GACd,MAAM,oBAAoB,CAAC;AAG5B,yBAAyB;AACzB,MAAM,CAAC,MAAM,UAAU,GAAc;IACnC,YAAY;IACZ,aAAa;IACb,eAAe;IACf,gBAAgB;IAChB,UAAU;IACV,kBAAkB;IAClB,YAAY;IACZ,SAAS;IACT,YAAY;IACZ,aAAa;IACb,YAAY;IACZ,YAAY;IACZ,aAAa;IACb,aAAa;IACb,iBAAiB;IACjB,mBAAmB;IACnB,eAAe;IACf,iBAAiB;IACjB,sBAAsB;IACtB,oBAAoB;IACpB,mBAAmB;IACnB,kBAAkB;IAClB,iBAAiB;IACjB,kBAAkB;IAClB,sBAAsB;IACtB,sBAAsB;IACtB,sBAAsB;IACtB,eAAe;IACf,iBAAiB;IACjB,eAAe;IACf,yEAAyE;IACzE,iFAAiF;IACjF,8EAA8E;IAC9E,yEAAyE;IACzE,6EAA6E;IAC7E,8EAA8E;IAC9E,qBAAqB;CACtB,CAAC;AAEF,eAAe,UAAU,CAAC"}

package/dist/src/mcp-tools/memory-tools.js

@@ -321,7 +321,7 @@ export const memoryCausalEdge = {
 // partial graph.
 /** Per-call ceilings enforced by kgIngest/kgIngestRules. Mirrored here so an
  *  over-cap payload is reported as truncated instead of silently sliced.
- *  Keep in sync with the `.slice()` bounds in memory-kg.ts. */
+ *  Keep in sync with the `.slice()` bounds in memory-kg-ingest.ts. */
 const KG_MAX_NODES = 500;
 const KG_MAX_EDGES = 1000;
 const KG_MAX_RULES = 50;