rune/compile/
names.rs

Help
1#[cfg(test)]
2mod tests;
3
4use core::mem::replace;
5
6use crate::alloc;
7use crate::alloc::btree_map::{self, BTreeMap};
8use crate::alloc::prelude::*;
9use crate::item::{Component, ComponentRef, IntoComponent};
10
11/// A tree of names.
12#[derive(Default, Debug)]
13pub struct Names {
14    root: Node,
15}
16
17impl TryClone for Names {
18    fn try_clone(&self) -> alloc::Result<Self> {
19        Ok(Self {
20            root: self.root.try_clone()?,
21        })
22    }
23}
24
25impl Names {
26    /// Insert the given item as an import.
27    pub(crate) fn insert<I>(&mut self, iter: I) -> alloc::Result<bool>
28    where
29        I: IntoIterator,
30        I::Item: IntoComponent,
31    {
32        let mut current = &mut self.root;
33
34        for c in iter {
35            current = current
36                .children
37                .entry(c.into_component()?)
38                .or_try_default()?;
39        }
40
41        Ok(replace(&mut current.term, true))
42    }
43
44    /// Test if the given import exists.
45    pub(crate) fn contains<I>(&self, iter: I) -> alloc::Result<bool>
46    where
47        I: IntoIterator,
48        I::Item: IntoComponent,
49    {
50        Ok(self.find_node(iter)?.map(|n| n.term).unwrap_or_default())
51    }
52
53    /// Test if we contain the given prefix.
54    pub(crate) fn contains_prefix<I>(&self, iter: I) -> alloc::Result<bool>
55    where
56        I: IntoIterator,
57        I::Item: IntoComponent,
58    {
59        Ok(self.find_node(iter)?.is_some())
60    }
61
62    /// Iterate over all known components immediately under the specified `iter`
63    /// path.
64    pub(crate) fn iter_components<'a, I>(
65        &'a self,
66        iter: I,
67    ) -> alloc::Result<impl Iterator<Item = ComponentRef<'a>> + 'a>
68    where
69        I: 'a + IntoIterator,
70        I::Item: IntoComponent,
71    {
72        let iter = if let Some(current) = self.find_node(iter)? {
73            current.children.keys()
74        } else {
75            btree_map::Keys::default()
76        };
77
78        Ok(iter.map(|c| c.as_component_ref()))
79    }
80
81    /// Find the node corresponding to the given path.
82    fn find_node<I>(&self, iter: I) -> alloc::Result<Option<&Node>>
83    where
84        I: IntoIterator,
85        I::Item: IntoComponent,
86    {
87        let mut current = &self.root;
88
89        for c in iter {
90            let c = c.into_component()?;
91
92            let Some(c) = current.children.get(&c) else {
93                return Ok(None);
94            };
95
96            current = c;
97        }
98
99        Ok(Some(current))
100    }
101}
102
103#[derive(Default, Debug)]
104struct Node {
105    /// If the node is terminating.
106    term: bool,
107    /// The children of this node.
108    children: BTreeMap<Component, Node>,
109}
110
111impl TryClone for Node {
112    fn try_clone(&self) -> alloc::Result<Self> {
113        Ok(Self {
114            term: self.term,
115            children: self.children.try_clone()?,
116        })
117    }
118}
rune/compile/names.rs

rune/compile/
names.rs
