|
FlexDoc/Javadoc 2.0 Demo Java Doc |
Packages that use AbstractCollection |
|
Contains the collections framework, some internationalization support classes,
a service loader, properties, random number generation, string parsing
and scanning classes, base64 encoding and decoding, a bit array, and
several miscellaneous utility classes.
|
|
Utility classes commonly useful in concurrent programming.
|
Uses of AbstractCollection in java.util |
Subclasses of AbstractCollection in java.util |
|
abstract class |
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).
|
abstract class |
This class provides skeletal implementations of some Queue
operations.
|
abstract class |
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).
|
abstract class |
This class provides a skeletal implementation of the Set
interface to minimize the effort required to implement this
interface.
|
class |
Resizable-array implementation of the Deque interface.
|
class |
Resizable-array implementation of the List interface.
|
abstract class |
A specialized Set implementation for use with enum types.
|
class |
This class implements the Set interface, backed by a hash table
(actually a HashMap instance).
|
class |
Hash table and linked list implementation of the Set interface,
with predictable iteration order.
|
class |
Doubly-linked list implementation of the List and Deque
interfaces.
|
class |
An unbounded priority queue based on a priority heap.
|
class |
The Stack class represents a last-in-first-out
(LIFO) stack of objects.
|
class |
A NavigableSet implementation based on a TreeMap.
|
class |
The Vector class implements a growable array of
objects.
|
Uses of AbstractCollection in java.util.concurrent |
Subclasses of AbstractCollection in java.util.concurrent |
|
class |
A bounded blocking queue backed by an
array.
|
class |
An unbounded concurrent deque based on linked nodes.
|
class |
An unbounded thread-safe queue based on linked nodes.
|
class |
A scalable concurrent NavigableSet implementation based on
a ConcurrentSkipListMap.
|
class |
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 |
An optionally-bounded blocking deque based on
linked nodes.
|
class |
An optionally-bounded blocking queue based on
linked nodes.
|
class |
An unbounded TransferQueue based on linked nodes.
|
class |
An unbounded blocking queue that uses
the same ordering rules as class PriorityQueue and supplies
blocking retrieval operations.
|
class |
A blocking queue in which each insert
operation must wait for a corresponding remove operation by another
thread, and vice versa.
|
|
FlexDoc/Javadoc 2.0 Demo Java Doc |