@massa-ai/core 1.2.1

package/dist/tools/serialize.js

@@ -0,0 +1,388 @@
+/**
+ * Shared serializer for tool success-path responses.
+ *
+ * Owns two concerns that were previously inlined per-tool:
+ *   1. `fields` projection (shallow + dotted walk; arrays element-wise)
+ *   2. `format` encoding (json raw object | toon string)
+ *
+ * Contract (plan-critic boundary): wrap ONLY the success-path return of a tool.
+ * Error / catch / not-found branches — including any `data:{hint}` on the error
+ * branch — are returned directly and MUST NOT pass through this helper. This
+ * keeps the error wire-shape byte-identical and avoids projecting/throwing on
+ * partial data.
+ *
+ * Defaults are resolved by the CALLING tool and passed in as literals; this
+ * helper never picks a default. The helper only branches on the literal
+ * "toon" — anything else (including "json" or undefined) returns the raw object.
+ */
+import { encode as toTOON } from "@toon-format/toon";
+/**
+ * Project (and optionally TOON-encode / group) a tool success-path result.
+ *
+ * Projection runs BEFORE encoding so `fields` composes with all formats.
+ *
+ * `format:"tree"` (Wave 5 FR-06 / N5) emits a text-indented grouped model:
+ *   group header lines (prefix + counts), then each row under it, indented.
+ *   Both `tree` and `json` (with `grouped:true`) route through ONE shared
+ *   `groupRowsByPrefix` helper (AD-W5-011) so a mutation in the helper
+ *   changes both formats together (AC-6 mutation test).
+ */
+export function serializeToolResponse(result, opts = {}) {
+    const projected = projectFields(result, opts.fields);
+    // Tree format always groups (when groupBy + array data). JSON groups only
+    // when `grouped:true` is explicitly requested (additive — existing
+    // format:"json" callers are unchanged).
+    const wantsGrouped = (opts.format === "tree" || (opts.format === "json" && opts.grouped === true)) &&
+        opts.groupBy &&
+        Array.isArray(projected);
+    if (wantsGrouped) {
+        const grouped = groupRowsByPrefix(projected, opts.groupBy);
+        if (opts.format === "tree") {
+            return { success: true, data: groupedToTree(grouped) };
+        }
+        return { success: true, data: grouped };
+    }
+    // `format:"tree"` without grouping: still emit text (flat tree = JSON of
+    // the projected data). Keeps the contract that tree always returns a string.
+    if (opts.format === "tree") {
+        return { success: true, data: treeFlat(projected) };
+    }
+    return {
+        success: true,
+        data: opts.format === "toon" ? toTOON(projected) : projected,
+    };
+}
+/**
+ * Field projection per spec AC P3 / design.md §2.
+ *
+ * - absent/empty `fields` → full data (no projection)
+ * - array `data`          → element-wise map
+ * - non-object `data`     → unchanged (scalar)
+ * - object `data`         → pick present keys; dotted walks via projectPath
+ * - unknown key / broken midpath → silently dropped (no throw)
+ */
+export function projectFields(data, fields) {
+    if (!fields || fields.length === 0)
+        return data;
+    if (Array.isArray(data)) {
+        return data.map((e) => projectFields(e, fields));
+    }
+    if (data === null || typeof data !== "object")
+        return data;
+    const out = {};
+    const src = data;
+    for (const f of fields) {
+        const [head, ...rest] = f.split(".");
+        if (!(head in src))
+            continue; // unknown key → silently dropped
+        const v = src[head];
+        if (rest.length === 0) {
+            // M26: if the value is an escaped JSON string, unescape and parse it
+            // into a nested structure. Return the parsed value, not the string.
+            out[head] = unescapeJsonField(v);
+            continue;
+        }
+        const projected = projectPath(v, rest);
+        if (projected === undefined)
+            continue;
+        // Merge when multiple dotted fields share a top-level head
+        // (e.g. ["impacted.symbol","impacted.risk"] must yield both keys).
+        out[head] = mergeProjection(out[head], projected);
+    }
+    return out;
+}
+/**
+ * M26: Unescape an escaped JSON string and parse it into a nested structure.
+ *
+ * If the value is a string that looks like escaped JSON (starts with `{` or
+ * `[` after unescaping, or has escaped quotes `\"`), attempt to JSON.parse it.
+ * On success, return the parsed nested structure. On failure, return the
+ * original value with no throw (clear error is handled by the caller).
+ *
+ * If the value is already an object/array, return it as-is (no re-parsing).
+ * If the value is a scalar (number, boolean, null), return it as-is.
+ */
+export function unescapeJsonField(value) {
+    if (value === null || value === undefined)
+        return value;
+    if (typeof value !== "string")
+        return value;
+    // Check for escaped JSON: strings containing `\"` or `{`/`[` patterns
+    const trimmed = value.trim();
+    if (!trimmed)
+        return value;
+    // Unescape: replace `\"` with `"` (common escaping pattern)
+    let unescaped = trimmed;
+    if (unescaped.includes('\\"')) {
+        unescaped = unescaped.replace(/\\"/g, '"');
+    }
+    // Check if it looks like JSON (starts with { or [)
+    if ((unescaped.startsWith("{") && unescaped.endsWith("}")) ||
+        (unescaped.startsWith("[") && unescaped.endsWith("]"))) {
+        try {
+            return JSON.parse(unescaped);
+        }
+        catch {
+            // Not valid JSON — return the unescaped string (clearer than the escaped
+            // version). The caller sees the unescaped value and can diagnose.
+            return unescaped;
+        }
+    }
+    // Not JSON-like: return the unescaped string if we unescaped it, else original
+    return unescaped === trimmed ? value : unescaped;
+}
+/**
+ * Walk the dotted remainder of a single field path and rebuild a nested
+ * single-key projection. Per spec AC P3.2, projecting `["nodes.symbol"]` over
+ * `nodes:[{symbol,kind,...}]` yields `{nodes:[{symbol},{symbol}]}` — each
+ * element keeps ONLY the requested key, not the bare scalar.
+ *
+ * - arrays recurse element-wise
+ * - missing midpoint / primitive midpoint → drop (return undefined, key absent)
+ * - leaf returns the value; intermediate wraps under its head key
+ * - merges with any prior projection sharing a segment (so
+ *   `["impacted.symbol","impacted.risk"]` yields both keys per element)
+ */
+function projectPath(value, restKeys) {
+    if (restKeys.length === 0)
+        return value;
+    if (Array.isArray(value)) {
+        return value.map((e) => projectPath(e, restKeys));
+    }
+    if (value === null || typeof value !== "object")
+        return undefined;
+    const [head, ...rest] = restKeys;
+    const src = value;
+    if (!(head in src))
+        return undefined;
+    const child = src[head];
+    if (rest.length === 0) {
+        // leaf: wrap the value under its key so callers see {head: value}, not bare.
+        return Array.isArray(child)
+            ? child.map((e) => ({ [head]: e }))
+            : { [head]: child };
+    }
+    const inner = projectPath(child, rest);
+    if (inner === undefined)
+        return undefined;
+    return { [head]: inner };
+}
+/**
+ * Merge two projections that share a top-level key. Two cases:
+ *  - arrays → element-wise object merge (so ["impacted.symbol","impacted.risk"]
+ *    yields each element with both symbol and risk)
+ *  - plain objects → shallow key merge (later wins on conflict, but dotted
+ *    projections target distinct sub-keys so conflicts are rare)
+ *  - otherwise → later wins
+ */
+function mergeProjection(a, b) {
+    if (a === undefined)
+        return b;
+    if (Array.isArray(a) && Array.isArray(b)) {
+        const len = Math.max(a.length, b.length);
+        const out = [];
+        for (let i = 0; i < len; i++) {
+            out.push(mergeProjection(a[i], b[i]));
+        }
+        return out;
+    }
+    if (a !== null &&
+        b !== null &&
+        typeof a === "object" &&
+        typeof b === "object" &&
+        !Array.isArray(a) &&
+        !Array.isArray(b)) {
+        return { ...a, ...b };
+    }
+    return b;
+}
+// ─── Wave 5 FR-06 / N5: grouped format helper (AD-W5-011) ─────────────────────
+//
+// One shared `groupRowsByPrefix` helper drives BOTH `format:"tree"` (text-
+// indented) and `format:"json"` (with `grouped:true`). Both encoders consume
+// the same {@link GroupedResult}; a mutation test in serialize.test.ts
+// asserts both formats change together when the helper is mutated (AC-6).
+// Bounds: cap rows per group (50), cap groups (20), `(other)` overflow,
+// exact `*_total`/`*_shown`/`*_omitted` at both row and group levels — mirrors
+// the Wave 4 N4 clamp/emit pattern.
+const DEFAULT_MAX_ROWS_PER_GROUP = 50;
+const DEFAULT_MAX_GROUPS = 20;
+const OTHER_PREFIX = "(other)";
+/**
+ * Group rows by a 2-segment path prefix derived from each row (or taken from
+ * an explicit `qnPrefix` field). Cap rows per group + cap groups; fold
+ * overflow into `(other)`. Pure: no I/O.
+ *
+ * @param rows  Row-shaped objects (search results, impacted symbols, refs…).
+ * @param opts  Grouping options. `file` = field name holding the file path
+ *              (used to derive the prefix + representative file per group);
+ *              `qnPrefix` = explicit prefix field (wins over `file` when set).
+ */
+export function groupRowsByPrefix(rows, opts = {}) {
+    const fileField = opts.file;
+    const prefixField = opts.qnPrefix;
+    const maxRowsPerGroup = opts.maxRowsPerGroup ?? DEFAULT_MAX_ROWS_PER_GROUP;
+    const maxGroups = opts.maxGroups ?? DEFAULT_MAX_GROUPS;
+    const rowsTotal = rows.length;
+    const byPrefix = new Map();
+    for (const row of rows) {
+        const qnPrefix = resolvePrefix(row, prefixField, fileField);
+        let bucket = byPrefix.get(qnPrefix);
+        if (!bucket) {
+            bucket = { qnPrefix, rows: [], files: new Set() };
+            byPrefix.set(qnPrefix, bucket);
+        }
+        bucket.rows.push(row);
+        if (fileField) {
+            const f = row[fileField];
+            if (typeof f === "string")
+                bucket.files.add(f);
+        }
+    }
+    // Sort groups by row count desc, then qnPrefix asc (deterministic).
+    const sortedBuckets = Array.from(byPrefix.values()).sort((a, b) => b.rows.length - a.rows.length || (a.qnPrefix < b.qnPrefix ? -1 : a.qnPrefix > b.qnPrefix ? 1 : 0));
+    const groupsTotal = sortedBuckets.length;
+    // Group cap: fold overflow into `(other)`. Keep top (maxGroups-1) buckets
+    // so the `(other)` group occupies the last slot (total ≤ maxGroups).
+    let emitted;
+    let groupsOmitted = 0;
+    if (sortedBuckets.length <= maxGroups) {
+        emitted = sortedBuckets;
+    }
+    else {
+        const head = sortedBuckets.slice(0, Math.max(1, maxGroups - 1));
+        const tail = sortedBuckets.slice(Math.max(1, maxGroups - 1));
+        groupsOmitted = tail.length;
+        const otherRows = [];
+        const otherFiles = new Set();
+        for (const b of tail) {
+            otherRows.push(...b.rows);
+            if (fileField)
+                for (const f of b.files)
+                    otherFiles.add(f);
+        }
+        const otherBucket = {
+            qnPrefix: OTHER_PREFIX,
+            rows: otherRows,
+            files: otherFiles,
+        };
+        emitted = [...head, otherBucket];
+    }
+    // Per-group row cap + counts.
+    let rowsShown = 0;
+    let rowsOmitted = 0;
+    const groups = emitted.map((b) => {
+        const shownRows = b.rows.slice(0, maxRowsPerGroup);
+        const rowsShownHere = shownRows.length;
+        const rowsOmittedHere = b.rows.length - rowsShownHere;
+        rowsShown += rowsShownHere;
+        rowsOmitted += rowsOmittedHere;
+        // Representative file only when the group spans a single file.
+        let file;
+        if (fileField && b.files.size === 1)
+            file = Array.from(b.files)[0];
+        return {
+            qnPrefix: b.qnPrefix,
+            file,
+            rows: shownRows,
+            rows_shown: rowsShownHere,
+            rows_omitted: rowsOmittedHere,
+        };
+    });
+    return {
+        rows_total: rowsTotal,
+        rows_shown: rowsShown,
+        rows_omitted: rowsOmitted,
+        groups_total: groupsTotal,
+        groups_shown: groups.length,
+        groups_omitted: groupsOmitted,
+        groups,
+    };
+}
+/**
+ * Derive a 2-segment path prefix for a row. Priority:
+ *   1. Explicit `prefixField` value (when set on the row).
+ *   2. `fileField` value → `twoSegmentPrefix`.
+ *   3. `(other)` when neither resolves.
+ */
+function resolvePrefix(row, prefixField, fileField) {
+    if (prefixField) {
+        const v = row[prefixField];
+        if (typeof v === "string" && v.length > 0)
+            return v;
+    }
+    if (fileField) {
+        const f = row[fileField];
+        if (typeof f === "string" && f.length > 0)
+            return twoSegmentPrefix(f);
+    }
+    return OTHER_PREFIX;
+}
+/**
+ * Extract the 2-segment path prefix: drop the filename (last segment), then
+ * keep up to 2 leading directory segments. Same heuristic as
+ * `impact-analysis.ts#twoSegmentPrefix` so the rollup is consistent across
+ * tools (FR-03 parity).
+ *
+ *   `path/to/file.ts`   → `path/to`
+ *   `a/b/c/d.ts`        → `a/b`
+ *   `src/a.ts`          → `src`
+ *   `root.ts`           → `root.ts`
+ */
+export function twoSegmentPrefix(filePath) {
+    if (!filePath)
+        return filePath;
+    const slash = filePath.lastIndexOf("/");
+    if (slash < 0)
+        return filePath;
+    const dir = filePath.slice(0, slash);
+    const parts = dir.split("/");
+    if (parts.length <= 2)
+        return dir;
+    return parts.slice(0, 2).join("/");
+}
+/**
+ * Render a {@link GroupedResult} as a text-indented tree string (AD-W5-011).
+ * Each group is a header line `prefix (shown/total rows)` followed by its
+ * rows indented two spaces. Counts are surfaced so a caller can see
+ * truncation without parsing JSON.
+ */
+export function groupedToTree(grouped) {
+    const lines = [];
+    lines.push(`rows: ${grouped.rows_shown}/${grouped.rows_total} (omitted ${grouped.rows_omitted})`);
+    lines.push(`groups: ${grouped.groups_shown}/${grouped.groups_total} (omitted ${grouped.groups_omitted})`);
+    for (const g of grouped.groups) {
+        const fileSuffix = g.file ? `  [${g.file}]` : "";
+        lines.push(`${g.qnPrefix} (${g.rows_shown}/${g.rows_shown + g.rows_omitted} rows)${fileSuffix}`);
+        for (const row of g.rows) {
+            lines.push(`  ${stringifyRow(row)}`);
+        }
+    }
+    return lines.join("\n");
+}
+/** Compact one-line JSON-ish rendering of a row for the tree encoder. */
+function stringifyRow(row) {
+    try {
+        return JSON.stringify(row);
+    }
+    catch {
+        return String(row);
+    }
+}
+/**
+ * Flat tree fallback (no grouping): render the projected data as a text
+ * block. Arrays become one line per element; objects become a single JSON
+ * line. Keeps `format:"tree"` always returning a string per the contract.
+ */
+function treeFlat(projected) {
+    if (Array.isArray(projected)) {
+        return projected.map((r) => stringifyRow(r)).join("\n");
+    }
+    try {
+        return JSON.stringify(projected);
+    }
+    catch {
+        return String(projected);
+    }
+}
+//# sourceMappingURL=serialize.js.map

package/dist/tools/serialize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"serialize.js","sourceRoot":"","sources":["../../src/tools/serialize.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,mBAAmB,CAAC;AA2BrD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAAe,EACf,OAAsB,EAAE;IAExB,MAAM,SAAS,GAAG,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACrD,0EAA0E;IAC1E,mEAAmE;IACnE,wCAAwC;IACxC,MAAM,YAAY,GAChB,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,CAAC;QAC7E,IAAI,CAAC,OAAO;QACZ,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAC3B,IAAI,YAAY,EAAE,CAAC;QACjB,MAAM,OAAO,GAAG,iBAAiB,CAAC,SAAyB,EAAE,IAAI,CAAC,OAAQ,CAAC,CAAC;QAC5E,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YAC3B,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QACzD,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;IAC1C,CAAC;IACD,yEAAyE;IACzE,6EAA6E;IAC7E,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;QAC3B,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;IACtD,CAAC;IACD,OAAO;QACL,OAAO,EAAE,IAAI;QACb,IAAI,EAAE,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS;KAC7D,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,aAAa,CAAC,IAAa,EAAE,MAAiB;IAC5D,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAChD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;IACnD,CAAC;IACD,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAE3D,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,MAAM,GAAG,GAAG,IAA+B,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC;YAAE,SAAS,CAAC,iCAAiC;QAC/D,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;QACpB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,qEAAqE;YACrE,oEAAoE;YACpE,GAAG,CAAC,IAAI,CAAC,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;YACjC,SAAS;QACX,CAAC;QACD,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,SAAS,KAAK,SAAS;YAAE,SAAS;QACtC,2DAA2D;QAC3D,mEAAmE;QACnE,GAAG,CAAC,IAAI,CAAC,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC;IACpD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAc;IAC9C,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAE5C,sEAAsE;IACtE,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC7B,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAE3B,4DAA4D;IAC5D,IAAI,SAAS,GAAG,OAAO,CAAC;IACxB,IAAI,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC7C,CAAC;IAED,mDAAmD;IACnD,IACE,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QACtD,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EACtD,CAAC;QACD,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC/B,CAAC;QAAC,MAAM,CAAC;YACP,yEAAyE;YACzE,kEAAkE;YAClE,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,OAAO,SAAS,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AACnD,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAS,WAAW,CAAC,KAAc,EAAE,QAAkB;IACrD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACxC,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,SAAS,CAAC;IAClE,MAAM,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,QAAQ,CAAC;IACjC,MAAM,GAAG,GAAG,KAAgC,CAAC;IAC7C,IAAI,CAAC,CAAC,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IACrC,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,6EAA6E;QAC7E,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YACzB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;IACxB,CAAC;IACD,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACvC,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC1C,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,eAAe,CAAC,CAAU,EAAE,CAAU;IAC7C,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,CAAC,CAAC;IAC9B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;QACzC,MAAM,GAAG,GAAc,EAAE,CAAC;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,GAAG,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,IACE,CAAC,KAAK,IAAI;QACV,CAAC,KAAK,IAAI;QACV,OAAO,CAAC,KAAK,QAAQ;QACrB,OAAO,CAAC,KAAK,QAAQ;QACrB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACjB,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EACjB,CAAC;QACD,OAAO,EAAE,GAAI,CAA6B,EAAE,GAAI,CAA6B,EAAE,CAAC;IAClF,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,iFAAiF;AACjF,EAAE;AACF,2EAA2E;AAC3E,6EAA6E;AAC7E,uEAAuE;AACvE,0EAA0E;AAC1E,wEAAwE;AACxE,+EAA+E;AAC/E,oCAAoC;AAEpC,MAAM,0BAA0B,GAAG,EAAE,CAAC;AACtC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,MAAM,YAAY,GAAG,SAAS,CAAC;AAE/B;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAA2B,EAC3B,OAAiC,EAAE;IAEnC,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;IAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC;IAClC,MAAM,eAAe,GAAG,IAAI,CAAC,eAAe,IAAI,0BAA0B,CAAC;IAC3E,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,kBAAkB,CAAC;IAEvD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC;IAK9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC5D,IAAI,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,GAAG,EAAU,EAAE,CAAC;YAC1D,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACjC,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;YACzB,IAAI,OAAO,CAAC,KAAK,QAAQ;gBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,oEAAoE;IACpE,MAAM,aAAa,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CACtD,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAC5G,CAAC;IACF,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC;IAEzC,0EAA0E;IAC1E,qEAAqE;IACrE,IAAI,OAAiB,CAAC;IACtB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,IAAI,aAAa,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;QACtC,OAAO,GAAG,aAAa,CAAC;IAC1B,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,IAAI,GAAG,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7D,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,SAAS;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK;oBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,MAAM,WAAW,GAAW;YAC1B,QAAQ,EAAE,YAAY;YACtB,IAAI,EAAE,SAAS;YACf,KAAK,EAAE,UAAU;SAClB,CAAC;QACF,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,WAAW,CAAC,CAAC;IACnC,CAAC;IAED,8BAA8B;IAC9B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,MAAM,GAAmB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/C,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC;QACnD,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC;QACvC,MAAM,eAAe,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC;QACtD,SAAS,IAAI,aAAa,CAAC;QAC3B,WAAW,IAAI,eAAe,CAAC;QAC/B,+DAA+D;QAC/D,IAAI,IAAwB,CAAC;QAC7B,IAAI,SAAS,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,OAAO;YACL,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,IAAI;YACJ,IAAI,EAAE,SAAS;YACf,UAAU,EAAE,aAAa;YACzB,YAAY,EAAE,eAAe;SAC9B,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,UAAU,EAAE,SAAS;QACrB,UAAU,EAAE,SAAS;QACrB,YAAY,EAAE,WAAW;QACzB,YAAY,EAAE,WAAW;QACzB,YAAY,EAAE,MAAM,CAAC,MAAM;QAC3B,cAAc,EAAE,aAAa;QAC7B,MAAM;KACP,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,SAAS,aAAa,CACpB,GAAe,EACf,WAA+B,EAC/B,SAA6B;IAE7B,IAAI,WAAW,EAAE,CAAC;QAChB,MAAM,CAAC,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC;QAC3B,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,SAAS,EAAE,CAAC;QACd,MAAM,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;QACzB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACxE,CAAC;IACD,OAAO,YAAY,CAAC;AACtB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAgB;IAC/C,IAAI,CAAC,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAC/B,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IAC/B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,GAAG,CAAC;IAClC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACrC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,aAAa,CAAC,OAAsB;IAClD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,CAAC,IAAI,CACR,SAAS,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,aAAa,OAAO,CAAC,YAAY,GAAG,CACtF,CAAC;IACF,KAAK,CAAC,IAAI,CACR,WAAW,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,YAAY,aAAa,OAAO,CAAC,cAAc,GAAG,CAC9F,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QACjD,KAAK,CAAC,IAAI,CACR,GAAG,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,YAAY,SAAS,UAAU,EAAE,CACrF,CAAC;QACF,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,KAAK,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,yEAAyE;AACzE,SAAS,YAAY,CAAC,GAAe;IACnC,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CAAC,SAAkB;IAClC,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7B,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CAAe,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IACD,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IACnC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3B,CAAC;AACH,CAAC"}

package/dist/tools/store_memory.d.ts

@@ -0,0 +1,78 @@
+/**
+ * Store Memory Tool
+ *
+ * Thin MCP tool layer — validates input and delegates to MemoryController.
+ * All business logic lives in controllers/memory-controller.ts.
+ */
+import { IToolHandler, ToolResponse } from "@massa-ai/shared";
+export declare class StoreMemoryTool implements IToolHandler {
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            content: {
+                type: string;
+                description: string;
+            };
+            type: {
+                type: string;
+                enum: string[];
+                description: string;
+            };
+            userId: {
+                type: string;
+                description: string;
+            };
+            sessionId: {
+                type: string;
+                description: string;
+            };
+            projectId: {
+                type: string;
+                description: string;
+            };
+            agentId: {
+                type: string;
+                description: string;
+            };
+            importance: {
+                type: string;
+                description: string;
+                default: number;
+            };
+            tags: {
+                type: string;
+                items: {
+                    type: string;
+                };
+                description: string;
+            };
+            linkTo: {
+                type: string;
+                items: {
+                    type: string;
+                };
+                description: string;
+            };
+            format: {
+                type: string;
+                enum: string[];
+                description: string;
+                default: string;
+            };
+            fields: {
+                type: string;
+                items: {
+                    type: string;
+                };
+                description: string;
+            };
+        };
+        required: string[];
+    };
+    private controller;
+    constructor();
+    handle(params: unknown): Promise<ToolResponse>;
+}
+//# sourceMappingURL=store_memory.d.ts.map

