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

1 vote325 views1 answer
C++ integer array
C++
0 vote331 views1 answer
Contoh space
C++
0 vote351 views1 answer
Sum of first 100 natural numbers
C++
0 vote319 views1 answer
Prevent getting data from data-tooltip-content tippyjs
C++
0 vote329 views2 answers
C++ char it is a number
C++
2 votes255 views1 answer
Read int from file c++
C++
-1 vote306 views1 answer
Palindrome no example
C++
0 vote374 views1 answer
C++ fibo
C++
0 vote320 views1 answer
At c++ vector
C++
0 vote317 views2 answers
C++ program to find prime number using function
C++