STL迭代器的种类及其功能介绍

#include
#include int main()
{std::vector<char> charVector;int x;for (x&＃61;0; x<10; &＃43;&＃43;x)charVector.push_back(65 &＃43; x);int size &＃61; charVector.size();for (x&＃61;0; xx){std::vector<char>::iterator start &＃61;charVector.begin();charVector.erase(start);std::vector<char>::iterator iter;for (iter &＃61; charVector.begin(); iter !&＃61; charVector.end(); iter&＃43;&＃43;){std::cout <<*iter;}std::cout << std::endl;}return 0;
}

#include
#include int main()
{std::deque<char> charDeque;int x;for (x&＃61;0; x<10; &＃43;&＃43;x)charDeque.push_front(65 &＃43; x);int size &＃61; charDeque.size();for (x&＃61;0; xx){std::deque<char>::iterator start &＃61;charDeque.begin();charDeque.erase(start);std::deque<char>::iterator iter;for (iter &＃61; charDeque.begin(); iter !&＃61; charDeque.end(); iter&＃43;&＃43;){std::cout <<*iter;}std::cout << std::endl;}return 0;
}

#include
#include int main()
{// Create and populate the list.int x;std::list<char> charList;for (x&＃61;0; x<10; &＃43;&＃43;x)charList.push_front(65 &＃43; x);// Display contents of list.std::cout <<"Original list: ";std::list<char>::iterator iter;for (iter &＃61; charList.begin(); iter !&＃61; charList.end(); iter&＃43;&＃43;){std::cout <<*iter;//char ch &＃61; *iter;//std::cout <
}std::cout << std::endl;// Insert five Xs into the list.std::list<char>::iterator start &＃61; charList.begin();charList.insert(&＃43;&＃43;start, 5, &＃39;X&＃39;);// Display the result.std::cout <<"Resultant list: ";for (iter &＃61; charList.begin(); iter !&＃61; charList.end(); iter&＃43;&＃43;){std::cout <<*iter;//char ch &＃61; *iter;//std::cout <
}return 0;
}

#include
#include <set>int main()
{// Create the set object.std::set<char> charSet;// Populate the set with values.charSet.insert(&＃39;E&＃39;);charSet.insert(&＃39;D&＃39;);charSet.insert(&＃39;C&＃39;);charSet.insert(&＃39;B&＃39;);charSet.insert(&＃39;A&＃39;);// Display the contents of the set.std::cout <<"Contents of set: " << std::endl;std::set<char>::iterator iter;for (iter &＃61; charSet.begin(); iter !&＃61; charSet.end(); iter&＃43;&＃43;)std::cout <<*iter << std::endl;std::cout << std::endl;// Find the D.iter &＃61; charSet.find(&＃39;D&＃39;);if (iter &＃61;&＃61; charSet.end())std::cout <<"Element not found.";elsestd::cout <<"Element found: " <<*iter;return 0;
}

#include
#include <set>int main()
{// Create the first set object.std::multiset<char> charMultiset1;// Populate the multiset with values.charMultiset1.insert(&＃39;E&＃39;);charMultiset1.insert(&＃39;D&＃39;);charMultiset1.insert(&＃39;C&＃39;);charMultiset1.insert(&＃39;B&＃39;);charMultiset1.insert(&＃39;A&＃39;);charMultiset1.insert(&＃39;B&＃39;);charMultiset1.insert(&＃39;D&＃39;);// Display the contents of the first multiset.std::cout <<"Contents of first multiset: " << std::endl;std::multiset<char>::iterator iter;for (iter &＃61; charMultiset1.begin();iter !&＃61; charMultiset1.end(); iter&＃43;&＃43;)std::cout <<*iter << std::endl;std::cout << std::endl;// Create the second multiset object.std::multiset<char> charMultiset2;// Populate the multiset with values.charMultiset2.insert(&＃39;J&＃39;);charMultiset2.insert(&＃39;I&＃39;);charMultiset2.insert(&＃39;H&＃39;);charMultiset2.insert(&＃39;G&＃39;);charMultiset2.insert(&＃39;F&＃39;);charMultiset2.insert(&＃39;G&＃39;);charMultiset2.insert(&＃39;I&＃39;);// Display the contents of the second multiset.std::cout <<"Contents of second multiset: "<< std::endl;for (iter &＃61; charMultiset2.begin();iter !&＃61; charMultiset2.end(); iter&＃43;&＃43;)std::cout <<*iter << std::endl;std::cout << std::endl;// Compare the sets.if (charMultiset1 &＃61;&＃61; charMultiset2)std::cout <<"set1 &＃61;&＃61; set2";else if (charMultiset1 < charMultiset2)std::cout <<"set1 ";else if (charMultiset1 > charMultiset2)std::cout <<"set1 > set2";return 0;
}

#include
#include

#include
#include

#include
#include
#include int main()
{std::stack<int, std::list<int> > intStack;int x;std::cout <<"Values pushed onto stack:"<< std::endl;for (x&＃61;1; x<11; &＃43;&＃43;x){intStack.push(x*100);std::cout <100 << std::endl;}std::cout <<"Values popped from stack:"<< std::endl;int size &＃61; intStack.size();for (x&＃61;0; xx){std::cout < std::endl;intStack.pop();}return 0;
}

#include
#include
#include int main()
{std::queue<int, std::list<int> > intQueue;int x;std::cout <<"Values pushed onto queue:"<< std::endl;for (x&＃61;1; x<11; &＃43;&＃43;x){intQueue.push(x*100);std::cout <100 << std::endl;}std::cout <<"Values removed from queue:"<< std::endl;int size &＃61; intQueue.size();for (x&＃61;0; xx){std::cout < std::endl;intQueue.pop();}return 0;
}

#include
#include
#include int main()
{std::priority_queue<int, std::vector<int>,std::greater<int> > intPQueue;int x;intPQueue.push(400);intPQueue.push(100);intPQueue.push(500);intPQueue.push(300);intPQueue.push(200);std::cout <<"Values removed from priority queue:"<< std::endl;int size &＃61; intPQueue.size();for (x&＃61;0; xx){std::cout < std::endl;intPQueue.pop();}return 0;
}