@massa-ai/core 1.2.1

package/dist/services/symbol/trace-path.d.ts

@@ -0,0 +1,164 @@
+/**
+ * Trace Path Service (Phase 4 D2)
+ *
+ * Graph traversal over the typed structural edges emitted by D1
+ * (CALLS / DATA_FLOWS / HTTP_CALLS / EMITS / LISTENS / IMPORTS).
+ *
+ * Given a seed symbol, performs a bounded, cycle-guarded BFS over the
+ * edge graph filtered by `mode` (which edge types to follow) and
+ * `direction` (outbound = what the seed reaches; inbound = what reaches
+ * the seed; both = run each separately).
+ *
+ * Output is agent-consumable: a set of nodes (symbols with file:line)
+ * and edges (type + route/event/param metadata), plus readable call
+ * chains reconstructed from the BFS predecessor map.
+ *
+ * Cost is bounded by `maxDepth` (default 3, hard cap MAX_DEPTH) and a
+ * visited set keyed on (FQN, depth) so cycles cannot loop forever.
+ */
+import type { EdgeType } from "./symbol-graph.service.js";
+import { type DefinitionLookupResult } from "./definition-lookup.js";
+export type TraceDirection = "outbound" | "inbound" | "both";
+export type TraceMode = "calls" | "data_flow" | "cross_service" | "all";
+export interface TracePathOptions {
+    /** Seed symbol — a bare name resolved against definitions, OR a FQN
+     * ('rel/path.ts#Name') used directly. */
+    symbol: string;
+    /** Alias kept for clarity; merged with `symbol`. */
+    function_name?: string;
+    /** Explicit FQN — when set, skips name resolution entirely. */
+    qualifiedName?: string;
+    projectId: string;
+    direction?: TraceDirection;
+    mode?: TraceMode;
+    /** Max BFS depth. Default 3, hard-capped at MAX_DEPTH. */
+    depth?: number;
+    /** Include test files in the traversal. Default false. */
+    include_tests?: boolean;
+    /** Explicit edge-type override; wins over `mode`. */
+    edge_types?: EdgeType[];
+    /**
+     * Wall-clock budget (ms) for the traversal. If the BFS exceeds this it aborts
+     * with `truncated=true` and whatever nodes/edges it has collected so far.
+     * Additive to MAX_DEPTH / MAX_NODES. Default 5s (generous vs typical sub-
+     * second walks). Injectable clock is for deterministic tests.
+     */
+    deadlineMs?: number;
+    /** Injectable clock (defaults to Date.now) for deterministic deadline tests. */
+    now?: () => number;
+}
+export interface TraceNode {
+    /** Stable symbol id: either the resolved FQN or, for unresolved callees,
+     * the bare name as it appeared in source. */
+    fqn: string;
+    name: string;
+    file?: string;
+    line?: number;
+    /** Hop distance from the nearest seed (0 for seeds). */
+    depth: number;
+    /** True when this node lives in a test file. */
+    isTest?: boolean;
+    /** True when this node is one of the BFS seeds. */
+    isSeed?: boolean;
+}
+export interface TraceEdge {
+    type: EdgeType;
+    from: string;
+    to: string;
+    fromFile: string;
+    fromLine: number;
+    /** Typed-edge metadata (route, event, paramIndex, argName, callerFqn, method...). */
+    meta?: Record<string, unknown> | null;
+}
+export interface TracePathResult {
+    projectId: string;
+    symbol: string;
+    mode: TraceMode;
+    direction: TraceDirection;
+    /** Edge types actually used for the traversal (resolved mode/explicit). */
+    edgeTypes: EdgeType[];
+    /** Seeds the BFS started from (may be >1 for ambiguous name). */
+    seeds: string[];
+    nodes: TraceNode[];
+    edges: TraceEdge[];
+    /** Readable call chains (one per reached leaf), e.g. "a() -> b() -> c()". */
+    chains: string[];
+    truncated: boolean;
+    /**
+     * N4: pre-clamp total of unique node FQNs (the count we would have returned
+     * if MAX_NODES did not apply). `nodes_shown = nodes.length` and
+     * `nodes_omitted = nodes_total - nodes_shown` are derivable on the same
+     * code path as the displayed list.
+     */
+    nodes_total: number;
+    nodes_shown: number;
+    nodes_omitted: number;
+    /** Exact FQN lookup result; ambiguity is explicit and always has zero traversal. */
+    identityResolution?: Exclude<DefinitionLookupResult, {
+        status: "bare";
+    }>;
+}
+export declare class TracePathService {
+    private readonly identityLookup;
+    private static instance;
+    constructor(identityLookup?: import("./definition-lookup.js").DefinitionLookupService);
+    static getInstance(): TracePathService;
+    /**
+     * Resolve the seed symbol to one or more FQNs.
+     *
+     * Precedence:
+     *   1. Explicit `qualifiedName` (used verbatim — single seed).
+     *   2. `symbol`/`function_name` that looks like a FQN (contains '#').
+     *   3. Name lookup against `findDefinitionsByName` → all matches (union BFS).
+     *
+     * Returns `[]` when nothing resolves; the caller surfaces a not-found hint.
+     */
+    resolveSeeds(projectId: string, opts: TracePathOptions): Promise<{
+        fqn: string;
+        name: string;
+        file?: string;
+        line?: number;
+    }[]>;
+    private resolveSeedResult;
+    /**
+     * Run the traversal. See {@link TracePathOptions} / {@link TracePathResult}.
+     */
+    tracePath(opts: TracePathOptions): Promise<TracePathResult>;
+    /**
+     * Breadth-first traversal. `addNode`/`addEdge` mutators are injected so the
+     * outbound and inbound passes share one node/edge set. The visited set is
+     * keyed on FQN (not FQN+depth) so each symbol is expanded at most once —
+     * depth is still tracked per-node for reporting.
+     *
+     * Outbound: follow edges where the seed-side symbol is the `fromSymbol`
+     * (caller / source). The reached node is the edge's `targetFqn`.
+     * Inbound: follow edges where the seed-side symbol is the `toSymbol`
+     * (callee / target). The reached node is the edge's source FQN.
+     */
+    private bfs;
+    /**
+     * For an inbound edge, the "other end" is the caller. The D1 extractor stamps
+     * `meta.callerFqn` on CALL edges; fall back to the edge's symbol name when no
+     * FQN is recorded (e.g. cross-file calls that did not resolve).
+     */
+    private extractCallerFqn;
+    /**
+     * Build a synthetic leaf id for edges whose callee is not a project symbol
+     * (HTTP routes, event names, external globals). Keeps the edge + its
+     * meaningful metadata in the result instead of dropping it.
+     */
+    private syntheticTarget;
+    /** Derive a short display name from a FQN ('path/file.ts#Name' → 'Name'). */
+    private fqnToName;
+    /**
+     * Reconstruct readable call chains (root → leaf) from the edge set, scoped to
+     * the seed roots. A leaf is any node that is never a `from` in the edge set.
+     *
+     * Bounded: the DFS carries a walk budget (MAX_CHAIN_WALKS) and stops as soon
+     * as enough chains are collected, so a dense hub topology cannot explode the
+     * recursion before the final `slice(0, 50)` cap.
+     */
+    private buildChains;
+}
+export declare const tracePathService: TracePathService;
+//# sourceMappingURL=trace-path.d.ts.map

