Find mapped value of map

by

Because of how a map is designed, you’ll need to do the equivalent of a search on unordered data.

for (auto it = someMap.begin(); it != someMap.end(); ++it)
    if (it->second == someValue)
        return it->first;

More Related Contents:

  1. How can I use std::maps with user-defined types as key?
  2. How to retrieve all keys (or values) from a std::map and put them into a vector?
  3. In STL maps, is it better to use map::insert than []?
  4. How can I use an array as map value?
  5. C++ Thread-Safe Map
  6. Checking value exist in a std::map – C++
  7. std::map thread-safety
  8. Why Can’t I store references in a `std::map` in C++?
  9. c++ push reference node to stl list
  10. Insert into map with pair as key and list as value [closed]
  11. Is there any advantage of using map over unordered_map in case of trivial keys?
  12. Why does the C++ map type argument require an empty constructor when using []?
  13. Initializing a static std::map in C++
  14. Why is std::map implemented as a red-black tree?
  15. How can I create my own comparator for a map?
  16. Is the order of iterating through std::map known (and guaranteed by the standard)?
  17. What is the default constructor for C++ pointer?
  18. C++ Loop through Map
  19. How to choose between map and unordered_map?
  20. Super high performance C/C++ hash map (table, dictionary) [closed]
  21. Unresolved externals in C++ when using vectors and find
  22. How can I sort an STL map by value?
  23. C++ std::map holding ANY type of value
  24. Using std::map where V has no usable default constructor
  25. How can I make the map::find operation case insensitive?
  26. What would a std::map extended initializer list look like?
  27. What is difference between const and non const key?
  28. Are IEEE floats valid key types for std::map and std::set?
  29. map with incomplete value type
  30. C++ inserting unique_ptr in map

Leave a Comment