Range.lbound

Returns a range pointing to all elements that are not less than a given key. Applicable to RedBlackTreeRange only.

Arguments

key
is the lower bound, inclusive.

Return values

The resulting

range
.

Complexity

O(log(treeSize))

Example

"sl/redBlackTree" useFile rb: ((1 "ONE") (2 "TWO") (10 "TEN") (50 "FIFTY")) makeRedBlackTree; r: rb.makeRange; 2 r.lbound [print LF print TRUE] enum
Output:
{ key: 2; value: "TWO"; } { key: 10; value: "TEN"; } { key: 50; value: "FIFTY"; }