codanna 0.9.19

Code Intelligence for Large Language Models
Documentation
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
//! Clojure language parser implementation
//!
//! This parser provides Clojure language support for the codebase intelligence system.
//! It extracts symbols, relationships, and documentation from Clojure source code using
//! tree-sitter for AST parsing.
//!
//! ## Supported Forms
//!
//! | Form | SymbolKind |
//! |------|------------|
//! | defn/defn- | Function |
//! | def | Variable |
//! | defmacro | Macro |
//! | defprotocol | Interface |
//! | defrecord/deftype | Struct |
//! | defmulti | Function |
//! | defmethod | Method |
//! | ns | Module |

use crate::parsing::parser::check_recursion_depth;
use crate::parsing::{
    HandledNode, Import, Language, LanguageParser, NodeTracker, NodeTrackingState, ParserContext,
};
use crate::types::SymbolCounter;
use crate::{FileId, Range, Symbol, SymbolKind, Visibility};
use std::any::Any;
use std::collections::HashSet;
use thiserror::Error;
use tree_sitter::{Node, Parser, Tree};

/// Clojure-specific parsing errors
#[derive(Error, Debug)]
pub enum ClojureParseError {
    #[error(
        "Failed to initialize Clojure parser: {reason}\nSuggestion: Ensure tree-sitter-clojure is properly installed"
    )]
    ParserInitFailed { reason: String },

    #[error("Failed to parse code")]
    ParseFailure,
}

/// Clojure language parser
pub struct ClojureParser {
    parser: Parser,
    tree: Option<Tree>,
    context: ParserContext,
    node_tracking: NodeTrackingState,
    /// Current namespace being parsed (Clojure-specific)
    current_namespace: Option<String>,
}

impl std::fmt::Debug for ClojureParser {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        f.debug_struct("ClojureParser")
            .field("language", &"Clojure")
            .finish()
    }
}

impl ClojureParser {
    /// Create a new Clojure parser instance
    pub fn new() -> Result<Self, ClojureParseError> {
        let mut parser = Parser::new();
        parser
            .set_language(&tree_sitter_clojure_orchard::LANGUAGE.into())
            .map_err(|e| ClojureParseError::ParserInitFailed {
                reason: format!("tree-sitter error: {e}"),
            })?;

        Ok(Self {
            parser,
            tree: None,
            context: ParserContext::new(),
            node_tracking: NodeTrackingState::new(),
            current_namespace: None,
        })
    }

    /// Convert a tree-sitter Node to a Range
    fn range_from_node(node: &Node) -> Range {
        Range::new(
            node.start_position().row as u32,
            node.start_position().column as u16,
            node.end_position().row as u32,
            node.end_position().column as u16,
        )
    }

    /// Extract symbols from AST node recursively
    fn extract_symbols_from_node(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
        depth: usize,
    ) {
        if !check_recursion_depth(depth, node) {
            return;
        }

        self.register_handled_node(node.kind(), node.kind_id());

        if node.kind() == "list_lit" {
            // Check if this is a definition form
            if let Some(first_child) = node.named_child(0) {
                if first_child.kind() == "sym_lit" {
                    let form_name = &code[first_child.byte_range()];
                    match form_name {
                        "defn" | "defn-" => {
                            self.process_defn(
                                node,
                                code,
                                file_id,
                                symbols,
                                counter,
                                form_name == "defn-",
                            );
                        }
                        "def" => {
                            self.process_def(node, code, file_id, symbols, counter);
                        }
                        "defmacro" => {
                            self.process_defmacro(node, code, file_id, symbols, counter);
                        }
                        "defprotocol" => {
                            self.process_defprotocol(node, code, file_id, symbols, counter);
                        }
                        "defrecord" | "deftype" => {
                            self.process_defrecord(node, code, file_id, symbols, counter);
                        }
                        "defmulti" => {
                            self.process_defmulti(node, code, file_id, symbols, counter);
                        }
                        "defmethod" => {
                            self.process_defmethod(node, code, file_id, symbols, counter);
                        }
                        "ns" => {
                            self.process_ns(node, code, file_id, symbols, counter);
                        }
                        _ => {}
                    }
                }
            }
        }

        // Recurse into children
        let mut cursor = node.walk();
        for child in node.named_children(&mut cursor) {
            self.extract_symbols_from_node(child, code, file_id, symbols, counter, depth + 1);
        }
    }

