1 |
|
/* |
2 |
|
* Written by Doug Lea with assistance from members of JCP JSR-166 |
3 |
|
* Expert Group and released to the public domain, as explained at |
4 |
< |
* http://creativecommons.org/licenses/publicdomain |
4 |
> |
* http://creativecommons.org/publicdomain/zero/1.0/ |
5 |
|
*/ |
6 |
|
import java.util.concurrent.*; |
7 |
|
|
8 |
|
public class CancelledProducerConsumerLoops { |
9 |
< |
static final int CAPACITY = 100; |
9 |
> |
static final int CAPACITY = 100; |
10 |
|
static final long TIMEOUT = 100; |
11 |
|
|
12 |
|
static final ExecutorService pool = Executors.newCachedThreadPool(); |
32 |
|
Thread.sleep(100); |
33 |
|
} |
34 |
|
pool.shutdown(); |
35 |
< |
} |
35 |
> |
} |
36 |
|
|
37 |
|
static void oneRun(BlockingQueue<Integer> q, int npairs, int iters) throws Exception { |
38 |
|
LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer(); |
39 |
|
CyclicBarrier barrier = new CyclicBarrier(npairs * 2 + 1, timer); |
40 |
< |
Future[] prods = new Future[npairs]; |
41 |
< |
Future[] cons = new Future[npairs]; |
40 |
> |
Future<?>[] prods = new Future<?>[npairs]; |
41 |
> |
Future<?>[] cons = new Future<?>[npairs]; |
42 |
|
|
43 |
|
for (int i = 0; i < npairs; ++i) { |
44 |
|
prods[i] = pool.submit(new Producer(q, barrier, iters)); |
95 |
|
System.out.print("SynchronousQueue "); |
96 |
|
oneRun(new SynchronousQueue<Integer>(), pairs, iters / 8); |
97 |
|
|
98 |
– |
|
98 |
|
if (print) |
99 |
|
System.out.print("SynchronousQueue(fair) "); |
100 |
|
oneRun(new SynchronousQueue<Integer>(true), pairs, iters / 8); |
106 |
|
*/ |
107 |
|
} |
108 |
|
|
109 |
< |
static abstract class Stage implements Callable { |
109 |
> |
abstract static class Stage implements Callable { |
110 |
|
final BlockingQueue<Integer> queue; |
111 |
|
final CyclicBarrier barrier; |
112 |
|
final int iters; |
113 |
< |
Stage (BlockingQueue<Integer> q, CyclicBarrier b, int iters) { |
113 |
> |
Stage(BlockingQueue<Integer> q, CyclicBarrier b, int iters) { |
114 |
|
queue = q; |
115 |
|
barrier = b; |
116 |
|
this.iters = iters; |
155 |
|
return new Integer(s); |
156 |
|
} |
157 |
|
} |
159 |
– |
|
160 |
– |
|
158 |
|
} |