Cycle through a map in reverse. : Map « Data Structure « C++

Home C++ 1. Bitset 2. Class 3. Console 4. Data Structure 5. Data Type 6. Deque 7. Development 8. File 9. Function 10. Generic 11. Language 12. List 13. Map Multimap 14. Overload 15. Pointer 16. Qt 17. Queue Stack 18. Set Multiset 19. STL Algorithms Binary search 20. STL Algorithms Heap 21. STL Algorithms Helper 22. STL Algorithms Iterator 23. STL Algorithms Merge 24. STL Algorithms Min Max 25. STL Algorithms Modifying sequence operations 26. STL Algorithms Non modifying sequence operations 27. STL Algorithms Sorting 28. STL Basics 29. String 30. Valarray 31. Vector C / ANSI-C C Tutorial C++ Tutorial Visual C++ .NET

C++ » Data Structure » Map Screenshots  Cycle through a map in reverse. #include <iostream> #include <map> using namespace std; int main() {   map<char, int> mapObject;   int i;   for(i = 0; i <26; i++)     mapObject.insert(pair<char, int>('A' + i, 65 + i));   map<char, int>::reverse_iterator p;      for(p = mapObject.rbegin(); p != mapObject.rend(); p++) {     cout << p->first << " has ASCII value of ";     cout << p->second << endl;   }   return 0; }                     Related examples in the same category 1. A map: insert pair, find, end 2. A map of opposites. 3. A map of word opposites, using strings. 4. Cycle through a map using an iterator. 5. Using [] in Map 6. [] automatically inserts elements. 7. Maps can store only unique keys. 8. Use a map to create a phone directory: string class 9. Use the greater function object in Map 10. Demonstrating a multimap. 11. Use a multimap to create the phone directory. 12. A simple map: char and int 13. Use a map of strings to create a phone directory. 14. File and map