This repository was archived by the owner on Jul 28, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbenchmark.cpp
More file actions
242 lines (215 loc) · 5.57 KB
/
Copy pathbenchmark.cpp
File metadata and controls
242 lines (215 loc) · 5.57 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
#include<climits>
#include<set>
#include<iostream>
#include<chrono>
#include<cstdlib>
#include "splay.h"
using namespace std;
int main()
{
using clock = std::chrono::steady_clock;
// cout << INT_MIN << endl;
// cout << INT_MAX << endl;
//time to sequence insert
#if 0
set<int> myset;
int temp = 0;
clock::time_point start_set = clock::now();
while(temp != 10000)
{
myset.insert(temp++);
}
clock::time_point end_set = clock::now();
clock::duration execution_time_set = end_set - start_set;
cout << execution_time_set.count() << endl;
splay_tree<int> mysplaytree;
temp = 0;
clock::time_point start_splaytree = clock::now();
while(temp != 10000)
{
mysplaytree.insert(temp++);
}
clock::time_point end_splaytree = clock::now();
clock::duration execution_time_splaytree = end_splaytree - start_splaytree;
cout << execution_time_splaytree.count() << endl;
#endif
//time to sequence find
#if 0
set<int> myset;
int temp = 0;
while(temp != 10000)
{
myset.insert(temp++);
}
clock::time_point start_set = clock::now();
temp = 0;
while(temp != 10000)
{
myset.find(temp++);
}
clock::time_point end_set = clock::now();
clock::duration execution_time_set = end_set - start_set;
cout << execution_time_set.count() << endl;
splay_tree<int> mysplaytree;
temp = 0;
while(temp != 10000)
{
mysplaytree.insert(temp++);
}
clock::time_point start_splaytree = clock::now();
temp = 0;
while(temp != 10000)
{
mysplaytree.find(temp++);
}
clock::time_point end_splaytree = clock::now();
clock::duration execution_time_splaytree = end_splaytree - start_splaytree;
cout << execution_time_splaytree.count() << endl;
#endif
//time to repeated find
#if 0
set<int> myset;
int temp = 0;
while(temp != 10000)
{
myset.insert(temp++);
}
clock::time_point start_set = clock::now();
temp = 0;
int check_in = random()%10000;
while(temp != 10000)
{
myset.find(check_in);
++temp;
}
clock::time_point end_set = clock::now();
clock::duration execution_time_set = end_set - start_set;
cout << execution_time_set.count() << endl;
splay_tree<int> mysplaytree;
temp = 0;
while(temp != 10000)
{
mysplaytree.insert(temp++);
}
clock::time_point start_splaytree = clock::now();
temp = 0;
check_in = random()%10000;
while(temp != 10000)
{
mysplaytree.find(check_in);
++temp;
}
clock::time_point end_splaytree = clock::now();
clock::duration execution_time_splaytree = end_splaytree - start_splaytree;
cout << execution_time_splaytree.count() << endl;
#endif
//time to random find
#if 0
set<int> myset;
int temp = 0;
while(temp != 10000)
{
myset.insert(rand()%10000);
++temp;
}
clock::time_point start_set = clock::now();
temp = 0;
while(temp != 10000)
{
myset.find(rand()%10000);
++temp;
}
clock::time_point end_set = clock::now();
clock::duration execution_time_set = end_set - start_set;
cout << execution_time_set.count() << endl;
splay_tree<int> mysplaytree;
temp = 0;
while(temp != 10000)
{
mysplaytree.insert(rand()%10000);
++temp;
}
clock::time_point start_splaytree = clock::now();
temp = 0;
while(temp != 10000)
{
mysplaytree.find(rand()%10000);
++temp;
}
clock::time_point end_splaytree = clock::now();
clock::duration execution_time_splaytree = end_splaytree - start_splaytree;
cout << execution_time_splaytree.count() << endl;
#endif
//time to random find big no
#if 1
set<int> myset;
int temp = 0;
while(temp != 1000000)
{
myset.insert(rand()%1000000);
++temp;
}
clock::time_point start_set = clock::now();
temp = 0;
while(temp != 1000000)
{
myset.find(rand()%1000000);
++temp;
}
clock::time_point end_set = clock::now();
clock::duration execution_time_set = end_set - start_set;
cout << execution_time_set.count() << endl;
splay_tree<int> mysplaytree;
temp = 0;
while(temp != 1000000)
{
mysplaytree.insert(rand()%1000000);
++temp;
}
clock::time_point start_splaytree = clock::now();
temp = 0;
while(temp != 1000000)
{
mysplaytree.find(rand()%1000000);
++temp;
}
clock::time_point end_splaytree = clock::now();
clock::duration execution_time_splaytree = end_splaytree - start_splaytree;
cout << execution_time_splaytree.count() << endl;
#endif
//bazillion size set and splaytree
//time to sequence find
#if 0
set<int> myset;
int temp = INT_MIN;
while(temp != INT_MAX)
{
myset.insert(temp++);
}
clock::time_point start_set = clock::now();
temp = 0;
while(temp != INT_MAX)
{
myset.find(temp++);
}
clock::time_point end_set = clock::now();
clock::duration execution_time_set = end_set - start_set;
cout << execution_time_set.count() << endl;
temp = 0;
splay_tree<int> mysplaytree;
temp = 0;
while(temp != 10000)
{
mysplaytree.insert(temp++);
}
clock::time_point start_splaytree = clock::now();
temp = 0;
while(temp != 10000)
{
mysplaytree.find(temp++);
}
clock::time_point end_splaytree = clock::now();
clock::duration execution_time_splaytree = end_splaytree - start_splaytree;
cout << execution_time_splaytree.count() << endl;
#endif
}