Reverse map lookup

by

There isn’t much you can do about it. Your have options to work with two maps, use multi-key map like one from Boost Multi-Index library, or do linear search.

UPDATE: The most lightweight out of the box solution seems to be Boost.Bimap, which stands for bi-directional map.

More Related Contents:

  1. What requirements must std::map key classes meet to be valid keys?
  2. remove_if equivalent for std::map
  3. Using a STL map of function pointers
  4. Inspecting standard container (std::map) contents with gdb
  5. std::map, pointer to map key value, is this possible?
  6. Determine if map contains a value for a key?
  7. C++ sorting and keeping track of indexes
  8. Remove spaces from std::string in C++
  9. Why should one not derive from c++ std string class?
  10. Why can’t simple initialize (with braces) 2D std::array? [duplicate]
  11. Is it safe to assume that STL vector storage is always contiguous?
  12. Why can’t we declare a std::vector?
  13. Efficient way of reading a file into an std::vector?
  14. Determine if a type is an STL container at compile time
  15. Removing item from vector while iterating?
  16. string c_str() vs. data()
  17. stl::multimap – how do i get groups of data?
  18. C++ valarray vs. vector
  19. What is the difference between const_iterator and non-const iterator in the C++ STL?
  20. Is it reasonable to use std::basic_string as a contiguous buffer when targeting C++03?
  21. What is the preferred/idiomatic way to insert into a map?
  22. vector or map, which one to use?
  23. Custom Iterator in C++
  24. STL vector and thread-safety
  25. Adding types to the std namespace
  26. What happens if I read a map’s value where the key does not exist?
  27. Windows Unicode C++ Stream Output Failure
  28. STL remove doesn’t work as expected?
  29. Converting between C++ std::vector and C array without copying
  30. list of polymorphic objects

Leave a Comment