forked from intel/cpp-std-extensions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcx_queue.cpp
More file actions
124 lines (104 loc) · 2.82 KB
/
cx_queue.cpp
File metadata and controls
124 lines (104 loc) · 2.82 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
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
#include <stdx/cx_queue.hpp>
#include <catch2/catch_test_macros.hpp>
#include <cstdint>
namespace {
struct panic_exception {};
struct injected_handler {
template <typename... Args> static auto panic(Args &&...) -> void {
throw panic_exception{};
}
template <stdx::ct_string Why, typename... Args>
static auto panic(Args &&...) -> void {
throw panic_exception{};
}
};
} // namespace
template <> inline auto stdx::panic_handler<> = injected_handler{};
TEST_CASE("empty", "[cx_queue]") {
stdx::cx_queue<std::uint32_t, 1> const q({});
CHECK(0u == q.size());
CHECK(1u == q.capacity());
CHECK(q.empty());
CHECK(not q.full());
}
TEST_CASE("full", "[cx_queue]") {
stdx::cx_queue<std::uint32_t, 1> q({});
q.push(1u);
CHECK(1u == q.size());
CHECK(1u == q.capacity());
CHECK(not q.empty());
CHECK(q.full());
}
TEST_CASE("push/pop", "[cx_queue]") {
stdx::cx_queue<std::uint32_t, 6> q;
q.push(1u);
CHECK(1u == q.size());
q.push(2u);
CHECK(2u == q.size());
q.push(3u);
REQUIRE(3u == q.size());
CHECK(1u == q.pop());
REQUIRE(2u == q.size());
CHECK(2u == q.pop());
REQUIRE(1u == q.size());
CHECK(3u == q.pop());
CHECK(0u == q.size());
CHECK(not q.full());
CHECK(q.empty());
}
TEST_CASE("push returns reference", "[cx_queue]") {
stdx::cx_queue<std::uint32_t, 1> q;
auto &ref = q.push(1u);
ref = 2u;
CHECK(2u == q.pop());
}
TEST_CASE("wraparound", "[cx_queue]") {
stdx::cx_queue<std::uint32_t, 2> q;
q.push(1u);
CHECK(1u == q.size());
q.push(2u);
REQUIRE(2u == q.size());
CHECK(1u == q.pop());
CHECK(1u == q.size());
q.push(3u);
REQUIRE(2u == q.size());
CHECK(2u == q.pop());
CHECK(3u == q.pop());
CHECK(0u == q.size());
CHECK(not q.full());
CHECK(q.empty());
}
TEST_CASE("safe over/underflow", "[cx_queue]") {
stdx::cx_queue<std::uint32_t, 1> q;
q.push(1u);
CHECK_THROWS_AS(q.push(2u), panic_exception);
CHECK(1u == q.pop());
CHECK_THROWS_AS(q.pop(), panic_exception);
CHECK_THROWS_AS(q.front(), panic_exception);
CHECK_THROWS_AS(q.back(), panic_exception);
}
namespace {
struct move_only {
constexpr move_only() = default;
constexpr move_only(int i) : value{i} {}
constexpr move_only(move_only &&) = default;
constexpr auto operator=(move_only &&) noexcept -> move_only & = default;
int value{};
};
} // namespace
TEST_CASE("move only elements", "[cx_queue]") {
stdx::cx_queue<move_only, 1> q;
q.push(move_only{1});
CHECK(1 == q.pop().value);
}
TEST_CASE("front/back", "[cx_queue]") {
stdx::cx_queue<std::uint32_t, 2> q;
q.push(1u);
q.push(2u);
CHECK(q.front() == 1u);
CHECK(q.back() == 2u);
q.front() = 2u;
CHECK(q.front() == 2u);
q.back() = 3u;
CHECK(q.back() == 3u);
}