Is the order of iterating through std::map known (and guaranteed by the standard)?

by

Yes, that’s guaranteed. Moreover, *begin() gives you the smallest and *rbegin() the largest element, as determined by the comparison operator, and two key values a and b for which the expression !compare(a,b) && !compare(b,a) is true are considered equal. The default comparison function is std::less<K>.

The ordering is not a lucky bonus feature, but rather, it is a fundamental aspect of the data structure, as the ordering is used to determine when two keys are the same (by the above rule) and to perform efficient lookup (essentially a binary search, which has logarithmic complexity in the number of elements).

More Related Contents:

  1. c++ push reference node to stl list
  2. How can I use std::maps with user-defined types as key?
  3. Why are Standard iterator ranges [begin, end) instead of [begin, end]?
  4. Why is std::map implemented as a red-black tree?
  5. How to retrieve all keys (or values) from a std::map and put them into a vector?
  6. Const map element access
  7. How to find if a given key exists in a C++ std::map
  8. In STL maps, is it better to use map::insert than []?
  9. Is there a way to access the underlying container of STL container adaptors?
  10. std::map emplace without copying value
  11. How to choose between map and unordered_map?
  12. How can I sort an STL map by value?
  13. Standard Library Containers with additional optional template parameters?
  14. Using std::map where V has no usable default constructor
  15. How can I make the map::find operation case insensitive?
  16. How can I copy one map into another using std::copy?
  17. STL map containing references does not compile
  18. C++ inserting unique_ptr in map
  19. Take the address of a one-past-the-end array element via subscript: legal by the C++ Standard or not?
  20. C++ sorting and keeping track of indexes
  21. Remove spaces from std::string in C++
  22. Why can’t I compile an unordered_map with a pair as key?
  23. Is it legal to recurse into main() in C++? [duplicate]
  24. Why is it OK to return a ‘vector’ from a function?
  25. vector::at vs. vector::operator[]
  26. std::vector and contiguous memory of multidimensional arrays
  27. How can currying be done in C++?
  28. std::map thread-safety
  29. STL algorithms: Why no additional interface for containers (additional to iterator pairs)?
  30. Does the C++ standard specify anything on the representation of floating point numbers?

Leave a Comment