Trait

org.isarnproject.collections.mixmaps.increment.tree

INodeInc

Related Doc: package tree

Permalink

trait INodeInc[K, V] extends NodeInc[K, V] with INodeMap[K, V]

Internal R/B node supporting increment

Linear Supertypes
INodeMap[K, V], INode[K], NodeInc[K, V], NodeMap[K, V], Node[K], Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. INodeInc
  2. INodeMap
  3. INode
  4. NodeInc
  5. NodeMap
  6. Node
  7. Serializable
  8. Serializable
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def color: Color

    Permalink

    The Red/Black color of this node

    The Red/Black color of this node

    Definition Classes
    INode
  2. abstract def data: DataMap[K, V]

    Permalink

    Including, but not limited to, the key

    Including, but not limited to, the key

    Definition Classes
    INodeMapINode
  3. abstract def iNode(color: Color, d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

    Permalink

    Instantiate an internal node.

    Instantiate an internal node.

    Attributes
    protected
    Definition Classes
    Node
  4. abstract def keyOrdering: Ordering[K]

    Permalink

    The ordering that is applied to key values

    The ordering that is applied to key values

    Definition Classes
    Node
  5. abstract def lsub: NodeInc[K, V]

    Permalink

    The left sub-tree

    The left sub-tree

    Definition Classes
    INodeIncINode
  6. abstract def rsub: NodeInc[K, V]

    Permalink

    The right sub-tree

    The right sub-tree

    Definition Classes
    INodeIncINode
  7. abstract def valueMonoid: MonoidAPI[V]

    Permalink

    The monoid that defines what it means to increment a value

    The monoid that defines what it means to increment a value

    Definition Classes
    NodeInc

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 append(tl: Node[K], tr: Node[K]): Node[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. final def bNode(d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

    Permalink

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

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

    Attributes
    protected
    Definition Classes
    Node
  7. final def balance(node: Node[K]): Node[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  8. final def balanceDel(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  9. final def balanceLeft(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  10. final def balanceRight(x: Data[K], tl: Node[K], tr: Node[K]): INode[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  11. final def blacken(node: Node[K]): Node[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  12. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  13. final def del(k: K): Node[K]

    Permalink
    Definition Classes
    INodeNode
  14. final def delLeft(node: INode[K], k: K): INode[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  15. final def delRight(node: INode[K], k: K): INode[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  16. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  17. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  18. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  19. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  20. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  21. final def inc(di: DataMap[K, V]): Node[K]

    Permalink
    Definition Classes
    INodeIncNodeInc
  22. final def ins(d: Data[K]): Node[K]

    Permalink
    Definition Classes
    INodeNode
  23. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  24. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  25. final def node(k: K): Option[INode[K]]

    Permalink

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

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

    Definition Classes
    INodeNode
  26. final def nodeMax: Option[INode[K]]

    Permalink
    Definition Classes
    INodeNode
  27. final def nodeMin: Option[INode[K]]

    Permalink
    Definition Classes
    INodeNode
  28. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  29. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  30. final def rNode(d: Data[K], lsub: Node[K], rsub: Node[K]): INode[K]

    Permalink

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

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

    Attributes
    protected
    Definition Classes
    Node
  31. final def redden(node: Node[K]): Node[K]

    Permalink
    Attributes
    protected
    Definition Classes
    Node
  32. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  33. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  34. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long): Unit

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

Inherited from INodeMap[K, V]

Inherited from INode[K]

Inherited from NodeInc[K, V]

Inherited from NodeMap[K, V]

Inherited from Node[K]

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped