Uses of Interface java.lang.Iterable

Uses in package javax.print.attribute.standard

Classes implementing java.lang.Iterable
class	JobStateReasons The `JobStateReasons` attribute provides the set of additional informations available about the current state of a print job.

Uses in package java.beans.beancontext

Classes implementing java.lang.Iterable
class	BeanContextServicesSupport This is a helper class for implementing a bean context which supplies services.
class	BeanContextSupport This is a helper class for implementing a bean context.

Uses in package javax.management

Classes implementing java.lang.Iterable
class	AttributeList Represents a list of MBean `Attribute`s, with their names and values.

Uses in package java.util.concurrent

Classes implementing java.lang.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	ConcurrentSkipListSet<E> A scalable concurrent `NavigableSet` implementation based on a `ConcurrentSkipListMap`.
class	CopyOnWriteArrayList<E> A thread-safe implementation of an ArrayList.
class	CopyOnWriteArraySet<E> 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	LinkedBlockingDeque<E> An optionally-bounded blocking deque based on linked nodes.
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 insert operation must wait for a corresponding remove operation by another thread, and vice versa.

Uses in package java.util

Classes implementing java.lang.Iterable
class	AbstractCollection<E> A basic implementation of most of the methods in the Collection interface to make it easier to create a collection.
class	AbstractList<E> A basic implementation of most of the methods in the List interface to make it easier to create a List based on a random-access data structure.
class	AbstractQueue<E> This class provides skeletal implementations of some `Queue` operations.
class	AbstractSequentialList<E> Abstract superclass to make it easier to implement the List interface when backed by a sequential-access store, such as a linked list.
class	AbstractSet<E> An abstract implementation of Set to make it easier to create your own implementations.
class	ArrayDeque<E> Resizable-array implementation of the `Deque` interface.
class	ArrayList<E> An array-backed implementation of the List interface.
class	EnumSet<T,extends,Enum,T> Provides an efficient mechanism for recording a set of enumeration constants.
class	HashSet<T> This class provides a HashMap-backed implementation of the Set interface.
class	LinkedHashSet<T> This class provides a hashtable-backed implementation of the Set interface, with predictable traversal order.
class	LinkedList<T> Linked list implementation of the List interface.
class	PriorityQueue<E>
class	ServiceLoader<S> Facilities for loading service providers.
class	Stack<T>
class	TreeSet<T> This class provides a TreeMap-backed implementation of the SortedSet interface.
class	Vector<T> The `Vector` classes implements growable arrays of Objects.