= (RedBlackTree)

Check if iterators point to the same entry.

Arguments

iterator0
and
iterator1
are RedBlackTreeIterators to compare.

Return values

condition
is TRUE if the iterators point ot the same entry, FALSE otherwise.

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; }