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
|
/*
* Copyright (c) 2015, Ford Motor Company
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following
* disclaimer in the documentation and/or other materials provided with the
* distribution.
*
* Neither the name of the Ford Motor Company nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include "gtest/gtest.h"
#include "utils/prioritized_queue.h"
namespace test {
namespace components {
namespace utils {
using ::utils::PrioritizedQueue;
class TestMessage {
public:
TestMessage() : priority(0) {}
TestMessage(std::string message, size_t msg_priority)
: msg_(message), priority(msg_priority) {}
size_t PriorityOrder() const;
std::string msg() const;
friend bool operator==(const TestMessage& msg1, const TestMessage& msg2);
private:
std::string msg_;
size_t priority;
};
size_t TestMessage::PriorityOrder() const {
return priority;
}
std::string TestMessage::msg() const {
return msg_;
}
bool operator==(const TestMessage& msg1, const TestMessage& msg2) {
return (msg1.msg() == msg2.msg() &&
msg1.PriorityOrder() == msg2.PriorityOrder());
}
class PrioritizedQueueTest : public testing::Test {
protected:
PrioritizedQueue<TestMessage> test_queue;
};
TEST_F(PrioritizedQueueTest, DefaultCtorTest_ExpectEmptyQueueCreated) {
EXPECT_TRUE(test_queue.empty());
}
TEST_F(PrioritizedQueueTest, PushFourElementsTest_ExpectFourElementsAdded) {
// Creating 4 messages
TestMessage message1("Ford", 2);
TestMessage message2("Hello", 1);
TestMessage message3("Luxoft", 4);
TestMessage message4("from", 3);
// Adding created messages to Prioritized queue
test_queue.push(message4);
test_queue.push(message3);
test_queue.push(message1);
test_queue.push(message2);
// Expect 4 messages were added successfully
EXPECT_EQ(4u, test_queue.size());
}
TEST_F(PrioritizedQueueTest, AddFourElementsTest_ExpectQueueNotEmpty) {
// Creating 4 messages with different priorities
TestMessage message1("Ford", 2);
TestMessage message2("Hello", 1);
TestMessage message3("Luxoft", 4);
TestMessage message4("from", 3);
// Adding created messages to Prioritized queue
test_queue.push(message4);
test_queue.push(message3);
test_queue.push(message1);
test_queue.push(message2);
// Expect queue not empty
EXPECT_FALSE(test_queue.empty());
}
TEST_F(PrioritizedQueueTest,
CheckMessageOrder_ExpectMessageWithHighestPriorityAddedFirst) {
// Creating 4 messages with different priorities
TestMessage message1("Ford", 111);
TestMessage message2("Hello", 21);
TestMessage message3("Luxoft", 14);
TestMessage message4("from", 4);
// Adding created messages to Prioritized queue. Expect queue ordered
// according priority
test_queue.push(message4);
test_queue.push(message3);
test_queue.push(message1);
test_queue.push(message2);
// Check the first message is the message with highest priority
EXPECT_EQ(message1, test_queue.front());
}
TEST_F(PrioritizedQueueTest,
Push_AddMessagesWithEqualPriority_ExpectMessagesWithEqualPriorityAdded) {
// Creating 2 messages with the same priorities
TestMessage message1("Hello", 111);
TestMessage message2("Luxoft", 111);
// Adding created messages to Prioritized queue.
test_queue.push(message1);
test_queue.push(message2);
// Expect 2 messages were added successfully
EXPECT_EQ(2u, test_queue.size());
}
TEST_F(
PrioritizedQueueTest,
Pop_OneElementInPriorityQueue_ExpectQueueStillAliveWithRestMessagesWithEqualPriority) {
// Creating 4 messages with same priorities
TestMessage message1("Ford's", 111);
TestMessage message2("Partner", 111);
// Adding created messages to Prioritized queue.
test_queue.push(message1);
test_queue.push(message2);
// Expect 2 messages were added successfully to One element of prioritized
// queue
EXPECT_EQ(2u, test_queue.size());
// Extracting first element from the queue
EXPECT_EQ(message1, test_queue.front());
test_queue.pop();
// Check queue with the same priority messages still alive
EXPECT_EQ(1u, test_queue.size());
EXPECT_EQ(message2, test_queue.front());
test_queue.pop();
EXPECT_EQ(0u, test_queue.size());
}
TEST_F(
PrioritizedQueueTest,
Pop_TwoElementsInPriorityQueue_ExpectElementErasedIfOnlyOneWithConcretePriorityExist) {
// Creating 2 messages with same priority and 1 with different
TestMessage message1("Hello", 111);
TestMessage message2("Luxoft", 111);
TestMessage message3("Company", 77);
// Adding created messages to Prioritized queue.
test_queue.push(message1);
test_queue.push(message2);
test_queue.push(message3);
// Expect 3 messages were added successfully to Two elements of prioritized
// queue
EXPECT_EQ(3u, test_queue.size());
// Extracting first element from the queue
EXPECT_EQ(message1, test_queue.front());
test_queue.pop();
// Check queue with the same priority messages still alive
EXPECT_EQ(2u, test_queue.size());
EXPECT_EQ(message2, test_queue.front());
test_queue.pop();
EXPECT_EQ(message3, test_queue.front());
// Delete last element. Expect erased.
test_queue.pop();
EXPECT_EQ(0u, test_queue.size());
}
TEST_F(PrioritizedQueueTest,
NotEmptyPrioritizedQueuePopElement_ExpectQueueDecreasedOneElement) {
// Creating 4 prioritized messages
TestMessage message1("Alice", 111);
TestMessage message2("in", 14);
TestMessage message3("Wonderland", 4);
// Adding created messages to Prioritized queue
test_queue.push(message2);
test_queue.push(message3);
test_queue.push(message1);
// Extracting first element from the queue
test_queue.pop();
// Check that one message was extracted
EXPECT_EQ(2u, test_queue.size());
// Checking if extracted message was the message with highest priority
// therefore now first message in queue has highest priority
EXPECT_EQ(message2, test_queue.front());
// Extracting first element from the queue
test_queue.pop();
// Checking if extracted message was the message with highest priority
// therefore now first message in queue has highest priority
EXPECT_EQ(message3, test_queue.front());
}
} // namespace utils
} // namespace components
} // namespace test
|
