test.cpp

这是一些STL的学习程序,是我以前学习STL时编写的,适合初学STL的人!有兴趣的可以下载下来看一看!

#include <string>
#include <list>
#include <iostream>
#include <algorithm>
using namespace std;
#pragma warning(disable:4786)//disable  掉VC Debug时对Debug信息超过255 个字符时的警告信息
void PrintIt(string& t)
{
	cout<<t<<endl;
}
bool Jude(string t)
{
	return t=="Lime";
}
int main (void) 
{
  list<string> Milkshakes;
  Milkshakes.push_back("Chocolate");
  Milkshakes.push_back("Strawberry");
  Milkshakes.push_front("Lime");
  Milkshakes.push_front("Vanilla");
  list<string>::iterator vi;

  if(!Milkshakes.empty())//判断是否为空
  {
	cout<<"no empty!"<<endl;
  }
  for(vi=Milkshakes.begin();vi!=Milkshakes.end();vi++)//遍历list
	  cout<<*vi<<endl;
	cout<<"for_each演示:"<<endl;
  for_each (Milkshakes.begin(),Milkshakes.end(),PrintIt);//for_each算法
  cout<<count(Milkshakes.begin(),Milkshakes.end(),"Lime")<<endl;//count()算法统计等于某个值的对象的个数。
	
  list<string>::iterator it;
  it=find(Milkshakes.begin(),Milkshakes.end(),"dd");
  if(it==Milkshakes.end())
	  cout << "dd not found in list" << endl;
  else
	  cout << "found in list" << endl;

  it=find_if(Milkshakes.begin(),Milkshakes.end(),Jude);//find_if返回迭代器
  cout<<*it<<endl;
	
	Milkshakes.insert(Milkshakes.begin(),"tt");
	Milkshakes.insert(Milkshakes.end(),"tt");
	Milkshakes.insert(Milkshakes.begin()++,"tt");
	string ins[]={"one","two","three"};
	Milkshakes.insert(Milkshakes.end(),&ins[0],&ins[3]);//把一个数组插入
	//Milkshakes.sort();//sort排序
	for(vi=Milkshakes.begin();vi!=Milkshakes.end();vi++)//遍历list
		cout<<*vi<<endl;

	/*
	list成员函数pop_front()删掉list中的第一个元素，pop_back()删掉最后一个元素。
	函数erase()删掉由一个iterator指出的元素。
	还有另一个erase()函数可以删掉一个范围的元素。 
	*/
	Milkshakes.pop_front();
	Milkshakes.pop_back();
	Milkshakes.erase(Milkshakes.begin());
	Milkshakes.erase(++Milkshakes.begin(), --Milkshakes.end());//删除一个范围
	Milkshakes.remove("tt");
	cout<<"删除后:"<<endl;
	for(vi=Milkshakes.begin();vi!=Milkshakes.end();vi++)//遍历list
		cout<<*vi<<endl;
  return 0;
}