Scala Library
scala.collection.immutable.RedBlack

class Tree
[source: scala/collection/immutable/RedBlack.scala]
@serializable

abstract class Tree[+B]
extends AnyRef
Direct Known Subclasses:
RedBlack.NonEmpty, RedBlack.Empty
Method Summary
abstract def count : Int
abstract def del (k : A) : Tree[B]
def delete (k : A) : Tree[B]
abstract def elements : ImmutableIterator[(A, B)]
abstract def elementsSlow : Iterator[(A, B)]
abstract def first : A
abstract def isBlack : Boolean
abstract def isEmpty : Boolean
abstract def last : A
abstract def lookup (x : A) : Tree[B]
abstract def range (from : Option[A], until : Option[A]) : Tree[B]
abstract def smallest : NonEmpty[B]
abstract def upd [B1 >: B](k : A, v : B1) : Tree[B1]
def update [B1 >: B](k : A, v : B1) : Tree[B1]
abstract def visit [T](input : T)(f : (T, A, B) => (Boolean, T)) : (Boolean, T)
Methods inherited from AnyRef
getClass, hashCode, equals, clone, toString, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized
Methods inherited from Any
==, !=, isInstanceOf, asInstanceOf
Method Details
abstract def isEmpty : Boolean
abstract def isBlack : Boolean
abstract def lookup(x : A) : Tree[B]
def update[B1 >: B](k : A, v : B1) : Tree[B1]
def delete(k : A) : Tree[B]
abstract def visit[T](input : T)(f : (T, A, B) => (Boolean, T)) : (Boolean, T)
abstract def elements : ImmutableIterator[(A, B)]
abstract def elementsSlow : Iterator[(A, B)]
abstract def upd[B1 >: B](k : A, v : B1) : Tree[B1]
abstract def del(k : A) : Tree[B]
abstract def smallest : NonEmpty[B]
abstract def range(from : Option[A], until : Option[A]) : Tree[B]
abstract def first : A
abstract def last : A
abstract def count : Int
Scala Library