# | Line 6 | Line 6 | |
---|---|---|
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; | |
# | Line 55 | Line 55 | public class UnboundedQueueFillEmptyLoop | |
55 | m = 0; | |
56 | q.offer(numbers[m++]); | |
57 | } | |
58 | < | Integer p; |
59 | < | while ((p = q.poll()) != null) |
58 | > | for (Integer p; (p = q.poll()) != null; ) |
59 | sum += p.intValue(); | |
60 | } | |
61 | total += sum; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |