6 |
|
|
7 |
|
import java.util.*; |
8 |
|
import java.util.concurrent.*; |
9 |
– |
import java.util.concurrent.locks.*; |
9 |
|
import java.util.concurrent.atomic.*; |
10 |
+ |
import java.util.concurrent.locks.*; |
11 |
|
|
12 |
|
public class UnboundedQueueFillEmptyLoops { |
13 |
|
static int maxSize = 10000; |
16 |
|
static Integer[] numbers; |
17 |
|
|
18 |
|
public static void main(String[] args) throws Exception { |
19 |
< |
Class klass = null; |
19 |
> |
Class<?> klass = null; |
20 |
|
if (args.length > 0) { |
21 |
|
try { |
22 |
|
klass = Class.forName(args[0]); |
44 |
|
if (total == 0) System.out.print(" "); |
45 |
|
} |
46 |
|
|
47 |
< |
static void oneRun(Class klass, int n) throws Exception { |
48 |
< |
Queue<Integer> q = (Queue<Integer>) klass.newInstance(); |
47 |
> |
static void oneRun(Class<?> klass, int n) throws Exception { |
48 |
> |
Queue<Integer> q = |
49 |
> |
(Queue<Integer>) klass.getConstructor().newInstance(); |
50 |
|
int sum = total; |
51 |
|
int m = rng.nextInt(numbers.length); |
52 |
|
long startTime = System.nanoTime(); |
56 |
|
m = 0; |
57 |
|
q.offer(numbers[m++]); |
58 |
|
} |
59 |
< |
Integer p; |
59 |
< |
while ((p = q.poll()) != null) |
59 |
> |
for (Integer p; (p = q.poll()) != null; ) |
60 |
|
sum += p.intValue(); |
61 |
|
} |
62 |
|
total += sum; |