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 vote139 views1 answer
Haxelib install cpp
C++
0 vote137 views1 answer
F && T || !(T) && F
C++
1 vote147 views1 answer
How to fix class friendship errors in c++
C++
1 vote139 views1 answer
Concurrency in c++
C++
1 vote139 views1 answer
What is the associative property of an operator
C++
0 vote137 views1 answer
Disallowcopy c++
C++
8 votes135 views1 answer
Arduino for command
C++
0 vote173 views1 answer
How to declare an enum variable c++
C++
4 votes164 views2 answers
Extended euclidean algorithm
C++
0 vote143 views1 answer
Remove a element from an array c++
C++