    /// Process (defn name [params] body) or (defn- name [params] body)
    fn process_defn(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
        is_private: bool,
    ) {
        // Structure: (defn name docstring? attr-map? [params] body*)
        // Child 0: defn symbol
        // Child 1: function name
        // Child 2+: docstring, metadata, params, body

        let mut name_node = None;
        let mut doc_string = None;
        let mut params_node = None;

        let mut cursor = node.walk();
        let children: Vec<_> = node.named_children(&mut cursor).collect();

        for (idx, child) in children.iter().enumerate() {
            match child.kind() {
                "sym_lit" if idx == 1 => {
                    name_node = Some(*child);
                }
                "str_lit" if name_node.is_some() && doc_string.is_none() => {
                    // Docstring comes after name
                    let raw = &code[child.byte_range()];
                    doc_string = Some(raw.trim_matches('"').to_string());
                }
                "vec_lit" if params_node.is_none() => {
                    params_node = Some(*child);
                }
                _ => {}
            }
        }

        if let Some(name) = name_node {
            let fn_name = &code[name.byte_range()];
            let visibility = if is_private || fn_name.starts_with('-') {
                Visibility::Private
            } else {
                Visibility::Public
            };

            // Build signature
            let signature = if let Some(params) = params_node {
                let params_str = &code[params.byte_range()];
                format!("(defn {fn_name} {params_str} ...)")
            } else {
                format!("(defn {fn_name} ...)")
            };

            let mut symbol = Symbol::new(
                counter.next_id(),
                fn_name.to_string(),
                SymbolKind::Function,
                file_id,
                Self::range_from_node(&node),
            );
            symbol.signature = Some(signature.into());
            symbol.doc_comment = doc_string.map(|s| s.into());
            symbol.module_path = self.current_namespace.as_ref().map(|s| s.clone().into());
            symbol.visibility = visibility;

            symbols.push(symbol);
        }
    }

    /// Process (def name value) or (def name "doc" value)
    fn process_def(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
    ) {
        let mut cursor = node.walk();
        let children: Vec<_> = node.named_children(&mut cursor).collect();

        if children.len() < 2 {
            return;
        }

        let name_node = children.get(1);

        if let Some(name_node) = name_node {
            if name_node.kind() == "sym_lit" {
                let var_name = &code[name_node.byte_range()];
                let visibility = if var_name.starts_with('-') {
                    Visibility::Private
                } else {
                    Visibility::Public
                };

                // Check for docstring
                let doc_string = children.get(2).and_then(|c| {
                    if c.kind() == "str_lit" {
                        Some(code[c.byte_range()].trim_matches('"').to_string())
                    } else {
                        None
                    }
                });

                let signature = format!("(def {var_name} ...)");

                let mut symbol = Symbol::new(
                    counter.next_id(),
                    var_name.to_string(),
                    SymbolKind::Variable,
                    file_id,
                    Self::range_from_node(&node),
                );
                symbol.signature = Some(signature.into());
                symbol.doc_comment = doc_string.map(|s| s.into());
                symbol.module_path = self.current_namespace.as_ref().map(|s| s.clone().into());
                symbol.visibility = visibility;

                symbols.push(symbol);
            }
        }
    }

    /// Process (defmacro name [params] body)
    fn process_defmacro(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
    ) {
        let mut cursor = node.walk();
        let children: Vec<_> = node.named_children(&mut cursor).collect();

        if let Some(name_node) = children.get(1) {
            if name_node.kind() == "sym_lit" {
                let macro_name = &code[name_node.byte_range()];

                let mut symbol = Symbol::new(
                    counter.next_id(),
                    macro_name.to_string(),
                    SymbolKind::Macro,
                    file_id,
                    Self::range_from_node(&node),
                );
                symbol.signature = Some(format!("(defmacro {macro_name} ...)").into());
                symbol.module_path = self.current_namespace.as_ref().map(|s| s.clone().into());
                symbol.visibility = Visibility::Public;

                symbols.push(symbol);
            }
        }
    }

