1、越界，可以结合stdexcept使用out_of_range类进行针对性异常处理；

#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <exception>
using namespace std; 

int main () throw (exception)  

{
    vector<int> v(5);
    fill(v.begin(),v.end(),1); 

    copy(v.begin(),v.end(),
            ostream_iterator<int>(cout," "));
    cout << endl; 

    try
    {
        for ( int i=0; i<10; i++ )
            cout << v.at(i) << " ";
        cout << endl;
    }
    catch( exception& e )
    {
        cout << endl << "Exception: "
             << e.what() << endl;
    }
    cout << "End of program" << endl; 

    return 0;
}
运行结果:
// 1 1 1 1 1
// 1 1 1 1 1
// Exception: vector::_M_range_check
// End of program 阅读全文

1、stack——容器适配器之一，实现堆栈功能，及FILO（先进后出）的数据结构，成员函数有push, pop, size, top, empty；

#include <iostream>
#include <stack>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std; 

int main ()
{
    vector<int> v1(5), v2(5), v3(5);
    iota(v1.begin(), v1.end(), 0);
    iota(v2.begin(), v2.end(), 5);
    iota(v3.begin(), v3.end(), 10); 

    stack<vector<int> > s;
    s.push(v1);
    s.push(v2);
    s.push(v3);

    cout << "size of stack 's' = "
         << s.size() << endl;
    if ( v3 != v2 )
        s.pop();

    cout << "size of stack 's' = "
         << s.size() << endl;
    vector<int> top = s.top();
    cout << "Contents of v2 : "; 

    copy(top.begin(),top.end(),
            ostream_iterator(cout," "));
    cout << endl; 

    while ( !s.empty() )
        s.pop(); 

    cout << "Stack 's' is " << (s.empty() ? ""
            : "not ") << "empty" << endl;

    return 0;
}
运行结果:
// size of stack 's' = 3
// size of stack 's' = 2
// Contents of v2 : 5 6 7 8 9
// Stack 's' is empty

阅读全文

begin
iterator begin();
begin()函数返回一个迭代器，指向multimap的第一个元素。

clear
void clear();
clear()函数删除multimap中的所有元素。

count
size_type count( const key_type &key );
count()函数返回multimap中键值等于key的元素的个数。

阅读全文