mathrc 0.2.3

Rust Mathematics Library
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

#[derive(Debug, Clone, )]
pub struct Set<T> where T: PartialEq + Clone,  {
    elements: Vec<T>
}

impl<T> Set<T> where T: PartialEq + Clone,  {
    pub fn new() -> Self {
        Self { elements: Vec::new() }
    }

    pub fn insert(&mut self, n: T) {
        if !self.elements.contains(&n) {
            self.elements.push(n)
        }
    }

    pub fn remove(&mut self, n: T) -> bool {
        if let Some(index) = self.elements.iter().position(
            |x| *x == n

        ) {
            self.elements.remove(index);
            return true;
        }
        false
    }

    pub fn contains(&self, n: T) -> bool {
        self.elements.contains(&n)
    }

    pub fn union(&self, other: &Self) -> Self {
        let mut result = self.clone();

        for x in &other.elements {
            result.insert(x.clone());
        }
        result
    }

    pub fn intersection(&self, other: &Self) -> Self {
        let mut result = Self::new();

        for x in &self.elements {
            if other.contains(x.clone()) {
                result.insert(x.clone());
            }
        }
        result
    }

    pub fn difference(&self, other: &Self) -> Self {
        let mut result = Self::new();

        for x in &self.elements {
            if !other.contains(x.clone()) {
                result.insert(x.clone());
            }
        }
        result
    }

    pub fn is_subset(&self, other: &Self) -> bool {
        self.elements.iter().all(|x| other.contains(x.clone()))
    }
}