libref.spec

RedBlackTree

object RedBlackTree

This is a simplified version of the Red-Black Tree implementation used for TreeMaps and TreeSets in the Scala standard library, based on Stefan Kahrs' Haskell version of Okasaki's Red-Black Trees

References:

See also

RBTree in the official Scala library

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RedBlackTree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. case class BlackTree(key: BigInt, value: BigInt, left: Tree, right: Tree) extends Tree with Product with Serializable

  2. case class RedTree(key: BigInt, value: BigInt, left: Tree, right: Tree) extends Tree with Product with Serializable

  3. sealed abstract class Tree extends AnyRef

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. object Leaf extends Tree with Product with Serializable

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. def contains(tree: Tree, x: BigInt): Boolean

  10. def delete(tree: Tree, k: BigInt): Tree

  11. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  14. def find(tree: Tree, x: BigInt): Option[BigInt]

  15. def findMax(tree: Tree): BigInt

  16. def findMin(tree: Tree): BigInt

  17. def findNth(tree: Tree, n: BigInt): Option[BigInt]

  18. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  19. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  21. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  22. final def notify(): Unit

    Definition Classes
    AnyRef

  23. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  24. def size(tree: Tree): BigInt

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

    Definition Classes
    AnyRef

  26. def toString(): String

    Definition Classes
    AnyRef → Any

  27. def update(tree: Tree, k: BigInt, v: BigInt, overwrite: Boolean): Tree

  28. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  30. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped