• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            T9的空間

            You will never walk alone!

              C++博客 :: 首頁 :: 新隨筆 :: 聯系 :: 聚合  :: 管理 ::
              69 隨筆 :: 0 文章 :: 28 評論 :: 0 Trackbacks
            先看函數:
            C++ Lists

            Lists are sequences of elements stored in a linked list. Compared to vectors, they allow fast insertions and deletions, but slower random access.

            Display all entries for C++ Lists on one page, or view entries individually:

            List constructors create lists and initialize them with some data
            List operators assign and compare lists
            assign assign elements to a list
            back returns a reference to last element of a list
            begin returns an iterator to the beginning of the list
            clear removes all elements from the list
            empty true if the list has no elements
            end returns an iterator just past the last element of a list
            erase removes elements from a list
            front returns a reference to the first element of a list
            insert inserts elements into the list
            max_size returns the maximum number of elements that the list can hold
            merge merge two lists
            pop_back removes the last element of a list
            pop_front removes the first element of the list
            push_back add an element to the end of the list
            push_front add an element to the front of the list
            rbegin returns a reverse_iterator to the end of the list
            remove removes elements from a list
            remove_if removes elements conditionally
            rend returns a reverse_iterator to the beginning of the list
            resize change the size of the list
            reverse reverse the list
            size returns the number of items in the list
            sort sorts a list into ascending order
            splice merge two lists in constant time
            swap swap the contents of this list with another
            unique removes consecutive duplicate elements

            要注意的是list不提隨機的迭代器,迭代器是個雙向的,非連續存儲,而且是個環狀鏈表在尾端是個未初始化節點
            空判斷:begin==end;
            clear  remove  unique(把相同元素移出,留一個先sort)  insert(插入兩種方式)
            只能使用成員函數 sort,不能使用 算法 sort(他只接受random iterator)

             1/*
             2  Name: C++ STL LIST    
             3  Copyright: 
             4  Author: Torres
             5  Date: 17-08-08 23:28
             6  Description: LIST 學習筆記 
             7*/

             8#include<iostream>
             9#include<list>
            10#include<vector>
            11#include<algorithm>
            12using namespace std;
            13typedef struct node{
            14    double x,y;
            15    node (double a=0,double b=0){
            16        x=a;
            17        y=b;
            18    }

            19}
            node;
            20void print(int a){printf("%d ",a);return;}
            21
            22ostream operator <<(ostream out,node a)
            23{
            24    return out<<a.x<<" "<<a.y<<endl;
            25}

            26int main()
            27{
            28    int i,j;
            29
            30    list<node>nlist;
            31    list<int>intlist,intlist1;
            32    
            33    vector<int>intv1,intv2;
            34    intv1.assign(5,7);
            35    intv2.assign(intv1.begin()+1,intv1.end()-1);
            36    for_each(intv2.begin()+1,intv2.end(),print);
            37    cout<<endl;
            38
            39    //assign的用法,有兩種,發現list的iterator不能夠相加而vector可以
            40    intlist.assign(5,7);
            41    intlist1.assign(intlist.begin(),intlist.end());
            42    for_each(intlist.begin(),intlist.end(),print);
            43    printf("\n");
            44    for_each(intlist1.begin(),intlist1.end(),print);
            45    printf("\n");
            46    
            47    //size的用法,表示實際數據的大小
            48    cout<<intlist.size()<<endl;
            49    //list沒有容量capacity函數
            50
            51    //因為list是一個雙端鏈表,不支持隨機存取,他的存取必須用iterator來進行
            52    //而vector,deque,等容器是支持的。
            53    list<int>::iterator it1;
            54    for(it1=intlist1.begin();it1!=intlist1.end();it1++)
            55        cout<<*it1<<" ";
            56    cout<<endl;
            57
            58    const node cnode(1.0,2.0);
            59    cout<<cnode<<endl;
            60
            61    nlist.assign(5,cnode);
            62    list<node>::iterator it2;
            63    for(it2=nlist.begin();it2!=nlist.end();it2++)
            64        cout<<*it2;
            65    return 0;
            66}

            67

            posted on 2008-08-17 23:30 Torres 閱讀(668) 評論(0)  編輯 收藏 引用
            久久精品国产亚洲AV无码娇色 | 色99久久久久高潮综合影院| 麻豆精品久久精品色综合| 精品久久久久久| 天天综合久久一二三区| 久久久久亚洲AV无码永不| 久久久久国产成人精品亚洲午夜| 国产精品久久久香蕉| 久久国产精品一国产精品金尊 | 国产精品久久新婚兰兰| AAA级久久久精品无码片| 久久久久亚洲av毛片大| 精品少妇人妻av无码久久| 久久青青草原精品国产软件| 国产精品一区二区久久精品| 伊人久久大香线蕉综合热线| 日本精品久久久中文字幕| 亚洲狠狠婷婷综合久久久久| 久久性生大片免费观看性| 久久国产精品成人免费 | 久久久久99这里有精品10| 嫩草影院久久国产精品| 亚洲va中文字幕无码久久不卡| 国产精品女同一区二区久久| 久久99精品国产麻豆| 亚洲精品无码专区久久久| 香蕉久久久久久狠狠色| 久久免费大片| 国产亚州精品女人久久久久久 | 婷婷综合久久中文字幕| 久久精品国产亚洲精品2020| 亚洲人成网亚洲欧洲无码久久| 久久这里只有精品视频99| 国产高清美女一级a毛片久久w | 亚洲色欲久久久久综合网| 亚洲国产成人久久综合一| 国产精品久久久久久久久免费| 香蕉久久夜色精品升级完成| 亚洲精品无码久久久影院相关影片 | 久久影院久久香蕉国产线看观看| 99精品久久久久久久婷婷|