unordered_map test

unordmap.cpp

#include <iostream>
#include <string>
#include <unordered_map>

int main()
{
  std::string name;
  std::unordered_map<int,int> mymap;
  mymap.insert(std::make_pair<int,int>(1229,1));
  mymap.insert(std::make_pair<int,int>(8,0));
  mymap.insert(std::make_pair<int,int>(17,1));
  for (auto& x: mymap) {
      std::cout << x.first << ":" << x.second << std::endl;
  }
  std::unordered_map<int,int>::const_iterator item = mymap.find(17);
  if (item==mymap.end()) {
      std::cout << "not found" << std::endl;
  } else {
      std::cout << "found for " << item->first << ":" << item->second << std::endl;
  }
  return 0;
}