# | Line 43 | Line 43 | public class ConcurrentDequeLoops { | |
---|---|---|
43 | Thread.sleep(100); | |
44 | print = true; | |
45 | ||
46 | < | int k = 1; |
47 | < | for (int i = 1; i <= maxStages;) { |
46 | > | for (int k = 1, i = 1; i <= maxStages;) { |
47 | oneRun(klass, i, items); | |
48 | if (i == k) { | |
49 | k = i << 1; | |
# | Line 54 | Line 53 | public class ConcurrentDequeLoops { | |
53 | i = k; | |
54 | } | |
55 | pool.shutdown(); | |
56 | < | } |
56 | > | } |
57 | ||
58 | static class Stage implements Callable<Integer> { | |
59 | final Deque<Integer> queue; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |