STL之序列式容器

来源:互联网 发布:网络语言暴力思修论文 编辑:程序博客网 时间:2024/05/29 18:07

Vector

push_back、for(std::vector<int>::iterator iter = obj.begin(); iter!=obj.end(); ++iter)

////vector

     vector<int> obj;

     for( int i = 0; i<5; ++i)

     {

         obj.push_back (i);

     }

     for(std::vector<int>::iterator iter = obj.begin (); iter != obj.end (); ++iter)

         cout<<*iter<<endl;

     for( int i = 0; i<obj.size (); i++)

         cout<<obj[i]<<endl;

Deque

push_backpush_front

////deque

     deque<float> obj;

     for( int i = 1; i < 6; ++i)

         obj.push_front ( i * 1.1);

     for(int i = 0; i < obj.size (); ++i)

         cout<<obj[i]<<endl;

List

push_backfrontpop_front

list<char> obj;

     for( char c = 'a'; c < 'z'; ++c)

     {

         obj.push_back (c);

     }

     while(!obj.empty ())

     {

         cout<<obj.front ()<<endl;

         obj.pop_front();

     }

     ///

         list<char> obj;

     for( char c = 'a'; c <= 'z'; ++c)

     {

         obj.push_back (c);

     }

 

     for(list<char>::const_iterator iter = obj.begin (); iter != obj.end (); ++iter)

         cout<<*iter<<' ';

     cout<<endl;

原创粉丝点击