repetitive 0.1.5

Macro for generating repetitive code
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

use std::collections::HashMap;

use super::*;

#[derive(Debug, Clone)]
pub struct Namespace<'p> {
    parent: Option<&'p Namespace<'p>>,
    names: HashMap<NameId, FragmentValue>,
    new_names: HashMap<NameId, FragmentValue>,
}

impl<'p> Namespace<'p> {
    pub fn new() -> Self {
        Self {
            parent: None,
            names: HashMap::new(),
            new_names: HashMap::new(),
        }
    }

    pub fn fork<'s>(&'s self) -> Namespace<'s> {
        Namespace {
            parent: Some(self),
            names: HashMap::new(),
            new_names: HashMap::new(),
        }
    }

    pub fn queue_insert(
        &mut self,
        name: Name,
        fragment: FragmentValue,
        _ctx: &mut Context,
    ) -> syn::Result<()> {
        if self.new_names.contains_key(&name.id) {
            return Err(syn::Error::new(name.span, "Name already exists"));
        }

        self.new_names.insert(name.id, fragment);

        Ok(())
    }
    pub fn flush(&mut self) {
        self.names.extend(self.new_names.drain());
    }

    pub fn get(&self, name: NameId) -> Option<&FragmentValue> {
        if let Some(fragment) = self.names.get(&name) {
            Some(fragment)
        } else if let Some(parent) = self.parent {
            parent.get(name)
        } else {
            None
        }
    }

    pub fn try_get(&self, name: Name) -> syn::Result<FragmentValue> {
        match self.get(name.id) {
            Some(fragment) => Ok(fragment.clone()),
            None => Err(syn::Error::new(name.span, "Name not found")),
        }
    }
}