TreeMap
open class TreeMap<K : Any!, V : Any!> : AbstractMap<K, V>, NavigableMap<K, V>, Cloneable, Serializable, MutableMap<K, V>
A Red-Black tree based NavigableMap implementation. The map is sorted according to the Comparable of its keys, or by a Comparator provided at map creation time, depending on which constructor is used.
This implementation provides guaranteed log(n) time cost for the containsKey, get, put and remove operations. Algorithms are adaptations of those in Cormen, Leiserson, and Rivest's Introduction to Algorithms.
Note that the ordering maintained by a tree map, like any sorted map, and whether or not an explicit comparator is provided, must be consistent with equals if this sorted map is to correctly implement the Map interface. (See Comparable or Comparator for a precise definition of consistent with equals.) This is so because the Map interface is defined in terms of the equals operation, but a sorted map performs all key comparisons using its compareTo (or compare) method, so two keys that are deemed equal by this method are, from the standpoint of the sorted map, equal. The behavior of a sorted map is well-defined even if its ordering is inconsistent with equals; it just fails to obey the general contract of the Map interface.
Note that this implementation is not synchronized. If multiple threads access a map concurrently, and at least one of the threads modifies the map structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more mappings; merely changing the value associated with an existing key is not a structural modification.) This is typically accomplished by synchronizing on some object that naturally encapsulates the map. If no such object exists, the map should be "wrapped" using the Collections#synchronizedSortedMap method. This is best done at creation time, to prevent accidental unsynchronized access to the map:
SortedMap m = Collections.synchronizedSortedMap(new TreeMap(...));
The iterators returned by the iterator method of the collections returned by all of this class's "collection view methods" are fail-fast: if the map is structurally modified at any time after the iterator is created, in any way except through the iterator's own remove method, the iterator will throw a ConcurrentModificationException. Thus, in the face of concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, non-deterministic behavior at an undetermined time in the future.
Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent modification. Fail-fast iterators throw ConcurrentModificationException on a best-effort basis. Therefore, it would be wrong to write a program that depended on this exception for its correctness: the fail-fast behavior of iterators should be used only to detect bugs.
All Map.Entry pairs returned by methods in this class and its views represent snapshots of mappings at the time they were produced. They do not support the Entry.setValue method. (Note however that it is possible to change mappings in the associated map using put.)
This class is a member of the Java Collections Framework.
Summary
| Public constructors |
|
Constructs a new, empty tree map, using the natural ordering of its keys.
|
|
Constructs a new, empty tree map, ordered according to the given comparator.
|
|
Constructs a new tree map containing the same mappings as the given map, ordered according to the natural ordering of its keys.
|
|
Constructs a new tree map containing the same mappings and using the same ordering as the specified sorted map.
|
| Public methods |
| open MutableEntry<K, V>? |
|
| open K? |
|
| open Unit |
Removes all of the mappings from this map.
|
| open Any |
Returns a shallow copy of this TreeMap instance.
|
| open Comparator<in K>? |
|
| open Boolean |
Returns true if this map contains a mapping for the specified key.
|
| open Boolean |
Returns true if this map contains a mapping for the specified key.
|
| open Boolean |
Returns true if this map maps one or more keys to the specified value.
|
| open Boolean |
Returns true if this map maps one or more keys to the specified value.
|
| open NavigableSet<K> |
|
| open NavigableMap<K, V> |
|
| open MutableEntry<K, V>? |
|
| open K |
|
| open MutableEntry<K, V>? |
|
| open K? |
|
| open Unit |
|
| open V? |
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
|
| open V? |
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
|
| open NavigableMap<K, V> |
|
| open SortedMap<K, V> |
|
| open MutableEntry<K, V>? |
|
| open K? |
|
| open MutableEntry<K, V>? |
|
| open K |
|
| open MutableEntry<K, V>? |
|
| open K? |
|
| open NavigableSet<K> |
|
| open MutableEntry<K, V>? |
|
| open MutableEntry<K, V>? |
|
| open V? |
Associates the specified value with the specified key in this map.
|
| open Unit |
Copies all of the mappings from the specified map to this map.
|
| open V? |
Removes the mapping for this key from this TreeMap if present.
|
| open V? |
Removes the mapping for this key from this TreeMap if present.
|
| open Boolean |
replace(key: K, oldValue: V, newValue: V) |
| open V? |
|
| open Unit |
|
| open NavigableMap<K, V> |
|
| open SortedMap<K, V> |
|
| open NavigableMap<K, V> |
|
| open SortedMap<K, V> |
|
| Inherited functions |
From class AbstractMap
Boolean |
equals(other: Any?)
Compares the specified object with this map for equality. Returns true if the given object is also a map and the two maps represent the same mappings. More formally, two maps m1 and m2 represent the same mappings if m1.entrySet().equals(m2.entrySet()). This ensures that the equals method works properly across different implementations of the Map interface.
|
Int |
hashCode()
Returns the hash code value for this map. The hash code of a map is defined to be the sum of the hash codes of each entry in the map's entrySet() view. This ensures that m1.equals(m2) implies that m1.hashCode()==m2.hashCode() for any two maps m1 and m2, as required by the general contract of Object#hashCode.
|
Boolean |
isEmpty()
Returns true if this map contains no key-value mappings.
|
String |
toString()
Returns a string representation of this map. The string representation consists of a list of key-value mappings in the order returned by the map's entrySet view's iterator, enclosed in braces ("{}"). Adjacent mappings are separated by the characters ", " (comma and space). Each key-value mapping is rendered as the key followed by an equals sign ("=") followed by the associated value. Keys and values are converted to strings as by String#valueOf(Object).
|
|
Public constructors
<init>
TreeMap()
Constructs a new, empty tree map, using the natural ordering of its keys. All keys inserted into the map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) must not throw a ClassCastException for any keys k1 and k2 in the map. If the user attempts to put a key into the map that violates this constraint (for example, the user attempts to put a string key into a map whose keys are integers), the put(Object key, Object value) call will throw a ClassCastException.
<init>
TreeMap(comparator: Comparator<in K>?)
Constructs a new, empty tree map, ordered according to the given comparator. All keys inserted into the map must be mutually comparable by the given comparator: comparator.compare(k1, k2) must not throw a ClassCastException for any keys k1 and k2 in the map. If the user attempts to put a key into the map that violates this constraint, the put(Object key, Object value) call will throw a ClassCastException.
| Parameters |
comparator |
Comparator<in K>?: the comparator that will be used to order this map. If null, the Comparable of the keys will be used. |
<init>
TreeMap(m: MutableMap<out K, out V>)
Constructs a new tree map containing the same mappings as the given map, ordered according to the natural ordering of its keys. All keys inserted into the new map must implement the Comparable interface. Furthermore, all such keys must be mutually comparable: k1.compareTo(k2) must not throw a ClassCastException for any keys k1 and k2 in the map. This method runs in n*log(n) time.
| Parameters |
m |
MutableMap<out K, out V>: the map whose mappings are to be placed in this map |
| Exceptions |
java.lang.ClassCastException |
if the keys in m are not Comparable, or are not mutually comparable |
java.lang.NullPointerException |
if the specified map is null |
<init>
TreeMap(m: SortedMap<K, out V>)
Constructs a new tree map containing the same mappings and using the same ordering as the specified sorted map. This method runs in linear time.
| Parameters |
m |
SortedMap<K, out V>: the sorted map whose mappings are to be placed in this map, and whose comparator is to be used to sort this map |
| Exceptions |
java.lang.NullPointerException |
if the specified map is null |
Public methods
ceilingEntry
open fun ceilingEntry(key: K): MutableEntry<K, V>?
| Parameters |
key |
K: the key |
| Return |
MutableEntry<K, V>? |
an entry with the least key greater than or equal to key, or null if there is no such key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
ceilingKey
open fun ceilingKey(key: K): K?
| Parameters |
key |
K: the key |
| Return |
K? |
the least key greater than or equal to key, or null if there is no such key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
clear
open fun clear(): Unit
Removes all of the mappings from this map. The map will be empty after this call returns.
| Exceptions |
java.lang.UnsupportedOperationException |
if the clear operation is not supported by this map |
clone
open fun clone(): Any
Returns a shallow copy of this TreeMap instance. (The keys and values themselves are not cloned.)
| Return |
Any |
a shallow copy of this map |
| Exceptions |
java.lang.CloneNotSupportedException |
if the object's class does not support the Cloneable interface. Subclasses that override the clone method can also throw this exception to indicate that an instance cannot be cloned. |
comparator
open fun comparator(): Comparator<in K>?
| Return |
Comparator<in K>? |
the comparator used to order the keys in this map, or null if this map uses the natural ordering of its keys |
containsKey
open fun containsKey(key: K): Boolean
Returns true if this map contains a mapping for the specified key.
| Parameters |
key |
K: key whose presence in this map is to be tested |
| Return |
Boolean |
true if this map contains a mapping for the specified key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
containsKey
open fun containsKey(key: K): Boolean
Returns true if this map contains a mapping for the specified key.
| Parameters |
key |
K: key whose presence in this map is to be tested |
| Return |
Boolean |
true if this map contains a mapping for the specified key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
containsValue
open fun containsValue(value: V): Boolean
Returns true if this map maps one or more keys to the specified value. More formally, returns true if and only if this map contains at least one mapping to a value v such that (value==null ? v==null : value.equals(v)). This operation will probably require time linear in the map size for most implementations.
| Parameters |
value |
V: value whose presence in this map is to be tested |
| Return |
Boolean |
true if a mapping to value exists; false otherwise |
| Exceptions |
java.lang.ClassCastException |
if the value is of an inappropriate type for this map (optional) |
java.lang.NullPointerException |
if the specified value is null and this map does not permit null values (optional) |
containsValue
open fun containsValue(value: V): Boolean
Returns true if this map maps one or more keys to the specified value. More formally, returns true if and only if this map contains at least one mapping to a value v such that (value==null ? v==null : value.equals(v)). This operation will probably require time linear in the map size for most implementations.
| Parameters |
value |
V: value whose presence in this map is to be tested |
| Return |
Boolean |
true if a mapping to value exists; false otherwise |
| Exceptions |
java.lang.ClassCastException |
if the value is of an inappropriate type for this map (optional) |
java.lang.NullPointerException |
if the specified value is null and this map does not permit null values (optional) |
descendingKeySet
open fun descendingKeySet(): NavigableSet<K>
| Return |
NavigableSet<K> |
a reverse order navigable set view of the keys in this map |
firstEntry
open fun firstEntry(): MutableEntry<K, V>?
| Return |
MutableEntry<K, V>? |
an entry with the least key, or null if this map is empty |
firstKey
open fun firstKey(): K
| Return |
K |
the first (lowest) key currently in this map |
| Exceptions |
java.util.NoSuchElementException |
if this map is empty |
floorEntry
open fun floorEntry(key: K): MutableEntry<K, V>?
| Parameters |
key |
K: the key |
| Return |
MutableEntry<K, V>? |
an entry with the greatest key less than or equal to key, or null if there is no such key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
floorKey
open fun floorKey(key: K): K?
| Parameters |
key |
K: the key |
| Return |
K? |
the greatest key less than or equal to key, or null if there is no such key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
forEach
open fun forEach(action: BiConsumer<in K, in V>): Unit
| Parameters |
action |
BiConsumer<in K, in V>: The action to be performed for each entry |
| Exceptions |
java.lang.NullPointerException |
if the specified action is null |
java.util.ConcurrentModificationException |
if an entry is found to be removed during iteration |
get
open fun get(key: K): V?
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
More formally, if this map contains a mapping from a key k to a value v such that key compares equal to k according to the map's ordering, then this method returns v; otherwise it returns null. (There can be at most one such mapping.)
A return value of null does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to null. The containsKey operation may be used to distinguish these two cases.
| Parameters |
key |
K: the key whose associated value is to be returned |
| Return |
V? |
the value to which the specified key is mapped, or null if this map contains no mapping for the key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
get
open fun get(key: K): V?
Returns the value to which the specified key is mapped, or null if this map contains no mapping for the key.
More formally, if this map contains a mapping from a key k to a value v such that key compares equal to k according to the map's ordering, then this method returns v; otherwise it returns null. (There can be at most one such mapping.)
A return value of null does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key to null. The containsKey operation may be used to distinguish these two cases.
| Parameters |
key |
K: the key whose associated value is to be returned |
| Return |
V? |
the value to which the specified key is mapped, or null if this map contains no mapping for the key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
headMap
open fun headMap(
toKey: K,
inclusive: Boolean
): NavigableMap<K, V>
| Parameters |
toKey |
K: high endpoint of the keys in the returned map |
inclusive |
Boolean: true if the high endpoint is to be included in the returned view |
| Return |
NavigableMap<K, V> |
a view of the portion of this map whose keys are less than (or equal to, if inclusive is true) toKey |
| Exceptions |
java.lang.ClassCastException |
if toKey is not compatible with this map's comparator (or, if the map has no comparator, if toKey does not implement Comparable). Implementations may, but are not required to, throw this exception if toKey cannot be compared to keys currently in the map. |
java.lang.NullPointerException |
if toKey is null and this map uses natural ordering, or its comparator does not permit null keys |
java.lang.IllegalArgumentException |
if this map itself has a restricted range, and toKey lies outside the bounds of the range |
headMap
open fun headMap(toKey: K): SortedMap<K, V>
| Parameters |
toKey |
K: high endpoint (exclusive) of the keys in the returned map |
| Return |
SortedMap<K, V> |
a view of the portion of this map whose keys are strictly less than toKey |
| Exceptions |
java.lang.ClassCastException |
if toKey is not compatible with this map's comparator (or, if the map has no comparator, if toKey does not implement Comparable). Implementations may, but are not required to, throw this exception if toKey cannot be compared to keys currently in the map. |
java.lang.NullPointerException |
if toKey is null and this map uses natural ordering, or its comparator does not permit null keys |
java.lang.IllegalArgumentException |
if this map itself has a restricted range, and toKey lies outside the bounds of the range |
higherEntry
open fun higherEntry(key: K): MutableEntry<K, V>?
| Parameters |
key |
K: the key |
| Return |
MutableEntry<K, V>? |
an entry with the least key greater than key, or null if there is no such key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
higherKey
open fun higherKey(key: K): K?
| Parameters |
key |
K: the key |
| Return |
K? |
the least key greater than key, or null if there is no such key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
lastEntry
open fun lastEntry(): MutableEntry<K, V>?
| Return |
MutableEntry<K, V>? |
an entry with the greatest key, or null if this map is empty |
lastKey
open fun lastKey(): K
| Return |
K |
the last (highest) key currently in this map |
| Exceptions |
java.util.NoSuchElementException |
if this map is empty |
lowerEntry
open fun lowerEntry(key: K): MutableEntry<K, V>?
| Parameters |
key |
K: the key |
| Return |
MutableEntry<K, V>? |
an entry with the greatest key less than key, or null if there is no such key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
lowerKey
open fun lowerKey(key: K): K?
| Parameters |
key |
K: the key |
| Return |
K? |
the greatest key less than key, or null if there is no such key |
| Exceptions |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
navigableKeySet
open fun navigableKeySet(): NavigableSet<K>
| Return |
NavigableSet<K> |
a navigable set view of the keys in this map |
pollFirstEntry
open fun pollFirstEntry(): MutableEntry<K, V>?
| Return |
MutableEntry<K, V>? |
the removed first entry of this map, or null if this map is empty |
pollLastEntry
open fun pollLastEntry(): MutableEntry<K, V>?
| Return |
MutableEntry<K, V>? |
the removed last entry of this map, or null if this map is empty |
put
open fun put(
key: K,
value: V
): V?
Associates the specified value with the specified key in this map. If the map previously contained a mapping for the key, the old value is replaced.
| Parameters |
key |
K: key with which the specified value is to be associated |
value |
V: value to be associated with the specified key |
| Return |
V? |
the previous value associated with key, or null if there was no mapping for key. (A null return can also indicate that the map previously associated null with key.) |
| Exceptions |
java.lang.UnsupportedOperationException |
if the put operation is not supported by this map |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
java.lang.IllegalArgumentException |
if some property of the specified key or value prevents it from being stored in this map |
putAll
open fun putAll(from: Map<out K, V>): Unit
Copies all of the mappings from the specified map to this map. These mappings replace any mappings that this map had for any of the keys currently in the specified map.
| Parameters |
m |
mappings to be stored in this map |
map |
mappings to be stored in this map |
| Exceptions |
java.lang.UnsupportedOperationException |
if the putAll operation is not supported by this map |
java.lang.ClassCastException |
if the class of a key or value in the specified map prevents it from being stored in this map |
java.lang.NullPointerException |
if the specified map is null or the specified map contains a null key and this map does not permit null keys |
java.lang.IllegalArgumentException |
if some property of a key or value in the specified map prevents it from being stored in this map |
remove
open fun remove(key: K): V?
Removes the mapping for this key from this TreeMap if present.
| Parameters |
key |
K: key for which mapping should be removed |
| Return |
V? |
the previous value associated with key, or null if there was no mapping for key. (A null return can also indicate that the map previously associated null with key.) |
| Exceptions |
java.lang.UnsupportedOperationException |
if the remove operation is not supported by this map |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
remove
open fun remove(key: K): V?
Removes the mapping for this key from this TreeMap if present.
| Parameters |
key |
K: key for which mapping should be removed |
| Return |
V? |
the previous value associated with key, or null if there was no mapping for key. (A null return can also indicate that the map previously associated null with key.) |
| Exceptions |
java.lang.UnsupportedOperationException |
if the remove operation is not supported by this map |
java.lang.ClassCastException |
if the specified key cannot be compared with the keys currently in the map |
java.lang.NullPointerException |
if the specified key is null and this map uses natural ordering, or its comparator does not permit null keys |
replace
open fun replace(
key: K,
oldValue: V,
newValue: V
): Boolean
| Parameters |
key |
K: key with which the specified value is associated |
oldValue |
V: value expected to be associated with the specified key |
newValue |
V: value to be associated with the specified key |
| Return |
Boolean |
true if the value was replaced |
| Exceptions |
java.lang.UnsupportedOperationException |
if the put operation is not supported by this map (optional) |
java.lang.ClassCastException |
if the class of a specified key or value prevents it from being stored in this map |
java.lang.NullPointerException |
if oldValue is null and this map does not permit null values (optional) |
java.lang.IllegalArgumentException |
if some property of a specified key or value prevents it from being stored in this map |
replace
open fun replace(
key: K,
value: V
): V?
| Parameters |
key |
K: key with which the specified value is associated |
value |
V: value to be associated with the specified key |
| Return |
V? |
the previous value associated with the specified key, or null if there was no mapping for the key. (A null return can also indicate that the map previously associated null with the key, if the implementation supports null values.) |
| Exceptions |
java.lang.UnsupportedOperationException |
if the put operation is not supported by this map (optional) |
java.lang.ClassCastException |
if the class of the specified key or value prevents it from being stored in this map (optional) |
java.lang.NullPointerException |
if the specified key or value is null, and this map does not permit null keys or values |
java.lang.IllegalArgumentException |
if some property of the specified key or value prevents it from being stored in this map |
replaceAll
open fun replaceAll(function: BiFunction<in K, in V, out V>): Unit
| Parameters |
function |
BiFunction<in K, in V, out V>: the function to apply to each entry |
| Exceptions |
java.lang.UnsupportedOperationException |
if the set operation is not supported by this map's entry set iterator. |
java.lang.ClassCastException |
if a replacement value is of an inappropriate type for this map (optional) |
java.lang.NullPointerException |
if function or a replacement value is null, and this map does not permit null keys or values (optional) |
java.lang.IllegalArgumentException |
if some property of a replacement value prevents it from being stored in this map (optional) |
java.util.ConcurrentModificationException |
if an entry is found to be removed during iteration |
subMap
open fun subMap(
fromKey: K,
fromInclusive: Boolean,
toKey: K,
toInclusive: Boolean
): NavigableMap<K, V>
| Parameters |
fromKey |
K: low endpoint of the keys in the returned map |
fromInclusive |
Boolean: true if the low endpoint is to be included in the returned view |
toKey |
K: high endpoint of the keys in the returned map |
toInclusive |
Boolean: true if the high endpoint is to be included in the returned view |
| Return |
NavigableMap<K, V> |
a view of the portion of this map whose keys range from fromKey to toKey |
| Exceptions |
java.lang.ClassCastException |
if fromKey and toKey cannot be compared to one another using this map's comparator (or, if the map has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if fromKey or toKey cannot be compared to keys currently in the map. |
java.lang.NullPointerException |
if fromKey or toKey is null and this map uses natural ordering, or its comparator does not permit null keys |
java.lang.IllegalArgumentException |
if fromKey is greater than toKey; or if this map itself has a restricted range, and fromKey or toKey lies outside the bounds of the range |
subMap
open fun subMap(
fromKey: K,
toKey: K
): SortedMap<K, V>
| Parameters |
fromKey |
K: low endpoint (inclusive) of the keys in the returned map |
toKey |
K: high endpoint (exclusive) of the keys in the returned map |
| Return |
SortedMap<K, V> |
a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive |
| Exceptions |
java.lang.ClassCastException |
if fromKey and toKey cannot be compared to one another using this map's comparator (or, if the map has no comparator, using natural ordering). Implementations may, but are not required to, throw this exception if fromKey or toKey cannot be compared to keys currently in the map. |
java.lang.NullPointerException |
if fromKey or toKey is null and this map uses natural ordering, or its comparator does not permit null keys |
java.lang.IllegalArgumentException |
if fromKey is greater than toKey; or if this map itself has a restricted range, and fromKey or toKey lies outside the bounds of the range |
tailMap
open fun tailMap(
fromKey: K,
inclusive: Boolean
): NavigableMap<K, V>
| Parameters |
fromKey |
K: low endpoint of the keys in the returned map |
inclusive |
Boolean: true if the low endpoint is to be included in the returned view |
| Return |
NavigableMap<K, V> |
a view of the portion of this map whose keys are greater than (or equal to, if inclusive is true) fromKey |
| Exceptions |
java.lang.ClassCastException |
if fromKey is not compatible with this map's comparator (or, if the map has no comparator, if fromKey does not implement Comparable). Implementations may, but are not required to, throw this exception if fromKey cannot be compared to keys currently in the map. |
java.lang.NullPointerException |
if fromKey is null and this map uses natural ordering, or its comparator does not permit null keys |
java.lang.IllegalArgumentException |
if this map itself has a restricted range, and fromKey lies outside the bounds of the range |
tailMap
open fun tailMap(fromKey: K): SortedMap<K, V>
| Parameters |
fromKey |
K: low endpoint (inclusive) of the keys in the returned map |
| Return |
SortedMap<K, V> |
a view of the portion of this map whose keys are greater than or equal to fromKey |
| Exceptions |
java.lang.ClassCastException |
if fromKey is not compatible with this map's comparator (or, if the map has no comparator, if fromKey does not implement Comparable). Implementations may, but are not required to, throw this exception if fromKey cannot be compared to keys currently in the map. |
java.lang.NullPointerException |
if fromKey is null and this map uses natural ordering, or its comparator does not permit null keys |
java.lang.IllegalArgumentException |
if this map itself has a restricted range, and fromKey lies outside the bounds of the range |
Properties
entries
open val entries: MutableSet<MutableEntry<K, V>>
Returns a Set view of the mappings contained in this map.
The set's iterator returns the entries in ascending key order. The sets's spliterator is late-binding, fail-fast, and additionally reports Spliterator#SORTED and Spliterator#ORDERED with an encounter order that is ascending key order.
The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation, or through the setValue operation on a map entry returned by the iterator) the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.
| Return |
MutableSet<MutableEntry<K, V>> |
a set view of the mappings contained in this map, sorted in ascending key order |
keys
open val keys: MutableSet<K>
Returns a Set view of the keys contained in this map.
The set's iterator returns the keys in ascending order. The set's spliterator is late-binding, fail-fast, and additionally reports Spliterator#SORTED and Spliterator#ORDERED with an encounter order that is ascending key order. The spliterator's comparator (see java.util.Spliterator#getComparator()) is null if the tree map's comparator (see comparator()) is null. Otherwise, the spliterator's comparator is the same as or imposes the same total ordering as the tree map's comparator.
The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll, and clear operations. It does not support the add or addAll operations.
| Return |
MutableSet<K> |
a set view of the keys contained in this map, sorted in ascending order |
size
open val size: Int
Returns the number of key-value mappings in this map.
| Return |
Int |
the number of key-value mappings in this map |
values
open val values: MutableCollection<V>
Returns a Collection view of the values contained in this map.
The collection's iterator returns the values in ascending order of the corresponding keys. The collection's spliterator is late-binding, fail-fast, and additionally reports Spliterator#ORDERED with an encounter order that is ascending order of the corresponding keys.
The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. If the map is modified while an iteration over the collection is in progress (except through the iterator's own remove operation), the results of the iteration are undefined. The collection supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Collection.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.
| Return |
MutableCollection<V> |
a collection view of the values contained in this map, sorted in ascending key order |
