class RBTreeNode[K: Comparable, E: nullable Object]

trees :: RBTreeNode

RedBlackTree node (can be red or black)

Introduced properties

private var _is_red: Bool

trees :: RBTreeNode :: _is_red

Is the node red?
init defaultinit(key: K, value: E)

trees :: RBTreeNode :: defaultinit

private fun is_red: Bool

trees :: RBTreeNode :: is_red

Is the node red?
private fun is_red=(is_red: Bool)

trees :: RBTreeNode :: is_red=

Is the node red?

Redefined properties

redef type N: RBTreeNode[K, E]

trees $ RBTreeNode :: N

TreeNode type
redef type SELF: RBTreeNode[K, E]

trees $ RBTreeNode :: SELF

Type of this instance, automatically specialized in every class
redef fun to_dot: String

trees $ RBTreeNode :: to_dot

Return dot representation of this node

All properties

fun !=(other: nullable Object): Bool

core :: Object :: !=

Have self and other different values?
abstract fun <(other: OTHER): Bool

core :: Comparable :: <

Is self lesser than other?
fun <=(other: OTHER): Bool

core :: Comparable :: <=

not other < self
fun <=>(other: OTHER): Int

core :: Comparable :: <=>

-1 if <, +1 if > and 0 otherwise
fun ==(other: nullable Object): Bool

core :: Object :: ==

Have self and other the same value?
fun >(other: OTHER): Bool

core :: Comparable :: >

other < self
fun >=(other: OTHER): Bool

core :: Comparable :: >=

not self < other
type CLASS: Class[SELF]

core :: Object :: CLASS

The type of the class of self.
type N: TreeNode[K, E]

trees :: TreeNode :: N

TreeNode type
type OTHER: Comparable

core :: Comparable :: OTHER

What self can be compared to?
type SELF: Object

core :: Object :: SELF

Type of this instance, automatically specialized in every class
private var _is_red: Bool

trees :: RBTreeNode :: _is_red

Is the node red?
private var _key: K

trees :: TreeNode :: _key

key for this node
private var _left_node: nullable N

trees :: BinTreeNode :: _left_node

private var _next: nullable BinTreeNode[K, E]

trees :: BinTreeNode :: _next

private var _parent: nullable N

trees :: TreeNode :: _parent

Direct parent of this node (null if the node is root)
private var _prev: nullable BinTreeNode[K, E]

trees :: BinTreeNode :: _prev

private var _right_node: nullable N

trees :: BinTreeNode :: _right_node

private var _value: E

trees :: TreeNode :: _value

value stored in the node
fun clamp(min: OTHER, max: OTHER): OTHER

core :: Comparable :: clamp

Constraint self within [min..max]
protected fun class_factory(name: String): CLASS

core :: Object :: class_factory

Implementation used by get_class to create the specific class.
fun class_name: String

core :: Object :: class_name

The class name of the object.
init defaultinit(key: K, value: E)

trees :: RBTreeNode :: defaultinit

init defaultinit(key: K, value: E)

trees :: BinTreeNode :: defaultinit

init defaultinit(key: K, value: E)

trees :: TreeNode :: defaultinit

fun depth: Int

trees :: TreeNode :: depth

Depth in tree (length of the path from self to root)
fun get_class: CLASS

core :: Object :: get_class

The meta-object representing the dynamic type of self.
fun grandparent: nullable N

trees :: BinTreeNode :: grandparent

parent of the parent of this node (null if root)
fun hash: Int

core :: Object :: hash

The hash code of the object.
init init

core :: Object :: init

fun inspect: String

core :: Object :: inspect

Developer readable representation of self.
protected fun inspect_head: String

core :: Object :: inspect_head

Return "CLASSNAME:#OBJECTID".
fun is_between(c: OTHER, d: OTHER): Bool

core :: Comparable :: is_between

c <= self <= d
private fun is_red: Bool

trees :: RBTreeNode :: is_red

Is the node red?
private fun is_red=(is_red: Bool)

trees :: RBTreeNode :: is_red=

Is the node red?
intern fun is_same_instance(other: nullable Object): Bool

core :: Object :: is_same_instance

Return true if self and other are the same instance (i.e. same identity).
fun is_same_serialized(other: nullable Object): Bool

core :: Object :: is_same_serialized