    /// Process (defprotocol Name (method [args]) ...)
    fn process_defprotocol(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
    ) {
        let mut cursor = node.walk();
        let children: Vec<_> = node.named_children(&mut cursor).collect();

        if let Some(name_node) = children.get(1) {
            if name_node.kind() == "sym_lit" {
                let protocol_name = &code[name_node.byte_range()];

                let mut symbol = Symbol::new(
                    counter.next_id(),
                    protocol_name.to_string(),
                    SymbolKind::Interface,
                    file_id,
                    Self::range_from_node(&node),
                );
                symbol.signature = Some(format!("(defprotocol {protocol_name} ...)").into());
                symbol.module_path = self.current_namespace.as_ref().map(|s| s.clone().into());
                symbol.visibility = Visibility::Public;

                symbols.push(symbol);
            }
        }
    }

    /// Process (defrecord Name [fields]) or (deftype Name [fields])
    fn process_defrecord(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
    ) {
        let mut cursor = node.walk();
        let children: Vec<_> = node.named_children(&mut cursor).collect();

        if let Some(name_node) = children.get(1) {
            if name_node.kind() == "sym_lit" {
                let record_name = &code[name_node.byte_range()];

                let signature = code[node.byte_range()]
                    .lines()
                    .next()
                    .unwrap_or("")
                    .to_string();

                let mut symbol = Symbol::new(
                    counter.next_id(),
                    record_name.to_string(),
                    SymbolKind::Struct,
                    file_id,
                    Self::range_from_node(&node),
                );
                symbol.signature = Some(signature.into());
                symbol.module_path = self.current_namespace.as_ref().map(|s| s.clone().into());
                symbol.visibility = Visibility::Public;

                symbols.push(symbol);
            }
        }
    }

    /// Process (defmulti name dispatch-fn)
    fn process_defmulti(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
    ) {
        let mut cursor = node.walk();
        let children: Vec<_> = node.named_children(&mut cursor).collect();

        if let Some(name_node) = children.get(1) {
            if name_node.kind() == "sym_lit" {
                let multi_name = &code[name_node.byte_range()];

                let mut symbol = Symbol::new(
                    counter.next_id(),
                    multi_name.to_string(),
                    SymbolKind::Function,
                    file_id,
                    Self::range_from_node(&node),
                );
                symbol.signature = Some(format!("(defmulti {multi_name} ...)").into());
                symbol.module_path = self.current_namespace.as_ref().map(|s| s.clone().into());
                symbol.visibility = Visibility::Public;

                symbols.push(symbol);
            }
        }
    }

    /// Process (defmethod multi-name dispatch-val [params] body)
    fn process_defmethod(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
    ) {
        let mut cursor = node.walk();
        let children: Vec<_> = node.named_children(&mut cursor).collect();

        // Child 0: defmethod
        // Child 1: multimethod name
        // Child 2: dispatch value
        if children.len() >= 3 {
            let name_node = &children[1];
            let dispatch_node = &children[2];

            if name_node.kind() == "sym_lit" {
                let multi_name = &code[name_node.byte_range()];
                let dispatch_val = &code[dispatch_node.byte_range()];
                let method_name = format!("{multi_name} {dispatch_val}");

                let mut symbol = Symbol::new(
                    counter.next_id(),
                    method_name,
                    SymbolKind::Method,
                    file_id,
                    Self::range_from_node(&node),
                );
                symbol.signature =
                    Some(format!("(defmethod {multi_name} {dispatch_val} ...)").into());
                symbol.module_path = self.current_namespace.as_ref().map(|s| s.clone().into());
                symbol.visibility = Visibility::Public;

                symbols.push(symbol);
            }
        }
    }

    /// Process (ns namespace.name (:require ...) (:import ...))
    fn process_ns(
        &mut self,
        node: Node,
        code: &str,
        file_id: FileId,
        symbols: &mut Vec<Symbol>,
        counter: &mut SymbolCounter,
    ) {
        let mut cursor = node.walk();
        let children: Vec<_> = node.named_children(&mut cursor).collect();

        if let Some(name_node) = children.get(1) {
            if name_node.kind() == "sym_lit" {
                let ns_name = &code[name_node.byte_range()];
                self.current_namespace = Some(ns_name.to_string());

                let mut symbol = Symbol::new(
                    counter.next_id(),
                    ns_name.to_string(),
                    SymbolKind::Module,
                    file_id,
                    Self::range_from_node(&node),
                );
                symbol.signature = Some(format!("(ns {ns_name} ...)").into());
                symbol.visibility = Visibility::Public;

                symbols.push(symbol);
            }
        }
    }

