Reverse Iterator

Definitions

1. An iterator that traverses a collection from its last element to its first, inverting the default traversal order. In C++ STL, reverse iterators are obtained via rbegin() and rend() and internally decrement the underlying forward iterator.

   In plain English: A way to loop through a list backwards, from the end to the beginning.

   Example: "Use a reverse iterator to walk the sorted vector from the largest element down without copying and reversing the whole thing."

Related Terms

• Destructor
• Header File
• Mapping
• RAII
• Smart Pointer
• STL
• Virtual Function
• Hash Map