RedBlackTree.lbound

Returns a range pointing to all elements with keys not less than a given key.

Arguments

The bound

key
.

Return values

range
is the resulting RedBlackTreeRange.

Complexity

O(log(size))

Example

"sl/redBlackTree" useFile a: RedBlackTree; 35 "element" a.insert 0 "ZERO" a.insert 34 "element" a.insert -25 "element" a.insert 19 "nineteen" a.insert 3481 135 a.insert 32 { a:0; b:1; } a.insert r: 32 a.lbound; r [print LF print TRUE] enum
Output:
{ key: 32; value: { a:0; b: 1; }; } { key: 34; value: "element"; } { key: 35; value: "element"; } { key: 3481; value: 135; }