Node

Node struct template

Template parameters: eb_node = libebtree's internal node type Key = key type (signed/unsigned integer) eb_getkey = Key ( eb_node* node ); returns the key of node.

eb_next = eb_node* ( eb_node* n ); returns the next node for n or null if n is the last node in the tree. eb_prev = eb_node* ( eb_node* n ); returns the previous node for n or null if n is the first node in the tree.

eb_next_unique = same as eb_next but skips key duplicates. eb_prev_unique = same as eb_prev but skips key duplicates.

eb_delete = void ( eb_node* n ); removes n from the tree.

struct Node (

eb_node

Key

alias eb_getkey

alias eb_next

alias eb_prev

alias eb_prev_unique

alias eb_next_unique

alias eb_delete

) {

Key key();

typeof(&this) next();

typeof(&this) prev();

typeof(&this) next_unique();

typeof(&this) prev_unique();

}

Members

Functions

key Key key(): Obtains the key of this node.
next typeof(&this) next(): Obtains the next node in the tree to which this node is associated.
next_unique typeof(&this) next_unique(): Obtains the next node in the tree to which this node is associated, skipping key duplicates.
prev typeof(&this) prev(): Obtains the previous node in the tree to which this node is associated.
prev_unique typeof(&this) prev_unique(): Obtains the previous node in the tree to which this node is associated, skipping key duplicates.

Node

Members

Functions

Meta

Source