NearestMapLike

abstract def empty: M

abstract def iNode(color: Color, d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

Instantiate an internal node.

abstract def keyOrdering: Numeric[K]

Ordering that also supports linear distance |x-y|

abstract def node(k: K): Option[INode[K]]

Obtain the node stored at a given key if it exists, None otherwise

abstract def nodeMax: Option[INode[K]]

abstract def nodeMin: Option[INode[K]]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +[V2 >: V](kv2: (K, V2)): M

def +[B1 >: V](elem1: (K, B1), elem2: (K, B1), elems: (K, B1)*): SortedMap[K, B1]

def ++[B1 >: V](xs: GenTraversableOnce[(K, B1)]): SortedMap[K, B1]

def ++[B >: (K, V), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[M, B, That]): That

def ++:[B >: (K, V), That](that: Traversable[B])(implicit bf: CanBuildFrom[M, B, That]): That

def ++:[B >: (K, V), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[M, B, That]): That

def -(k: K): M

Obtain a new container with key removed

def -(elem1: K, elem2: K, elems: K*): M

def --(xs: GenTraversableOnce[K]): M

def /:[B](z: B)(op: (B, (K, V)) ⇒ B): B

def :\[B](z: B)(op: ((K, V), B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, (K, V)) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (V) ⇒ C): PartialFunction[K, C]

final def append(tl: Node[K], tr: Node[K]): Node[K]

def apply(key: K): V

def applyOrElse[A1 <: K, B1 >: V](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

final def bNode(d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

create a new Black node from a key, value, left subtree and right subtree

final def balance(node: Node[K]): Node[K]

final def balanceDel(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

final def balanceLeft(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

final def balanceRight(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

final def blacken(node: Node[K]): Node[K]

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[(K, V), B])(implicit bf: CanBuildFrom[M, B, That]): That

def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]

def compare(k0: K, k1: K): Int

def compose[A](g: (A) ⇒ K): (A) ⇒ V

def contains(k: K): Boolean

Returns true if key is present in the container, false otherwise

def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: (K, V)](xs: Array[B]): Unit

def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit

def count(p: ((K, V)) ⇒ Boolean): Int

def coverL(k: K): Cover[(K, V)]

def coverLNodes(k: K): Cover[IN]

def coverR(k: K): Cover[(K, V)]

def coverRNodes(k: K): Cover[IN]

def default(key: K): V

final def delLeft(node: INode[K], k: K): INode[K]

final def delRight(node: INode[K], k: K): INode[K]

def drop(n: Int): M

def dropRight(n: Int): M

def dropWhile(p: ((K, V)) ⇒ Boolean): M

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: ((K, V)) ⇒ Boolean): Boolean

def filter(p: ((K, V)) ⇒ Boolean): M

def filterKeys(p: (K) ⇒ Boolean): SortedMap[K, V]

def filterNot(p: ((K, V)) ⇒ Boolean): M

def finalize(): Unit

def find(p: ((K, V)) ⇒ Boolean): Option[(K, V)]

def firstKey: K

def flatMap[B, That](f: ((K, V)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[M, B, That]): That

def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, (K, V)) ⇒ B): B

def foldRight[B](z: B)(op: ((K, V), B) ⇒ B): B

def forall(p: ((K, V)) ⇒ Boolean): Boolean

def foreach[U](f: ((K, V)) ⇒ U): Unit

def from(from: K): M

def get(k: K): Option[V]

Get the value stored at a key, or None if key is not present

final def getClass(): Class[_]

def getNode(k: K): Option[IN]

Get the internal node stored at at key, or None if key is not present

def getOrElse[B1 >: V](key: K, default: ⇒ B1): B1

def groupBy[K](f: ((K, V)) ⇒ K): Map[K, M]

def grouped(size: Int): Iterator[M]

def hasAll(j: Iterator[K]): Boolean

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (K, V)

def headOption: Option[(K, V)]

def init: M

def inits: Iterator[M]

def isDefinedAt(key: K): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(K, V)]

Iterator over (key,val) pairs, in key order

def iteratorFrom(k: K): Iterator[(K, V)]

def keyMax: Option[K]

Maximum key stored in this collection

def keyMin: Option[K]

Minimum key stored in this collection

def keySet: SortedSet[K]

def keys: Iterable[K]

A container of keys, in key order

def keysIterator: Iterator[K]

Iterator over keys, in key order

def keysIteratorFrom(k: K): Iterator[K]

def last: (K, V)

def lastKey: K

def lastOption: Option[(K, V)]

def lift: (K) ⇒ Option[V]

def map[B, That](f: ((K, V)) ⇒ B)(implicit bf: CanBuildFrom[M, B, That]): That

