Determine if map contains a value for a key?

by

As long as the map is not a multimap, one of the most elegant ways would be to use the count method

if (m.count(key))
    // key exists

The count would be 1 if the element is indeed present in the 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. Reverse map lookup
  7. What’s the difference between “STL” and “C++ Standard Library”?
  8. std::vector::resize() vs. std::vector::reserve()
  9. How to convert wstring into string?
  10. Why use iterators instead of array indices?
  11. How do I erase an element from std::vector by index?
  12. Can standard container templates be instantiated with incomplete types?
  13. Is list::size() really O(n)?
  14. Sort list using STL sort function
  15. Heterogeneous containers in C++
  16. What does the standard library guarantee about self move assignment?
  17. How to filter items from a std::map? [duplicate]
  18. Is the use of std::vector objects in C++ acceptable, or should I use an alternative?
  19. std::optional specialization for reference types
  20. How do I store arrays in an STL list?
  21. Can we use a user defined class for the key in a STL map?
  22. Are const_iterators faster?
  23. How to use the priority queue STL for objects?
  24. Why the libc++ std::vector internally keeps three pointers instead of one pointer and two sizes?
  25. Visual c++ “for each” portability
  26. Is stl vector concurrent read thread-safe?
  27. Should you overload swap in the std namespace?
  28. Missing C++ header after updating OSX Command Line Tools 6.3
  29. const auto std::initializer_list difference between Clang and GCC
  30. What C++ pitfalls should I avoid? [closed]

Leave a Comment