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
use std::collections::BTreeSet;
use l_group_formulas::literal::Literal;
use l_group_formulas::short_free_group_term::ShortFreeGroupTerm;
use l_group_formulas::Term;

/// Represents the ball of radius 3 in the Cayley graph of the free
/// group with respect to the standard generating set.
/// 
/// #Examples
/// Basic usage:
/// ```
/// use std::collections::BTreeSet;
/// use l_group_formulas::literal::Literal;
/// use l_group_formulas::short_free_group_term::ShortFreeGroupTerm;
/// use truncated_free_groups::truncated_group::TruncatedGroup;
/// let mut generators = BTreeSet::new();
/// generators.insert(Literal::from('x'));
/// generators.insert(Literal::from('y'));
/// let truncated_group = TruncatedGroup::new(generators);
/// let mut expected: BTreeSet<ShortFreeGroupTerm> = BTreeSet::new();
/// assert_eq!(53, truncated_group.elements.len());
#[derive(Debug)]
pub struct TruncatedGroup {
    pub generators: BTreeSet<Literal>,
    pub elements:   Box<BTreeSet<ShortFreeGroupTerm>>
}


impl TruncatedGroup {
    pub fn new(generators: BTreeSet<Literal>) -> TruncatedGroup {
        let mut literals = BTreeSet::new();
        let mut elements = BTreeSet::new();
        for x in &generators {
            literals.insert(ShortFreeGroupTerm::from(*x));
            literals.insert(ShortFreeGroupTerm::from(x.inverse()));
            elements.insert(ShortFreeGroupTerm::from(*x));
            elements.insert(ShortFreeGroupTerm::from(x.inverse()));
        }

        for _ in &[1, 2] {
            let mut new_elements = BTreeSet::new();
            for literal in &literals {
                for t in &elements {
                    new_elements.insert(*t * *literal);
                }
            }
            for x in &new_elements { elements.insert(*x); }
        }

        TruncatedGroup {
            generators: generators,
            elements:   Box::new(elements)
        }
    }
}