Uses of Class
java.util.AbstractCollection

Packages that use AbstractCollection

Package	Description
java.util	Back 2 Browser Bytecode Translator Copyright (C) 2012 Jaroslav Tulach This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, version 2 of the License.

Uses of AbstractCollection in java.util

Subclasses of AbstractCollection in java.util

Modifier and Type	Class and Description
class	AbstractList<E> This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "random access" data store (such as an array).
class	AbstractQueue<E> This class provides skeletal implementations of some Queue operations.
class	AbstractSequentialList<E> This class provides a skeletal implementation of the List interface to minimize the effort required to implement this interface backed by a "sequential access" data store (such as a linked list).
class	AbstractSet<E> This class provides a skeletal implementation of the Set interface to minimize the effort required to implement this interface.
class	ArrayDeque<E> Resizable-array implementation of the Deque interface.
class	ArrayList<E> Resizable-array implementation of the List interface.
class	EnumSet<E extends Enum<E>> A specialized Set implementation for use with enum types.
class	HashSet<E> This class implements the Set interface, backed by a hash table (actually a HashMap instance).
class	LinkedHashSet<E> Hash table and linked list implementation of the Set interface, with predictable iteration order.
class	LinkedList<E> Doubly-linked list implementation of the List and Deque interfaces.
class	PriorityQueue<E> An unbounded priority queue based on a priority heap.
class	Stack<E> The Stack class represents a last-in-first-out (LIFO) stack of objects.
class	TreeSet<E> A NavigableSet implementation based on a TreeMap.
class	Vector<E> The Vector class implements a growable array of objects.