@ttsc/graph 0.16.4 → 0.16.6

package/lib/server/runTrace.js

@@ -0,0 +1,314 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.runTrace = runTrace;
+const accessAliases_1 = require("./accessAliases");
+const resolveHandle_1 = require("./resolveHandle");
+const runDetails_1 = require("./runDetails");
+const DEFAULT_DEPTH = 2;
+const DEFAULT_MAX_NODES = 6;
+const MAX_OPEN_DEPTH = 2;
+const MAX_OPEN_NODES = 8;
+const MAX_HOPS_PER_NODE = 1;
+const MAX_STEPS = 6;
+const MAX_NEXT_HANDLES = 2;
+/**
+ * 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 focus = props.focus ?? "all";
+    const maxDepth = bound(props.maxDepth, DEFAULT_DEPTH, 1, MAX_OPEN_DEPTH);
+    const maxNodes = bound(props.maxNodes, DEFAULT_MAX_NODES, 1, MAX_OPEN_NODES);
+    const maxHops = maxNodes * MAX_HOPS_PER_NODE;
+    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 {
+            type: "trace",
+            direction,
+            hops: [],
+            reached: [],
+            truncated: false,
+            candidates: start.candidates.map((n) => summary(graph, n)),
+        };
+    }
+    if (start.node === undefined) {
+        return {
+            type: "trace",
+            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 = {
+            type: "trace",
+            direction: "path",
+            hops: [],
+            reached: [],
+            truncated: false,
+        };
+        const target = (0, resolveHandle_1.resolveGraphHandle)(graph, props.to);
+        if (target.candidates) {
+            return {
+                ...base,
+                start: summary(graph, start.node),
+                candidates: target.candidates.map((n) => summary(graph, n)),
+            };
+        }
+        if (target.node === undefined) {
+            return { ...base, start: summary(graph, start.node) };
+        }
+        const found = findPath(graph, start.node.id, target.node.id, bound(props.maxDepth, 12, 1, 12), focus);
+        const path = found?.path ?? [];
+        const hops = found?.hops ?? [];
+        return {
+            ...base,
+            start: summary(graph, start.node),
+            target: summary(graph, target.node),
+            hops,
+            path: path.map((node, i) => summary(graph, node, i, false, true)),
+            steps: traceSteps(graph, hops),
+            next: nextFromPath(path),
+        };
+    }
+    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, focus))
+                    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,
+                };
+                const evidence = (0, runDetails_1.edgeEvidenceOf)(edge);
+                if (evidence !== undefined)
+                    hop.evidence = evidence;
+                const aliases = (0, accessAliases_1.accessAliasesFor)(graph.node(edge.to), (0, runDetails_1.edgeEvidenceTextOf)(edge));
+                if (aliases !== undefined)
+                    hop.aliases = aliases;
+                // A back-edge to the start or an already-reached node: record the hop;
+                // its endpoints are already represented.
+                if (visited.has(otherId)) {
+                    if (hops.length >= maxHops)
+                        truncated = true;
+                    else
+                        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;
+                }
+                if (hops.length >= maxHops) {
+                    truncated = true;
+                    continue;
+                }
+                visited.add(otherId);
+                reached.set(otherId, summary(graph, other, depth + 1, withRoles));
+                next.push({ id: otherId, depth: depth + 1 });
+                hops.push(hop);
+            }
+        }
+        queue = next;
+    }
+    return {
+        type: "trace",
+        start: summary(graph, start.node),
+        direction,
+        hops,
+        reached: [...reached.values()],
+        steps: traceSteps(graph, hops),
+        next: {
+            details: [start.node.id, ...reached.keys()].slice(0, MAX_NEXT_HANDLES),
+            traceFrom: [...reached.keys()].slice(0, MAX_NEXT_HANDLES),
+        },
+        truncated,
+    };
+}
+function nextFromPath(path) {
+    return {
+        details: path.map((node) => node.id),
+        traceFrom: path.length > 0 ? [path[path.length - 1].id] : [],
+    };
+}
+function traceSteps(graph, hops) {
+    return hops.slice(0, MAX_STEPS).map((hop) => {
+        const from = graph.node(hop.from);
+        const to = graph.node(hop.to);
+        const lhs = from?.qualifiedName ?? from?.name ?? hop.from;
+        const rhs = to?.qualifiedName ?? to?.name ?? hop.to;
+        const evidence = hop.evidence === undefined
+            ? ""
+            : ` at ${hop.evidence.file}:${hop.evidence.startLine}`;
+        const aliases = hop.aliases === undefined ? "" : ` aliases ${hop.aliases.join(", ")}`;
+        return `${lhs} -[${hop.kind}${evidence}${aliases}]-> ${rhs}`;
+    });
+}
+/**
+ * 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, focus) {
+    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, focus))
+                    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);
+                const evidence = (0, runDetails_1.edgeEvidenceOf)(edge);
+                parent.set(otherId, {
+                    via: id,
+                    kind: edge.kind,
+                    evidence,
+                    evidenceText: (0, runDetails_1.edgeEvidenceTextOf)(edge),
+                });
+                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];
+                        const parentEdge = parent.get(node.id);
+                        const hop = {
+                            from: path[i - 1].id,
+                            to: node.id,
+                            kind: parentEdge?.kind ?? "calls",
+                            depth: i,
+                        };
+                        if (parentEdge?.evidence !== undefined)
+                            hop.evidence = parentEdge.evidence;
+                        const aliases = (0, accessAliases_1.accessAliasesFor)(node, parentEdge?.evidenceText);
+                        if (aliases !== undefined)
+                            hop.aliases = aliases;
+                        hops.push(hop);
+                    }
+                    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(graph, node, depth, withRoles = false, withSignature = false) {
+    const out = {
+        id: node.id,
+        name: node.qualifiedName ?? node.name,
+        kind: node.kind,
+        file: node.file,
+    };
+    if (depth !== undefined)
+        out.depth = depth;
+    if (withSignature) {
+        const sig = (0, runDetails_1.signatureOf)(graph.project, node);
+        if (sig !== undefined)
+            out.signature = sig;
+    }
+    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, focus) {
+    if (kind === "contains" || kind === "exports" || kind === "imports") {
+        return false;
+    }
+    if (focus === "execution") {
+        return (kind === "calls" ||
+            kind === "instantiates" ||
+            kind === "accesses" ||
+            kind === "renders");
+    }
+    if (focus === "types") {
+        return (kind === "type_ref" ||
+            kind === "extends" ||
+            kind === "implements" ||
+            kind === "overrides" ||
+            kind === "decorates");
+    }
+    return true;
+}
+function isTestFile(file) {
+    return (/(^|\/)(test|tests|__tests__|spec)\//.test(file) ||
+        /\.(test|spec)\.[cm]?tsx?$/.test(file));
+}
+function bound(value, fallback, min, max) {
+    const n = value === undefined || !Number.isFinite(value) ? fallback : value;
+    return Math.max(min, Math.min(max, Math.floor(n)));
+}
+//# 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":";;;AAIA,mDAAmD;AACnD,mDAAqD;AACrD,6CAA+E;AAE/E,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,cAAc,GAAG,CAAC,CAAC;AACzB,MAAM,cAAc,GAAG,CAAC,CAAC;AACzB,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B,MAAM,SAAS,GAAG,CAAC,CAAC;AACpB,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAE3B;;;;;;GAMG;AACH,kBACE,KAAsB,EACtB,KAA+B;IAE/B,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,SAAS,CAAC;IAC/C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC;IACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,aAAa,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IACzE,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,iBAAiB,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC;IAC7E,MAAM,OAAO,GAAG,QAAQ,GAAG,iBAAiB,CAAC;IAC7C,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,IAAI,EAAE,OAAO;YACb,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,KAAK,EAAE,CAAC,CAAC,CAAC;SAC3D,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC7B,OAAO;YACL,IAAI,EAAE,OAAO;YACb,SAAS;YACT,IAAI,EAAE,EAAE;YACR,OAAO,EAAE,EAAE;YACX,SAAS,EAAE,KAAK;SACjB,CAAC;IACJ,CAAC;IAED,4EAA4E;IAC5E,4EAA4E;IAC5E,IAAI,KAAK,CAAC,EAAE,KAAK,SAAS,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG;YACX,IAAI,EAAE,OAAgB;YACtB,SAAS,EAAE,MAAM;YACjB,IAAI,EAAE,EAAE;YACR,OAAO,EAAE,EAAE;YACX,SAAS,EAAE,KAAK;SACjB,CAAC;QACF,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,EAAE,KAAK,CAAC,IAAI,CAAC;gBACjC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;aAC5D,CAAC;QACJ,CAAC;QACD,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC9B,OAAO,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACxD,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CACpB,KAAK,EACL,KAAK,CAAC,IAAI,CAAC,EAAE,EACb,MAAM,CAAC,IAAI,CAAC,EAAE,EACd,KAAK,CAAC,KAAK,CAAC,QAAQ,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAChC,KAAK,CACN,CAAC;QACF,MAAM,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,EAAE,CAAC;QAC/B,OAAO;YACL,GAAG,IAAI;YACP,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC;YACjC,MAAM,EAAE,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC;YACnC,IAAI;YACJ,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACjE,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC;YAC9B,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC;SACzB,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,EAAE,KAAK,CAAC;oBAAE,SAAS;gBAC7C,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,GAAyB;oBAChC,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,MAAM,QAAQ,GAAG,IAAA,2BAAc,EAAC,IAAI,CAAC,CAAC;gBACtC,IAAI,QAAQ,KAAK,SAAS;oBAAE,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBACpD,MAAM,OAAO,GAAG,IAAA,gCAAgB,EAC9B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EACnB,IAAA,+BAAkB,EAAC,IAAI,CAAC,CACzB,CAAC;gBACF,IAAI,OAAO,KAAK,SAAS;oBAAE,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC;gBACjD,uEAAuE;gBACvE,yCAAyC;gBACzC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBACzB,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO;wBAAE,SAAS,GAAG,IAAI,CAAC;;wBACxC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACpB,SAAS;gBACX,CAAC;gBACD,sEAAsE;gBACtE,8DAA8D;gBAC9D,IAAI,OAAO,CAAC,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC7B,SAAS,GAAG,IAAI,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC3B,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,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;gBAClE,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,IAAI,EAAE,OAAO;QACb,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC;QACjC,SAAS;QACT,IAAI;QACJ,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,KAAK,EAAE,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC;QAC9B,IAAI,EAAE;YACJ,OAAO,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC;YACtE,SAAS,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,gBAAgB,CAAC;SAC1D;QACD,SAAS;KACV,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,IAAsB;IAC1C,OAAO;QACL,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACpC,SAAS,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;KAC9D,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CACjB,KAAsB,EACtB,IAA4B;IAE5B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClC,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,EAAE,aAAa,IAAI,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC;QAC1D,MAAM,GAAG,GAAG,EAAE,EAAE,aAAa,IAAI,EAAE,EAAE,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACpD,MAAM,QAAQ,GACZ,GAAG,CAAC,QAAQ,KAAK,SAAS;YACxB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,SAAS,EAAE,CAAC;QAC3D,MAAM,OAAO,GACX,GAAG,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QACxE,OAAO,GAAG,GAAG,MAAM,GAAG,CAAC,IAAI,GAAG,QAAQ,GAAG,OAAO,OAAO,GAAG,EAAE,CAAC;IAC/D,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;GAIG;AACH,SAAS,QAAQ,CACf,KAAsB,EACtB,OAAe,EACf,QAAgB,EAChB,QAAgB,EAChB,KAAwC;IAExC,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,EAQnB,CAAC;IACJ,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,EAAE,KAAK,CAAC;oBAAE,SAAS;gBAC7C,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,QAAQ,GAAG,IAAA,2BAAc,EAAC,IAAI,CAAC,CAAC;gBACtC,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE;oBAClB,GAAG,EAAE,EAAE;oBACP,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,QAAQ;oBACR,YAAY,EAAE,IAAA,+BAAkB,EAAC,IAAI,CAAC;iBACvC,CAAC,CAAC;gBACH,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,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;wBACvC,MAAM,GAAG,GAAyB;4BAChC,IAAI,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE;4BACrB,EAAE,EAAE,IAAI,CAAC,EAAE;4BACX,IAAI,EAAE,UAAU,EAAE,IAAI,IAAI,OAAO;4BACjC,KAAK,EAAE,CAAC;yBACT,CAAC;wBACF,IAAI,UAAU,EAAE,QAAQ,KAAK,SAAS;4BACpC,GAAG,CAAC,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAC;wBACrC,MAAM,OAAO,GAAG,IAAA,gCAAgB,EAAC,IAAI,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;wBACjE,IAAI,OAAO,KAAK,SAAS;4BAAE,GAAG,CAAC,OAAO,GAAG,OAAO,CAAC;wBACjD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;oBACjB,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,KAAsB,EACtB,IAAoB,EACpB,KAAc,EACd,SAAS,GAAG,KAAK,EACjB,aAAa,GAAG,KAAK;IAErB,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,aAAa,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,IAAA,wBAAW,EAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC7C,IAAI,GAAG,KAAK,SAAS;YAAE,GAAG,CAAC,SAAS,GAAG,GAAG,CAAC;IAC7C,CAAC;IACD,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,CAClB,IAAY,EACZ,KAAwC;IAExC,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACpE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,KAAK,KAAK,WAAW,EAAE,CAAC;QAC1B,OAAO,CACL,IAAI,KAAK,OAAO;YAChB,IAAI,KAAK,cAAc;YACvB,IAAI,KAAK,UAAU;YACnB,IAAI,KAAK,SAAS,CACnB,CAAC;IACJ,CAAC;IACD,IAAI,KAAK,KAAK,OAAO,EAAE,CAAC;QACtB,OAAO,CACL,IAAI,KAAK,UAAU;YACnB,IAAI,KAAK,SAAS;YAClB,IAAI,KAAK,YAAY;YACrB,IAAI,KAAK,WAAW;YACpB,IAAI,KAAK,WAAW,CACrB,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,CAAC;AACd,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,SAAS,KAAK,CACZ,KAAyB,EACzB,QAAgB,EAChB,GAAW,EACX,GAAW;IAEX,MAAM,CAAC,GAAG,KAAK,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC;IAC5E,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrD,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/ITtscGraphDetails.js

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

package/lib/structures/ITtscGraphDetails.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphDetails.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphDetails.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/ITtscGraphEntrypoints.js

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

package/lib/structures/ITtscGraphEntrypoints.js.map

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

package/lib/structures/ITtscGraphEscape.js

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

package/lib/structures/ITtscGraphEscape.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphEscape.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphEscape.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/ITtscGraphLookup.js

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

package/lib/structures/ITtscGraphLookup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ITtscGraphLookup.js","sourceRoot":"","sources":["../../src/structures/ITtscGraphLookup.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/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,38 @@
+"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("./ITtscGraphEscape"), exports);
+__exportStar(require("./ITtscGraphDetails"), exports);
+__exportStar(require("./ITtscGraphEntrypoints"), exports);
+__exportStar(require("./ITtscGraphNode"), exports);
+__exportStar(require("./ITtscGraphOverview"), exports);
+__exportStar(require("./ITtscGraphLookup"), 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,sDAAoC;AACpC,0DAAwC;AACxC,mDAAiC;AACjC,uDAAqC;AACrC,qDAAmC;AACnC,oDAAkC;AAClC,sDAAoC;AACpC,sDAAoC;AACpC,0DAAwC"}