@optave/codegraph 3.7.0 → 3.8.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 +25 -14
- package/dist/ast-analysis/engine.d.ts.map +1 -1
- package/dist/ast-analysis/engine.js +158 -1
- package/dist/ast-analysis/engine.js.map +1 -1
- package/dist/ast-analysis/rules/javascript.d.ts.map +1 -1
- package/dist/ast-analysis/rules/javascript.js +0 -1
- package/dist/ast-analysis/rules/javascript.js.map +1 -1
- package/dist/ast-analysis/visitors/ast-store-visitor.d.ts.map +1 -1
- package/dist/ast-analysis/visitors/ast-store-visitor.js +2 -75
- package/dist/ast-analysis/visitors/ast-store-visitor.js.map +1 -1
- package/dist/cli/commands/ast.js +2 -2
- package/dist/cli/commands/ast.js.map +1 -1
- package/dist/domain/graph/builder/pipeline.d.ts.map +1 -1
- package/dist/domain/graph/builder/pipeline.js +128 -6
- package/dist/domain/graph/builder/pipeline.js.map +1 -1
- package/dist/domain/graph/builder/stages/build-edges.d.ts.map +1 -1
- package/dist/domain/graph/builder/stages/build-edges.js +101 -1
- package/dist/domain/graph/builder/stages/build-edges.js.map +1 -1
- package/dist/domain/graph/builder/stages/collect-files.d.ts.map +1 -1
- package/dist/domain/graph/builder/stages/collect-files.js +17 -5
- package/dist/domain/graph/builder/stages/collect-files.js.map +1 -1
- package/dist/domain/graph/builder/stages/detect-changes.d.ts.map +1 -1
- package/dist/domain/graph/builder/stages/detect-changes.js +98 -50
- package/dist/domain/graph/builder/stages/detect-changes.js.map +1 -1
- package/dist/domain/graph/builder/stages/finalize.d.ts.map +1 -1
- package/dist/domain/graph/builder/stages/finalize.js +32 -5
- package/dist/domain/graph/builder/stages/finalize.js.map +1 -1
- package/dist/domain/graph/builder/stages/insert-nodes.d.ts.map +1 -1
- package/dist/domain/graph/builder/stages/insert-nodes.js +20 -7
- package/dist/domain/graph/builder/stages/insert-nodes.js.map +1 -1
- package/dist/domain/parser.d.ts +1 -1
- package/dist/domain/parser.d.ts.map +1 -1
- package/dist/domain/parser.js +88 -4
- package/dist/domain/parser.js.map +1 -1
- package/dist/extractors/clojure.d.ts +12 -0
- package/dist/extractors/clojure.d.ts.map +1 -0
- package/dist/extractors/clojure.js +245 -0
- package/dist/extractors/clojure.js.map +1 -0
- package/dist/extractors/cuda.d.ts +11 -0
- package/dist/extractors/cuda.d.ts.map +1 -0
- package/dist/extractors/cuda.js +302 -0
- package/dist/extractors/cuda.js.map +1 -0
- package/dist/extractors/erlang.d.ts +14 -0
- package/dist/extractors/erlang.d.ts.map +1 -0
- package/dist/extractors/erlang.js +239 -0
- package/dist/extractors/erlang.js.map +1 -0
- package/dist/extractors/fsharp.d.ts +13 -0
- package/dist/extractors/fsharp.d.ts.map +1 -0
- package/dist/extractors/fsharp.js +218 -0
- package/dist/extractors/fsharp.js.map +1 -0
- package/dist/extractors/gleam.d.ts +14 -0
- package/dist/extractors/gleam.d.ts.map +1 -0
- package/dist/extractors/gleam.js +229 -0
- package/dist/extractors/gleam.js.map +1 -0
- package/dist/extractors/groovy.d.ts +10 -0
- package/dist/extractors/groovy.d.ts.map +1 -0
- package/dist/extractors/groovy.js +304 -0
- package/dist/extractors/groovy.js.map +1 -0
- package/dist/extractors/index.d.ts +11 -0
- package/dist/extractors/index.d.ts.map +1 -1
- package/dist/extractors/index.js +11 -0
- package/dist/extractors/index.js.map +1 -1
- package/dist/extractors/julia.d.ts +16 -0
- package/dist/extractors/julia.d.ts.map +1 -0
- package/dist/extractors/julia.js +287 -0
- package/dist/extractors/julia.js.map +1 -0
- package/dist/extractors/objc.d.ts +9 -0
- package/dist/extractors/objc.d.ts.map +1 -0
- package/dist/extractors/objc.js +406 -0
- package/dist/extractors/objc.js.map +1 -0
- package/dist/extractors/ocaml.js +74 -0
- package/dist/extractors/ocaml.js.map +1 -1
- package/dist/extractors/r.d.ts +13 -0
- package/dist/extractors/r.d.ts.map +1 -0
- package/dist/extractors/r.js +251 -0
- package/dist/extractors/r.js.map +1 -0
- package/dist/extractors/solidity.d.ts +9 -0
- package/dist/extractors/solidity.d.ts.map +1 -0
- package/dist/extractors/solidity.js +374 -0
- package/dist/extractors/solidity.js.map +1 -0
- package/dist/extractors/verilog.d.ts +9 -0
- package/dist/extractors/verilog.d.ts.map +1 -0
- package/dist/extractors/verilog.js +286 -0
- package/dist/extractors/verilog.js.map +1 -0
- package/dist/features/ast.d.ts.map +1 -1
- package/dist/features/ast.js +1 -2
- package/dist/features/ast.js.map +1 -1
- package/dist/graph/algorithms/bfs.d.ts +2 -0
- package/dist/graph/algorithms/bfs.d.ts.map +1 -1
- package/dist/graph/algorithms/bfs.js +27 -0
- package/dist/graph/algorithms/bfs.js.map +1 -1
- package/dist/graph/algorithms/centrality.d.ts +2 -0
- package/dist/graph/algorithms/centrality.d.ts.map +1 -1
- package/dist/graph/algorithms/centrality.js +28 -0
- package/dist/graph/algorithms/centrality.js.map +1 -1
- package/dist/graph/algorithms/louvain.d.ts +3 -4
- package/dist/graph/algorithms/louvain.d.ts.map +1 -1
- package/dist/graph/algorithms/louvain.js +29 -0
- package/dist/graph/algorithms/louvain.js.map +1 -1
- package/dist/graph/algorithms/shortest-path.d.ts +2 -0
- package/dist/graph/algorithms/shortest-path.d.ts.map +1 -1
- package/dist/graph/algorithms/shortest-path.js +18 -1
- package/dist/graph/algorithms/shortest-path.js.map +1 -1
- package/dist/types.d.ts +122 -2
- package/dist/types.d.ts.map +1 -1
- package/grammars/tree-sitter-clojure.wasm +0 -0
- package/grammars/tree-sitter-cuda.wasm +0 -0
- package/grammars/tree-sitter-erlang.wasm +0 -0
- package/grammars/tree-sitter-fsharp.wasm +0 -0
- package/grammars/tree-sitter-gleam.wasm +0 -0
- package/grammars/tree-sitter-groovy.wasm +0 -0
- package/grammars/tree-sitter-julia.wasm +0 -0
- package/grammars/tree-sitter-objc.wasm +0 -0
- package/grammars/tree-sitter-ocaml_interface.wasm +0 -0
- package/grammars/tree-sitter-r.wasm +0 -0
- package/grammars/tree-sitter-solidity.wasm +0 -0
- package/grammars/tree-sitter-verilog.wasm +0 -0
- package/package.json +18 -7
- package/src/ast-analysis/engine.ts +183 -1
- package/src/ast-analysis/rules/javascript.ts +0 -1
- package/src/ast-analysis/visitors/ast-store-visitor.ts +2 -75
- package/src/cli/commands/ast.ts +2 -2
- package/src/domain/graph/builder/pipeline.ts +142 -6
- package/src/domain/graph/builder/stages/build-edges.ts +158 -1
- package/src/domain/graph/builder/stages/collect-files.ts +18 -7
- package/src/domain/graph/builder/stages/detect-changes.ts +109 -55
- package/src/domain/graph/builder/stages/finalize.ts +39 -9
- package/src/domain/graph/builder/stages/insert-nodes.ts +18 -7
- package/src/domain/parser.ts +108 -2
- package/src/extractors/clojure.ts +273 -0
- package/src/extractors/cuda.ts +316 -0
- package/src/extractors/erlang.ts +252 -0
- package/src/extractors/fsharp.ts +253 -0
- package/src/extractors/gleam.ts +246 -0
- package/src/extractors/groovy.ts +332 -0
- package/src/extractors/index.ts +11 -0
- package/src/extractors/julia.ts +318 -0
- package/src/extractors/objc.ts +431 -0
- package/src/extractors/ocaml.ts +78 -0
- package/src/extractors/r.ts +253 -0
- package/src/extractors/solidity.ts +398 -0
- package/src/extractors/verilog.ts +315 -0
- package/src/features/ast.ts +1 -2
- package/src/graph/algorithms/bfs.ts +34 -0
- package/src/graph/algorithms/centrality.ts +30 -0
- package/src/graph/algorithms/louvain.ts +31 -4
- package/src/graph/algorithms/shortest-path.ts +20 -1
- package/src/types.ts +117 -2
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
import type { ExtractorOutput, TreeSitterTree } from '../types.js';
|
|
2
|
+
/**
|
|
3
|
+
* Extract symbols from Verilog/SystemVerilog files.
|
|
4
|
+
*
|
|
5
|
+
* The tree-sitter-verilog grammar covers modules, interfaces, packages,
|
|
6
|
+
* tasks, functions, classes, always blocks, and instantiations.
|
|
7
|
+
*/
|
|
8
|
+
export declare function extractVerilogSymbols(tree: TreeSitterTree, _filePath: string): ExtractorOutput;
|
|
9
|
+
//# sourceMappingURL=verilog.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"verilog.d.ts","sourceRoot":"","sources":["../../src/extractors/verilog.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAkC,cAAc,EAAE,MAAM,aAAa,CAAC;AAGnG;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,GAAG,eAAe,CAY9F"}
|
|
@@ -0,0 +1,286 @@
|
|
|
1
|
+
import { findChild, nodeEndLine } from './helpers.js';
|
|
2
|
+
/**
|
|
3
|
+
* Extract symbols from Verilog/SystemVerilog files.
|
|
4
|
+
*
|
|
5
|
+
* The tree-sitter-verilog grammar covers modules, interfaces, packages,
|
|
6
|
+
* tasks, functions, classes, always blocks, and instantiations.
|
|
7
|
+
*/
|
|
8
|
+
export function extractVerilogSymbols(tree, _filePath) {
|
|
9
|
+
const ctx = {
|
|
10
|
+
definitions: [],
|
|
11
|
+
calls: [],
|
|
12
|
+
imports: [],
|
|
13
|
+
classes: [],
|
|
14
|
+
exports: [],
|
|
15
|
+
typeMap: new Map(),
|
|
16
|
+
};
|
|
17
|
+
walkVerilogNode(tree.rootNode, ctx);
|
|
18
|
+
return ctx;
|
|
19
|
+
}
|
|
20
|
+
function walkVerilogNode(node, ctx) {
|
|
21
|
+
switch (node.type) {
|
|
22
|
+
case 'module_declaration':
|
|
23
|
+
handleModuleDecl(node, ctx);
|
|
24
|
+
break;
|
|
25
|
+
case 'interface_declaration':
|
|
26
|
+
handleInterfaceDecl(node, ctx);
|
|
27
|
+
break;
|
|
28
|
+
case 'package_declaration':
|
|
29
|
+
handlePackageDecl(node, ctx);
|
|
30
|
+
break;
|
|
31
|
+
case 'class_declaration':
|
|
32
|
+
handleClassDecl(node, ctx);
|
|
33
|
+
break;
|
|
34
|
+
case 'function_declaration':
|
|
35
|
+
handleFunctionDecl(node, ctx);
|
|
36
|
+
break;
|
|
37
|
+
case 'task_declaration':
|
|
38
|
+
handleTaskDecl(node, ctx);
|
|
39
|
+
break;
|
|
40
|
+
case 'module_instantiation':
|
|
41
|
+
handleModuleInstantiation(node, ctx);
|
|
42
|
+
break;
|
|
43
|
+
case 'package_import_declaration':
|
|
44
|
+
handlePackageImport(node, ctx);
|
|
45
|
+
break;
|
|
46
|
+
case 'include_compiler_directive':
|
|
47
|
+
handleIncludeDirective(node, ctx);
|
|
48
|
+
break;
|
|
49
|
+
}
|
|
50
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
51
|
+
const child = node.child(i);
|
|
52
|
+
if (child)
|
|
53
|
+
walkVerilogNode(child, ctx);
|
|
54
|
+
}
|
|
55
|
+
}
|
|
56
|
+
// ── Handlers ───────────────────────────────────────────────────────────────
|
|
57
|
+
function handleModuleDecl(node, ctx) {
|
|
58
|
+
const nameNode = findModuleName(node);
|
|
59
|
+
if (!nameNode)
|
|
60
|
+
return;
|
|
61
|
+
const ports = extractPorts(node);
|
|
62
|
+
ctx.definitions.push({
|
|
63
|
+
name: nameNode.text,
|
|
64
|
+
kind: 'module',
|
|
65
|
+
line: node.startPosition.row + 1,
|
|
66
|
+
endLine: nodeEndLine(node),
|
|
67
|
+
children: ports.length > 0 ? ports : undefined,
|
|
68
|
+
});
|
|
69
|
+
}
|
|
70
|
+
function handleInterfaceDecl(node, ctx) {
|
|
71
|
+
const nameNode = findDeclName(node);
|
|
72
|
+
if (!nameNode)
|
|
73
|
+
return;
|
|
74
|
+
ctx.definitions.push({
|
|
75
|
+
name: nameNode.text,
|
|
76
|
+
kind: 'interface',
|
|
77
|
+
line: node.startPosition.row + 1,
|
|
78
|
+
endLine: nodeEndLine(node),
|
|
79
|
+
});
|
|
80
|
+
}
|
|
81
|
+
function handlePackageDecl(node, ctx) {
|
|
82
|
+
const nameNode = findDeclName(node);
|
|
83
|
+
if (!nameNode)
|
|
84
|
+
return;
|
|
85
|
+
ctx.definitions.push({
|
|
86
|
+
name: nameNode.text,
|
|
87
|
+
kind: 'module',
|
|
88
|
+
line: node.startPosition.row + 1,
|
|
89
|
+
endLine: nodeEndLine(node),
|
|
90
|
+
});
|
|
91
|
+
}
|
|
92
|
+
function handleClassDecl(node, ctx) {
|
|
93
|
+
const nameNode = node.childForFieldName('name');
|
|
94
|
+
if (!nameNode)
|
|
95
|
+
return;
|
|
96
|
+
ctx.definitions.push({
|
|
97
|
+
name: nameNode.text,
|
|
98
|
+
kind: 'class',
|
|
99
|
+
line: node.startPosition.row + 1,
|
|
100
|
+
endLine: nodeEndLine(node),
|
|
101
|
+
});
|
|
102
|
+
// Superclass via extends
|
|
103
|
+
const superclass = node.childForFieldName('superclass');
|
|
104
|
+
if (superclass) {
|
|
105
|
+
ctx.classes.push({
|
|
106
|
+
name: nameNode.text,
|
|
107
|
+
extends: superclass.text,
|
|
108
|
+
line: node.startPosition.row + 1,
|
|
109
|
+
});
|
|
110
|
+
}
|
|
111
|
+
}
|
|
112
|
+
function handleFunctionDecl(node, ctx) {
|
|
113
|
+
const nameNode = findFunctionOrTaskName(node, 'function_identifier');
|
|
114
|
+
if (!nameNode)
|
|
115
|
+
return;
|
|
116
|
+
const parentModule = findVerilogParent(node);
|
|
117
|
+
const fullName = parentModule ? `${parentModule}.${nameNode.text}` : nameNode.text;
|
|
118
|
+
ctx.definitions.push({
|
|
119
|
+
name: fullName,
|
|
120
|
+
kind: 'function',
|
|
121
|
+
line: node.startPosition.row + 1,
|
|
122
|
+
endLine: nodeEndLine(node),
|
|
123
|
+
});
|
|
124
|
+
}
|
|
125
|
+
function handleTaskDecl(node, ctx) {
|
|
126
|
+
const nameNode = findFunctionOrTaskName(node, 'task_identifier');
|
|
127
|
+
if (!nameNode)
|
|
128
|
+
return;
|
|
129
|
+
const parentModule = findVerilogParent(node);
|
|
130
|
+
const fullName = parentModule ? `${parentModule}.${nameNode.text}` : nameNode.text;
|
|
131
|
+
ctx.definitions.push({
|
|
132
|
+
name: fullName,
|
|
133
|
+
kind: 'function',
|
|
134
|
+
line: node.startPosition.row + 1,
|
|
135
|
+
endLine: nodeEndLine(node),
|
|
136
|
+
});
|
|
137
|
+
}
|
|
138
|
+
function handleModuleInstantiation(node, ctx) {
|
|
139
|
+
// Module instantiations are like function calls: `ModuleName instance_name(...);`
|
|
140
|
+
const moduleType = node.childForFieldName('type') || node.child(0);
|
|
141
|
+
if (!moduleType)
|
|
142
|
+
return;
|
|
143
|
+
ctx.calls.push({
|
|
144
|
+
name: moduleType.text,
|
|
145
|
+
line: node.startPosition.row + 1,
|
|
146
|
+
});
|
|
147
|
+
}
|
|
148
|
+
function handlePackageImport(node, ctx) {
|
|
149
|
+
// import pkg::item; or import pkg::*;
|
|
150
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
151
|
+
const child = node.child(i);
|
|
152
|
+
if (!child)
|
|
153
|
+
continue;
|
|
154
|
+
if (child.type === 'package_import_item') {
|
|
155
|
+
const text = child.text;
|
|
156
|
+
const parts = text.split('::');
|
|
157
|
+
const pkg = parts[0] ?? text;
|
|
158
|
+
const item = parts[1] ?? '*';
|
|
159
|
+
ctx.imports.push({
|
|
160
|
+
source: pkg,
|
|
161
|
+
names: [item],
|
|
162
|
+
line: node.startPosition.row + 1,
|
|
163
|
+
});
|
|
164
|
+
}
|
|
165
|
+
}
|
|
166
|
+
}
|
|
167
|
+
function handleIncludeDirective(node, ctx) {
|
|
168
|
+
// `include "file.vh"
|
|
169
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
170
|
+
const child = node.child(i);
|
|
171
|
+
if (child && (child.type === 'string_literal' || child.type === 'quoted_string')) {
|
|
172
|
+
const source = child.text.replace(/^["']|["']$/g, '');
|
|
173
|
+
ctx.imports.push({
|
|
174
|
+
source,
|
|
175
|
+
names: [source.split('/').pop() ?? source],
|
|
176
|
+
line: node.startPosition.row + 1,
|
|
177
|
+
cInclude: true,
|
|
178
|
+
});
|
|
179
|
+
return;
|
|
180
|
+
}
|
|
181
|
+
}
|
|
182
|
+
}
|
|
183
|
+
// ── Helpers ────────────────────────────────────────────────────────────────
|
|
184
|
+
function findModuleName(node) {
|
|
185
|
+
// Try field name first, then look for module_header > identifier
|
|
186
|
+
const nameNode = node.childForFieldName('name');
|
|
187
|
+
if (nameNode)
|
|
188
|
+
return nameNode;
|
|
189
|
+
const header = findChild(node, 'module_header');
|
|
190
|
+
if (header) {
|
|
191
|
+
const id = findChild(header, 'simple_identifier') || findChild(header, 'identifier');
|
|
192
|
+
if (id)
|
|
193
|
+
return id;
|
|
194
|
+
}
|
|
195
|
+
// Direct child identifier after `module` keyword
|
|
196
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
197
|
+
const child = node.child(i);
|
|
198
|
+
if (child && (child.type === 'simple_identifier' || child.type === 'identifier'))
|
|
199
|
+
return child;
|
|
200
|
+
}
|
|
201
|
+
return null;
|
|
202
|
+
}
|
|
203
|
+
function findDeclName(node) {
|
|
204
|
+
const nameNode = node.childForFieldName('name');
|
|
205
|
+
if (nameNode)
|
|
206
|
+
return nameNode;
|
|
207
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
208
|
+
const child = node.child(i);
|
|
209
|
+
if (child && (child.type === 'simple_identifier' || child.type === 'identifier'))
|
|
210
|
+
return child;
|
|
211
|
+
}
|
|
212
|
+
return null;
|
|
213
|
+
}
|
|
214
|
+
/**
|
|
215
|
+
* Find a function or task name by searching for the dedicated identifier node
|
|
216
|
+
* type (e.g. `function_identifier`, `task_identifier`) recursively through
|
|
217
|
+
* body declarations. Falls back to `findDeclName` for grammars that use
|
|
218
|
+
* plain identifiers.
|
|
219
|
+
*/
|
|
220
|
+
function findFunctionOrTaskName(node, identifierType) {
|
|
221
|
+
// Try the standard approach first
|
|
222
|
+
const simple = findDeclName(node);
|
|
223
|
+
if (simple)
|
|
224
|
+
return simple;
|
|
225
|
+
// Search children (including body declarations) for the dedicated identifier node
|
|
226
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
227
|
+
const child = node.child(i);
|
|
228
|
+
if (!child)
|
|
229
|
+
continue;
|
|
230
|
+
if (child.type === identifierType)
|
|
231
|
+
return child;
|
|
232
|
+
// Look one level deeper into body declarations
|
|
233
|
+
for (let j = 0; j < child.childCount; j++) {
|
|
234
|
+
const grandchild = child.child(j);
|
|
235
|
+
if (grandchild && grandchild.type === identifierType)
|
|
236
|
+
return grandchild;
|
|
237
|
+
}
|
|
238
|
+
}
|
|
239
|
+
return null;
|
|
240
|
+
}
|
|
241
|
+
function findVerilogParent(node) {
|
|
242
|
+
let current = node.parent;
|
|
243
|
+
while (current) {
|
|
244
|
+
if (current.type === 'module_declaration' ||
|
|
245
|
+
current.type === 'interface_declaration' ||
|
|
246
|
+
current.type === 'package_declaration' ||
|
|
247
|
+
current.type === 'class_declaration') {
|
|
248
|
+
const name = findDeclName(current) || findModuleName(current);
|
|
249
|
+
return name ? name.text : null;
|
|
250
|
+
}
|
|
251
|
+
current = current.parent;
|
|
252
|
+
}
|
|
253
|
+
return null;
|
|
254
|
+
}
|
|
255
|
+
function extractPorts(moduleNode) {
|
|
256
|
+
const ports = [];
|
|
257
|
+
// Look for port declarations in the module header or body
|
|
258
|
+
const collectFromNode = (node) => {
|
|
259
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
260
|
+
const child = node.child(i);
|
|
261
|
+
if (!child)
|
|
262
|
+
continue;
|
|
263
|
+
if (child.type === 'ansi_port_declaration' ||
|
|
264
|
+
child.type === 'port_declaration' ||
|
|
265
|
+
child.type === 'input_declaration' ||
|
|
266
|
+
child.type === 'output_declaration' ||
|
|
267
|
+
child.type === 'inout_declaration') {
|
|
268
|
+
const nameNode = child.childForFieldName('name') ||
|
|
269
|
+
findChild(child, 'simple_identifier') ||
|
|
270
|
+
findChild(child, 'identifier');
|
|
271
|
+
if (nameNode) {
|
|
272
|
+
ports.push({ name: nameNode.text, kind: 'property', line: child.startPosition.row + 1 });
|
|
273
|
+
}
|
|
274
|
+
}
|
|
275
|
+
// Recurse into port list containers
|
|
276
|
+
if (child.type === 'list_of_port_declarations' ||
|
|
277
|
+
child.type === 'module_header' ||
|
|
278
|
+
child.type === 'port_declaration_list') {
|
|
279
|
+
collectFromNode(child);
|
|
280
|
+
}
|
|
281
|
+
}
|
|
282
|
+
};
|
|
283
|
+
collectFromNode(moduleNode);
|
|
284
|
+
return ports;
|
|
285
|
+
}
|
|
286
|
+
//# sourceMappingURL=verilog.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"verilog.js","sourceRoot":"","sources":["../../src/extractors/verilog.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAEtD;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAoB,EAAE,SAAiB;IAC3E,MAAM,GAAG,GAAoB;QAC3B,WAAW,EAAE,EAAE;QACf,KAAK,EAAE,EAAE;QACT,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,IAAI,GAAG,EAAE;KACnB,CAAC;IAEF,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IACpC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,eAAe,CAAC,IAAoB,EAAE,GAAoB;IACjE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,oBAAoB;YACvB,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC5B,MAAM;QACR,KAAK,uBAAuB;YAC1B,mBAAmB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC/B,MAAM;QACR,KAAK,qBAAqB;YACxB,iBAAiB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,MAAM;QACR,KAAK,mBAAmB;YACtB,eAAe,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,MAAM;QACR,KAAK,sBAAsB;YACzB,kBAAkB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC9B,MAAM;QACR,KAAK,kBAAkB;YACrB,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC1B,MAAM;QACR,KAAK,sBAAsB;YACzB,yBAAyB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YACrC,MAAM;QACR,KAAK,4BAA4B;YAC/B,mBAAmB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC/B,MAAM;QACR,KAAK,4BAA4B;YAC/B,sBAAsB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAClC,MAAM;IACV,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,KAAK;YAAE,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;AACH,CAAC;AAED,8EAA8E;AAE9E,SAAS,gBAAgB,CAAC,IAAoB,EAAE,GAAoB;IAClE,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,CAAC,QAAQ;QAAE,OAAO;IAEtB,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACjC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;QACnB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,IAAI,EAAE,QAAQ;QACd,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;QAChC,OAAO,EAAE,WAAW,CAAC,IAAI,CAAC;QAC1B,QAAQ,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS;KAC/C,CAAC,CAAC;AACL,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAoB,EAAE,GAAoB;IACrE,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,CAAC,QAAQ;QAAE,OAAO;IAEtB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;QACnB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,IAAI,EAAE,WAAW;QACjB,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;QAChC,OAAO,EAAE,WAAW,CAAC,IAAI,CAAC;KAC3B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAoB,EAAE,GAAoB;IACnE,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IACpC,IAAI,CAAC,QAAQ;QAAE,OAAO;IAEtB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;QACnB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,IAAI,EAAE,QAAQ;QACd,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;QAChC,OAAO,EAAE,WAAW,CAAC,IAAI,CAAC;KAC3B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,eAAe,CAAC,IAAoB,EAAE,GAAoB;IACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,CAAC,QAAQ;QAAE,OAAO;IAEtB,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;QACnB,IAAI,EAAE,QAAQ,CAAC,IAAI;QACnB,IAAI,EAAE,OAAO;QACb,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;QAChC,OAAO,EAAE,WAAW,CAAC,IAAI,CAAC;KAC3B,CAAC,CAAC;IAEH,yBAAyB;IACzB,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,CAAC;IACxD,IAAI,UAAU,EAAE,CAAC;QACf,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;YACf,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,OAAO,EAAE,UAAU,CAAC,IAAI;YACxB,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;SACjC,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CAAC,IAAoB,EAAE,GAAoB;IACpE,MAAM,QAAQ,GAAG,sBAAsB,CAAC,IAAI,EAAE,qBAAqB,CAAC,CAAC;IACrE,IAAI,CAAC,QAAQ;QAAE,OAAO;IAEtB,MAAM,YAAY,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;IAEnF,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;QACnB,IAAI,EAAE,QAAQ;QACd,IAAI,EAAE,UAAU;QAChB,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;QAChC,OAAO,EAAE,WAAW,CAAC,IAAI,CAAC;KAC3B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,cAAc,CAAC,IAAoB,EAAE,GAAoB;IAChE,MAAM,QAAQ,GAAG,sBAAsB,CAAC,IAAI,EAAE,iBAAiB,CAAC,CAAC;IACjE,IAAI,CAAC,QAAQ;QAAE,OAAO;IAEtB,MAAM,YAAY,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IAC7C,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,YAAY,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;IAEnF,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC;QACnB,IAAI,EAAE,QAAQ;QACd,IAAI,EAAE,UAAU;QAChB,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;QAChC,OAAO,EAAE,WAAW,CAAC,IAAI,CAAC;KAC3B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,yBAAyB,CAAC,IAAoB,EAAE,GAAoB;IAC3E,kFAAkF;IAClF,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACnE,IAAI,CAAC,UAAU;QAAE,OAAO;IAExB,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC;QACb,IAAI,EAAE,UAAU,CAAC,IAAI;QACrB,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;KACjC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAoB,EAAE,GAAoB;IACrE,sCAAsC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,IAAI,KAAK,CAAC,IAAI,KAAK,qBAAqB,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;YACxB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC/B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;YAC7B,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;gBACf,MAAM,EAAE,GAAG;gBACX,KAAK,EAAE,CAAC,IAAI,CAAC;gBACb,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;aACjC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,sBAAsB,CAAC,IAAoB,EAAE,GAAoB;IACxE,qBAAqB;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,gBAAgB,IAAI,KAAK,CAAC,IAAI,KAAK,eAAe,CAAC,EAAE,CAAC;YACjF,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;YACtD,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;gBACf,MAAM;gBACN,KAAK,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC;gBAC1C,IAAI,EAAE,IAAI,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC;gBAChC,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;YACH,OAAO;QACT,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAE9E,SAAS,cAAc,CAAC,IAAoB;IAC1C,iEAAiE;IACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAE9B,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;IAChD,IAAI,MAAM,EAAE,CAAC;QACX,MAAM,EAAE,GAAG,SAAS,CAAC,MAAM,EAAE,mBAAmB,CAAC,IAAI,SAAS,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QACrF,IAAI,EAAE;YAAE,OAAO,EAAE,CAAC;IACpB,CAAC;IAED,iDAAiD;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,mBAAmB,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,CAAC;YAAE,OAAO,KAAK,CAAC;IACjG,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,IAAoB;IACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,QAAQ;QAAE,OAAO,QAAQ,CAAC;IAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,mBAAmB,IAAI,KAAK,CAAC,IAAI,KAAK,YAAY,CAAC;YAAE,OAAO,KAAK,CAAC;IACjG,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,SAAS,sBAAsB,CAC7B,IAAoB,EACpB,cAAsB;IAEtB,kCAAkC;IAClC,MAAM,MAAM,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAE1B,kFAAkF;IAClF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,IAAI,KAAK,CAAC,IAAI,KAAK,cAAc;YAAE,OAAO,KAAK,CAAC;QAChD,+CAA+C;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,UAAU,IAAI,UAAU,CAAC,IAAI,KAAK,cAAc;gBAAE,OAAO,UAAU,CAAC;QAC1E,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAoB;IAC7C,IAAI,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,OAAO,OAAO,EAAE,CAAC;QACf,IACE,OAAO,CAAC,IAAI,KAAK,oBAAoB;YACrC,OAAO,CAAC,IAAI,KAAK,uBAAuB;YACxC,OAAO,CAAC,IAAI,KAAK,qBAAqB;YACtC,OAAO,CAAC,IAAI,KAAK,mBAAmB,EACpC,CAAC;YACD,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC,IAAI,cAAc,CAAC,OAAO,CAAC,CAAC;YAC9D,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;QACjC,CAAC;QACD,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IAC3B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,YAAY,CAAC,UAA0B;IAC9C,MAAM,KAAK,GAAqB,EAAE,CAAC;IAEnC,0DAA0D;IAC1D,MAAM,eAAe,GAAG,CAAC,IAAoB,EAAQ,EAAE;QACrD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,IACE,KAAK,CAAC,IAAI,KAAK,uBAAuB;gBACtC,KAAK,CAAC,IAAI,KAAK,kBAAkB;gBACjC,KAAK,CAAC,IAAI,KAAK,mBAAmB;gBAClC,KAAK,CAAC,IAAI,KAAK,oBAAoB;gBACnC,KAAK,CAAC,IAAI,KAAK,mBAAmB,EAClC,CAAC;gBACD,MAAM,QAAQ,GACZ,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC;oBAC/B,SAAS,CAAC,KAAK,EAAE,mBAAmB,CAAC;oBACrC,SAAS,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;gBACjC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,CAAC,aAAa,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3F,CAAC;YACH,CAAC;YAED,oCAAoC;YACpC,IACE,KAAK,CAAC,IAAI,KAAK,2BAA2B;gBAC1C,KAAK,CAAC,IAAI,KAAK,eAAe;gBAC9B,KAAK,CAAC,IAAI,KAAK,uBAAuB,EACtC,CAAC;gBACD,eAAe,CAAC,KAAK,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,eAAe,CAAC,UAAU,CAAC,CAAC;IAC5B,OAAO,KAAK,CAAC;AACf,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../../src/features/ast.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,WAAW,EAAE,qBAAqB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAIlG,eAAO,MAAM,cAAc,EAAE,WAAW,
|
|
1
|
+
{"version":3,"file":"ast.d.ts","sourceRoot":"","sources":["../../src/features/ast.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,WAAW,EAAE,qBAAqB,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAIlG,eAAO,MAAM,cAAc,EAAE,WAAW,EAAiD,CAAC;AA0B1F,UAAU,WAAW;IACnB,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,KAAK,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,CAAC,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACpF,QAAQ,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACjG,KAAK,CAAC,EAAE;QAAE,QAAQ,EAAE,cAAc,CAAA;KAAE,CAAC;IACrC,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAgBD,wBAAsB,aAAa,CACjC,EAAE,EAAE,qBAAqB,EACzB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,EACrC,QAAQ,EAAE,MAAM,EAChB,UAAU,CAAC,EAAE;IACX,QAAQ,CAAC,EAAE;QACT,kBAAkB,CAChB,OAAO,EAAE,KAAK,CAAC;YACb,IAAI,EAAE,MAAM,CAAC;YACb,KAAK,EAAE,KAAK,CAAC;gBACX,IAAI,EAAE,MAAM,CAAC;gBACb,IAAI,EAAE,MAAM,CAAC;gBACb,IAAI,EAAE,MAAM,CAAC;gBACb,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;gBACrB,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;aAC1B,CAAC,CAAC;SACJ,CAAC,GACD,MAAM,CAAC;KACX,CAAC;IACF,WAAW,CAAC,EAAE,MAAM,IAAI,CAAC;IACzB,UAAU,CAAC,EAAE,MAAM,IAAI,CAAC;CACzB,GACA,OAAO,CAAC,IAAI,CAAC,CAsHf;AAkCD,UAAU,cAAc;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,MAAM,EAAE;QAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;QAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GAAG,IAAI,CAAC;CAClF;AAED,UAAU,YAAY;IACpB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IACzB,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,OAAO,CAAC;IACf,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAED,wBAAgB,YAAY,CAC1B,OAAO,EAAE,MAAM,GAAG,SAAS,EAC3B,YAAY,EAAE,MAAM,GAAG,SAAS,EAChC,IAAI,GAAE,YAAiB,GACtB;IACD,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,cAAc,EAAE,CAAC;IAC1B,WAAW,CAAC,EAAE;QACZ,OAAO,EAAE,OAAO,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;QACd,MAAM,EAAE,MAAM,CAAC;QACf,QAAQ,EAAE,MAAM,CAAC;QACjB,KAAK,EAAE,MAAM,CAAC;KACf,CAAC;CACH,CAoEA;AAED,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,SAAS,EAC3B,YAAY,EAAE,MAAM,GAAG,SAAS,EAChC,IAAI,GAAE,YAAiB,GACtB,IAAI,CAyBN"}
|
package/dist/features/ast.js
CHANGED
|
@@ -9,9 +9,8 @@ import { debug } from '../infrastructure/logger.js';
|
|
|
9
9
|
import { outputResult } from '../infrastructure/result-formatter.js';
|
|
10
10
|
import { paginateResult } from '../shared/paginate.js';
|
|
11
11
|
// ─── Constants ────────────────────────────────────────────────────────
|
|
12
|
-
export const AST_NODE_KINDS = ['
|
|
12
|
+
export const AST_NODE_KINDS = ['new', 'string', 'regex', 'throw', 'await'];
|
|
13
13
|
const KIND_ICONS = {
|
|
14
|
-
call: '\u0192', // ƒ
|
|
15
14
|
new: '\u2295', // ⊕
|
|
16
15
|
string: '"',
|
|
17
16
|
regex: '/',
|
package/dist/features/ast.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"ast.js","sourceRoot":"","sources":["../../src/features/ast.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,OAAO,EAAE,qBAAqB,EAAE,MAAM,+CAA+C,CAAC;AACtF,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EAAE,KAAK,EAAE,MAAM,6BAA6B,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,uCAAuC,CAAC;AACrE,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAGvD,yEAAyE;AAEzE,MAAM,CAAC,MAAM,cAAc,GAAkB,CAAC,
|
|
1
|
+
{"version":3,"file":"ast.js","sourceRoot":"","sources":["../../src/features/ast.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAC9D,OAAO,EAAE,qBAAqB,EAAE,MAAM,+CAA+C,CAAC;AACtF,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AACvE,OAAO,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EAAE,KAAK,EAAE,MAAM,6BAA6B,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,uCAAuC,CAAC;AACrE,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAGvD,yEAAyE;AAEzE,MAAM,CAAC,MAAM,cAAc,GAAkB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;AAE1F,MAAM,UAAU,GAA2B;IACzC,GAAG,EAAE,QAAQ,EAAE,IAAI;IACnB,MAAM,EAAE,GAAG;IACX,KAAK,EAAE,GAAG;IACV,KAAK,EAAE,QAAQ,EAAE,IAAI;IACrB,KAAK,EAAE,QAAQ,EAAE,IAAI;CACtB,CAAC;AAEF,MAAM,eAAe,GAAG,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;AAExD,MAAM,eAAe,GAAG,iBAAiB,CAAC,aAAa,CAAC,CAAC;AAsBzD,SAAS,aAAa,CAAC,IAAkB,EAAE,IAAY;IACrD,IAAI,IAAI,GAAsB,IAAI,CAAC;IACnC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,IAAI,IAAI,GAAG,CAAC,OAAO,IAAI,IAAI,CAAC,EAAE,CAAC;YACrE,IAAI,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC7E,IAAI,GAAG,GAAG,CAAC;YACb,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,yEAAyE;AAEzE,MAAM,CAAC,KAAK,UAAU,aAAa,CACjC,EAAyB,EACzB,WAAqC,EACrC,QAAgB,EAChB,UAiBC;IAED,yEAAyE;IACzE,2DAA2D;IAC3D,kDAAkD;IAClD,MAAM,QAAQ,GAAG,UAAU,EAAE,QAAQ,CAAC;IACtC,IAAI,QAAQ,EAAE,kBAAkB,EAAE,CAAC;QACjC,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B,MAAM,OAAO,GASR,EAAE,CAAC;QAER,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,WAAW,EAAE,CAAC;YAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACpC,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,OAAO;oBACb,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;wBAClC,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,EAAE;qBAC3B,CAAC,CAAC;iBACJ,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC1C,eAAe,GAAG,IAAI,CAAC;gBACvB,MAAM;YACR,CAAC;QACH,CAAC;QAED,IAAI,CAAC,eAAe,EAAE,CAAC;YACrB,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACtE,IAAI,QAAgB,CAAC;YACrB,IAAI,CAAC;gBACH,UAAU,EAAE,WAAW,EAAE,EAAE,CAAC;gBAC5B,QAAQ,GAAG,QAAQ,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC;YAClD,CAAC;oBAAS,CAAC;gBACT,UAAU,EAAE,UAAU,EAAE,EAAE,CAAC;YAC7B,CAAC;YACD,IAAI,QAAQ,KAAK,aAAa,EAAE,CAAC;gBAC/B,KAAK,CAAC,iCAAiC,QAAQ,eAAe,CAAC,CAAC;gBAChE,OAAO;YACT,CAAC;YACD,KAAK,CACH,0CAA0C,aAAa,SAAS,QAAQ,uBAAuB,CAChG,CAAC;YACF,0BAA0B;QAC5B,CAAC;IACH,CAAC;IAED,yEAAyE;IACzE,IAAI,UAAwD,CAAC;IAC7D,IAAI,CAAC;QACH,UAAU,GAAG,EAAE,CAAC,OAAO,CACrB,6GAA6G,CAC9G,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,KAAK,CAAC,qDAAqD,CAAC,CAAC;QAC7D,OAAO;IACT,CAAC;IAED,MAAM,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,CAAC,IAAc,EAAE,EAAE;QAC3C,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC;QACrF,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,OAAO,GAAa,EAAE,CAAC;IAE7B,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,WAAW,EAAE,CAAC;QAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;QAEvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,GAAG,IAAI,iBAAiB,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC;YACjD,SAAS,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;QAC/D,CAAC;QAED,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YACpC,gFAAgF;YAChF,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBACjC,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC9C,IAAI,YAAY,GAAkB,IAAI,CAAC;gBACvC,IAAI,SAAS,EAAE,CAAC;oBACd,YAAY;wBACV,SAAS,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,CAAC;gBACnF,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC;oBACX,IAAI,EAAE,OAAO;oBACb,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;oBACZ,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI;oBACpB,QAAQ,EAAE,CAAC,CAAC,QAAQ,IAAI,IAAI;oBAC5B,YAAY;iBACb,CAAC,CAAC;YACL,CAAC;QACH,CAAC;aAAM,CAAC;YACN,yCAAyC;YACzC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;YAChD,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAC9C,MAAM,OAAO,GAAa,EAAE,CAAC;gBAC7B,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;gBACnE,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,EAAE,CAAC,OAAO,CAAC,CAAC;IACd,CAAC;IAED,KAAK,CAAC,mBAAmB,OAAO,CAAC,MAAM,eAAe,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,OAAO,CACd,QAAwB,EACxB,IAAkB,EAClB,OAAe,EACf,IAAc,EACd,SAA8B;IAE9B,IAAI,CAAC,eAAe,EAAE,CAAC;QACrB,KAAK,CAAC,0DAA0D,CAAC,CAAC;QAClE,OAAO;IACT,CAAC;IACD,MAAM,OAAO,GAAG,qBAAqB,CAAC,eAAe,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IACjF,MAAM,OAAO,GAAG,gBAAgB,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC;IACpE,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAa,CAAC;IAC3D,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;AAC1B,CAAC;AAqCD,MAAM,UAAU,YAAY,CAC1B,OAA2B,EAC3B,YAAgC,EAChC,OAAqB,EAAE;IAcvB,MAAM,EAAE,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC;IAC5C,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;IAEpD,IAAI,KAAK,GAAG,WAAW,CAAC;IACxB,MAAM,MAAM,GAAc,EAAE,CAAC;IAE7B,IAAI,OAAO,IAAI,OAAO,KAAK,GAAG,EAAE,CAAC;QAC/B,MAAM,WAAW,GAAG,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,GAAG,CAAC;QACrE,KAAK,IAAI,oBAAoB,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,IAAI,EAAE,CAAC;QACT,KAAK,IAAI,iBAAiB,CAAC;QAC3B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,CAAC;QACC,MAAM,EAAE,GAAG,qBAAqB,CAAC,IAAI,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAC;QACvD,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,IAAI,OAAO,EAAE,CAAC;QACZ,KAAK,IAAI;;;;yCAI4B,CAAC;IACxC,CAAC;IAED,MAAM,GAAG,GAAG;;;;;MAKR,KAAK;;GAER,CAAC;IAEF,IAAI,IAAmB,CAAC;IACxB,IAAI,CAAC;QACH,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,MAAM,CAAkB,CAAC;IACzD,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;IAED,MAAM,OAAO,GAAqB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACjD,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;QACpB,MAAM,EAAE,CAAC,CAAC,cAAc;YACtB,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE;YACnE,CAAC,CAAC,IAAI;KACT,CAAC,CAAC,CAAC;IAEJ,MAAM,IAAI,GAAG;QACX,OAAO,EAAE,OAAO,IAAI,GAAG;QACvB,IAAI,EAAE,IAAI,IAAI,IAAI;QAClB,KAAK,EAAE,OAAO,CAAC,MAAM;QACrB,OAAO;KACR,CAAC;IAEF,OAAO,cAAc,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,QAAQ,CACtB,OAA2B,EAC3B,YAAgC,EAChC,OAAqB,EAAE;IAEvB,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;IAEvD,IAAI,YAAY,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC;QAAE,OAAO;IAEhD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,qBAAqB,OAAO,CAAC,CAAC,CAAC,cAAc,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC7E,OAAO;IACT,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAC3D,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK,aAAa,OAAO,CAAC,CAAC,CAAC,cAAc,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,SAAS,KAAK,CAAC,CAAC;IAElG,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;QACvC,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7D,OAAO,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,GAAG,UAAU,EAAE,CAAC,CAAC;IAC1E,CAAC;IAED,IAAI,IAAI,CAAC,WAAW,EAAE,OAAO,EAAE,CAAC;QAC9B,OAAO,CAAC,GAAG,CACT,WAAW,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,uBAAuB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,CAClK,CAAC;IACJ,CAAC;IACD,OAAO,CAAC,GAAG,EAAE,CAAC;AAChB,CAAC"}
|
|
@@ -6,6 +6,8 @@ export interface BfsOpts {
|
|
|
6
6
|
/**
|
|
7
7
|
* Breadth-first traversal on a CodeGraph.
|
|
8
8
|
*
|
|
9
|
+
* Tries the native Rust implementation first, falls back to JS.
|
|
10
|
+
*
|
|
9
11
|
* @returns nodeId → depth from nearest start node
|
|
10
12
|
*/
|
|
11
13
|
export declare function bfs(graph: CodeGraph, startIds: string | string[], opts?: BfsOpts): Map<string, number>;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/bfs.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"bfs.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/bfs.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC;CAC7C;AAED;;;;;;GAMG;AACH,wBAAgB,GAAG,CACjB,KAAK,EAAE,SAAS,EAChB,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,EAC3B,IAAI,GAAE,OAAY,GACjB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA2BrB"}
|
|
@@ -1,12 +1,39 @@
|
|
|
1
|
+
import { loadNative } from '../../infrastructure/native.js';
|
|
1
2
|
/**
|
|
2
3
|
* Breadth-first traversal on a CodeGraph.
|
|
3
4
|
*
|
|
5
|
+
* Tries the native Rust implementation first, falls back to JS.
|
|
6
|
+
*
|
|
4
7
|
* @returns nodeId → depth from nearest start node
|
|
5
8
|
*/
|
|
6
9
|
export function bfs(graph, startIds, opts = {}) {
|
|
7
10
|
const maxDepth = opts.maxDepth ?? Infinity;
|
|
8
11
|
const direction = opts.direction ?? 'forward';
|
|
9
12
|
const starts = Array.isArray(startIds) ? startIds : [startIds];
|
|
13
|
+
const native = loadNative();
|
|
14
|
+
if (native?.bfsTraversal) {
|
|
15
|
+
const edges = graph.toEdgeArray();
|
|
16
|
+
const nativeMaxDepth = maxDepth === Infinity ? null : maxDepth;
|
|
17
|
+
// Undirected graphs deduplicate edges to one canonical direction in toEdgeArray(),
|
|
18
|
+
// so the Rust side must traverse both directions to preserve symmetry.
|
|
19
|
+
const nativeDirection = !graph.directed ? 'both' : direction;
|
|
20
|
+
const result = native.bfsTraversal(edges, starts, nativeMaxDepth, nativeDirection);
|
|
21
|
+
const depths = new Map();
|
|
22
|
+
for (const entry of result) {
|
|
23
|
+
depths.set(entry.node, entry.depth);
|
|
24
|
+
}
|
|
25
|
+
// The Rust side only knows nodes referenced by edges; restore any isolated start nodes.
|
|
26
|
+
for (const startId of starts) {
|
|
27
|
+
if (graph.hasNode(startId) && !depths.has(startId)) {
|
|
28
|
+
depths.set(startId, 0);
|
|
29
|
+
}
|
|
30
|
+
}
|
|
31
|
+
return depths;
|
|
32
|
+
}
|
|
33
|
+
return bfsJS(graph, starts, maxDepth, direction);
|
|
34
|
+
}
|
|
35
|
+
/** Pure JS fallback for BFS (used when native addon is unavailable). */
|
|
36
|
+
function bfsJS(graph, starts, maxDepth, direction) {
|
|
10
37
|
const depths = new Map();
|
|
11
38
|
const queue = [];
|
|
12
39
|
for (const id of starts) {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"bfs.js","sourceRoot":"","sources":["../../../src/graph/algorithms/bfs.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"bfs.js","sourceRoot":"","sources":["../../../src/graph/algorithms/bfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAQ5D;;;;;;GAMG;AACH,MAAM,UAAU,GAAG,CACjB,KAAgB,EAChB,QAA2B,EAC3B,OAAgB,EAAE;IAElB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC;IAC9C,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IAE/D,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,IAAI,MAAM,EAAE,YAAY,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,cAAc,GAAG,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC;QAC/D,mFAAmF;QACnF,uEAAuE;QACvE,MAAM,eAAe,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7D,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,cAAc,EAAE,eAAe,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACtC,CAAC;QACD,wFAAwF;QACxF,KAAK,MAAM,OAAO,IAAI,MAAM,EAAE,CAAC;YAC7B,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACnD,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;AACnD,CAAC;AAED,wEAAwE;AACxE,SAAS,KAAK,CACZ,KAAgB,EAChB,MAAgB,EAChB,QAAgB,EAChB,SAAiB;IAEjB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,EAAE,CAAE,CAAC;QAC/B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QACnC,IAAI,KAAK,IAAI,QAAQ;YAAE,SAAS;QAEhC,IAAI,SAAmB,CAAC;QACxB,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACxC,CAAC;aAAM,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;YACpC,SAAS,GAAG,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}
|
|
@@ -5,6 +5,8 @@ export interface FanInOut {
|
|
|
5
5
|
}
|
|
6
6
|
/**
|
|
7
7
|
* Fan-in / fan-out centrality for all nodes in a CodeGraph.
|
|
8
|
+
*
|
|
9
|
+
* Tries the native Rust implementation first, falls back to JS.
|
|
8
10
|
*/
|
|
9
11
|
export declare function fanInOut(graph: CodeGraph): Map<string, FanInOut>;
|
|
10
12
|
//# sourceMappingURL=centrality.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"centrality.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/centrality.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"centrality.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/centrality.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,SAAS,GAAG,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAwBhE"}
|
|
@@ -1,7 +1,35 @@
|
|
|
1
|
+
import { loadNative } from '../../infrastructure/native.js';
|
|
1
2
|
/**
|
|
2
3
|
* Fan-in / fan-out centrality for all nodes in a CodeGraph.
|
|
4
|
+
*
|
|
5
|
+
* Tries the native Rust implementation first, falls back to JS.
|
|
3
6
|
*/
|
|
4
7
|
export function fanInOut(graph) {
|
|
8
|
+
const native = loadNative();
|
|
9
|
+
if (native?.fanInOut) {
|
|
10
|
+
let edges = graph.toEdgeArray();
|
|
11
|
+
if (!graph.directed) {
|
|
12
|
+
// Undirected: toEdgeArray() deduplicates to one canonical direction;
|
|
13
|
+
// mirror each edge so the Rust side counts symmetric in/out degrees.
|
|
14
|
+
edges = [...edges, ...edges.map((e) => ({ source: e.target, target: e.source }))];
|
|
15
|
+
}
|
|
16
|
+
const nativeResult = native.fanInOut(edges);
|
|
17
|
+
const result = new Map();
|
|
18
|
+
for (const entry of nativeResult) {
|
|
19
|
+
result.set(entry.node, { fanIn: entry.fanIn, fanOut: entry.fanOut });
|
|
20
|
+
}
|
|
21
|
+
// Ensure isolated nodes (no edges) are included
|
|
22
|
+
for (const id of graph.nodeIds()) {
|
|
23
|
+
if (!result.has(id)) {
|
|
24
|
+
result.set(id, { fanIn: 0, fanOut: 0 });
|
|
25
|
+
}
|
|
26
|
+
}
|
|
27
|
+
return result;
|
|
28
|
+
}
|
|
29
|
+
return fanInOutJS(graph);
|
|
30
|
+
}
|
|
31
|
+
/** Pure JS fallback for fan-in/out. */
|
|
32
|
+
function fanInOutJS(graph) {
|
|
5
33
|
const result = new Map();
|
|
6
34
|
for (const id of graph.nodeIds()) {
|
|
7
35
|
result.set(id, {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"centrality.js","sourceRoot":"","sources":["../../../src/graph/algorithms/centrality.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"centrality.js","sourceRoot":"","sources":["../../../src/graph/algorithms/centrality.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAQ5D;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAgB;IACvC,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,IAAI,MAAM,EAAE,QAAQ,EAAE,CAAC;QACrB,IAAI,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;YACpB,qEAAqE;YACrE,qEAAqE;YACrE,KAAK,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;QACpF,CAAC;QACD,MAAM,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC3C,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;QACvE,CAAC;QACD,gDAAgD;QAChD,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;YACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED,uCAAuC;AACvC,SAAS,UAAU,CAAC,KAAgB;IAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE;YACb,KAAK,EAAE,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;SAC5B,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}
|
|
@@ -1,10 +1,9 @@
|
|
|
1
1
|
/**
|
|
2
|
-
* Community detection via vendored Leiden algorithm.
|
|
2
|
+
* Community detection via native Rust Louvain or vendored Leiden algorithm.
|
|
3
3
|
* Maintains backward-compatible API: { assignments: Map<string, number>, modularity: number }
|
|
4
4
|
*
|
|
5
|
-
*
|
|
6
|
-
*
|
|
7
|
-
* use `detectClusters` from `./leiden/index.js` directly.
|
|
5
|
+
* Native path: classic Louvain (Rust, undirected modularity optimization).
|
|
6
|
+
* JS fallback: Leiden algorithm via `detectClusters` (always undirected, `directed: false`).
|
|
8
7
|
*/
|
|
9
8
|
import type { CodeGraph } from '../model.js';
|
|
10
9
|
export interface LouvainOptions {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.ts"],"names":[],"mappings":"AAAA
|
|
1
|
+
{"version":3,"file":"louvain.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAI7C,MAAM,WAAW,cAAc;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,aAAa;IAC5B,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,GAAE,cAAmB,GAAG,aAAa,CA2B7F"}
|
|
@@ -1,9 +1,38 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Community detection via native Rust Louvain or vendored Leiden algorithm.
|
|
3
|
+
* Maintains backward-compatible API: { assignments: Map<string, number>, modularity: number }
|
|
4
|
+
*
|
|
5
|
+
* Native path: classic Louvain (Rust, undirected modularity optimization).
|
|
6
|
+
* JS fallback: Leiden algorithm via `detectClusters` (always undirected, `directed: false`).
|
|
7
|
+
*/
|
|
8
|
+
import { warn } from '../../infrastructure/logger.js';
|
|
9
|
+
import { loadNative } from '../../infrastructure/native.js';
|
|
1
10
|
import { detectClusters } from './leiden/index.js';
|
|
2
11
|
export function louvainCommunities(graph, opts = {}) {
|
|
3
12
|
if (graph.nodeCount === 0 || graph.edgeCount === 0) {
|
|
4
13
|
return { assignments: new Map(), modularity: 0 };
|
|
5
14
|
}
|
|
6
15
|
const resolution = opts.resolution ?? 1.0;
|
|
16
|
+
const native = loadNative();
|
|
17
|
+
if (native?.louvainCommunities) {
|
|
18
|
+
// maxLevels, maxLocalPasses, and refinementTheta are Leiden-specific tuning knobs
|
|
19
|
+
// not supported by the Rust Louvain implementation. Warn callers who set them.
|
|
20
|
+
if (opts.maxLevels != null || opts.maxLocalPasses != null || opts.refinementTheta != null) {
|
|
21
|
+
warn('louvainCommunities: maxLevels/maxLocalPasses/refinementTheta are ignored by the native Rust path');
|
|
22
|
+
}
|
|
23
|
+
const edges = graph.toEdgeArray();
|
|
24
|
+
const nodeIds = graph.nodeIds();
|
|
25
|
+
const result = native.louvainCommunities(edges, nodeIds, resolution, 42);
|
|
26
|
+
const assignments = new Map();
|
|
27
|
+
for (const entry of result.assignments) {
|
|
28
|
+
assignments.set(entry.node, entry.community);
|
|
29
|
+
}
|
|
30
|
+
return { assignments, modularity: result.modularity };
|
|
31
|
+
}
|
|
32
|
+
return louvainJS(graph, opts, resolution);
|
|
33
|
+
}
|
|
34
|
+
/** JS fallback using the vendored Leiden algorithm. */
|
|
35
|
+
function louvainJS(graph, opts, resolution) {
|
|
7
36
|
const result = detectClusters(graph, {
|
|
8
37
|
resolution,
|
|
9
38
|
randomSeed: 42,
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"louvain.js","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"louvain.js","sourceRoot":"","sources":["../../../src/graph/algorithms/louvain.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,gCAAgC,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAG5D,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAcnD,MAAM,UAAU,kBAAkB,CAAC,KAAgB,EAAE,OAAuB,EAAE;IAC5E,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,IAAI,KAAK,CAAC,SAAS,KAAK,CAAC,EAAE,CAAC;QACnD,OAAO,EAAE,WAAW,EAAE,IAAI,GAAG,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACnD,CAAC;IAED,MAAM,UAAU,GAAW,IAAI,CAAC,UAAU,IAAI,GAAG,CAAC;IAElD,MAAM,MAAM,GAAG,UAAU,EAAE,CAAC;IAC5B,IAAI,MAAM,EAAE,kBAAkB,EAAE,CAAC;QAC/B,kFAAkF;QAClF,+EAA+E;QAC/E,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,EAAE,CAAC;YAC1F,IAAI,CACF,kGAAkG,CACnG,CAAC;QACJ,CAAC;QACD,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAClC,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,MAAM,CAAC,kBAAkB,CAAC,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;QACzE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC9C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;YACvC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC;IACxD,CAAC;IAED,OAAO,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AAC5C,CAAC;AAED,uDAAuD;AACvD,SAAS,SAAS,CAAC,KAAgB,EAAE,IAAoB,EAAE,UAAkB;IAC3E,MAAM,MAAM,GAAyB,cAAc,CAAC,KAAK,EAAE;QACzD,UAAU;QACV,UAAU,EAAE,EAAE;QACd,QAAQ,EAAE,KAAK;QACf,GAAG,CAAC,IAAI,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QAC5D,GAAG,CAAC,IAAI,CAAC,cAAc,IAAI,IAAI,IAAI,EAAE,cAAc,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC;QAC3E,GAAG,CAAC,IAAI,CAAC,eAAe,IAAI,IAAI,IAAI,EAAE,eAAe,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC;KAC/E,CAAC,CAAC;IAEH,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,GAAG,IAAI,IAAI;YAAE,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC;AACvD,CAAC"}
|
|
@@ -2,6 +2,8 @@ import type { CodeGraph } from '../model.js';
|
|
|
2
2
|
/**
|
|
3
3
|
* BFS-based shortest path on a CodeGraph.
|
|
4
4
|
*
|
|
5
|
+
* Tries the native Rust implementation first, falls back to JS.
|
|
6
|
+
*
|
|
5
7
|
* @returns Path from fromId to toId (inclusive), or null if unreachable
|
|
6
8
|
*/
|
|
7
9
|
export declare function shortestPath(graph: CodeGraph, fromId: string, toId: string): string[] | null;
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"shortest-path.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"shortest-path.d.ts","sourceRoot":"","sources":["../../../src/graph/algorithms/shortest-path.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAE7C;;;;;;GAMG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,IAAI,CAoB5F"}
|
|
@@ -1,6 +1,9 @@
|
|
|
1
|
+
import { loadNative } from '../../infrastructure/native.js';
|
|
1
2
|
/**
|
|
2
3
|
* BFS-based shortest path on a CodeGraph.
|
|
3
4
|
*
|
|
5
|
+
* Tries the native Rust implementation first, falls back to JS.
|
|
6
|
+
*
|
|
4
7
|
* @returns Path from fromId to toId (inclusive), or null if unreachable
|
|
5
8
|
*/
|
|
6
9
|
export function shortestPath(graph, fromId, toId) {
|
|
@@ -10,6 +13,21 @@ export function shortestPath(graph, fromId, toId) {
|
|
|
10
13
|
return null;
|
|
11
14
|
if (from === to)
|
|
12
15
|
return [from];
|
|
16
|
+
const native = loadNative();
|
|
17
|
+
if (native?.shortestPath) {
|
|
18
|
+
let edges = graph.toEdgeArray();
|
|
19
|
+
if (!graph.directed) {
|
|
20
|
+
// Undirected: toEdgeArray() deduplicates to one canonical direction;
|
|
21
|
+
// mirror each edge so the Rust BFS can traverse in both directions.
|
|
22
|
+
edges = [...edges, ...edges.map((e) => ({ source: e.target, target: e.source }))];
|
|
23
|
+
}
|
|
24
|
+
const result = native.shortestPath(edges, from, to);
|
|
25
|
+
return result.length > 0 ? result : null;
|
|
26
|
+
}
|
|
27
|
+
return shortestPathJS(graph, from, to);
|
|
28
|
+
}
|
|
29
|
+
/** Pure JS fallback for shortest path. */
|
|
30
|
+
function shortestPathJS(graph, from, to) {
|
|
13
31
|
const parent = new Map();
|
|
14
32
|
parent.set(from, null);
|
|
15
33
|
const queue = [from];
|
|
@@ -21,7 +39,6 @@ export function shortestPath(graph, fromId, toId) {
|
|
|
21
39
|
continue;
|
|
22
40
|
parent.set(neighbor, current);
|
|
23
41
|
if (neighbor === to) {
|
|
24
|
-
// Reconstruct path
|
|
25
42
|
const path = [];
|
|
26
43
|
let node = to;
|
|
27
44
|
while (node !== null) {
|