set容器的查找

set容器的查找

#include <iostream>
using namespace std;
#include <set>
int main()
{
	set<int>set1;
	for(int i=0;i<10;i++)
	{
		set1.insert(i+1);
	}
	for(set<int>::iterator it=set1.begin();it!=set1.end();it++)
	{
		cout<<*it<<" ";
	}
	cout<<endl;
	set<int>::iterator it0=set1.find(5);
	cout<<"it0:"<<*it0<<endl;
	int num1=set1.count(5);
	cout<<"num1:"<<num1<<endl;

	set<int>::iterator it1=set1.lower_bound(5);//大于等于5的元素的迭代器的位置
	cout<<"it1:"<<*it1<<endl;
	set<int>::iterator it2=set1.upper_bound(5);//大于5的元素的迭代器的位置
	cout<<"it2:"<<*it2<<endl;

	//typedef pair<iterator, bool> _Pairib;
	//typedef pair<iterator, iterator> _Pairii;
	//typedef pair<const_iterator, const_iterator> _Paircc;

	pair<set<int>::iterator, set<int>::iterator> mypair=set1.equal_range(5);
	set<int>::iterator it3=mypair.first;
	cout<<"it3:"<<*it3<<endl;//5 
	set<int>::iterator it4=mypair.second;
	cout<<"it4:"<<*it4<<endl;//6 
	//把元素5删除掉
	set1.erase(5);
	pair<set<int>::iterator, set<int>::iterator> mypair2=set1.equal_range(5);
	set<int>::iterator it5=mypair2.first;
	cout<<"it5:"<<*it5<<endl;//5删除后 6
	set<int>::iterator it6=mypair2.second;
	cout<<"it6:"<<*it6<<endl;//5删除后 6
	system("pause");
	return 0;
}