线性存储与链式存储迭代器的不同

/* 线性存储与链式存储迭代器的不同 */

/* 容器:
    <
    array , vector, list, deque, stack, queue,set,
    mutset, hash_set, hashmap, map, string, bitset
    > 
*/



#include<iostream>
#include<vector>

using namespace std;

// vector
void main()
{
    vector<int> myv = {1,2,3,4,5};
    // 迭代器的本质就是智能指针,可以随机访问
    for(auto ib = myv.begin()+2,ie = myv.end();ib!=ie;ib++)
    {
        cout << *ib << endl;
    }
    
    // 反向迭代
    for(auto rb = myv.rbegin()+2,re = myv.rend();rb!=re;rb++)
    {
        cout << *rb << endl;
    }

    cin.get();
}

//------------------------------------------------------------------------

// list
#include<iostream>
#include<list>

using namespace std;
void main()
{
    list<char> mylist = {'A','B','C','D','E'};
    
    // +2,不可以，list是链表无法直接访问
    // list迭代器无法随机访问
    for(auto ib = mylist.begin()+2,ie = mylist.end();ib!=ie;ib++)
    {
        cout << *ib << endl;
    }

    // +2 list 迭代器不能随机访问
    for(auto rb = mylist.rbegin()+2,re = mylist.rend();rb!=re;rb++)
    {
        cout << *rb << endl;
    }
    
    cin.get();
}


//------------------------------------------------------------------------

// array
#include<iostream>
#include<array>

using namespace std;
void main()
{
    array<int,10> my = {1,2,3,4,5,6,7,8,9,10};
    // +5 可以 
    for(auto ib = my.begin()+5,ie = my.end();ib!=ie;ib++)
    {
        cout << *ib << endl;
    }

    cin.get();
}