Is self the same as other in a serialization context?
intern fun is_same_type(other: Object): Bool

core :: Object :: is_same_type

Return true if self and other have the same dynamic type.
fun key: K

trees :: TreeNode :: key

key for this node
protected fun key=(key: K)

trees :: TreeNode :: key=

key for this node
fun left: nullable N

trees :: BinTreeNode :: left

left tree node child (null if node has no left child)
fun left=(node: nullable N)

trees :: BinTreeNode :: left=

set left child for this node (or null if left no child)
private fun left_node: nullable N

trees :: BinTreeNode :: left_node

private fun left_node=(left_node: nullable N)

trees :: BinTreeNode :: left_node=

fun max(other: OTHER): OTHER

core :: Comparable :: max

The maximum between self and other (prefers self if equals).
fun min(c: OTHER): OTHER

core :: Comparable :: min

The minimum between self and c (prefer self if equals)
private intern fun native_class_name: CString

core :: Object :: native_class_name

The class name of the object in CString format.
private fun next: nullable BinTreeNode[K, E]

trees :: BinTreeNode :: next

private fun next=(next: nullable BinTreeNode[K, E])

trees :: BinTreeNode :: next=

intern fun object_id: Int

core :: Object :: object_id

An internal hash code for the object based on its identity.
fun output

core :: Object :: output

Display self on stdout (debug only).
intern fun output_class_name

core :: Object :: output_class_name

Display class name on stdout (debug only).
fun parent: nullable N

trees :: TreeNode :: parent

Direct parent of this node (null if the node is root)
fun parent=(parent: nullable N)

trees :: TreeNode :: parent=

Direct parent of this node (null if the node is root)
private fun prev: nullable BinTreeNode[K, E]

trees :: BinTreeNode :: prev

private fun prev=(prev: nullable BinTreeNode[K, E])

trees :: BinTreeNode :: prev=

fun right: nullable N

trees :: BinTreeNode :: right

right tree node child (null if node has no right child)
fun right=(node: nullable N)

trees :: BinTreeNode :: right=

set right child for this node (or null if right no child)
private fun right_node: nullable N

trees :: BinTreeNode :: right_node

private fun right_node=(right_node: nullable N)

trees :: BinTreeNode :: right_node=

fun serialization_hash: Int

core :: Object :: serialization_hash

Hash value use for serialization
fun sibling: nullable N

trees :: BinTreeNode :: sibling

Other child of the parent
intern fun sys: Sys

core :: Object :: sys

Return the global sys object, the only instance of the Sys class.
fun to_dot: String

trees :: TreeNode :: to_dot

Return dot representation of this node
abstract fun to_jvalue(env: JniEnv): JValue

core :: Object :: to_jvalue

fun to_s: String

core :: Object :: to_s

User readable representation of self.
fun uncle: nullable N

trees :: BinTreeNode :: uncle

Other child of the grandparent
fun value: E

trees :: TreeNode :: value

value stored in the node
protected fun value=(value: E)

trees :: TreeNode :: value=

value stored in the node
package_diagram trees::RBTreeNode RBTreeNode trees::BinTreeNode BinTreeNode trees::RBTreeNode->trees::BinTreeNode trees::TreeNode TreeNode trees::BinTreeNode->trees::TreeNode ...trees::TreeNode ... ...trees::TreeNode->trees::TreeNode

Ancestors

interface Comparable

core :: Comparable

The ancestor of class where objects are in a total order.
interface Object

core :: Object

The root of the class hierarchy.
abstract class TreeNode[K: Comparable, E: nullable Object]

trees :: TreeNode

Abstract node structure used in Tree implementation

Parents

class BinTreeNode[K: Comparable, E: nullable Object]

trees :: BinTreeNode

TreeNode used by BinTree

Class definitions

trees $ RBTreeNode 
# RedBlackTree node (can be red or black)
class RBTreeNode[K: Comparable, E]
	super BinTreeNode[K, E]

	redef type N: RBTreeNode[K, E]

	# Is the node red?
	private var is_red = true

	redef fun to_dot do
		if is_red then
			return "\"{self}\"[style=filled,fillcolor=red,fontcolor=white];\n"
		else
			return "\"{self}\"[style=filled,fillcolor=black,fontcolor=white];\n"
		end

	end
end
lib/trees/rbtree.nit:129,1--146,3
Nit tools. Version .