Iterable

java.lang.Iterable<T>

Known Indirect Subclasses

AbstractCollection<E>, AbstractList<E>, AbstractQueue<E>, AbstractSequentialList<E>, AbstractSet<E>, ArrayDeque<E>, ArrayList<E>, Collection<E>, Deque<E>, HashSet<E>, LinkedHashSet<E>, LinkedList<E>, List<E>, NavigableSet<E>, PriorityQueue<E>, and 6 others.

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.
ArrayDeque<E>	An implementation of Deque, backed by an array.
ArrayList<E>	ArrayList is an implementation of `List`, backed by an array.
Collection<E>	`Collection` is the root of the collection hierarchy.
Deque<E>	A kind of collection that can insert or remove element at both ends("double ended queue").
HashSet<E>	HashSet is an implementation of a Set.
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.
NavigableSet<E>	NavigableSet is a SortedSet with navigation methods answering the closest matches for specified item.
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<T>	The `Stack` class represents a last-in-first-out (LIFO) stack of objects.
TreeSet<E>	TreeSet is an implementation of SortedSet.
Vector<E>	The `Vector` class implements a growable 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.

Public Methods

public abstract Iterator<T> iterator ()

Returns an Iterator for the elements in this object.

Returns

An Iterator instance.

Interfaces

Classes

Annotations