|
Final | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use Iterable | |
|---|---|
| java.beans.beancontext | |
| java.util | |
| java.util.concurrent | Utility classes commonly useful in concurrent programming. |
| Uses of Iterable in java.beans.beancontext |
|---|
| Subinterfaces of Iterable in java.beans.beancontext | |
|---|---|
interface |
BeanContext
|
interface |
BeanContextServices
|
| Classes in java.beans.beancontext that implement Iterable | |
|---|---|
class |
BeanContextServicesSupport
This support class implements BeanContextServices interface. |
class |
BeanContextSupport
This support class implements BeanContext interface. |
| Uses of Iterable in java.util |
|---|
| Subinterfaces of Iterable in java.util | |
|---|---|
interface |
Collection<E>
Collection is the root of the collection hierarchy. |
interface |
List<E>
List is a collection which maintains an ordering for its elements. |
interface |
Queue<E>
Common interface for Queue implementations. |
interface |
Set<E>
Set is a collection which does not allow duplicate elements. |
interface |
SortedSet<E>
SortedSet is a Set which iterates its elements in sorted order. |
| Classes in java.util that implement Iterable | |
|---|---|
class |
AbstractCollection<E>
AbstractCollection is an abstract implementation of the Collection interface. |
class |
AbstractList<E>
AbstractList is an abstract implementation of the List interface, optimized for a backing store which supports random access. |
class |
AbstractQueue<E>
Abstract superclass for Queue implementations. |
class |
AbstractSequentialList<E>
AbstractSequentialList is an abstract implementation of the List interface. |
class |
AbstractSet<E>
AbstractSet is an abstract implementation of the Set iterface. |
class |
ArrayList<E>
ArrayList is an implemenation of List, backed by an array. |
class |
EnumSet<E extends Enum<E>>
Specialized set for enum types. |
class |
HashSet<E>
HashSet is an implementation of Set. |
class |
LinkedHashSet<E>
LinkedHashSet is a variant on HashSet. |
class |
LinkedList<E>
LinkedList is an implementation of List, backed by a linked list. |
class |
PriorityQueue<E>
Queue implementation which sorts its elements by Comparable
or by the given Comparator when specified in the constructor. |
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 |
Vector<E>
Vector is a variable size contiguous indexable array of Objects. |
| Uses of Iterable in java.util.concurrent |
|---|
| Subinterfaces of Iterable in java.util.concurrent | |
|---|---|
interface |
BlockingQueue<E>
A Queue that additionally supports operations
that wait for the queue to become non-empty when retrieving an element,
and wait for space to become available in the queue when storing an
element. |
| Classes in java.util.concurrent that implement Iterable | |
|---|---|
class |
ArrayBlockingQueue<E>
A bounded blocking queue backed by an array. |
class |
ConcurrentLinkedQueue<E>
An unbounded thread-safe queue based on linked nodes. |
class |
CopyOnWriteArrayList<E>
|
class |
CopyOnWriteArraySet<E>
A Set that uses 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 |
LinkedBlockingQueue<E>
An optionally-bounded blocking queue 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 put must wait for a take, and vice versa. |
|
Final | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||