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
|
extern crate roaring;
use roaring::{RoaringBitmap, RoaringTreemap};
/// macro created to reduce code duplication
macro_rules! test_from_sorted_iter {
($values: expr, $class: ty) => {{
let rb1 = <$class>::from_iter($values.clone());
let rb2 = <$class>::from_sorted_iter($values).unwrap();
for (x, y) in rb1.iter().zip(rb2.iter()) {
assert_eq!(x, y);
}
assert_eq!(rb1.len(), rb2.len());
assert_eq!(rb1.min(), rb2.min());
assert_eq!(rb1.max(), rb2.max());
assert_eq!(rb1.is_empty(), rb2.is_empty());
assert_eq!(rb1, rb2);
}};
}
#[test]
fn append() {
test_from_sorted_iter!((0..1_000_000).map(|x| 13 * x).collect::<Vec<u32>>(), RoaringBitmap);
test_from_sorted_iter!(vec![1, 2, 4, 5, 7, 8, 9], RoaringBitmap);
}
#[test]
fn append_empty() {
assert_eq!(RoaringBitmap::new().append(vec![]), Ok(0u64))
}
#[test]
fn append_error() {
match [100u32].iter().cloned().collect::<RoaringBitmap>().append(vec![10, 20, 0]) {
Ok(_) => {
panic!("The 0th element in the iterator was < the max of the bitmap")
}
Err(non_sorted_error) => {
assert_eq!(non_sorted_error.valid_until(), 0)
}
}
match [100u32].iter().cloned().collect::<RoaringBitmap>().append(vec![200, 201, 201]) {
Ok(_) => {
panic!("The 3rd element in the iterator was < 2nd")
}
Err(non_sorted_error) => {
assert_eq!(non_sorted_error.valid_until(), 2)
}
}
}
#[test]
fn append_tree() {
test_from_sorted_iter!((0..1_000_000).map(|x| 13 * x).collect::<Vec<u64>>(), RoaringTreemap);
test_from_sorted_iter!(vec![1, 2, 4, 5, 7, 8, 9], RoaringTreemap);
}
|
