codenexus 0.3.4

A queryable code knowledge graph tool built on LadybugDB and tree-sitter
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
// Copyright (c) 2026 Kirky.X. All rights reserved.
// SPDX-License-Identifier: MIT

//! C# language extractor (Adapter pattern, ADR-003, ADR-011).
//!
//! Adapts tree-sitter-c-sharp's syntax tree into CodeNexus nodes, edges, and
//! intermediate extraction records ([`ExtractResult`]).
//!
//! # Extracted node types
//!
//! - `class_declaration` → [`NodeLabel::Class`]
//! - `interface_declaration` → [`NodeLabel::Interface`]
//! - `struct_declaration` → [`NodeLabel::Struct`]
//! - `enum_declaration` → [`NodeLabel::Enum`]
//! - `method_declaration` → [`NodeLabel::Method`]
//! - `namespace_declaration` → [`NodeLabel::Namespace`]
//!
//! # Extracted records
//!
//! - `using_directive` → [`ImportInfo`]
//! - `invocation_expression` → [`CallInfo`]
//!
//! # Known limitations
//!
//! - FQN pattern is `project.file_path.name` (no namespace prefix); nested
//!   types are disambiguated via `dedupe_qn` only when names collide.
//! - Properties, events, constructors, and delegates are not extracted.

use tree_sitter::Node;

use crate::model::{Edge, EdgeType, Language, Node as ModelNode, NodeLabel};
use crate::resolve::FqnGenerator;

use super::dedupe_qn;
use super::error::{ParseError, Result};
use super::extractor::{CallInfo, ExtractResult, Extractor, ImportInfo};
use super::parser_factory::ParserFactory;

/// C# language tree-sitter extractor (Adapter pattern).
pub struct CSharpExtractor {
    _priv: (),
}

impl CSharpExtractor {
    /// Creates a new `CSharpExtractor`.
    #[must_use]
    pub const fn new() -> Self {
        Self { _priv: () }
    }
}

impl Default for CSharpExtractor {
    fn default() -> Self {
        Self::new()
    }
}

impl Extractor for CSharpExtractor {
    fn language(&self) -> Language {
        Language::CSharp
    }

    fn extract(&self, source: &str, file_path: &str, project: &str) -> Result<ExtractResult> {
        let mut result = ExtractResult::new(file_path, Language::CSharp);
        let mut parser = ParserFactory::create_parser(Language::CSharp)?;
        let tree = parser
            .parse(source, None)
            .ok_or_else(|| ParseError::ParseFailed {
                file_path: file_path.to_string(),
            })?;
        let root = tree.root_node();
        let ctx = VisitContext {
            file_path,
            project,
            current_func: None,
        };
        for i in 0..root.named_child_count() as u32 {
            if let Some(child) = root.named_child(i) {
                visit_node(child, source, &ctx, &mut result);
            }
        }
        Ok(result)
    }
}

// ---------------------------------------------------------------------------
// Tree-walking helpers
// ---------------------------------------------------------------------------

/// 不可变的遍历上下文,在 visit_node/visit_children 之间传递。
struct VisitContext<'a> {
    file_path: &'a str,
    project: &'a str,
    current_func: Option<&'a str>,
}

fn visit_node(node: Node, source: &str, ctx: &VisitContext<'_>, result: &mut ExtractResult) {
    match node.kind() {
        "class_declaration" => {
            extract_named_type(node, source, ctx, result, NodeLabel::Class);
            visit_children(node, source, ctx, result);
        }
        "interface_declaration" => {
            extract_named_type(node, source, ctx, result, NodeLabel::Interface);
            visit_children(node, source, ctx, result);
        }
        "struct_declaration" => {
            extract_named_type(node, source, ctx, result, NodeLabel::Struct);
            visit_children(node, source, ctx, result);
        }
        "enum_declaration" => {
            extract_named_type(node, source, ctx, result, NodeLabel::Enum);
            visit_children(node, source, ctx, result);
        }
        "namespace_declaration" => {
            extract_named_type(node, source, ctx, result, NodeLabel::Namespace);
            visit_children(node, source, ctx, result);
        }
        "method_declaration" => {
            extract_method(node, source, ctx, result);
            let name = method_name(node, source);
            let child_ctx = VisitContext {
                file_path: ctx.file_path,
                project: ctx.project,
                current_func: name.as_deref(),
            };
            visit_children(node, source, &child_ctx, result);
        }
        "using_directive" => {
            extract_import(node, source, result);
        }
        "invocation_expression" => {
            extract_call(node, source, ctx, result);
            visit_children(node, source, ctx, result);
        }
        _ => {
            visit_children(node, source, ctx, result);
        }
    }
}

