ktrs-parser 0.3.0

Kotlin parser producing PSI-identical lossless trees, ported from the Kotlin compiler
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

//! [`TreeSink`]: the tree builder `tree.rs` binds into, shared by a file and all of its
//! chameleons so each lazy node is built in place instead of being copied out of a sub-tree.

use ktrs_syntax::{Parse, SyntaxKind, TreeBuilder};

use super::chameleon_cache::ChameleonCache;
use super::psi_builder::PsiBuilder;

#[derive(Default)]
pub struct TreeSink {
    tree: TreeBuilder,
    cache: Option<ChameleonCache>,
    pub(super) errors: Vec<String>,
}

impl TreeSink {
    pub fn new() -> TreeSink {
        TreeSink::default()
    }

    /// A sink sized for the tree of `builder`'s file, chameleons included.
    pub(crate) fn for_file(builder: &PsiBuilder, cache: Option<ChameleonCache>) -> TreeSink {
        // Chameleons re-cut the file's own lexemes, so leaves <= lexemes; nodes are fewer in practice.
        let elements = 2 * builder.lexeme_count() + 1;
        TreeSink { tree: TreeBuilder::with_capacity(elements, builder.text.len()), cache, errors: Vec::new() }
    }

    pub fn with_cache(cache: ChameleonCache) -> TreeSink {
        TreeSink { cache: Some(cache), ..TreeSink::default() }
    }

    pub fn take_cache(&mut self) -> Option<ChameleonCache> {
        self.cache.take()
    }

    pub fn finish(self) -> Parse {
        Parse { tree: self.tree.finish().into(), error_messages: self.errors }
    }

    /// Emits the expanded chameleon `kind` over `text`: the cached subtree if there is one, else
    /// whatever `build` emits (one root node of `kind`), remembered when it added no errors.
    pub fn chameleon(&mut self, kind: SyntaxKind, text: &str, build: impl FnOnce(&mut TreeSink)) {
        let Some(cache) = &self.cache else { return build(self) };
        if let Some(subtree) = cache.get(kind, text) {
            self.tree.push_tree(subtree);
            return;
        }
        let (root, errors) = (self.tree.len(), self.errors.len());
        build(self);
        if self.errors.len() == errors {
            let subtree = self.tree.extract(root);
            self.cache.as_mut().expect("checked above").insert(subtree);
        }
    }

    pub(super) fn token(&mut self, kind: SyntaxKind, text: &str) {
        self.tree.token(kind, text);
    }

    pub(super) fn start_node(&mut self, kind: SyntaxKind) {
        self.tree.start_node(kind);
    }

    pub(super) fn finish_node(&mut self) {
        self.tree.finish_node();
    }
}