@ttsc/graph 0.16.4 → 0.16.5

package/lib/server/runQuery.js

@@ -0,0 +1,147 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.runQuery = runQuery;
+const runExpand_1 = require("./runExpand");
+// One file should not crowd out the rest of the ranking, so cap hits per file.
+const PER_FILE = 3;
+const DEFAULT_LIMIT = 12;
+/**
+ * Rank the graph's symbols against a natural query. Scoring blends exact and
+ * dotted-name matches, CamelCase/subword coverage, file-path terms, a prefix
+ * bonus, and dependency centrality, then dampens external, generated, and test
+ * nodes and caps per file so the result is a diverse, relevant shortlist rather
+ * than one file's roster.
+ */
+function runQuery(graph, props) {
+    const terms = subwords(props.query);
+    const queryLc = props.query.trim().toLowerCase();
+    if (terms.length === 0)
+        return { hits: [], next: { expand: [] } };
+    const scored = [];
+    for (const node of graph.nodes) {
+        if (node.kind === "file")
+            continue;
+        const score = scoreNode(graph, node, queryLc, terms);
+        if (score <= 0)
+            continue;
+        scored.push({
+            id: node.id,
+            name: node.qualifiedName ?? node.name,
+            kind: node.kind,
+            file: node.file,
+            line: node.evidence?.startLine,
+            score: Math.round(score),
+        });
+    }
+    scored.sort((a, b) => b.score - a.score);
+    // Diversity: keep at most PER_FILE hits per file while filling up to the limit.
+    const limit = Math.max(1, props.limit ?? DEFAULT_LIMIT);
+    const perFile = new Map();
+    const hits = [];
+    for (const hit of scored) {
+        const used = perFile.get(hit.file) ?? 0;
+        if (used >= PER_FILE)
+            continue;
+        perFile.set(hit.file, used + 1);
+        hits.push(hit);
+        if (hits.length >= limit)
+            break;
+    }
+    // Attach each kept hit's signature — only the shortlist, so the read cost is
+    // bounded — so the model can often answer from the query alone, no expand.
+    for (const hit of hits) {
+        const node = graph.node(hit.id);
+        if (node === undefined)
+            continue;
+        const sig = (0, runExpand_1.signatureOf)(graph.project, node);
+        if (sig !== undefined)
+            hit.signature = sig;
+    }
+    return { hits, next: { expand: hits.map((hit) => hit.id) } };
+}
+/** Score one node against the query; 0 means no match. */
+function scoreNode(graph, node, queryLc, terms) {
+    const name = node.name.toLowerCase();
+    const qualified = (node.qualifiedName ?? node.name).toLowerCase();
+    const nameSubs = subwords(node.name);
+    const qualifiedSubs = subwords(node.qualifiedName ?? node.name);
+    const pathSubs = subwords(node.file);
+    let score = 0;
+    if (queryLc === name || queryLc === qualified) {
+        score += 100;
+    }
+    else if (qualified.includes(".") && queryLc.includes(qualified)) {
+        score += 85;
+    }
+    else if (queryLc.includes(".") && qualified.includes(queryLc)) {
+        score += 60;
+    }
+    let covered = 0;
+    for (const term of terms) {
+        if (nameSubs.includes(term)) {
+            score += 12;
+            covered++;
+        }
+        else if (qualifiedSubs.includes(term)) {
+            score += 8;
+            covered++;
+        }
+        else if (name.includes(term)) {
+            score += 5;
+            covered++;
+        }
+        else if (pathSubs.includes(term)) {
+            score += 3;
+        }
+    }
+    // Every query term landed somewhere in the name: a strong whole-query match.
+    if (covered === terms.length)
+        score += 10;
+    if (name.startsWith(terms[0]))
+        score += 4;
+    if (score <= 0)
+        return 0;
+    // Centrality: a symbol the codebase leans on is a likelier target.
+    const fan = degree(graph, node.id);
+    score += Math.min(8, Math.log2(1 + fan) * 2);
+    // Dampen what is rarely the intended target.
+    if (node.external)
+        score *= 0.5;
+    if (node.ignored)
+        score *= 0.3;
+    if (isTestFile(node.file))
+        score *= 0.7;
+    return score;
+}
+/** Non-structural in+out degree (code dependency, not nesting). */
+function degree(graph, id) {
+    let n = 0;
+    for (const edge of graph.outgoing(id))
+        if (!isStructural(edge.kind))
+            n++;
+    for (const edge of graph.incoming(id))
+        if (!isStructural(edge.kind))
+            n++;
+    return n;
+}
+function isStructural(kind) {
+    return kind === "contains" || kind === "exports" || kind === "imports";
+}
+function isTestFile(file) {
+    return (/(^|\/)(test|tests|__tests__|spec)\//.test(file) ||
+        /\.(test|spec)\.[cm]?tsx?$/.test(file));
+}
+/**
+ * Split an identifier or phrase into lowercase subword tokens: CamelCase,
+ * snake, dotted, and space boundaries all break, so `getHTTPResponse`,
+ * `find_by_id`, and `OrderService.create` tokenize the way a query would.
+ */
+function subwords(text) {
+    return text
+        .replace(/([a-z0-9])([A-Z])/g, "$1 $2")
+        .replace(/([A-Z]+)([A-Z][a-z])/g, "$1 $2")
+        .split(/[^a-zA-Z0-9]+/)
+        .filter((w) => w.length > 0)
+        .map((w) => w.toLowerCase());
+}
+//# sourceMappingURL=runQuery.js.map

