Uses of Class
java.util.AbstractCollection

Packages that use AbstractCollection

Package	Description
java.util
java.util.concurrent	Utility classes commonly useful in concurrent programming.

Uses of AbstractCollection in java.util

Subclasses of AbstractCollection in java.util

Modifier and Type	Class	Description
class	AbstractList<E>	AbstractList is an abstract implementation of the List interface, optimized for a backing store which supports random access.
class	AbstractQueue<E>	This class provides skeletal implementations of some Queue operations.
class	AbstractSequentialList<E>	AbstractSequentialList is an abstract implementation of the List interface.
class	AbstractSet<E>	An AbstractSet is an abstract implementation of the Set interface.
class	ArrayDeque<E>	Resizable-array implementation of the Deque interface.
class	ArrayList<E>	ArrayList is an implementation of List, backed by an array.
class	EnumSet<E extends Enum<E>>	An EnumSet is a specialized Set to be used with enums as keys.
class	HashSet<E>	HashSet is an implementation of a Set.
class	LinkedHashSet<E>	LinkedHashSet is a variant of HashSet.
class	LinkedList<E>	LinkedList is an implementation of List, backed by a doubly-linked list.
class	PriorityQueue<E>	A PriorityQueue holds elements on a priority heap, which orders the elements according to their natural order or according to the comparator specified at construction time.
class	Stack<E>	Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of objects.
class	TreeSet<E>	TreeSet is an implementation of SortedSet.
class	UnsafeArrayList<T>	An array-backed list that exposes its array.
class	Vector<E>	Vector is an implementation of List, backed by an array and synchronized.

Uses of AbstractCollection in java.util.concurrent

Subclasses of AbstractCollection in java.util.concurrent

Modifier and Type	Class	Description
class	ArrayBlockingQueue<E>	A bounded blocking queue backed by an array.
class	ConcurrentLinkedDeque<E>	An unbounded concurrent deque based on linked nodes.
class	ConcurrentLinkedQueue<E>	An unbounded thread-safe queue based on linked nodes.
class	ConcurrentSkipListSet<E>	A scalable concurrent NavigableSet implementation based on a ConcurrentSkipListMap.
class	CopyOnWriteArraySet<E>	A Set that uses an internal CopyOnWriteArrayList for all of its operations.
class	DelayQueue<E extends Delayed>	An unbounded blocking queue of Delayed elements, in which an element can only be taken when its delay has expired.
class	LinkedBlockingDeque<E>	An optionally-bounded blocking deque based on linked nodes.
class	LinkedBlockingQueue<E>	An optionally-bounded blocking queue based on linked nodes.
class	LinkedTransferQueue<E>	An unbounded TransferQueue based on linked nodes.
class	PriorityBlockingQueue<E>	An unbounded blocking queue that uses the same ordering rules as class PriorityQueue and supplies blocking retrieval operations.
class	SynchronousQueue<E>	A blocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa.