Class

xerial.core.collection.RedBlackTree

NonEmpty

Related Doc: package RedBlackTree

Permalink

abstract class NonEmpty extends Tree[A, B]

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

Instance Constructors

  1. new NonEmpty()

    Permalink

Abstract Value Members

  1. abstract def isBlack: Boolean

    Permalink
    Definition Classes
    Tree

  2. abstract def key: A

    Permalink
    Definition Classes
    Tree

  3. abstract def left: Tree[A, B]

    Permalink
    Definition Classes
    Tree

  4. abstract def right: Tree[A, B]

    Permalink
    Definition Classes
    Tree

  5. abstract def value: B

    Permalink
    Definition Classes
    NonEmpty → Tree

Concrete 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
    NonEmpty → Tree

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. def getKey: Some[A]

    Permalink
    Definition Classes
    NonEmpty → Tree

  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  13. def insert(k: A, v: B): Tree[A, B]

    Permalink
    Definition Classes
    NonEmpty → Tree

  14. def isEmpty: Boolean

    Permalink
    Definition Classes
    NonEmpty → Tree

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    NonEmpty → Tree

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

    Permalink
    Definition Classes
    NonEmpty → Tree

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

    Permalink
    Definition Classes
    Tree

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

    Permalink
    Definition Classes
    AnyRef

  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    NonEmpty → Tree

  25. final def wait(): Unit

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

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

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

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

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

Inherited from Tree[A, B]

Inherited from AnyRef

Inherited from Any

Ungrouped