package/lib/server/runQuery.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runQuery.js","sourceRoot":"","sources":["../../src/server/runQuery.ts"],"names":[],"mappings":";;;AAGA,2CAA0C;AAE1C,+EAA+E;AAC/E,MAAM,QAAQ,GAAG,CAAC,CAAC;AACnB,MAAM,aAAa,GAAG,EAAE,CAAC;AAEzB;;;;;;GAMG;AACH,kBACE,KAAsB,EACtB,KAA6B;IAE7B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACjD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;IAElE,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACrD,IAAI,KAAK,IAAI,CAAC;YAAE,SAAS;QACzB,MAAM,CAAC,IAAI,CAAC;YACV,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,IAAI;YACrC,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,SAAS;YAC9B,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;SACzB,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEzC,gFAAgF;IAChF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,IAAI,aAAa,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,IAAI,IAAI,IAAI,QAAQ;YAAE,SAAS;QAC/B,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;YAAE,MAAM;IAClC,CAAC;IAED,6EAA6E;IAC7E,2EAA2E;IAC3E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,IAAI,KAAK,SAAS;YAAE,SAAS;QACjC,MAAM,GAAG,GAAG,IAAA,uBAAW,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC7C,IAAI,GAAG,KAAK,SAAS;YAAE,GAAG,CAAC,SAAS,GAAG,GAAG,CAAC;IAC7C,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;AAC/D,CAAC;AAED,0DAA0D;AAC1D,SAAS,SAAS,CAChB,KAAsB,EACtB,IAAoB,EACpB,OAAe,EACf,KAAe;IAEf,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,SAAS,GAAG,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;IAClE,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAErC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC9C,KAAK,IAAI,GAAG,CAAC;IACf,CAAC;SAAM,IAAI,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QAClE,KAAK,IAAI,EAAE,CAAC;IACd,CAAC;SAAM,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;QAChE,KAAK,IAAI,EAAE,CAAC;IACd,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,KAAK,IAAI,EAAE,CAAC;YACZ,OAAO,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,CAAC;YACX,OAAO,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,CAAC;YACX,OAAO,EAAE,CAAC;QACZ,CAAC;aAAM,IAAI,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,KAAK,IAAI,CAAC,CAAC;QACb,CAAC;IACH,CAAC;IACD,6EAA6E;IAC7E,IAAI,OAAO,KAAK,KAAK,CAAC,MAAM;QAAE,KAAK,IAAI,EAAE,CAAC;IAC1C,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC;QAAE,KAAK,IAAI,CAAC,CAAC;IAE3C,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAEzB,mEAAmE;IACnE,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IACnC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IAE7C,6CAA6C;IAC7C,IAAI,IAAI,CAAC,QAAQ;QAAE,KAAK,IAAI,GAAG,CAAC;IAChC,IAAI,IAAI,CAAC,OAAO;QAAE,KAAK,IAAI,GAAG,CAAC;IAC/B,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,KAAK,IAAI,GAAG,CAAC;IACxC,OAAO,KAAK,CAAC;AACf,CAAC;AAED,mEAAmE;AACnE,SAAS,MAAM,CAAC,KAAsB,EAAE,EAAU;IAChD,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;IACzE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,CAAC,EAAE,CAAC;IACzE,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,YAAY,CAAC,IAAY;IAChC,OAAO,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,CAAC;AACzE,CAAC;AAED,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,CACL,qCAAqC,CAAC,IAAI,CAAC,IAAI,CAAC;QAChD,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,CACvC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,IAAI;SACR,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC;SACtC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC;SACzC,KAAK,CAAC,eAAe,CAAC;SACtB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;AACjC,CAAC"}

