-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHashCodeTest.java
More file actions
164 lines (151 loc) · 4.8 KB
/
HashCodeTest.java
File metadata and controls
164 lines (151 loc) · 4.8 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
import java.util.Date;
import java.util.HashMap;
import java.util.Map;
import java.util.Random;
/**
*
*/
/**
* @author jcosta
*
*/
public class HashCodeTest {
/** Number of iterations to calculate. */
private static int MAXITERS = 10000000;
/** Maximum number of tests (maximum length 2^MAX) */
private static int MAX = 12;
/** Array of powers of 2 */
private static int power[];
/** Array of Strings */
private static String strings[];
private final static String letters ="abcdefghijklmnopqrstuvwxyz";
private static String ms(long nanoseconds) {
return "" + nanoseconds/1000.0 + " us";
}
private static void initPower() {
power = new int[MAX];
int p = 1;
for (int i = 0; i < MAX; i++) {
power[i] = p;
p <<= 1;
System.out.println(i +" -> " + power[i]);
}
}
private static void initStrings() {
strings = new String[MAX];
for (int i = 0; i < MAX; i ++) {
int length = power[i];
StringBuilder s = new StringBuilder(length);
for(int j = 0; j < length; j++) {
char c = letters.charAt((int)(Math.random()*100)%letters.length());
s.append(c);
}
strings[i] = s.toString();
}
}
private static void checkHashCodeTime() {
System.out.println("Length\t Iterations\t Time HASHCODETIME(keylength)");
for (int j = 0; j < MAX; j++) {
int length = power[j];
String test = strings[j];
int dummy = 0;
long startTime = System.nanoTime();
for (int i = 0; i < MAXITERS; i++) {
dummy += test.hashCode();
}
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println("" + length + "\t"+ MAXITERS + "\t " + ms(elapsedTime) + " " + dummy);
}
}
private static void checkEqualsTime() {
System.out.println("Length\t Iterations\t Time EQUALS(keylength)");
for (int j = 0; j < MAX; j++) {
int length = power[j];
String test = strings[j];
String orig = test.substring(0, test.length()-1) + "A"; //Equal but the last char to avoid optimization!
boolean dummy = true;
long startTime = System.nanoTime();
for (int i = 0; i < MAXITERS; i++) {
dummy &= test.equals(orig);
}
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println("" + length + "\t"+ MAXITERS + "\t " + ms(elapsedTime) + " " + dummy);
}
}
private static void checkEqualsTimeSameString() {
System.out.println("Length\t Iterations\t Time EQUALS(keylength) (using same String)");
for (int j = 0; j < MAX; j++) {
int length = power[j];
String test = strings[j];
String orig = new String(test);
boolean dummy = true;
long startTime = System.nanoTime();
for (int i = 0; i < MAXITERS; i++) {
dummy &= test.equals(orig);
}
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println("" + length + "\t"+ MAXITERS + "\t " + ms(elapsedTime) + " " + dummy);
}
}
private static void checkArrayAccessTime() {
System.out.println("Length\t Iterations\t Time ACCESSING A POSITION IN AN ARRAY");
for (int j = 0; j < MAX; j++) {
int length = power[j];
Integer [] s = new Integer[MAX];
for(int i = 0; i < MAX; i++) {
s[i] = power[i];
}
int dummy = 0;
long startTime = System.nanoTime();
for (int i = 0; i < MAXITERS; i++) {
dummy += s[j];
}
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println("" + length + "\t"+ MAXITERS + "\t " + ms(elapsedTime) + " " + dummy);
}
}
private static void checkGetHashMapTime() {
System.out.println("Length\t Iterations\t Time USING A MAP");
for (int j = 0; j < MAX; j++) {
int length = power[j];
String test = strings[j];
Map<String, Integer> map = new HashMap<String, Integer>();
map.put(test, new Integer(666));
int dummy = 0;
long startTime = System.nanoTime();
for (int i = 0; i < MAXITERS; i++) {
dummy += map.get(test);
}
long stopTime = System.nanoTime();
long elapsedTime = stopTime - startTime;
System.out.println("" + length + "\t"+ MAXITERS + "\t " + ms(elapsedTime) + " " + dummy);
}
}
/**
* @param args
*/
public static void main(String[] args) {
String a = "abcde";
String b = "abcde";
System.out.println("a = " + a);
System.out.println("b = " + b);
System.out.println("a == b " + (a == b));
System.out.println("a.hashCode() == b.hashCode() "+ (a.hashCode() == b.hashCode()));
System.out.println("a.equals(b) " + (a.equals(b)));
String c = new String (a);
System.out.println("c = new String(a)");
System.out.println("c == a " + (c == a));
System.out.println("c.hashCode() == a.hashCode() "+ (c.hashCode() == a.hashCode()));
initPower();
initStrings();
checkHashCodeTime();
checkEqualsTime();
checkGetHashMapTime();
checkEqualsTimeSameString();
checkArrayAccessTime();
}
}