An unbounded {@link TransferQueue} based on linked nodes.This queue orders elements FIFO (first-in-first-out) with respect to any given producer. The
head of the queue is that element that has been on the queue the longest time for some producer. The
tail of the queue is that element that has been on the queue the shortest time for some producer.
Beware that, unlike in most collections, the {@code size}method is NOT a constant-time operation. Because of the asynchronous nature of these queues, determining the current number of elements requires a traversal of the elements.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces.
Memory consistency effects: As with other concurrent collections, actions in a thread prior to placing an object into a {@code LinkedTransferQueue}happen-before actions subsequent to the access or removal of that element from the {@code LinkedTransferQueue} in another thread.
This class is a member of the Java Collections Framework.
@since 1.7
@author Doug Lea
@param < E> the type of elements held in this collection