NearestSet

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 &(that: GenSet[K]): NearestSet[K]

def &~(that: GenSet[K]): NearestSet[K]

def +(k: K): NearestSet[K]

Obtain a new container with key inserted

def +(elem1: K, elem2: K, elems: K*): NearestSet[K]

def ++(elems: GenTraversableOnce[K]): NearestSet[K]

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

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

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

def -(k: K): NearestSet[K]

Obtain a new container with key removed

def -(elem1: K, elem2: K, elems: K*): NearestSet[K]

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

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

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

def andThen[A](g: (Boolean) ⇒ A): (K) ⇒ A

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

def apply(elem: K): Boolean

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, B])(implicit bf: CanBuildFrom[NearestSet[K], B, That]): That

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

def companion: GenericCompanion[Set]

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

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

def contains(k: K): Boolean

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

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

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

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

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

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

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

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

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

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

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

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

def diff(that: GenSet[K]): NearestSet[K]

def drop(n: Int): NearestSet[K]

def dropRight(n: Int): NearestSet[K]

def dropWhile(p: (K) ⇒ Boolean): NearestSet[K]

def empty: NearestSet[K]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: (K) ⇒ Boolean): NearestSet[K]

def filterNot(p: (K) ⇒ Boolean): NearestSet[K]

def finalize(): Unit

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

def firstKey: K

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

def flatten[B](implicit asTraversable: (K) ⇒ GenTraversableOnce[B]): Set[B]

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

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

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

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

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

def from(from: K): NearestSet[K]

def genericBuilder[B]: Builder[B, Set[B]]

final def getClass(): Class[_]

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

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

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

def grouped(size: Int): Iterator[NearestSet[K]]

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: K

def headOption: Option[K]

def init: NearestSet[K]

def inits: Iterator[NearestSet[K]]

def intersect(that: GenSet[K]): NearestSet[K]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[K]

Iterator over keys, in key order

def keyMax: Option[K]

Maximum key stored in this collection

def keyMin: Option[K]

Minimum key stored in this collection

def keySet: NearestSet[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

def lastKey: K

def lastOption: Option[K]

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

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

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

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

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

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]

Return entries nearest to a given key.

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

Obtain the nodes nearest to a key

def newBuilder: Builder[K, NearestSet[K]]

def nodes: Iterable[INodeNear[K]]

A container of underlying nodes, in key order

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

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

def nodesIterator: Iterator[INodeNear[K]]

Iterator over nodes, in key order

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

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

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

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def ordering: Ordering[K]

def par: ParSet[K]

def parCombiner: Combiner[K, ParSet[K]]

def partition(p: (K) ⇒ Boolean): (NearestSet[K], NearestSet[K])

def product[B >: K](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): NearestSet[K]

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

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

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

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

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

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

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

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

def repr: NearestSet[K]

def reversed: List[K]

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

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

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

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

def seq: NearestSet[K]

def size: Int

def slice(from: Int, until: Int): NearestSet[K]

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

def sliding(size: Int): Iterator[NearestSet[K]]

def span(p: (K) ⇒ Boolean): (NearestSet[K], NearestSet[K])

def splitAt(n: Int): (NearestSet[K], NearestSet[K])

def stringPrefix: String

def subsetOf(that: GenSet[K]): Boolean

def subsets: Iterator[NearestSet[K]]

def subsets(len: Int): Iterator[NearestSet[K]]

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

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

def tail: NearestSet[K]

def tails: Iterator[NearestSet[K]]

def take(n: Int): NearestSet[K]

def takeRight(n: Int): NearestSet[K]

def takeWhile(p: (K) ⇒ Boolean): NearestSet[K]

def thisCollection: Iterable[K]

def to(to: K): NearestSet[K]

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

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

def toBuffer[A1 >: K]: Buffer[A1]

def toCollection(repr: NearestSet[K]): Iterable[K]

def toIndexedSeq: IndexedSeq[K]

def toIterable: Iterable[K]

def toIterator: Iterator[K]

def toList: List[K]

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

def toSeq: Seq[K]

def toSet[B >: K]: Set[B]

def toStream: Stream[K]

def toString(): String

def toTraversable: Traversable[K]

def toVector: Vector[K]

def transpose[B](implicit asTraversable: (K) ⇒ GenTraversableOnce[B]): Set[Set[B]]

def union(that: GenSet[K]): NearestSet[K]

def until(until: K): NearestSet[K]

def unzip[A1, A2](implicit asPair: (K) ⇒ (A1, A2)): (Set[A1], Set[A2])

def unzip3[A1, A2, A3](implicit asTriple: (K) ⇒ (A1, A2, A3)): (Set[A1], Set[A2], Set[A3])

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

def view: IterableView[K, NearestSet[K]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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

def |(that: GenSet[K]): NearestSet[K]

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