hyperion 0.2.1

Generic LSystem implementation.
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
66
67

use std::fmt;

use crate::{Alphabet, Axiom, Module};

/// The current State of an LSystem.
#[derive(Debug, Clone, PartialEq)]
pub struct State<A: Alphabet> {
    pub(crate) inner: Vec<Module<A>>,
}

impl<A: Alphabet> State<A> {

    /// Generate a new LSystem state from an iterator of Module's.
    pub fn new<I: Into<Module<A>>, Iter: IntoIterator<Item = I>>(value: Iter) -> Self {
        State {
            inner: value.into_iter().map(|x| x.into()).collect(),
        }
    }
}

impl<A: Alphabet> State<A> {

    /// check whether the state contains the given module.
    pub fn contains(&self, m: &Module<A>) -> bool {
        self.inner.contains(m)
    }
}

impl<A: Alphabet> Default for State<A> {
    fn default() -> Self {
        Self {
            inner: Default::default(),
        }
    }
}

impl<'a, A: Alphabet> From<&'a Axiom<A>> for State<A> {
    fn from(value: &'a Axiom<A>) -> Self {
        value.inner.clone()
    }
}

impl<A: Alphabet> From<Module<A>> for State<A> {
    fn from(value: Module<A>) -> Self {
        State { inner: vec![value] }
    }
}

impl<A: Alphabet> IntoIterator for State<A> {
    type Item = Module<A>;

    type IntoIter = std::vec::IntoIter<Module<A>>;

    fn into_iter(self) -> Self::IntoIter {
        self.inner.into_iter()
    }
}

impl<A: Alphabet + fmt::Display> fmt::Display for State<A> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        let mut out = String::new();
        for m in &self.inner {
            out.push_str(&format!("{m}"));
        }
        write!(f, "{out}")
    }
}