|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use AbstractTraversable | |
|---|---|
| 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 AbstractTraversable in com.github.andrewoma.dexx.collection |
|---|
| Subclasses of AbstractTraversable in com.github.andrewoma.dexx.collection | |
|---|---|
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. |
| Uses of AbstractTraversable in com.github.andrewoma.dexx.collection.internal.base |
|---|
| Subclasses of AbstractTraversable in com.github.andrewoma.dexx.collection.internal.base | |
|---|---|
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>
|
| Uses of AbstractTraversable in com.github.andrewoma.dexx.collection.internal.hashmap |
|---|
| Subclasses of AbstractTraversable in com.github.andrewoma.dexx.collection.internal.hashmap | |
|---|---|
class |
ListMap<K,V>
|
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||