trait NavigableMap[K, V] extends SortedMap[K, V]
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- NavigableMap
- SortedMap
- SequencedMap
- Map
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Abstract Value Members
- abstract def ceilingEntry(key: K): Entry[K, V]
- abstract def ceilingKey(key: K): K
- abstract def clear(): Unit
- Definition Classes
- Map
- abstract def comparator(): Comparator[_ >: K]
- Definition Classes
- SortedMap
- abstract def containsKey(key: Any): Boolean
- Definition Classes
- Map
- abstract def containsValue(value: Any): Boolean
- Definition Classes
- Map
- abstract def descendingKeySet(): NavigableSet[K]
- abstract def descendingMap(): NavigableMap[K, V]
- abstract def entrySet(): Set[Entry[K, V]]
- Definition Classes
- Map
- abstract def firstEntry(): Entry[K, V]
- abstract def firstKey(): K
- Definition Classes
- SortedMap
- abstract def floorEntry(key: K): Entry[K, V]
- abstract def floorKey(key: K): K
- abstract def get(key: Any): V
- Definition Classes
- Map
- abstract def headMap(toKey: K): SortedMap[K, V]
- Definition Classes
- NavigableMap → SortedMap
- abstract def headMap(toKey: K, inclusive: Boolean): NavigableMap[K, V]
- abstract def higherEntry(key: K): Entry[K, V]
- abstract def higherKey(key: K): K
- abstract def isEmpty(): Boolean
- Definition Classes
- Map
- abstract def keySet(): Set[K]
- Definition Classes
- Map
- abstract def lastEntry(): Entry[K, V]
- abstract def lastKey(): K
- Definition Classes
- SortedMap
- abstract def lowerEntry(key: K): Entry[K, V]
- abstract def lowerKey(key: K): K
- abstract def navigableKeySet(): NavigableSet[K]
- abstract def pollFirstEntry(): Entry[K, V]
- abstract def pollLastEntry(): Entry[K, V]
- abstract def put(key: K, value: V): V
- Definition Classes
- Map
- abstract def putAll(m: Map[_ <: K, _ <: V]): Unit
- Definition Classes
- Map
- abstract def remove(key: Any): V
- Definition Classes
- Map
- abstract def size(): Int
- Definition Classes
- Map
- abstract def subMap(fromKey: K, toKey: K): SortedMap[K, V]
- Definition Classes
- NavigableMap → SortedMap
- abstract def subMap(fromKey: K, fromInclusive: Boolean, toKey: K, toInclusive: Boolean): NavigableMap[K, V]
- abstract def tailMap(fromKey: K): SortedMap[K, V]
- Definition Classes
- NavigableMap → SortedMap
- abstract def tailMap(toKey: K, inclusive: Boolean): NavigableMap[K, V]
- abstract def values(): Collection[V]
- Definition Classes
- Map
Concrete 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 clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def compute(key: K, remappingFunction: BiFunction[_ >: K, _ >: V, _ <: V]): V
- Definition Classes
- Map
- def computeIfAbsent(key: K, mappingFunction: Function[_ >: K, _ <: V]): V
- Definition Classes
- Map
- def computeIfPresent(key: K, remappingFunction: BiFunction[_ >: K, _ >: V, _ <: V]): V
- Definition Classes
- Map
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def forEach(action: BiConsumer[_ >: K, _ >: V]): Unit
- Definition Classes
- Map
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getOrDefault(key: Any, defaultValue: V): V
- Definition Classes
- Map
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def merge(key: K, value: V, remappingFunction: BiFunction[_ >: V, _ >: V, _ <: V]): V
- Definition Classes
- Map
- 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 putIfAbsent(key: K, value: V): V
- Definition Classes
- 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
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- 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.
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()