Index
All Classes and Interfaces|All Packages|Serialized Form
A
- AbstractBuilder<E,
R> - Class in com.github.andrewoma.dexx.collection.internal.builder - AbstractBuilder() - Constructor for class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder
- AbstractDefaultTree<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - AbstractDefaultTree(K, V, Tree<K, V>, Tree<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.AbstractDefaultTree
- AbstractDerivedKeyTree<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - AbstractDerivedKeyTree(Tree<K, V>, Tree<K, V>, V) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.AbstractDerivedKeyTree
- AbstractIndexedList<E> - Class in com.github.andrewoma.dexx.collection.internal.base
- AbstractIndexedList() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractIndexedList
- AbstractIterable<E> - Class in com.github.andrewoma.dexx.collection.internal.base
- AbstractIterable() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractIterable
- AbstractLinkedList<E> - Class in com.github.andrewoma.dexx.collection.internal.base
- AbstractLinkedList() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractLinkedList
- AbstractList<E> - Class in com.github.andrewoma.dexx.collection.internal.base
- AbstractList() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractList
- AbstractMap<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.base - AbstractMap() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractMap
- AbstractSelfBuilder<E,
R> - Class in com.github.andrewoma.dexx.collection.internal.builder - AbstractSelfBuilder(R) - Constructor for class com.github.andrewoma.dexx.collection.internal.builder.AbstractSelfBuilder
- AbstractSet<E> - Class in com.github.andrewoma.dexx.collection.internal.base
- AbstractSet() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractSet
- AbstractSortedMap<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.base - AbstractSortedMap() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedMap
- AbstractSortedSet<E> - Class in com.github.andrewoma.dexx.collection.internal.base
- AbstractSortedSet() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedSet
- AbstractTraversable<E> - Class in com.github.andrewoma.dexx.collection.internal.base
- AbstractTraversable() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- AbstractTree<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - AbstractTree(Tree<K, V>, Tree<K, V>, V) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
- Adapters - Class in com.github.andrewoma.dexx.collection.internal.adapter
- Adapters() - Constructor for class com.github.andrewoma.dexx.collection.internal.adapter.Adapters
- add(E) - Method in interface com.github.andrewoma.dexx.collection.Builder
- add(E) - Method in class com.github.andrewoma.dexx.collection.HashSet
- add(E) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- add(E) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- add(E) - Method in interface com.github.andrewoma.dexx.collection.Set
-
Returns a set that adds the specified value if it doesn't already exist in this set.
- add(E) - Method in interface com.github.andrewoma.dexx.collection.SortedSet
- add(E) - Method in class com.github.andrewoma.dexx.collection.TreeSet
- add(E) - Method in class com.github.andrewoma.dexx.collection.VectorBuilder
- addAll(Traversable<E>) - Method in interface com.github.andrewoma.dexx.collection.Builder
- addAll(Traversable<E>) - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder
- addAll(E, E, E...) - Method in interface com.github.andrewoma.dexx.collection.Builder
- addAll(E, E, E...) - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder
- addAll(Iterable<E>) - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder
- addAll(Iterable<E>) - Method in interface com.github.andrewoma.dexx.collection.Builder
- addAll(Collection<? extends E>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- addAll(Collection<? extends E>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- addAll(Iterator<E>) - Method in interface com.github.andrewoma.dexx.collection.Builder
- addAll(Iterator<E>) - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder
- append(Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- append(E) - Method in class com.github.andrewoma.dexx.collection.ArrayList
- append(E) - Method in class com.github.andrewoma.dexx.collection.Cons
- append(E) - Method in class com.github.andrewoma.dexx.collection.ConsList
- append(E) - Method in interface com.github.andrewoma.dexx.collection.IndexedList
- append(E) - Method in interface com.github.andrewoma.dexx.collection.LinkedList
- append(E) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns a list with the specified element appended to the bottom of the list.
- append(E) - Method in class com.github.andrewoma.dexx.collection.Nil
- append(E) - Method in class com.github.andrewoma.dexx.collection.Vector
- apply0(ListMap<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- ArrayList<E> - Class in com.github.andrewoma.dexx.collection
-
ArrayList
is anIndexedList
implementation backed by an array. - ArrayList() - Constructor for class com.github.andrewoma.dexx.collection.ArrayList
- ArrayList(Object[]) - Constructor for class com.github.andrewoma.dexx.collection.ArrayList
- ArrayLists - Class in com.github.andrewoma.dexx.collection
-
ArrayLists
is the preferred method of constructing instances ofArrayList
. - ArrayLists() - Constructor for class com.github.andrewoma.dexx.collection.ArrayLists
- asList() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractList
- asList() - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns an immutable view of this list as an instance of
java.util.List
. - asMap() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractMap
- asMap() - Method in interface com.github.andrewoma.dexx.collection.Map
-
Returns an immutable view of this map as an instance of
Map
. - asSet() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSet
- asSet() - Method in interface com.github.andrewoma.dexx.collection.Set
-
Returns an immutable view of this set as an instance of
java.util.Set
. - asSortedMap() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedMap
- asSortedMap() - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns an immutable view of this map as an instance of
java.util.SortedMap
. - asSortedSet() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedSet
- asSortedSet() - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns an immutable view of this set as an instance of
java.util.SortedSet
.
B
- balance(K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- balanceLeft(boolean, K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- balanceRight(boolean, K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- balLeft(K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- balRight(K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- bitmap - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- black() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultBlackTree
- black() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultRedTree
- black() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyBlackTree
- black() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyRedTree
- black() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- black(K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultTreeFactory
- black(K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyFactory
- black(K, V, Tree<K, V>, Tree<K, V>) - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.TreeFactory
- blacken(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- BlackTree<K,
V> - Interface in com.github.andrewoma.dexx.collection.internal.redblack - blockIndex - Variable in class com.github.andrewoma.dexx.collection.VectorBuilder
- blockIndex - Variable in class com.github.andrewoma.dexx.collection.VectorIterator
- Break - Exception Class in com.github.andrewoma.dexx.collection.internal.base
- Break() - Constructor for exception class com.github.andrewoma.dexx.collection.internal.base.Break
- build() - Method in interface com.github.andrewoma.dexx.collection.Builder
- build() - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder
- builder() - Static method in class com.github.andrewoma.dexx.collection.ArrayLists
- builder() - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- builder() - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- builder() - Static method in class com.github.andrewoma.dexx.collection.Maps
- builder() - Static method in class com.github.andrewoma.dexx.collection.Sets
- builder() - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- builder() - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- builder(Comparator<? super E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- builder(Comparator<? super K>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- Builder<E,
R> - Interface in com.github.andrewoma.dexx.collection -
Builders
provide efficient implementations for incrementally building persistent collections. - BuilderFactory<E,
R> - Interface in com.github.andrewoma.dexx.collection -
BuilderFactory
defines a factory interface for creatingBuilder
instances. - built - Variable in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder
C
- checkRangeConvert(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- cleanLeftEdge(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- cleanRightEdge(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- clear() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- clear() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- clear() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- com.github.andrewoma.dexx.collection - package 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 - package com.github.andrewoma.dexx.collection.internal.adapter
- com.github.andrewoma.dexx.collection.internal.base - package com.github.andrewoma.dexx.collection.internal.base
- com.github.andrewoma.dexx.collection.internal.builder - package com.github.andrewoma.dexx.collection.internal.builder
- com.github.andrewoma.dexx.collection.internal.hashmap - package com.github.andrewoma.dexx.collection.internal.hashmap
- com.github.andrewoma.dexx.collection.internal.redblack - package com.github.andrewoma.dexx.collection.internal.redblack
- compactHashMap - Variable in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- compactHashMap - Variable in class com.github.andrewoma.dexx.collection.HashMap
- compactHashMap - Variable in class com.github.andrewoma.dexx.collection.HashSet
- CompactHashMap<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap - CompactHashMap() - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- CompactHashMapIterator<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap - CompactHashMapIterator(Object[], KeyFunction<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- CompactHashMapIterator.Pointer - Class in com.github.andrewoma.dexx.collection.internal.hashmap
- comparator() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedMapAdapter
- comparator() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedSetAdapter
- comparator() - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns the comparator associated with this map, or
null
if the default ordering is used. - comparator() - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns the comparator associated with this map, or
null
if the default ordering is used. - comparator() - Method in class com.github.andrewoma.dexx.collection.TreeMap
- comparator() - Method in class com.github.andrewoma.dexx.collection.TreeSet
- compareDepth(Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- component1 - Variable in class com.github.andrewoma.dexx.collection.Pair
- component1() - Method in class com.github.andrewoma.dexx.collection.Pair
- component2 - Variable in class com.github.andrewoma.dexx.collection.Pair
- component2() - Method in class com.github.andrewoma.dexx.collection.Pair
- computeHash(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- computeNext() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- cons(E, List<E>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- Cons<E> - Class in com.github.andrewoma.dexx.collection
-
Cons constructs a new list by prepending a new element to an existing list
- Cons(E, ConsList<E>) - Constructor for class com.github.andrewoma.dexx.collection.Cons
- ConsList<E> - Class in com.github.andrewoma.dexx.collection
-
ConsList
is a functionalLinkedList
implementation that constructs a list by prepending an element to another list. - ConsList() - Constructor for class com.github.andrewoma.dexx.collection.ConsList
- ConsListIterator<E> - Class in com.github.andrewoma.dexx.collection
- ConsListIterator(ConsList<E>) - Constructor for class com.github.andrewoma.dexx.collection.ConsListIterator
- construct(Pair<K, V>...) - Static method in class com.github.andrewoma.dexx.collection.Maps
- construct(Pair<K, V>...) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- construct(E...) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- construct(E...) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- construct(E...) - Static method in class com.github.andrewoma.dexx.collection.Sets
- construct(Comparator<? super E>, E...) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- construct(Comparator<? super K>, Pair<K, V>...) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- contains(Traversable<E>, Object) - Static method in class com.github.andrewoma.dexx.collection.internal.adapter.Adapters
- contains(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- contains(E) - Method in class com.github.andrewoma.dexx.collection.HashSet
- contains(E) - Method in interface com.github.andrewoma.dexx.collection.Set
-
Returns true if the value exists in this set.
- contains(E) - Method in class com.github.andrewoma.dexx.collection.TreeSet
- contains(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- contains(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- containsAll(Traversable<E>, Collection<?>) - Static method in class com.github.andrewoma.dexx.collection.internal.adapter.Adapters
- containsAll(Collection<?>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- containsAll(Collection<?>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- containsKey(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- containsKey(K) - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- containsKey(K) - Method in class com.github.andrewoma.dexx.collection.HashMap
- containsKey(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- containsKey(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- containsKey(K) - Method in interface com.github.andrewoma.dexx.collection.Map
-
Returns true if this map contains the specified key.
- containsKey(K) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- containsValue(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- copyLeft(Object[], int) - Method in class com.github.andrewoma.dexx.collection.Vector
- copyOf(Pair<K, V>[]) - Static method in class com.github.andrewoma.dexx.collection.Maps
- copyOf(Pair<K, V>[]) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- copyOf(E[]) - Static method in class com.github.andrewoma.dexx.collection.ArrayLists
- copyOf(E[]) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- copyOf(E[]) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- copyOf(E[]) - Static method in class com.github.andrewoma.dexx.collection.Sets
- copyOf(E[]) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOf(Iterable<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.Maps
- copyOf(Iterable<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- copyOf(Iterable<E>) - Static method in class com.github.andrewoma.dexx.collection.ArrayLists
- copyOf(Iterable<E>) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- copyOf(Iterable<E>) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- copyOf(Iterable<E>) - Static method in class com.github.andrewoma.dexx.collection.Sets
- copyOf(Iterable<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOf(Object[]) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- copyOf(Comparator<? super E>, Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOf(Comparator<? super E>, E[]) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOf(Comparator<? super E>, Iterable<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOf(Comparator<? super E>, Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOf(Comparator<? super K>, Pair<K, V>[]) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- copyOf(Comparator<? super K>, Iterable<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- copyOf(Comparator<? super K>, Iterator<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- copyOf(Iterator<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.Maps
- copyOf(Iterator<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- copyOf(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.ArrayLists
- copyOf(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- copyOf(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- copyOf(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.Sets
- copyOf(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOfTraversable(Traversable<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.Maps
- copyOfTraversable(Traversable<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- copyOfTraversable(Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.ArrayLists
- copyOfTraversable(Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- copyOfTraversable(Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- copyOfTraversable(Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.Sets
- copyOfTraversable(Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOfTraversable(Comparator<? super E>, Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- copyOfTraversable(Comparator<? super K>, Traversable<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- copyRange(Object[], int, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- copyRight(Object[], int) - Method in class com.github.andrewoma.dexx.collection.Vector
- count() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractDerivedKeyTree
- count() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
- count() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- count(Tree<?, ?>) - Static method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- createNode(K, V) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- current - Variable in class com.github.andrewoma.dexx.collection.ConsListIterator
- current - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
D
- DEFAULT_COMPARATOR - Static variable in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- DefaultBlackTree<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - DefaultBlackTree(K, V, Tree<K, V>, Tree<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.DefaultBlackTree
- DefaultRedTree<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - DefaultRedTree(K, V, Tree<K, V>, Tree<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.DefaultRedTree
- DefaultTreeFactory - Class in com.github.andrewoma.dexx.collection.internal.redblack
- DefaultTreeFactory() - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.DefaultTreeFactory
- del(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- delete(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- delLeft(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- delRight(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- depth - Variable in class com.github.andrewoma.dexx.collection.VectorPointer
- DerivedKeyBlackTree<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - DerivedKeyBlackTree(Tree<K, V>, Tree<K, V>, V) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyBlackTree
- DerivedKeyFactory - Class in com.github.andrewoma.dexx.collection.internal.redblack
- DerivedKeyFactory() - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyFactory
- DerivedKeyHashMap<K,
V> - Class in com.github.andrewoma.dexx.collection -
DerivedKeyHashMap
is aHashMap
variant where the key for theMap
is derived from the value stored. - DerivedKeyHashMap(KeyFunction<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- DerivedKeyHashMap(KeyFunction<K, V>, CompactHashMap<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- DerivedKeyRedTree<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - DerivedKeyRedTree(Tree<K, V>, Tree<K, V>, V) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyRedTree
- dirty - Variable in class com.github.andrewoma.dexx.collection.Vector
- display0 - Variable in class com.github.andrewoma.dexx.collection.VectorPointer
- display1 - Variable in class com.github.andrewoma.dexx.collection.VectorPointer
- display2 - Variable in class com.github.andrewoma.dexx.collection.VectorPointer
- display3 - Variable in class com.github.andrewoma.dexx.collection.VectorPointer
- display4 - Variable in class com.github.andrewoma.dexx.collection.VectorPointer
- display5 - Variable in class com.github.andrewoma.dexx.collection.VectorPointer
- doBuild() - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder
- doBuild() - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractSelfBuilder
- doBuild() - Method in class com.github.andrewoma.dexx.collection.VectorBuilder
- doDrop(Tree<K, V>, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- doFrom(Tree<K, V>, K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- doRange(Tree<K, V>, K, boolean, K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- doSlice(Tree<K, V>, int, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- doTake(Tree<K, V>, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- doUntil(Tree<K, V>, K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- drop(int) - Method in class com.github.andrewoma.dexx.collection.ArrayList
- drop(int) - Method in class com.github.andrewoma.dexx.collection.Cons
- drop(int) - Method in class com.github.andrewoma.dexx.collection.ConsList
- drop(int) - Method in interface com.github.andrewoma.dexx.collection.IndexedList
- drop(int) - Method in interface com.github.andrewoma.dexx.collection.LinkedList
- drop(int) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns a list containing all elements in this list, excluding the first
number
of elements. - drop(int) - Method in class com.github.andrewoma.dexx.collection.Nil
- drop(int) - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns a map containing all elements in this map, excluding the first
number
of elements. - drop(int) - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns a set containing all elements in this set, excluding the first
number
of elements. - drop(int) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- drop(int) - Method in class com.github.andrewoma.dexx.collection.TreeSet
- drop(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- drop(Tree<K, V>, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- dropBack0(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- dropFront0(int) - Method in class com.github.andrewoma.dexx.collection.Vector
E
- elements - Variable in class com.github.andrewoma.dexx.collection.ArrayList
- elemHashCode(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- elems - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- empty() - Static method in class com.github.andrewoma.dexx.collection.ArrayList
- empty() - Static method in class com.github.andrewoma.dexx.collection.ConsList
- empty() - Static method in class com.github.andrewoma.dexx.collection.HashMap
- empty() - Static method in class com.github.andrewoma.dexx.collection.HashSet
- empty() - Static method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- empty() - Static method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- empty() - Static method in class com.github.andrewoma.dexx.collection.TreeSet
- empty() - Static method in class com.github.andrewoma.dexx.collection.Vector
- EMPTY - Static variable in class com.github.andrewoma.dexx.collection.ArrayList
- EMPTY - Static variable in class com.github.andrewoma.dexx.collection.ConsList
- EMPTY - Static variable in class com.github.andrewoma.dexx.collection.HashMap
- EMPTY - Static variable in class com.github.andrewoma.dexx.collection.HashSet
- EMPTY - Static variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- EMPTY - Static variable in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- EMPTY - Static variable in class com.github.andrewoma.dexx.collection.TreeSet
- EMPTY - Static variable in class com.github.andrewoma.dexx.collection.Vector
- endIndex - Variable in class com.github.andrewoma.dexx.collection.Vector
- endIndex - Variable in class com.github.andrewoma.dexx.collection.VectorIterator
- endLo - Variable in class com.github.andrewoma.dexx.collection.VectorIterator
- ensureKv() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- EntriesIterator<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - EntriesIterator(Tree<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.EntriesIterator
- entrySet() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- equals(Object) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractList
- equals(Object) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractMap
- equals(Object) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSet
- equals(Object) - Method in class com.github.andrewoma.dexx.collection.Pair
F
- factory - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- factory() - Static method in class com.github.andrewoma.dexx.collection.ArrayList
- factory() - Static method in class com.github.andrewoma.dexx.collection.ArrayLists
- factory() - Static method in class com.github.andrewoma.dexx.collection.ConsList
- factory() - Static method in class com.github.andrewoma.dexx.collection.HashMap
- factory() - Static method in class com.github.andrewoma.dexx.collection.HashSet
- factory() - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- factory() - Static method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- factory() - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- factory() - Static method in class com.github.andrewoma.dexx.collection.Maps
- factory() - Static method in class com.github.andrewoma.dexx.collection.Sets
- factory() - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- factory() - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- factory() - Static method in class com.github.andrewoma.dexx.collection.Vector
- factory(KeyFunction<K, V>) - Static method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- factory(Comparator<? super E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- factory(Comparator<? super E>) - Static method in class com.github.andrewoma.dexx.collection.TreeSet
- factory(Comparator<? super K>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- factory(Comparator<? super K>, KeyFunction<K, V>) - Static method in class com.github.andrewoma.dexx.collection.TreeMap
- findDepth(List<Tree<K, V>>, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- findNext(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- first() - Method in class com.github.andrewoma.dexx.collection.ArrayList
- first() - Method in class com.github.andrewoma.dexx.collection.Cons
- first() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedSetAdapter
- first() - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns first element in the list or
null
if the list is empty. - first() - Method in class com.github.andrewoma.dexx.collection.Nil
- first() - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns the first entry in the map or
null
if the map is empty. - first() - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns the first element in the set or
null
of the set is empty. - first() - Method in class com.github.andrewoma.dexx.collection.TreeMap
- first() - Method in class com.github.andrewoma.dexx.collection.TreeSet
- first() - Method in class com.github.andrewoma.dexx.collection.Vector
- firstKey() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedMapAdapter
- focus - Variable in class com.github.andrewoma.dexx.collection.Vector
- forEach(Function<Pair<K, V>, U>) - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- forEach(Function<Pair<K, V>, U>) - Method in class com.github.andrewoma.dexx.collection.HashMap
- forEach(Function<Pair<K, V>, U>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- forEach(Function<Pair<K, V>, U>) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- forEach(Function<E, U>) - Method in class com.github.andrewoma.dexx.collection.HashSet
- forEach(Function<E, U>) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractIterable
- forEach(Function<E, U>) - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
All collection methods can be built upon this
forEach
definition. - forEach(Function<Pair<K, V>, U>, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- forEach(Function<Pair<K, V>, U>, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- forEach(Function<Pair<K, V>, U>, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
- forEach(Function<Pair<K, V>, U>, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- forEach(Tree<K, V>, Function<Pair<K, V>, U>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- forEach(Iterable<E>, Function<E, U>) - Static method in class com.github.andrewoma.dexx.collection.internal.base.Iterables
- from - Variable in class com.github.andrewoma.dexx.collection.internal.base.MappedIterable
- from(Tree<K, V>, K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- from(E, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedSet
- from(E, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns the bottom of the set starting from the key specified.
- from(E, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeSet
- from(K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedMap
- from(K, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns the bottom of the map starting from the key specified.
- from(K, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- Function<P,
R> - Interface in com.github.andrewoma.dexx.collection -
A generic function interface that takes a single parameter.
G
- get(int) - Method in class com.github.andrewoma.dexx.collection.ArrayList
- get(int) - Method in class com.github.andrewoma.dexx.collection.Cons
- get(int) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- get(int) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns the element at the specified index in this list (zero-based).
- get(int) - Method in class com.github.andrewoma.dexx.collection.Nil
- get(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- get(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- get(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- get(K) - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- get(K) - Method in class com.github.andrewoma.dexx.collection.HashMap
- get(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- get(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- get(K) - Method in interface com.github.andrewoma.dexx.collection.Map
-
Returns the value associated with the key or
null
if the no value exists with the key specified. - get(K) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- get(K, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- get0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- get0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- get0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
- get0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- getElem(int, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- getElem(int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- getElems() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- getKey() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- getKey() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- getKey(KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractDefaultTree
- getKey(KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractDerivedKeyTree
- getKey(KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
- getKey(KeyFunction<K, V>) - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- getKeyFunction() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- getLeft() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
- getLeft() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- getOrdering() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- getRight() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
- getRight() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- getValue() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- getValue() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- getValue() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
- getValue() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- gotoFreshPosWritable(int, int, int) - Method in class com.github.andrewoma.dexx.collection.Vector
- gotoFreshPosWritable0(int, int, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- gotoFreshPosWritable1(int, int, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- gotoNextBlockStart(int, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- gotoNextBlockStartWritable(int, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- gotoPos(int, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- gotoPosWritable(int, int, int) - Method in class com.github.andrewoma.dexx.collection.Vector
- gotoPosWritable0(int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- gotoPosWritable1(int, int, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- greatest(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
H
- hash - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- hash - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
- hashCode() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractList
- hashCode() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractMap
- hashCode() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSet
- hashCode() - Method in class com.github.andrewoma.dexx.collection.Pair
- HashMap<K,
V> - Class in com.github.andrewoma.dexx.collection -
HashMap
is an implementation ofMap
based on a hash trie. - HashMap() - Constructor for class com.github.andrewoma.dexx.collection.HashMap
- HashMap(CompactHashMap<K, Pair<K, V>>) - Constructor for class com.github.andrewoma.dexx.collection.HashMap
- HashMap.Itr<K,
V> - Class in com.github.andrewoma.dexx.collection - HashMap1<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap - HashMap1(K, int, V, Pair<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- HashMapCollision1<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap - HashMapCollision1(int, ListMap<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
- HashSet<E> - Class in com.github.andrewoma.dexx.collection
-
HashSet
is an implementation ofSet
backed by aHashMap
. - HashSet() - Constructor for class com.github.andrewoma.dexx.collection.HashSet
- HashSet(CompactHashMap<E, E>) - Constructor for class com.github.andrewoma.dexx.collection.HashSet
- HashTrieMap<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap - HashTrieMap(int, Object[], int) - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- hasNext() - Method in class com.github.andrewoma.dexx.collection.ConsListIterator
- hasNext() - Method in class com.github.andrewoma.dexx.collection.HashMap.Itr
- hasNext() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- hasNext() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMapIterator
- hasNext() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- hasNext() - Method in class com.github.andrewoma.dexx.collection.VectorIterator
- head - Variable in class com.github.andrewoma.dexx.collection.Cons
- headMap(K) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedMapAdapter
- headSet(E) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedSetAdapter
I
- IdentityKeyFunction<E> - Class in com.github.andrewoma.dexx.collection
-
IdentityKeyFunction
is aKeyFunction
where the value can be used as a key. - IdentityKeyFunction() - Constructor for class com.github.andrewoma.dexx.collection.IdentityKeyFunction
- improve(int) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- index - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- IndexedList<E> - Interface in com.github.andrewoma.dexx.collection
-
IndexedList
implementations guarantee fast random access to elements viaList.get(int)
. - IndexedLists - Class in com.github.andrewoma.dexx.collection
-
IndexedLists
is the preferred method of constructing instances ofIndexedList
. - IndexedLists() - Constructor for class com.github.andrewoma.dexx.collection.IndexedLists
- indexOf(E) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractList
- indexOf(E) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns the index of the first occurrence of the specified element in the list or -1 if there are no occurrences.
- initFrom(VectorPointer<E>) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- initFrom(VectorPointer<E>, int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- initIterator(VectorIterator<E>) - Method in class com.github.andrewoma.dexx.collection.Vector
- instance - Static variable in exception class com.github.andrewoma.dexx.collection.internal.base.Break
- invoke(P) - Method in interface com.github.andrewoma.dexx.collection.Function
- isBlack() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultBlackTree
- isBlack() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultRedTree
- isBlack() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyBlackTree
- isBlack() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyRedTree
- isBlack() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- isBlackTree(Tree<?, ?>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.ArrayList
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.Cons
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.Nil
- isEmpty() - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Returns true if this collection is empty.
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.TreeMap
- isEmpty() - Method in class com.github.andrewoma.dexx.collection.Vector
- isEmpty(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- isRed() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultBlackTree
- isRed() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultRedTree
- isRed() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyBlackTree
- isRed() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyRedTree
- isRed() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- isRedTree(Tree<?, ?>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- Iterable<E> - Interface in com.github.andrewoma.dexx.collection
-
Iterable
defines collections that can be accessed via anIterator
. - Iterables - Class in com.github.andrewoma.dexx.collection.internal.base
- Iterables() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.Iterables
- iterator - Variable in class com.github.andrewoma.dexx.collection.HashMap.Itr
- iterator() - Method in class com.github.andrewoma.dexx.collection.ArrayList
- iterator() - Method in class com.github.andrewoma.dexx.collection.ConsList
- iterator() - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- iterator() - Method in class com.github.andrewoma.dexx.collection.HashMap
- iterator() - Method in class com.github.andrewoma.dexx.collection.HashSet
- iterator() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- iterator() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- iterator() - Method in class com.github.andrewoma.dexx.collection.internal.base.MappedIterable
- iterator() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- iterator() - Method in interface com.github.andrewoma.dexx.collection.Iterable
- iterator() - Method in class com.github.andrewoma.dexx.collection.TreeMap
- iterator() - Method in class com.github.andrewoma.dexx.collection.TreeSet
- iterator() - Method in class com.github.andrewoma.dexx.collection.Vector
- iterator(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- iterator(KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- iterator(KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- iterator(KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
- iterator(KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- Itr(Iterator<Pair<K, Pair<K, V>>>) - Constructor for class com.github.andrewoma.dexx.collection.HashMap.Itr
K
- key - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- key - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- key - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractDefaultTree
- key(E) - Method in class com.github.andrewoma.dexx.collection.IdentityKeyFunction
- key(V) - Method in interface com.github.andrewoma.dexx.collection.KeyFunction
- keyFunction - Variable in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- keyFunction - Static variable in class com.github.andrewoma.dexx.collection.HashMap
- keyFunction - Static variable in class com.github.andrewoma.dexx.collection.HashSet
- keyFunction - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- keyFunction() - Method in class com.github.andrewoma.dexx.collection.HashMap
- keyFunction() - Method in class com.github.andrewoma.dexx.collection.HashSet
- KeyFunction<K,
V> - Interface in com.github.andrewoma.dexx.collection -
KeyFunction
defines the interface for extracting a key from a value. - keys() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractMap
- keys() - Method in interface com.github.andrewoma.dexx.collection.Map
-
Returns the keys for this map.
- keys() - Method in class com.github.andrewoma.dexx.collection.TreeMap
- keySet() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- keysIterator(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- KeysIterator<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - KeysIterator(Tree<K, V>, KeyFunction<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.KeysIterator
- kf - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.KeysIterator
- kf - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- kv - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- kvs - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
L
- last() - Method in class com.github.andrewoma.dexx.collection.ArrayList
- last() - Method in class com.github.andrewoma.dexx.collection.Cons
- last() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedSetAdapter
- last() - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns last element in the list or
null
if the list is empty. - last() - Method in class com.github.andrewoma.dexx.collection.Nil
- last() - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns the last entry in the map or
null
if the map is empty. - last() - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns the last element in the set or
null
of the set is empty. - last() - Method in class com.github.andrewoma.dexx.collection.TreeMap
- last() - Method in class com.github.andrewoma.dexx.collection.TreeSet
- last() - Method in class com.github.andrewoma.dexx.collection.Vector
- lastIndexOf(E) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractList
- lastIndexOf(E) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns the index of the last occurrence of the specified element in the list or -1 if there are no occurrences.
- lastKey() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedMapAdapter
- left - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
- leftMost - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.Zipper
- levelled - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.Zipper
- LinkedList<E> - Interface in com.github.andrewoma.dexx.collection
-
LinkedList
implementations guarantee fast access to the head viaList.first()
and tail viaLinkedList.tail()
. - LinkedLists - Class in com.github.andrewoma.dexx.collection
-
LinkedLists
is the preferred method of constructing instances ofLinkedList
. - LinkedLists() - Constructor for class com.github.andrewoma.dexx.collection.LinkedLists
- list - Variable in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- List<E> - Interface in com.github.andrewoma.dexx.collection
-
List
defines an sequence of elements where the order is preserved. - ListAdapater<E> - Class in com.github.andrewoma.dexx.collection.internal.adapter
- ListAdapater(List<E>) - Constructor for class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- listMap - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMapIterator
- ListMap<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap - ListMap() - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- ListMap.Node<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap - ListMapIterator<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap -
Note: this currently iterates in reverse order
- ListMapIterator(ListMap<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.ListMapIterator
- lo - Variable in class com.github.andrewoma.dexx.collection.VectorBuilder
- lo - Variable in class com.github.andrewoma.dexx.collection.VectorIterator
- lookup(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
M
- makeHashTrieMap(int, CompactHashMap<K, V>, int, CompactHashMap<K, V>, int, int) - Static method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- makeString(String) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- makeString(String) - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Returns this collection converted to a string by joining elements together with the specified
separator
. - makeString(String, String, String, int, String) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- makeString(String, String, String, int, String) - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Returns this collection converted to a string.
- map - Variable in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- map - Variable in class com.github.andrewoma.dexx.collection.internal.adapter.SortedMapAdapter
- Map<K,
V> - Interface in com.github.andrewoma.dexx.collection -
Map
defines the interface for maps that associate keys with values. - MapAdapter<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.adapter - MapAdapter(Map<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- mapFunction - Variable in class com.github.andrewoma.dexx.collection.internal.base.MappedIterable
- MappedIterable<T,
F> - Class in com.github.andrewoma.dexx.collection.internal.base - MappedIterable(Iterable<F>, Function<F, T>) - Constructor for class com.github.andrewoma.dexx.collection.internal.base.MappedIterable
- Maps - Class in com.github.andrewoma.dexx.collection
-
Maps
is the preferred method of constructing instances ofMap
. - Maps() - Constructor for class com.github.andrewoma.dexx.collection.Maps
- mkTree(boolean, K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
N
- newBuilder() - Method in interface com.github.andrewoma.dexx.collection.BuilderFactory
- next - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- next - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- next() - Method in class com.github.andrewoma.dexx.collection.ConsListIterator
- next() - Method in class com.github.andrewoma.dexx.collection.HashMap.Itr
- next() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- next() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMapIterator
- next() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- next() - Method in class com.github.andrewoma.dexx.collection.VectorIterator
- nextResult(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.EntriesIterator
- nextResult(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.KeysIterator
- nextResult(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- nextResult(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.ValuesIterator
- Nil<E> - Class in com.github.andrewoma.dexx.collection
-
Nil is the empty list
- Nil() - Constructor for class com.github.andrewoma.dexx.collection.Nil
- Node(K, V) - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- nullSlotAndCopy(Object[], int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
O
- objects - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator.Pointer
- of() - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of() - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of() - Static method in class com.github.andrewoma.dexx.collection.Maps
- of() - Static method in class com.github.andrewoma.dexx.collection.Sets
- of() - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of() - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E...) - Static method in class com.github.andrewoma.dexx.collection.ArrayLists
- of(E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(E, E, E, E, E, E, E, E, E, E, E...) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists
- of(E, E, E, E, E, E, E, E, E, E, E...) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists
- of(E, E, E, E, E, E, E, E, E, E, E...) - Static method in class com.github.andrewoma.dexx.collection.Sets
- of(E, E, E, E, E, E, E, E, E, E, E...) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E, E, E, E, E, E, E, E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super E>, E, E, E, E, E, E, E, E, E, E, E...) - Static method in class com.github.andrewoma.dexx.collection.SortedSets
- of(Comparator<? super K>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(Comparator<? super K>, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(Comparator<? super K>, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(Comparator<? super K>, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(Comparator<? super K>, K, V, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(Comparator<? super K>, K, V, K, V, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(K, V) - Static method in class com.github.andrewoma.dexx.collection.Maps
- of(K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.Maps
- of(K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.Maps
- of(K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(K, V, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.Maps
- of(K, V, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- of(K, V, K, V, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.Maps
- of(K, V, K, V, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- ordering - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
P
- p(K, V) - Static method in class com.github.andrewoma.dexx.collection.Maps
- p(K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps
- Pair<C1,
C2> - Class in com.github.andrewoma.dexx.collection -
Pair
is a generic container for two components of specified types. - Pair(C1, C2) - Constructor for class com.github.andrewoma.dexx.collection.Pair
- path - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- pointer - Variable in class com.github.andrewoma.dexx.collection.Vector
- pointer - Variable in class com.github.andrewoma.dexx.collection.VectorBuilder
- Pointer(Object[], int) - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator.Pointer
- popPath() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- pos - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator.Pointer
- preClean(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- prepend(E) - Method in class com.github.andrewoma.dexx.collection.ArrayList
- prepend(E) - Method in class com.github.andrewoma.dexx.collection.ConsList
- prepend(E) - Method in interface com.github.andrewoma.dexx.collection.IndexedList
- prepend(E) - Method in interface com.github.andrewoma.dexx.collection.LinkedList
- prepend(E) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns a list with the specified element prepended to the top of the list.
- prepend(E) - Method in class com.github.andrewoma.dexx.collection.Vector
- pushPath(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- put(K, V) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- put(K, V) - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- put(K, V) - Method in class com.github.andrewoma.dexx.collection.HashMap
- put(K, V) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- put(K, V) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- put(K, V) - Method in interface com.github.andrewoma.dexx.collection.Map
-
Returns a map with the value specified associated to the key specified.
- put(K, V) - Method in interface com.github.andrewoma.dexx.collection.SortedMap
- put(K, V) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- put(K, V, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- putAll(Map<? extends K, ? extends V>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
R
- range(int, boolean, int, boolean) - Method in class com.github.andrewoma.dexx.collection.ArrayList
- range(int, boolean, int, boolean) - Method in class com.github.andrewoma.dexx.collection.Cons
- range(int, boolean, int, boolean) - Method in class com.github.andrewoma.dexx.collection.ConsList
- range(int, boolean, int, boolean) - Method in interface com.github.andrewoma.dexx.collection.IndexedList
- range(int, boolean, int, boolean) - Method in interface com.github.andrewoma.dexx.collection.LinkedList
- range(int, boolean, int, boolean) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns a list containing a contiguous range of elements from this list.
- range(int, boolean, int, boolean) - Method in class com.github.andrewoma.dexx.collection.Nil
- range(int, boolean, int, boolean) - Method in class com.github.andrewoma.dexx.collection.Vector
- range(Tree<K, V>, K, boolean, K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- range(E, boolean, E, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns a subset of the set between the
from
andto
keys specified. - range(E, boolean, E, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeSet
- range(K, boolean, K, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns a subset of the map between the
from
andto
keys specified. - range(K, boolean, K, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- rebalance(Tree<K, V>, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- red() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultBlackTree
- red() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultRedTree
- red() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyBlackTree
- red() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyRedTree
- red() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree
- red(K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultTreeFactory
- red(K, V, Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DerivedKeyFactory
- red(K, V, Tree<K, V>, Tree<K, V>) - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.TreeFactory
- redBlackTree - Variable in class com.github.andrewoma.dexx.collection.TreeMap
- redBlackTree - Variable in class com.github.andrewoma.dexx.collection.TreeSet
- RedBlackTree<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - RedBlackTree() - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- RedBlackTree(TreeFactory, Comparator<? super K>, KeyFunction<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- RedTree<K,
V> - Interface in com.github.andrewoma.dexx.collection.internal.redblack - remove() - Method in class com.github.andrewoma.dexx.collection.ConsListIterator
- remove() - Method in class com.github.andrewoma.dexx.collection.HashMap.Itr
- remove() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- remove() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMapIterator
- remove() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- remove() - Method in class com.github.andrewoma.dexx.collection.VectorIterator
- remove(E) - Method in class com.github.andrewoma.dexx.collection.HashSet
- remove(E) - Method in interface com.github.andrewoma.dexx.collection.Set
-
Removes the specified value from the set if it exists.
- remove(E) - Method in interface com.github.andrewoma.dexx.collection.SortedSet
- remove(E) - Method in class com.github.andrewoma.dexx.collection.TreeSet
- remove(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- remove(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- remove(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- remove(K) - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- remove(K) - Method in class com.github.andrewoma.dexx.collection.HashMap
- remove(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- remove(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- remove(K) - Method in interface com.github.andrewoma.dexx.collection.Map
-
Returns a map with the value associated with the key removed if it exists.
- remove(K) - Method in interface com.github.andrewoma.dexx.collection.SortedMap
- remove(K) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- remove(K, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- removeAll(Collection<?>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- removeAll(Collection<?>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- removed0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- removed0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- removed0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
- removed0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- requiredDepth(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- result - Variable in class com.github.andrewoma.dexx.collection.internal.builder.AbstractSelfBuilder
- retainAll(Collection<?>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- retainAll(Collection<?>) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- right - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
S
- set - Variable in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- set - Variable in class com.github.andrewoma.dexx.collection.internal.adapter.SortedSetAdapter
- set(int, E) - Method in class com.github.andrewoma.dexx.collection.ArrayList
- set(int, E) - Method in class com.github.andrewoma.dexx.collection.Cons
- set(int, E) - Method in class com.github.andrewoma.dexx.collection.ConsList
- set(int, E) - Method in interface com.github.andrewoma.dexx.collection.IndexedList
- set(int, E) - Method in interface com.github.andrewoma.dexx.collection.LinkedList
- set(int, E) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns a list with the element set to the value specified at the index (zero-based).
- set(int, E) - Method in class com.github.andrewoma.dexx.collection.Nil
- set(int, E) - Method in class com.github.andrewoma.dexx.collection.Vector
- Set<E> - Interface in com.github.andrewoma.dexx.collection
-
Set defines the interface for a unique set of values as defined by
Object.equals(Object)
. - SetAdapater<E> - Class in com.github.andrewoma.dexx.collection.internal.adapter
- SetAdapater(Set<E>) - Constructor for class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- Sets - Class in com.github.andrewoma.dexx.collection
-
Sets
is the preferred method of constructing instances ofSet
. - Sets() - Constructor for class com.github.andrewoma.dexx.collection.Sets
- shiftTopLevel(int, int) - Method in class com.github.andrewoma.dexx.collection.Vector
- size - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- size() - Method in class com.github.andrewoma.dexx.collection.ArrayList
- size() - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap
- size() - Method in class com.github.andrewoma.dexx.collection.HashMap
- size() - Method in class com.github.andrewoma.dexx.collection.HashSet
- size() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- size() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- size() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- size() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- size() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- size() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- size() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
- size() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- size() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- size() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- size() - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Returns the size of the collection.
- size() - Method in class com.github.andrewoma.dexx.collection.TreeMap
- size() - Method in class com.github.andrewoma.dexx.collection.TreeSet
- size() - Method in class com.github.andrewoma.dexx.collection.Vector
- size0(ListMap<K, V>, int) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- slice(int, int) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- slice(int, int) - Method in class com.github.andrewoma.dexx.collection.Vector
- slice(Tree<K, V>, int, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- smallerDepth - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.Zipper
- smallest(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- SortedMap<K,
V> - Interface in com.github.andrewoma.dexx.collection -
SortedMap defines the interface for maps that are sorted by their key.
- SortedMapAdapter<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.adapter - SortedMapAdapter(SortedMap<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.adapter.SortedMapAdapter
- SortedMaps - Class in com.github.andrewoma.dexx.collection
-
SortedMaps
is the preferred method of constructing instances ofSortedMap
. - SortedMaps() - Constructor for class com.github.andrewoma.dexx.collection.SortedMaps
- SortedSet<E> - Interface in com.github.andrewoma.dexx.collection
-
SortedSet
defines the interface for sets that are sorted. - SortedSetAdapter<E> - Class in com.github.andrewoma.dexx.collection.internal.adapter
- SortedSetAdapter(SortedSet<E>) - Constructor for class com.github.andrewoma.dexx.collection.internal.adapter.SortedSetAdapter
- SortedSets - Class in com.github.andrewoma.dexx.collection
-
SortedSets
is the preferred method of constructing instances ofSortedSet
. - SortedSets() - Constructor for class com.github.andrewoma.dexx.collection.SortedSets
- splitAt(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- stabilize(int) - Method in class com.github.andrewoma.dexx.collection.VectorPointer
- stack - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- startIndex - Variable in class com.github.andrewoma.dexx.collection.Vector
- subIterator - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMapIterator
- subl(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- subMap(K, K) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedMapAdapter
- subSet(E, E) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedSetAdapter
T
- tail - Variable in class com.github.andrewoma.dexx.collection.Cons
- tail() - Method in class com.github.andrewoma.dexx.collection.ArrayList
- tail() - Method in class com.github.andrewoma.dexx.collection.Cons
- tail() - Method in class com.github.andrewoma.dexx.collection.ConsList
- tail() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- tail() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap
- tail() - Method in interface com.github.andrewoma.dexx.collection.LinkedList
- tail() - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns a list containing all elements in the list, excluding the first element.
- tail() - Method in class com.github.andrewoma.dexx.collection.Nil
- tail() - Method in class com.github.andrewoma.dexx.collection.Vector
- tailMap(K) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedMapAdapter
- tailSet(E) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SortedSetAdapter
- take(int) - Method in class com.github.andrewoma.dexx.collection.ArrayList
- take(int) - Method in class com.github.andrewoma.dexx.collection.Cons
- take(int) - Method in class com.github.andrewoma.dexx.collection.ConsList
- take(int) - Method in interface com.github.andrewoma.dexx.collection.IndexedList
- take(int) - Method in interface com.github.andrewoma.dexx.collection.LinkedList
- take(int) - Method in interface com.github.andrewoma.dexx.collection.List
-
Returns a list containing the first
number
of elements from this list. - take(int) - Method in class com.github.andrewoma.dexx.collection.Nil
- take(int) - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns a list containing the first
number
of elements from this list. - take(int) - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns a set containing the first
number
of elements from this set. - take(int) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- take(int) - Method in class com.github.andrewoma.dexx.collection.TreeSet
- take(int) - Method in class com.github.andrewoma.dexx.collection.Vector
- take(Tree<K, V>, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- to(Builder<E, R>) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- to(Builder<E, R>) - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Converts this collection to another collection using a builder.
- to(E, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedSet
- to(E, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedSet
-
Returns the top of the set up until the key specified.
- to(E, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeSet
- to(K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedMap
- to(K, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedMap
-
Returns the top of the map up until the key specified.
- to(K, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- toArray() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- toArray() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- toArray() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- toArray() - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Converts this collection to an array of objects.
- toArray(Traversable<E>, T[]) - Static method in class com.github.andrewoma.dexx.collection.internal.adapter.Adapters
- toArray(E[]) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- toArray(E[]) - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Converts this collection to an array of objects of the correct type.
- toArray(T[]) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater
- toArray(T[]) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater
- toIndexedList() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- toIndexedList() - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Converts this collection to an indexed list.
- toPair(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.TreeMap
- toSet() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- toSet() - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Converts this collection to a set.
- toSortedSet(Comparator<? super E>) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- toSortedSet(Comparator<? super E>) - Method in interface com.github.andrewoma.dexx.collection.Traversable
-
Converts this collection to a sorted set.
- toString() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable
- toString() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultBlackTree
- toString() - Method in class com.github.andrewoma.dexx.collection.internal.redblack.DefaultRedTree
- toString() - Method in class com.github.andrewoma.dexx.collection.Pair
- Traversable<E> - Interface in com.github.andrewoma.dexx.collection
-
Traversable
is the root of the collection hierarchy. - tree - Variable in class com.github.andrewoma.dexx.collection.TreeMap
- tree - Variable in class com.github.andrewoma.dexx.collection.TreeSet
- Tree<K,
V> - Interface in com.github.andrewoma.dexx.collection.internal.redblack - TreeFactory - Interface in com.github.andrewoma.dexx.collection.internal.redblack
- TreeIterator<K,
V, - Class in com.github.andrewoma.dexx.collection.internal.redblackR> - TreeIterator(Tree<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.TreeIterator
- TreeMap<K,
V> - Class in com.github.andrewoma.dexx.collection - TreeMap() - Constructor for class com.github.andrewoma.dexx.collection.TreeMap
- TreeMap(Tree<K, V>, RedBlackTree<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.TreeMap
- TreeMap(Comparator<? super K>, KeyFunction<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.TreeMap
- TreeSet<E> - Class in com.github.andrewoma.dexx.collection
-
TreeSet
is an implementation ofSortedSet
backed by aTreeMap
. - TreeSet() - Constructor for class com.github.andrewoma.dexx.collection.TreeSet
- TreeSet(Tree<E, E>, RedBlackTree<E, E>) - Constructor for class com.github.andrewoma.dexx.collection.TreeSet
- TreeSet(Comparator<? super E>) - Constructor for class com.github.andrewoma.dexx.collection.TreeSet
U
- until(Tree<K, V>, K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- unwrap(CompactHashMap<K, V>) - Static method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- unzip(List<Tree<K, V>>, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- unzipBoth(Tree<K, V>, Tree<K, V>, List<Tree<K, V>>, List<Tree<K, V>>, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- upd(Tree<K, V>, K, V, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- update(Tree<K, V>, K, V, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- updated0(K, int, int, V, Pair<K, V>, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
- updated0(K, int, int, V, Pair<K, V>, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- updated0(K, int, int, V, Pair<K, V>, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMapCollision1
- updated0(K, int, int, V, Pair<K, V>, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.HashTrieMap
- updNth(Tree<K, V>, int, K, V, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
V
- value - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.HashMap1
- value - Variable in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap.Node
- value - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.AbstractTree
- values() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter
- values() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractMap
- values() - Method in interface com.github.andrewoma.dexx.collection.Map
-
Returns the values for this map.
- values() - Method in class com.github.andrewoma.dexx.collection.TreeMap
- valuesIterator(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree
- ValuesIterator<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - ValuesIterator(Tree<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.ValuesIterator
- Vector<E> - Class in com.github.andrewoma.dexx.collection
-
Vector is a general-purpose, immutable data structure.
- Vector(int, int, int) - Constructor for class com.github.andrewoma.dexx.collection.Vector
- VectorBuilder<E> - Class in com.github.andrewoma.dexx.collection
- VectorBuilder() - Constructor for class com.github.andrewoma.dexx.collection.VectorBuilder
- VectorIterator<E> - Class in com.github.andrewoma.dexx.collection
- VectorIterator(int, int) - Constructor for class com.github.andrewoma.dexx.collection.VectorIterator
- VectorPointer<E> - Class in com.github.andrewoma.dexx.collection
- VectorPointer() - Constructor for class com.github.andrewoma.dexx.collection.VectorPointer
W
- wrap(Object, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap
Z
- zeroLeft(Object[], int) - Method in class com.github.andrewoma.dexx.collection.Vector
- zeroRight(Object[], int) - Method in class com.github.andrewoma.dexx.collection.Vector
- zipper - Variable in class com.github.andrewoma.dexx.collection.internal.redblack.Zipper
- Zipper<K,
V> - Class in com.github.andrewoma.dexx.collection.internal.redblack - Zipper(List<Tree<K, V>>, boolean, boolean, int) - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.Zipper
_
- _hasNext - Variable in class com.github.andrewoma.dexx.collection.VectorIterator
All Classes and Interfaces|All Packages|Serialized Form