RedBlackTree.endIter

Returns an end iterator.

Arguments

None

Return values

iterator
is a RedBlackTreeIterator pointing to a non-existing element after the end of the tree. Getters and setters cannot be used for this iterator, it is only necessary for a condition of completing a search. The previous iterator for it points to the last element of the tree.

Complexity

Constant

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 it: a.firstIter; [ it a.endIter = ~ ] [ it.get print LF print it.next !it ] while
Output:
{ key: -25; value: "element"; } { key: 0; value: "ZERO"; } { key: 19; value: "nineteen"; } { key: 32; value: { a: 0; b: 1; }; } { key: 34; value: "element"; } { key: 35; value: "element"; } { key: 3481; value: 135; }