The set Type

A map is a collection of a keyvalue pairs , such as an address and phone number keyed to an individual's name. In contrast, a set is simply a collection of keys . For example, a business might define a set named bad_checks, to hold the names of individuals who have issued bad checks to the company. A set is most useful when we simply want to know whether a value is present . Before accepting a check, for example, that business would query bad_checks to see whether the customer’s name was present.

 

[Note] With two exceptions , set supports the same operations as map. The exceptions are that set does not provide a subscript operator and does not define mapped_type . In a set, the value_type is not a pair: instead it and key_type are the same type. They are each the type of the elements stored in the set. These differences reflect the fact that set holds only key; there is no value associated with the key . As with map, the keys of a set must be unique and may not be changed .

 

To use a set, we must include the set header . The operations on sets are essentially identical to those on maps.

[An example: to use set]

/* 将指定文件中的单词作为“排除集”读入到set类型的对象中， 然后，从通过标准输入输入一些单词，并将其中包含在“排除集” 中的单词过滤掉，将其余的单词输出显示。 2010-4-12 wcdj VS2008 */ #include <iostream> #include <fstream> #include <map> #include <set> #include <string> #include <vector> using namespace std; void restricted_wc(ifstream &removeFile, map<string,int> &wordCount, vector<string> &svec) { set<string> excluded;// set to hold words we'll ignore string remove_word; while (removeFile>>remove_word) { excluded.insert(remove_word); } // read input and keep a count for words that aren't in the exclusion set string word; cout<<"Enter some words(Ctrl+Z to end): "<<endl; while (cin>>word) { // increment counter only if the word is not in excluded if (!excluded.count(word)) { ++wordCount[word]; // use vector to save svec.push_back(word); } } } int main() { map<string,int> wordCount; vector<string> svec; string fileName; // read excluding file and open it cout<<"Enter filename: "<<endl; cin>>fileName; ifstream exFile(fileName.c_str());// the current work path // other work path /* char path[128]={0}; //memcpy(path,"c://",strlen("c://")*sizeof(char)); //strcat(path,fileName.c_str()); ifstream exFile(path); */ if (!exFile)// can not open { cout<<"error: can not open file: "<<fileName<<endl; return -1; } // call restricted_wc restricted_wc(exFile,wordCount,svec); // print result cout<<"word/t/ttimes/t(not including words in exFile)"<<endl; map<string,int>::const_iterator iter=wordCount.begin(); while (iter!=wordCount.end()) { cout<<iter->first<<"/t/t"<<iter->second<<endl; ++iter; } // print the content in original order vector<string>::const_iterator it=svec.begin(); while (it!=svec.end()) { cout<<*it++<<" "; } cout<<endl; return 0; }

output:

[Another example]

[set used]

// 将从键盘输入的n个小写字母中重复的字母删除，并输出删除重复后的字母序列和字母的个数。 #include<iostream> #include<string> #include<set> #include <utility>// pair #include <vector> using namespace std; int main() { set<char> cset; vector<char> cvec; string str; cout<<"Enter a string: "<<endl; cin>>str; const char* psz=str.c_str(); while( *psz) { pair<set<char>::iterator,bool> ret=cset.insert(*psz); if (ret.second)// insert successfully { cvec.push_back(*psz); } ++psz; } // print in original order vector<char>::const_iterator viter=cvec.begin(); while (viter!=cvec.end()) { cout<<*viter++; } cout<<endl; // print in dictionary order set<char>::iterator siter=cset.begin(); while(siter!=cset.end()) { cout<<*siter++; } cout<<endl<<"the number of different letter is: "<<cset.size()<<endl; return 0; } /* output: Enter a string: cccbba cba abc the number of different letter is: 3 */

[map used]

#include<iostream> #include<string> #include<map> using namespace std; int main() { map<char,int> s; string str; cout<<"Enter a string: "<<endl; cin>>str; const char* psz=str.c_str(); while( *psz) { ++s[*psz++]; } map<char,int>::iterator iter=s.begin(); cout<<"letter/t/tcount"<<endl; while(iter!=s.end()) { cout<<iter->first<<"/t/t"<<iter->second<<endl; ++iter; } iter=s.begin(); size_t count=0; while(iter!=s.end()) { cout<<iter++->first; ++count; } cout<<endl<<"the number of different letter is: "<<count<<endl; return 0; } /* output: Enter a string: cccbba letter count a 1 b 2 c 3 abc the number of different letter is: 3 */