package/lib/server/runTrace.js

@@ -0,0 +1,219 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.runTrace = runTrace;
+const resolveHandle_1 = require("./resolveHandle");
+const runExpand_1 = require("./runExpand");
+const DEFAULT_DEPTH = 6;
+const DEFAULT_MAX_NODES = 60;
+/**
+ * Breadth-first trace along the dependency graph. Structural
+ * (contains/exports/imports) edges are excluded so the path is real call/type
+ * flow; forward walks callees, reverse and impact walk callers. Impact
+ * additionally tags each reached node's role so the blast radius on the public
+ * surface is legible.
+ */
+function runTrace(graph, props) {
+    const direction = props.direction ?? "forward";
+    const maxDepth = Math.max(1, props.maxDepth ?? DEFAULT_DEPTH);
+    const maxNodes = Math.max(1, props.maxNodes ?? DEFAULT_MAX_NODES);
+    const reverse = direction === "reverse" || direction === "impact";
+    // Only an impact trace tags reached nodes with their public-surface role; for
+    // forward/reverse the role is noise.
+    const withRoles = direction === "impact";
+    const start = (0, resolveHandle_1.resolveGraphHandle)(graph, props.from);
+    if (start.candidates) {
+        return {
+            direction,
+            hops: [],
+            reached: [],
+            truncated: false,
+            candidates: start.candidates.map((n) => summary(n)),
+        };
+    }
+    if (start.node === undefined) {
+        return { direction, hops: [], reached: [], truncated: false };
+    }
+    // Path mode: with `to`, return the dependency path from `from` to `to` — the
+    // one-call answer for "how does A reach B" — instead of an open-ended trace.
+    if (props.to !== undefined && props.to !== "") {
+        const base = { direction: "path", hops: [], reached: [], truncated: false };
+        const target = (0, resolveHandle_1.resolveGraphHandle)(graph, props.to);
+        if (target.candidates) {
+            return {
+                ...base,
+                start: summary(start.node),
+                candidates: target.candidates.map((n) => summary(n)),
+            };
+        }
+        if (target.node === undefined) {
+            return { ...base, start: summary(start.node) };
+        }
+        const found = findPath(graph, start.node.id, target.node.id, Math.max(1, props.maxDepth ?? 12));
+        return {
+            ...base,
+            start: summary(start.node),
+            target: summary(target.node),
+            hops: found?.hops ?? [],
+            path: (found?.path ?? []).map((node, i) => {
+                const node_ = summary(node, i);
+                const sig = (0, runExpand_1.signatureOf)(graph.project, node);
+                if (sig !== undefined)
+                    node_.signature = sig;
+                return node_;
+            }),
+        };
+    }
+    const hops = [];
+    const reached = new Map();
+    const visited = new Set([start.node.id]);
+    let queue = [
+        { id: start.node.id, depth: 0 },
+    ];
+    let truncated = false;
+    while (queue.length > 0) {
+        const next = [];
+        for (const { id, depth } of queue) {
+            if (depth >= maxDepth) {
+                truncated = true;
+                continue;
+            }
+            const edges = reverse ? graph.incoming(id) : graph.outgoing(id);
+            for (const edge of edges) {
+                if (!traversable(edge.kind))
+                    continue;
+                const otherId = reverse ? edge.from : edge.to;
+                const other = graph.node(otherId);
+                if (other === undefined || other.kind === "file")
+                    continue;
+                const hop = {
+                    from: edge.from,
+                    to: edge.to,
+                    kind: edge.kind,
+                    depth: depth + 1,
+                };
+                // A back-edge to the start or an already-reached node: record the hop;
+                // its endpoints are already represented.
+                if (visited.has(otherId)) {
+                    hops.push(hop);
+                    continue;
+                }
+                // A new node past the cap is left unrepresented, so drop its hop too —
+                // every hop's endpoints stay resolvable in `reached`/`start`.
+                if (reached.size >= maxNodes) {
+                    truncated = true;
+                    continue;
+                }
+                visited.add(otherId);
+                reached.set(otherId, summary(other, depth + 1, withRoles));
+                next.push({ id: otherId, depth: depth + 1 });
+                hops.push(hop);
+            }
+        }
+        queue = next;
+    }
+    return {
+        start: summary(start.node),
+        direction,
+        hops,
+        reached: [...reached.values()],
+        truncated,
+    };
+}
+/**
+ * The shortest dependency path from `startId` to `targetId` over real (non-
+ * structural) forward edges, breadth-first, or null when `targetId` is not
+ * reachable within maxDepth. Returns the nodes in order and the hops between.
+ */
+function findPath(graph, startId, targetId, maxDepth) {
+    const startNode = graph.node(startId);
+    if (startNode === undefined)
+        return null;
+    if (startId === targetId)
+        return { path: [startNode], hops: [] };
+    const parent = new Map();
+    const visited = new Set([startId]);
+    let queue = [{ id: startId, depth: 0 }];
+    while (queue.length > 0) {
+        const next = [];
+        for (const { id, depth } of queue) {
+            if (depth >= maxDepth)
+                continue;
+            for (const edge of graph.outgoing(id)) {
+                if (!traversable(edge.kind))
+                    continue;
+                const otherId = edge.to;
+                if (visited.has(otherId))
+                    continue;
+                const other = graph.node(otherId);
+                if (other === undefined || other.kind === "file")
+                    continue;
+                visited.add(otherId);
+                parent.set(otherId, { via: id, kind: edge.kind });
+                if (otherId === targetId) {
+                    const ids = [otherId];
+                    let cur = otherId;
+                    while (cur !== startId) {
+                        const p = parent.get(cur);
+                        if (p === undefined)
+                            break;
+                        ids.unshift(p.via);
+                        cur = p.via;
+                    }
+                    const path = [];
+                    for (const nid of ids) {
+                        const n = graph.node(nid);
+                        if (n !== undefined)
+                            path.push(n);
+                    }
+                    const hops = [];
+                    for (let i = 1; i < path.length; i++) {
+                        const node = path[i];
+                        hops.push({
+                            from: path[i - 1].id,
+                            to: node.id,
+                            kind: parent.get(node.id)?.kind ?? "calls",
+                            depth: i,
+                        });
+                    }
+                    return { path, hops };
+                }
+                next.push({ id: otherId, depth: depth + 1 });
+            }
+        }
+        queue = next;
+    }
+    return null;
+}
+/**
+ * Summarize a node for a trace result. With `withRoles`, tag the public-surface
+ * roles (exported / test) an impact trace reports; other directions omit them.
+ */
+function summary(node, depth, withRoles = false) {
+    const out = {
+        id: node.id,
+        name: node.qualifiedName ?? node.name,
+        kind: node.kind,
+        file: node.file,
+    };
+    if (depth !== undefined)
+        out.depth = depth;
+    if (withRoles) {
+        const roles = [];
+        if (node.exported)
+            roles.push("exported");
+        if (isTestFile(node.file))
+            roles.push("test");
+        if (roles.length > 0)
+            out.roles = roles;
+    }
+    return out;
+}
+/** An edge the trace should follow: a real dependency, not a structural edge. */
+function traversable(kind) {
+    return kind !== "contains" && kind !== "exports" && kind !== "imports";
+}
+function isTestFile(file) {
+    return (/(^|\/)(test|tests|__tests__|spec)\//.test(file) ||
+        /\.(test|spec)\.[cm]?tsx?$/.test(file));
+}
+//# sourceMappingURL=runTrace.js.map

