Uses of Interface
com.github.andrewoma.dexx.collection.Iterable
-
Packages that use Iterable Package Description 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 Modifier and Type Interface Description interface
IndexedList<E>
IndexedList
implementations guarantee fast random access to elements viaList.get(int)
.interface
LinkedList<E>
LinkedList
implementations guarantee fast access to the head viaList.first()
and tail viaLinkedList.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 byObject.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 Modifier and Type Class Description class
ArrayList<E>
ArrayList
is anIndexedList
implementation backed by an array.(package private) class
Cons<E>
Cons constructs a new list by prepending a new element to an existing listclass
ConsList<E>
ConsList
is a functionalLinkedList
implementation that constructs a list by prepending an element to another list.class
DerivedKeyHashMap<K,V>
DerivedKeyHashMap
is aHashMap
variant where the key for theMap
is derived from the value stored.class
HashMap<K,V>
HashMap
is an implementation ofMap
based on a hash trie.class
HashSet<E>
HashSet
is an implementation ofSet
backed by aHashMap
.(package private) class
Nil<E>
Nil is the empty listclass
TreeMap<K,V>
class
TreeSet<E>
TreeSet
is an implementation ofSortedSet
backed by aTreeMap
.class
Vector<E>
Vector is a general-purpose, immutable data structure.Methods in com.github.andrewoma.dexx.collection that return Iterable Modifier and Type Method Description @NotNull Iterable<K>
Map. keys()
Returns the keys for this map.@NotNull Iterable<K>
TreeMap. keys()
@NotNull Iterable<V>
Map. values()
Returns the values for this map.@NotNull 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 Modifier and Type Class Description class
AbstractIndexedList<E>
class
AbstractIterable<E>
class
AbstractLinkedList<E>
class
AbstractList<E>
class
AbstractMap<K,V>
class
AbstractSet<E>
class
AbstractSortedMap<K,V>
class
AbstractSortedSet<E>
class
MappedIterable<T,F>
Fields in com.github.andrewoma.dexx.collection.internal.base declared as Iterable Modifier and Type Field Description private Iterable<F>
MappedIterable. from
Methods in com.github.andrewoma.dexx.collection.internal.base that return Iterable Modifier and Type Method Description Iterable<K>
AbstractMap. keys()
Iterable<V>
AbstractMap. values()
Constructors in com.github.andrewoma.dexx.collection.internal.base with parameters of type Iterable Constructor Description 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 Modifier and Type Class Description class
ListMap<K,V>
(package private) class
ListMap.Node<K,V>
-