lk_math 0.5.1

Collection of reusable mathematical tools.
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
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

use std::collections::{HashSet, VecDeque};

#[derive(Default)]
struct GroupPresentation {
    symbols: Vec<char>,
    rules: Vec<(String, String)>,
}

struct Group {
    symbols: Vec<char>,
    rules: Vec<(String, String)>,
}

// NOTE(lubo): Something of this sort! :)
struct GroupElement {
    id: usize,
    name: Vec<String>,
    aliases: Vec<String>,
    left_compose: HashMap<usize, usize>,
}

impl GroupPresentation {
    pub fn new() -> Self {
        Self::default()
    }
    pub fn with_symbol(mut self, symbol: char) -> Self {
        self.symbols.push(symbol);
        self
    }
    pub fn with_equality(mut self, lhs: String, rhs: String) -> Self {
        self.rules.push((lhs, rhs));
        self
    }
    pub fn build(self) -> Group {
        Group {
            symbols: self.symbols,
            rules: self.rules,
        }
    }
}

impl Group {
    fn simplify(&self, mut g: String) -> String {
        // println!("simplifying {:?}", g);
        for _ in 0..10 {
            let mut simplified = true;
            for rule in self.rules.iter() {
                let applied = g.replace(&rule.0, &rule.1);
                if g != applied {
                    g = applied;
                    // println!("applied {:?}", rule);
                    // println!("{:?}", g);
                    simplified = false;
                }
            }
            if simplified {
                return g;
            }
        }
        panic!("Simplify loop limit reached")
    }

    pub fn find_all_elements(&self) -> HashSet<String> {
        let mut closed = HashSet::new();
        let mut open = VecDeque::from([String::new()]);

        let mut limit = 50;
        while let Some(word) = open.pop_front() {
            // if word.len() > 1 {
            //     open.push_back(self.simplify(word[1..].into()));
            //     open.push_back(self.simplify(word[..word.len()].into()));
            // }

            for c in self.symbols.iter() {
                let child = format!("{}{}", word, c);
                let child = self.simplify(child);
                open.push_back(child);
            }
            closed.insert(word);

            println!("closed: {:?}", closed);

            limit -= 1;
            if limit <= 0 {
                panic!("graph search loop limit reached")
            }
        }

        closed
    }
}

#[cfg(test)]
mod tests {
    use super::GroupPresentation;

    #[test]
    fn vierergruppe() {
        let group = GroupPresentation::new()
            .with_symbol('a')
            .with_symbol('b')
            .with_equality("aa".into(), "".into())
            .with_equality("bb".into(), "".into())
            .with_equality("abab".into(), "".into())
            .build();

        dbg!(group.find_all_elements());
    }
}