package/dist/tools/store_memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"store_memory.d.ts","sourceRoot":"","sources":["../../src/tools/store_memory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,YAAY,EAAE,YAAY,EAAc,MAAM,kBAAkB,CAAC;AAmB1E,qBAAa,eAAgB,YAAW,YAAY;IAClD,IAAI,SAAkB;IACtB,WAAW,SAAuE;IAClF,WAAW;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MA6CT;IAEF,OAAO,CAAC,UAAU,CAAmB;;IAM/B,MAAM,CAAC,MAAM,EAAE,OAAO,GAAG,OAAO,CAAC,YAAY,CAAC;CAqCrD"}

package/dist/tools/store_memory.js

@@ -0,0 +1,87 @@
+/**
+ * Store Memory Tool
+ *
+ * Thin MCP tool layer — validates input and delegates to MemoryController.
+ * All business logic lives in controllers/memory-controller.ts.
+ */
+import { logger } from "@massa-ai/shared";
+import { MemoryController } from "../controllers/memory-controller.js";
+import { serializeToolResponse } from "./serialize.js";
+export class StoreMemoryTool {
+    name = "store_memory";
+    description = "Store memory in the hierarchical memory system (local PostgreSQL)";
+    inputSchema = {
+        type: "object",
+        properties: {
+            content: { type: "string", description: "Content to store" },
+            type: {
+                type: "string",
+                enum: ["critical", "conversation", "code", "decision", "pattern"],
+                description: "Type of memory",
+            },
+            userId: { type: "string", description: "User ID" },
+            sessionId: { type: "string", description: "Session ID" },
+            projectId: { type: "string", description: "Project ID" },
+            agentId: {
+                type: "string",
+                description: "Agent ID (e.g., orchestrator, implementer, architect, optimizer)",
+            },
+            importance: {
+                type: "number",
+                description: "Importance score (0-1)",
+                default: 0.5,
+            },
+            tags: {
+                type: "array",
+                items: { type: "string" },
+                description: "Tags for categorization",
+            },
+            linkTo: {
+                type: "array",
+                items: { type: "string" },
+                description: "Memory IDs to explicitly link this memory to (creates RELATES_TO edges)",
+            },
+            format: {
+                type: "string",
+                enum: ["json", "toon"],
+                description: "Output format (json or toon)",
+                default: "toon",
+            },
+            fields: {
+                type: "array",
+                items: { type: "string" },
+                description: "Projection — keep only these keys (dotted paths supported, e.g. ['nodes.symbol']). Absent/empty → full data.",
+            },
+        },
+        required: ["content", "type"],
+    };
+    controller;
+    constructor() {
+        this.controller = MemoryController.getInstance();
+    }
+    async handle(params) {
+        const { content, type, userId, sessionId, projectId, agentId, importance, tags, linkTo, format = "toon", fields, } = params;
+        try {
+            const result = await this.controller.store({
+                content,
+                type,
+                userId,
+                sessionId,
+                projectId,
+                agentId,
+                importance,
+                tags,
+                linkTo,
+            });
+            return serializeToolResponse(result, { format, fields });
+        }
+        catch (error) {
+            logger.error("Failed to store memory", error, { type });
+            return {
+                success: false,
+                error: `Failed to store memory: ${error instanceof Error ? error.message : String(error)}`,
+            };
+        }
+    }
+}
+//# sourceMappingURL=store_memory.js.map

