enneagram 1.0.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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

use core::f64::consts::TAU;

use crate::triad::Triad;

#[repr(u8)]
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
#[derive(enum_display::EnumDisplay)]
pub enum Edge
{
    #[display("Recovery/Gradient")]
    Recovery = 1,
    #[display("Association/Superego")]
    Association = 2,
    #[display("Repression/Ego")]
    Repression = 3,
    #[display("Rejection/Id")]
    Rejection = 4,
    #[display("Catatonia")]
    Catatonia = 5,
    #[display("Paranoia")]
    Paranoia = 6,
    #[display("Disorganization")]
    Disorganization = 7,
    #[display("Action/Flow")]
    Action = 8,
    #[display("Rest/Equilibrium")]
    Rest = 9
}

impl Edge
{
    pub fn from_number(number: u8) -> Self
    {
        assert_ne!(number, 0, "There is no enneagram edge with the number 0.");
        assert!((1..=9).contains(&number), "Enneagram numbers must be within the range of 1-9.");
        number.checked_sub(1)
            .and_then(|i| Self::all()
                .get(i as usize)
                .copied()
            ).expect("Enneagram numbers must be within the range of 1-9.")
    }

    pub fn all() -> [Self; 9]
    {
        [Self::Recovery, Self::Association, Self::Repression, Self::Rejection, Self::Catatonia, Self::Paranoia, Self::Disorganization, Self::Action, Self::Rest]
    }

    pub fn number(&self) -> u8
    {
        let number = *self as u8;
        assert!((1..=9).contains(&number), "Enneagram numbers must be within the range of 1-9.");
        number
    }

    pub fn common_triads(edges: &[Edge]) -> Vec<Box<dyn Triad>>
    {
        crate::triad::all()
            .into_iter()
            .filter(|triad| {
                let triads_edges = triad.edges();
                edges.iter()
                    .all(|edge| triads_edges.contains(edge))
            }).collect::<Vec<_>>()
    }

    pub fn triads(&self) -> [Box<dyn Triad>; 4]
    {
        Self::common_triads(core::slice::from_ref(self))
            .try_into()
            .expect("Each personality must consist of exactly 4 triads.")
    }

    pub fn angle(&self) -> f64
    {
        let number = self.number();
        number as f64/10.0*TAU
    }

    pub fn position(&self) -> [f64; 2]
    {
        let angle = self.angle();
        let (sine, cosine) = angle.sin_cos();
        [sine, cosine]
    }

    pub fn neighbours(&self) -> [Edge; 8]
    {
        self.triads()
            .into_iter()
            .filter_map(|triad| match triad.edges()
                {
                    [this, a, b] | [a, this, b] | [a, b, this] if this == self => Some([*a, *b]),
                    _ => None
                }
            ).flatten()
            .collect::<Vec<_>>()
            .try_into()
            .expect("There must be exactly 8 neighbouring edges!")
    }

    pub fn info(&self, f: &mut core::fmt::Formatter) -> core::fmt::Result
    {
        Self::common_info(core::slice::from_ref(self), f)
    }

    pub fn common_info(edges: &[Edge], f: &mut core::fmt::Formatter) -> core::fmt::Result
    {
        for edge in edges
        {
            let number = edge.number();
            writeln!(f, "Enneagram {number} {edge}")?;
        }


        for triad in Self::common_triads(edges)
        {
            let numbers = triad.edges()
                .into_iter()
                .map(|edge| edge.number())
                .map(|number| format!("{number}"))
                .collect::<String>();
            write!(f, "\n{numbers} {triad}")?;
        }
        Ok(())
    }
}

#[cfg(test)]
mod test
{
    use crate::edge::Edge;

    #[test]
    fn test_ordering()
    {
        let edges = Edge::all();
        assert!(edges.is_sorted())
    }

    #[test]
    fn test_neighbours()
    {
        for edge in Edge::all()
        {
            let neighbours = edge.neighbours();
            println!("{edge:?} -> {neighbours:?}")
        }
    }
}