| 1 |
tim |
1.1 |
package java.util.concurrent; |
| 2 |
|
|
|
| 3 |
|
|
import java.util.*; |
| 4 |
|
|
|
| 5 |
|
|
/** |
| 6 |
|
|
* An unbounded thread-safe queue based on linked nodes. |
| 7 |
|
|
* |
| 8 |
|
|
* <p> This implementation employs an efficient "wait-free" algorithm |
| 9 |
|
|
* using <tt>AtomicReferences</tt> (based on the described in <a |
| 10 |
|
|
* href="http://www.cs.rochester.edu/u/michael/PODC96.html"> Simple, |
| 11 |
|
|
* Fast, and Practical Non-Blocking and Blocking Concurrent Queue |
| 12 |
|
|
* Algorithms</a> by Maged M. Michael and Michael L. Scott.) |
| 13 |
|
|
* |
| 14 |
|
|
**/ |
| 15 |
|
|
public class LinkedQueue<E> extends AbstractCollection<E> |
| 16 |
|
|
implements Queue<E>, java.io.Serializable { |
| 17 |
|
|
|
| 18 |
|
|
public LinkedQueue() {} |
| 19 |
|
|
public boolean add(E x) { |
| 20 |
|
|
return false; |
| 21 |
|
|
} |
| 22 |
|
|
public boolean offer(E x) { |
| 23 |
|
|
return false; |
| 24 |
|
|
} |
| 25 |
|
|
public E remove() { |
| 26 |
|
|
return null; |
| 27 |
|
|
} |
| 28 |
|
|
public Iterator<E> iterator() { |
| 29 |
|
|
return null; |
| 30 |
|
|
} |
| 31 |
|
|
|
| 32 |
|
|
public boolean remove(Object x) { |
| 33 |
|
|
return false; |
| 34 |
|
|
} |
| 35 |
|
|
public E element() { |
| 36 |
|
|
return null; |
| 37 |
|
|
} |
| 38 |
|
|
public E poll() { |
| 39 |
|
|
return null; |
| 40 |
|
|
} |
| 41 |
|
|
public E peek() { |
| 42 |
|
|
return null; |
| 43 |
|
|
} |
| 44 |
|
|
public boolean isEmpty() { |
| 45 |
|
|
return false; |
| 46 |
|
|
} |
| 47 |
|
|
public int size() { |
| 48 |
|
|
return 0; |
| 49 |
|
|
} |
| 50 |
|
|
public Object[] toArray() { |
| 51 |
|
|
return null; |
| 52 |
|
|
} |
| 53 |
|
|
|
| 54 |
|
|
public <T> T[] toArray(T[] array) { |
| 55 |
|
|
return null; |
| 56 |
|
|
} |
| 57 |
|
|
|
| 58 |
|
|
} |