package/lib/server/runTrace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runTrace.js","sourceRoot":"","sources":["../../src/server/runTrace.ts"],"names":[],"mappings":";;;AAGA,mDAAqD;AACrD,2CAA0C;AAE1C,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAE7B;;;;;;GAMG;AACH,kBACE,KAAsB,EACtB,KAA6B;IAE7B,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,SAAS,CAAC;IAC/C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,QAAQ,IAAI,aAAa,CAAC,CAAC;IAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,QAAQ,IAAI,iBAAiB,CAAC,CAAC;IAClE,MAAM,OAAO,GAAG,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,QAAQ,CAAC;IAClE,8EAA8E;IAC9E,qCAAqC;IACrC,MAAM,SAAS,GAAG,SAAS,KAAK,QAAQ,CAAC;IAEzC,MAAM,KAAK,GAAG,IAAA,kCAAkB,EAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACpD,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACrB,OAAO;YACL,SAAS;YACT,IAAI,EAAE,EAAE;YACR,OAAO,EAAE,EAAE;YACX,SAAS,EAAE,KAAK;YAChB,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SACpD,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IAChE,CAAC;IAED,6EAA6E;IAC7E,6EAA6E;IAC7E,IAAI,KAAK,CAAC,EAAE,KAAK,SAAS,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QAC5E,MAAM,MAAM,GAAG,IAAA,kCAAkB,EAAC,KAAK,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QACnD,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;YACtB,OAAO;gBACL,GAAG,IAAI;gBACP,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC;gBAC1B,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACrD,CAAC;QACJ,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC9B,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACjD,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CACpB,KAAK,EACL,KAAK,CAAC,IAAI,CAAC,EAAE,EACb,MAAM,CAAC,IAAI,CAAC,EAAE,EACd,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAClC,CAAC;QACF,OAAO;YACL,GAAG,IAAI;YACP,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC;YAC1B,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC;YAC5B,IAAI,EAAE,KAAK,EAAE,IAAI,IAAI,EAAE;YACvB,IAAI,EAAE,CAAC,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;gBACxC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAC/B,MAAM,GAAG,GAAG,IAAA,uBAAW,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC7C,IAAI,GAAG,KAAK,SAAS;oBAAE,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC;gBAC7C,OAAO,KAAK,CAAC;YACf,CAAC,CAAC;SACH,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiC,CAAC;IACzD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,IAAI,KAAK,GAAyC;QAChD,EAAE,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE;KAChC,CAAC;IACF,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAyC,EAAE,CAAC;QACtD,KAAK,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,KAAK,EAAE,CAAC;YAClC,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;gBACtB,SAAS,GAAG,IAAI,CAAC;gBACjB,SAAS;YACX,CAAC;YACD,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;YAChE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACtC,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAClC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;oBAAE,SAAS;gBAC3D,MAAM,GAAG,GAAG;oBACV,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,KAAK,EAAE,KAAK,GAAG,CAAC;iBACjB,CAAC;gBACF,uEAAuE;gBACvE,yCAAyC;gBACzC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACf,SAAS;gBACX,CAAC;gBACD,uEAAuE;gBACvE,8DAA8D;gBAC9D,IAAI,OAAO,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC7B,SAAS,GAAG,IAAI,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACrB,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;gBAC3D,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC7C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,KAAK,GAAG,IAAI,CAAC;IACf,CAAC;IAED,OAAO;QACL,KAAK,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC;QAC1B,SAAS;QACT,IAAI;QACJ,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,SAAS;KACV,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CACf,KAAsB,EACtB,OAAe,EACf,QAAgB,EAChB,QAAgB;IAEhB,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACtC,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACzC,IAAI,OAAO,KAAK,QAAQ;QAAE,OAAO,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IACjE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyC,CAAC;IAChE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,OAAO,CAAC,CAAC,CAAC;IAC3C,IAAI,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAyC,EAAE,CAAC;QACtD,KAAK,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,KAAK,EAAE,CAAC;YAClC,IAAI,KAAK,IAAI,QAAQ;gBAAE,SAAS;YAChC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;oBAAE,SAAS;gBACtC,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACxB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAS;gBACnC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAClC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,MAAM;oBAAE,SAAS;gBAC3D,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACrB,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAClD,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;oBACzB,MAAM,GAAG,GAAa,CAAC,OAAO,CAAC,CAAC;oBAChC,IAAI,GAAG,GAAG,OAAO,CAAC;oBAClB,OAAO,GAAG,KAAK,OAAO,EAAE,CAAC;wBACvB,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;wBAC1B,IAAI,CAAC,KAAK,SAAS;4BAAE,MAAM;wBAC3B,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACnB,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC;oBACd,CAAC;oBACD,MAAM,IAAI,GAAqB,EAAE,CAAC;oBAClC,KAAK,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;wBACtB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBAC1B,IAAI,CAAC,KAAK,SAAS;4BAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACpC,CAAC;oBACD,MAAM,IAAI,GAA2B,EAAE,CAAC;oBACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBACrC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;wBACtB,IAAI,CAAC,IAAI,CAAC;4BACR,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE;4BACrB,EAAE,EAAE,IAAI,CAAC,EAAE;4BACX,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,OAAO;4BAC1C,KAAK,EAAE,CAAC;yBACT,CAAC,CAAC;oBACL,CAAC;oBACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;gBACxB,CAAC;gBACD,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QACD,KAAK,GAAG,IAAI,CAAC;IACf,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,SAAS,OAAO,CACd,IAAoB,EACpB,KAAc,EACd,SAAS,GAAG,KAAK;IAEjB,MAAM,GAAG,GAA0B;QACjC,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,IAAI,EAAE,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,IAAI;QACrC,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC;IACF,IAAI,KAAK,KAAK,SAAS;QAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;IAC3C,IAAI,SAAS,EAAE,CAAC;QACd,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;YAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;IAC1C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iFAAiF;AACjF,SAAS,WAAW,CAAC,IAAY;IAC/B,OAAO,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,CAAC;AACzE,CAAC;AAED,SAAS,UAAU,CAAC,IAAY;IAC9B,OAAO,CACL,qCAAqC,CAAC,IAAI,CAAC,IAAI,CAAC;QAChD,2BAA2B,CAAC,IAAI,CAAC,IAAI,CAAC,CACvC,CAAC;AACJ,CAAC"}

