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的元素的个数。

阅读全文

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

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

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

阅读全文

begin
iterator begin();
返回指向当前集合中第一个元素的迭代器。

clear
void clear();
清除当前集合中的所有元素。

count
size_type count( const key_type &key );
返回当前集合中出现的某个值的元素的数目。
阅读全文

1、rbegin、rend——容器逆序输出的头和尾

#include <iostream>
#include <set>
#include <iomanip>
#include <string>
using namespace std; 

template <class T>
class Member
{
    public:
        Member(T l, T f) : last(l), first(f) {}
        void print() const // const !!!
        {
            cout.setf(ios::left);
            cout << setw(15) << first.c_str()
                 << last << endl;
        }
    private:
        T first, last;
    // const !!!
    friend bool operator < (const Member& m1, const Member& m2)
    {
        return (m1.last < m2.last) ? true : false;
    }
    friend bool operator == (const Member& m1, const Member& m2)
    {
        return (m1.last == m2.last) ? true : false;
    }
};
//===============================================
int main () 
{
    typedef Member<string> M;
    typedef set<M, less<M> > S;
    M m("Frost","Robert");
    S s; 

    s.insert(m);  

    s.insert(M("Smith","John"));
    s.insert(M("Amstrong","Bill"));
    s.insert(M("Bain","Linda")); 

    S::iterator It = s.begin();
    while ( It != s.end() )
        (It++)->print();

    cout << endl; 

    S::reverse_iterator rI = s.rbegin();
    while ( rI != s.rend() )
        (rI++)->print(); 

    return 0;
}
运行结果:
// Bill           Amstrong
// Linda          Bain
// Robert         Frost
// John           Smith
//
// John           Smith
// Robert         Frost
// Linda          Bain
// Bill           Amstrong

阅读全文

1、erase——从容器中删除某个元素或者某个区间

#include <iostream>
#include <set>
using namespace std; 

void print (set<int, less<int> >& s)
{
    set<int, less<int> >::iterator It;
    for ( It = s.begin(); It != s.end(); It++ )
        cout << *It << " ";
    cout << endl;
}
//-------------------------------------------- 
int main () 
{
     int ary[] = {1,2,3,2,3,4,8,2,5,6};
     set<int, less<int> > s; 

     s.insert(ary,ary+10);
     print(s); 

     // erase '2' 
     s.erase(2);
     print(s);

     set<int, less<int> >::iterator It; 

     It = s.find(5); 

     // erase '5' 
     s.erase(It);
     print(s); 

     It = s.find(4);
     // erase from It to the end of set 
     s.erase(It,s.end());
     print(s); 

     return 0;
}
运行结果:
// 1 2 3 4 5 6 8 
// 1 3 4 5 6 8 
// 1 3 4 6 8 
// 1 3

阅读全文

1、构造函数

#include <iostream>
#include <set>

int main ()
{
    int ary[] = { 5,3,7,5,2,3,7,5,5,4 };
    set<int> s1;
    set<int, greater<int> > s2;
    for ( int i=0; i<sizeof(ary)/sizeof(int); i++ )
    {
        s1.insert(ary[i]);
        s2.insert(ary[i]);
    }
    set<int>::iterator It = s1.begin();
    cout << "s1 : ";    
    while ( It != s1.end() )
        cout << *(It++) << " ";
    cout << endl;
    It = s2.begin();
    cout << "s2 : ";    
    while ( It != s2.end() )
        cout << *(It++) << " ";
    cout << endl;
    // 第二种形式的构造
    set<int> s3(ary,ary+3);
    It = s3.begin();
    cout << "s3 : ";    
    while ( It != s3.end() )
        cout << *(It++) << " ";
    cout << endl;
    //拷贝构造
    set<int, less > s4(s1);
    It = s4.begin();
    cout << "s4 : ";
    while ( It != s4.end() )
    cout << *(It++) << " ";
    cout << endl;

    return 0;
}
运行结果:
// s1 : 2 3 4 5 7
// s2 : 7 5 4 3 2
// s3 : 3 5 7
// s4 : 2 3 4 5 7

阅读全文

1、resize——减小或者扩大容器的容量

#include <iostream>
#include <list> 

int main () 
{
    list<int> l(10); 

    cout << "Size of list l = "
         << l.size(); 

    l.resize(100);
    cout << "After l.resize(100)" << endl;
    cout << "Size of list l = "
         << l.size();
    l.resize(5);
    cout << "After l.resize(5)" << endl;
    cout << "Size of list l = "
         << l.size(); 

    return 0; 
}
运行结果:
// Size of list l = 10After l.resize(100)
// Size of list l = 100After l.resize(5)
// Size of list l = 5

阅读全文

1、max_size——容器能申请到的最大容量

#include <iostream>
#include <list> 

int main ()
{
    list li(10); 

    cout << "size() of li = "
     << li.size() << endl;
    cout << "max_size     = "
     << li.max_size() << endl;

    return 0;
}
运行结果:
// size() of li = 10
// max_size     = 4294967295

阅读全文