kodept-ast 0.4.1

Simple compiler with dependent types support in mind
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

use std::rc::Weak;

use kodept_core::ConvertibleToRef;
use kodept_core::structure::span::CodeHolder;

use crate::graph::{AnyNode, NodeId};
use crate::graph::{SyntaxTree, SyntaxTreeBuilder};
use crate::rlt_accessor::{RLTFamily};

pub trait Identifiable: Sized {
    fn get_id(&self) -> NodeId<Self>;
}

impl<T: crate::graph::Identifiable> Identifiable for T {
    fn get_id(&self) -> NodeId<Self> {
        <Self as crate::graph::Identifiable>::get_id(self)
    }
}

#[allow(clippy::wrong_self_convention)]
pub trait AsEnum {
    type Enum;
    
    fn as_enum(self) -> Self::Enum; 
}

pub trait Linker {
    fn link<A, B>(&mut self, ast: &A, with: &B)
    where 
        A: Identifiable + Into<AnyNode>,
        B: Into<RLTFamily> + Clone;

    fn link_existing<A, B>(&mut self, a: A, b: &B) -> A
    where 
        A: Identifiable + Into<AnyNode>,
        B: Identifiable + Into<AnyNode>;

    fn link_by_id<A, B>(&mut self, ast_id: NodeId<A>, with: &B)
    where
        B: Into<RLTFamily> + Clone,
        A: Into<AnyNode>;
}

pub trait Accessor {
    fn access<A, B>(&self, ast: &A) -> Option<&B>
    where
        A: Identifiable + Into<AnyNode>,
        RLTFamily: ConvertibleToRef<B>;

    fn access_unknown<A>(&self, ast: &A) -> Option<RLTFamily>
    where 
        A: Identifiable + Into<AnyNode>;

    fn tree(&self) -> Weak<SyntaxTree>;
}

pub(crate) trait PopulateTree {
    type Output: Into<AnyNode>;

    fn convert(
        &self,
        builder: &mut SyntaxTreeBuilder,
        context: &mut (impl Linker + CodeHolder),
    ) -> NodeId<Self::Output>;
}