package/dist/services/symbol/trace-path.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"trace-path.d.ts","sourceRoot":"","sources":["../../../src/services/symbol/trace-path.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAKH,OAAO,KAAK,EAAE,QAAQ,EAAc,MAAM,2BAA2B,CAAC;AACtE,OAAO,EAA2B,KAAK,sBAAsB,EAAE,MAAM,wBAAwB,CAAC;AAI9F,MAAM,MAAM,cAAc,GAAG,UAAU,GAAG,SAAS,GAAG,MAAM,CAAC;AAC7D,MAAM,MAAM,SAAS,GAAG,OAAO,GAAG,WAAW,GAAG,eAAe,GAAG,KAAK,CAAC;AAExE,MAAM,WAAW,gBAAgB;IAC/B;6CACyC;IACzC,MAAM,EAAE,MAAM,CAAC;IACf,oDAAoD;IACpD,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,+DAA+D;IAC/D,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,cAAc,CAAC;IAC3B,IAAI,CAAC,EAAE,SAAS,CAAC;IACjB,0DAA0D;IAC1D,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0DAA0D;IAC1D,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,qDAAqD;IACrD,UAAU,CAAC,EAAE,QAAQ,EAAE,CAAC;IACxB;;;;;OAKG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,gFAAgF;IAChF,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,SAAS;IACxB;iDAC6C;IAC7C,GAAG,EAAE,MAAM,CAAC;IACZ,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,wDAAwD;IACxD,KAAK,EAAE,MAAM,CAAC;IACd,gDAAgD;IAChD,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,mDAAmD;IACnD,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAED,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;IACjB,qFAAqF;IACrF,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI,CAAC;CACvC;AAED,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,SAAS,CAAC;IAChB,SAAS,EAAE,cAAc,CAAC;IAC1B,2EAA2E;IAC3E,SAAS,EAAE,QAAQ,EAAE,CAAC;IACtB,iEAAiE;IACjE,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,6EAA6E;IAC7E,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,OAAO,CAAC;IACnB;;;;;OAKG;IACH,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,oFAAoF;IACpF,kBAAkB,CAAC,EAAE,OAAO,CAAC,sBAAsB,EAAE;QAAE,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC1E;AAkCD,qBAAa,gBAAgB;IAGf,OAAO,CAAC,QAAQ,CAAC,cAAc;IAF3C,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAiC;gBAE3B,cAAc,2DAA0B;IAErE,MAAM,CAAC,WAAW,IAAI,gBAAgB;IAOtC;;;;;;;;;OASG;IACG,YAAY,CAChB,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,gBAAgB,GACrB,OAAO,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;YAI3D,iBAAiB;IA2B/B;;OAEG;IACG,SAAS,CAAC,IAAI,EAAE,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC;IA0IjE;;;;;;;;;;OAUG;YACW,GAAG;IA+HjB;;;;OAIG;IACH,OAAO,CAAC,gBAAgB;IAQxB;;;;OAIG;IACH,OAAO,CAAC,eAAe;IASvB,6EAA6E;IAC7E,OAAO,CAAC,SAAS;IAIjB;;;;;;;OAOG;IACH,OAAO,CAAC,WAAW;CAwDpB;AAED,eAAO,MAAM,gBAAgB,kBAAiC,CAAC"}

package/dist/services/symbol/trace-path.js

