in scala.collection.immutable.RedBlack
class Tree

[scala.serializable]
`abstract class` Tree [+B]
  `extends` java.lang.Object
  `with` scala.ScalaObject

Direct Known Subclasses:
  NonEmpty, NonEmpty, NonEmpty

Constructor Summary
| `def` this

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

Constructor Detail

`def` this

Def Detail

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

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

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

`abstract def` isBlack : scala.Boolean

`abstract def` isEmpty : scala.Boolean

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

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

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

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