def mapValues[C](f: (V) ⇒ C): SortedMap[K, C]

def max[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)

def maxBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)

def min[B >: (K, V)](implicit cmp: Ordering[B]): (K, V)

def minBy[B](f: ((K, V)) ⇒ B)(implicit cmp: Ordering[B]): (K, V)

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def nearest(k: K): Seq[(K, V)]

Return entries nearest to a given key.

def nearestNodes(k: K): Seq[IN]

Obtain the nodes nearest to a key

def newBuilder: Builder[(K, V), M]

def nodes: Iterable[IN]

A container of underlying nodes, in key order

def nodesFrom(k: K): Iterable[IN]

A container of nodes, in key order, having key >= k

def nodesIterator: Iterator[IN]

Iterator over nodes, in key order

def nodesIteratorFrom(k: K): Iterator[IN]

Iterator over nodes, in key order, having key >= k

def nodesIteratorRange(from: Option[K], until: Option[K]): Iterator[IN]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def ordering: Ordering[K]

def par: ParMap[K, V]

def parCombiner: Combiner[(K, V), ParMap[K, V]]

def partition(p: ((K, V)) ⇒ Boolean): (M, M)

def product[B >: (K, V)](implicit num: Numeric[B]): B

final def rNode(d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

create a new Red node from a key, value, left subtree and right subtree

def range(from: K, until: K): M

def rangeImpl(from: Option[K], until: Option[K]): M

final def redden(node: Node[K]): Node[K]

def reduce[A1 >: (K, V)](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: (K, V)](op: (B, (K, V)) ⇒ B): B

def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) ⇒ B): Option[B]

def reduceOption[A1 >: (K, V)](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: (K, V)](op: ((K, V), B) ⇒ B): B

def reduceRightOption[B >: (K, V)](op: ((K, V), B) ⇒ B): Option[B]

def repr: M

def reversed: List[(K, V)]

def runWith[U](action: (V) ⇒ U): (K) ⇒ Boolean

def sameElements[B >: (K, V)](that: GenIterable[B]): Boolean

def scan[B >: (K, V), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[M, B, That]): That

def scanLeft[B, That](z: B)(op: (B, (K, V)) ⇒ B)(implicit bf: CanBuildFrom[M, B, That]): That

def scanRight[B, That](z: B)(op: ((K, V), B) ⇒ B)(implicit bf: CanBuildFrom[M, B, That]): That

def seq: M

def size: Int

def slice(from: Int, until: Int): M

def sliding(size: Int, step: Int): Iterator[M]

def sliding(size: Int): Iterator[M]

def span(p: ((K, V)) ⇒ Boolean): (M, M)

def splitAt(n: Int): (M, M)

def stringPrefix: String

def sum[B >: (K, V)](implicit num: Numeric[B]): B

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

def tail: M

def tails: Iterator[M]

def take(n: Int): M

def takeRight(n: Int): M

def takeWhile(p: ((K, V)) ⇒ Boolean): M

def thisCollection: Iterable[(K, V)]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (K, V), Col[(K, V)]]): Col[(K, V)]

def to(to: K): M

def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[C >: (K, V)]: Buffer[C]

def toCollection(repr: M): Iterable[(K, V)]

def toIndexedSeq: IndexedSeq[(K, V)]

def toIterable: Iterable[(K, V)]

def toIterator: Iterator[(K, V)]

def toList: List[(K, V)]

def toMap[T, U](implicit ev: <:<[(K, V), (T, U)]): Map[T, U]

def toSeq: Seq[(K, V)]

def toSet[B >: (K, V)]: Set[B]

def toStream: Stream[(K, V)]

def toString(): String

def toTraversable: Traversable[(K, V)]

def toVector: Vector[(K, V)]

def until(until: K): M

def updated[B1 >: V](key: K, value: B1): SortedMap[K, B1]

def values: Iterable[V]

Container of values, in key order

def valuesIterator: Iterator[V]

Iterator over values, in key order

def valuesIteratorFrom(k: K): Iterator[V]

def view(from: Int, until: Int): IterableView[(K, V), M]

def view: IterableView[(K, V), M]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: ((K, V)) ⇒ Boolean): FilterMonadic[(K, V), M]

def zip[A1 >: (K, V), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[M, (A1, B), That]): That

def zipAll[B, A1 >: (K, V), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[M, (A1, B), That]): That

def zipWithIndex[A1 >: (K, V), That](implicit bf: CanBuildFrom[M, (A1, Int), That]): That

def /:\[A1 >: (K, V)](z: A1)(op: (A1, A1) ⇒ A1): A1