package/dist/tools/store_memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store_memory.js","sourceRoot":"","sources":["../../src/tools/store_memory.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,MAAM,qCAAqC,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,gBAAgB,CAAC;AAgBvD,MAAM,OAAO,eAAe;IAC1B,IAAI,GAAG,cAAc,CAAC;IACtB,WAAW,GAAG,mEAAmE,CAAC;IAClF,WAAW,GAAG;QACZ,IAAI,EAAE,QAAQ;QACd,UAAU,EAAE;YACV,OAAO,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,kBAAkB,EAAE;YAC5D,IAAI,EAAE;gBACJ,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,UAAU,EAAE,cAAc,EAAE,MAAM,EAAE,UAAU,EAAE,SAAS,CAAC;gBACjE,WAAW,EAAE,gBAAgB;aAC9B;YACD,MAAM,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE;YAClD,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE;YACxD,SAAS,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,YAAY,EAAE;YACxD,OAAO,EAAE;gBACP,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,kEAAkE;aAChF;YACD,UAAU,EAAE;gBACV,IAAI,EAAE,QAAQ;gBACd,WAAW,EAAE,wBAAwB;gBACrC,OAAO,EAAE,GAAG;aACb;YACD,IAAI,EAAE;gBACJ,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACzB,WAAW,EAAE,yBAAyB;aACvC;YACD,MAAM,EAAE;gBACN,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACzB,WAAW,EAAE,yEAAyE;aACvF;YACD,MAAM,EAAE;gBACN,IAAI,EAAE,QAAQ;gBACd,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;gBACtB,WAAW,EAAE,8BAA8B;gBAC3C,OAAO,EAAE,MAAM;aAChB;YACD,MAAM,EAAE;gBACN,IAAI,EAAE,OAAO;gBACb,KAAK,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE;gBACzB,WAAW,EACT,8GAA8G;aACjH;SACF;QACD,QAAQ,EAAE,CAAC,SAAS,EAAE,MAAM,CAAC;KAC9B,CAAC;IAEM,UAAU,CAAmB;IAErC;QACE,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC,WAAW,EAAE,CAAC;IACnD,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,MAAe;QAC1B,MAAM,EACJ,OAAO,EACP,IAAI,EACJ,MAAM,EACN,SAAS,EACT,SAAS,EACT,OAAO,EACP,UAAU,EACV,IAAI,EACJ,MAAM,EACN,MAAM,GAAG,MAAM,EACf,MAAM,GACP,GAAG,MAA2B,CAAC;QAEhC,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;gBACzC,OAAO;gBACP,IAAI;gBACJ,MAAM;gBACN,SAAS;gBACT,SAAS;gBACT,OAAO;gBACP,UAAU;gBACV,IAAI;gBACJ,MAAM;aACP,CAAC,CAAC;YAEH,OAAO,qBAAqB,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;QAC3D,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,CAAC,KAAK,CAAC,wBAAwB,EAAE,KAAc,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;YACjE,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,KAAK,EAAE,2BAA2B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;aAC3F,CAAC;QACJ,CAAC;IACH,CAAC;CACF"}

