Flashcards in Concurrent Collections Deck (11):
This interface extends the Queue interface. If the queue is empty, it blocks until an element is inserted, and if the queue is full, it blocks until an element is remmoved.
This class provides a fixed size array based concrete implementation of the BlockingQueue interface.
This class provides a linked-list based implementation of the BlockingQueue interface.
This class implements BlockingQueue and consists of elements that are of type Delayed. An element can be retrieved from this queue only after its delay period.
Equivalent to java.util.PriorityQueue, but implements the BlockingQueue interface.
This class implements BlockingQueue. In this container, each insert() by a thread blocks for a corresponding remove() by another thread and vice versa.
Analogous to Hashtable, but with safe concurrent access and updates.
Analogous to TreeMap, but provides safe concurrent access and updates.
Analogous to TreeSet, but provides safe concurrent access and updates.
Similar to ArrayList, but provides safe concurrent access. When the ArrayList is updated, it creates a fresh copy of the underlying array.