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 vote149 views1 answer
Madiar loh
C++
0 vote136 views1 answer
Programs using vectors in c++
C++
0 vote132 views1 answer
Kadane algo
C++
0 vote140 views1 answer
Making content editable
C++
0 vote136 views7 answers
Online converter c++ to c
C++
0 vote138 views1 answer
C++ execution time
C++
1 vote173 views3 answers
Minimum characters to make string palindrome
C++
0 vote125 views1 answer
Bool nullable to bool c#
C++
0 vote143 views1 answer
C++ find minimum value in vector
C++
29 votes135 views10 answers
Hello world c++
C++