httpbis 0.9.1

Rust implementation of HTTP/2 protocol
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138

use std::collections::hash_set;
use std::collections::HashSet;
use std::hash::Hash;
use std::iter::FromIterator;
use std::ops::Deref;
use std::slice;
use std::sync::Arc;

pub struct HashSetShallowCloneItems<T> {
    items: Option<Arc<Vec<T>>>,
}

impl<T> HashSetShallowCloneItems<T> {
    pub fn to_vec(&self) -> Vec<T>
    where
        T: Clone,
    {
        match &self.items {
            Some(items) => items.deref().clone(),
            None => Vec::new(),
        }
    }
}

impl<'a, T> IntoIterator for &'a HashSetShallowCloneItems<T> {
    type Item = &'a T;
    type IntoIter = slice::Iter<'a, T>;

    fn into_iter(self) -> slice::Iter<'a, T> {
        match self.items {
            Some(ref vec) => vec.iter(),
            None => [].iter(),
        }
    }
}

#[derive(Default, Debug, Eq, PartialEq)]
pub struct HashSetShallowClone<T: Hash + Eq + Clone> {
    set: HashSet<T>,
    // This field is Arc because tasks need to be Sync in tokio 0.2
    // TODO: make it Rc
    items: Option<Arc<Vec<T>>>,
}

impl<T: Hash + Eq + Clone> HashSetShallowClone<T> {
    pub fn new() -> Self {
        HashSetShallowClone {
            set: HashSet::new(),
            items: None,
        }
    }

    pub fn items(&mut self) -> HashSetShallowCloneItems<T> {
        // TODO: store delta and update shallow map
        if let None = self.items {
            if self.set.is_empty() {
                // Avoid allocation
                return HashSetShallowCloneItems { items: None };
            }

            self.items = Some(Arc::new(self.set.iter().cloned().collect()));
        }
        HashSetShallowCloneItems {
            items: Some(self.items.as_mut().unwrap().clone()),
        }
    }

    pub fn get(&self, value: &T) -> Option<&T> {
        self.set.get(value)
    }

    pub fn remove(&mut self, item: &T) -> bool {
        let removed = self.set.remove(item);
        if removed {
            self.items.take();
        }
        removed
    }

    pub fn insert(&mut self, value: T) -> bool {
        let inserted = self.set.insert(value);
        if inserted {
            self.items.take();
        }
        inserted
    }

    pub fn _iter(&self) -> hash_set::Iter<T> {
        self.set.iter()
    }
}

impl<T: Clone + Eq + Hash> FromIterator<T> for HashSetShallowClone<T> {
    fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self {
        HashSetShallowClone {
            set: HashSet::from_iter(iter),
            items: None,
        }
    }
}

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

    #[test]
    fn insert_updates() {
        let mut s = HashSetShallowClone::new();
        s.insert(10);
        let mut items = s.items().to_vec();
        items.sort();
        assert_eq!(&[10], &items[..]);

        s.insert(20);
        let mut items = s.items().to_vec();
        items.sort();
        assert_eq!(&[10, 20], &items[..]);
    }

    #[test]
    fn remove_updates() {
        let mut s = HashSetShallowClone::new();
        s.insert(10);
        let mut items = s.items().to_vec();
        items.sort();
        assert_eq!(&[10], &items[..]);

        s.insert(20);
        let mut items = s.items().to_vec();
        items.sort();
        assert_eq!(&[10, 20], &items[..]);

        s.remove(&10);
        let mut items = s.items().to_vec();
        items.sort();
        assert_eq!(&[20], &items[..]);
    }
}