scala.collection.immutable.TreeMap

Empty

object Empty extends Tree[Nothing] with Product

definition classes: RedBlack

Inherits

  1. Product
  2. Equals
  3. Tree
  4. AnyRef
  5. Any

Value Members

  1. def canEqual(arg0: Any): Boolean

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass

    A method that should be called from every well-designed equals method that is open to be overridden in a subclass. See Programming in Scala, Chapter 28 for discussion and design.

    definition classes: EmptyEquals
  2. def count: Int

  3. def del(k: A): Tree[Nothing]

  4. def delete(k: A): Tree[B]

  5. def elements: Iterator[(A, B)]

  6. def equals(arg0: Any): Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an equivalence relation:

    • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
    • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
    • It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same Int (o1.hashCode.equals(o2.hashCode)).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    definition classes: AnyRef ⇐ Any
  7. def first: Nothing

  8. def foreach[U](f: (A, Nothing) ⇒ U): Unit

  9. def hashCode(): Int

    Returns a hash code value for the object

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    definition classes: AnyRef ⇐ Any
  10. def isBlack: Boolean

  11. def isEmpty: Boolean

  12. def iterator: Iterator[(A, Nothing)]

  13. def last: Nothing

  14. def lookup(k: A): Tree[Nothing]

  15. def productArity: Int

    return k for a product A(x_1,

    return k for a product A(x_1,...,x_k)

    definition classes: EmptyProduct
  16. def productElement(arg0: Int): Any

    for a product A(x_1,

    for a product A(x_1,...,x_k), returns x_(n+1) for 0 <= n < k

    definition classes: EmptyProduct
  17. def productElements: Iterator[Any]

  18. def productIterator: Iterator[Any]

    An iterator that returns all fields of this product

    An iterator that returns all fields of this product

    definition classes: Product
  19. def productPrefix: String

    By default the empty string

    By default the empty string. Implementations may override this method in order to prepend a string prefix to the result of the toString methods.

    definition classes: EmptyProduct
  20. def range(from: Option[A], until: Option[A]): Empty

  21. def smallest: NonEmpty[Nothing]

  22. def toStream: Stream[(A, Nothing)]

  23. def upd[B](k: A, v: B): Tree[B]

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

  25. def visit[T](input: T)(f: (T, A, Nothing) ⇒ (Boolean, T)): (Boolean, T)