#include<iostream>
#include<vector>
#include<list>
#include<set>
#include<algorithm>
using namespace std;
void Output(char val)
{
cout << val << ' ';
}
int main()
{
set<char> cset;
cset.insert('B');
cset.insert('C');
cset.insert('D');
cset.insert('E');
cset.insert('F');
cset.insert('G');
cout << "old set is " << endl;
set<char>::iterator it;
for (it = cset.begin(); it != cset.end(); it++)
cout << *it << endl;
char temp;
temp = 'D';
it = cset.find(temp);
cout << "start find element is" << temp;
if (it == cset.end())
{
cout << "not find " << endl;
}
else
cout << "found" << endl;
char ctemp = 'G';
it = cset.find(ctemp);
cout << "start find element is" << ctemp;
if (it == cset.end())
{
cout << "not find " << endl;
}
else
cout << "found" << endl;
system("pause");
return 0;
}
set(集合类)模板的使用
最新推荐文章于 2023-03-23 23:24:54 发布