18 |
|
import java.util.concurrent.atomic.AtomicReference; |
19 |
|
|
20 |
|
/** |
21 |
< |
* An unbounded {@linkplain TransferQueue} based on linked nodes. |
21 |
> |
* An unbounded {@link TransferQueue} based on linked nodes. |
22 |
|
* This queue orders elements FIFO (first-in-first-out) with respect |
23 |
|
* to any given producer. The <em>head</em> of the queue is that |
24 |
|
* element that has been on the queue the longest time for some |
848 |
|
} |
849 |
|
} |
850 |
|
|
851 |
+ |
/** |
852 |
+ |
* Removes a single instance of the specified element from this queue, |
853 |
+ |
* if it is present. More formally, removes an element {@code e} such |
854 |
+ |
* that {@code o.equals(e)}, if this queue contains one or more such |
855 |
+ |
* elements. |
856 |
+ |
* Returns {@code true} if this queue contained the specified element |
857 |
+ |
* (or equivalently, if this queue changed as a result of the call). |
858 |
+ |
* |
859 |
+ |
* @param o element to be removed from this queue, if present |
860 |
+ |
* @return {@code true} if this queue changed as a result of the call |
861 |
+ |
*/ |
862 |
|
public boolean remove(Object o) { |
863 |
|
if (o == null) |
864 |
|
return false; |