RichJTreeMap

Type Members

final class DescendingKeyIterator extends PrivateEntryIterator[K]

Attributes
private[java.util]
Definition Classes
TreeMap
final class EntryIterator extends PrivateEntryIterator[Entry[K, V]]

Attributes
private[java.util]
Definition Classes
TreeMap
class EntrySet extends AbstractSet[Entry[K, V]]

Attributes
private[java.util]
Definition Classes
TreeMap
final class KeyIterator extends PrivateEntryIterator[K]

Attributes
private[java.util]
Definition Classes
TreeMap
abstract class PrivateEntryIterator[T] extends Iterator[T]

Attributes
private[java.util]
Definition Classes
TreeMap
final class ValueIterator extends PrivateEntryIterator[V]

Attributes
private[java.util]
Definition Classes
TreeMap
class Values extends AbstractCollection[V]

Attributes
private[java.util]
Definition Classes
TreeMap

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(arg0: K): Entry[K, V]

Definition Classes
TreeMap → NavigableMap
def ceilingKey(arg0: K): K

Definition Classes
TreeMap → NavigableMap
def clear(): Unit

Definition Classes
TreeMap → AbstractMap → Map
def clone(): AnyRef

Definition Classes
TreeMap → AbstractMap → AnyRef
def comparator(): Comparator[_ >: K]

