Constructor
# new ReverseIterator()
Example
let m = new TreeMap();
...
for (let it = m.rbegin(); !it.equals(m.rend()); it.next()) {
console.log(`key: ${it.key}, value: ${it.value}`);
}Members
Methods
# next() → {void}
Replaces node reference with the reference of the previous node in the container, because it works in reverse order Can be used for manual reverse iteration over a range of key-value pairs.
void
Example
let m = new TreeMap();
... // add key-value pairs., using numbers as keys
let from = new ReverseIterator(t.upperBound(50));
let to = new ReverseIterator(t.lowerBound(0));
let it = from;
while (!it.equals(to)) {
console.log(it.key);
it.next();
}# prev() → {void}
Replaces node reference with the reference of the next node in the container, because it works in reverse order Can be used for manual forward iteration over a range of key-value pairs.
void
Example
let m = new TreeMap();
... // add key-value pairs., using numbers as keys
let from = new ReverseIterator(t.upperBound(50));
let to = new ReverseIterator(t.lowerBound(0));
let it = to;
while (!it.equals(from)) {
it.prev();
console.log(it.key);
}