package/lib/server/startServer.js

@@ -0,0 +1,21 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.startServer = startServer;
+const stdio_js_1 = require("@modelcontextprotocol/sdk/server/stdio.js");
+const loadGraph_1 = require("../model/loadGraph");
+const createServer_1 = require("./createServer");
+/**
+ * Serve the graph tools over MCP on stdio. The server answers the MCP handshake
+ * immediately and builds the resident graph on the first tool call, so a large
+ * project cannot make the client give up before tools are advertised.
+ */
+async function startServer(options) {
+    let graph;
+    const server = (0, createServer_1.createServer)(() => {
+        graph ??= (0, loadGraph_1.loadGraph)({ cwd: options.cwd, tsconfig: options.tsconfig });
+        return graph;
+    }, options.version);
+    const transport = new stdio_js_1.StdioServerTransport();
+    await server.connect(transport);
+}
+//# sourceMappingURL=startServer.js.map

package/lib/server/startServer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"startServer.js","sourceRoot":"","sources":["../../src/server/startServer.ts"],"names":[],"mappings":";;;AAAA,wEAAiF;AAGjF,kDAA+C;AAC/C,iDAA8C;AAE9C;;;;GAIG;AACI,KAAK,sBAAsB,OAKjC;IACC,IAAI,KAAkC,CAAC;IACvC,MAAM,MAAM,GAAG,IAAA,2BAAY,EAAC,GAAG,EAAE;QAC/B,KAAK,KAAK,IAAA,qBAAS,EAAC,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;QACtE,OAAO,KAAK,CAAC;IACf,CAAC,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IACpB,MAAM,SAAS,GAAG,IAAI,+BAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;AAClC,CAAC"}