Definition Classes
TreeMap → SortedMap
def compute(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V

Definition Classes
Map
def computeIfAbsent(arg0: K, arg1: Function[_ >: K, _ <: V]): V

Definition Classes
Map
def computeIfPresent(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V

Definition Classes
Map
def containsKey(arg0: Any): Boolean

Definition Classes
TreeMap → AbstractMap → Map
def containsValue(arg0: 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 dropWhile(predicate: (K, V) ⇒ Boolean): Unit

Remove elements from the beginning of the collection until predicate evaluates to false
Remove elements from the beginning of the collection until predicate evaluates to false
predicate
a function to be applied to each key value pair in the map. All elements for which this function evaluates true up to the first element (not inclusive) for which it returns false are removed.
def entrySet(): Set[Entry[K, V]]

Definition Classes
TreeMap → SortedMap → AbstractMap → Map
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AbstractMap → Map → AnyRef → Any
def filter(predicate: (K, V) ⇒ Boolean): Unit

Remove all elements from this collection not satisfying the predicate function
Remove all elements from this collection not satisfying the predicate function
predicate
a function to be applied to each key value pair in the map. Only elements which for which this function evaluates to true are retained
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def firstEntry(): Entry[K, V]

Definition Classes
TreeMap → NavigableMap
def firstKey(): K

Definition Classes
TreeMap → SortedMap
def floorEntry(arg0: K): Entry[K, V]

Definition Classes
TreeMap → NavigableMap
def floorKey(arg0: K): K

Definition Classes
TreeMap → NavigableMap
def forEach(arg0: BiConsumer[_ >: K, _ >: V]): Unit

Definition Classes
TreeMap → Map
def foreach(fun: (K, V) ⇒ Unit): Unit

Apply an operation to each element in order
Apply an operation to each element in order
fun
function to execute on each entry
def get(arg0: Any): V

Definition Classes
TreeMap → AbstractMap → Map
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getOrDefault(arg0: Any, arg1: V): V

Definition Classes
Map
def hashCode(): Int

Definition Classes
AbstractMap → Map → AnyRef → Any
def headMap(arg0: K): SortedMap[K, V]

Definition Classes
TreeMap → NavigableMap → SortedMap
def headMap(arg0: K, arg1: Boolean): NavigableMap[K, V]

Definition Classes
TreeMap → NavigableMap
def higherEntry(arg0: K): Entry[K, V]

Definition Classes
TreeMap → NavigableMap
def higherKey(arg0: 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 → SortedMap → AbstractMap → Map
def lastEntry(): Entry[K, V]

Definition Classes
TreeMap → NavigableMap
def lastKey(): K

Definition Classes
TreeMap → SortedMap
def lowerEntry(arg0: K): Entry[K, V]

Definition Classes
TreeMap → NavigableMap
def lowerKey(arg0: K): K

Definition Classes
TreeMap → NavigableMap
def merge(arg0: K, arg1: V, arg2: BiFunction[_ >: V, _ >: V, _ <: V]): V

Definition Classes
Map
def navigableKeySet(): NavigableSet[K]

Definition Classes
TreeMap → NavigableMap
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def pollFirstEntry(): Entry[K, V]

Definition Classes
TreeMap → NavigableMap
def pollLastEntry(): Entry[K, V]

Definition Classes
TreeMap → NavigableMap
def put(arg0: K, arg1: V): V

Definition Classes
TreeMap → AbstractMap → Map
def putAll(arg0: Map[_ <: K, _ <: V]): Unit

Definition Classes
TreeMap → AbstractMap → Map
def putIfAbsent(arg0: K, arg1: V): V

Definition Classes
Map
def remove(arg0: Any): V

Definition Classes
TreeMap → AbstractMap → Map
def remove(arg0: Any, arg1: Any): Boolean

Definition Classes
Map
def replace(arg0: K, arg1: V): V

Definition Classes
TreeMap → Map
def replace(arg0: K, arg1: V, arg2: V): Boolean

Definition Classes
TreeMap → Map
def replaceAll(arg0: BiFunction[_ >: K, _ >: V, _ <: V]): Unit

Definition Classes
TreeMap → Map
def size(): Int

Definition Classes
TreeMap → AbstractMap → Map
def subMap(arg0: K, arg1: K): SortedMap[K, V]

Definition Classes
TreeMap → NavigableMap → SortedMap
def subMap(arg0: K, arg1: Boolean, arg2: K, arg3: Boolean): NavigableMap[K, V]

Definition Classes
TreeMap → NavigableMap
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tailMap(arg0: K): SortedMap[K, V]

Definition Classes
TreeMap → NavigableMap → SortedMap
def tailMap(arg0: K, arg1: Boolean): NavigableMap[K, V]

Definition Classes
TreeMap → NavigableMap
def toString(): String

Definition Classes
AbstractMap → AnyRef → Any
def values(): Collection[V]

Definition Classes
TreeMap → SortedMap → 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( ... )

Related Docs: object RichJTreeMap | package util

class RichJTreeMap[K, V] extends TreeMap[K, V]

Type Members

final class DescendingKeyIterator extends PrivateEntryIterator[K]

final class EntryIterator extends PrivateEntryIterator[Entry[K, V]]

class EntrySet extends AbstractSet[Entry[K, V]]

final class KeyIterator extends PrivateEntryIterator[K]

abstract class PrivateEntryIterator[T] extends Iterator[T]

final class ValueIterator extends PrivateEntryIterator[V]

class Values extends AbstractCollection[V]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def ceilingEntry(arg0: K): Entry[K, V]

def ceilingKey(arg0: K): K

def clear(): Unit

def clone(): AnyRef

def comparator(): Comparator[_ >: K]

def compute(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V

def computeIfAbsent(arg0: K, arg1: Function[_ >: K, _ <: V]): V

def computeIfPresent(arg0: K, arg1: BiFunction[_ >: K, _ >: V, _ <: V]): V

def containsKey(arg0: Any): Boolean

def containsValue(arg0: Any): Boolean

def descendingKeySet(): NavigableSet[K]

def descendingMap(): NavigableMap[K, V]

def dropWhile(predicate: (K, V) ⇒ Boolean): Unit

def entrySet(): Set[Entry[K, V]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filter(predicate: (K, V) ⇒ Boolean): Unit

def finalize(): Unit

def firstEntry(): Entry[K, V]

def firstKey(): K

def floorEntry(arg0: K): Entry[K, V]

def floorKey(arg0: K): K

def forEach(arg0: BiConsumer[_ >: K, _ >: V]): Unit

def foreach(fun: (K, V) ⇒ Unit): Unit

def get(arg0: Any): V

final def getClass(): Class[_]

def getOrDefault(arg0: Any, arg1: V): V

def hashCode(): Int

def headMap(arg0: K): SortedMap[K, V]

def headMap(arg0: K, arg1: Boolean): NavigableMap[K, V]

def higherEntry(arg0: K): Entry[K, V]

def higherKey(arg0: K): K

def isEmpty(): Boolean

final def isInstanceOf[T0]: Boolean

def keySet(): Set[K]

def lastEntry(): Entry[K, V]

def lastKey(): K

def lowerEntry(arg0: K): Entry[K, V]

def lowerKey(arg0: K): K

def merge(arg0: K, arg1: V, arg2: BiFunction[_ >: V, _ >: V, _ <: V]): V

def navigableKeySet(): NavigableSet[K]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pollFirstEntry(): Entry[K, V]

def pollLastEntry(): Entry[K, V]

def put(arg0: K, arg1: V): V

def putAll(arg0: Map[_ <: K, _ <: V]): Unit

def putIfAbsent(arg0: K, arg1: V): V

def remove(arg0: Any): V

def remove(arg0: Any, arg1: Any): Boolean

def replace(arg0: K, arg1: V): V

def replace(arg0: K, arg1: V, arg2: V): Boolean

def replaceAll(arg0: BiFunction[_ >: K, _ >: V, _ <: V]): Unit

def size(): Int

def subMap(arg0: K, arg1: K): SortedMap[K, V]

def subMap(arg0: K, arg1: Boolean, arg2: K, arg3: Boolean): NavigableMap[K, V]

final def synchronized[T0](arg0: ⇒ T0): T0

def tailMap(arg0: K): SortedMap[K, V]

def tailMap(arg0: K, arg1: Boolean): NavigableMap[K, V]

def toString(): String

def values(): Collection[V]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit