LNodeInc

abstract def iNode(color: Color, d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

Instantiate an internal node.

abstract def keyOrdering: Ordering[K]

The ordering that is applied to key values

abstract def valueMonoid: MonoidAPI[V]

The monoid that defines what it means to increment a value

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def append(tl: Node[K], tr: Node[K]): Node[K]

final def asInstanceOf[T0]: T0

final def bNode(d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

create a new Black node from a key, value, left subtree and right subtree

final def balance(node: Node[K]): Node[K]

final def balanceDel(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

final def balanceLeft(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

final def balanceRight(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

final def blacken(node: Node[K]): Node[K]

def clone(): AnyRef

final def del(k: K): LNode[K]

final def delLeft(node: INode[K], k: K): INode[K]

final def delRight(node: INode[K], k: K): INode[K]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def inc(di: DataMap[K, V]): INode[K]

final def ins(d: Data[K]): INode[K]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def node(k: K): None.type

Obtain the node stored at a given key if it exists, None otherwise

final def nodeMax: None.type

final def nodeMin: None.type

final def notify(): Unit

final def notifyAll(): Unit

final def rNode(d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

create a new Red node from a key, value, left subtree and right subtree

final def redden(node: Node[K]): Node[K]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit