1 |
package java.util.concurrent; |
2 |
|
3 |
import java.util.*; |
4 |
|
5 |
/** |
6 |
* An unbounded queue based on linked nodes. |
7 |
**/ |
8 |
public class LinkedBlockingQueue<E> extends AbstractCollection<E> |
9 |
implements BlockingQueue<E>, java.io.Serializable { |
10 |
|
11 |
public LinkedBlockingQueue() {} |
12 |
public void put(E x) { |
13 |
} |
14 |
public boolean offer(E x, long timeout, TimeUnit granularity) { |
15 |
return false; |
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 E remove() { |
27 |
return null; |
28 |
} |
29 |
public Iterator<E> iterator() { |
30 |
return null; |
31 |
} |
32 |
|
33 |
public boolean remove(Object x) { |
34 |
return false; |
35 |
} |
36 |
public E element() { |
37 |
return null; |
38 |
} |
39 |
public E poll() { |
40 |
return null; |
41 |
} |
42 |
public E poll(long timeout, TimeUnit granularity) |
43 |
throws InterruptedException { |
44 |
return null; |
45 |
} |
46 |
public E peek() { |
47 |
return null; |
48 |
} |
49 |
public boolean isEmpty() { |
50 |
return false; |
51 |
} |
52 |
public int size() { |
53 |
return 0; |
54 |
} |
55 |
public Object[] toArray() { |
56 |
return null; |
57 |
} |
58 |
|
59 |
public <T> T[] toArray(T[] array) { |
60 |
return null; |
61 |
} |
62 |
} |
63 |
|