bitar 0.14.0

bita archive utilities
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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165

use std::collections::BTreeMap;
use std::ops::Bound;

use crate::ChunkOffset;

#[derive(Default)]
pub(crate) struct ChunkLocationMap<V> {
    btm: BTreeMap<ChunkOffset, V>,
}

impl<V> ChunkLocationMap<V> {
    pub fn new() -> Self {
        Self {
            btm: BTreeMap::new(),
        }
    }
    // Insert at location. Does not verify if the given location overlaps.
    pub fn insert(&mut self, location: ChunkOffset, value: V) {
        self.btm.insert(location, value);
    }
    // Remove at exact location.
    pub fn remove(&mut self, location: &ChunkOffset) -> Option<V> {
        self.btm.remove(location)
    }
    // Iterate all locations which the given location overlaps.
    pub fn iter_overlapping(
        &self,
        location: ChunkOffset,
    ) -> impl Iterator<Item = (&ChunkOffset, &V)> {
        let location_offset = location.offset;
        self.btm
            .range((
                Bound::Unbounded,
                Bound::Excluded(ChunkOffset::new(location.end(), 0)),
            ))
            .rev()
            .take_while(move |(loc, _v)| location_offset < loc.end())
    }
}

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

    #[test]
    fn insert_and_iter_in_order() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 10), 1);
        clm.insert(ChunkOffset::new(15, 7), 3);
        clm.insert(ChunkOffset::new(10, 5), 2);
        let mut iter = clm.btm.iter();
        assert_eq!(iter.next(), Some((&ChunkOffset::new(0, 10), &1)));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(10, 5), &2)));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(15, 7), &3)));
        assert_eq!(iter.next(), None);
    }
    #[test]
    fn remove_one() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 10), 1);
        clm.insert(ChunkOffset::new(15, 7), 3);
        clm.insert(ChunkOffset::new(10, 5), 2);
        assert_eq!(clm.remove(&ChunkOffset::new(15, 7)), Some(3));
        assert_eq!(clm.btm.len(), 2);
    }
    #[test]
    fn remove_first() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 10), 1);
        clm.insert(ChunkOffset::new(15, 7), 2);
        assert_eq!(clm.remove(&ChunkOffset::new(0, 10)), Some(1));
        assert_eq!(clm.btm.len(), 1);
    }
    #[test]
    fn remove_last() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 10), 1);
        clm.insert(ChunkOffset::new(15, 7), 2);
        assert_eq!(clm.remove(&ChunkOffset::new(15, 7)), Some(2));
        assert_eq!(clm.btm.len(), 1);
    }
    #[test]
    fn no_remove() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 10), 1);
        clm.insert(ChunkOffset::new(15, 7), 2);
        assert_eq!(clm.remove(&ChunkOffset::new(0, 1)), None);
        assert_eq!(clm.remove(&ChunkOffset::new(0, 9)), None);
        assert_eq!(clm.remove(&ChunkOffset::new(1, 10)), None);
        assert_eq!(clm.btm.len(), 2);
    }
    #[test]
    fn some_overlap() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 10), 1);
        clm.insert(ChunkOffset::new(10, 5), 2);
        clm.insert(ChunkOffset::new(15, 7), 3);
        clm.insert(ChunkOffset::new(30, 10), 4);
        clm.insert(ChunkOffset::new(40, 10), 5);

        let mut iter = clm.iter_overlapping(ChunkOffset::new(10, 30));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(30, 10), &4)));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(15, 7), &3)));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(10, 5), &2)));
        assert_eq!(iter.next(), None);
    }
    #[test]
    fn exact_overlap() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 5), 1);
        clm.insert(ChunkOffset::new(5, 5), 2);
        clm.insert(ChunkOffset::new(10, 5), 3);
        clm.insert(ChunkOffset::new(15, 5), 4);

        let mut iter = clm.iter_overlapping(ChunkOffset::new(5, 5));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(5, 5), &2)));
        assert_eq!(iter.next(), None);
    }
    #[test]
    fn exact_overlap_plus_one() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 5), 1);
        clm.insert(ChunkOffset::new(5, 5), 2);
        clm.insert(ChunkOffset::new(10, 5), 3);
        clm.insert(ChunkOffset::new(15, 5), 4);

        let mut iter = clm.iter_overlapping(ChunkOffset::new(5, 6));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(10, 5), &3)));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(5, 5), &2)));
        assert_eq!(iter.next(), None);
    }
    #[test]
    fn exact_overlap_minus_one() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 5), 1);
        clm.insert(ChunkOffset::new(5, 5), 2);
        clm.insert(ChunkOffset::new(10, 5), 3);
        clm.insert(ChunkOffset::new(15, 5), 4);

        let mut iter = clm.iter_overlapping(ChunkOffset::new(4, 6));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(5, 5), &2)));
        assert_eq!(iter.next(), Some((&ChunkOffset::new(0, 5), &1)));
        assert_eq!(iter.next(), None);
    }
    #[test]
    fn above_no_overlap() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(0, 5), 1);
        clm.insert(ChunkOffset::new(5, 5), 2);
        clm.insert(ChunkOffset::new(10, 5), 3);
        clm.insert(ChunkOffset::new(15, 5), 4);

        let mut iter = clm.iter_overlapping(ChunkOffset::new(20, 10));
        assert_eq!(iter.next(), None);
    }
    #[test]
    fn between_no_overlap() {
        let mut clm = ChunkLocationMap::new();
        clm.insert(ChunkOffset::new(15, 7), 1);
        clm.insert(ChunkOffset::new(30, 10), 2);

        let mut iter = clm.iter_overlapping(ChunkOffset::new(23, 6));
        assert_eq!(iter.next(), None);
    }
}