public interface ImSortedMap<K,V> extends UnmodSortedMap<K,V>
UnmodMap.AbstractUnmodMap<K,V>, UnmodMap.UnEntry<K,V>UnmodIterable.AbstractUnmodIterable<T>| Modifier and Type | Method and Description |
|---|---|
ImSortedMap<K,V> |
assoc(K key,
V val)
Returns a new map with the given key/value added.
|
default ImSortedMap<K,V> |
assoc(Map.Entry<K,V> entry)
Returns a new map with an immutable copy of the given entry added
|
default boolean |
containsKey(Object key) |
Option<UnmodMap.UnEntry<K,V>> |
entry(K key) |
default V |
get(Object key) |
default V |
getOrElse(K key,
V notFound) |
default ImSortedMap<K,V> |
headMap(K toKey)
Return the elements in this map up (but excluding) to the given element
|
UnmodSortedIterator<UnmodMap.UnEntry<K,V>> |
iterator()
Returns an iterator over the UnEntries of this map in order.
|
default ImSortedSet<K> |
keySet()
Returns a view of the keys contained in this map.
|
ImSortedMap<K,V> |
subMap(K fromKey,
K toKey)
Return the elements in this map from the start element (inclusive) to the end element
(exclusive)
|
ImSortedMap<K,V> |
tailMap(K fromKey)
Return the elements in this from the given element to the end
|
ImSortedMap<K,V> |
without(K key)
Returns a new map with the given key/value removed
|
entrySet, valuesclear, compute, computeIfAbsent, computeIfPresent, containsValue, isEmpty, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAllcomparator, firstKey, lastKeycastFromList, castFromSortedMap, castFromSortedSet, equal, equalsconcat, drop, filter, flatMap, foldLeft, foldLeft, hash, hashCode, head, map, precat, take, takeWhile, toStringforEach, spliteratortoImList, toImMap, toImSet, toImSortedMap, toImSortedSet, toMutableList, toMutableMap, toMutableSet, toMutableSortedMap, toMutableSortedSetOption<UnmodMap.UnEntry<K,V>> entry(K key)
default boolean containsKey(Object key)
containsKey in interface Map<K,V>default ImSortedMap<K,V> headMap(K toKey)
UnmodSortedIterator<UnmodMap.UnEntry<K,V>> iterator()
iterator in interface Iterable<UnmodMap.UnEntry<K,V>>iterator in interface UnmodIterable<UnmodMap.UnEntry<K,V>>iterator in interface UnmodSortedIterable<UnmodMap.UnEntry<K,V>>default ImSortedSet<K> keySet()
ImSortedMap<K,V> subMap(K fromKey, K toKey)
ImSortedMap<K,V> tailMap(K fromKey)
ImSortedMap<K,V> assoc(K key, V val)
key - the key used to look up the value. In the case of a duplicate key, later values
overwrite the earlier ones. The resulting map can contain zero or one null key (if your
comparator knows how to sort nulls) and any number of null values.val - the value to store in this key.default ImSortedMap<K,V> assoc(Map.Entry<K,V> entry)
ImSortedMap<K,V> without(K key)
Copyright © 2017. All rights reserved.