Newer
Older
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
#include "RaptorQ/v1/common.hpp"
#include "RaptorQ/RaptorQ_v1_hdr.hpp"
#include "RaptorQ/v1/Shared_Computation/Decaying_LF.hpp"
#include <memory>
#include <utility>
#include <algorithm>
#include <iostream>
#include <chrono>
#include <cstdlib>
#include "catch2/catch.hpp"
using namespace RaptorQ__v1::Impl;
TEST_CASE( "Basic", "[Decaying Least Frequency]" )
{
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == 0 );
RaptorQ__v1::local_cache_size (1024);
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == 1024 );
uint16_t size = 347;
const auto tmp_bool = std::vector<bool>();
const Cache_Key key(size, 0, 0, tmp_bool, tmp_bool);
auto data = DLF<std::vector<uint8_t>, Cache_Key>::get()->get(key);
REQUIRE( data.first == RaptorQ__v1::Compress::NONE );
REQUIRE( data.second.size() == 0 );
std::vector<uint8_t> vec(84);
vec[23] = 43;
vec[73] = 16;
vec[76] = 35;
auto vec_copy = vec;
auto comp = RaptorQ__v1::Compress::NONE;
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec, key);
data = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key);
REQUIRE( data.first == RaptorQ__v1::Compress::NONE );
REQUIRE( data.second.size() == 84 );
REQUIRE( data.second == vec_copy );
}
TEST_CASE( "Remove when adding more than limit", "[Decaying Least Frequency]" )
{
// Remove from previous test
DLF<std::vector<uint8_t>, Cache_Key>::get()->resize(0);
int cache_size = 3 * (400 +
DLF<std::vector<uint8_t>, Cache_Key>::get()->overhead_size());
auto comp = RaptorQ__v1::Compress::NONE;
RaptorQ__v1::local_cache_size(cache_size);
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == cache_size );
const auto tmp_bool = std::vector<bool>();
const Cache_Key key_a(10, 0, 0, tmp_bool, tmp_bool);
const Cache_Key key_b(101, 0, 0, tmp_bool, tmp_bool);
const Cache_Key key_c(62, 0, 0, tmp_bool, tmp_bool);
const Cache_Key key_d(16, 0, 0, tmp_bool, tmp_bool);
std::vector<uint8_t> vec_a(400);
std::vector<uint8_t> vec_b(400);
std::vector<uint8_t> vec_c(400);
std::vector<uint8_t> vec_d(400);
// Add 'a', 'b' and 'c'
auto vec_a_copy = vec_a;
auto vec_b_copy = vec_b;
auto vec_c_copy = vec_c;
auto vec_d_copy = vec_d;
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_a_copy, key_a);
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_b_copy, key_b);
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_c_copy, key_c);
auto data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
auto data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
auto data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
auto data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 400 );
REQUIRE( data_b.second.size() == 400 );
REQUIRE( data_c.second.size() == 400 );
REQUIRE( data_d.second.size() == 0 ); // Not added yet
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == cache_size );
// Get 'b' and add 'c'
vec_c_copy = vec_c;
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_c_copy, key_c);
// Add 'd'
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_d_copy, key_d);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 0 ); // Removed when adding d
REQUIRE( data_b.second.size() == 400 );
REQUIRE( data_c.second.size() == 400 );
REQUIRE( data_d.second.size() == 400 );
// Re-add 'a'
vec_a_copy = vec_a;
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_a_copy, key_a);
data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 0 ); // Can't delete
REQUIRE( data_b.second.size() == 400 );
REQUIRE( data_c.second.size() == 400 );
REQUIRE( data_d.second.size() == 400 );
// Get 'c' and add 'd'
vec_d_copy = vec_d;
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_d_copy, key_d);
// Add 'a'
vec_a_copy = vec_a;
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_a_copy, key_a);
data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 400 );
REQUIRE( data_b.second.size() == 0 ); // Removed
REQUIRE( data_c.second.size() == 400 );
REQUIRE( data_d.second.size() == 400 );
}
TEST_CASE( "Remove when resize", "[Decaying Least Frequency]" )
{
// Remove from previous test
DLF<std::vector<uint8_t>, Cache_Key>::get()->resize(0);
int cache_size = 5 * (400 +
DLF<std::vector<uint8_t>, Cache_Key>::get()->overhead_size());
auto comp = RaptorQ__v1::Compress::NONE;
RaptorQ__v1::local_cache_size(cache_size);
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == cache_size );
const auto tmp_bool = std::vector<bool>();
const Cache_Key key_a(10, 0, 0, tmp_bool, tmp_bool);
const Cache_Key key_b(101, 0, 0, tmp_bool, tmp_bool);
const Cache_Key key_c(62, 0, 0, tmp_bool, tmp_bool);
const Cache_Key key_d(16, 0, 0, tmp_bool, tmp_bool);
std::vector<uint8_t> vec_a(400);
std::vector<uint8_t> vec_b(400);
std::vector<uint8_t> vec_c(400);
std::vector<uint8_t> vec_d(400);
// Add 'a', 'b' and 'c'
auto vec_a_copy = vec_a;
auto vec_b_copy = vec_b;
auto vec_c_copy = vec_c;
auto vec_d_copy = vec_d;
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_a_copy, key_a);
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_b_copy, key_b);
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_c_copy, key_c);
DLF<std::vector<uint8_t>, Cache_Key>::get()->add(comp, vec_d_copy, key_d);
auto data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
auto data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
auto data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
auto data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 400 );
REQUIRE( data_b.second.size() == 400 );
REQUIRE( data_c.second.size() == 400 );
REQUIRE( data_d.second.size() == 400 );
data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 400 );
REQUIRE( data_b.second.size() == 400 );
REQUIRE( data_c.second.size() == 400 );
REQUIRE( data_d.second.size() == 400 );
// No need to remove
cache_size = 4 * (400 +
DLF<std::vector<uint8_t>, Cache_Key>::get()->overhead_size());
RaptorQ__v1::local_cache_size(cache_size);
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == cache_size );
data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 400 );
REQUIRE( data_b.second.size() == 400 );
REQUIRE( data_c.second.size() == 400 );
REQUIRE( data_d.second.size() == 400 );
// Remove 'a'
cache_size = 3 * (400 +
DLF<std::vector<uint8_t>, Cache_Key>::get()->overhead_size());
RaptorQ__v1::local_cache_size(cache_size);
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == cache_size );
data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 0 );
REQUIRE( data_b.second.size() == 400 );
REQUIRE( data_c.second.size() == 400 );
REQUIRE( data_d.second.size() == 400 );
// Remove 'b' and 'c'
cache_size = (400 +
DLF<std::vector<uint8_t>, Cache_Key>::get()->overhead_size());
RaptorQ__v1::local_cache_size(cache_size);
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == cache_size );
data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 0 );
REQUIRE( data_b.second.size() == 0 );
REQUIRE( data_c.second.size() == 0 );
REQUIRE( data_d.second.size() == 400 );
// Remove 'd'
cache_size = (400);
RaptorQ__v1::local_cache_size(cache_size);
REQUIRE( DLF<std::vector<uint8_t>, Cache_Key>::get()->get_size() == cache_size );
data_a = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_a);
data_b = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_b);
data_c = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_c);
data_d = DLF<std::vector<uint8_t>, Cache_Key>::get()->get (key_d);
REQUIRE( data_a.second.size() == 0 );
REQUIRE( data_b.second.size() == 0 );
REQUIRE( data_c.second.size() == 0 );
REQUIRE( data_d.second.size() == 0 );
}