1 |
package java.util.concurrent; |
2 |
|
3 |
import java.util.*; |
4 |
|
5 |
/** |
6 |
* A bounded queue based on a fixed-sized array. |
7 |
**/ |
8 |
public class ArrayBlockingQueue<E> extends AbstractCollection<E> |
9 |
implements BlockingQueue<E>, java.io.Serializable { |
10 |
|
11 |
public ArrayBlockingQueue(int capacity) {} |
12 |
|
13 |
public ArrayBlockingQueue(int capacity, Collection<E> initialElements) {} |
14 |
|
15 |
public void put(E x) throws InterruptedException { |
16 |
} |
17 |
public E take() throws InterruptedException { |
18 |
return null; |
19 |
} |
20 |
public boolean add(E x) { |
21 |
return false; |
22 |
} |
23 |
public boolean offer(E x) { |
24 |
return false; |
25 |
} |
26 |
public boolean remove(Object x) { |
27 |
return false; |
28 |
} |
29 |
public E remove() { |
30 |
return null; |
31 |
} |
32 |
public Iterator<E> iterator() { |
33 |
return null; |
34 |
} |
35 |
public E element() { |
36 |
return null; |
37 |
} |
38 |
public E poll() { |
39 |
return null; |
40 |
} |
41 |
public boolean offer(E x, long timeout, TimeUnit granularity) throws InterruptedException { |
42 |
return false; |
43 |
} |
44 |
public E poll(long timeout, TimeUnit granularity) throws InterruptedException { |
45 |
return null; |
46 |
} |
47 |
public E peek() { |
48 |
return null; |
49 |
} |
50 |
public boolean isEmpty() { |
51 |
return false; |
52 |
} |
53 |
public int size() { |
54 |
return 0; |
55 |
} |
56 |
|
57 |
/** |
58 |
* Return the capacity, i.e., number of elements that can be |
59 |
* <tt>put</tt> into this queue without blocking. |
60 |
**/ |
61 |
public int capacity() { |
62 |
return 0; |
63 |
} |
64 |
public Object[] toArray() { |
65 |
return null; |
66 |
} |
67 |
|
68 |
public <T> T[] toArray(T[] array) { |
69 |
return null; |
70 |
} |
71 |
|
72 |
} |