-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.java
390 lines (365 loc) · 14.4 KB
/
test.java
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
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
import java.sql.SQLOutput;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
public class test {
public static void main (String[] args) throws Exception {
int m= 10000019;
//System.out.println("n is not close to 1");
//q4(m/2);
//System.out.println("n is almost 1 ");
//q4(19*m/20);
//q4_AQP(19*m/20);
//q3_1_Q1();
//q3_1_Q2();
//q3_2();
//ex5();
}
public static void q3_1_Q1(){
IHashTable table = new DoubleHashTable(6571, 6571);
int count = 0;
for (int i = 0; i <= 6571; i++) {
long key= (long) Math.pow(i, 2);
long final_key= ((key%6571)+6571)%6571;
HashTableElement elem = new HashTableElement(final_key, i);
try {
table.Insert(elem);
count++;
} catch (IHashTable.TableIsFullException e) {
e.printStackTrace();
System.out.println("should not happen");
} catch (IHashTable.KeyAlreadyExistsException e) {
}
}
System.out.println(count);
}
public static void q3_1_Q2(){
IHashTable table = new DoubleHashTable(6571, 6571);
int count = 0;
for (int i = 0; i <= 6571; i++) {
long key = (long) (Math.pow(-1,i)*(Math.pow(i, 2)));
long final_key= ((key%6571)+6571)%6571;
HashTableElement elem = new HashTableElement(final_key, i);
try {
table.Insert(elem);
count++;
} catch (IHashTable.TableIsFullException e) {
e.printStackTrace();
System.out.println("should not happen");
} catch (IHashTable.KeyAlreadyExistsException e) {
}
}
System.out.println(count);
}
public static void q3_2(){
Random rand = new Random();
System.out.println("************************** AQP **************************");
for (int i=0; i<100; i++) {
AQPHashTable qp = new AQPHashTable(6571, 1000000007);
for (int j=0; j<6571; j++){
int b = rand.nextInt(100);
try {
qp.Insert(new HashTableElement(b+100*j,j));
}
catch (IHashTable.TableIsFullException e) {
e.printStackTrace();
} catch (IHashTable.KeyAlreadyExistsException e) {
e.printStackTrace();
}
}
}
System.out.println("************************** QP **************************");
for (int i=0; i<100; i++) {
QPHashTable qp = new QPHashTable(6571, 1000000007);
for (int j=0; j<6571; j++){
int b = rand.nextInt(100);
try {
qp.Insert(new HashTableElement(b+100*j,j));
}
catch (IHashTable.TableIsFullException e) {
e.printStackTrace();
} catch (IHashTable.KeyAlreadyExistsException e) {
e.printStackTrace();
}
}
}
}
public static void q4(int n) throws IHashTable.KeyAlreadyExistsException, IHashTable.TableIsFullException {
int m=10000019;
long p=1000000007;
LPHashTable lp= new LPHashTable(m,p);
QPHashTable qp = new QPHashTable(m,p);
AQPHashTable aqp =new AQPHashTable(m,p);
DoubleHashTable d= new DoubleHashTable(m,p);
Random rand = new Random();
List<HashTableElement> arr = new ArrayList<>(n);
for(int i=0; i<n; i++) {
int b = rand.nextInt(100);
int a = 100 * i + b;
arr.add(new HashTableElement(a,a));
}
long startTime1 = System.nanoTime();
for(HashTableElement h: arr){
lp.Insert(h);
}
long endTime1 = System.nanoTime();
float totalTime1 = (float) ((endTime1-startTime1)*Math.pow(10,-9));
System.out.println("lp "+ totalTime1);
long startTime2 = System.nanoTime();
for(HashTableElement h: arr){
qp.Insert(h);
}
long endTime2= System.nanoTime();
float totalTime2 = (float) ((endTime2-startTime2)*Math.pow(10,-9));
System.out.println("qp "+ totalTime2);
long startTime3 = System.nanoTime();
for(HashTableElement h: arr){
aqp.Insert(h);
}
long endTime3 = System.nanoTime();
float totalTime3 = (float) ((endTime3-startTime3)*Math.pow(10,-9));
System.out.println("aqp "+ totalTime3);
long startTime4 = System.nanoTime();
for(HashTableElement h: arr){
d.Insert(h);
}
long endTime4 = System.nanoTime();
float totalTime4 = (float) ((endTime4-startTime4)*Math.pow(10,-9));
System.out.println("doublt "+ totalTime4);
}
public static void q5(){
IHashTable doublehash = new DoubleHashTable(10000019, 1000000007);
Random rand = new Random();
HashTableElement[] items = new HashTableElement[10000019 / 2];
for (int j = 0; j < 6; j++) {
long start= System.nanoTime();
for (int i = 0; i < 10000019 / 2; i++) {
int b = rand.nextInt(100);
items[i] = new HashTableElement(b + 100 * i, i);
try {
doublehash.Insert(new HashTableElement(b + 100 * i, i));
} catch (IHashTable.TableIsFullException e) {
e.printStackTrace();
} catch (IHashTable.KeyAlreadyExistsException e) {
e.printStackTrace();
}
}
for (int i = 0; i < 10000019 / 2; i++) {
try {
doublehash.Delete(items[i].GetKey());
} catch (IHashTable.KeyDoesntExistException e) {
e.printStackTrace();
}
}
long end= System.nanoTime();
double tot= Math.pow(10,-9)*(end-start);
System.out.println(j+" "+tot);
}
}
public static void ex4_1() throws Exception {
int m = 10000019;
long p = 1000000007;
int n = Math.floorDiv(m,2);
long a;
long b;
Random rand = new Random();
ArrayList<Long> keys = new ArrayList<Long>();
// creates array of keys
for (int i=0 ; i < n ; i++){
b = (long) rand.nextInt(100);
a = 100*i + b;
keys.add(a);
}
// create tables
LPHashTable table1 = new LPHashTable(m, p);
QPHashTable table2 = new QPHashTable(m, p);
AQPHashTable table3 = new AQPHashTable(m, p);
DoubleHashTable table4 = new DoubleHashTable(m, p);
System.out.println("LP time: " + insertToTable(keys, table1));
System.out.println("QP time: " + insertToTable(keys, table2));
System.out.println("AQP time: " + insertToTable(keys, table3));
System.out.println("DoubleHash time: " + insertToTable(keys, table4));
}
public static void ex4_2() throws Exception {
int m = 10000019;
long p = 1000000007;
int n = Math.floorDiv(19*m,20);
long a;
long b;
Random rand = new Random();
ArrayList<Long> keys = new ArrayList<Long>();
// creates array of keys
for (int i=0 ; i < n ; i++){
b = (long) rand.nextInt(100);
a = 100*i + b;
keys.add(a);
}
// create tables
LPHashTable table1 = new LPHashTable(m, p);
QPHashTable table2 = new QPHashTable(m, p);
AQPHashTable table3 = new AQPHashTable(m, p);
DoubleHashTable table4 = new DoubleHashTable(m, p);
System.out.println("LP time: " + insertToTable(keys, table1));
System.out.println("QP time: " + insertToTable(keys, table2));
System.out.println("AQP time: " + insertToTable(keys, table3));
System.out.println("DoubleHash time: " + insertToTable(keys, table4));
}
public static long insertToTable(ArrayList<Long> keys, OAHashTable table) throws Exception{
long startTime = System.currentTimeMillis();
for (int i=0 ; i < keys.size() ; i++){
long key = keys.get(i);
HashTableElement elementToInsert = new HashTableElement(key, key);
table.Insert(elementToInsert);
}
long endTime = System.currentTimeMillis();
return endTime - startTime;
}
public static void q4_check_QP(){
IHashTable table = new DoubleHashTable(10000019,1000000007);
int count = 0;
for (int i = 0; i <= 10000019; i++) {
long key= (long) Math.pow(i, 2);
long final_key= ((key%10000019)+10000019)%10000019;
HashTableElement elem = new HashTableElement(final_key, i);
try {
table.Insert(elem);
count++;
} catch (IHashTable.TableIsFullException e) {
e.printStackTrace();
System.out.println("should not happen");
} catch (IHashTable.KeyAlreadyExistsException e) {
}
}
System.out.println(count);
}
public static void q4_LP(int n) throws IHashTable.KeyAlreadyExistsException, IHashTable.TableIsFullException {
int m=10000019;
long p=1000000007;
LPHashTable lp= new LPHashTable(m,p);
Random rand = new Random();
List<HashTableElement> arr = new ArrayList<>(n);
for(int i=0; i<n; i++) {
int b = rand.nextInt(100);
int a = 100 * i + b;
arr.add(new HashTableElement(a,a));
}
long startTime1 = System.nanoTime();
for(HashTableElement h: arr){
lp.Insert(h);
}
long endTime1 = System.nanoTime();
float totalTime1 = (float) ((endTime1-startTime1)*Math.pow(10,-9));
System.out.println("lp "+ totalTime1);
}
public static void q4_QP(int n) throws IHashTable.KeyAlreadyExistsException, IHashTable.TableIsFullException {
int m=10000019;
long p=1000000007;
QPHashTable qp= new QPHashTable(m,p);
Random rand = new Random();
List<HashTableElement> arr = new ArrayList<>(n);
for(int i=0; i<n; i++) {
int b = rand.nextInt(100);
int a = 100 * i + b;
arr.add(new HashTableElement(a,a));
}
long startTime1 = System.nanoTime();
for(HashTableElement h: arr){
try{
qp.Insert(h);
} catch (IHashTable.TableIsFullException e) {
e.printStackTrace();
} catch (IHashTable.KeyAlreadyExistsException e) {
e.printStackTrace();
}
}
long endTime1 = System.nanoTime();
float totalTime1 = (float) ((endTime1-startTime1)*Math.pow(10,-9));
System.out.println("qp "+ totalTime1);
}
public static void q4_AQP(int n) throws IHashTable.KeyAlreadyExistsException, IHashTable.TableIsFullException {
int m=10000019;
long p=1000000007;
AQPHashTable aqp= new AQPHashTable(m,p);
Random rand = new Random();
List<HashTableElement> arr = new ArrayList<>(n);
for(int i=0; i<n; i++) {
int b = rand.nextInt(100);
int a = 100 * i + b;
arr.add(new HashTableElement(a,a));
}
long startTime1 = System.nanoTime();
for(HashTableElement h: arr){
aqp.Insert(h);
}
long endTime1 = System.nanoTime();
float totalTime1 = (float) ((endTime1-startTime1)*Math.pow(10,-9));
System.out.println("aqp "+ totalTime1);
}
public static void q4_DOUBLE(int n) throws IHashTable.KeyAlreadyExistsException, IHashTable.TableIsFullException {
int m=10000019;
long p=1000000007;
DoubleHashTable d= new DoubleHashTable(m,p);
Random rand = new Random();
List<HashTableElement> arr = new ArrayList<>(n);
for(int i=0; i<n; i++) {
int b = rand.nextInt(100);
int a = 100 * i + b;
arr.add(new HashTableElement(a,a));
}
long startTime1 = System.nanoTime();
for(HashTableElement h: arr){
d.Insert(h);
}
long endTime1 = System.nanoTime();
float totalTime1 = (float) ((endTime1-startTime1)*Math.pow(10,-9));
System.out.println("DOUBLE "+ totalTime1);
}
public static void ex5() throws Exception {
int m = 10000019;
long p = 1000000007;
int n = Math.floorDiv(m, 2);
long a;
long b;
Random rand = new Random();
DoubleHashTable table = new DoubleHashTable(m, p);
long insertStartTime;
long insertEndTime;
long deleteStartTime;
long deleteEndTime;
for (int j = 0; j < 6; j++){
long insertSumTime = 0;
long deleteSumTime = 0;
// initialized here on purpose for each iteration
ArrayList<Long> keys = new ArrayList<Long>();
for (int i = 0; i < n; i++){
b = (long) rand.nextInt(100);
a = 100*(long)i + b;
keys.add(i, a);
HashTableElement element = new HashTableElement(a, a);
try {
insertStartTime = System.currentTimeMillis();
table.Insert(element);
insertEndTime = System.currentTimeMillis();
insertSumTime += (insertEndTime - insertStartTime);
}
catch (IHashTable.KeyAlreadyExistsException ex) {
System.out.println("key already exists, i: " + i + ", a: " + a + ", j:" + j);
} catch (IHashTable.TableIsFullException ex) {
System.out.println("table is full, i: " + i + ", a: " + a + ", j:" + j);
}
}
for (int k = 0; k < n; k++){
long keyToDelete = keys.get(k);
try {
deleteStartTime = System.currentTimeMillis();
table.Delete(keyToDelete);
deleteEndTime = System.currentTimeMillis();
deleteSumTime += (deleteEndTime - deleteStartTime);
} catch (IHashTable.KeyDoesntExistException ex) {
System.out.println("key doesnt exists: " + keys.get(k));
}
}
System.out.println("iteration " + j + " Time: " + (deleteSumTime + insertSumTime));
}
}
}