- rb_lookup(+Key, -Value, +Tree) is semidet
- True when Value is associated with Key in the Red-Black tree Tree.
The given Key may include variables, in which case the RB tree is
searched for a key with equivalent variables (using (==)/2). Time
complexity is O(log N) in the number of elements in the tree.
- See also
- - rb_in/3 for backtracking over keys.