fn visit_children(node: Node, source: &str, ctx: &VisitContext<'_>, result: &mut ExtractResult) {
    for i in 0..node.named_child_count() as u32 {
        if let Some(child) = node.named_child(i) {
            visit_node(child, source, ctx, result);
        }
    }
}

// ---------------------------------------------------------------------------
// Definition extractors
// ---------------------------------------------------------------------------

/// Returns true if `name` starts with an uppercase ASCII letter, following
/// C#'s PascalCase convention for public members. Used heuristically to set
/// `is_exported` on nodes so the `CallResolver` can resolve cross-file calls.
fn is_exported_name(name: &str) -> bool {
    name.chars().next().is_some_and(|c| c.is_ascii_uppercase())
}

/// Extracts a node that exposes a `name` field (class / interface / struct /
/// enum / namespace) into a typed [`ModelNode`].
fn extract_named_type(
    node: Node,
    source: &str,
    ctx: &VisitContext<'_>,
    result: &mut ExtractResult,
    label: NodeLabel,
) {
    let Some(name) = name_field(node, source) else {
        return;
    };
    let qn = dedupe_qn(
        make_qn(ctx.file_path, &name, ctx.project),
        node.start_position().row as u32 + 1,
        result,
    );
    let is_exported = is_exported_name(&name);
    let model_node = ModelNode::builder(label, name, qn)
        .file_path(ctx.file_path)
        .start_line(node.start_position().row as u32 + 1)
        .end_line(node.end_position().row as u32 + 1)
        .language(Language::CSharp)
        .project(ctx.project)
        .is_global(true)
        .is_exported(is_exported)
        .build();
    add_definition_edges(ctx.file_path, ctx.project, &model_node, result);
    result.push_node(model_node);
}

fn extract_method(node: Node, source: &str, ctx: &VisitContext<'_>, result: &mut ExtractResult) {
    let Some(name) = method_name(node, source) else {
        return;
    };
    let qn = dedupe_qn(
        make_qn(ctx.file_path, &name, ctx.project),
        node.start_position().row as u32 + 1,
        result,
    );
    let signature = node_text(node, source)
        .map(signature_first_line)
        .map(String::from);
    let is_exported = is_exported_name(&name);
    let mut builder = ModelNode::builder(NodeLabel::Method, name, qn)
        .file_path(ctx.file_path)
        .start_line(node.start_position().row as u32 + 1)
        .end_line(node.end_position().row as u32 + 1)
        .language(Language::CSharp)
        .project(ctx.project)
        .is_global(false)
        .is_exported(is_exported);
    if let Some(sig) = signature {
        builder = builder.signature(sig);
    }
    let model_node = builder.build();
    add_definition_edges(ctx.file_path, ctx.project, &model_node, result);
    result.push_node(model_node);
}

// ---------------------------------------------------------------------------
// Record extractors
// ---------------------------------------------------------------------------

fn extract_import(node: Node, source: &str, result: &mut ExtractResult) {
    // using_directive has no `name` field in tree-sitter-c-sharp; the
    // imported name is the first named child (an `identifier` for
    // `using System;` or a `qualified_name` for `using System.IO;`).
    let Some(name_node) = node.named_child(0) else {
        return;
    };
    let Some(name) = node_text(name_node, source).map(String::from) else {
        return;
    };
    result.imports.push(ImportInfo {
        source_file: name,
        imported_names: Vec::new(),
        line: node.start_position().row as u32 + 1,
    });
}

fn extract_call(node: Node, source: &str, ctx: &VisitContext<'_>, result: &mut ExtractResult) {
    let Some(func_node) = node.child_by_field_name("function") else {
        return;
    };
    let Some(callee) = callee_name(func_node, source) else {
        return;
    };
    let args = call_arguments(node, source);
    let caller_qn = ctx
        .current_func
        .map(|name| make_qn(ctx.file_path, name, ctx.project));
    result.calls.push(CallInfo {
        caller_qn,
        callee_name: callee,
        line: node.start_position().row as u32 + 1,
        args,
    });
}

