eqlog-runtime 0.9.0

Datalog with equality
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

use super::map::*;
use std::fmt;

#[derive(Clone)]
pub struct WBTreeSet {
    map: WBTreeMap<()>,
}

impl WBTreeSet {
    pub const fn new() -> Self {
        WBTreeSet {
            map: WBTreeMap::new(),
        }
    }

    pub fn insert(&mut self, value: u32) -> bool {
        self.map.insert(value, ()).is_none()
    }

    pub fn contains(&self, value: &u32) -> bool {
        self.map.contains_key(value)
    }

    pub fn remove(&mut self, value: &u32) -> bool {
        self.map.remove(value).is_some()
    }

    pub fn is_empty(&self) -> bool {
        self.map.is_empty()
    }

    pub fn len(&self) -> usize {
        self.map.len()
    }

    pub fn clear(&mut self) {
        self.map.clear();
    }

    pub fn iter(&self) -> WBTreeSetIter<'_> {
        WBTreeSetIter {
            map_iter: self.map.iter(),
        }
    }

    pub fn union(&self, other: &Self) -> Self {
        WBTreeSet {
            map: self.map.union(&other.map, |_element, (), ()| ()),
        }
    }

    pub fn difference(&self, other: &Self) -> Self {
        WBTreeSet {
            map: self.map.difference(&other.map, |_element, (), ()| None),
        }
    }
}

impl fmt::Debug for WBTreeSet {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_set().entries(self.iter()).finish()
    }
}

// Iterator for WBTreeSet
pub struct WBTreeSetIter<'a> {
    map_iter: Iter<'a, ()>,
}

impl<'a> Iterator for WBTreeSetIter<'a> {
    type Item = u32;

    fn next(&mut self) -> Option<Self::Item> {
        self.map_iter.next().map(|(k, _)| k)
    }
}