25 |
|
static final long MAX_LONG_BOUND = (1L << 42); |
26 |
|
|
27 |
|
// Number of replications for other checks |
28 |
< |
static final int REPS = 20; |
28 |
> |
static final int REPS = |
29 |
> |
Integer.getInteger("ThreadLocalRandom8Test.reps", 4); |
30 |
|
|
31 |
|
/** |
32 |
|
* Invoking sized ints, long, doubles, with negative sizes throws |
101 |
|
long size = 0; |
102 |
|
for (int reps = 0; reps < REPS; ++reps) { |
103 |
|
counter.reset(); |
104 |
< |
r.ints(size).parallel().forEach(x -> {counter.increment();}); |
104 |
> |
r.ints(size).parallel().forEach(x -> counter.increment()); |
105 |
|
assertEquals(size, counter.sum()); |
106 |
|
size += 524959; |
107 |
|
} |
116 |
|
long size = 0; |
117 |
|
for (int reps = 0; reps < REPS; ++reps) { |
118 |
|
counter.reset(); |
119 |
< |
r.longs(size).parallel().forEach(x -> {counter.increment();}); |
119 |
> |
r.longs(size).parallel().forEach(x -> counter.increment()); |
120 |
|
assertEquals(size, counter.sum()); |
121 |
|
size += 524959; |
122 |
|
} |
131 |
|
long size = 0; |
132 |
|
for (int reps = 0; reps < REPS; ++reps) { |
133 |
|
counter.reset(); |
134 |
< |
r.doubles(size).parallel().forEach(x -> {counter.increment();}); |
134 |
> |
r.doubles(size).parallel().forEach(x -> counter.increment()); |
135 |
|
assertEquals(size, counter.sum()); |
136 |
|
size += 524959; |
137 |
|
} |
198 |
|
LongAdder counter = new LongAdder(); |
199 |
|
ThreadLocalRandom r = ThreadLocalRandom.current(); |
200 |
|
long size = 100; |
201 |
< |
r.ints().limit(size).parallel().forEach(x -> {counter.increment();}); |
201 |
> |
r.ints().limit(size).parallel().forEach(x -> counter.increment()); |
202 |
|
assertEquals(size, counter.sum()); |
203 |
|
} |
204 |
|
|
209 |
|
LongAdder counter = new LongAdder(); |
210 |
|
ThreadLocalRandom r = ThreadLocalRandom.current(); |
211 |
|
long size = 100; |
212 |
< |
r.longs().limit(size).parallel().forEach(x -> {counter.increment();}); |
212 |
> |
r.longs().limit(size).parallel().forEach(x -> counter.increment()); |
213 |
|
assertEquals(size, counter.sum()); |
214 |
|
} |
215 |
|
|
220 |
|
LongAdder counter = new LongAdder(); |
221 |
|
ThreadLocalRandom r = ThreadLocalRandom.current(); |
222 |
|
long size = 100; |
223 |
< |
r.doubles().limit(size).parallel().forEach(x -> {counter.increment();}); |
223 |
> |
r.doubles().limit(size).parallel().forEach(x -> counter.increment()); |
224 |
|
assertEquals(size, counter.sum()); |
225 |
|
} |
226 |
|
|
231 |
|
LongAdder counter = new LongAdder(); |
232 |
|
ThreadLocalRandom r = ThreadLocalRandom.current(); |
233 |
|
long size = 100; |
234 |
< |
r.ints().limit(size).forEach(x -> {counter.increment();}); |
234 |
> |
r.ints().limit(size).forEach(x -> counter.increment()); |
235 |
|
assertEquals(size, counter.sum()); |
236 |
|
} |
237 |
|
|
242 |
|
LongAdder counter = new LongAdder(); |
243 |
|
ThreadLocalRandom r = ThreadLocalRandom.current(); |
244 |
|
long size = 100; |
245 |
< |
r.longs().limit(size).forEach(x -> {counter.increment();}); |
245 |
> |
r.longs().limit(size).forEach(x -> counter.increment()); |
246 |
|
assertEquals(size, counter.sum()); |
247 |
|
} |
248 |
|
|
253 |
|
LongAdder counter = new LongAdder(); |
254 |
|
ThreadLocalRandom r = ThreadLocalRandom.current(); |
255 |
|
long size = 100; |
256 |
< |
r.doubles().limit(size).forEach(x -> {counter.increment();}); |
256 |
> |
r.doubles().limit(size).forEach(x -> counter.increment()); |
257 |
|
assertEquals(size, counter.sum()); |
258 |
|
} |
259 |
|
|