// ---------------------------------------------------------------------------
// Helpers
// ---------------------------------------------------------------------------

/// Returns the text of the `name` field of `node`, if present.
fn name_field(node: Node, source: &str) -> Option<String> {
    let name_node = node.child_by_field_name("name")?;
    node_text(name_node, source).map(String::from)
}

fn method_name(node: Node, source: &str) -> Option<String> {
    name_field(node, source)
}

/// Resolves a callee node to its base identifier name.
/// Handles `identifier`, `qualified_name` (`A.B.C` -> `C`), and
/// `member_access_expression` (`obj.Method` -> `Method`).
fn callee_name(node: Node, source: &str) -> Option<String> {
    match node.kind() {
        "identifier" => node_text(node, source).map(String::from),
        "qualified_name" => {
            // Rightmost name is the rightmost child.
            let mut current = node;
            loop {
                let right = current.child_by_field_name("right");
                let left = current.child_by_field_name("left");
                match (right, left) {
                    (Some(r), _) => {
                        if r.kind() == "identifier" {
                            return node_text(r, source).map(String::from);
                        }
                        // right is another qualified_name; descend.
                        current = r;
                    }
                    _ => return None,
                }
            }
        }
        "member_access_expression" => {
            let name = node.child_by_field_name("name")?;
            node_text(name, source).map(String::from)
        }
        "invocation_expression" => {
            let func = node.child_by_field_name("function")?;
            callee_name(func, source)
        }
        "parenthesized_expression" => {
            let inner = node.named_child(0)?;
            callee_name(inner, source)
        }
        _ => None,
    }
}

fn call_arguments(node: Node, source: &str) -> Vec<String> {
    let Some(args_node) = node.child_by_field_name("arguments") else {
        return Vec::new();
    };
    let mut args = Vec::new();
    for i in 0..args_node.named_child_count() as u32 {
        if let Some(arg) = args_node.named_child(i) {
            if let Ok(text) = arg.utf8_text(source.as_bytes()) {
                args.push(text.to_string());
            }
        }
    }
    args
}

fn node_text<'a>(node: Node<'a>, source: &'a str) -> Option<&'a str> {
    node.utf8_text(source.as_bytes()).ok()
}

/// Returns the first line of a signature string (the declaration line).
fn signature_first_line(text: &str) -> &str {
    text.lines().next().unwrap_or(text)
}

fn make_qn(file_path: &str, name: &str, project: &str) -> String {
    FqnGenerator::generate(project, file_path, name, Language::CSharp, None)
}

fn add_definition_edges(
    file_path: &str,
    project: &str,
    node: &ModelNode,
    result: &mut ExtractResult,
) {
    // DEFINES edge: file -> definition (matches the Go/C extractor pattern).
    result.edges.push(Edge::new(
        file_path.to_string(),
        node.id.clone(),
        EdgeType::Defines,
        project,
    ));
}

// ---------------------------------------------------------------------------
// Tests
// ---------------------------------------------------------------------------

#[cfg(test)]
mod tests {
    use super::*;
    use crate::model::NodeLabel;

    fn extract(source: &str) -> ExtractResult {
        let ext = CSharpExtractor::new();
        ext.extract(source, "test.cs", "proj")
            .expect("extraction should succeed")
    }

    #[test]
    fn language_returns_csharp() {
        assert_eq!(CSharpExtractor::new().language(), Language::CSharp);
    }

    #[test]
    fn default_creates_extractor() {
        let ext = CSharpExtractor::default();
        assert_eq!(ext.language(), Language::CSharp);
    }

