BBTree.lowerBound

Gets the lower bound node corresponding to the given key, or %NULL if the tree is empty or all the nodes in the tree have keys that are strictly lower than the searched key.

The lower bound is the first node that has its key greater than or equal to the searched key.

class BBTree
lowerBound
(
void* key
)

Parameters

key void*

the key to calculate the lower bound for

Return Value

Type: TreeNode

the tree node corresponding to the lower bound, or %NULL if the tree is empty or has only keys strictly lower than the searched key.

Meta

Since

2.68