package/lib/structures/ITtscGraphApplication.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphApplication.js.map

package/lib/structures/ITtscGraphApplication.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphApplication.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphApplication.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphDecorator.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphDecorator.js.map

package/lib/structures/ITtscGraphDecorator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphDecorator.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphDecorator.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphDiagnostic.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphDiagnostic.js.map

package/lib/structures/ITtscGraphDiagnostic.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphDiagnostic.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphDiagnostic.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphDump.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphDump.js.map

package/lib/structures/ITtscGraphDump.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphDump.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphDump.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphEdge.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphEdge.js.map

package/lib/structures/ITtscGraphEdge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphEdge.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphEdge.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphEvidence.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphEvidence.js.map

package/lib/structures/ITtscGraphEvidence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphEvidence.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphEvidence.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphExpand.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphExpand.js.map

package/lib/structures/ITtscGraphExpand.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphExpand.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphExpand.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphIndex.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphIndex.js.map

package/lib/structures/ITtscGraphIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphIndex.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphIndex.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphNode.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphNode.js.map

package/lib/structures/ITtscGraphNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphNode.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphNode.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphOverview.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphOverview.js.map

package/lib/structures/ITtscGraphOverview.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphOverview.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphOverview.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphQuery.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphQuery.js.map

package/lib/structures/ITtscGraphQuery.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphQuery.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphQuery.ts"],"names":[],"mappings":""}

