1 |
import java.util.*; |
2 |
import java.util.concurrent.*; |
3 |
import java.util.concurrent.locks.*; |
4 |
|
5 |
public class SynchronizedLinkedListQueue<E> |
6 |
extends AbstractCollection<E> implements Queue<E> { |
7 |
private final Queue<E> q = new LinkedList<E>(); |
8 |
|
9 |
public synchronized Iterator<E> iterator() { |
10 |
return q.iterator(); |
11 |
} |
12 |
|
13 |
public synchronized boolean isEmpty() { |
14 |
return q.isEmpty(); |
15 |
} |
16 |
public synchronized int size() { |
17 |
return q.size(); |
18 |
} |
19 |
public synchronized boolean offer(E o) { |
20 |
return q.offer(o); |
21 |
} |
22 |
public synchronized boolean add(E o) { |
23 |
return q.add(o); |
24 |
} |
25 |
public synchronized E poll() { |
26 |
return q.poll(); |
27 |
} |
28 |
public synchronized E remove() { |
29 |
return q.remove(); |
30 |
} |
31 |
public synchronized E peek() { |
32 |
return q.peek(); |
33 |
} |
34 |
public synchronized E element() { |
35 |
return q.element(); |
36 |
} |
37 |
|
38 |
public synchronized boolean contains(Object o) { |
39 |
return q.contains(o); |
40 |
} |
41 |
public synchronized Object[] toArray() { |
42 |
return q.toArray(); |
43 |
} |
44 |
public synchronized <T> T[] toArray(T[] a) { |
45 |
return q.toArray(a); |
46 |
} |
47 |
public synchronized boolean remove(Object o) { |
48 |
return q.remove(o); |
49 |
} |
50 |
|
51 |
public synchronized boolean containsAll(Collection<?> coll) { |
52 |
return q.containsAll(coll); |
53 |
} |
54 |
public synchronized boolean addAll(Collection<? extends E> coll) { |
55 |
return q.addAll(coll); |
56 |
} |
57 |
public synchronized boolean removeAll(Collection<?> coll) { |
58 |
return q.removeAll(coll); |
59 |
} |
60 |
public synchronized boolean retainAll(Collection<?> coll) { |
61 |
return q.retainAll(coll); |
62 |
} |
63 |
public synchronized void clear() { |
64 |
q.clear(); |
65 |
} |
66 |
public synchronized String toString() { |
67 |
return q.toString(); |
68 |
} |
69 |
|
70 |
} |
71 |
|