@optave/codegraph 3.6.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 +32 -16
- 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 +129 -3
- 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/dart.d.ts +6 -0
- package/dist/extractors/dart.d.ts.map +1 -0
- package/dist/extractors/dart.js +277 -0
- package/dist/extractors/dart.js.map +1 -0
- package/dist/extractors/elixir.d.ts +9 -0
- package/dist/extractors/elixir.d.ts.map +1 -0
- package/dist/extractors/elixir.js +223 -0
- package/dist/extractors/elixir.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/haskell.d.ts +8 -0
- package/dist/extractors/haskell.d.ts.map +1 -0
- package/dist/extractors/haskell.js +217 -0
- package/dist/extractors/haskell.js.map +1 -0
- package/dist/extractors/index.d.ts +17 -0
- package/dist/extractors/index.d.ts.map +1 -1
- package/dist/extractors/index.js +17 -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/lua.d.ts +6 -0
- package/dist/extractors/lua.d.ts.map +1 -0
- package/dist/extractors/lua.js +162 -0
- package/dist/extractors/lua.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.d.ts +6 -0
- package/dist/extractors/ocaml.d.ts.map +1 -0
- package/dist/extractors/ocaml.js +310 -0
- package/dist/extractors/ocaml.js.map +1 -0
- 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/extractors/zig.d.ts +9 -0
- package/dist/extractors/zig.d.ts.map +1 -0
- package/dist/extractors/zig.js +276 -0
- package/dist/extractors/zig.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/features/cfg.d.ts +1 -1
- package/dist/features/cfg.d.ts.map +1 -1
- package/dist/features/cfg.js +6 -51
- package/dist/features/cfg.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-dart.wasm +0 -0
- package/grammars/tree-sitter-elixir.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-haskell.wasm +0 -0
- package/grammars/tree-sitter-julia.wasm +0 -0
- package/grammars/tree-sitter-lua.wasm +0 -0
- package/grammars/tree-sitter-objc.wasm +0 -0
- package/grammars/tree-sitter-ocaml.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/grammars/tree-sitter-zig.wasm +0 -0
- package/package.json +24 -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 +161 -1
- package/src/extractors/clojure.ts +273 -0
- package/src/extractors/cuda.ts +316 -0
- package/src/extractors/dart.ts +304 -0
- package/src/extractors/elixir.ts +251 -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/haskell.ts +235 -0
- package/src/extractors/index.ts +17 -0
- package/src/extractors/julia.ts +318 -0
- package/src/extractors/lua.ts +169 -0
- package/src/extractors/objc.ts +431 -0
- package/src/extractors/ocaml.ts +337 -0
- package/src/extractors/r.ts +253 -0
- package/src/extractors/solidity.ts +398 -0
- package/src/extractors/verilog.ts +315 -0
- package/src/extractors/zig.ts +294 -0
- package/src/features/ast.ts +1 -2
- package/src/features/cfg.ts +6 -51
- 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 +123 -2
|
@@ -0,0 +1,332 @@
|
|
|
1
|
+
import type {
|
|
2
|
+
Call,
|
|
3
|
+
ExtractorOutput,
|
|
4
|
+
SubDeclaration,
|
|
5
|
+
TreeSitterNode,
|
|
6
|
+
TreeSitterTree,
|
|
7
|
+
} from '../types.js';
|
|
8
|
+
import {
|
|
9
|
+
extractModifierVisibility,
|
|
10
|
+
findChild,
|
|
11
|
+
findParentNode,
|
|
12
|
+
lastPathSegment,
|
|
13
|
+
nodeEndLine,
|
|
14
|
+
} from './helpers.js';
|
|
15
|
+
|
|
16
|
+
/**
|
|
17
|
+
* Extract symbols from Groovy files.
|
|
18
|
+
*
|
|
19
|
+
* Groovy is a JVM language with Java-like class/interface/enum structures
|
|
20
|
+
* plus closures, traits, and dynamic typing. The tree-sitter-groovy grammar
|
|
21
|
+
* models classes, methods, imports, and call expressions similarly to Java.
|
|
22
|
+
*/
|
|
23
|
+
export function extractGroovySymbols(tree: TreeSitterTree, _filePath: string): ExtractorOutput {
|
|
24
|
+
const ctx: ExtractorOutput = {
|
|
25
|
+
definitions: [],
|
|
26
|
+
calls: [],
|
|
27
|
+
imports: [],
|
|
28
|
+
classes: [],
|
|
29
|
+
exports: [],
|
|
30
|
+
typeMap: new Map(),
|
|
31
|
+
};
|
|
32
|
+
|
|
33
|
+
walkGroovyNode(tree.rootNode, ctx);
|
|
34
|
+
return ctx;
|
|
35
|
+
}
|
|
36
|
+
|
|
37
|
+
function walkGroovyNode(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
38
|
+
switch (node.type) {
|
|
39
|
+
case 'class_definition':
|
|
40
|
+
case 'class_declaration':
|
|
41
|
+
handleGroovyClassDecl(node, ctx);
|
|
42
|
+
break;
|
|
43
|
+
case 'interface_definition':
|
|
44
|
+
case 'interface_declaration':
|
|
45
|
+
handleGroovyInterfaceDecl(node, ctx);
|
|
46
|
+
break;
|
|
47
|
+
case 'enum_definition':
|
|
48
|
+
case 'enum_declaration':
|
|
49
|
+
handleGroovyEnumDecl(node, ctx);
|
|
50
|
+
break;
|
|
51
|
+
case 'method_definition':
|
|
52
|
+
case 'method_declaration':
|
|
53
|
+
handleGroovyMethodDecl(node, ctx);
|
|
54
|
+
break;
|
|
55
|
+
case 'constructor_definition':
|
|
56
|
+
case 'constructor_declaration':
|
|
57
|
+
handleGroovyConstructorDecl(node, ctx);
|
|
58
|
+
break;
|
|
59
|
+
case 'function_definition':
|
|
60
|
+
case 'function_declaration':
|
|
61
|
+
handleGroovyFunctionDecl(node, ctx);
|
|
62
|
+
break;
|
|
63
|
+
case 'import_statement':
|
|
64
|
+
case 'import_declaration':
|
|
65
|
+
handleGroovyImport(node, ctx);
|
|
66
|
+
break;
|
|
67
|
+
case 'method_call':
|
|
68
|
+
case 'method_invocation':
|
|
69
|
+
case 'call_expression':
|
|
70
|
+
case 'function_call':
|
|
71
|
+
handleGroovyCallExpr(node, ctx);
|
|
72
|
+
break;
|
|
73
|
+
case 'object_creation_expression':
|
|
74
|
+
handleGroovyObjectCreation(node, ctx);
|
|
75
|
+
break;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
79
|
+
const child = node.child(i);
|
|
80
|
+
if (child) walkGroovyNode(child, ctx);
|
|
81
|
+
}
|
|
82
|
+
}
|
|
83
|
+
|
|
84
|
+
// ── Handlers ───────────────────────────────────────────────────────────────
|
|
85
|
+
|
|
86
|
+
const GROOVY_PARENT_TYPES = [
|
|
87
|
+
'class_definition',
|
|
88
|
+
'class_declaration',
|
|
89
|
+
'enum_definition',
|
|
90
|
+
'enum_declaration',
|
|
91
|
+
'interface_definition',
|
|
92
|
+
'interface_declaration',
|
|
93
|
+
] as const;
|
|
94
|
+
|
|
95
|
+
function handleGroovyClassDecl(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
96
|
+
const nameNode = node.childForFieldName('name');
|
|
97
|
+
if (!nameNode) return;
|
|
98
|
+
const name = nameNode.text;
|
|
99
|
+
|
|
100
|
+
const members = extractGroovyClassMembers(node);
|
|
101
|
+
ctx.definitions.push({
|
|
102
|
+
name,
|
|
103
|
+
kind: 'class',
|
|
104
|
+
line: node.startPosition.row + 1,
|
|
105
|
+
endLine: nodeEndLine(node),
|
|
106
|
+
children: members.length > 0 ? members : undefined,
|
|
107
|
+
visibility: extractModifierVisibility(node),
|
|
108
|
+
});
|
|
109
|
+
|
|
110
|
+
// Superclass
|
|
111
|
+
const superclass = node.childForFieldName('superclass');
|
|
112
|
+
if (superclass) {
|
|
113
|
+
const superName =
|
|
114
|
+
superclass.type === 'generic_type' ? superclass.child(0)?.text : superclass.text;
|
|
115
|
+
if (superName) {
|
|
116
|
+
ctx.classes.push({ name, extends: superName, line: node.startPosition.row + 1 });
|
|
117
|
+
}
|
|
118
|
+
}
|
|
119
|
+
|
|
120
|
+
// Interfaces
|
|
121
|
+
const interfaces = node.childForFieldName('interfaces');
|
|
122
|
+
if (interfaces) {
|
|
123
|
+
for (let i = 0; i < interfaces.childCount; i++) {
|
|
124
|
+
const iface = interfaces.child(i);
|
|
125
|
+
if (
|
|
126
|
+
iface &&
|
|
127
|
+
(iface.type === 'type_identifier' ||
|
|
128
|
+
iface.type === 'identifier' ||
|
|
129
|
+
iface.type === 'generic_type')
|
|
130
|
+
) {
|
|
131
|
+
const ifaceName = iface.type === 'generic_type' ? iface.child(0)?.text : iface.text;
|
|
132
|
+
if (ifaceName) {
|
|
133
|
+
ctx.classes.push({ name, implements: ifaceName, line: node.startPosition.row + 1 });
|
|
134
|
+
}
|
|
135
|
+
}
|
|
136
|
+
}
|
|
137
|
+
}
|
|
138
|
+
}
|
|
139
|
+
|
|
140
|
+
function handleGroovyInterfaceDecl(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
141
|
+
const nameNode = node.childForFieldName('name');
|
|
142
|
+
if (!nameNode) return;
|
|
143
|
+
|
|
144
|
+
ctx.definitions.push({
|
|
145
|
+
name: nameNode.text,
|
|
146
|
+
kind: 'interface',
|
|
147
|
+
line: node.startPosition.row + 1,
|
|
148
|
+
endLine: nodeEndLine(node),
|
|
149
|
+
visibility: extractModifierVisibility(node),
|
|
150
|
+
});
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
function handleGroovyEnumDecl(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
154
|
+
const nameNode = node.childForFieldName('name');
|
|
155
|
+
if (!nameNode) return;
|
|
156
|
+
|
|
157
|
+
const members: SubDeclaration[] = [];
|
|
158
|
+
const body = node.childForFieldName('body') || findChild(node, 'enum_body');
|
|
159
|
+
if (body) {
|
|
160
|
+
for (let i = 0; i < body.childCount; i++) {
|
|
161
|
+
const child = body.child(i);
|
|
162
|
+
if (!child) continue;
|
|
163
|
+
if (child.type === 'enum_constant' || child.type === 'identifier') {
|
|
164
|
+
const constName = child.childForFieldName('name') || child;
|
|
165
|
+
members.push({ name: constName.text, kind: 'constant', line: child.startPosition.row + 1 });
|
|
166
|
+
}
|
|
167
|
+
}
|
|
168
|
+
}
|
|
169
|
+
|
|
170
|
+
ctx.definitions.push({
|
|
171
|
+
name: nameNode.text,
|
|
172
|
+
kind: 'enum',
|
|
173
|
+
line: node.startPosition.row + 1,
|
|
174
|
+
endLine: nodeEndLine(node),
|
|
175
|
+
children: members.length > 0 ? members : undefined,
|
|
176
|
+
});
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
function handleGroovyMethodDecl(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
180
|
+
const nameNode = node.childForFieldName('name');
|
|
181
|
+
if (!nameNode) return;
|
|
182
|
+
const parentClass = findParentNode(node, GROOVY_PARENT_TYPES);
|
|
183
|
+
const fullName = parentClass ? `${parentClass}.${nameNode.text}` : nameNode.text;
|
|
184
|
+
|
|
185
|
+
const params = extractGroovyParams(node);
|
|
186
|
+
ctx.definitions.push({
|
|
187
|
+
name: fullName,
|
|
188
|
+
kind: 'method',
|
|
189
|
+
line: node.startPosition.row + 1,
|
|
190
|
+
endLine: nodeEndLine(node),
|
|
191
|
+
children: params.length > 0 ? params : undefined,
|
|
192
|
+
visibility: extractModifierVisibility(node),
|
|
193
|
+
});
|
|
194
|
+
}
|
|
195
|
+
|
|
196
|
+
function handleGroovyConstructorDecl(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
197
|
+
const nameNode = node.childForFieldName('name');
|
|
198
|
+
if (!nameNode) return;
|
|
199
|
+
const parentClass = findParentNode(node, GROOVY_PARENT_TYPES);
|
|
200
|
+
const fullName = parentClass ? `${parentClass}.${nameNode.text}` : nameNode.text;
|
|
201
|
+
|
|
202
|
+
const params = extractGroovyParams(node);
|
|
203
|
+
ctx.definitions.push({
|
|
204
|
+
name: fullName,
|
|
205
|
+
kind: 'method',
|
|
206
|
+
line: node.startPosition.row + 1,
|
|
207
|
+
endLine: nodeEndLine(node),
|
|
208
|
+
children: params.length > 0 ? params : undefined,
|
|
209
|
+
visibility: extractModifierVisibility(node),
|
|
210
|
+
});
|
|
211
|
+
}
|
|
212
|
+
|
|
213
|
+
function handleGroovyFunctionDecl(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
214
|
+
const nameNode = node.childForFieldName('name');
|
|
215
|
+
if (!nameNode) return;
|
|
216
|
+
|
|
217
|
+
const params = extractGroovyParams(node);
|
|
218
|
+
ctx.definitions.push({
|
|
219
|
+
name: nameNode.text,
|
|
220
|
+
kind: 'function',
|
|
221
|
+
line: node.startPosition.row + 1,
|
|
222
|
+
endLine: nodeEndLine(node),
|
|
223
|
+
children: params.length > 0 ? params : undefined,
|
|
224
|
+
});
|
|
225
|
+
}
|
|
226
|
+
|
|
227
|
+
function handleGroovyImport(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
228
|
+
// import foo.bar.Baz or import foo.bar.*
|
|
229
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
230
|
+
const child = node.child(i);
|
|
231
|
+
if (!child) continue;
|
|
232
|
+
if (
|
|
233
|
+
child.type === 'dotted_identifier' ||
|
|
234
|
+
child.type === 'scoped_identifier' ||
|
|
235
|
+
child.type === 'identifier' ||
|
|
236
|
+
child.type === 'qualified_name'
|
|
237
|
+
) {
|
|
238
|
+
const fullPath = child.text;
|
|
239
|
+
const lastName = lastPathSegment(fullPath, '.');
|
|
240
|
+
ctx.imports.push({
|
|
241
|
+
source: fullPath,
|
|
242
|
+
names: [lastName],
|
|
243
|
+
line: node.startPosition.row + 1,
|
|
244
|
+
javaImport: true,
|
|
245
|
+
});
|
|
246
|
+
return;
|
|
247
|
+
}
|
|
248
|
+
}
|
|
249
|
+
}
|
|
250
|
+
|
|
251
|
+
function handleGroovyCallExpr(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
252
|
+
const call: Call = { name: '', line: node.startPosition.row + 1 };
|
|
253
|
+
|
|
254
|
+
// Try standard call_expression pattern
|
|
255
|
+
const funcNode = node.childForFieldName('function') || node.childForFieldName('method');
|
|
256
|
+
if (funcNode) {
|
|
257
|
+
if (funcNode.type === 'field_expression' || funcNode.type === 'member_access') {
|
|
258
|
+
const field = funcNode.childForFieldName('field') || funcNode.childForFieldName('property');
|
|
259
|
+
const obj = funcNode.childForFieldName('argument') || funcNode.childForFieldName('object');
|
|
260
|
+
if (field) call.name = field.text;
|
|
261
|
+
if (obj) call.receiver = obj.text;
|
|
262
|
+
} else {
|
|
263
|
+
call.name = funcNode.text;
|
|
264
|
+
}
|
|
265
|
+
} else {
|
|
266
|
+
// method_call: first child is receiver/name
|
|
267
|
+
const nameNode = node.childForFieldName('name');
|
|
268
|
+
const obj = node.childForFieldName('object');
|
|
269
|
+
if (nameNode) {
|
|
270
|
+
call.name = nameNode.text;
|
|
271
|
+
if (obj) call.receiver = obj.text;
|
|
272
|
+
}
|
|
273
|
+
}
|
|
274
|
+
|
|
275
|
+
if (call.name) ctx.calls.push(call);
|
|
276
|
+
}
|
|
277
|
+
|
|
278
|
+
function handleGroovyObjectCreation(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
279
|
+
const typeNode = node.childForFieldName('type');
|
|
280
|
+
if (!typeNode) return;
|
|
281
|
+
const typeName = typeNode.type === 'generic_type' ? typeNode.child(0)?.text : typeNode.text;
|
|
282
|
+
if (typeName) ctx.calls.push({ name: typeName, line: node.startPosition.row + 1 });
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
// ── Helpers ────────────────────────────────────────────────────────────────
|
|
286
|
+
|
|
287
|
+
function extractGroovyParams(funcNode: TreeSitterNode): SubDeclaration[] {
|
|
288
|
+
const params: SubDeclaration[] = [];
|
|
289
|
+
const paramList =
|
|
290
|
+
funcNode.childForFieldName('parameters') || findChild(funcNode, 'formal_parameters');
|
|
291
|
+
if (!paramList) return params;
|
|
292
|
+
|
|
293
|
+
for (let i = 0; i < paramList.childCount; i++) {
|
|
294
|
+
const param = paramList.child(i);
|
|
295
|
+
if (!param) continue;
|
|
296
|
+
if (param.type === 'formal_parameter' || param.type === 'parameter') {
|
|
297
|
+
const nameNode = param.childForFieldName('name');
|
|
298
|
+
if (nameNode) {
|
|
299
|
+
params.push({ name: nameNode.text, kind: 'parameter', line: param.startPosition.row + 1 });
|
|
300
|
+
}
|
|
301
|
+
}
|
|
302
|
+
}
|
|
303
|
+
return params;
|
|
304
|
+
}
|
|
305
|
+
|
|
306
|
+
function extractGroovyClassMembers(classNode: TreeSitterNode): SubDeclaration[] {
|
|
307
|
+
const members: SubDeclaration[] = [];
|
|
308
|
+
const body = classNode.childForFieldName('body') || findChild(classNode, 'class_body');
|
|
309
|
+
if (!body) return members;
|
|
310
|
+
|
|
311
|
+
for (let i = 0; i < body.childCount; i++) {
|
|
312
|
+
const child = body.child(i);
|
|
313
|
+
if (!child) continue;
|
|
314
|
+
if (child.type === 'field_declaration') {
|
|
315
|
+
for (let j = 0; j < child.childCount; j++) {
|
|
316
|
+
const varDecl = child.child(j);
|
|
317
|
+
if (varDecl?.type === 'variable_declarator') {
|
|
318
|
+
const nameNode = varDecl.childForFieldName('name');
|
|
319
|
+
if (nameNode) {
|
|
320
|
+
members.push({
|
|
321
|
+
name: nameNode.text,
|
|
322
|
+
kind: 'property',
|
|
323
|
+
line: child.startPosition.row + 1,
|
|
324
|
+
visibility: extractModifierVisibility(child),
|
|
325
|
+
});
|
|
326
|
+
}
|
|
327
|
+
}
|
|
328
|
+
}
|
|
329
|
+
}
|
|
330
|
+
}
|
|
331
|
+
return members;
|
|
332
|
+
}
|
|
@@ -0,0 +1,235 @@
|
|
|
1
|
+
import type { ExtractorOutput, SubDeclaration, TreeSitterNode, TreeSitterTree } from '../types.js';
|
|
2
|
+
import { findChild, nodeEndLine } from './helpers.js';
|
|
3
|
+
|
|
4
|
+
/**
|
|
5
|
+
* Extract symbols from Haskell files.
|
|
6
|
+
*
|
|
7
|
+
* Note: tree-sitter-haskell uses `type_synomym` (misspelled) for type aliases.
|
|
8
|
+
*/
|
|
9
|
+
export function extractHaskellSymbols(tree: TreeSitterTree, _filePath: string): ExtractorOutput {
|
|
10
|
+
const ctx: ExtractorOutput = {
|
|
11
|
+
definitions: [],
|
|
12
|
+
calls: [],
|
|
13
|
+
imports: [],
|
|
14
|
+
classes: [],
|
|
15
|
+
exports: [],
|
|
16
|
+
typeMap: new Map(),
|
|
17
|
+
};
|
|
18
|
+
|
|
19
|
+
walkHaskellNode(tree.rootNode, ctx);
|
|
20
|
+
return ctx;
|
|
21
|
+
}
|
|
22
|
+
|
|
23
|
+
function walkHaskellNode(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
24
|
+
switch (node.type) {
|
|
25
|
+
case 'function':
|
|
26
|
+
handleHaskellFunction(node, ctx);
|
|
27
|
+
break;
|
|
28
|
+
case 'bind':
|
|
29
|
+
handleHaskellBind(node, ctx);
|
|
30
|
+
break;
|
|
31
|
+
case 'data_type':
|
|
32
|
+
handleHaskellDataType(node, ctx);
|
|
33
|
+
break;
|
|
34
|
+
case 'newtype':
|
|
35
|
+
handleHaskellNewtype(node, ctx);
|
|
36
|
+
break;
|
|
37
|
+
case 'type_synomym':
|
|
38
|
+
handleHaskellTypeSynonym(node, ctx);
|
|
39
|
+
break;
|
|
40
|
+
case 'class':
|
|
41
|
+
handleHaskellClass(node, ctx);
|
|
42
|
+
break;
|
|
43
|
+
case 'instance':
|
|
44
|
+
handleHaskellInstance(node, ctx);
|
|
45
|
+
break;
|
|
46
|
+
case 'import':
|
|
47
|
+
handleHaskellImport(node, ctx);
|
|
48
|
+
break;
|
|
49
|
+
case 'apply':
|
|
50
|
+
handleHaskellApply(node, ctx);
|
|
51
|
+
break;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
for (let i = 0; i < node.childCount; i++) {
|
|
55
|
+
const child = node.child(i);
|
|
56
|
+
if (child) walkHaskellNode(child, ctx);
|
|
57
|
+
}
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
function handleHaskellFunction(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
61
|
+
const nameNode = node.childForFieldName('name');
|
|
62
|
+
if (!nameNode) return;
|
|
63
|
+
|
|
64
|
+
const params = extractHaskellParams(node);
|
|
65
|
+
|
|
66
|
+
ctx.definitions.push({
|
|
67
|
+
name: nameNode.text,
|
|
68
|
+
kind: 'function',
|
|
69
|
+
line: node.startPosition.row + 1,
|
|
70
|
+
endLine: nodeEndLine(node),
|
|
71
|
+
children: params.length > 0 ? params : undefined,
|
|
72
|
+
});
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
function extractHaskellParams(funcNode: TreeSitterNode): SubDeclaration[] {
|
|
76
|
+
const params: SubDeclaration[] = [];
|
|
77
|
+
// Haskell function patterns are positional children
|
|
78
|
+
for (let i = 0; i < funcNode.childCount; i++) {
|
|
79
|
+
const child = funcNode.child(i);
|
|
80
|
+
if (!child) continue;
|
|
81
|
+
if (child.type === 'patterns' || child.type === 'parameter') {
|
|
82
|
+
for (let j = 0; j < child.childCount; j++) {
|
|
83
|
+
const pat = child.child(j);
|
|
84
|
+
if (pat && (pat.type === 'variable' || pat.type === 'identifier')) {
|
|
85
|
+
params.push({ name: pat.text, kind: 'parameter', line: pat.startPosition.row + 1 });
|
|
86
|
+
}
|
|
87
|
+
}
|
|
88
|
+
}
|
|
89
|
+
if (child.type === 'variable' && i > 0) {
|
|
90
|
+
// Pattern parameters after the function name
|
|
91
|
+
params.push({ name: child.text, kind: 'parameter', line: child.startPosition.row + 1 });
|
|
92
|
+
}
|
|
93
|
+
}
|
|
94
|
+
return params;
|
|
95
|
+
}
|
|
96
|
+
|
|
97
|
+
function handleHaskellBind(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
98
|
+
const nameNode = node.childForFieldName('name');
|
|
99
|
+
if (!nameNode) return;
|
|
100
|
+
|
|
101
|
+
ctx.definitions.push({
|
|
102
|
+
name: nameNode.text,
|
|
103
|
+
kind: 'variable',
|
|
104
|
+
line: node.startPosition.row + 1,
|
|
105
|
+
endLine: nodeEndLine(node),
|
|
106
|
+
});
|
|
107
|
+
}
|
|
108
|
+
|
|
109
|
+
function handleHaskellDataType(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
110
|
+
const nameNode = node.childForFieldName('name');
|
|
111
|
+
if (!nameNode) return;
|
|
112
|
+
const name = nameNode.text;
|
|
113
|
+
|
|
114
|
+
const children: SubDeclaration[] = [];
|
|
115
|
+
// Extract constructors
|
|
116
|
+
const constructors = node.childForFieldName('constructors');
|
|
117
|
+
if (constructors) {
|
|
118
|
+
for (let i = 0; i < constructors.childCount; i++) {
|
|
119
|
+
const ctor = constructors.child(i);
|
|
120
|
+
if (!ctor) continue;
|
|
121
|
+
if (ctor.type === 'data_constructor' || ctor.type === 'gadt_constructor') {
|
|
122
|
+
const ctorName = findChild(ctor, 'constructor') || findChild(ctor, 'constructor_operator');
|
|
123
|
+
if (ctorName) {
|
|
124
|
+
children.push({
|
|
125
|
+
name: ctorName.text,
|
|
126
|
+
kind: 'property',
|
|
127
|
+
line: ctor.startPosition.row + 1,
|
|
128
|
+
});
|
|
129
|
+
}
|
|
130
|
+
}
|
|
131
|
+
}
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
ctx.definitions.push({
|
|
135
|
+
name,
|
|
136
|
+
kind: 'type',
|
|
137
|
+
line: node.startPosition.row + 1,
|
|
138
|
+
endLine: nodeEndLine(node),
|
|
139
|
+
children: children.length > 0 ? children : undefined,
|
|
140
|
+
});
|
|
141
|
+
}
|
|
142
|
+
|
|
143
|
+
function handleHaskellNewtype(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
144
|
+
const nameNode = node.childForFieldName('name');
|
|
145
|
+
if (!nameNode) return;
|
|
146
|
+
|
|
147
|
+
ctx.definitions.push({
|
|
148
|
+
name: nameNode.text,
|
|
149
|
+
kind: 'type',
|
|
150
|
+
line: node.startPosition.row + 1,
|
|
151
|
+
endLine: nodeEndLine(node),
|
|
152
|
+
});
|
|
153
|
+
}
|
|
154
|
+
|
|
155
|
+
function handleHaskellTypeSynonym(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
156
|
+
const nameNode = node.childForFieldName('name');
|
|
157
|
+
if (!nameNode) return;
|
|
158
|
+
|
|
159
|
+
ctx.definitions.push({
|
|
160
|
+
name: nameNode.text,
|
|
161
|
+
kind: 'type',
|
|
162
|
+
line: node.startPosition.row + 1,
|
|
163
|
+
endLine: nodeEndLine(node),
|
|
164
|
+
});
|
|
165
|
+
}
|
|
166
|
+
|
|
167
|
+
function handleHaskellClass(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
168
|
+
const nameNode = node.childForFieldName('name');
|
|
169
|
+
if (!nameNode) return;
|
|
170
|
+
|
|
171
|
+
ctx.definitions.push({
|
|
172
|
+
name: nameNode.text,
|
|
173
|
+
kind: 'class',
|
|
174
|
+
line: node.startPosition.row + 1,
|
|
175
|
+
endLine: nodeEndLine(node),
|
|
176
|
+
});
|
|
177
|
+
}
|
|
178
|
+
|
|
179
|
+
function handleHaskellInstance(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
180
|
+
const nameNode = node.childForFieldName('name');
|
|
181
|
+
if (!nameNode) return;
|
|
182
|
+
|
|
183
|
+
ctx.definitions.push({
|
|
184
|
+
name: nameNode.text,
|
|
185
|
+
kind: 'class',
|
|
186
|
+
line: node.startPosition.row + 1,
|
|
187
|
+
endLine: nodeEndLine(node),
|
|
188
|
+
});
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
function handleHaskellImport(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
192
|
+
const moduleNode = node.childForFieldName('module');
|
|
193
|
+
if (!moduleNode) return;
|
|
194
|
+
|
|
195
|
+
const source = moduleNode.text;
|
|
196
|
+
const names: string[] = [];
|
|
197
|
+
|
|
198
|
+
const alias = node.childForFieldName('alias');
|
|
199
|
+
if (alias) names.push(alias.text);
|
|
200
|
+
|
|
201
|
+
const importList = node.childForFieldName('names');
|
|
202
|
+
if (importList) {
|
|
203
|
+
for (let i = 0; i < importList.childCount; i++) {
|
|
204
|
+
const item = importList.child(i);
|
|
205
|
+
if (
|
|
206
|
+
item &&
|
|
207
|
+
(item.type === 'variable' || item.type === 'constructor' || item.type === 'type')
|
|
208
|
+
) {
|
|
209
|
+
names.push(item.text);
|
|
210
|
+
}
|
|
211
|
+
}
|
|
212
|
+
}
|
|
213
|
+
|
|
214
|
+
ctx.imports.push({
|
|
215
|
+
source,
|
|
216
|
+
names: names.length > 0 ? names : [source.split('.').pop() || source],
|
|
217
|
+
line: node.startPosition.row + 1,
|
|
218
|
+
});
|
|
219
|
+
}
|
|
220
|
+
|
|
221
|
+
function handleHaskellApply(node: TreeSitterNode, ctx: ExtractorOutput): void {
|
|
222
|
+
const funcNode = node.childForFieldName('function');
|
|
223
|
+
if (!funcNode) return;
|
|
224
|
+
|
|
225
|
+
// Only record named function applications, not complex expressions
|
|
226
|
+
if (
|
|
227
|
+
funcNode.type === 'variable' ||
|
|
228
|
+
funcNode.type === 'constructor' ||
|
|
229
|
+
funcNode.type === 'identifier'
|
|
230
|
+
) {
|
|
231
|
+
ctx.calls.push({ name: funcNode.text, line: node.startPosition.row + 1 });
|
|
232
|
+
} else if (funcNode.type === 'qualified_variable' || funcNode.type === 'qualified_constructor') {
|
|
233
|
+
ctx.calls.push({ name: funcNode.text, line: node.startPosition.row + 1 });
|
|
234
|
+
}
|
|
235
|
+
}
|
package/src/extractors/index.ts
CHANGED
|
@@ -1,15 +1,32 @@
|
|
|
1
1
|
export { extractBashSymbols } from './bash.js';
|
|
2
2
|
export { extractCSymbols } from './c.js';
|
|
3
|
+
export { extractClojureSymbols } from './clojure.js';
|
|
3
4
|
export { extractCppSymbols } from './cpp.js';
|
|
4
5
|
export { extractCSharpSymbols } from './csharp.js';
|
|
6
|
+
export { extractCudaSymbols } from './cuda.js';
|
|
7
|
+
export { extractDartSymbols } from './dart.js';
|
|
8
|
+
export { extractElixirSymbols } from './elixir.js';
|
|
9
|
+
export { extractErlangSymbols } from './erlang.js';
|
|
10
|
+
export { extractFSharpSymbols } from './fsharp.js';
|
|
11
|
+
export { extractGleamSymbols } from './gleam.js';
|
|
5
12
|
export { extractGoSymbols } from './go.js';
|
|
13
|
+
export { extractGroovySymbols } from './groovy.js';
|
|
14
|
+
export { extractHaskellSymbols } from './haskell.js';
|
|
6
15
|
export { extractHCLSymbols } from './hcl.js';
|
|
7
16
|
export { extractJavaSymbols } from './java.js';
|
|
8
17
|
export { extractSymbols } from './javascript.js';
|
|
18
|
+
export { extractJuliaSymbols } from './julia.js';
|
|
9
19
|
export { extractKotlinSymbols } from './kotlin.js';
|
|
20
|
+
export { extractLuaSymbols } from './lua.js';
|
|
21
|
+
export { extractObjCSymbols } from './objc.js';
|
|
22
|
+
export { extractOCamlSymbols } from './ocaml.js';
|
|
10
23
|
export { extractPHPSymbols } from './php.js';
|
|
11
24
|
export { extractPythonSymbols } from './python.js';
|
|
25
|
+
export { extractRSymbols } from './r.js';
|
|
12
26
|
export { extractRubySymbols } from './ruby.js';
|
|
13
27
|
export { extractRustSymbols } from './rust.js';
|
|
14
28
|
export { extractScalaSymbols } from './scala.js';
|
|
29
|
+
export { extractSoliditySymbols } from './solidity.js';
|
|
15
30
|
export { extractSwiftSymbols } from './swift.js';
|
|
31
|
+
export { extractVerilogSymbols } from './verilog.js';
|
|
32
|
+
export { extractZigSymbols } from './zig.js';
|