package/lib/structures/ITtscGraphTrace.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=ITtscGraphTrace.js.map

package/lib/structures/ITtscGraphTrace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphTrace.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphTrace.ts"],"names":[],"mappings":""}

package/lib/structures/TtscGraphEdgeKind.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=TtscGraphEdgeKind.js.map

package/lib/structures/TtscGraphEdgeKind.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TtscGraphEdgeKind.js","sourceRoot":"","sources":["../../src/structures/TtscGraphEdgeKind.ts"],"names":[],"mappings":""}

package/lib/structures/TtscGraphNodeKind.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=TtscGraphNodeKind.js.map

package/lib/structures/TtscGraphNodeKind.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TtscGraphNodeKind.js","sourceRoot":"","sources":["../../src/structures/TtscGraphNodeKind.ts"],"names":[],"mappings":""}

package/lib/structures/TtscGraphNodeModifier.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=TtscGraphNodeModifier.js.map

package/lib/structures/TtscGraphNodeModifier.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TtscGraphNodeModifier.js","sourceRoot":"","sources":["../../src/structures/TtscGraphNodeModifier.ts"],"names":[],"mappings":""}

package/lib/structures/index.js

@@ -0,0 +1,37 @@
+"use strict";
+// The canonical graph data model and tool I/O types: the wire contract
+// `ttscgraph dump` emits and the MCP server loads, plus the schemas typia
+// derives the tool surface from. Pure types so typia can build validators and
+// tool schemas at build time, and so the Go `dump.go` writer has one TypeScript
+// source of truth to mirror.
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./ITtscGraphApplication"), exports);
+__exportStar(require("./ITtscGraphDecorator"), exports);
+__exportStar(require("./ITtscGraphDiagnostic"), exports);
+__exportStar(require("./ITtscGraphDump"), exports);
+__exportStar(require("./ITtscGraphEdge"), exports);
+__exportStar(require("./ITtscGraphEvidence"), exports);
+__exportStar(require("./ITtscGraphExpand"), exports);
+__exportStar(require("./ITtscGraphIndex"), exports);
+__exportStar(require("./ITtscGraphNode"), exports);
+__exportStar(require("./ITtscGraphOverview"), exports);
+__exportStar(require("./ITtscGraphQuery"), exports);
+__exportStar(require("./ITtscGraphTrace"), exports);
+__exportStar(require("./TtscGraphEdgeKind"), exports);
+__exportStar(require("./TtscGraphNodeKind"), exports);
+__exportStar(require("./TtscGraphNodeModifier"), exports);
+//# sourceMappingURL=index.js.map

package/lib/structures/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/structures/index.ts"],"names":[],"mappings":";AAAA,uEAAuE;AACvE,0EAA0E;AAC1E,8EAA8E;AAC9E,gFAAgF;AAChF,6BAA6B;;;;;;;;;;;;;;;;AAE7B,0DAAwC;AACxC,wDAAsC;AACtC,yDAAuC;AACvC,mDAAiC;AACjC,mDAAiC;AACjC,uDAAqC;AACrC,qDAAmC;AACnC,oDAAkC;AAClC,mDAAiC;AACjC,uDAAqC;AACrC,oDAAkC;AAClC,oDAAkC;AAClC,sDAAoC;AACpC,sDAAoC;AACpC,0DAAwC"}