4 |
|
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
|
7 |
+ |
import java.io.*; |
8 |
+ |
import java.math.*; |
9 |
|
import java.util.*; |
10 |
|
import java.util.concurrent.*; |
11 |
|
|
12 |
|
public class StringMapLoops { |
13 |
< |
static int nkeys = 75000; |
13 |
> |
static int nkeys = 147456; |
14 |
|
static int pinsert = 60; |
15 |
< |
static int premove = 2; |
15 |
> |
static int premove = 5; |
16 |
|
static int maxThreads = 100; |
17 |
|
static int nops = 8000000; |
18 |
|
static int removesPerMaxRandom; |
60 |
|
System.out.print(" ops: " + nops); |
61 |
|
System.out.println(); |
62 |
|
|
63 |
< |
String[] key = makeKeys(nkeys); |
63 |
> |
String[] key = new String[nkeys]; |
64 |
> |
initStringKeys(key, nkeys); |
65 |
> |
// String[] key = makeKeys(nkeys); |
66 |
|
|
67 |
|
int warmups = 2; |
68 |
|
for (int k = 1, i = 1; i <= maxThreads;) { |
90 |
|
pool.shutdown(); |
91 |
|
} |
92 |
|
|
89 |
– |
static String[] makeKeys(int n) { |
90 |
– |
LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom(); |
91 |
– |
String[] key = new String[n]; |
92 |
– |
for (int i = 0; i < key.length; ++i) { |
93 |
– |
int k = 0; |
94 |
– |
int len = 1 + (rng.next() & 0xf); |
95 |
– |
char[] c = new char[len * 4]; |
96 |
– |
for (int j = 0; j < len; ++j) { |
97 |
– |
int r = rng.next(); |
98 |
– |
c[k++] = (char) (' ' + (r & 0x7f)); |
99 |
– |
r >>>= 8; |
100 |
– |
c[k++] = (char) (' ' + (r & 0x7f)); |
101 |
– |
r >>>= 8; |
102 |
– |
c[k++] = (char) (' ' + (r & 0x7f)); |
103 |
– |
r >>>= 8; |
104 |
– |
c[k++] = (char) (' ' + (r & 0x7f)); |
105 |
– |
} |
106 |
– |
key[i] = new String(c); |
107 |
– |
} |
108 |
– |
return key; |
109 |
– |
} |
110 |
– |
|
93 |
|
static void shuffleKeys(String[] key) { |
94 |
|
Random rng = new Random(); |
95 |
|
for (int i = key.length; i > 1; --i) { |
129 |
|
int position; |
130 |
|
int total; |
131 |
|
|
132 |
< |
Runner(int id, Map<String,String> map, String[] key, CyclicBarrier barrier) { |
132 |
> |
Runner(int id, Map<String,String> map, String[] key, CyclicBarrier barrier) { |
133 |
|
this.map = map; |
134 |
|
this.key = key; |
135 |
|
this.barrier = barrier; |
158 |
|
} |
159 |
|
else if (r < insertsPerMaxRandom) { |
160 |
|
++position; |
161 |
+ |
// map.putIfAbsent(k, k); |
162 |
|
map.put(k, k); |
163 |
|
return 2; |
164 |
|
} |
180 |
|
} |
181 |
|
} |
182 |
|
} |
183 |
+ |
|
184 |
+ |
static final String wordFile = "testwords.txt"; |
185 |
+ |
|
186 |
+ |
// Read in String keys from file if possible |
187 |
+ |
static void initStringKeys(String[] keys, int n) throws Exception { |
188 |
+ |
FileInputStream fr = null; |
189 |
+ |
try { |
190 |
+ |
fr = new FileInputStream(wordFile); |
191 |
+ |
} catch (IOException ex) { |
192 |
+ |
System.out.println("No word file. Using String.valueOf(i)"); |
193 |
+ |
for (int i = 0; i < n; i++) |
194 |
+ |
keys[i] = String.valueOf(i); |
195 |
+ |
return; |
196 |
+ |
} |
197 |
+ |
|
198 |
+ |
BufferedInputStream in = new BufferedInputStream(fr); |
199 |
+ |
int k = 0; |
200 |
+ |
outer:while (k < n) { |
201 |
+ |
StringBuffer sb = new StringBuffer(); |
202 |
+ |
for (;;) { |
203 |
+ |
int c = in.read(); |
204 |
+ |
if (c < 0) |
205 |
+ |
break outer; |
206 |
+ |
char ch = (char) c; |
207 |
+ |
if (ch == '\n') { |
208 |
+ |
keys[k++] = sb.toString(); |
209 |
+ |
break; |
210 |
+ |
} |
211 |
+ |
if (!Character.isWhitespace(ch)) |
212 |
+ |
sb.append(ch); |
213 |
+ |
} |
214 |
+ |
} |
215 |
+ |
in.close(); |
216 |
+ |
|
217 |
+ |
// fill up remaining keys with path-like compounds of previous pairs |
218 |
+ |
int j = 0; |
219 |
+ |
while (k < n) |
220 |
+ |
keys[k++] = (String) keys[j++] + "/" + (String) keys[j]; |
221 |
+ |
} |
222 |
+ |
|
223 |
+ |
|
224 |
+ |
|
225 |
|
} |