    /// Extract function calls from code
    fn extract_calls<'a>(&mut self, code: &'a str) -> Vec<(&'a str, &'a str, Range)> {
        let mut calls = Vec::new();

        if let Some(tree) = &self.tree {
            self.extract_calls_from_node(tree.root_node(), code, &mut calls);
        }

        calls
    }

    fn extract_calls_from_node<'a>(
        &self,
        node: Node,
        code: &'a str,
        calls: &mut Vec<(&'a str, &'a str, Range)>,
    ) {
        if node.kind() == "list_lit" {
            // First child of a list is typically the function being called
            if let Some(first) = node.named_child(0) {
                if first.kind() == "sym_lit" {
                    let callee = &code[first.byte_range()];
                    // Skip special forms
                    if !matches!(
                        callee,
                        "defn"
                            | "defn-"
                            | "def"
                            | "defmacro"
                            | "defprotocol"
                            | "defrecord"
                            | "deftype"
                            | "defmulti"
                            | "defmethod"
                            | "ns"
                            | "if"
                            | "let"
                            | "do"
                            | "fn"
                            | "loop"
                            | "recur"
                            | "try"
                            | "catch"
                            | "finally"
                            | "throw"
                            | "quote"
                            | "require"
                            | "import"
                            | "use"
                    ) {
                        // Get caller from context (current function)
                        let caller = "<module>"; // Placeholder - real impl tracks context
                        calls.push((caller, callee, Self::range_from_node(&node)));
                    }
                }
            }
        }

        // Recurse
        let mut cursor = node.walk();
        for child in node.named_children(&mut cursor) {
            self.extract_calls_from_node(child, code, calls);
        }
    }

    /// Extract require/use/import statements
    fn extract_imports(&mut self, code: &str, file_id: FileId) -> Vec<Import> {
        let mut imports = Vec::new();

        if let Some(tree) = &self.tree {
            self.extract_imports_from_node(tree.root_node(), code, file_id, &mut imports);
        }

        imports
    }

    fn extract_imports_from_node(
        &self,
        node: Node,
        code: &str,
        file_id: FileId,
        imports: &mut Vec<Import>,
    ) {
        if node.kind() == "list_lit" {
            if let Some(first) = node.named_child(0) {
                if first.kind() == "kwd_lit" || first.kind() == "sym_lit" {
                    let form = &code[first.byte_range()];
                    if form == ":require" || form == "require" {
                        // Parse require clauses
                        let mut cursor = node.walk();
                        for child in node.named_children(&mut cursor).skip(1) {
                            self.parse_require_clause(child, code, file_id, imports);
                        }
                    }
                }
            }
        }

        let mut cursor = node.walk();
        for child in node.named_children(&mut cursor) {
            self.extract_imports_from_node(child, code, file_id, imports);
        }
    }

    fn parse_require_clause(
        &self,
        node: Node,
        code: &str,
        file_id: FileId,
        imports: &mut Vec<Import>,
    ) {
        match node.kind() {
            "sym_lit" => {
                // Simple require: clojure.string
                let ns = &code[node.byte_range()];
                imports.push(Import {
                    path: ns.to_string(),
                    alias: None,
                    file_id,
                    is_glob: false,
                    is_type_only: false,
                });
            }
            "vec_lit" => {
                // Vector form: [clojure.string :as str] or [clojure.string :refer [join]]
                let mut ns_name = None;
                let mut alias = None;
                let mut is_refer_all = false;

                let mut cursor = node.walk();
                let children: Vec<_> = node.named_children(&mut cursor).collect();

                let mut i = 0;
                while i < children.len() {
                    let child = &children[i];
                    let text = &code[child.byte_range()];

                    match text {
                        ":as" => {
                            if let Some(alias_node) = children.get(i + 1) {
                                alias = Some(code[alias_node.byte_range()].to_string());
                            }
                            i += 1;
                        }
                        ":refer" => {
                            if let Some(refer_node) = children.get(i + 1) {
                                if &code[refer_node.byte_range()] == ":all" {
                                    is_refer_all = true;
                                }
                            }
                            i += 1;
                        }
                        _ if child.kind() == "sym_lit" && ns_name.is_none() => {
                            ns_name = Some(text.to_string());
                        }
                        _ => {}
                    }
                    i += 1;
                }

                if let Some(ns) = ns_name {
                    imports.push(Import {
                        path: ns,
                        alias,
                        file_id,
                        is_glob: is_refer_all,
                        is_type_only: false,
                    });
                }
            }
            _ => {}
        }
    }
}