@@ -0,0 +1,448 @@
+/**
+ * Trace Path Service (Phase 4 D2)
+ *
+ * Graph traversal over the typed structural edges emitted by D1
+ * (CALLS / DATA_FLOWS / HTTP_CALLS / EMITS / LISTENS / IMPORTS).
+ *
+ * Given a seed symbol, performs a bounded, cycle-guarded BFS over the
+ * edge graph filtered by `mode` (which edge types to follow) and
+ * `direction` (outbound = what the seed reaches; inbound = what reaches
+ * the seed; both = run each separately).
+ *
+ * Output is agent-consumable: a set of nodes (symbols with file:line)
+ * and edges (type + route/event/param metadata), plus readable call
+ * chains reconstructed from the BFS predecessor map.
+ *
+ * Cost is bounded by `maxDepth` (default 3, hard cap MAX_DEPTH) and a
+ * visited set keyed on (FQN, depth) so cycles cannot loop forever.
+ */
+import { logger } from "@massa-ai/shared";
+import { symbolGraphService } from "./symbol-graph.service.js";
+import { definitionLookupService } from "./definition-lookup.js";
+// ─── Constants ────────────────────────────────────────────────────────────────
+const DEFAULT_DEPTH = 3;
+const MAX_DEPTH = 6;
+/** Safety ceiling on total visited nodes so a pathological fan-out graph
+ * cannot exhaust memory/time. */
+const MAX_NODES = 2000;
+/**
+ * Default wall-clock budget for a single tracePath() call. Additive to
+ * MAX_DEPTH / MAX_NODES: a runaway traversal aborts with partial results
+ * instead of hanging the agent. 5s is generous vs typical sub-second walks,
+ * so unset behaviour is unchanged for normal queries.
+ */
+const DEFAULT_TRAVERSAL_DEADLINE_MS = 5_000;
+/** mode → edge types to follow. */
+const MODE_EDGE_TYPES = {
+    // calls: direct function/method call edges only.
+    calls: ["call"],
+    // data_flow: calls + value-propagation edges (identifier args).
+    data_flow: ["call", "data_flow"],
+    // cross_service: HTTP + async (emit/listen) + data-flow hops that cross
+    // service boundaries. CALLS excluded — they stay in-process.
+    cross_service: ["http_call", "emit", "listen", "data_flow"],
+    // all: every typed edge.
+    all: ["call", "data_flow", "http_call", "emit", "listen", "import", "type_ref", "extend", "implement"],
+};
+const TEST_FILE_RE = /(^|\/)(test|tests|spec|specs|__tests__)(\/|$)|(\.|_|-)(test|spec)\.(t|j)sx?$/i;
+// ─── Service ──────────────────────────────────────────────────────────────────
+export class TracePathService {
+    identityLookup;
+    static instance = null;
+    constructor(identityLookup = definitionLookupService) {
+        this.identityLookup = identityLookup;
+    }
+    static getInstance() {
+        if (!TracePathService.instance) {
+            TracePathService.instance = new TracePathService();
+        }
+        return TracePathService.instance;
+    }
+    /**
+     * Resolve the seed symbol to one or more FQNs.
+     *
+     * Precedence:
+     *   1. Explicit `qualifiedName` (used verbatim — single seed).
+     *   2. `symbol`/`function_name` that looks like a FQN (contains '#').
+     *   3. Name lookup against `findDefinitionsByName` → all matches (union BFS).
+     *
+     * Returns `[]` when nothing resolves; the caller surfaces a not-found hint.
+     */
+    async resolveSeeds(projectId, opts) {
+        return (await this.resolveSeedResult(projectId, opts)).seeds;
+    }
+    async resolveSeedResult(projectId, opts) {
+        const explicit = opts.qualifiedName ?? ((opts.symbol?.indexOf("#") ?? -1) > 0 ? opts.symbol : undefined);
+        if (explicit) {
+            const lookup = await this.identityLookup.lookup(projectId, explicit);
+            return { identityResolution: lookup, seeds: lookup.status === "resolved" ? [{
+                        fqn: lookup.definition.id,
+                        name: lookup.definition.name,
+                        file: lookup.definition.file_path,
+                        line: lookup.definition.line_start,
+                    }] : [] };
+        }
+        const name = opts.symbol ?? opts.function_name;
+        if (!name)
+            return { seeds: [] };
+        try {
+            const lookup = await this.identityLookup.lookup(projectId, name);
+            const defs = lookup.status === "bare" ? lookup.definitions : [];
+            return { seeds: defs.map((d) => ({ fqn: d.id, name: d.name, file: d.file_path, line: d.line_start })) };
+        }
+        catch {
+            return { seeds: [] };
+        }
+    }
+    /**
+     * Run the traversal. See {@link TracePathOptions} / {@link TracePathResult}.
+     */
+    async tracePath(opts) {
+        const projectId = opts.projectId;
+        const direction = opts.direction ?? "outbound";
+        const mode = opts.mode ?? "calls";
+        const includeTests = opts.include_tests ?? false;
+        const requestedDepth = opts.depth ?? DEFAULT_DEPTH;
+        const depth = Math.max(0, Math.min(MAX_DEPTH, requestedDepth));
+        // Wall-clock deadline: an additive guard so a runaway traversal aborts with
+        // partial results instead of hanging. The default is generous; normal
+        // queries never reach it. The clock is injectable for deterministic tests.
+        const now = opts.now ?? Date.now;
+        const deadlineAt = now() + (opts.deadlineMs ?? DEFAULT_TRAVERSAL_DEADLINE_MS);
+        // Resolve edge types: explicit override > mode.
+        const edgeTypes = opts.edge_types && opts.edge_types.length > 0 ? opts.edge_types : MODE_EDGE_TYPES[mode];
+        // Resolve seeds.
+        const seedResult = await this.resolveSeedResult(projectId, opts);
+        const seedDefs = seedResult.seeds;
+        const seeds = seedDefs.map((s) => s.fqn);
+        const empty = {
+            projectId,
+            symbol: opts.qualifiedName ?? opts.symbol ?? opts.function_name ?? "",
+            mode,
+            direction,
+            edgeTypes,
+            seeds,
+            nodes: [],
+            edges: [],
+            chains: [],
+            truncated: false,
+            nodes_total: 0,
+            nodes_shown: 0,
+            nodes_omitted: 0,
+            ...(seedResult.identityResolution ? { identityResolution: seedResult.identityResolution } : {}),
+        };
+        if (seeds.length === 0)
+            return empty;
+        // Outbound and inbound are run independently (distinct edge queries), then
+        // merged into a single node/edge set. `both` runs both halves.
+        const doOutbound = direction === "outbound" || direction === "both";
+        const doInbound = direction === "inbound" || direction === "both";
+        const nodes = new Map();
+        const edges = [];
+        const seenEdge = new Set();
+        let truncated = false;
+        // N4: pre-clamp total of unique node FQNs. Increment on every NEW FQN
+        // encountered (regardless of whether MAX_NODES let us store it) so
+        // nodes_omitted = nodes_total - nodes_shown is derivable.
+        let nodesTotal = 0;
+        const addNode = (n) => {
+            if (nodes.has(n.fqn))
+                return true;
+            // New FQN — count it toward the pre-clamp total even if we reject it.
+            nodesTotal++;
+            if (nodes.size >= MAX_NODES) {
+                truncated = true;
+                return false;
+            }
+            nodes.set(n.fqn, n);
+            return true;
+        };
+        const addEdge = (e) => {
+            const key = `${e.type}|${e.from}|${e.to}|${e.fromFile}:${e.fromLine}`;
+            if (seenEdge.has(key))
+                return;
+            seenEdge.add(key);
+            edges.push(e);
+        };
+        // Seed nodes at depth 0.
+        const seedLookup = new Map(seedDefs.map((s) => [s.fqn, s]));
+        for (const fqn of seeds) {
+            const def = seedLookup.get(fqn);
+            const ok = addNode({
+                fqn,
+                name: def.name,
+                file: def.file,
+                line: def.line,
+                depth: 0,
+                isSeed: true,
+                isTest: def.file ? TEST_FILE_RE.test(def.file) : false,
+            });
+            if (!ok)
+                break;
+        }
+        if (doOutbound) {
+            await this.bfs(projectId, seeds, edgeTypes, "outbound", depth, includeTests, addNode, addEdge, () => (truncated = true), deadlineAt, now);
+        }
+        if (doInbound) {
+            await this.bfs(projectId, seeds, edgeTypes, "inbound", depth, includeTests, addNode, addEdge, () => (truncated = true), deadlineAt, now);
+        }
+        // Drop test-file nodes when the caller excluded tests (seeds are always kept).
+        const finalNodes = Array.from(nodes.values()).filter((n) => includeTests || !n.isTest || n.isSeed);
+        // Build readable chains from the edge predecessor relationships.
+        const chains = this.buildChains(seeds, edges);
+        const nodesShown = finalNodes.length;
+        const nodesOmitted = Math.max(0, nodesTotal - nodesShown);
+        const result = {
+            projectId,
+            symbol: opts.qualifiedName ?? opts.symbol ?? opts.function_name ?? "",
+            mode,
+            direction,
+            edgeTypes,
+            seeds,
+            nodes: finalNodes,
+            edges,
+            chains,
+            truncated,
+            nodes_total: nodesTotal,
+            nodes_shown: nodesShown,
+            nodes_omitted: nodesOmitted,
+            ...(seedResult.identityResolution ? { identityResolution: seedResult.identityResolution } : {}),
+        };
+        logger.debug("TracePathService: trace complete", {
+            projectId,
+            seeds: seeds.length,
+            nodes: finalNodes.length,
+            edges: edges.length,
+            chains: chains.length,
+            truncated,
+        });
+        return result;
+    }
+    // ─── BFS core ───────────────────────────────────────────────────────────────
+    /**
+     * Breadth-first traversal. `addNode`/`addEdge` mutators are injected so the
+     * outbound and inbound passes share one node/edge set. The visited set is
+     * keyed on FQN (not FQN+depth) so each symbol is expanded at most once —
+     * depth is still tracked per-node for reporting.
+     *
+     * Outbound: follow edges where the seed-side symbol is the `fromSymbol`
+     * (caller / source). The reached node is the edge's `targetFqn`.
+     * Inbound: follow edges where the seed-side symbol is the `toSymbol`
+     * (callee / target). The reached node is the edge's source FQN.
+     */
+    async bfs(projectId, seeds, edgeTypes, dir, maxDepth, includeTests, addNode, addEdge, markTruncated, deadlineAt, now) {
+        const visited = new Set();
+        // queue entries: the FQN to expand + its depth.
+        // Mark visited ON ENQUEUE (not dequeue): hubs with many inbound edges would
+        // otherwise be enqueued once per incoming edge, each spawning a redundant
+        // DB getEdges round-trip before the dequeue-time dedupe catches it.
+        const queue = [];
+        for (const seed of seeds) {
+            if (visited.has(seed))
+                continue;
+            visited.add(seed);
+            queue.push({ fqn: seed, depth: 0 });
+        }
+        while (queue.length > 0) {
+            const { fqn, depth } = queue.shift();
+            if (depth >= maxDepth) {
+                continue; // already marked visited at enqueue; no re-queue possible
+            }
+            // Wall-clock deadline: abort mid-traversal with partial results so a
+            // runaway walk never hangs the agent. O(1) per iteration. The already-
+            // collected nodes/edges are preserved by the caller.
+            if (now() >= deadlineAt) {
+                markTruncated();
+                return;
+            }
+            let edges = [];
+            try {
+                edges = await symbolGraphService.getEdges(projectId, {
+                    types: edgeTypes,
+                    direction: dir === "outbound" ? "outgoing" : "incoming",
+                    ...(dir === "outbound" ? { fromSymbol: fqn } : { toSymbol: fqn }),
+                });
+            }
+            catch {
+                // best-effort: a failed query for one node should not abort the walk.
+                continue;
+            }
+            for (const e of edges) {
+                // ── Symbol-level filtering ─────────────────────────────────────────
+                // The caller-FQN predicate is now pushed into the SQL layer
+                // (`findEdges` filters `meta.callerFqn` when the seed FQN carries a
+                // `#Name`), so outbound edges returned here already originate from the
+                // current FQN when the extractor stamped a callerFqn. We keep only a
+                // defensive assert: an edge whose callerFqn is present AND mismatches
+                // must not have passed the SQL filter — drop it defensively rather
+                // than `continue` on the common path.
+                if (dir === "outbound") {
+                    const caller = e.meta?.callerFqn;
+                    // Defensive only: the SQL filter already excluded mismatches when
+                    // the seed FQN had a '#Name'. Edges with no callerFqn (non-call
+                    // typed edges) are still accepted so unresolved hops surface.
+                    if (typeof caller === "string" && caller && caller !== fqn)
+                        continue;
+                }
+                else {
+                    // Inbound: the edge must target the current FQN exactly.
+                    if (e.targetFqn !== fqn)
+                        continue;
+                }
+                // Determine the "other end" of this edge relative to the current node.
+                // For HTTP_CALL / EMITS / external calls the callee is often NOT a
+                // project symbol (e.g. `fetch('/api/x')`) — there is no targetFqn. In
+                // that case the route/event string is the meaningful destination: use
+                // it as a synthetic leaf id so the edge is still recorded.
+                let otherFqn;
+                if (dir === "outbound") {
+                    otherFqn = e.targetFqn ?? this.syntheticTarget(e);
+                }
+                else {
+                    otherFqn = this.extractCallerFqn(e, fqn);
+                }
+                const isSelfHop = otherFqn === fqn;
+                // Edge bookkeeping — record the edge even for unresolved/leaf targets,
+                // so HTTP routes and event names are always surfaced.
+                if (!isSelfHop && otherFqn) {
+                    const fromFqn = dir === "outbound" ? fqn : otherFqn;
+                    const toFqn = dir === "outbound" ? otherFqn : fqn;
+                    addEdge({
+                        type: e.refKind,
+                        from: fromFqn,
+                        to: toFqn,
+                        fromFile: e.fromFile,
+                        fromLine: e.fromLine,
+                        meta: e.meta ?? null,
+                    });
+                }
+                // No hop target (or self) → this edge is a leaf; nothing to enqueue.
+                if (!otherFqn || isSelfHop)
+                    continue;
+                // Test-file gate: never traverse INTO a test file when excluded.
+                const isTest = TEST_FILE_RE.test(e.fromFile);
+                if (!includeTests && isTest)
+                    continue;
+                if (!visited.has(otherFqn)) {
+                    const ok = addNode({
+                        fqn: otherFqn,
+                        name: this.fqnToName(otherFqn),
+                        file: e.fromFile,
+                        line: e.fromLine,
+                        depth: depth + 1,
+                        isTest,
+                    });
+                    if (!ok) {
+                        markTruncated();
+                        return;
+                    }
+                    // Mark visited ON ENQUEUE so a hub referenced by N edges from the
+                    // current frontier is queued at most once (no duplicate DB round-trips).
+                    visited.add(otherFqn);
+                    queue.push({ fqn: otherFqn, depth: depth + 1 });
+                }
+            }
+        }
+    }
+    /**
+     * For an inbound edge, the "other end" is the caller. The D1 extractor stamps
+     * `meta.callerFqn` on CALL edges; fall back to the edge's symbol name when no
+     * FQN is recorded (e.g. cross-file calls that did not resolve).
+     */
+    extractCallerFqn(e, currentFqn) {
+        const caller = e.meta?.callerFqn;
+        if (typeof caller === "string" && caller)
+            return caller;
+        // For non-CALL typed edges inbound, there is no caller concept — skip.
+        // Return undefined so the BFS does not fabricate a hop.
+        return undefined;
+    }
+    /**
+     * Build a synthetic leaf id for edges whose callee is not a project symbol
+     * (HTTP routes, event names, external globals). Keeps the edge + its
+     * meaningful metadata in the result instead of dropping it.
+     */
+    syntheticTarget(e) {
+        const route = e.meta?.route;
+        if (typeof route === "string" && route)
+            return `http:${route}`;
+        const event = e.meta?.event;
+        if (typeof event === "string" && event)
+            return `event:${event}`;
+        // Fall back to the bare callee name so the edge is at least labeled.
+        return e.symbolName ? `${e.refKind}:${e.symbolName}` : undefined;
+    }
+    /** Derive a short display name from a FQN ('path/file.ts#Name' → 'Name'). */
+    fqnToName(fqn) {
+        return fqn.includes("#") ? fqn.split("#").pop() : fqn;
+    }
+    /**
+     * Reconstruct readable call chains (root → leaf) from the edge set, scoped to
+     * the seed roots. A leaf is any node that is never a `from` in the edge set.
+     *
+     * Bounded: the DFS carries a walk budget (MAX_CHAIN_WALKS) and stops as soon
+     * as enough chains are collected, so a dense hub topology cannot explode the
+     * recursion before the final `slice(0, 50)` cap.
+     */
+    buildChains(seeds, edges) {
+        if (edges.length === 0)
+            return [];
+        const seedSet = new Set(seeds);
+        // adjacency: from -> [to, ...] over typed edges.
+        const adj = new Map();
+        const whoHasChild = new Set();
+        for (const e of edges) {
+            const arr = adj.get(e.from) ?? [];
+            arr.push(e.to);
+            adj.set(e.from, arr);
+            whoHasChild.add(e.from);
+        }
+        const CHAIN_CAP = 50;
+        // Walk budget bounds the total number of recursive walk() invocations so a
+        // pathological fan-out (dense hub) can't blow up before the slice cap.
+        const MAX_WALKS = 5000;
+        const chains = [];
+        const seen = new Set();
+        let walks = 0;
+        const walk = (fqn, path) => {
+            // Stop once we have enough chains OR the walk budget is exhausted.
+            if (chains.length >= CHAIN_CAP)
+                return;
+            if (walks >= MAX_WALKS)
+                return;
+            walks++;
+            const key = path.join("→");
+            if (seen.has(key))
+                return;
+            seen.add(key);
+            const next = adj.get(fqn);
+            if (!next || next.length === 0 || !whoHasChild.has(fqn)) {
+                // leaf
+                if (path.length > 1)
+                    chains.push(path.map((n) => this.fqnToName(n)).join(" → "));
+                return;
+            }
+            for (const child of next) {
+                if (chains.length >= CHAIN_CAP || walks >= MAX_WALKS)
+                    return;
+                // cycle guard inside a single chain
+                if (path.includes(child)) {
+                    const cycled = [...path, `${this.fqnToName(child)}↺`];
+                    chains.push(cycled.map((n) => n).join(" → "));
+                    continue;
+                }
+                walk(child, [...path, child]);
+            }
+        };
+        for (const seed of seeds) {
+            if (chains.length >= CHAIN_CAP)
+                break;
+            if (seedSet.has(seed) && whoHasChild.has(seed))
+                walk(seed, [seed]);
+        }
+        // Cap and dedupe-ish.
+        return chains.slice(0, CHAIN_CAP);
+    }
+}
+export const tracePathService = TracePathService.getInstance();
+//# sourceMappingURL=trace-path.js.map