    #[test]
    fn extracts_class_declaration() {
        let result = extract("public class Foo { }\n");
        let classes: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Class)
            .collect();
        assert_eq!(
            classes.len(),
            1,
            "should extract 1 class: {:?}",
            result.nodes
        );
        assert_eq!(classes[0].name, "Foo");
        assert_eq!(classes[0].language, Some(Language::CSharp));
        assert_eq!(classes[0].project, "proj");
        assert_eq!(classes[0].file_path.as_deref(), Some("test.cs"));
        assert!(classes[0].is_global, "top-level class should be global");
        assert!(
            classes[0].is_exported,
            "PascalCase class should be exported"
        );
    }

    #[test]
    fn extracts_interface_declaration() {
        let result = extract("public interface IReader { void Read(); }\n");
        let ifaces: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Interface)
            .collect();
        assert_eq!(
            ifaces.len(),
            1,
            "should extract 1 interface: {:?}",
            result.nodes
        );
        assert_eq!(ifaces[0].name, "IReader");
    }

    #[test]
    fn extracts_struct_declaration() {
        let result = extract("public struct Point { public int X; public int Y; }\n");
        let structs: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Struct)
            .collect();
        assert_eq!(
            structs.len(),
            1,
            "should extract 1 struct: {:?}",
            result.nodes
        );
        assert_eq!(structs[0].name, "Point");
    }

    #[test]
    fn extracts_enum_declaration() {
        let result = extract("public enum Color { Red, Green, Blue }\n");
        let enums: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Enum)
            .collect();
        assert_eq!(enums.len(), 1, "should extract 1 enum: {:?}", result.nodes);
        assert_eq!(enums[0].name, "Color");
    }

    #[test]
    fn extracts_method_declaration() {
        let result = extract("public class Foo { public void Bar() { } }\n");
        let methods: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Method)
            .collect();
        assert_eq!(
            methods.len(),
            1,
            "should extract 1 method: {:?}",
            result.nodes
        );
        assert_eq!(methods[0].name, "Bar");
        assert!(!methods[0].is_global, "method should not be global");
        assert!(
            methods[0].is_exported,
            "PascalCase method should be exported"
        );
    }

    #[test]
    fn extracts_namespace_declaration() {
        let result = extract("namespace MyApp { class Foo { } }\n");
        let namespaces: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Namespace)
            .collect();
        assert_eq!(
            namespaces.len(),
            1,
            "should extract 1 namespace: {:?}",
            result.nodes
        );
        assert_eq!(namespaces[0].name, "MyApp");
    }

    #[test]
    fn extracts_using_directive_simple() {
        let result = extract("using System;\n");
        assert_eq!(result.imports.len(), 1, "should extract 1 import");
        assert_eq!(result.imports[0].source_file, "System");
        assert_eq!(result.imports[0].line, 1);
    }

    #[test]
    fn extracts_using_directive_qualified() {
        let result = extract("using System.IO;\n");
        assert_eq!(result.imports.len(), 1);
        assert_eq!(result.imports[0].source_file, "System.IO");
    }

    #[test]
    fn extracts_multiple_using_directives() {
        let result =
            extract("using System;\nusing System.IO;\nusing System.Collections.Generic;\n");
        assert_eq!(
            result.imports.len(),
            3,
            "should extract 3 imports: {:?}",
            result.imports
        );
        let paths: Vec<_> = result
            .imports
            .iter()
            .map(|i| i.source_file.as_str())
            .collect();
        assert!(paths.contains(&"System"));
        assert!(paths.contains(&"System.IO"));
        assert!(paths.contains(&"System.Collections.Generic"));
    }

    #[test]
    fn extracts_invocation_expression() {
        let src = "class Foo { void Bar() { Baz(); } }\n";
        let result = extract(src);
        let callees: Vec<_> = result
            .calls
            .iter()
            .map(|c| c.callee_name.as_str())
            .collect();
        assert!(
            callees.contains(&"Baz"),
            "should extract call to Baz: {:?}",
            callees
        );
    }

    #[test]
    fn extracts_qualified_invocation() {
        // `Console.WriteLine()` -> callee is `WriteLine`.
        let src = "using System; class Foo { void Bar() { Console.WriteLine(); } }\n";
        let result = extract(src);
        let callees: Vec<_> = result
            .calls
            .iter()
            .map(|c| c.callee_name.as_str())
            .collect();
        assert!(
            callees.contains(&"WriteLine"),
            "should extract member call to WriteLine: {:?}",
            callees
        );
    }

    #[test]
    fn call_has_line_and_args() {
        let src = "class Foo { void Bar() { Baz(1, 2); } }\n";
        let result = extract(src);
        let call = result
            .calls
            .iter()
            .find(|c| c.callee_name == "Baz")
            .expect("should find call to Baz");
        assert_eq!(call.args.len(), 2, "Baz(1, 2) should have 2 args");
        assert!(call.line >= 1);
    }

    #[test]
    fn call_in_method_has_dotted_fqn_caller_qn() {
        let src = "class Foo { void Caller() { Callee(); } }\n";
        let ext = CSharpExtractor::new();
        let result = ext
            .extract(src, "/tmp/demo/test.cs", "proj")
            .expect("extraction should succeed");
        let call = result
            .calls
            .iter()
            .find(|c| c.callee_name == "Callee")
            .expect("should find call to Callee");
        assert_eq!(
            call.caller_qn.as_deref(),
            Some("proj.tmp.demo.test.cs.Caller"),
            "caller_qn should be the dotted FQN of the enclosing method"
        );
        let caller_node = result
            .nodes
            .iter()
            .find(|n| n.name == "Caller")
            .expect("should find Caller method node");
        assert_eq!(
            call.caller_qn.as_deref(),
            Some(caller_node.qualified_name.as_str()),
            "caller_qn must match the caller method node id"
        );
    }

    #[test]
    fn top_level_call_has_none_caller_qn() {
        // C# requires a class/method body, so a top-level call is not valid.
        // Verify that an empty source produces no calls.
        let result = extract("");
        assert!(result.calls.is_empty());
    }

    #[test]
    fn empty_source_returns_empty_result() {
        let result = extract("");
        assert!(result.is_empty());
    }

    #[test]
    fn result_language_is_csharp() {
        let result = extract("class Foo { }\n");
        assert_eq!(result.language, Language::CSharp);
        assert_eq!(result.file_path, "test.cs");
    }

    #[test]
    fn creates_defines_edges() {
        let result = extract("class Foo { }\n");
        let defines_count = result
            .edges
            .iter()
            .filter(|e| e.edge_type == EdgeType::Defines)
            .count();
        let node_count = result.nodes.len();
        assert_eq!(defines_count, node_count, "one DEFINES edge per node");
    }

    #[test]
    fn qualified_name_uses_file_path_and_name() {
        let result = extract("class Foo { }\n");
        let foo = result.nodes.iter().find(|n| n.name == "Foo").unwrap();
        assert_eq!(foo.qualified_name, "proj.test.cs.Foo");
    }

    #[test]
    fn method_has_signature() {
        let src = "class Foo { public int Add(int a, int b) { return a + b; } }\n";
        let result = extract(src);
        let add = result.nodes.iter().find(|n| n.name == "Add").unwrap();
        assert!(add.signature.is_some(), "method should have a signature");
        let sig = add.signature.as_deref().unwrap();
        assert!(sig.contains("Add"), "signature should contain name: {sig}");
    }

    #[test]
    fn nested_classes_extracted() {
        let src = "class Outer { class Inner { } }\n";
        let result = extract(src);
        let classes: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Class)
            .collect();
        assert_eq!(classes.len(), 2, "should extract outer and inner class");
        let names: Vec<_> = classes.iter().map(|n| n.name.as_str()).collect();
        assert!(names.contains(&"Outer"));
        assert!(names.contains(&"Inner"));
    }

    #[test]
    fn generic_class_declaration() {
        let src = "public class List<T> { }\n";
        let result = extract(src);
        let classes: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Class)
            .collect();
        assert_eq!(classes.len(), 1);
        assert_eq!(classes[0].name, "List");
    }

    #[test]
    fn generic_method_declaration() {
        let src = "public class Foo { public T Get<T>() { return default(T); } }\n";
        let result = extract(src);
        let methods: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Method)
            .collect();
        assert_eq!(methods.len(), 1);
        assert_eq!(methods[0].name, "Get");
    }

    #[test]
    fn property_declaration_does_not_break_extraction() {
        let src = "public class Foo { public int Bar { get; set; } }\n";
        let result = extract(src);
        let classes: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Class)
            .collect();
        assert_eq!(
            classes.len(),
            1,
            "class should still be extracted with property"
        );
        assert_eq!(classes[0].name, "Foo");
    }

    #[test]
    fn event_declaration_does_not_break_extraction() {
        let src = "public class Foo { public event EventHandler Click; }\n";
        let result = extract(src);
        let classes: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Class)
            .collect();
        assert_eq!(
            classes.len(),
            1,
            "class should still be extracted with event"
        );
    }

    #[test]
    fn nested_namespace_extracted() {
        let src = "namespace Outer { namespace Inner { class Foo { } } }\n";
        let result = extract(src);
        let namespaces: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Namespace)
            .collect();
        assert_eq!(namespaces.len(), 2, "should extract both namespaces");
        let names: Vec<_> = namespaces.iter().map(|n| n.name.as_str()).collect();
        assert!(names.contains(&"Outer"));
        assert!(names.contains(&"Inner"));
    }

    #[test]
    fn class_with_constructor_does_not_break_extraction() {
        let src = "public class Foo { public Foo() { } }\n";
        let result = extract(src);
        let classes: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Class)
            .collect();
        assert_eq!(classes.len(), 1);
        assert_eq!(classes[0].name, "Foo");
    }

    #[test]
    fn comment_only_source_returns_empty_result() {
        let result = extract("// just a comment\n");
        assert!(
            result.is_empty(),
            "comment-only file should produce no nodes"
        );
    }

    #[test]
    fn multiple_namespaces_extracted() {
        let src = "namespace A { } namespace B { }\n";
        let result = extract(src);
        let namespaces: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Namespace)
            .collect();
        assert_eq!(namespaces.len(), 2);
    }

    #[test]
    fn interface_with_methods_extracted() {
        let src = "public interface IReader { void Read(); void Write(); }\n";
        let result = extract(src);
        let ifaces: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Interface)
            .collect();
        assert_eq!(ifaces.len(), 1);
        assert_eq!(ifaces[0].name, "IReader");
        let methods: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Method)
            .collect();
        assert_eq!(methods.len(), 2, "should extract 2 interface methods");
    }

    #[test]
    fn enum_with_values_extracted() {
        let src = "public enum HttpStatus { Ok = 200, NotFound = 404, Error = 500 }\n";
        let result = extract(src);
        let enums: Vec<_> = result
            .nodes
            .iter()
            .filter(|n| n.label == NodeLabel::Enum)
            .collect();
        assert_eq!(enums.len(), 1);
        assert_eq!(enums[0].name, "HttpStatus");
    }

    #[test]
    fn method_call_with_arguments() {
        let src = "class Foo { void Bar() { Calc(1, 2, 3); } }\n";
        let result = extract(src);
        let call = result
            .calls
            .iter()
            .find(|c| c.callee_name == "Calc")
            .expect("should find call to Calc");
        assert_eq!(call.args.len(), 3, "Calc(1, 2, 3) should have 3 args");
    }

    #[test]
    fn lowercase_class_not_marked_exported() {
        let src = "class foo { }\n";
        let result = extract(src);
        let c = result
            .nodes
            .iter()
            .find(|n| n.name == "foo")
            .expect("should extract class foo");
        assert!(
            !c.is_exported,
            "lowercase class name should not be exported"
        );
    }

    // --- parse helper and tree walker for direct function tests ---

    fn parse_source(source: &str) -> tree_sitter::Tree {
        let mut parser =
            crate::parse::parser_factory::ParserFactory::create_parser(Language::CSharp)
                .expect("parser");
        parser.parse(source, None).expect("parse")
    }

    fn find_first_by_kind<'a>(
        node: tree_sitter::Node<'a>,
        kind: &str,
    ) -> Option<tree_sitter::Node<'a>> {
        if node.kind() == kind {
            return Some(node);
        }
        for i in 0..node.named_child_count() as u32 {
            if let Some(child) = node.named_child(i) {
                if let Some(found) = find_first_by_kind(child, kind) {
                    return Some(found);
                }
            }
        }
        None
    }

    // --- callee_name: qualified_name branch (lines 285-297) ---

    #[test]
    fn callee_name_on_qualified_name_returns_rightmost() {
        // `using System.IO;` produces a qualified_name node.
        // callee_name should walk the right field chain and return the
        // rightmost identifier. The exact value depends on grammar fields.
        let src = "using System.IO;\n";
        let tree = parse_source(src);
        let root = tree.root_node();
        let qn = find_first_by_kind(root, "qualified_name").expect("should find qualified_name");
        let name = callee_name(qn, src);
        // If the grammar has right/left fields, returns the rightmost
        // identifier. If right is an identifier, it should be "IO".
        if let Some(ref n) = name {
            assert!(
                n == "IO" || n == "System",
                "callee_name on qualified_name should return part of System.IO: {n}"
            );
        }
        // If None, the grammar may not use right/left fields — still
        // exercises the qualified_name branch.
    }

    // --- callee_name: invocation_expression branch (lines 305-307) ---

    #[test]
    fn callee_name_on_invocation_expression_recurses() {
        // `Foo()()` — the inner invocation_expression is the function
        // of the outer one. callee_name on the inner invocation_expression
        // recurses into its function (identifier "Foo").
        let src = "class C { void M() { Foo()(); } }\n";
        let tree = parse_source(src);
        let root = tree.root_node();
        // Find the outer invocation_expression (whose function is another invocation)
        fn find_chained_call<'a>(node: tree_sitter::Node<'a>) -> Option<tree_sitter::Node<'a>> {
            if node.kind() == "invocation_expression" {
                if let Some(func) = node.child_by_field_name("function") {
                    if func.kind() == "invocation_expression" {
                        return Some(func);
                    }
                }
            }
            for i in 0..node.named_child_count() as u32 {
                if let Some(child) = node.named_child(i) {
                    if let Some(found) = find_chained_call(child) {
                        return Some(found);
                    }
                }
            }
            None
        }
        if let Some(inner_invocation) = find_chained_call(root) {
            let name = callee_name(inner_invocation, src);
            assert_eq!(
                name,
                Some("Foo".to_string()),
                "callee_name on invocation_expression should recurse to Foo"
            );
        }
    }

    // --- callee_name: parenthesized_expression branch (lines 309-311) ---

    #[test]
    fn callee_name_on_parenthesized_expression_recurses() {
        // `(Foo)()` — the function is a parenthesized_expression.
        // callee_name gets the inner child and recurses.
        let src = "class C { void M() { (Foo)(); } }\n";
        let tree = parse_source(src);
        let root = tree.root_node();
        // Find the invocation_expression whose function is parenthesized
        fn find_paren_call<'a>(node: tree_sitter::Node<'a>) -> Option<tree_sitter::Node<'a>> {
            if node.kind() == "invocation_expression" {
                if let Some(func) = node.child_by_field_name("function") {
                    if func.kind() == "parenthesized_expression" {
                        return Some(func);
                    }
                }
            }
            for i in 0..node.named_child_count() as u32 {
                if let Some(child) = node.named_child(i) {
                    if let Some(found) = find_paren_call(child) {
                        return Some(found);
                    }
                }
            }
            None
        }
        if let Some(paren_expr) = find_paren_call(root) {
            let name = callee_name(paren_expr, src);
            assert_eq!(
                name,
                Some("Foo".to_string()),
                "callee_name on parenthesized_expression should recurse to Foo"
            );
        }
    }

    // --- callee_name: _ => None fallback (line 313) ---

    #[test]
    fn callee_name_returns_none_for_unknown_kind() {
        // Call callee_name on a node kind not in the match arms.
        let src = "class Foo { }\n";
        let tree = parse_source(src);
        let root = tree.root_node();
        let class_decl =
            find_first_by_kind(root, "class_declaration").expect("should find class_declaration");
        assert!(
            callee_name(class_decl, src).is_none(),
            "callee_name on class_declaration should return None"
        );
    }

    // --- call_arguments: no arguments field (line 319) ---

    #[test]
    fn call_arguments_returns_empty_when_no_arguments_field() {
        // Call call_arguments on a node without an "arguments" field.
        let src = "class Foo { }\n";
        let tree = parse_source(src);
        let root = tree.root_node();
        let class_decl =
            find_first_by_kind(root, "class_declaration").expect("should find class_declaration");
        let args = call_arguments(class_decl, src);
        assert!(
            args.is_empty(),
            "call_arguments on class_declaration should return empty"
        );
    }
}