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
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129

use core::errors::Result;
use core::{Flavor, RpDecl, RpFile, RpName, RpReg};
use linked_hash_map::LinkedHashMap;
use std::collections::{btree_map, BTreeMap, LinkedList};
use std::vec;

/// Iterate over all files in the environment.
pub struct ForEachFile<'a, F: 'static>
where
    F: Flavor,
{
    iter: btree_map::Iter<'a, F::Package, RpFile<F>>,
}

impl<'a, F: 'static> Iterator for ForEachFile<'a, F>
where
    F: Flavor,
{
    type Item = (&'a F::Package, &'a RpFile<F>);

    fn next(&mut self) -> Option<Self::Item> {
        self.iter.next()
    }
}

/// Iterator over all toplevel declarations.
pub struct ToplevelDeclIter<'a, F: 'static>
where
    F: Flavor,
{
    it: vec::IntoIter<&'a RpDecl<F>>,
}

impl<'a, F: 'static> Iterator for ToplevelDeclIter<'a, F>
where
    F: Flavor,
{
    type Item = &'a RpDecl<F>;

    fn next(&mut self) -> Option<Self::Item> {
        self.it.next()
    }
}

/// Iterator over all declarations in a file.
pub struct DeclIter<'a, F: 'static>
where
    F: Flavor,
{
    queue: LinkedList<&'a RpDecl<F>>,
}

impl<'a, F: 'static> Iterator for DeclIter<'a, F>
where
    F: Flavor,
{
    type Item = &'a RpDecl<F>;

    fn next(&mut self) -> Option<Self::Item> {
        if let Some(decl) = self.queue.pop_front() {
            self.queue.extend(decl.decls());
            Some(decl)
        } else {
            None
        }
    }
}

/// An environment that has been translated into a target environment.
pub struct Translated<F: 'static>
where
    F: Flavor,
{
    /// Registered types.
    decls: LinkedHashMap<RpName<F>, RpReg>,
    /// Files and associated declarations.
    files: BTreeMap<F::Package, RpFile<F>>,
}

impl<F: 'static> Translated<F>
where
    F: Flavor,
{
    pub fn new(
        decls: LinkedHashMap<RpName<F>, RpReg>,
        files: BTreeMap<F::Package, RpFile<F>>,
    ) -> Self {
        Self { decls, files }
    }

    /// Lookup the declaration matching the given name.
    ///
    /// Returns the registered reference, if present.
    pub fn lookup<'a>(&'a self, name: &RpName<F>) -> Result<&'a RpReg> {
        let key = name.clone().without_prefix();

        if let Some(registered) = self.decls.get(&key) {
            return Ok(registered);
        }

        return Err(format!("no such type: {}", name).into());
    }

    /// Iterate over all files.
    pub fn for_each_file(&self) -> ForEachFile<F> {
        ForEachFile {
            iter: self.files.iter(),
        }
    }

    /// Iterate over top level declarations of all registered objects.
    pub fn toplevel_decl_iter(&self) -> ToplevelDeclIter<F> {
        let values = self.files
            .values()
            .flat_map(|f| f.decls.iter())
            .collect::<Vec<_>>();

        ToplevelDeclIter {
            it: values.into_iter(),
        }
    }

    /// Walks the entire tree of declarations recursively of all registered objects.
    pub fn decl_iter(&self) -> DeclIter<F> {
        let mut queue = LinkedList::new();
        queue.extend(self.files.values().flat_map(|f| f.decls.iter()));
        DeclIter { queue: queue }
    }
}