xee-ir 0.1.3

Xee intermediate representation and compilation to bytecode
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

#[derive(Debug)]
pub(crate) struct Scope<N: Eq + Clone> {
    names: Vec<N>,
}

impl<N: Eq + Clone> Scope<N> {
    fn new() -> Self {
        Self { names: Vec::new() }
    }

    fn get(&self, name: &N) -> Option<usize> {
        for (i, n) in self.names.iter().enumerate().rev() {
            if n == name {
                return Some(i);
            }
        }
        None
    }

    fn known_name(&self, name: &N) -> bool {
        self.names.iter().any(|n| n == name)
    }
}

#[derive(Debug, Default)]
pub struct Scopes<N: Eq + Clone> {
    scopes: Vec<Scope<N>>,
}

impl<N: Eq + Clone> Scopes<N> {
    pub fn new() -> Self {
        Self {
            scopes: vec![Scope::new()],
        }
    }

    pub(crate) fn push_scope(&mut self) {
        self.scopes.push(Scope::new());
    }

    pub(crate) fn pop_scope(&mut self) {
        self.scopes.pop();
    }

    pub(crate) fn push_name(&mut self, name: &N) {
        self.scopes.last_mut().unwrap().names.push(name.clone());
    }

    pub(crate) fn pop_name(&mut self) {
        self.scopes.last_mut().unwrap().names.pop();
    }

    pub(crate) fn get(&self, name: &N) -> Option<usize> {
        self.scopes.last().unwrap().get(name)
    }

    pub(crate) fn is_closed_over_name(&self, name: &N) -> bool {
        let mut scopes = self.scopes.iter();
        scopes.next();
        scopes.any(|s| s.known_name(name))
    }
}