unordered_set的几种元素查找的方式

#include <iostream>
#include <unordered_set>
 
using namespace std;
 
int main()
{
	unordered_set<int> s;
	
	for(int i = 0; i < 3; i++) s.insert(i);
	
	cout << "find" << endl;
	if(s.find(1) != s.end()) cout << "Yes\n" << endl;
	
	cout << "count" << endl;
	if(s.count(1)) cout << "Yes\n" << endl;
	
	cout << "迭代器" << endl;
	for(unordered_set<int>::iterator it = s.begin(); it != s.end(); it++)
	{
		if(*it == 1) cout << "Yes\n" << endl;
	}
	
	cout << "auto" << endl;
	for(auto e : s)
		if(e == 1) cout << "Yes\n" << endl;
		
	return 0;
}