How can I make the map::find operation case insensitive?

by

It does not by default. You will have to provide a custom comparator as a third argument. Following snippet will help you…

  /************************************************************************/
  /* Comparator for case-insensitive comparison in STL assos. containers  */
  /************************************************************************/
  struct ci_less : std::binary_function<std::string, std::string, bool>
  {
    // case-independent (ci) compare_less binary function
    struct nocase_compare : public std::binary_function<unsigned char,unsigned char,bool> 
    {
      bool operator() (const unsigned char& c1, const unsigned char& c2) const {
          return tolower (c1) < tolower (c2); 
      }
    };
    bool operator() (const std::string & s1, const std::string & s2) const {
      return std::lexicographical_compare 
        (s1.begin (), s1.end (),   // source range
        s2.begin (), s2.end (),   // dest range
        nocase_compare ());  // comparison
    }
  };

Use it like std::map< std::string, std::vector<std::string>, ci_less > myMap;

NOTE: std::lexicographical_compare has some nitty-gritty details. String comparison isn’t always straightforward if you consider locales. See this thread on c.l.c++ if interested.

UPDATE: With C++11 std::binary_function is deprecated and is unnecessary as the types are deduced automatically.

  struct ci_less
  {
    // case-independent (ci) compare_less binary function
    struct nocase_compare
    {
      bool operator() (const unsigned char& c1, const unsigned char& c2) const {
          return tolower (c1) < tolower (c2); 
      }
    };
    bool operator() (const std::string & s1, const std::string & s2) const {
      return std::lexicographical_compare 
        (s1.begin (), s1.end (),   // source range
        s2.begin (), s2.end (),   // dest range
        nocase_compare ());  // comparison
    }
  };

More Related Contents:

  1. Case insensitive std::string.find()
  2. c++ push reference node to stl list
  3. Parsing a comma-delimited std::string [duplicate]
  4. How can I use std::maps with user-defined types as key?
  5. Remove spaces from std::string in C++
  6. Why should one not derive from c++ std string class?
  7. Why is std::map implemented as a red-black tree?
  8. How to retrieve all keys (or values) from a std::map and put them into a vector?
  9. Const map element access
  10. How to find if a given key exists in a C++ std::map
  11. In STL maps, is it better to use map::insert than []?
  12. Is the order of iterating through std::map known (and guaranteed by the standard)?
  13. How to implode a vector of strings into a string (the elegant way)
  14. std::map emplace without copying value
  15. Why does C++ allow an integer to be assigned to a string?
  16. Is it reasonable to use std::basic_string as a contiguous buffer when targeting C++03?
  17. Why can’t I write to a string literal while I *can* write to a string object?
  18. std::strings’s capacity(), reserve() & resize() functions
  19. How to choose between map and unordered_map?
  20. How to read and write a STL C++ string?
  21. initializing std::string from char* without copy
  22. How can I sort an STL map by value?
  23. std::string length() and size() member functions
  24. converting a variable name to a string in C++
  25. Why doesn’t std::string provide implicit conversion to char*?
  26. Using std::map where V has no usable default constructor
  27. How can I copy one map into another using std::copy?
  28. How to convert a string of hex values to a string?
  29. STL map containing references does not compile
  30. C++ inserting unique_ptr in map

Leave a Comment