Range.bound
Returns a range pointing to all elements with keys within given bounds. Applicable to RedBlackTreeRange only.
Arguments
lowerKey
is the lower bound, inclusive.upperKey
is the upper bound, exclusive.
Return values
The resulting
range
.
Complexity
O(log(treeSize))
Example
Output:
{ key: 2; value: "TWO"; }
{ key: 10; value: "TEN"; }