-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest.cpp
More file actions
92 lines (77 loc) · 2.68 KB
/
test.cpp
File metadata and controls
92 lines (77 loc) · 2.68 KB
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
/**
* Flip-flop LRU Cache.
* Copyright 2020 Ted J. Percival.
*
* MIT License
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "flipfloplru.h"
#include <cassert>
#include <limits>
struct Movable {
public:
Movable() = default;
explicit Movable(int v): v_(v) {}
Movable(const Movable&) = delete;
Movable(Movable&&) = default;
Movable& operator=(const Movable&) = delete;
Movable& operator=(Movable&&) = default;
private:
int v_ = 0;
};
int main(void) {
FlipFlopLRU<int, Movable> lru(1);
// Test reserve()
lru.reserve();
// Test that reserve() clamps to actual maximum size.
lru.reserve(std::numeric_limits<size_t>::max());
// Test accessor (return value ignored)
lru.maxSize();
lru.put(1, Movable(1));
Movable* m = lru.get(1);
assert(m != nullptr);
m = lru.get(2);
assert(m == nullptr);
lru.put(2, Movable(2));
// Pull 1 from inactive side
m = lru.get(1);
assert(m != nullptr);
// Replace 1
lru.put(1, Movable(1));
// Replace inactive-side element
lru.put(2, Movable(2));
// Move entire FlipFlopLRU
FlipFlopLRU<int, Movable> lru2 = std::move(lru);
FlipFlopLRU<int, Movable> lru3(std::move(lru2));
lru3.erase(1);
lru3.erase(2);
std::pair<size_t, size_t> empty{0u, 0u};
assert(lru3.size() == empty);
lru3.put(3, Movable(3));
std::pair<size_t, size_t> oneActive{1u, 0u};
assert(lru3.size() == oneActive);
lru3.put(4, Movable(4));
std::pair<size_t, size_t> oneEach{1u, 1u};
assert(lru3.size() == oneEach);
lru3.erase(4);
std::pair<size_t, size_t> onePassive{0u, 1u};
assert(lru3.size() == onePassive);
return 0;
}