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 vote150 views1 answer
Prefix array algorithm in c++
C++
1 vote168 views1 answer
Isprime c++
C++
0 vote192 views1 answer
Function to calculate compound interest in C++
C++
0 vote157 views1 answer
C++ method name
C++
1 vote166 views1 answer
Swap using Function template in c++
C++
6 votes190 views9 answers
Preorder to postorder converter online
C++
0 vote203 views1 answer
Sizeof’ on array function parameter ‘arr’ will return size of ‘int*’ [-Wsizeof-array-argument]
C++
1 vote167 views1 answer
Unique ptr c++
C++
0 vote159 views1 answer
Sento freddo a un dente
C++
0 vote185 views1 answer
Frequency of a substring in a string c++
C++