STL顺序容器操作5

访问元素

   c.back()     c.front()     c[n]        c.at(n)

注意： c[n]和 c.at(n)  只适合vector 和deque容器

#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <stdexcept>

using namespace std;

int main( int argc, char ** argv )
{
	vector<int> ivec;
	ivec.push_back(10);
	ivec.push_back(20);
	ivec.push_back(30);

	cout<<ivec.front()<<endl;
	cout<<ivec.back()<<endl;

	vector<int>::reference a = ivec.front();
	vector<int>::reference b = ivec.back();
	
	cout<<b<<endl;
	cout<<a<<endl;

	vector<int>::reference c = *ivec.begin();
	vector<int>::reference d = *--ivec.end();
	cout<<"reference *ivec.begin(): "<<c<<endl;
	cout<<"reference *--ivec.end(): "<<d<<endl;

	cout<<"ivec[0]: "<<ivec[0]<<endl;
	cout<<"ivec.at[1]: "<<ivec.at(0)<<endl;


	try{
		cout<<ivec.at(300)<<endl;
	}catch(out_of_range){
		cout<<"error!!"<<endl;
	}

	list<int> lst;
	lst.push_back(100);
	if( ! lst.empty() )
	{
		cout<<lst.front()<<endl;
		cout<<lst.back()<<endl;
	}
	//err   cout<<lst.at(0)<<endl;
	//err   cout<<lst[0]<<endl;


	return 0;
}