RedBlackTree.bound

Returns a range pointing to all elements having their keys in [lowerKey, upperKey) interval.

Arguments

lowerKey
is the lower bound, inclusive.
upperKey
is the upper bound, exclusive.

Return values

The resulting

range
.

Complexity

O(log(size))

Example

"sl/redBlackTree" useFile a: ((35 "element") (0 "ZERO") (34 "element") (-25 "element") (19 "nineteen") (481 135) (32 {a:0; b:1;})) makeRedBlackTree; r: 19 35 a.bound; r [print LF print TRUE] enum
Output:
{ key: 19; value: "nineteen"; } { key: 32; value: { a:0; b: 1; }; } { key: 34; value: "element"; }