impl LanguageParser for ClojureParser {
    fn parse(
        &mut self,
        code: &str,
        file_id: FileId,
        symbol_counter: &mut SymbolCounter,
    ) -> Vec<Symbol> {
        self.context = ParserContext::new();
        self.current_namespace = None;

        let tree = self.parser.parse(code, None);
        self.tree = tree.clone();

        let mut symbols = Vec::new();

        if let Some(tree) = tree {
            self.extract_symbols_from_node(
                tree.root_node(),
                code,
                file_id,
                &mut symbols,
                symbol_counter,
                0,
            );
        }

        symbols
    }

    fn as_any(&self) -> &dyn Any {
        self
    }

    fn extract_doc_comment(&self, node: &Node, code: &str) -> Option<String> {
        // In Clojure, docstrings are inside the form, not before
        // Check for comment nodes above
        if let Some(prev) = node.prev_sibling() {
            if prev.kind() == "comment" {
                let comment = &code[prev.byte_range()];
                return Some(comment.trim_start_matches(';').trim().to_string());
            }
        }
        None
    }

    fn find_calls<'a>(&mut self, code: &'a str) -> Vec<(&'a str, &'a str, Range)> {
        self.tree = self.parser.parse(code, None);
        self.extract_calls(code)
    }

    fn find_implementations<'a>(&mut self, _code: &'a str) -> Vec<(&'a str, &'a str, Range)> {
        // Clojure protocols can have implementations via extend-type, extend-protocol
        // This would require more complex parsing
        Vec::new()
    }

    fn find_uses<'a>(&mut self, _code: &'a str) -> Vec<(&'a str, &'a str, Range)> {
        Vec::new()
    }

    fn find_defines<'a>(&mut self, _code: &'a str) -> Vec<(&'a str, &'a str, Range)> {
        Vec::new()
    }

    fn find_imports(&mut self, code: &str, file_id: FileId) -> Vec<Import> {
        self.tree = self.parser.parse(code, None);
        self.extract_imports(code, file_id)
    }

    fn language(&self) -> Language {
        Language::Clojure
    }
}

impl NodeTracker for ClojureParser {
    fn get_handled_nodes(&self) -> &HashSet<HandledNode> {
        self.node_tracking.get_handled_nodes()
    }

