Find with hash set

#include <unordered_set>
#include <string>
#include <iostream>

int main() {
  std::unordered_set<std::string> planets{
    {"Venus"},
    {"Earth"},
    {"Mars"},
  };

  auto it = planets.find("Earth");
  if (it != planets.end()) {
    std::cout << *it << "\n";
  } else {
    std::cout << "No such planet.\n";
  }

  it = planets.find("PlanetX");
  if (it != planets.end()) {
    std::cout << *it << "\n";
  } else {
    std::cout << "No such planet.\n";
  }
}

Source: cppbyexample.com

Similar codes

0 vote249 views1 answer
How To Calculate 1+1 in c++
C++
0 vote288 views1 answer
C++ vector push if not exist
C++
0 vote235 views1 answer
What type is this c++
C++
1 vote241 views1 answer
Get first element of tuple c++
C++
0 vote241 views1 answer
Run c++ program in mac terminal
C++
0 vote253 views1 answer
Binary multiplication
C++
0 vote237 views1 answer
C++ do you not inherit constructor
C++
0 vote263 views1 answer
C++ sum a vector of digits
C++
2 votes224 views1 answer
Is javascript for websites only
C++
0 vote237 views1 answer
Transform cpp
C++