A B C D E F G H I K L M N O P R S T U V W

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

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

addAll(Traversable<E>) - Method in interface com.github.andrewoma.dexx.collection.Builder

addAll(Iterable<E>) - Method in interface com.github.andrewoma.dexx.collection.Builder

addAll(Iterator<E>) - Method in interface com.github.andrewoma.dexx.collection.Builder

addAll(E, E, 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(Traversable<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(Iterator<E>) - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder

addAll(E, E, E...) - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder

append(E) - Method in class com.github.andrewoma.dexx.collection.ArrayList

append(E) - Method in class com.github.andrewoma.dexx.collection.ConsList

append(E) - Method in interface com.github.andrewoma.dexx.collection.IndexedList

append(Tree<K, V>, Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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.Vector

ArrayList<E> - Class in com.github.andrewoma.dexx.collection

ArrayList is an IndexedList implementation backed by an array.

ArrayList() - Constructor for class com.github.andrewoma.dexx.collection.ArrayList

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

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() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree

black(K, V, Tree<K, V>, Tree<K, V>) - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.TreeFactory

BlackTree<K,V> - Interface in com.github.andrewoma.dexx.collection.internal.redblack

Break - Exception in com.github.andrewoma.dexx.collection.internal.base

Break() - Constructor for exception 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<E,R> - Interface in com.github.andrewoma.dexx.collection

Builders provide efficient implementations for incrementally building persistent collections.

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(Comparator<? super K>) - 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

BuilderFactory<E,R> - Interface in com.github.andrewoma.dexx.collection

BuilderFactory defines a factory interface for creating Builder instances.

C

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<K,V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap

CompactHashMap() - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

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

component1() - Method 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

ConsList<E> - Class in com.github.andrewoma.dexx.collection

ConsList is a functional LinkedList implementation that constructs a list by prepending an element to another list.

ConsList() - Constructor for class com.github.andrewoma.dexx.collection.ConsList

contains(E) - Method in class com.github.andrewoma.dexx.collection.HashSet

contains(Traversable<E>, Object) - Static method in class com.github.andrewoma.dexx.collection.internal.adapter.Adapters

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

contains(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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

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(K) - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap

containsKey(K) - Method in class com.github.andrewoma.dexx.collection.HashMap

containsKey(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter

containsKey(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap

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

copyOf(Iterable<E>) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists

copyOf(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists

copyOf(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(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists

copyOf(E[]) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists

copyOf(Iterable<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.Maps

copyOf(Pair<K, V>[]) - Static method in class com.github.andrewoma.dexx.collection.Maps

copyOf(Iterable<E>) - Static method in class com.github.andrewoma.dexx.collection.Sets

copyOf(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.Sets

copyOf(E[]) - Static method in class com.github.andrewoma.dexx.collection.Sets

copyOf(Iterable<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.SortedMaps

copyOf(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(Comparator<? super K>, 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.SortedSets

copyOf(Iterator<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets

copyOf(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 E>, Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets

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<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.Maps

copyOfTraversable(Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.Sets

copyOfTraversable(Traversable<Pair<K, V>>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps

copyOfTraversable(Comparator<? super K>, 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.SortedSets

copyOfTraversable(Comparator<? super E>, Traversable<E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets

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(Tree<?, ?>) - Static method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

count() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree

createNode(K, V) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap

D

DefaultTreeFactory - Class in com.github.andrewoma.dexx.collection.internal.redblack

DefaultTreeFactory() - Constructor for class com.github.andrewoma.dexx.collection.internal.redblack.DefaultTreeFactory

delete(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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 a HashMap variant where the key for the Map is derived from the value stored.

DerivedKeyHashMap(KeyFunction<K, V>) - Constructor for class com.github.andrewoma.dexx.collection.DerivedKeyHashMap

doBuild() - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractBuilder

doBuild() - Method in class com.github.andrewoma.dexx.collection.internal.builder.AbstractSelfBuilder

drop(int) - Method in class com.github.andrewoma.dexx.collection.ArrayList

drop(int) - Method in class com.github.andrewoma.dexx.collection.ConsList

drop(int) - Method in interface com.github.andrewoma.dexx.collection.IndexedList

drop(Tree<K, V>, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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 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

E

elemHashCode(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

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 variable in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

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 variable in class com.github.andrewoma.dexx.collection.TreeSet

empty() - Static method in class com.github.andrewoma.dexx.collection.TreeSet

empty() - Static method in class com.github.andrewoma.dexx.collection.Vector

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() - Static method in class com.github.andrewoma.dexx.collection.ArrayList

factory() - Static method in class com.github.andrewoma.dexx.collection.ConsList

factory(KeyFunction<K, V>) - Static method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap

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(Comparator<? super K>) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps

factory() - Static method in class com.github.andrewoma.dexx.collection.SortedSets

factory(Comparator<? super E>) - Static method in class com.github.andrewoma.dexx.collection.SortedSets

factory(Comparator<? super K>, KeyFunction<K, V>) - Static method in class com.github.andrewoma.dexx.collection.TreeMap

factory(Comparator<? super E>) - Static method in class com.github.andrewoma.dexx.collection.TreeSet

factory() - Static method in class com.github.andrewoma.dexx.collection.Vector

first() - Method in class com.github.andrewoma.dexx.collection.ArrayList

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 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

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<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(Iterable<E>, Function<E, U>) - Static method in class com.github.andrewoma.dexx.collection.internal.base.Iterables

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>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap

forEach(Tree<K, V>, Function<Pair<K, V>, U>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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>) - Method in class com.github.andrewoma.dexx.collection.TreeMap

from(K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedMap

from(E, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedSet

from(Tree<K, V>, K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

from(K, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedMap

Returns the bottom of the map starting from the key specified.

from(E, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedSet

Returns the bottom of the set starting from the key specified.

from(K, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeMap

from(E, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeSet

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(K) - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap

get(K) - Method in class com.github.andrewoma.dexx.collection.HashMap

get(int) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater

get(Object) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.MapAdapter

get(K, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

get(K) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap

get(Tree<K, V>, K) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

get(int) - Method in interface com.github.andrewoma.dexx.collection.List

Returns the element at the specified index in this list (zero-based).

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(int) - Method in class com.github.andrewoma.dexx.collection.Vector

get0(K, int, int, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

getKey() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap

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.redblack.AbstractTree

getValue() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree

greatest(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

H

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 of Map based on a hash trie.

HashMap() - Constructor for class com.github.andrewoma.dexx.collection.HashMap

HashSet<E> - Class in com.github.andrewoma.dexx.collection

HashSet is an implementation of Set backed by a HashMap.

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 a KeyFunction 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

IndexedList<E> - Interface in com.github.andrewoma.dexx.collection

IndexedList implementations guarantee fast random access to elements via List.get(int).

IndexedLists - Class in com.github.andrewoma.dexx.collection

IndexedLists is the preferred method of constructing instances of IndexedList.

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.

instance - Static variable in exception com.github.andrewoma.dexx.collection.internal.base.Break

invoke(P) - Method in interface com.github.andrewoma.dexx.collection.Function

isEmpty() - Method in class com.github.andrewoma.dexx.collection.ArrayList

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(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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

Iterable<E> - Interface in com.github.andrewoma.dexx.collection

Iterable defines collections that can be accessed via an Iterator.

Iterables - Class in com.github.andrewoma.dexx.collection.internal.base

Iterables() - Constructor for class com.github.andrewoma.dexx.collection.internal.base.Iterables

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(KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

iterator() - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap

iterator(Tree<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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

K

key(E) - Method in class com.github.andrewoma.dexx.collection.IdentityKeyFunction

key(V) - Method in interface com.github.andrewoma.dexx.collection.KeyFunction

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

L

last() - Method in class com.github.andrewoma.dexx.collection.ArrayList

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 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

LinkedList<E> - Interface in com.github.andrewoma.dexx.collection

LinkedList implementations guarantee fast access to the head via List.first() and tail via LinkedList.tail().

LinkedLists - Class in com.github.andrewoma.dexx.collection

LinkedLists is the preferred method of constructing instances of LinkedList.

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<K,V> - Class in com.github.andrewoma.dexx.collection.internal.hashmap

ListMap() - Constructor for class com.github.andrewoma.dexx.collection.internal.hashmap.ListMap

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, String, String, int, 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 interface com.github.andrewoma.dexx.collection.Traversable

Returns this collection converted to a string.

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

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 of Map.

N

newBuilder() - Method in interface com.github.andrewoma.dexx.collection.BuilderFactory

O

of() - Static method in class com.github.andrewoma.dexx.collection.IndexedLists

of(E) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists

of(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.IndexedLists

of(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.IndexedLists

of(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.IndexedLists

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, 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.IndexedLists

of(E, E, E, E, E, E, E, E, E, E, E...) - Static method in class com.github.andrewoma.dexx.collection.IndexedLists

of() - Static method in class com.github.andrewoma.dexx.collection.LinkedLists

of(E) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists

of(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.LinkedLists

of(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.LinkedLists

of(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.LinkedLists

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, 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.LinkedLists

of(E, E, E, E, E, E, E, E, E, E, E...) - Static method in class com.github.andrewoma.dexx.collection.LinkedLists

of() - Static method in class com.github.andrewoma.dexx.collection.Maps

of(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.Maps

of(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.Maps

of(K, V, K, V, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.Maps

of() - Static method in class com.github.andrewoma.dexx.collection.Sets

of(E) - Static method in class com.github.andrewoma.dexx.collection.Sets

of(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.Sets

of(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.Sets

of(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.Sets

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, 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.Sets

of(E, E, E, E, E, E, E, E, E, E, E...) - Static method in class com.github.andrewoma.dexx.collection.Sets

of() - Static method in class com.github.andrewoma.dexx.collection.SortedMaps

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.SortedMaps

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.SortedMaps

of(K, V, K, V, K, V, K, V, K, V) - Static method in class com.github.andrewoma.dexx.collection.SortedMaps

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() - Static method in class com.github.andrewoma.dexx.collection.SortedSets

of(E) - Static method in class com.github.andrewoma.dexx.collection.SortedSets

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.SortedSets

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.SortedSets

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.SortedSets

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.SortedSets

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.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

P

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

pointer - Variable 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

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.adapter.MapAdapter

put(K, V, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

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

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.ConsList

range(int, boolean, int, boolean) - Method in interface com.github.andrewoma.dexx.collection.IndexedList

range(Tree<K, V>, K, boolean, K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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(K, boolean, K, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedMap

Returns a subset of the map between the from and to keys specified.

range(E, boolean, E, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedSet

Returns a subset of the set between the from and to keys specified.

range(K, boolean, K, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeMap

range(E, boolean, E, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeSet

range(int, boolean, int, boolean) - Method in class com.github.andrewoma.dexx.collection.Vector

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() - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.Tree

red(K, V, Tree<K, V>, Tree<K, V>) - Method in interface com.github.andrewoma.dexx.collection.internal.redblack.TreeFactory

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(K) - Method in class com.github.andrewoma.dexx.collection.DerivedKeyHashMap

remove(K) - Method in class com.github.andrewoma.dexx.collection.HashMap

remove(E) - Method in class com.github.andrewoma.dexx.collection.HashSet

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, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

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(E) - Method in interface com.github.andrewoma.dexx.collection.Set

Removes the specified value from the set if it exists.

remove(K) - Method in interface com.github.andrewoma.dexx.collection.SortedMap

remove(E) - Method in interface com.github.andrewoma.dexx.collection.SortedSet

remove(K) - Method in class com.github.andrewoma.dexx.collection.TreeMap

remove(E) - Method in class com.github.andrewoma.dexx.collection.TreeSet

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

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

S

set(int, E) - Method in class com.github.andrewoma.dexx.collection.ArrayList

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<E> - Interface in com.github.andrewoma.dexx.collection

Set defines the interface for a unique set of values as defined by Object.equals(Object).

set(int, E) - Method in class com.github.andrewoma.dexx.collection.Vector

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 of Set.

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.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

slice(Tree<K, V>, int, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

slice(int, int) - Method in class com.github.andrewoma.dexx.collection.TreeMap

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 of SortedMap.

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 of SortedSet.

splitAt(int) - Method in class com.github.andrewoma.dexx.collection.Vector

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() - Method in class com.github.andrewoma.dexx.collection.ArrayList

tail() - Method in class com.github.andrewoma.dexx.collection.ConsList

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.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.ConsList

take(int) - Method in interface com.github.andrewoma.dexx.collection.IndexedList

take(Tree<K, V>, int) - Method in class com.github.andrewoma.dexx.collection.internal.redblack.RedBlackTree

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 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

to(K, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedMap

to(E, boolean) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractSortedSet

to(Builder<E, R>) - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable

to(K, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedMap

Returns the top of the map up until the key specified.

to(E, boolean) - Method in interface com.github.andrewoma.dexx.collection.SortedSet

Returns the top of the set up until the key specified.

to(Builder<E, R>) - Method in interface com.github.andrewoma.dexx.collection.Traversable

Converts this collection to another collection using a builder.

to(K, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeMap

to(E, boolean) - Method in class com.github.andrewoma.dexx.collection.TreeSet

toArray(Traversable<E>, T[]) - Static method in class com.github.andrewoma.dexx.collection.internal.adapter.Adapters

toArray() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater

toArray(T[]) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.ListAdapater

toArray() - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater

toArray(T[]) - Method in class com.github.andrewoma.dexx.collection.internal.adapter.SetAdapater

toArray() - Method in class com.github.andrewoma.dexx.collection.internal.base.AbstractTraversable

toArray(E[]) - 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(E[]) - Method in interface com.github.andrewoma.dexx.collection.Traversable

Converts this collection to an array of objects of the correct type.

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.

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.Pair

Traversable<E> - Interface in com.github.andrewoma.dexx.collection

Traversable is the root of the collection hierarchy.

Tree<K,V> - Interface in com.github.andrewoma.dexx.collection.internal.redblack

TreeFactory - Interface in com.github.andrewoma.dexx.collection.internal.redblack

TreeMap<K,V> - Class in com.github.andrewoma.dexx.collection

TreeMap is an implementation of SortedMap based on a red-black tree.

TreeMap() - 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 of SortedSet backed by a TreeMap.

TreeSet() - 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

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

V

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

Vector<E> - Class in com.github.andrewoma.dexx.collection

Vector is a general-purpose, immutable data structure.

W

wrap(Object, KeyFunction<K, V>) - Method in class com.github.andrewoma.dexx.collection.internal.hashmap.CompactHashMap

A B C D E F G H I K L M N O P R S T U V W