-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPhoneBook_Main.cpp
More file actions
352 lines (258 loc) · 9.45 KB
/
PhoneBook_Main.cpp
File metadata and controls
352 lines (258 loc) · 9.45 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
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
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
// ===============================================================================
// PhoneBook_Main.cpp
// ===============================================================================
#include <iostream>
#include <chrono>
#include "PhoneBookVector.h"
#include "PhoneBookMap.h"
static void test01_phonebook()
{
using namespace PhoneBook;
PhoneBookVector book;
// testing insert
book.insert("Franz", "Schneider", 8483);
book.insert("Hans", "Mueller", 5326);
book.insert("Sepp", "Meier", 7561);
book.insert("Anton", "Huber", 4899);
book.print();
// testing invalid insertion
bool succeeded = book.insert("Franz", "Schneider", 4321);
if (!succeeded) {
std::cout << "Franz Schneider already in Phonebook!" << std::endl;
}
// testing toString
std::string s = book.toString();
std::cout << s << std::endl;
// testing update
std::cout << "Updating phone number of Franz Schneider:" << std::endl;
succeeded = book.update("Franz", "Schneider", 1234);
book.print();
// testing remove
std::cout << "Removing Anton Huber:" << std::endl;
succeeded = book.remove("Anton", "Huber");
book.print();
// testing contains
bool found = book.contains("Sepp", "Meier");
std::cout << "Found Sepp Meier: " << std::boolalpha << found << std::endl;
found = book.contains("Otto", "Meier");
std::cout << "Found Otto Meier: " << found << std::endl;
// testing search
std::size_t numberMeier = 0;
succeeded = book.search("Sepp", "Meier", numberMeier);
if (succeeded) {
std::cout << "Hans Meier: " << numberMeier << std::endl;
}
std::cout << std::endl;
// testing 'getNames'
std::forward_list<std::string> allNames = book.getNames();
std::size_t i = 1;
for (const std::string& name : allNames) {
std::cout << i << ": " << name << std::endl;
++i;
}
std::cout << std::endl;
}
static void test02_phonebook()
{
using namespace PhoneBook;
PhoneBookMap book;
// testing insert
book.insert("Franz", "Schneider", 8483);
book.insert("Hans", "Mueller", 5326);
book.insert("Sepp", "Meier", 7561);
book.insert("Anton", "Huber", 4899);
book.print();
// testing invalid insertion
bool succeeded = book.insert("Franz", "Schneider", 4321);
if (!succeeded) {
std::cout << "Franz Schneider already in Phonebook!" << std::endl;
}
// testing toString
std::string s = book.toString();
std::cout << s << std::endl;
// testing sort
// book.sort(); // std::unordered map doesn't support sorting
book.print();
// testing update
std::cout << "Updating phone number of Franz Schneider:" << std::endl;
succeeded = book.update("Franz", "Schneider", 1234);
book.print();
// testing remove
std::cout << "Removing Anton Huber:" << std::endl;
succeeded = book.remove("Anton", "Huber");
book.print();
// testing contains
bool found = book.contains("Sepp", "Meier");
std::cout << "Found Sepp Meier: " << std::boolalpha << found << std::endl;
found = book.contains("Otto", "Meier");
std::cout << "Found Otto Meier: " << found << std::endl;
// testing search
std::size_t numberMeier = 0;
succeeded = book.search("Sepp", "Meier", numberMeier);
if (succeeded) {
std::cout << "Hans Meier: " << numberMeier << std::endl;
}
std::cout << std::endl;
// testing 'getNames'
std::forward_list<std::string> allNames = book.getNames();
std::size_t i = 1;
for (const std::string& name : allNames) {
std::cout << i << ": " << name << std::endl;
++i;
}
std::cout << std::endl;
}
// ===============================================================================
//const long long MaxNames = 10000;
//const long long MaxIterations = 10000;
const long long MaxNames = 1000;
const long long MaxIterations = 500000;
static void test03_benchmark_01()
{
std::string first("First_");
std::string last("Last_");
// initialization
for (int i = 0; i < MaxNames; ++i) {
std::string vorname = first + std::to_string(i);
std::string nachname = last + std::to_string(i);
std::cout << "First: " << vorname << std::endl;
std::cout << "Last: " << nachname << std::endl;
}
}
static void test03_benchmark_02()
{
using namespace PhoneBook;
std::cout << "Start PhoneBook Vector" << std::endl;
const auto startTime(std::chrono::high_resolution_clock::now());
PhoneBookVector book;
std::string first("First_");
std::string last("Last_");
// initialization
for (int i = 0; i < MaxNames; ++i) {
std::string vorname = first + std::to_string(i);
std::string nachname = last + std::to_string(i);
book.insert(vorname, nachname, (std::size_t) 10000 + i);
}
std::cout << "Done." << std::endl;
const auto endTime(std::chrono::high_resolution_clock::now());
std::cout
<< std::chrono::duration_cast<std::chrono::duration<double, std::milli>>(endTime - startTime).count()
<< " msecs."
<< std::endl;
}
static void test03_benchmark_03()
{
using namespace PhoneBook;
std::cout << "Start PhoneBook Hashmap" << std::endl;
const auto startTime(std::chrono::high_resolution_clock::now());
PhoneBookMap book;
std::string first("First_");
std::string last("Last_");
// initialization
for (int i = 0; i < MaxIterations; ++i) {
std::string vorname = first + std::to_string(i);
std::string nachname = last + std::to_string(i);
book.insert(vorname, nachname, (std::size_t)10000 + i);
}
std::cout << "Done." << std::endl;
const auto endTime(std::chrono::high_resolution_clock::now());
std::cout
<< std::chrono::duration_cast<std::chrono::duration<double, std::milli>>(endTime - startTime).count()
<< " msecs."
<< std::endl;
}
static void test03_benchmark_04()
{
using namespace PhoneBook;
std::cout << "Start PhoneBook Vector" << std::endl;
const auto startTime(std::chrono::high_resolution_clock::now());
PhoneBookVector book;
std::string first("First_");
std::string last("Last_");
// initialization
for (int i = 0; i < MaxNames; ++i) {
std::string firstName = first + std::to_string(i);
std::string lastName = last + std::to_string(i);
book.insert(firstName, lastName, (std::size_t)10000 + i);
}
const auto endTime(std::chrono::high_resolution_clock::now());
std::cout
<< std::chrono::duration_cast<std::chrono::duration<double, std::milli>>(endTime - startTime).count()
<< " msecs."
<< std::endl;
std::cout << "Initialization done." << std::endl;
// test searching a number
const auto startTime2(std::chrono::high_resolution_clock::now());
std::size_t offset = MaxNames / 2;
//first = "First_999";
//last = "Last_999";
first = first + std::to_string(offset);
last = last + std::to_string(offset);
for (int i = 0; i < MaxIterations; ++i) {
std::size_t number = 0;
bool succeeded = book.search(first, last, number);
if (! succeeded) {
std::cout << "Internal Error" << std::endl;
}
}
const auto endTime2(std::chrono::high_resolution_clock::now());
std::cout
<< std::chrono::duration_cast<std::chrono::duration<double, std::milli>>(endTime2 - startTime2).count()
<< " msecs."
<< std::endl;
std::cout << "Searching done." << std::endl;
}
static void test03_benchmark_05()
{
using namespace PhoneBook;
std::cout << "Start PhoneBook Hashmap" << std::endl;
const auto startTime(std::chrono::high_resolution_clock::now());
PhoneBookMap book;
std::string first("First_");
std::string last("Last_");
// Initialization
for (int i = 0; i < MaxIterations; ++i) {
std::string firstName = first + std::to_string(i);
std::string lastName = last + std::to_string(i);
book.insert(firstName, lastName, (std::size_t)10000 + i);
}
const auto endTime(std::chrono::high_resolution_clock::now());
std::cout
<< std::chrono::duration_cast<std::chrono::duration<double, std::milli>>(endTime - startTime).count()
<< " msecs."
<< std::endl;
std::cout << "Initialization done." << std::endl;
// test searching a number
const auto startTime2(std::chrono::high_resolution_clock::now());
std::size_t offset = MaxNames / 2;
//first = "First_999";
//last = "Last_999";
first = first + std::to_string(offset);
last = last + std::to_string(offset);
for (int i = 0; i < MaxIterations; ++i) {
std::size_t number = 0;
bool succeeded = book.search(first, last, number);
if (!succeeded) {
std::cout << "Internal Error" << std::endl;
}
}
const auto endTime2(std::chrono::high_resolution_clock::now());
std::cout
<< std::chrono::duration_cast<std::chrono::duration<double, std::milli>>(endTime2 - startTime2).count()
<< " msecs."
<< std::endl;
std::cout << "Searching done." << std::endl;
}
void exerciseSTLPhoneBook()
{
test01_phonebook();
test02_phonebook();
test03_benchmark_01();
test03_benchmark_02();
test03_benchmark_03();
test03_benchmark_04();
test03_benchmark_05();
}
// ===============================================================================
// End-of-File
// ===============================================================================