| Methods in com.github.andrewoma.dexx.collection that return SortedMap |
static
|
SortedMaps.copyOf(Comparator<? super K> comparator,
Iterable<Pair<K,V>> iterable)
|
static
|
SortedMaps.copyOf(Comparator<? super K> comparator,
Iterator<Pair<K,V>> iterator)
|
static
|
SortedMaps.copyOf(Comparator<? super K> comparator,
Pair<K,V>[] pairs)
|
static
|
SortedMaps.copyOf(Iterable<Pair<K,V>> iterable)
|
static
|
SortedMaps.copyOf(Iterator<Pair<K,V>> iterator)
|
static
|
SortedMaps.copyOf(Pair<K,V>[] pairs)
|
static
|
SortedMaps.copyOfTraversable(Comparator<? super K> comparator,
Traversable<Pair<K,V>> traversable)
|
static
|
SortedMaps.copyOfTraversable(Traversable<Pair<K,V>> traversable)
|
SortedMap<K,V> |
SortedMap.drop(int number)
Returns a map containing all elements in this map, excluding the first number of elements. |
SortedMap<K,V> |
TreeMap.drop(int number)
|
SortedMap<K,V> |
SortedMap.from(K key,
boolean inclusive)
Returns the bottom of the map starting from the key specified. |
SortedMap<K,V> |
TreeMap.from(K key,
boolean inclusive)
|
static
|
SortedMaps.of()
|
static
|
SortedMaps.of(Comparator<? super K> comparator)
|
static
|
SortedMaps.of(Comparator<? super K> comparator,
K k,
V v)
|
static
|
SortedMaps.of(Comparator<? super K> comparator,
K k1,
V v1,
K k2,
V v2)
|
static
|
SortedMaps.of(Comparator<? super K> comparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3)
|
static
|
SortedMaps.of(Comparator<? super K> comparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4)
|
static
|
SortedMaps.of(Comparator<? super K> comparator,
K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5)
|
static
|
SortedMaps.of(K k,
V v)
|
static
|
SortedMaps.of(K k1,
V v1,
K k2,
V v2)
|
static
|
SortedMaps.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3)
|
static
|
SortedMaps.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4)
|
static
|
SortedMaps.of(K k1,
V v1,
K k2,
V v2,
K k3,
V v3,
K k4,
V v4,
K k5,
V v5)
|
SortedMap<K,V> |
SortedMap.put(K key,
V value)
|
SortedMap<K,V> |
SortedMap.range(K from,
boolean fromInclusive,
K to,
boolean toInclusive)
Returns a subset of the map between the from and to keys specified. |
SortedMap<K,V> |
TreeMap.range(K from,
boolean fromInclusive,
K to,
boolean toInclusive)
|
SortedMap<K,V> |
SortedMap.remove(K key)
|
SortedMap<K,V> |
SortedMap.take(int number)
Returns a list containing the first number of elements from this list. |
SortedMap<K,V> |
TreeMap.take(int number)
|
SortedMap<K,V> |
SortedMap.to(K key,
boolean inclusive)
Returns the top of the map up until the key specified. |
SortedMap<K,V> |
TreeMap.to(K key,
boolean inclusive)
|