enneagram 1.1.1

A digital enneagram
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

use crate::{config::Config, enneatype::Enneatype, triad::Triad};

#[derive(Clone)]
pub struct Enneagram
{
    pub edges: Vec<Vec<Enneatype>>,
    pub config: Config
}

impl Enneagram
{
    pub fn all(original: Enneagram) -> Self
    {
        Self {
            edges: vec![
                Enneatype::all().to_vec()
            ],
            ..original
        }
    }
    
    pub fn paths(&self) -> Vec<Vec<Enneatype>>
    {
        let mut paths = Vec::<Vec<Enneatype>>::new();
        for edges in self.edges.iter()
        {
            for edge in edges.iter()
            {
                if paths.iter()
                    .any(|path| path.contains(&edge))
                {
                    continue
                }
                let path = edge.path()
                    .collect::<Vec<_>>();
                if path.iter()
                    .all(|node| edges.contains(node))
                {
                    paths.push(path);
                }
            }
        }
        paths
    }

    pub fn lines(&self) -> Vec<[Enneatype; 2]>
    {
        let mut lines = core::iter::empty()
            .chain(if self.config.show().path_lines() {Some(self.path_lines())} else {None}.into_iter().flatten())
            .chain(if self.config.show().boundary_lines() {Some(self.boundary_lines())} else {None}.into_iter().flatten())
            .chain(if self.config.show().pivot_lines() {Some(self.pivot_lines())} else {None}.into_iter().flatten())
            .chain(if self.config.show().triad_lines() {Some(self.triad_lines())} else {None}.into_iter().flatten())
            .collect::<Vec<_>>();
        lines.dedup_by(|a, b| crate::line::equals(a, b));
        lines
    }

    pub fn path_lines(&self) -> impl Iterator<Item = [Enneatype; 2]>
    {
        self.paths()
            .into_iter()
            .flat_map(|path| crate::path::lines(path))
    }

    pub fn boundary_lines(&self) -> impl Iterator<Item = [Enneatype; 2]>
    {
        crate::path::lines(*Enneatype::all())
            .filter(|line| self.edges.iter()
                .any(|bucket| line.iter()
                    .all(|link| bucket.contains(link))
                )
            )
    }

    pub fn pivot_lines(&self) -> impl Iterator<Item = [Enneatype; 2]>
    {
        Enneatype::all()
            .into_iter()
            .flat_map(|edge| edge.pivot().lines())
            .filter(|line| self.edges.iter()
                .any(|bucket| line.iter()
                    .all(|link| bucket.contains(link))
                )
            )
    }

    pub fn triad_lines(&self) -> impl Iterator<Item = [Enneatype; 2]>
    {
        self.triads()
            .flat_map(|triad| triad.lines())
    }

    pub fn triads(&self) -> impl Iterator<Item = Box<dyn Triad>>
    {
        crate::triad::all()
            .into_iter()
            .filter(|traid| {
                let triad_edges = traid.edges();

                self.edges.iter()
                    .any(|bucket| bucket.iter()
                        .all(|edge| triad_edges.contains(edge))
                    )
            })
    }
}

#[cfg(test)]
mod test
{
    use crate::enneagram::Enneagram;

    #[test]
    fn test_paths()
    {
        let paths = Enneagram::all(Enneagram {
            edges: vec![],
            config: Default::default()
        }).paths();
        println!("{paths:?}")
    }
}