@nanonets/graft 0.5.0 → 0.6.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +11 -9
- package/dist/ai/crux.d.ts +20 -4
- package/dist/ai/crux.d.ts.map +1 -1
- package/dist/ai/crux.js +39 -41
- package/dist/ai/crux.js.map +1 -1
- package/dist/ai/llm/anthropic.d.ts +37 -0
- package/dist/ai/llm/anthropic.d.ts.map +1 -0
- package/dist/ai/llm/anthropic.js +141 -0
- package/dist/ai/llm/anthropic.js.map +1 -0
- package/dist/ai/llm/factory.d.ts +19 -0
- package/dist/ai/llm/factory.d.ts.map +1 -0
- package/dist/ai/llm/factory.js +20 -0
- package/dist/ai/llm/factory.js.map +1 -0
- package/dist/ai/llm/openai.d.ts +33 -0
- package/dist/ai/llm/openai.d.ts.map +1 -0
- package/dist/ai/llm/openai.js +146 -0
- package/dist/ai/llm/openai.js.map +1 -0
- package/dist/ai/llm/types.d.ts +113 -0
- package/dist/ai/llm/types.d.ts.map +1 -0
- package/dist/ai/llm/types.js +22 -0
- package/dist/ai/llm/types.js.map +1 -0
- package/dist/ai/providers.d.ts +37 -15
- package/dist/ai/providers.d.ts.map +1 -1
- package/dist/ai/providers.js +30 -5
- package/dist/ai/providers.js.map +1 -1
- package/dist/ai/summarize.d.ts +4 -4
- package/dist/ai/summarize.d.ts.map +1 -1
- package/dist/ai/summarize.js +6 -13
- package/dist/ai/summarize.js.map +1 -1
- package/dist/ai/synthesize.d.ts +12 -4
- package/dist/ai/synthesize.d.ts.map +1 -1
- package/dist/ai/synthesize.js +18 -34
- package/dist/ai/synthesize.js.map +1 -1
- package/dist/ask/ask.d.ts +3 -0
- package/dist/ask/ask.d.ts.map +1 -1
- package/dist/ask/ask.js +20 -18
- package/dist/ask/ask.js.map +1 -1
- package/dist/ask/fuse.d.ts +96 -0
- package/dist/ask/fuse.d.ts.map +1 -0
- package/dist/ask/fuse.js +184 -0
- package/dist/ask/fuse.js.map +1 -0
- package/dist/claude/format.d.ts.map +1 -1
- package/dist/claude/format.js +10 -2
- package/dist/claude/format.js.map +1 -1
- package/dist/claude/init.d.ts +3 -0
- package/dist/claude/init.d.ts.map +1 -1
- package/dist/claude/init.js +6 -1
- package/dist/claude/init.js.map +1 -1
- package/dist/claude/skill-template.d.ts.map +1 -1
- package/dist/claude/skill-template.js +34 -22
- package/dist/claude/skill-template.js.map +1 -1
- package/dist/cli.d.ts +3 -2
- package/dist/cli.d.ts.map +1 -1
- package/dist/cli.js +50 -37
- package/dist/cli.js.map +1 -1
- package/dist/context/savings.d.ts +34 -0
- package/dist/context/savings.d.ts.map +1 -0
- package/dist/context/savings.js +49 -0
- package/dist/context/savings.js.map +1 -0
- package/dist/engine.d.ts +4 -3
- package/dist/engine.d.ts.map +1 -1
- package/dist/engine.js +30 -19
- package/dist/engine.js.map +1 -1
- package/dist/graph/map.d.ts +4 -0
- package/dist/graph/map.d.ts.map +1 -1
- package/dist/graph/map.js +4 -1
- package/dist/graph/map.js.map +1 -1
- package/dist/graph/scopes.d.ts +30 -0
- package/dist/graph/scopes.d.ts.map +1 -0
- package/dist/graph/scopes.js +369 -0
- package/dist/graph/scopes.js.map +1 -0
- package/dist/graph/traverse-cli.d.ts +28 -18
- package/dist/graph/traverse-cli.d.ts.map +1 -1
- package/dist/graph/traverse-cli.js +68 -43
- package/dist/graph/traverse-cli.js.map +1 -1
- package/dist/graph/traverse.d.ts +35 -14
- package/dist/graph/traverse.d.ts.map +1 -1
- package/dist/graph/traverse.js +46 -20
- package/dist/graph/traverse.js.map +1 -1
- package/dist/graph/workspace.d.ts +136 -0
- package/dist/graph/workspace.d.ts.map +1 -0
- package/dist/graph/workspace.js +339 -0
- package/dist/graph/workspace.js.map +1 -0
- package/dist/hosts/instructions.d.ts.map +1 -1
- package/dist/hosts/instructions.js +4 -3
- package/dist/hosts/instructions.js.map +1 -1
- package/dist/hosts/mcp-config.d.ts +5 -0
- package/dist/hosts/mcp-config.d.ts.map +1 -1
- package/dist/hosts/mcp-config.js +2 -2
- package/dist/hosts/mcp-config.js.map +1 -1
- package/dist/index.d.ts +9 -3
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +8 -4
- package/dist/index.js.map +1 -1
- package/dist/mcp/tools.d.ts.map +1 -1
- package/dist/mcp/tools.js +33 -65
- package/dist/mcp/tools.js.map +1 -1
- package/dist/search/grep-cli.d.ts.map +1 -1
- package/dist/search/grep-cli.js +4 -0
- package/dist/search/grep-cli.js.map +1 -1
- package/dist/search/grep.d.ts +4 -0
- package/dist/search/grep.d.ts.map +1 -1
- package/dist/search/grep.js +2 -0
- package/dist/search/grep.js.map +1 -1
- package/package.json +2 -1
|
@@ -1,45 +1,56 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* CLI wiring for `graft callers`
|
|
2
|
+
* CLI wiring for `graft callers` and its `--direction` / `--depth` flags.
|
|
3
3
|
*
|
|
4
|
-
*
|
|
5
|
-
*
|
|
6
|
-
*
|
|
7
|
-
*
|
|
8
|
-
*
|
|
9
|
-
*
|
|
4
|
+
* One command, one implementation: resolve a symbol via `resolveSymbol`, walk
|
|
5
|
+
* edges via `edgeWalk` (incoming or outgoing, depth 1 or a BFS), and share the
|
|
6
|
+
* same resolve-or-die flow, human formatter, and --json shape. Kept out of
|
|
7
|
+
* cli.ts so that file stays thin (argument wiring only) and this logic stays
|
|
8
|
+
* unit-testable without shelling out to the CLI on every case.
|
|
9
|
+
*
|
|
10
|
+
* `--direction out` subsumes the old `graft callees`; `--depth N` subsumes the
|
|
11
|
+
* old `graft impact`. Exported formatters are reused by the MCP `graft_callers`
|
|
12
|
+
* tool (`src/mcp/tools.ts`), so both surfaces render identical reports.
|
|
10
13
|
*/
|
|
11
14
|
import { resolve } from "node:path";
|
|
12
15
|
import { contextDirFor } from "../context/node-file.js";
|
|
16
|
+
import { savingsFooter, savingsFor } from "../context/savings.js";
|
|
13
17
|
import { loadGraphCached } from "./load.js";
|
|
14
|
-
import { resolveSymbol,
|
|
15
|
-
const ARROW = {
|
|
16
|
-
const
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
if (kind === "callees")
|
|
21
|
-
return calleesOf(graph, node);
|
|
22
|
-
return impactOf(graph, node, depth);
|
|
23
|
-
}
|
|
24
|
-
/** Exported so the MCP tools (`graft_callers`/`graft_callees`/`graft_blast_radius`
|
|
25
|
-
* in `src/mcp/tools.ts`) can render the same human report format as the CLI,
|
|
26
|
-
* rather than re-implementing it — both surfaces walk the same edges via the
|
|
27
|
-
* same `resolveSymbol`/`callersOf`/`calleesOf`/`impactOf` core. */
|
|
18
|
+
import { resolveSymbol, edgeWalk } from "./traverse.js";
|
|
19
|
+
const ARROW = { in: "←", out: "→" };
|
|
20
|
+
const DEFAULT_DEPTH = 1;
|
|
21
|
+
/** Exported so the MCP `graft_callers` tool (`src/mcp/tools.ts`) can render the
|
|
22
|
+
* same human report format as the CLI, rather than re-implementing it — both
|
|
23
|
+
* surfaces walk the same edges via the same `resolveSymbol` / `edgeWalk` core. */
|
|
28
24
|
export function headerOf(n) {
|
|
29
25
|
return `${n.name} · ${n.kind} · ${n.path}:${n.span}`;
|
|
30
26
|
}
|
|
31
|
-
|
|
32
|
-
|
|
33
|
-
|
|
27
|
+
/** `showDepth` is set for multi-hop walks (depth > 1), matching the old
|
|
28
|
+
* `graft impact` output which tagged every hit with its BFS depth. */
|
|
29
|
+
export function hitLine(direction, hit, showDepth) {
|
|
30
|
+
const arrow = ARROW[direction];
|
|
31
|
+
const depthTag = showDepth ? ` [depth ${hit.depth}]` : "";
|
|
34
32
|
const label = hit.node ? `${hit.node.name} (${hit.node.path}:${hit.node.span})` : `${hit.id} (unresolved import)`;
|
|
35
33
|
return ` ${hit.relation} ${arrow} ${label}${depthTag}`;
|
|
36
34
|
}
|
|
37
|
-
/**
|
|
38
|
-
*
|
|
39
|
-
|
|
40
|
-
|
|
41
|
-
|
|
42
|
-
|
|
35
|
+
/** Tokens-saved baseline for a callers/callees walk: the files of the matched
|
|
36
|
+
* symbols plus every resolved edge endpoint, read whole — the files you'd open
|
|
37
|
+
* to trace these edges by hand. Shared by the CLI and the MCP tool so both
|
|
38
|
+
* surfaces report the same number. */
|
|
39
|
+
export function callersSavings(graph, results) {
|
|
40
|
+
const paths = [];
|
|
41
|
+
for (const { symbol, hits } of results) {
|
|
42
|
+
paths.push(symbol.path);
|
|
43
|
+
for (const h of hits)
|
|
44
|
+
if (h.node)
|
|
45
|
+
paths.push(h.node.path);
|
|
46
|
+
}
|
|
47
|
+
return savingsFor(graph, paths);
|
|
48
|
+
}
|
|
49
|
+
/** Loud, actionable empty-result note — never a bare empty list. */
|
|
50
|
+
export function looseNoteFor(direction, name) {
|
|
51
|
+
const label = direction === "out" ? "callees" : "callers";
|
|
52
|
+
const dir = direction === "out" ? "outgoing" : "incoming";
|
|
53
|
+
return ` no indexed ${label} — the graph has no ${dir} call/reference edges for this symbol; try grep -rn "${name}"`;
|
|
43
54
|
}
|
|
44
55
|
function symbolJson(n) {
|
|
45
56
|
return { id: n.id, name: n.name, kind: n.kind, path: n.path, span: n.span };
|
|
@@ -54,13 +65,22 @@ function hitJson(hit) {
|
|
|
54
65
|
}
|
|
55
66
|
return out;
|
|
56
67
|
}
|
|
68
|
+
/** Parse and validate the raw `--direction` string; exits (code 1) on garbage. */
|
|
69
|
+
function resolveDirection(raw) {
|
|
70
|
+
if (raw === undefined)
|
|
71
|
+
return "in";
|
|
72
|
+
if (raw === "in" || raw === "out")
|
|
73
|
+
return raw;
|
|
74
|
+
console.error(`✗ --direction must be "in" or "out", got "${raw}"`);
|
|
75
|
+
process.exit(1);
|
|
76
|
+
}
|
|
57
77
|
/**
|
|
58
|
-
* Resolve `query` in the graph at `dir` (respecting `--dir`/`--in`), walk
|
|
59
|
-
*
|
|
60
|
-
* process (code 1) when there's no graph at all or the symbol is
|
|
61
|
-
* both are caller-facing mistakes, not recoverable states.
|
|
78
|
+
* Resolve `query` in the graph at `dir` (respecting `--dir`/`--in`), walk edges
|
|
79
|
+
* per `--direction`/`--depth`, and print either the human report or `--json`.
|
|
80
|
+
* Exits the process (code 1) when there's no graph at all or the symbol is
|
|
81
|
+
* unknown — both are caller-facing mistakes, not recoverable states.
|
|
62
82
|
*/
|
|
63
|
-
export function
|
|
83
|
+
export function runCallersCommand(query, dir, opts) {
|
|
64
84
|
const root = resolve(dir);
|
|
65
85
|
const contextDir = contextDirFor(root, opts.globalDir);
|
|
66
86
|
const graph = loadGraphCached(contextDir);
|
|
@@ -73,26 +93,30 @@ export function runTraverseCommand(kind, query, dir, opts) {
|
|
|
73
93
|
console.error(`✗ no symbol "${query}" in the graph — check spelling or run graft build`);
|
|
74
94
|
process.exit(1);
|
|
75
95
|
}
|
|
76
|
-
|
|
77
|
-
|
|
96
|
+
const direction = resolveDirection(opts.direction);
|
|
97
|
+
let depth = DEFAULT_DEPTH;
|
|
98
|
+
if (opts.depth !== undefined) {
|
|
78
99
|
const d = Number(opts.depth);
|
|
79
100
|
if (!Number.isFinite(d) || d < 1) {
|
|
80
101
|
console.error(`✗ --depth must be a positive number, got "${opts.depth}"`);
|
|
81
102
|
process.exit(1);
|
|
82
103
|
}
|
|
83
|
-
depth = d;
|
|
104
|
+
depth = Math.floor(d);
|
|
84
105
|
}
|
|
85
|
-
const
|
|
106
|
+
const showDepth = depth > 1;
|
|
107
|
+
const results = matches.map((symbol) => ({ symbol, hits: edgeWalk(graph, symbol, direction, depth) }));
|
|
108
|
+
const saved = callersSavings(graph, results);
|
|
86
109
|
if (opts.json) {
|
|
87
110
|
const payload = {
|
|
88
111
|
query,
|
|
89
112
|
matches: results.map((r) => {
|
|
90
113
|
const m = { symbol: symbolJson(r.symbol), hits: r.hits.map(hitJson) };
|
|
91
114
|
if (r.hits.length === 0) {
|
|
92
|
-
m.note = looseNoteFor(
|
|
115
|
+
m.note = looseNoteFor(direction, r.symbol.name);
|
|
93
116
|
}
|
|
94
117
|
return m;
|
|
95
118
|
}),
|
|
119
|
+
saved,
|
|
96
120
|
};
|
|
97
121
|
console.log(JSON.stringify(payload, null, 2));
|
|
98
122
|
return;
|
|
@@ -101,12 +125,13 @@ export function runTraverseCommand(kind, query, dir, opts) {
|
|
|
101
125
|
for (const { symbol, hits } of results) {
|
|
102
126
|
lines.push(headerOf(symbol));
|
|
103
127
|
if (hits.length === 0)
|
|
104
|
-
lines.push(looseNoteFor(
|
|
128
|
+
lines.push(looseNoteFor(direction, symbol.name));
|
|
105
129
|
else
|
|
106
130
|
for (const h of hits)
|
|
107
|
-
lines.push(hitLine(
|
|
131
|
+
lines.push(hitLine(direction, h, showDepth));
|
|
108
132
|
lines.push("");
|
|
109
133
|
}
|
|
110
|
-
|
|
134
|
+
const body = lines.join("\n").replace(/\n+$/, "\n");
|
|
135
|
+
process.stdout.write(body + savingsFooter(body, saved));
|
|
111
136
|
}
|
|
112
137
|
//# sourceMappingURL=traverse-cli.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"traverse-cli.js","sourceRoot":"","sources":["../../src/graph/traverse-cli.ts"],"names":[],"mappings":"AAAA
|
|
1
|
+
{"version":3,"file":"traverse-cli.js","sourceRoot":"","sources":["../../src/graph/traverse-cli.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,UAAU,EAAgB,MAAM,uBAAuB,CAAC;AAChF,OAAO,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,EAAE,aAAa,EAAE,QAAQ,EAAgC,MAAM,eAAe,CAAC;AActF,MAAM,KAAK,GAAiC,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAClE,MAAM,aAAa,GAAG,CAAC,CAAC;AAExB;;kFAEkF;AAClF,MAAM,UAAU,QAAQ,CAAC,CAAS;IAChC,OAAO,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;AACvD,CAAC;AAED;sEACsE;AACtE,MAAM,UAAU,OAAO,CAAC,SAAoB,EAAE,GAAY,EAAE,SAAkB;IAC5E,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1D,MAAM,KAAK,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,sBAAsB,CAAC;IAClH,OAAO,KAAK,GAAG,CAAC,QAAQ,IAAI,KAAK,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;AAC1D,CAAC;AAED;;;sCAGsC;AACtC,MAAM,UAAU,cAAc,CAC5B,KAAc,EACd,OAA8C;IAE9C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxB,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,CAAC,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,oEAAoE;AACpE,MAAM,UAAU,YAAY,CAAC,SAAoB,EAAE,IAAY;IAC7D,MAAM,KAAK,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1D,MAAM,GAAG,GAAG,SAAS,KAAK,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;IAC1D,OAAO,gBAAgB,KAAK,uBAAuB,GAAG,wDAAwD,IAAI,GAAG,CAAC;AACxH,CAAC;AA0BD,SAAS,UAAU,CAAC,CAAS;IAC3B,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;AAC9E,CAAC;AAED,SAAS,OAAO,CAAC,GAAY;IAC3B,MAAM,GAAG,GAAY,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC;IAC9E,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;QACb,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QACzB,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QACzB,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QACzB,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;IAC3B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kFAAkF;AAClF,SAAS,gBAAgB,CAAC,GAAuB;IAC/C,IAAI,GAAG,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IACnC,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,KAAK;QAAE,OAAO,GAAG,CAAC;IAC9C,OAAO,CAAC,KAAK,CAAC,6CAA6C,GAAG,GAAG,CAAC,CAAC;IACnE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,GAAW,EAAE,IAAuB;IACnF,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC1B,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,eAAe,CAAC,UAAU,CAAC,CAAC;IAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,OAAO,CAAC,KAAK,CAAC,uBAAuB,UAAU,8BAA8B,CAAC,CAAC;QAC/E,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,OAAO,GAAG,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5E,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,CAAC,KAAK,CAAC,gBAAgB,KAAK,oDAAoD,CAAC,CAAC;QACzF,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,SAAS,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACnD,IAAI,KAAK,GAAG,aAAa,CAAC;IAC1B,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACjC,OAAO,CAAC,KAAK,CAAC,6CAA6C,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC1E,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IACD,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,CAAC;IAE5B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACvG,MAAM,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAE7C,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,MAAM,OAAO,GAAG;YACd,KAAK;YACL,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAa,EAAE;gBACpC,MAAM,CAAC,GAAc,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACjF,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACxB,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAClD,CAAC;gBACD,OAAO,CAAC,CAAC;YACX,CAAC,CAAC;YACF,KAAK;SACN,CAAC;QACF,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,OAAO;IACT,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;QACvC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;;YACnE,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC,CAAC;QACxE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IACD,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACpD,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,GAAG,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;AAC1D,CAAC"}
|
package/dist/graph/traverse.d.ts
CHANGED
|
@@ -1,17 +1,22 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* Pure graph-traversal core shared by `graft callers`
|
|
3
|
-
*
|
|
2
|
+
* Pure graph-traversal core shared by `graft callers` (its `--direction`/
|
|
3
|
+
* `--depth` flags), the MCP `graft_callers` tool, and `ask`'s structural
|
|
4
|
+
* intent path.
|
|
4
5
|
*
|
|
5
6
|
* Centralizes the symbol-resolution contract (bare name, qualified id-suffix,
|
|
6
|
-
* last-segment fallback, `--in` narrowing) so all
|
|
7
|
-
*
|
|
8
|
-
* (
|
|
7
|
+
* last-segment fallback, `--in` narrowing) so all surfaces agree on what a
|
|
8
|
+
* query like `Cache.get` or `hashstructure.Hash` means, and the direction-aware
|
|
9
|
+
* (incoming/outgoing) depth-1 and BFS edge walks over the wiring graph.
|
|
9
10
|
*
|
|
10
11
|
* No I/O here: callers pass in an already-loaded `GraphV1` (via
|
|
11
12
|
* `loadGraphCached`), which keeps this module trivially unit-testable against
|
|
12
13
|
* hand-built fixture graphs.
|
|
13
14
|
*/
|
|
14
15
|
import type { GraphV1, NodeV1, Relation } from "./types.js";
|
|
16
|
+
/** Which way to walk the wiring graph: `in` = incoming edges (who points at
|
|
17
|
+
* the symbol — callers / blast radius), `out` = outgoing edges (what the symbol
|
|
18
|
+
* points at — callees). */
|
|
19
|
+
export type Direction = "in" | "out";
|
|
15
20
|
/** A resolved symbol-search hit. Reserved for future disambiguation metadata
|
|
16
21
|
* (e.g. why a query matched); today it wraps the node 1:1. */
|
|
17
22
|
export interface SymbolMatch {
|
|
@@ -62,20 +67,22 @@ export declare function calleesOf(graph: GraphV1, symbol: NodeV1): EdgeHit[];
|
|
|
62
67
|
*/
|
|
63
68
|
export declare function impactOf(graph: GraphV1, symbol: NodeV1, maxDepth?: number): EdgeHit[];
|
|
64
69
|
/**
|
|
65
|
-
* BFS over
|
|
66
|
-
*
|
|
67
|
-
*
|
|
68
|
-
*
|
|
69
|
-
*
|
|
70
|
-
*
|
|
71
|
-
*
|
|
70
|
+
* BFS over walk-relation edges from *multiple* seed nodes at once, in the given
|
|
71
|
+
* `direction` (`in` = incoming, the default — "who breaks if this changes";
|
|
72
|
+
* `out` = outgoing — "what this reaches"). The multi-seed generalization of
|
|
73
|
+
* {@link impactOf} (`impactOf(g, n, d)` is exactly `impactOfMany(g, [n], d)`).
|
|
74
|
+
* Used when one logical unit spans several graph node ids — e.g. a file plus
|
|
75
|
+
* every symbol defined in it, since a `calls`/`references`/etc. edge from
|
|
76
|
+
* another file always targets the SYMBOL id, never the FILE id, so walking the
|
|
77
|
+
* file node alone misses dependents that call into it rather than merely
|
|
78
|
+
* importing it.
|
|
72
79
|
*
|
|
73
80
|
* Every seed is pre-marked visited (so a seed can never appear as its own
|
|
74
81
|
* hit, and an edge between two seeds is never reported), then the walk
|
|
75
82
|
* proceeds exactly like `impactOf`'s: each reached node deduped by id and
|
|
76
83
|
* reported once, at the depth it was first reached from *any* seed.
|
|
77
84
|
*/
|
|
78
|
-
export declare function impactOfMany(graph: GraphV1, seeds: NodeV1[], maxDepth?: number): EdgeHit[];
|
|
85
|
+
export declare function impactOfMany(graph: GraphV1, seeds: NodeV1[], maxDepth?: number, direction?: Direction): EdgeHit[];
|
|
79
86
|
/**
|
|
80
87
|
* `impactOf`, generalized for a `kind: 'file'` seed: aggregates the BFS over
|
|
81
88
|
* the file node AND every symbol node defined in that file (via
|
|
@@ -85,5 +92,19 @@ export declare function impactOfMany(graph: GraphV1, seeds: NodeV1[], maxDepth?:
|
|
|
85
92
|
* see this module's header and `impactOfMany`'s doc for why. Symbol-kind
|
|
86
93
|
* queries keep using plain `impactOf`; this is only for file-kind matches.
|
|
87
94
|
*/
|
|
88
|
-
export declare function impactOfFile(graph: GraphV1, fileNode: NodeV1, maxDepth?: number): EdgeHit[];
|
|
95
|
+
export declare function impactOfFile(graph: GraphV1, fileNode: NodeV1, maxDepth?: number, direction?: Direction): EdgeHit[];
|
|
96
|
+
/**
|
|
97
|
+
* The single entry point behind `graft callers` and the MCP `graft_callers`
|
|
98
|
+
* tool, covering all of what were once three commands:
|
|
99
|
+
* - `direction:in, depth:1` → callers (who calls/references this)
|
|
100
|
+
* - `direction:out, depth:1` → callees (what this calls/references)
|
|
101
|
+
* - `direction:in, depth>1` → blast radius (transitive dependents)
|
|
102
|
+
* - `direction:out, depth>1` → transitive dependencies
|
|
103
|
+
*
|
|
104
|
+
* Depth 1 uses the plain single-hop scan ({@link callersOf}/{@link calleesOf})
|
|
105
|
+
* so `graft callers <symbol>` output is unchanged. Depth >1 runs the BFS, and
|
|
106
|
+
* for a `kind: 'file'` seed aggregates over the symbols the file defines (see
|
|
107
|
+
* {@link impactOfMany}) so file-level dependents aren't silently dropped.
|
|
108
|
+
*/
|
|
109
|
+
export declare function edgeWalk(graph: GraphV1, node: NodeV1, direction: Direction, depth: number): EdgeHit[];
|
|
89
110
|
//# sourceMappingURL=traverse.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"traverse.d.ts","sourceRoot":"","sources":["../../src/graph/traverse.ts"],"names":[],"mappings":"AAAA
|
|
1
|
+
{"version":3,"file":"traverse.d.ts","sourceRoot":"","sources":["../../src/graph/traverse.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,OAAO,KAAK,EAAU,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAGpE;;2BAE2B;AAC3B,MAAM,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK,CAAC;AAErC;8DAC8D;AAC9D,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,oBAAoB;IACnC,uEAAuE;IACvE,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE,oBAAyB,GAAG,MAAM,EAAE,CAyBtG;AAaD;;gEAEgE;AAChE,MAAM,WAAW,OAAO;IACtB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,QAAQ,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,yEAAyE;AACzE,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,EAAE,CAQnE;AAED,6DAA6D;AAC7D,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,EAAE,CAQnE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,SAAI,GAAG,OAAO,EAAE,CAEhF;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,QAAQ,SAAI,EAAE,SAAS,GAAE,SAAgB,GAAG,OAAO,EAAE,CAmClH;AAQD;;;;;;;;GAQG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,SAAI,EAAE,SAAS,GAAE,SAAgB,GAAG,OAAO,EAAE,CAEnH;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,EAAE,CAIrG"}
|
package/dist/graph/traverse.js
CHANGED
|
@@ -82,32 +82,38 @@ export function impactOf(graph, symbol, maxDepth = 2) {
|
|
|
82
82
|
return impactOfMany(graph, [symbol], maxDepth);
|
|
83
83
|
}
|
|
84
84
|
/**
|
|
85
|
-
* BFS over
|
|
86
|
-
*
|
|
87
|
-
*
|
|
88
|
-
*
|
|
89
|
-
*
|
|
90
|
-
*
|
|
91
|
-
*
|
|
85
|
+
* BFS over walk-relation edges from *multiple* seed nodes at once, in the given
|
|
86
|
+
* `direction` (`in` = incoming, the default — "who breaks if this changes";
|
|
87
|
+
* `out` = outgoing — "what this reaches"). The multi-seed generalization of
|
|
88
|
+
* {@link impactOf} (`impactOf(g, n, d)` is exactly `impactOfMany(g, [n], d)`).
|
|
89
|
+
* Used when one logical unit spans several graph node ids — e.g. a file plus
|
|
90
|
+
* every symbol defined in it, since a `calls`/`references`/etc. edge from
|
|
91
|
+
* another file always targets the SYMBOL id, never the FILE id, so walking the
|
|
92
|
+
* file node alone misses dependents that call into it rather than merely
|
|
93
|
+
* importing it.
|
|
92
94
|
*
|
|
93
95
|
* Every seed is pre-marked visited (so a seed can never appear as its own
|
|
94
96
|
* hit, and an edge between two seeds is never reported), then the walk
|
|
95
97
|
* proceeds exactly like `impactOf`'s: each reached node deduped by id and
|
|
96
98
|
* reported once, at the depth it was first reached from *any* seed.
|
|
97
99
|
*/
|
|
98
|
-
export function impactOfMany(graph, seeds, maxDepth = 2) {
|
|
100
|
+
export function impactOfMany(graph, seeds, maxDepth = 2, direction = "in") {
|
|
99
101
|
const byId = new Map(graph.nodes.map((n) => [n.id, n]));
|
|
100
|
-
//
|
|
101
|
-
|
|
102
|
+
// Adjacency keyed for the walk direction, restricted to walk relations:
|
|
103
|
+
// 'in' → key = edge.target, neighbour = edge.source (who points AT key)
|
|
104
|
+
// 'out' → key = edge.source, neighbour = edge.target (what key points TO)
|
|
105
|
+
const adj = new Map();
|
|
102
106
|
for (const e of graph.edges) {
|
|
103
107
|
if (!WALK_RELATIONS.has(e.relation))
|
|
104
108
|
continue;
|
|
105
|
-
const
|
|
106
|
-
const
|
|
109
|
+
const key = direction === "in" ? e.target : e.source;
|
|
110
|
+
const other = direction === "in" ? e.source : e.target;
|
|
111
|
+
const entry = { other, relation: e.relation };
|
|
112
|
+
const arr = adj.get(key);
|
|
107
113
|
if (arr)
|
|
108
114
|
arr.push(entry);
|
|
109
115
|
else
|
|
110
|
-
|
|
116
|
+
adj.set(key, [entry]);
|
|
111
117
|
}
|
|
112
118
|
const visited = new Set(seeds.map((s) => s.id));
|
|
113
119
|
const hits = [];
|
|
@@ -115,12 +121,12 @@ export function impactOfMany(graph, seeds, maxDepth = 2) {
|
|
|
115
121
|
for (let depth = 1; depth <= maxDepth && frontier.length > 0; depth++) {
|
|
116
122
|
const next = [];
|
|
117
123
|
for (const current of frontier) {
|
|
118
|
-
for (const {
|
|
119
|
-
if (visited.has(
|
|
124
|
+
for (const { other, relation } of adj.get(current) ?? []) {
|
|
125
|
+
if (visited.has(other))
|
|
120
126
|
continue;
|
|
121
|
-
visited.add(
|
|
122
|
-
hits.push({ node: byId.get(
|
|
123
|
-
next.push(
|
|
127
|
+
visited.add(other);
|
|
128
|
+
hits.push({ node: byId.get(other) ?? null, id: other, relation, depth });
|
|
129
|
+
next.push(other);
|
|
124
130
|
}
|
|
125
131
|
}
|
|
126
132
|
frontier = next;
|
|
@@ -141,7 +147,27 @@ function symbolsInFile(graph, fileNode) {
|
|
|
141
147
|
* see this module's header and `impactOfMany`'s doc for why. Symbol-kind
|
|
142
148
|
* queries keep using plain `impactOf`; this is only for file-kind matches.
|
|
143
149
|
*/
|
|
144
|
-
export function impactOfFile(graph, fileNode, maxDepth = 2) {
|
|
145
|
-
return impactOfMany(graph, [fileNode, ...symbolsInFile(graph, fileNode)], maxDepth);
|
|
150
|
+
export function impactOfFile(graph, fileNode, maxDepth = 2, direction = "in") {
|
|
151
|
+
return impactOfMany(graph, [fileNode, ...symbolsInFile(graph, fileNode)], maxDepth, direction);
|
|
152
|
+
}
|
|
153
|
+
/**
|
|
154
|
+
* The single entry point behind `graft callers` and the MCP `graft_callers`
|
|
155
|
+
* tool, covering all of what were once three commands:
|
|
156
|
+
* - `direction:in, depth:1` → callers (who calls/references this)
|
|
157
|
+
* - `direction:out, depth:1` → callees (what this calls/references)
|
|
158
|
+
* - `direction:in, depth>1` → blast radius (transitive dependents)
|
|
159
|
+
* - `direction:out, depth>1` → transitive dependencies
|
|
160
|
+
*
|
|
161
|
+
* Depth 1 uses the plain single-hop scan ({@link callersOf}/{@link calleesOf})
|
|
162
|
+
* so `graft callers <symbol>` output is unchanged. Depth >1 runs the BFS, and
|
|
163
|
+
* for a `kind: 'file'` seed aggregates over the symbols the file defines (see
|
|
164
|
+
* {@link impactOfMany}) so file-level dependents aren't silently dropped.
|
|
165
|
+
*/
|
|
166
|
+
export function edgeWalk(graph, node, direction, depth) {
|
|
167
|
+
if (depth <= 1)
|
|
168
|
+
return direction === "in" ? callersOf(graph, node) : calleesOf(graph, node);
|
|
169
|
+
if (node.kind === "file")
|
|
170
|
+
return impactOfFile(graph, node, depth, direction);
|
|
171
|
+
return impactOfMany(graph, [node], depth, direction);
|
|
146
172
|
}
|
|
147
173
|
//# sourceMappingURL=traverse.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"traverse.js","sourceRoot":"","sources":["../../src/graph/traverse.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"traverse.js","sourceRoot":"","sources":["../../src/graph/traverse.ts"],"names":[],"mappings":"AAeA,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAkBhD;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,UAAU,aAAa,CAAC,KAAc,EAAE,KAAa,EAAE,OAA6B,EAAE;IAC1F,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IACvC,MAAM,iBAAiB,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAEtE,IAAI,OAAO,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;IAErD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QAC1E,IAAI,WAAW,EAAE,CAAC;YAChB,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,WAAW,CAAC,CAAC;QACjG,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,iBAAiB,EAAE,CAAC;QAC9C,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAC1B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,MAAM;YACjB,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,UAAU;gBAClC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,UAAU;gBACnC,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,GAAG,UAAU,CAAC,CAAC,CACrD,CAAC;IACJ,CAAC;IAED,IAAI,IAAI,CAAC,EAAE;QAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAG,CAAC,CAAC,CAAC;IACxE,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,aAAa,CAAC,KAAe,EAAE,UAAkB;IACxD,MAAM,UAAU,GAAG,GAAG,GAAG,UAAU,CAAC;IACpC,MAAM,SAAS,GAAG,GAAG,GAAG,UAAU,CAAC;IACnC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACxB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,KAAK,CAAC;QACpC,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,UAAU;YAAE,OAAO,IAAI,CAAC;QACrD,MAAM,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QACnC,OAAO,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;AACL,CAAC;AAYD,yEAAyE;AACzE,MAAM,UAAU,SAAS,CAAC,KAAc,EAAE,MAAc;IACtD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,IAAI,GAAc,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAiB,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE;YAAE,SAAS;QACxE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAChG,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,SAAS,CAAC,KAAc,EAAE,MAAc;IACtD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxD,MAAM,IAAI,GAAc,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAiB,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,EAAE;YAAE,SAAS;QACxE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAChG,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAc,EAAE,MAAc,EAAE,QAAQ,GAAG,CAAC;IACnE,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC;AACjD,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,YAAY,CAAC,KAAc,EAAE,KAAe,EAAE,QAAQ,GAAG,CAAC,EAAE,YAAuB,IAAI;IACrG,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,wEAAwE;IACxE,2EAA2E;IAC3E,4EAA4E;IAC5E,MAAM,GAAG,GAAG,IAAI,GAAG,EAAmD,CAAC;IACvE,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAiB,EAAE,CAAC;QACxC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC;YAAE,SAAS;QAC9C,MAAM,GAAG,GAAG,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACrD,MAAM,KAAK,GAAG,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACvD,MAAM,KAAK,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC;QAC9C,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;YACpB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,MAAM,IAAI,GAAc,EAAE,CAAC;IAC3B,IAAI,QAAQ,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;IAE5B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACtE,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,KAAK,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBACzD,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,SAAS;gBACjC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnB,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;gBACzE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;IAClB,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;2BAC2B;AAC3B,SAAS,aAAa,CAAC,KAAc,EAAE,QAAgB;IACrD,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC;AAClF,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,YAAY,CAAC,KAAc,EAAE,QAAgB,EAAE,QAAQ,GAAG,CAAC,EAAE,YAAuB,IAAI;IACtG,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC,QAAQ,EAAE,GAAG,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;AACjG,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAc,EAAE,IAAY,EAAE,SAAoB,EAAE,KAAa;IACxF,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,SAAS,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC5F,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;IAC7E,OAAO,YAAY,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;AACvD,CAAC"}
|
|
@@ -0,0 +1,136 @@
|
|
|
1
|
+
import { type AskIndex } from "../ask/index-file.js";
|
|
2
|
+
import { type GraphBuildResult } from "./build.js";
|
|
3
|
+
import { type GraphCheckResult } from "./check.js";
|
|
4
|
+
import { type RepoMap } from "./map.js";
|
|
5
|
+
import type { GraphV1 } from "./types.js";
|
|
6
|
+
/** The parent-side manifest — the ONLY thing a workspace parent's graft/ holds. */
|
|
7
|
+
export interface WorkspaceV1 {
|
|
8
|
+
version: 1;
|
|
9
|
+
/** Immediate child git repos, as dir names, sorted. */
|
|
10
|
+
children: string[];
|
|
11
|
+
}
|
|
12
|
+
export declare const WORKSPACE_FILE = "workspace.json";
|
|
13
|
+
/** `<contextDir>/workspace.json` — sibling of where `.graph/` would live. */
|
|
14
|
+
export declare function workspacePath(outDir: string): string;
|
|
15
|
+
/** Read the workspace manifest for the repo/parent at `root` (respecting the
|
|
16
|
+
* `--dir` override like every other reader). Null when absent or malformed —
|
|
17
|
+
* a non-workspace root costs one `existsSync`. */
|
|
18
|
+
export declare function readWorkspace(root: string, contextDirOverride?: string): WorkspaceV1 | null;
|
|
19
|
+
/** Write the manifest (children sorted; deterministic bytes, like writeGraph). */
|
|
20
|
+
export declare function writeWorkspace(outDir: string, ws: WorkspaceV1): string;
|
|
21
|
+
/** Build-time workspace detection: `root` has NO `.git` of its own and >=2
|
|
22
|
+
* immediate git children (a `.git` FILE — worktree/submodule — counts).
|
|
23
|
+
* Returns the sorted child names, or null when `root` is a normal repo/dir. */
|
|
24
|
+
export declare function isWorkspaceRoot(root: string): string[] | null;
|
|
25
|
+
export interface WorkspaceGraphs {
|
|
26
|
+
/** All children listed in the manifest. */
|
|
27
|
+
children: string[];
|
|
28
|
+
/** Children with a built graph, in manifest order. Each child's graph and
|
|
29
|
+
* sidecar come from ITS OWN `graft/` via the shared caches. */
|
|
30
|
+
built: {
|
|
31
|
+
child: string;
|
|
32
|
+
contextDir: string;
|
|
33
|
+
graph: GraphV1;
|
|
34
|
+
askIndex: AskIndex | null;
|
|
35
|
+
}[];
|
|
36
|
+
/** Children without a built graph — surfaced, never silently skipped. */
|
|
37
|
+
unbuilt: string[];
|
|
38
|
+
/** The surfacing line, set whenever `unbuilt` is non-empty. */
|
|
39
|
+
note?: string;
|
|
40
|
+
}
|
|
41
|
+
/** Load every child's graph via `loadGraphCached` (the only graph loader).
|
|
42
|
+
* Null when `root` is not a workspace (no manifest). */
|
|
43
|
+
export declare function loadWorkspaceGraphs(root: string, contextDirOverride?: string): WorkspaceGraphs | null;
|
|
44
|
+
/** Merge the built children into one virtual graph whose scopes are each
|
|
45
|
+
* child's scopes prefixed `<child>/` (child root scope → `<child>`). With >=2
|
|
46
|
+
* built children this is always multi-scope, so `ask` takes its per-scope
|
|
47
|
+
* RRF path and labels every hit with its repo. Null when nothing is built. */
|
|
48
|
+
export declare function mergeWorkspaceGraphs(built: WorkspaceGraphs["built"]): GraphV1 | null;
|
|
49
|
+
/** Merge the children's build-time ask sidecars to match the merged graph:
|
|
50
|
+
* doc ids prefixed, and each doc's path bag gains the child dir's tokens —
|
|
51
|
+
* exactly what live tokenization of the prefixed path would produce, so the
|
|
52
|
+
* sidecar stays a provably exact cache. `df`/`docCount`/`avgBodyLen` are
|
|
53
|
+
* recomputed over the merged docs. Null (→ live-tokenization fallback, same
|
|
54
|
+
* degradation as any stale sidecar) unless EVERY built child has a sidecar
|
|
55
|
+
* that exactly covers its graph. */
|
|
56
|
+
export declare function mergeWorkspaceAskIndexes(built: WorkspaceGraphs["built"]): AskIndex | null;
|
|
57
|
+
/** One-call federation for graph-consuming commands (grep, callers/callees,
|
|
58
|
+
* impact, MCP): null when `root` is not a workspace; otherwise the merged
|
|
59
|
+
* graph (null when no child is built) plus the unbuilt-children note. */
|
|
60
|
+
export declare function loadFederatedGraph(root: string, contextDirOverride?: string): {
|
|
61
|
+
graph: GraphV1 | null;
|
|
62
|
+
note?: string;
|
|
63
|
+
} | null;
|
|
64
|
+
/** Federation inputs for `ask`: the merged graph + merged sidecar + each built
|
|
65
|
+
* child's context dir (for its concept nodes). `ask` feeds the merged graph to
|
|
66
|
+
* its existing multi-scope pipeline, so `rankScopesAndFuse` does the fair
|
|
67
|
+
* cross-repo fusion with `<child>/`-prefixed scope labels. */
|
|
68
|
+
export declare function federateAsk(root: string, contextDirOverride?: string): {
|
|
69
|
+
graph: GraphV1 | null;
|
|
70
|
+
askIndex: AskIndex | null;
|
|
71
|
+
built: {
|
|
72
|
+
child: string;
|
|
73
|
+
contextDir: string;
|
|
74
|
+
}[];
|
|
75
|
+
note?: string;
|
|
76
|
+
} | null;
|
|
77
|
+
/** EXACT migration wording (asserted by tests) for a parent whose old combined
|
|
78
|
+
* graph is being replaced by the workspace manifest. */
|
|
79
|
+
export declare function migrationNote(children: string[]): string;
|
|
80
|
+
export interface WorkspaceBuildResult {
|
|
81
|
+
children: {
|
|
82
|
+
child: string;
|
|
83
|
+
result: GraphBuildResult;
|
|
84
|
+
}[];
|
|
85
|
+
workspacePath: string;
|
|
86
|
+
/** True when a pre-existing combined graph at the parent was replaced. */
|
|
87
|
+
migrated: boolean;
|
|
88
|
+
/** The exact {@link migrationNote} wording, set only when `migrated`. */
|
|
89
|
+
migrationNote?: string;
|
|
90
|
+
}
|
|
91
|
+
/**
|
|
92
|
+
* `graft build` at a workspace parent: build each child's graph into the child
|
|
93
|
+
* (plain `buildGraph(childDir)` — nothing parent-side touches it, which is what
|
|
94
|
+
* makes the result byte-identical to a standalone build), then write the
|
|
95
|
+
* parent manifest. A pre-existing mega-graph (`graft/.graph/wiring.json` at
|
|
96
|
+
* the parent) is replaced: its `.graph/` and `.cache/` are deleted AFTER the
|
|
97
|
+
* children built successfully, so a failed child build never destroys the old
|
|
98
|
+
* (still-working) graph.
|
|
99
|
+
*/
|
|
100
|
+
export declare function buildWorkspace(root: string, opts?: {
|
|
101
|
+
contextDir?: string;
|
|
102
|
+
}): Promise<WorkspaceBuildResult>;
|
|
103
|
+
/** Human report for a workspace build — the migration note (when migrating)
|
|
104
|
+
* first, then one ✓ line per child, then where the manifest went. */
|
|
105
|
+
export declare function formatWorkspaceBuild(r: WorkspaceBuildResult): string;
|
|
106
|
+
export interface WorkspaceCheck {
|
|
107
|
+
children: {
|
|
108
|
+
child: string;
|
|
109
|
+
missing: boolean;
|
|
110
|
+
ok: boolean;
|
|
111
|
+
summary: string;
|
|
112
|
+
result: GraphCheckResult;
|
|
113
|
+
}[];
|
|
114
|
+
/** True when any child that HAS a graph is stale — unbuilt alone never fails. */
|
|
115
|
+
failed: boolean;
|
|
116
|
+
}
|
|
117
|
+
/** Per-child drift check ({@link checkGraph} in each child repo). */
|
|
118
|
+
export declare function checkWorkspace(root: string, contextDirOverride?: string): WorkspaceCheck;
|
|
119
|
+
export declare function formatWorkspaceCheck(c: WorkspaceCheck): string;
|
|
120
|
+
export interface WorkspaceMap {
|
|
121
|
+
children: {
|
|
122
|
+
child: string;
|
|
123
|
+
map: RepoMap;
|
|
124
|
+
}[];
|
|
125
|
+
note?: string;
|
|
126
|
+
}
|
|
127
|
+
/** Per-child repo maps, the directory budget split evenly across the built
|
|
128
|
+
* children. Null when `root` is not a workspace. */
|
|
129
|
+
export declare function buildWorkspaceMap(root: string, opts?: {
|
|
130
|
+
maxDirs?: number;
|
|
131
|
+
contextDir?: string;
|
|
132
|
+
}): WorkspaceMap | null;
|
|
133
|
+
/** One section per child (its own `formatRepoMap` report under a `<child>/`
|
|
134
|
+
* heading), plus the unbuilt-children note when present. */
|
|
135
|
+
export declare function formatWorkspaceMap(m: WorkspaceMap): string;
|
|
136
|
+
//# sourceMappingURL=workspace.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"workspace.d.ts","sourceRoot":"","sources":["../../src/graph/workspace.ts"],"names":[],"mappings":"AAgCA,OAAO,EAAoB,KAAK,QAAQ,EAAoB,MAAM,sBAAsB,CAAC;AACzF,OAAO,EAAc,KAAK,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAC/D,OAAO,EAAc,KAAK,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE/D,OAAO,EAA+B,KAAK,OAAO,EAAE,MAAM,UAAU,CAAC;AAGrE,OAAO,KAAK,EAAU,OAAO,EAAmB,MAAM,YAAY,CAAC;AAEnE,mFAAmF;AACnF,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,CAAC,CAAC;IACX,uDAAuD;IACvD,QAAQ,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,eAAO,MAAM,cAAc,mBAAmB,CAAC;AAE/C,6EAA6E;AAC7E,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAEpD;AAED;;kDAEkD;AAClD,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CAkB3F;AAED,kFAAkF;AAClF,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,WAAW,GAAG,MAAM,CAMtE;AAED;;+EAE+E;AAC/E,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAK7D;AAID,MAAM,WAAW,eAAe;IAC9B,2CAA2C;IAC3C,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB;mEAC+D;IAC/D,KAAK,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,OAAO,CAAC;QAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAA;KAAE,EAAE,CAAC;IAC1F,yEAAyE;IACzE,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,+DAA+D;IAC/D,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;wDACwD;AACxD,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,MAAM,GAAG,eAAe,GAAG,IAAI,CAkBrG;AAgBD;;;8EAG8E;AAC9E,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,eAAe,CAAC,OAAO,CAAC,GAAG,OAAO,GAAG,IAAI,CA6BpF;AAMD;;;;;;oCAMoC;AACpC,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,eAAe,CAAC,OAAO,CAAC,GAAG,QAAQ,GAAG,IAAI,CA+BzF;AAED;;yEAEyE;AACzE,wBAAgB,kBAAkB,CAChC,IAAI,EAAE,MAAM,EACZ,kBAAkB,CAAC,EAAE,MAAM,GAC1B;IAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAIjD;AAED;;;8DAG8D;AAC9D,wBAAgB,WAAW,CACzB,IAAI,EAAE,MAAM,EACZ,kBAAkB,CAAC,EAAE,MAAM,GAC1B;IAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IAAC,KAAK,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,IAAI,CAS5H;AAID;wDACwD;AACxD,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,CAMxD;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,gBAAgB,CAAA;KAAE,EAAE,CAAC;IACxD,aAAa,EAAE,MAAM,CAAC;IACtB,0EAA0E;IAC1E,QAAQ,EAAE,OAAO,CAAC;IAClB,yEAAyE;IACzE,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;;;;;;GAQG;AACH,wBAAsB,cAAc,CAClC,IAAI,EAAE,MAAM,EACZ,IAAI,GAAE;IAAE,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GACjC,OAAO,CAAC,oBAAoB,CAAC,CAsB/B;AAED;qEACqE;AACrE,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,oBAAoB,GAAG,MAAM,CAUpE;AAID,MAAM,WAAW,cAAc;IAC7B,QAAQ,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,OAAO,CAAC;QAAC,EAAE,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,gBAAgB,CAAA;KAAE,EAAE,CAAC;IACxG,iFAAiF;IACjF,MAAM,EAAE,OAAO,CAAC;CACjB;AAED,qEAAqE;AACrE,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,kBAAkB,CAAC,EAAE,MAAM,GAAG,cAAc,CAkBxF;AAED,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,cAAc,GAAG,MAAM,CAU9D;AAID,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,OAAO,CAAA;KAAE,EAAE,CAAC;IAC5C,IAAI,CAAC,EAAE,MAAM,CAAC;CACf;AAED;oDACoD;AACpD,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,MAAM,EACZ,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,MAAM,CAAC;IAAC,UAAU,CAAC,EAAE,MAAM,CAAA;CAAO,GACnD,YAAY,GAAG,IAAI,CAQrB;AAED;4DAC4D;AAC5D,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,YAAY,GAAG,MAAM,CAO1D"}
|