STL - 算法 - 普通拷贝

weixin_33951761

于 2019-06-27 00:40:58 发布

阅读量392

点赞数

原文链接：http://www.cnblogs.com/davidgu/p/4772697.html

版权

list<int> coll1 = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
    vector<int> coll2;

    cout << "** collection 1: **" << endl;
    ContainerUtil<list<int>>::printElements(coll1);

    // resize to have enough room
    coll2.resize(coll1.size());
    copy(coll1.cbegin(), coll1.cend(), coll2.begin());

    cout << "** collection 2(copy collection 1): **" << endl;
    ContainerUtil<vector<int>>::printElements(coll2);

    // intit with enough room
    deque<int> coll3(coll1.size());
    copy(coll1.cbegin(), coll1.cend(), coll3.begin());

    cout << "** collection 3(copy collection 1): **" << endl;
    ContainerUtil<deque<int>>::printElements(coll3);

运行结果:

** collection 1: **
1 2 3 4 5 6 7 8 9
** collection 2(copy collection 1): **
1 2 3 4 5 6 7 8 9
** collection 3(copy collection 1): **
1 2 3 4 5 6 7 8 9

转载于:https://www.cnblogs.com/davidgu/p/4772697.html