package/dist/services/symbol/trace-path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"trace-path.js","sourceRoot":"","sources":["../../../src/services/symbol/trace-path.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAE1C,OAAO,EAAE,kBAAkB,EAAE,MAAM,2BAA2B,CAAC;AAE/D,OAAO,EAAE,uBAAuB,EAA+B,MAAM,wBAAwB,CAAC;AAuF9F,iFAAiF;AAEjF,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,SAAS,GAAG,CAAC,CAAC;AACpB;iCACiC;AACjC,MAAM,SAAS,GAAG,IAAI,CAAC;AACvB;;;;;GAKG;AACH,MAAM,6BAA6B,GAAG,KAAK,CAAC;AAE5C,mCAAmC;AACnC,MAAM,eAAe,GAAkC;IACrD,iDAAiD;IACjD,KAAK,EAAE,CAAC,MAAM,CAAC;IACf,gEAAgE;IAChE,SAAS,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;IAChC,wEAAwE;IACxE,6DAA6D;IAC7D,aAAa,EAAE,CAAC,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,CAAC;IAC3D,yBAAyB;IACzB,GAAG,EAAE,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,CAAC;CACvG,CAAC;AAEF,MAAM,YAAY,GAAG,+EAA+E,CAAC;AAErG,iFAAiF;AAEjF,MAAM,OAAO,gBAAgB;IAGE;IAFrB,MAAM,CAAC,QAAQ,GAA4B,IAAI,CAAC;IAExD,YAA6B,iBAAiB,uBAAuB;QAAxC,mBAAc,GAAd,cAAc,CAA0B;IAAG,CAAC;IAEzE,MAAM,CAAC,WAAW;QAChB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC;YAC/B,gBAAgB,CAAC,QAAQ,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,gBAAgB,CAAC,QAAQ,CAAC;IACnC,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,YAAY,CAChB,SAAiB,EACjB,IAAsB;QAEtB,OAAO,CAAC,MAAM,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;IAC/D,CAAC;IAEO,KAAK,CAAC,iBAAiB,CAAC,SAAiB,EAAE,IAAsB;QAIvE,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACzG,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;YACrE,OAAO,EAAE,kBAAkB,EAAE,MAA6D,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,CAAC,CAAC;wBACjI,GAAG,EAAE,MAAM,CAAC,UAAU,CAAC,EAAE;wBACzB,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI;wBAC5B,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,SAAS;wBACjC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,UAAU;qBACnC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,aAAa,CAAC;QAC/C,IAAI,CAAC,IAAI;YAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAEhC,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;YACjE,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;YAChE,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC;QAC1G,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QACvB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS,CAAC,IAAsB;QACpC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,MAAM,SAAS,GAAmB,IAAI,CAAC,SAAS,IAAI,UAAU,CAAC;QAC/D,MAAM,IAAI,GAAc,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC;QAC7C,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC;QACjD,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,IAAI,aAAa,CAAC;QACnD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC;QAC/D,4EAA4E;QAC5E,sEAAsE;QACtE,2EAA2E;QAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC;QACjC,MAAM,UAAU,GAAG,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,UAAU,IAAI,6BAA6B,CAAC,CAAC;QAE9E,gDAAgD;QAChD,MAAM,SAAS,GACb,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAE1F,iBAAiB;QACjB,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACjE,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC;QAClC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAEzC,MAAM,KAAK,GAAoB;YAC7B,SAAS;YACT,MAAM,EAAE,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,aAAa,IAAI,EAAE;YACrE,IAAI;YACJ,SAAS;YACT,SAAS;YACT,KAAK;YACL,KAAK,EAAE,EAAE;YACT,KAAK,EAAE,EAAE;YACT,MAAM,EAAE,EAAE;YACV,SAAS,EAAE,KAAK;YAChB,WAAW,EAAE,CAAC;YACd,WAAW,EAAE,CAAC;YACd,aAAa,EAAE,CAAC;YAChB,GAAG,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,kBAAkB,EAAE,UAAU,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAChG,CAAC;QAEF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAErC,2EAA2E;QAC3E,+DAA+D;QAC/D,MAAM,UAAU,GAAG,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,CAAC;QACpE,MAAM,SAAS,GAAG,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,MAAM,CAAC;QAElE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC3C,MAAM,KAAK,GAAgB,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QACnC,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,sEAAsE;QACtE,mEAAmE;QACnE,0DAA0D;QAC1D,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,MAAM,OAAO,GAAG,CAAC,CAAY,EAAE,EAAE;YAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;YAClC,sEAAsE;YACtE,UAAU,EAAE,CAAC;YACb,IAAI,KAAK,CAAC,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC5B,SAAS,GAAG,IAAI,CAAC;gBACjB,OAAO,KAAK,CAAC;YACf,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QACF,MAAM,OAAO,GAAG,CAAC,CAAY,EAAE,EAAE;YAC/B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;YACtE,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO;YAC9B,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChB,CAAC,CAAC;QAEF,yBAAyB;QACzB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YACjC,MAAM,EAAE,GAAG,OAAO,CAAC;gBACjB,GAAG;gBACH,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,KAAK,EAAE,CAAC;gBACR,MAAM,EAAE,IAAI;gBACZ,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK;aACvD,CAAC,CAAC;YACH,IAAI,CAAC,EAAE;gBAAE,MAAM;QACjB,CAAC;QAED,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QAC5I,CAAC;QACD,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC,SAAS,GAAG,IAAI,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;QAC3I,CAAC;QAED,+EAA+E;QAC/E,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAClD,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAC7C,CAAC;QAEF,iEAAiE;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAE9C,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC;QACrC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,UAAU,CAAC,CAAC;QAE1D,MAAM,MAAM,GAAoB;YAC9B,SAAS;YACT,MAAM,EAAE,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,aAAa,IAAI,EAAE;YACrE,IAAI;YACJ,SAAS;YACT,SAAS;YACT,KAAK;YACL,KAAK,EAAE,UAAU;YACjB,KAAK;YACL,MAAM;YACN,SAAS;YACT,WAAW,EAAE,UAAU;YACvB,WAAW,EAAE,UAAU;YACvB,aAAa,EAAE,YAAY;YAC3B,GAAG,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,kBAAkB,EAAE,UAAU,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAChG,CAAC;QAEF,MAAM,CAAC,KAAK,CAAC,kCAAkC,EAAE;YAC/C,SAAS;YACT,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,KAAK,EAAE,UAAU,CAAC,MAAM;YACxB,KAAK,EAAE,KAAK,CAAC,MAAM;YACnB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,SAAS;SACV,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+EAA+E;IAE/E;;;;;;;;;;OAUG;IACK,KAAK,CAAC,GAAG,CACf,SAAiB,EACjB,KAAe,EACf,SAAqB,EACrB,GAA2B,EAC3B,QAAgB,EAChB,YAAqB,EACrB,OAAkC,EAClC,OAA+B,EAC/B,aAAyB,EACzB,UAAkB,EAClB,GAAiB;QAEjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,gDAAgD;QAChD,4EAA4E;QAC5E,0EAA0E;QAC1E,oEAAoE;QACpE,MAAM,KAAK,GAA0C,EAAE,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACtC,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YACtC,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;gBACtB,SAAS,CAAC,0DAA0D;YACtE,CAAC;YACD,qEAAqE;YACrE,uEAAuE;YACvE,qDAAqD;YACrD,IAAI,GAAG,EAAE,IAAI,UAAU,EAAE,CAAC;gBACxB,aAAa,EAAE,CAAC;gBAChB,OAAO;YACT,CAAC;YAED,IAAI,KAAK,GAAiB,EAAE,CAAC;YAC7B,IAAI,CAAC;gBACH,KAAK,GAAG,MAAM,kBAAkB,CAAC,QAAQ,CAAC,SAAS,EAAE;oBACnD,KAAK,EAAE,SAAS;oBAChB,SAAS,EAAE,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU;oBACvD,GAAG,CAAC,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;iBAClE,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,sEAAsE;gBACtE,SAAS;YACX,CAAC;YAED,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,sEAAsE;gBACtE,4DAA4D;gBAC5D,oEAAoE;gBACpE,uEAAuE;gBACvE,qEAAqE;gBACrE,sEAAsE;gBACtE,mEAAmE;gBACnE,sCAAsC;gBACtC,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;oBACvB,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC;oBACjC,kEAAkE;oBAClE,gEAAgE;oBAChE,8DAA8D;oBAC9D,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,IAAI,MAAM,KAAK,GAAG;wBAAE,SAAS;gBACvE,CAAC;qBAAM,CAAC;oBACN,yDAAyD;oBACzD,IAAI,CAAC,CAAC,SAAS,KAAK,GAAG;wBAAE,SAAS;gBACpC,CAAC;gBAED,uEAAuE;gBACvE,mEAAmE;gBACnE,sEAAsE;gBACtE,sEAAsE;gBACtE,2DAA2D;gBAC3D,IAAI,QAA4B,CAAC;gBACjC,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;oBACvB,QAAQ,GAAG,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;gBACpD,CAAC;qBAAM,CAAC;oBACN,QAAQ,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC3C,CAAC;gBACD,MAAM,SAAS,GAAG,QAAQ,KAAK,GAAG,CAAC;gBAEnC,uEAAuE;gBACvE,sDAAsD;gBACtD,IAAI,CAAC,SAAS,IAAI,QAAQ,EAAE,CAAC;oBAC3B,MAAM,OAAO,GAAG,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;oBACpD,MAAM,KAAK,GAAG,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC;oBAClD,OAAO,CAAC;wBACN,IAAI,EAAE,CAAC,CAAC,OAAmB;wBAC3B,IAAI,EAAE,OAAO;wBACb,EAAE,EAAE,KAAK;wBACT,QAAQ,EAAE,CAAC,CAAC,QAAQ;wBACpB,QAAQ,EAAE,CAAC,CAAC,QAAQ;wBACpB,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;qBACrB,CAAC,CAAC;gBACL,CAAC;gBAED,qEAAqE;gBACrE,IAAI,CAAC,QAAQ,IAAI,SAAS;oBAAE,SAAS;gBAErC,iEAAiE;gBACjE,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;gBAC7C,IAAI,CAAC,YAAY,IAAI,MAAM;oBAAE,SAAS;gBAEtC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,MAAM,EAAE,GAAG,OAAO,CAAC;wBACjB,GAAG,EAAE,QAAQ;wBACb,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;wBAC9B,IAAI,EAAE,CAAC,CAAC,QAAQ;wBAChB,IAAI,EAAE,CAAC,CAAC,QAAQ;wBAChB,KAAK,EAAE,KAAK,GAAG,CAAC;wBAChB,MAAM;qBACP,CAAC,CAAC;oBACH,IAAI,CAAC,EAAE,EAAE,CAAC;wBACR,aAAa,EAAE,CAAC;wBAChB,OAAO;oBACT,CAAC;oBACD,kEAAkE;oBAClE,yEAAyE;oBACzE,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;OAIG;IACK,gBAAgB,CAAC,CAAa,EAAE,UAAkB;QACxD,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC;QACjC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QACxD,uEAAuE;QACvE,wDAAwD;QACxD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,CAAa;QACnC,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC;QAC5B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK;YAAE,OAAO,QAAQ,KAAK,EAAE,CAAC;QAC/D,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC;QAC5B,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK;YAAE,OAAO,SAAS,KAAK,EAAE,CAAC;QAChE,qEAAqE;QACrE,OAAO,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACnE,CAAC;IAED,6EAA6E;IACrE,SAAS,CAAC,GAAW;QAC3B,OAAO,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IACzD,CAAC;IAED;;;;;;;OAOG;IACK,WAAW,CAAC,KAAe,EAAE,KAAkB;QACrD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAC/B,iDAAiD;QACjD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;QACxC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAClC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACf,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrB,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;QAED,MAAM,SAAS,GAAG,EAAE,CAAC;QACrB,2EAA2E;QAC3E,uEAAuE;QACvE,MAAM,SAAS,GAAG,IAAI,CAAC;QACvB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,IAAc,EAAE,EAAE;YAC3C,mEAAmE;YACnE,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS;gBAAE,OAAO;YACvC,IAAI,KAAK,IAAI,SAAS;gBAAE,OAAO;YAC/B,KAAK,EAAE,CAAC;YACR,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO;YAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxD,OAAO;gBACP,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBACjF,OAAO;YACT,CAAC;YACD,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS,IAAI,KAAK,IAAI,SAAS;oBAAE,OAAO;gBAC7D,oCAAoC;gBACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;oBACzB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;oBACtD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;oBAC9C,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;YAChC,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,MAAM,CAAC,MAAM,IAAI,SAAS;gBAAE,MAAM;YACtC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,sBAAsB;QACtB,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACpC,CAAC;;AAGH,MAAM,CAAC,MAAM,gBAAgB,GAAG,gBAAgB,CAAC,WAAW,EAAE,CAAC"}

package/dist/services/synapse/buffer/index.d.ts

@@ -0,0 +1,2 @@
+export { WorkingMemoryBuffer, DEFAULT_BUFFER_CONFIG, type WorkingMemoryBufferConfig, type BufferGetResult, } from "./working-memory-buffer.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/services/synapse/buffer/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/services/synapse/buffer/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,mBAAmB,EACnB,qBAAqB,EACrB,KAAK,yBAAyB,EAC9B,KAAK,eAAe,GACrB,MAAM,4BAA4B,CAAC"}

package/dist/services/synapse/buffer/index.js

@@ -0,0 +1,2 @@
+export { WorkingMemoryBuffer, DEFAULT_BUFFER_CONFIG, } from "./working-memory-buffer.js";
+//# sourceMappingURL=index.js.map

package/dist/services/synapse/buffer/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/services/synapse/buffer/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,mBAAmB,EACnB,qBAAqB,GAGtB,MAAM,4BAA4B,CAAC"}