    fn register_handled_node(&mut self, node_kind: &str, node_id: u16) {
        self.node_tracking.register_handled_node(node_kind, node_id);
    }
}

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

    #[test]
    fn test_parser_creation() {
        let parser = ClojureParser::new();
        assert!(parser.is_ok());
    }

    #[test]
    fn test_parse_defn() {
        let mut parser = ClojureParser::new().unwrap();
        let code = r#"
(defn greet
  "Greets a person by name"
  [name]
  (str "Hello, " name "!"))
"#;

        let file_id = FileId::new(1).unwrap();
        let mut counter = SymbolCounter::new();
        let symbols = parser.parse(code, file_id, &mut counter);

        assert!(!symbols.is_empty());
        let func = symbols.iter().find(|s| s.name.as_ref() == "greet");
        assert!(func.is_some());
        let func = func.unwrap();
        assert_eq!(func.kind, SymbolKind::Function);
        assert_eq!(func.visibility, Visibility::Public);
    }

    #[test]
    fn test_parse_defn_private() {
        let mut parser = ClojureParser::new().unwrap();
        let code = r#"
(defn- helper-fn [x] (* x 2))
"#;

        let file_id = FileId::new(1).unwrap();
        let mut counter = SymbolCounter::new();
        let symbols = parser.parse(code, file_id, &mut counter);

        let func = symbols.iter().find(|s| s.name.as_ref() == "helper-fn");
        assert!(func.is_some());
        let func = func.unwrap();
        assert_eq!(func.kind, SymbolKind::Function);
        assert_eq!(func.visibility, Visibility::Private);
    }

    #[test]
    fn test_parse_def() {
        let mut parser = ClojureParser::new().unwrap();
        let code = r#"
(def my-var 42)
(def pi 3.14159)
"#;

        let file_id = FileId::new(1).unwrap();
        let mut counter = SymbolCounter::new();
        let symbols = parser.parse(code, file_id, &mut counter);

        assert!(symbols.iter().any(|s| s.name.as_ref() == "my-var"));
        assert!(symbols.iter().any(|s| s.name.as_ref() == "pi"));
    }

    #[test]
    fn test_parse_defmacro() {
        let mut parser = ClojureParser::new().unwrap();
        let code = r#"
(defmacro when-let+
  [bindings & body]
  `(when-let ~bindings ~@body))
"#;

        let file_id = FileId::new(1).unwrap();
        let mut counter = SymbolCounter::new();
        let symbols = parser.parse(code, file_id, &mut counter);

        let macro_sym = symbols.iter().find(|s| s.name.as_ref() == "when-let+");
        assert!(macro_sym.is_some());
        assert_eq!(macro_sym.unwrap().kind, SymbolKind::Macro);
    }

    #[test]
    fn test_parse_defprotocol() {
        let mut parser = ClojureParser::new().unwrap();
        let code = r#"
(defprotocol IAnimal
  (speak [this])
  (move [this]))
"#;

        let file_id = FileId::new(1).unwrap();
        let mut counter = SymbolCounter::new();
        let symbols = parser.parse(code, file_id, &mut counter);

        let protocol = symbols.iter().find(|s| s.name.as_ref() == "IAnimal");
        assert!(protocol.is_some());
        assert_eq!(protocol.unwrap().kind, SymbolKind::Interface);
    }

    #[test]
    fn test_parse_defrecord() {
        let mut parser = ClojureParser::new().unwrap();
        let code = r#"
(defrecord User [id name email])
"#;

        let file_id = FileId::new(1).unwrap();
        let mut counter = SymbolCounter::new();
        let symbols = parser.parse(code, file_id, &mut counter);

        let record = symbols.iter().find(|s| s.name.as_ref() == "User");
        assert!(record.is_some());
        assert_eq!(record.unwrap().kind, SymbolKind::Struct);
    }

    #[test]
    fn test_parse_defmulti_defmethod() {
        let mut parser = ClojureParser::new().unwrap();
        let code = r#"
(defmulti area :shape)

(defmethod area :circle [{:keys [radius]}]
  (* 3.14159 radius radius))

(defmethod area :rectangle [{:keys [width height]}]
  (* width height))
"#;

        let file_id = FileId::new(1).unwrap();
        let mut counter = SymbolCounter::new();
        let symbols = parser.parse(code, file_id, &mut counter);

        // Check defmulti
        let multi = symbols.iter().find(|s| s.name.as_ref() == "area");
        assert!(multi.is_some());
        assert_eq!(multi.unwrap().kind, SymbolKind::Function);

        // Check defmethods
        let method_circle = symbols.iter().find(|s| s.name.as_ref() == "area :circle");
        assert!(method_circle.is_some());
        assert_eq!(method_circle.unwrap().kind, SymbolKind::Method);
    }

    #[test]
    fn test_parse_ns() {
        let mut parser = ClojureParser::new().unwrap();
        let code = r#"
(ns my.app.core
  (:require [clojure.string :as str]))

(defn main [] (println "Hello"))
"#;

        let file_id = FileId::new(1).unwrap();
        let mut counter = SymbolCounter::new();
        let symbols = parser.parse(code, file_id, &mut counter);

        let ns = symbols.iter().find(|s| s.name.as_ref() == "my.app.core");
        assert!(ns.is_some());
        assert_eq!(ns.unwrap().kind, SymbolKind::Module);

        // The function should have the module path set
        let func = symbols.iter().find(|s| s.name.as_ref() == "main");
        assert!(func.is_some());
        assert_eq!(
            func.unwrap().module_path.as_ref().map(|s| s.as_ref()),
            Some("my.app.core")
        );
    }
}