Packages

c

java.util

TreeMap

class TreeMap[K, V] extends AbstractMap[K, V] with NavigableMap[K, V] with Cloneable with Serializable

Linear Supertypes
Serializable, Cloneable, NavigableMap[K, V], SortedMap[K, V], SequencedMap[K, V], AbstractMap[K, V], Map[K, V], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TreeMap
  2. Serializable
  3. Cloneable
  4. NavigableMap
  5. SortedMap
  6. SequencedMap
  7. AbstractMap
  8. Map
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new TreeMap(m: SortedMap[K, V])
  2. new TreeMap(m: Map[K, V])
  3. new TreeMap(comparator: Comparator[_ >: K])
  4. new TreeMap()

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def ceilingEntry(key: K): Entry[K, V]
    Definition Classes
    TreeMap → NavigableMap
  6. def ceilingKey(key: K): K
    Definition Classes
    TreeMap → NavigableMap
  7. def clear(): Unit
    Definition Classes
    TreeMap → AbstractMap → Map
  8. def clone(): AnyRef
    Definition Classes
    TreeMap → AnyRef
  9. def comparator(): Comparator[_ >: K]
    Definition Classes
    TreeMap → SortedMap
  10. def compute(key: K, remappingFunction: BiFunction[_ >: K, _ >: V, _ <: V]): V
    Definition Classes
    TreeMap → Map
  11. def computeIfAbsent(key: K, mappingFunction: Function[_ >: K, _ <: V]): V
    Definition Classes
    TreeMap → Map
  12. def computeIfPresent(key: K, remappingFunction: BiFunction[_ >: K, _ >: V, _ <: V]): V
    Definition Classes
    TreeMap → Map
  13. def containsKey(key: Any): Boolean
    Definition Classes
    TreeMap → AbstractMap → Map
  14. def containsValue(value: Any): Boolean
    Definition Classes
    TreeMap → AbstractMap → Map
  15. def descendingKeySet(): NavigableSet[K]
    Definition Classes
    TreeMap → NavigableMap
  16. def descendingMap(): NavigableMap[K, V]
    Definition Classes
    TreeMap → NavigableMap
  17. def entrySet(): Set[Entry[K, V]]
    Definition Classes
    TreeMap → AbstractMap → Map
  18. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. def equals(o: Any): Boolean
    Definition Classes
    AbstractMap → Map → AnyRef → Any
  20. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  21. def firstEntry(): Entry[K, V]
    Definition Classes
    TreeMap → NavigableMap
  22. def firstKey(): K
    Definition Classes
    TreeMap → SortedMap
  23. def floorEntry(key: K): Entry[K, V]
    Definition Classes
    TreeMap → NavigableMap
  24. def floorKey(key: K): K
    Definition Classes
    TreeMap → NavigableMap
  25. def forEach(action: BiConsumer[_ >: K, _ >: V]): Unit
    Definition Classes
    Map
  26. def get(key: Any): V
    Definition Classes
    TreeMap → AbstractMap → Map
  27. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  28. def getOrDefault(key: Any, defaultValue: V): V
    Definition Classes
    Map
  29. def hashCode(): Int
    Definition Classes
    AbstractMap → Map → AnyRef → Any
  30. def headMap(toKey: K): SortedMap[K, V]
    Definition Classes
    TreeMap → NavigableMap → SortedMap
  31. def headMap(toKey: K, inclusive: Boolean): NavigableMap[K, V]
    Definition Classes
    TreeMap → NavigableMap
  32. def higherEntry(key: K): Entry[K, V]
    Definition Classes
    TreeMap → NavigableMap
  33. def higherKey(key: K): K
    Definition Classes
    TreeMap → NavigableMap
  34. def isEmpty(): Boolean
    Definition Classes
    AbstractMap → Map
  35. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  36. def keySet(): Set[K]
    Definition Classes
    TreeMap → AbstractMap → Map
  37. def lastEntry(): Entry[K, V]
    Definition Classes
    TreeMap → NavigableMap
  38. def lastKey(): K
    Definition Classes
    TreeMap → SortedMap
  39. def lowerEntry(key: K): Entry[K, V]
    Definition Classes
    TreeMap → NavigableMap
  40. def lowerKey(key: K): K
    Definition Classes
    TreeMap → NavigableMap
  41. def merge(key: K, value: V, remappingFunction: BiFunction[_ >: V, _ >: V, _ <: V]): V
    Definition Classes
    TreeMap → Map
  42. def navigableKeySet(): NavigableSet[K]
    Definition Classes
    TreeMap → NavigableMap
  43. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  44. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  45. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  46. def pollFirstEntry(): Entry[K, V]
    Definition Classes
    TreeMap → NavigableMap
  47. def pollLastEntry(): Entry[K, V]
    Definition Classes
    TreeMap → NavigableMap
  48. def put(key: K, value: V): V
    Definition Classes
    TreeMap → AbstractMap → Map
  49. def putAll(map: Map[_ <: K, _ <: V]): Unit
    Definition Classes
    TreeMap → AbstractMap → Map
  50. def putIfAbsent(key: K, value: V): V
    Definition Classes
    Map
  51. def remove(key: Any): V
    Definition Classes
    TreeMap → AbstractMap → Map
  52. def remove(key: Any, value: Any): Boolean
    Definition Classes
    Map
  53. def replace(key: K, value: V): V
    Definition Classes
    Map
  54. def replace(key: K, oldValue: V, newValue: V): Boolean
    Definition Classes
    Map
  55. def replaceAll(function: BiFunction[_ >: K, _ >: V, _ <: V]): Unit
    Definition Classes
    Map
  56. def size(): Int
    Definition Classes
    TreeMap → AbstractMap → Map
  57. def subMap(fromKey: K, toKey: K): SortedMap[K, V]
    Definition Classes
    TreeMap → NavigableMap → SortedMap
  58. def subMap(fromKey: K, fromInclusive: Boolean, toKey: K, toInclusive: Boolean): NavigableMap[K, V]
    Definition Classes
    TreeMap → NavigableMap
  59. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  60. def tailMap(fromKey: K): SortedMap[K, V]
    Definition Classes
    TreeMap → NavigableMap → SortedMap
  61. def tailMap(fromKey: K, inclusive: Boolean): NavigableMap[K, V]
    Definition Classes
    TreeMap → NavigableMap
  62. def toString(): String
    Definition Classes
    AbstractMap → AnyRef → Any
  63. def usingEntry[T](entry: Entry[K, V])(apply: (K, V) => T): T

    Helper method used to detect concurrent modification exception when accessing map entires.

    Helper method used to detect concurrent modification exception when accessing map entires. IllegalStateException means the entry is no longer available (remove)

    Attributes
    protected[util]
    Definition Classes
    Map
    Annotations
    @alwaysinline()
  64. def values(): Collection[V]
    Definition Classes
    TreeMap → AbstractMap → Map
  65. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  66. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  67. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Serializable

Inherited from Cloneable

Inherited from NavigableMap[K, V]

Inherited from SortedMap[K, V]

Inherited from SequencedMap[K, V]

Inherited from AbstractMap[K, V]

Inherited from Map[K, V]

Inherited from AnyRef

Inherited from Any

Ungrouped