type-sitter-gen 0.6.1

generate typed wrappers for tree-sitter grammars from node-types.json and queries
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

use std::borrow::{Borrow, Cow};
use std::iter::once;
use join_lazy_fmt::Join;
use serde::Deserialize;

/// Uniquely identifies a node within a grammar.
#[derive(Clone, Debug, Deserialize, Eq, PartialEq, Ord, PartialOrd, Hash)]
pub struct NodeName {
    #[serde(rename = "type")]
    pub sexp_name: String,
    #[serde(rename = "named")]
    pub is_named: bool,
}

impl NodeName {
    pub fn is_implicit(&self) -> bool {
        self.is_named && self.sexp_name != "_" && self.sexp_name.starts_with('_')
    }

    pub(super) fn kind<'a>(names: impl IntoIterator<Item=&'a NodeName>) -> Cow<'a, str> {
        let mut names = names.into_iter();

        let Some(first) = names.next() else {
            return Cow::Borrowed("{}");
        };

        let Some(second) = names.next() else {
            return Cow::Borrowed(&first.sexp_name);
        };

        // Effectively add the first and second name back to the iterator.
        let names = once(first).chain(once(second)).chain(names);

        Cow::Owned(format!("{{{}}}", " | ".join(names.map(|n| &n.sexp_name))))
    }
}

impl Borrow<str> for NodeName {
    fn borrow(&self) -> &str {
        &self.sexp_name
    }
}