in scala.collection.immutable.RedBlack
class NonEmpty

[scala.serializable]
`abstract class` NonEmpty [+B]
  `extends` scala.collection.immutable.RedBlack.Tree[B]
  `with` scala.ScalaObject

Direct Known Subclasses:
  RedTree, BlackTree, RedTree, BlackTree, RedTree, BlackTree

Constructor Summary
| `def` this

Def Summary
| `def` del (k: A) : scala.collection.immutable.RedBlack.Tree[B]
| `def` elements : scala.Iterator[scala.Tuple2[A, B]]
| `def` isEmpty : scala.Boolean
`abstract` | `def` key : A
`abstract` | `def` left : scala.collection.immutable.RedBlack.Tree[B]
| `def` lookup (k: A) : scala.collection.immutable.RedBlack.Tree[B]
`abstract` | `def` right : scala.collection.immutable.RedBlack.Tree[B]
| `def` smallest : scala.collection.immutable.RedBlack.NonEmpty[B]
| `def` upd [B1 >: B] (k: A, v: B1) : scala.collection.immutable.RedBlack.Tree[B1]
`abstract` | `def` value : B

Def inherited from scala.collection.immutable.RedBlack.Tree[B]
del , delete, elements, isBlack, isEmpty, lookup, smallest, upd, update

Constructor Detail

`def` this

Def Detail

`def` del (k: A): scala.collection.immutable.RedBlack.Tree[B]

`def` elements : scala.Iterator[scala.Tuple2[A, B]]

`def` isEmpty : scala.Boolean

`abstract def` key : A

`abstract def` left : scala.collection.immutable.RedBlack.Tree[B]

`def` lookup (k: A): scala.collection.immutable.RedBlack.Tree[B]

`abstract def` right : scala.collection.immutable.RedBlack.Tree[B]

`def` smallest : scala.collection.immutable.RedBlack.NonEmpty[B]

`def` upd [B1 >: B](k: A, v: B1): scala.collection.immutable.RedBlack.Tree[B1]

`abstract def` value : B