-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
191 lines (147 loc) · 5 KB
/
Copy pathmain.cpp
File metadata and controls
191 lines (147 loc) · 5 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
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
#include "gtest/gtest.h"
#include "deque.hpp"
#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <random>
#include <climits>
using std::cerr;
std::default_random_engine generator(501);
class DequeTest: public ::testing::TestWithParam<size_t>{};
int getNumber(){
std::uniform_int_distribution<int> Number(INT_MIN, INT_MAX);
return Number(generator);
}
size_t getIndex(size_t left, size_t right){
std::uniform_int_distribution<size_t> Index(left, right - 1);
return Index(generator);
}
void getPop(Deque<int> &deque, std::deque<int> &std_deque, int &my_value, int &std_value) {
if (std_deque.empty())
return;
if (getIndex(0, 2)) {
my_value = deque.front();
std_value = std_deque.front();
deque.popFront();
std_deque.pop_front();
} else {
my_value = deque.back();
std_value = std_deque.back();
deque.popBack();
std_deque.pop_back();
}
}
void getPush(Deque<int> &deque, std::deque<int> &std_deque, int value){
if (getIndex(0, 2)){
deque.pushBack(value);
std_deque.push_back(value);
} else {
deque.pushFront(value);
std_deque.push_front(value);
}
}
TEST_P(DequeTest, TestOfPushAndPop){
Deque<int> deque;
std::deque<int> std_deque;
size_t test_size = GetParam();
for (size_t i = 0; i < test_size; ++i){
getPush(deque, std_deque, getNumber());
ASSERT_EQ(deque.size(), std_deque.size());
}
ASSERT_TRUE(std::equal(deque.begin(), deque.end(), std_deque.begin()));
for (size_t i = 0; i < test_size; ++i){
int my_value(1), std_value(0);
getPop(deque, std_deque, my_value, std_value);
ASSERT_EQ(deque.size(), std_deque.size());
ASSERT_EQ(my_value, std_value);
}
ASSERT_EQ(deque.empty(), std_deque.empty());
}
enum TypeOfEvent {
CHECK_VALUE,
CHANGE_VALUE,
PUSH,
POP,
BACK,
FRONT,
OPERATIONS_COUNT
};
struct Event {
TypeOfEvent type;
size_t left, right, index;
int value;
};
Event getEvent(std::default_random_engine &event_generator, size_t length){
std::uniform_int_distribution<size_t> Events(0, OPERATIONS_COUNT - 1);
Event event;
event.type = static_cast<TypeOfEvent>(Events(event_generator));
event.index = getIndex(0, length);
event.left = getIndex(0, length -1);
event.right = getIndex(event.left, length);
event.value = getNumber();
return event;
}
void generateStartValues(size_t length, Deque<int> &deque, std::deque<int> &std_deque){
for (size_t i = 0; i < length; ++i)
getPush(deque, std_deque, getNumber());
}
std::vector<Event> generateEvents(std::default_random_engine &event_generator, size_t number_of_event, size_t length){
std::vector<Event> events;
for (size_t i = 0; i < number_of_event; ++i){
events.push_back(getEvent(event_generator, length));
if (events[i].type == PUSH)
length++;
if (events[i].type == POP && length != 0)
length--;
}
return events;
}
TEST_P(DequeTest, TestManyDifferentEvents){
Deque<int> deque;
std::deque<int> std_deque;
const size_t start_length = 1000;
generateStartValues(start_length, deque, std_deque);
size_t number_of_events = GetParam();
std::default_random_engine event_generator(number_of_events);
std::vector<Event> events = generateEvents(event_generator, number_of_events, start_length);
for (auto event: events){
int my_value(0), std_value(1);
if (event.type == CHECK_VALUE)
ASSERT_EQ(deque[event.index], std_deque[event.index]);
if (event.type == CHANGE_VALUE)
deque[event.index] = std_deque[event.index] = event.value;
if (event.type == PUSH)
getPush(deque, std_deque, event.value);
if (event.type == POP)
getPop(deque, std_deque, my_value, std_value);
if ((event.type == BACK) && (std_deque.size() != 0))
ASSERT_EQ(deque.back(), std_deque.back());
if ((event.type == FRONT) && (std_deque.size() != 0))
ASSERT_EQ(deque.front(), std_deque.front());
ASSERT_EQ(deque.size(), std_deque.size());
ASSERT_EQ(deque.empty(), std_deque.empty());
}
ASSERT_TRUE(std::equal(deque.begin(), deque.end(), std_deque.begin()));
ASSERT_TRUE(std::equal(deque.cbegin(), deque.cend(), std_deque.cbegin()));
ASSERT_TRUE(std::equal(deque.rbegin(), deque.rend(), std_deque.rbegin()));
ASSERT_TRUE(std::equal(deque.crbegin(), deque.crend(), std_deque.crbegin()));
}
TEST_P(DequeTest, ConstDequeTest){
Deque<int> deque;
std::deque<int> std_deque;
generateStartValues(GetParam(), deque, std_deque);
const Deque<int> const_deque(deque);
const std::deque<int> const_std_deque(std_deque);
ASSERT_TRUE(std::equal(const_deque.begin(), const_deque.end(), const_std_deque.begin()));
ASSERT_TRUE(std::equal(const_deque.rbegin(), const_deque.rend(), const_std_deque.rbegin()));
ASSERT_EQ(const_deque.back(), const_std_deque.back());
ASSERT_EQ(const_deque.front(), const_std_deque.front());
for (size_t i = 0; i < const_std_deque.size(); ++i)
ASSERT_EQ(const_deque[i], const_std_deque[i]);
}
INSTANTIATE_TEST_CASE_P(TestName, DequeTest, ::testing::Values(1, 50, 500, 5000, 150000, 3000000));
int main(int argc, char *argv[]){
::testing::InitGoogleTest(&argc, argv);
return RUN_ALL_TESTS();
}