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

Packages that use Traversable

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.adapter
com.github.andrewoma.dexx.collection.internal.base
com.github.andrewoma.dexx.collection.internal.builder
com.github.andrewoma.dexx.collection.internal.hashmap

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

Subinterfaces of Traversable in com.github.andrewoma.dexx.collection

interface	IndexedList<E> IndexedList implementations guarantee fast random access to elements via List.get(int).
interface	Iterable<E> Iterable defines collections that can be accessed via an Iterator.
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 Traversable

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 with type parameters of type Traversable

<R extends Traversable<E>> R

Traversable.to(Builder<E,R> builder) Converts this collection to another collection using a builder.

Methods in com.github.andrewoma.dexx.collection with parameters of type Traversable

Builder<E,R>	Builder.addAll(Traversable<E> elements)
static <E> SortedSet<E>	SortedSets.copyOf(Comparator<? super E> comparator, Traversable<E> traversable)
static <E> SortedSet<E>	SortedSets.copyOfTraversable(Comparator<? super E> comparator, Traversable<E> traversable)
static <K,V> SortedMap<K,V>	SortedMaps.copyOfTraversable(Comparator<? super K> comparator, Traversable<Pair<K,V>> traversable)
static <E> IndexedList<E>	IndexedLists.copyOfTraversable(Traversable<E> traversable)
static <E> LinkedList<E>	LinkedLists.copyOfTraversable(Traversable<E> traversable)
static <E> Set<E>	Sets.copyOfTraversable(Traversable<E> traversable)
static <E> SortedSet<E>	SortedSets.copyOfTraversable(Traversable<E> traversable)
static <K extends Comparable<? super K>,V> SortedMap<K,V>	SortedMaps.copyOfTraversable(Traversable<Pair<K,V>> traversable)
static <K,V> Map<K,V>	Maps.copyOfTraversable(Traversable<Pair<K,V>> traversable)

Uses of Traversable in com.github.andrewoma.dexx.collection.internal.adapter

Methods in com.github.andrewoma.dexx.collection.internal.adapter with parameters of type Traversable

static <E> boolean	Adapters.contains(Traversable<E> traversable, Object o)
static <E> boolean	Adapters.containsAll(Traversable<E> traversable, Collection<?> c)
static <T,E> T[]	Adapters.toArray(Traversable<E> traversable, T[] a)

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

Classes in com.github.andrewoma.dexx.collection.internal.base that implement Traversable

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	AbstractTraversable<E>
class	MappedIterable<T,F>

Methods in com.github.andrewoma.dexx.collection.internal.base with type parameters of type Traversable

<R extends Traversable<E>> R

AbstractTraversable.to(Builder<E,R> builder)

Uses of Traversable in com.github.andrewoma.dexx.collection.internal.builder

Methods in com.github.andrewoma.dexx.collection.internal.builder with parameters of type Traversable

Builder<E,R>

AbstractBuilder.addAll(Traversable<E> elements)

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

Classes in com.github.andrewoma.dexx.collection.internal.hashmap that implement Traversable

class

ListMap<K,V>