class TreeMap[K, V] extends AbstractMap[K, V] with NavigableMap[K, V] with Cloneable with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- TreeMap
- Serializable
- Serializable
- Cloneable
- NavigableMap
- SortedMap
- SequencedMap
- AbstractMap
- Map
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
ceilingEntry(key: K): Entry[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
ceilingKey(key: K): K
- Definition Classes
- TreeMap → NavigableMap
-
def
clear(): Unit
- Definition Classes
- TreeMap → AbstractMap → Map
-
def
clone(): AnyRef
- Definition Classes
- TreeMap → AnyRef
- def comparator(): Comparator[_ >: K]
- def compute(key: K, remappingFunction: BiFunction[_ >: K, _ >: V, _ <: V]): V
- def computeIfAbsent(key: K, mappingFunction: Function[_ >: K, _ <: V]): V
- def computeIfPresent(key: K, remappingFunction: BiFunction[_ >: K, _ >: V, _ <: V]): V
-
def
containsKey(key: Any): Boolean
- Definition Classes
- TreeMap → AbstractMap → Map
-
def
containsValue(value: Any): Boolean
- Definition Classes
- TreeMap → AbstractMap → Map
-
def
descendingKeySet(): NavigableSet[K]
- Definition Classes
- TreeMap → NavigableMap
-
def
descendingMap(): NavigableMap[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
entrySet(): Set[Entry[K, V]]
- Definition Classes
- TreeMap → AbstractMap → Map
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(o: Any): Boolean
- Definition Classes
- AbstractMap → Map → AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
firstEntry(): Entry[K, V]
- Definition Classes
- TreeMap → NavigableMap
- def firstKey(): K
-
def
floorEntry(key: K): Entry[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
floorKey(key: K): K
- Definition Classes
- TreeMap → NavigableMap
-
def
forEach(action: BiConsumer[_ >: K, _ >: V]): Unit
- Definition Classes
- Map
-
def
get(key: Any): V
- Definition Classes
- TreeMap → AbstractMap → Map
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getOrDefault(key: Any, defaultValue: V): V
- Definition Classes
- Map
-
def
hashCode(): Int
- Definition Classes
- AbstractMap → Map → AnyRef → Any
-
def
headMap(toKey: K): SortedMap[K, V]
- Definition Classes
- TreeMap → NavigableMap → SortedMap
-
def
headMap(toKey: K, inclusive: Boolean): NavigableMap[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
higherEntry(key: K): Entry[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
higherKey(key: K): K
- Definition Classes
- TreeMap → NavigableMap
-
def
isEmpty(): Boolean
- Definition Classes
- AbstractMap → Map
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
keySet(): Set[K]
- Definition Classes
- TreeMap → AbstractMap → Map
-
def
lastEntry(): Entry[K, V]
- Definition Classes
- TreeMap → NavigableMap
- def lastKey(): K
-
def
lowerEntry(key: K): Entry[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
lowerKey(key: K): K
- Definition Classes
- TreeMap → NavigableMap
- def merge(key: K, value: V, remappingFunction: BiFunction[_ >: V, _ >: V, _ <: V]): V
-
def
navigableKeySet(): NavigableSet[K]
- Definition Classes
- TreeMap → NavigableMap
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
pollFirstEntry(): Entry[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
pollLastEntry(): Entry[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
put(key: K, value: V): V
- Definition Classes
- TreeMap → AbstractMap → Map
-
def
putAll(map: Map[_ <: K, _ <: V]): Unit
- Definition Classes
- TreeMap → AbstractMap → Map
-
def
putIfAbsent(key: K, value: V): V
- Definition Classes
- Map
-
def
remove(key: Any): V
- Definition Classes
- TreeMap → AbstractMap → Map
-
def
remove(key: Any, value: Any): Boolean
- Definition Classes
- Map
-
def
replace(key: K, value: V): V
- Definition Classes
- Map
-
def
replace(key: K, oldValue: V, newValue: V): Boolean
- Definition Classes
- Map
-
def
replaceAll(function: BiFunction[_ >: K, _ >: V, _ <: V]): Unit
- Definition Classes
- Map
-
def
size(): Int
- Definition Classes
- TreeMap → AbstractMap → Map
-
def
subMap(fromKey: K, toKey: K): SortedMap[K, V]
- Definition Classes
- TreeMap → NavigableMap → SortedMap
-
def
subMap(fromKey: K, fromInclusive: Boolean, toKey: K, toInclusive: Boolean): NavigableMap[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
tailMap(fromKey: K): SortedMap[K, V]
- Definition Classes
- TreeMap → NavigableMap → SortedMap
-
def
tailMap(fromKey: K, inclusive: Boolean): NavigableMap[K, V]
- Definition Classes
- TreeMap → NavigableMap
-
def
toString(): String
- Definition Classes
- AbstractMap → AnyRef → Any
-
def
usingEntry[T](entry: Entry[K, V])(apply: (K, V) ⇒ T): T
Helper method used to detect concurrent modification exception when accessing map entires.
-
def
values(): Collection[V]
- Definition Classes
- TreeMap → AbstractMap → Map
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()