Range.rbound
Returns a range pointing to all elements that are less than a given key. Applicable to RedBlackTreeRange only.
Arguments
key
is the upper bound, exclusive.
Return values
The resulting
range
.
Complexity
O(log(treeSize))
Example
Output:
{ key: 1; value: "ONE"; }
{ key: 2; value: "TWO"; }