Iterable

java.lang.Iterable<T>

Known Indirect Subclasses

AbstractCollection<E>, AbstractList<E>, AbstractQueue<E>, AbstractSequentialList<E>, AbstractSet<E>, ArrayBlockingQueue<E>, ArrayList<E>, BlockingQueue<E>, Collection<E>, ConcurrentLinkedQueue<E>, CopyOnWriteArrayList<E>, CopyOnWriteArraySet<E>, CursorJoiner, DelayQueue<E extends Delayed>, EnumSet<E extends Enum<E>>, HashSet<E>, LinkedBlockingQueue<E>, LinkedHashSet<E>, LinkedList<E>, List<E>, PriorityBlockingQueue<E>, PriorityQueue<E>, Queue<E>, Set<E>, SortedSet<E>, Stack<E>, SynchronousQueue<E>, TextUtils.SimpleStringSplitter, TextUtils.StringSplitter, TreeSet<E>, Vector<E>

AbstractCollection<E>	Class `AbstractCollection` is an abstract implementation of the `Collection` interface.
AbstractList<E>	`AbstractList` is an abstract implementation of the `List` interface, optimized for a backing store which supports random access.
AbstractQueue<E>	AbstractQueue is an abstract class which implements some of the methods in Queue.
AbstractSequentialList<E>	AbstractSequentialList is an abstract implementation of the List interface.
AbstractSet<E>	An AbstractSet is an abstract implementation of the Set interface.
ArrayBlockingQueue<E>	A bounded blocking queue backed by an array.
ArrayList<E>	ArrayList is an implementation of List, backed by an array.
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.
Collection<E>	`Collection` is the root of the collection hierarchy.
ConcurrentLinkedQueue<E>	An unbounded thread-safe queue based on linked nodes.
CopyOnWriteArrayList<E>	Implements a ArrayList variant that is thread-safe.
CopyOnWriteArraySet<E>	A Set that uses CopyOnWriteArrayList for all of its operations.
CursorJoiner	Does a join on two cursors using the specified columns.
DelayQueue<E extends Delayed>	An unbounded blocking queue of `Delayed` elements, in which an element can only be taken when its delay has expired.
EnumSet<E extends Enum<E>>	An EnumSet is a specialized Set to be used with enums as keys.
HashSet<E>	HashSet is an implementation of a Set.
LinkedBlockingQueue<E>	An optionally-bounded blocking queue based on linked nodes.
LinkedHashSet<E>	LinkedHashSet is a variant of HashSet.
LinkedList<E>	LinkedList is an implementation of List, backed by a linked list.
List<E>	A `List` is a collection which maintains an ordering for its elements.
PriorityBlockingQueue<E>	An unbounded blocking queue that uses the same ordering rules as class PriorityQueue and supplies blocking retrieval operations.
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.
Queue<E>	This kind of collection provides advanced operations compared to basic collections, such as insertion, extraction, and inspection.
Set<E>	A `Set` is a data structure which does not allow duplicate elements.
SortedSet<E>	SortedSet is a Set which iterates over its elements in a sorted order.
Stack<E>	`Stack` is a Last-In/First-Out(LIFO) data structure which represents a stack of objects.
SynchronousQueue<E>	A blocking queue in which each `put` must wait for a `take`, and vice versa.
TextUtils.SimpleStringSplitter	A simple string splitter.
TextUtils.StringSplitter	An interface for splitting strings according to rules that are opaque to the user of this interface.
TreeSet<E>	TreeSet is an implementation of SortedSet.
Vector<E>	Vector is a variable size contiguous indexable array of objects.

Class Overview

Objects of classes that implement this interface can be used within a foreach statement.

Summary

Public Methods
abstract Iterator<T>	iterator() Returns an Iterator for the elements in this object.

Mar	APR	May
	30
2008	2009	2010

Interfaces

Classes

Enums

Exceptions

Errors

Iterable

Class Overview

Summary

Public Methods

public abstract Iterator<T> iterator ()

Returns