compressed_collections 0.4.0

Collections which transparently compress data to reduce memory usage
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

use compressed_collections::ChunkSize;
use compressed_collections::Deque;
use compressed_collections::Stack;

#[test]
fn stack_test() {
    let mut big_vec = Vec::new();
    let mut compressed_stack = Stack::new_with_options(ChunkSize::SizeElements(1024 * 9), 0);
    for _ in 0..(1024 * 10) {
        big_vec.push(1.0);
        compressed_stack.push(1.0);
    }
    loop {
        let a = big_vec.pop();
        let b = compressed_stack.pop();
        assert!(a == b);
        if a.is_none() | b.is_none() {
            break;
        }
    }
}

#[test]
fn deque_test() {
    let mut big_vecdeque = std::collections::VecDeque::new();
    let mut compressed_deque = Deque::new_with_options(ChunkSize::SizeElements(1024 * 9), 0);
    for _ in 0..(1024 * 10) {
        big_vecdeque.push_back(1);
        compressed_deque.push_back(1);
    }
    loop {
        let a = big_vecdeque.pop_front();
        let b = compressed_deque.pop_front();
        assert!(a == b);
        if a.is_none() | b.is_none() {
            break;
        }
    }
}

#[test]
fn deque_test_2() {
    let mut big_vecdeque = std::collections::VecDeque::new();
    let mut compressed_deque = Deque::new_with_options(ChunkSize::SizeElements(1024 * 1), 0);
    for _ in 0..(1024 * 10) {
        big_vecdeque.push_front(1);
        compressed_deque.push_front(1);
    }
    loop {
        let a = big_vecdeque.pop_back();
        let b = compressed_deque.pop_back();
        assert!(a == b);
        if a.is_none() | b.is_none() {
            break;
        }
    }
}

#[test]
fn deque_test_3() {
    let mut big_vecdeque = std::collections::VecDeque::new();
    let mut compressed_deque = Deque::new_with_options(ChunkSize::SizeElements(1024 * 1), 0);
    for _ in 0..(1024 * 10) {
        big_vecdeque.push_front(1);
        compressed_deque.push_front(1);
    }
    loop {
        let a = big_vecdeque.pop_front();
        let b = compressed_deque.pop_front();
        assert!(a == b);
        if a.is_none() | b.is_none() {
            break;
        }
    }
}

#[test]
fn deque_test_4() {
    let mut big_vecdeque = std::collections::VecDeque::new();
    let mut compressed_deque = Deque::new_with_options(ChunkSize::SizeElements(1024 * 1), 0);
    for _ in 0..(1024 * 10) {
        big_vecdeque.push_back(1);
        compressed_deque.push_back(1);
    }
    loop {
        let a = big_vecdeque.pop_back();
        let b = compressed_deque.pop_back();
        assert!(a == b);
        if a.is_none() | b.is_none() {
            break;
        }
    }
}

#[test]
fn deque_test_5() {
    let mut big_vecdeque = std::collections::VecDeque::new();
    let mut compressed_deque = Deque::new_with_options(ChunkSize::SizeElements(1024 * 1), 0);
    for _ in 0..(1024 * 10) {
        big_vecdeque.push_back(1);
        compressed_deque.push_back(1);
    }
    for _ in 0..(1024 * 4) {
        let a = big_vecdeque.pop_back();
        let b = compressed_deque.pop_back();
        assert!(a == b);
        if a.is_none() | b.is_none() {
            break;
        }
    }
    for _ in 0..(1024 * 10) {
        big_vecdeque.push_front(1);
        compressed_deque.push_front(1);
    }
    for _ in 0..(1024 * 4) {
        let a = big_vecdeque.pop_front();
        let b = compressed_deque.pop_front();
        assert!(a == b);
        if a.is_none() | b.is_none() {
            break;
        }
    }
    for _ in 0..(1024 * 10) {
        big_vecdeque.push_back(1);
        compressed_deque.push_back(1);
    }
    loop {
        let a = big_vecdeque.pop_front();
        let b = compressed_deque.pop_front();
        assert!(a == b);
        if a.is_none() | b.is_none() {
            break;
        }
    }
}