STL之初体验

#include <vector>
#include <map>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <iostream>
using namespace std;

#if 0
int main()
{
	vector<int> c;
	vector<int>::iterator it1;
	
	int a[5]={1,2,3,4,5};
	c.assign(a, a+5);
	c.assign(5, 1);
	c.push_back(6);
	c.insert(c.begin()+3, 4);
	//c.clear();
	//if(c.empty())
	//	cout<<" 空的vector"<<endl;
	sort(c.begin(), c.end());

	for(it1=c.begin(); it1!=c.end(); it1++)
	{
		cout<<(*it1)<<endl;
	}

	cout<<"vector当前元素个数是"<<c.size()<<endl;//等同于c.capacity()
	cout<<"vector第4个元素是"<<c.at(3)<<endl;
	cout<<"vector最大范围是"<<c.max_size()<<endl;
	cout<<"vector第一个元素是"<<*(c.begin())<<endl;//等同于cout<<c.front()<<endl;
	cout<<"vector最后一个元素是"<<*(c.rbegin())<<endl;

	c.~vector<int>();//销毁所有数据，释放内存
	return 0;
}

#elif 0
int main()
{
	map<int, double> m;
	pair<int, double> entry(1, 0.5);
	m.insert(entry);

	//访问关键值为2的double数据,不存在便插入
	double num = m[2];
	
	//找不到便插入
	int key = 3;
	map<int, double>::iterator it1 = m.find(key);
	if(it1 != m.end())
	{	
		double num1 = it1->second;
		cout<<num1<<endl;
	}

	return 0;
}
#elif 0
int main()
{
	stack<int> s;//定义容器
	stack<int, list<int>> names;//基于列表来定义堆栈 

	for(int i=0; i<10; i++)
	{
		s.push(i);
	}

	while(!s.empty())
	{
		cout<<s.top()<<endl;
		s.pop();
	}
	return 0;
}
#else
int main()
{
	set<int, less<int>, allocator<int>> s;
	set<int>::iterator it1;

	s.insert(10);
	s.insert(3);
	s.insert(5);
	s.insert(5);

	cout<<"set的所有元素：\n";
	for(it1=s.begin(); it1!=s.end(); it1++)
	{
		cout<<*it1<<endl;
	}
	cout<<"-------------------end--------------------\n";

	cout<<*(s.find(5))<<endl;

	return 0;
}
#endif

参考：http://www.cnblogs.com/dongsheng/articles/2654070.html