scala.collection.immutable.RedBlackTreeStealer

RedBlackTreeIsBinary

abstract class RedBlackTreeIsBinary[T, K, V] extends Binary[T, Tree[K, V]]

Linear Supertypes
Binary[T, Tree[K, V]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RedBlackTreeIsBinary
  2. Binary
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RedBlackTreeIsBinary()

Abstract Value Members

  1. abstract def value(n: Tree[K, V]): T

    Definition Classes
    RedBlackTreeIsBinary → Binary

Concrete 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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

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

  8. def depth(n: Tree[K, V]): Int

  9. def depthBound(total: Int, depth: Int): Int

    Definition Classes
    RedBlackTreeIsBinary → Binary

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

    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  12. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  14. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  15. def isEmptyLeaf(n: Tree[K, V]): Boolean

    Definition Classes
    RedBlackTreeIsBinary → Binary

  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  17. def left(n: Tree[K, V]): Tree[K, V]

    Definition Classes
    RedBlackTreeIsBinary → Binary

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

    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  21. def right(n: Tree[K, V]): Tree[K, V]

    Definition Classes
    RedBlackTreeIsBinary → Binary

  22. def sizeBound(total: Int, depth: Int): Int

    Definition Classes
    RedBlackTreeIsBinary → Binary

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

    Definition Classes
    AnyRef

  24. def toString(): String

    Definition Classes
    AnyRef → Any

  25. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Binary[T, Tree[K, V]]

Inherited from AnyRef

Inherited from Any

Ungrouped