Uses of Interface
com.github.andrewoma.dexx.collection.Iterable

Packages that use Iterable
com.github.andrewoma.dexx.collection Dexx collections are a port of Scala's immutable, persistent collection classes to pure Java. 
com.github.andrewoma.dexx.collection.internal.base   
com.github.andrewoma.dexx.collection.internal.hashmap   
 

Uses of Iterable in com.github.andrewoma.dexx.collection
 

Subinterfaces of Iterable in com.github.andrewoma.dexx.collection
 interface IndexedList<E>
          IndexedList implementations guarantee fast random access to elements via List.get(int).
 interface LinkedList<E>
          LinkedList implementations guarantee fast access to the head via List.first() and tail via LinkedList.tail().
 interface List<E>
          List defines an sequence of elements where the order is preserved.
 interface Map<K,V>
          Map defines the interface for maps that associate keys with values.
 interface Set<E>
          Set defines the interface for a unique set of values as defined by Object.equals(Object).
 interface SortedMap<K,V>
          SortedMap defines the interface for maps that are sorted by their key.
 interface SortedSet<E>
          SortedSet defines the interface for sets that are sorted.
 

Classes in com.github.andrewoma.dexx.collection that implement Iterable
 class ArrayList<E>
          ArrayList is an IndexedList implementation backed by an array.
 class ConsList<E>
          ConsList is a functional LinkedList implementation that constructs a list by prepending an element to another list.
 class DerivedKeyHashMap<K,V>
          DerivedKeyHashMap is a HashMap variant where the key for the Map is derived from the value stored.
 class HashMap<K,V>
          HashMap is an implementation of Map based on a hash trie.
 class HashSet<E>
          HashSet is an implementation of Set backed by a HashMap.
 class TreeMap<K,V>
          TreeMap is an implementation of SortedMap based on a red-black tree.
 class TreeSet<E>
          TreeSet is an implementation of SortedSet backed by a TreeMap.
 class Vector<E>
          Vector is a general-purpose, immutable data structure.
 

Methods in com.github.andrewoma.dexx.collection that return Iterable
 Iterable<K> Map.keys()
          Returns the keys for this map.
 Iterable<K> TreeMap.keys()
           
 Iterable<V> Map.values()
          Returns the values for this map.
 Iterable<V> TreeMap.values()
           
 

Uses of Iterable in com.github.andrewoma.dexx.collection.internal.base
 

Classes in com.github.andrewoma.dexx.collection.internal.base that implement Iterable
 class AbstractIndexedList<E>
           
 class AbstractLinkedList<E>
           
 class AbstractList<E>
           
 class AbstractMap<K,V>
           
 class AbstractSet<E>
           
 class AbstractSortedMap<K,V>
           
 class AbstractSortedSet<E>
           
 

Methods in com.github.andrewoma.dexx.collection.internal.base that return Iterable
 Iterable<K> AbstractMap.keys()
           
 Iterable<V> AbstractMap.values()
           
 

Constructors in com.github.andrewoma.dexx.collection.internal.base with parameters of type Iterable
MappedIterable(Iterable<F> from, Function<F,T> mapFunction)
           
 

Uses of Iterable in com.github.andrewoma.dexx.collection.internal.hashmap
 

Classes in com.github.andrewoma.dexx.collection.internal.hashmap that implement Iterable
 class ListMap<K,V>
           
 



Copyright © 2014. All Rights Reserved.