p133.cpp

代码中包含了部分作者侯捷的<<STL源码剖析>>一书中的程序实例,有助于理解及应用STL,来进行方便高效的编程

#include <list>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
	//int i;
	list<int>ilist;
	cout<<"size="<<ilist.size()<<endl;

	ilist.push_back(0);
	ilist.push_back(1);
	ilist.push_back(2);
	ilist.push_back(3);
	ilist.push_back(4);
	cout<<"size="<<ilist.size()<<endl;

	list<int>::iterator ite;

	for(ite=ilist.begin();ite!=ilist.end();++ite)
		cout<<*ite<<' ';
	cout<<endl;

	ite=find(ilist.begin(),ilist.end(),3);
	if(ite!=0)
		ilist.insert(ite,99);

	cout<<"size="<<ilist.size()<<endl;
	cout<<*ite<<endl;

	for(ite=ilist.begin();ite!=ilist.end();++ite)
		cout<<*ite<<' ';
	cout<<endl;

	ite=find(ilist.begin(),ilist.end(),1);
	if(ite!=0)
		cout<<*(ilist.erase(ite))<<endl;

	for(ite=ilist.begin();ite!=ilist.end();++ite)
		cout<<*ite<<' ';
	cout<<endl;

	int iv[5]={5,6,7,8,9};
	list<int>ilist2(iv,iv+5);

	ite=find(ilist.begin(),ilist.end(),99);
	ilist.splice(ite,ilist2);
	for(ite=ilist.begin();ite!=ilist.end();++ite)
		cout<<*ite<<' ';
	cout<<endl;

	ilist.reverse();
	for(ite=ilist.begin();ite!=ilist.end();++ite)
		cout<<*ite<<' ';
	cout<<endl;

	ilist.sort();
	for(ite=ilist.begin();ite!=ilist.end();++ite)
		cout<<*ite<<' ';
	cout<<endl;

	return 0;
}