-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstdlist.cpp
More file actions
180 lines (144 loc) · 8.15 KB
/
stdlist.cpp
File metadata and controls
180 lines (144 loc) · 8.15 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
//Done by:Emmanuel Johnson
\// victory orobosa
#include <iostream>
#include <string>
#include <list>
#include <fstream>
#include <chrono>
#include "BinarySearchTree.h"
#include "AVL.h"
#include "HashTable.h"
bool find(const std::list<int> &myList, const int &value) {
return std::find(myList.begin(), myList.end(), value) != myList.end();
}
int main() {
std::list<int> list1; // Creates a List using std::list
std::fstream deleteFile;
std::fstream randomFile;
std::fstream searchFile;
int number;
int successfulSearches = 0, failedSearches = 0, successfulInserts = 0 , successfulDeletes = 0, failedDeletes = 0;
int datasize;
std::cout << "What data size would you like." << std::endl;
std::cout << "1. 10k data size" << std::endl;
std::cout << "2. 1M data size" << std::endl;
std::cout << "3. 10M data size" << std::endl;
std::cin >> datasize;
switch (datasize) {
case 1: {
deleteFile.open("delete_values_10k.txt");
randomFile.open("random_values_10k.txt");
searchFile.open("search_values_10k.txt");
if (!deleteFile.is_open() || !randomFile.is_open() || !searchFile.is_open()) {
std::cerr << "Error opening files for 10k data size." << std::endl;
return 1;
}
auto startLoad = std::chrono::high_resolution_clock::now();
while (randomFile >> number) {
list1.push_back(number);
successfulInserts++;
}
auto endLoad = std::chrono::high_resolution_clock::now();
auto loadDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endLoad - startLoad);
std::cout << "Time taken to insert list: " << loadDuration.count() << " ms" << std::endl;
std::cout << "The number of successful inserts are " << successfulInserts << std::endl;
auto startSearch = std::chrono::high_resolution_clock::now();
while (searchFile >> number) {
if (find(list1, number)) successfulSearches++;
else failedSearches++;
}
auto endSearch = std::chrono::high_resolution_clock::now();
auto searchDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endSearch - startSearch);
std::cout << "Time taken to search list: " << searchDuration.count() << " ms" << std::endl;
std::cout << "Successful searches: " << successfulSearches << std::endl;
std::cout << "Failed searches: " << failedSearches << std::endl;
auto startDelete = std::chrono::high_resolution_clock::now();
while (deleteFile >> number) {
list1.remove(number);
}
auto endDelete = std::chrono::high_resolution_clock::now();
auto deleteDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endDelete - startDelete);
std::cout << "Time taken to delete numbers from list: " << deleteDuration.count() << " ms" << std::endl;
break;
}
case 2: {
deleteFile.open("delete_values_1m.txt");
randomFile.open("random_values_1m.txt");
searchFile.open("search_values_1m.txt");
if (!deleteFile.is_open() || !randomFile.is_open() || !searchFile.is_open()) {
std::cerr << "Error opening files for 1M data size." << std::endl;
return 1;
}
auto startLoad = std::chrono::high_resolution_clock::now();
while (randomFile >> number) {
list1.push_back(number);
successfulInserts++;
}
auto endLoad = std::chrono::high_resolution_clock::now();
auto loadDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endLoad - startLoad);
std::cout << "Time taken to insert list: " << loadDuration.count() << " ms" << std::endl;
std::cout << "The number of successful inserts are " << successfulInserts << std::endl;
auto startSearch = std::chrono::high_resolution_clock::now();
while (searchFile >> number) {
if (find(list1, number)) successfulSearches++;
else failedSearches++;
}
auto endSearch = std::chrono::high_resolution_clock::now();
auto searchDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endSearch - startSearch);
std::cout << "Time taken to search list: " << searchDuration.count() << " ms" << std::endl;
std::cout << "Successful searches: " << successfulSearches << std::endl;
std::cout << "Failed searches: " << failedSearches << std::endl;
auto startDelete = std::chrono::high_resolution_clock::now();
while (deleteFile >> number) {
list1.remove(number);
}
auto endDelete = std::chrono::high_resolution_clock::now();
auto deleteDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endDelete - startDelete);
std::cout << "Time taken to delete numbers from list: " << deleteDuration.count() << " ms" << std::endl;
break;
}
case 3: {
deleteFile.open("delete_values_10m.txt");
randomFile.open("random_values_10m.txt");
searchFile.open("search_values_10m.txt");
if (!deleteFile.is_open() || !randomFile.is_open() || !searchFile.is_open()) {
std::cerr << "Error opening files for 10M data size." << std::endl;
return 1;
}
auto startLoad = std::chrono::high_resolution_clock::now();
while (randomFile >> number) {
list1.push_back(number);
successfulInserts++;
}
auto endLoad = std::chrono::high_resolution_clock::now();
auto loadDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endLoad - startLoad);
std::cout << "Time taken to insert list: " << loadDuration.count() << " ms" << std::endl;
std::cout << "The number of successful inserts are " << successfulInserts << std::endl;
auto startSearch = std::chrono::high_resolution_clock::now();
while (searchFile >> number) {
if (find(list1, number)) successfulSearches++;
else failedSearches++;
}
auto endSearch = std::chrono::high_resolution_clock::now();
auto searchDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endSearch - startSearch);
std::cout << "Time taken to search list: " << searchDuration.count() << " ms" << std::endl;
std::cout << "Successful searches: " << successfulSearches << std::endl;
std::cout << "Failed searches: " << failedSearches << std::endl;
auto startDelete = std::chrono::high_resolution_clock::now();
while (deleteFile >> number) {
list1.remove(number);
}
auto endDelete = std::chrono::high_resolution_clock::now();
auto deleteDuration = std::chrono::duration_cast<std::chrono::milliseconds>(endDelete - startDelete);
std::cout << "Time taken to delete numbers from list: " << deleteDuration.count() << " ms" << std::endl;
break;
}
default:
std::cerr << "Invalid data size option." << std::endl;
}
deleteFile.close();
randomFile.close();
searchFile.close();
std::cout << "Done" << std::endl;
return 0;
}