package/dist/tools/trace_path.d.ts

@@ -0,0 +1,98 @@
+/**
+ * Trace Path Tool (trace_path)
+ *
+ * Trace paths through the code graph from a seed symbol, following typed
+ * structural edges (CALLS / DATA_FLOWS / HTTP_CALLS / EMITS / LISTENS).
+ *
+ * Modes:
+ *   - calls        → follow CALL edges (who calls whom)
+ *   - data_flow    → follow CALL + DATA_FLOW edges (value propagation)
+ *   - cross_service→ follow HTTP_CALL + EMITS + LISTENS + DATA_FLOW edges
+ *   - all          → follow every typed edge
+ *
+ * Direction: outbound (what the seed reaches) | inbound (what reaches the
+ * seed) | both. Default outbound.
+ *
+ * Use INSTEAD OF grep for callers, dependencies, impact analysis, or data
+ * flow tracing — it walks the indexed graph with cycle + depth bounds.
+ */
+import { IToolHandler, ToolResponse } from "@massa-ai/shared";
+export declare class TracePathTool implements IToolHandler {
+    name: string;
+    description: string;
+    inputSchema: {
+        type: string;
+        properties: {
+            function_name: {
+                type: string;
+                description: string;
+            };
+            symbol: {
+                type: string;
+                description: string;
+            };
+            qualifiedName: {
+                type: string;
+                description: string;
+            };
+            projectId: {
+                type: string;
+                description: string;
+            };
+            direction: {
+                type: string;
+                enum: string[];
+                default: string;
+                description: string;
+            };
+            mode: {
+                type: string;
+                enum: string[];
+                default: string;
+                description: string;
+            };
+            depth: {
+                type: string;
+                description: string;
+                default: number;
+            };
+            include_tests: {
+                type: string;
+                default: boolean;
+                description: string;
+            };
+            edge_types: {
+                type: string;
+                items: {
+                    type: string;
+                };
+                description: string;
+            };
+            deadline_ms: {
+                type: string;
+                default: number;
+                description: string;
+            };
+            format: {
+                type: string;
+                enum: string[];
+                description: string;
+                default: string;
+            };
+            fields: {
+                type: string;
+                items: {
+                    type: string;
+                };
+                description: string;
+            };
+            ifNoneMatch: {
+                type: string;
+                description: string;
+            };
+        };
+        required: string[];
+    };
+    handle(params: unknown): Promise<ToolResponse>;
+}
+//# sourceMappingURL=trace_path.d.ts.map