Uses of Class
java.util.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 classAbstractList<E>AbstractListis an abstract implementation of theListinterface, optimized for a backing store which supports random access.classAbstractQueue<E>This class provides skeletal implementations of someQueueoperations.classAbstractSequentialList<E>AbstractSequentialList is an abstract implementation of the List interface.classAbstractSet<E>An AbstractSet is an abstract implementation of the Set interface.classArrayDeque<E>Resizable-array implementation of theDequeinterface.classArrayList<E>ArrayList is an implementation ofList, backed by an array.classEnumSet<E extends Enum<E>>An EnumSet is a specialized Set to be used with enums as keys.classHashSet<E>HashSet is an implementation of a Set.classLinkedHashSet<E>LinkedHashSet is a variant of HashSet.classLinkedList<E>LinkedList is an implementation ofList, backed by a doubly-linked list.classPriorityQueue<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.classStack<E>Stackis a Last-In/First-Out(LIFO) data structure which represents a stack of objects.classTreeSet<E>TreeSet is an implementation of SortedSet.classUnsafeArrayList<T>An array-backed list that exposes its array.classVector<E>Vector is an implementation ofList, 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 classArrayBlockingQueue<E>A bounded blocking queue backed by an array.classConcurrentLinkedDeque<E>An unbounded concurrent deque based on linked nodes.classConcurrentLinkedQueue<E>An unbounded thread-safe queue based on linked nodes.classConcurrentSkipListSet<E>A scalable concurrentNavigableSetimplementation based on aConcurrentSkipListMap.classCopyOnWriteArraySet<E>ASetthat uses an internalCopyOnWriteArrayListfor all of its operations.classDelayQueue<E extends Delayed>An unbounded blocking queue ofDelayedelements, in which an element can only be taken when its delay has expired.classLinkedBlockingDeque<E>An optionally-bounded blocking deque based on linked nodes.classLinkedBlockingQueue<E>An optionally-bounded blocking queue based on linked nodes.classLinkedTransferQueue<E>An unboundedTransferQueuebased on linked nodes.classPriorityBlockingQueue<E>An unbounded blocking queue that uses the same ordering rules as classPriorityQueueand supplies blocking retrieval operations.classSynchronousQueue<E>A blocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa.