Object

xerial.core.collection.RedBlackTree

Empty

Related Doc: package RedBlackTree

Permalink

object Empty extends Tree[A, B]

Linear Supertypes
Tree[A, B], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Empty
  2. Tree
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

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

    Permalink
    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

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

  9. def foreach[C](f: (Tree[A, B]) ⇒ C): Unit

    Permalink
    Definition Classes
    Empty → Tree

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. def getKey: Option[A]

    Permalink
    Definition Classes
    Tree

  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  13. def insert(k: A, v: B): RedTree

    Permalink
    Definition Classes
    Empty → Tree

  14. def isBlack: Boolean

    Permalink
    Definition Classes
    Empty → Tree

  15. def isEmpty: Boolean

    Permalink
    Definition Classes
    Empty → Tree

  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  17. def iterator: Iterator[(A, B)]

    Permalink
    Definition Classes
    Tree

  18. def key: A

    Permalink
    Definition Classes
    Empty → Tree

  19. def left: Empty.type

    Permalink
    Definition Classes
    Empty → Tree

  20. def lookup(e: A): Tree[A, B]

    Permalink
    Definition Classes
    Empty → Tree

  21. def map[C](f: (Tree[A, B]) ⇒ C): C

    Permalink
    Definition Classes
    Tree

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

    Permalink
    Definition Classes
    AnyRef

  23. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  25. def right: Empty.type

    Permalink
    Definition Classes
    Empty → Tree

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

    Permalink
    Definition Classes
    AnyRef

  27. def toString(): String

    Permalink
    Definition Classes
    Empty → AnyRef → Any

  28. def update(k: A, v: B): Tree[A, B]

    Permalink
    Definition Classes
    Empty → Tree

  29. def value: Nothing

    Permalink
    Definition Classes
    Empty → Tree

  30. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Tree[A, B]

Inherited from AnyRef

Inherited from Any

Ungrouped