hbbft 0.1.1

The Honey Badger of Byzantine Fault Tolerant Consensus Protocols
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

use std::collections::{btree_set, BTreeSet};
use std::ops::{Index, IndexMut};

/// A map from `bool` to `BTreeSet<N>`.
#[derive(Debug, Clone)]
pub struct BoolMultimap<N>([BTreeSet<N>; 2]);

impl<N: Ord> Default for BoolMultimap<N> {
    fn default() -> Self {
        BoolMultimap([BTreeSet::default(), BTreeSet::default()])
    }
}

impl<N: Ord> Index<bool> for BoolMultimap<N> {
    type Output = BTreeSet<N>;

    fn index(&self, index: bool) -> &BTreeSet<N> {
        &self.0[if index { 1 } else { 0 }]
    }
}

impl<N: Ord> IndexMut<bool> for BoolMultimap<N> {
    fn index_mut(&mut self, index: bool) -> &mut BTreeSet<N> {
        &mut self.0[if index { 1 } else { 0 }]
    }
}

impl<'a, N: Ord> IntoIterator for &'a BoolMultimap<N> {
    type Item = (bool, &'a N);
    type IntoIter = Iter<'a, N>;

    fn into_iter(self) -> Iter<'a, N> {
        Iter::new(self)
    }
}

pub struct Iter<'a, N> {
    key: bool,
    set_iter: btree_set::Iter<'a, N>,
    map: &'a BoolMultimap<N>,
}

impl<'a, N: 'a + Ord> Iter<'a, N> {
    fn new(map: &'a BoolMultimap<N>) -> Self {
        Iter {
            key: false,
            set_iter: map[false].iter(),
            map,
        }
    }
}

impl<'a, N: 'a + Ord> Iterator for Iter<'a, N> {
    type Item = (bool, &'a N);

    fn next(&mut self) -> Option<(bool, &'a N)> {
        if let Some(n) = self.set_iter.next() {
            Some((self.key, n))
        } else if self.key {
            None
        } else {
            self.key = true;
            self.set_iter = self.map[true].iter();
            self.next()
        }
    }
}