RedWoft

To be or not to be, it is a question.
std::back_inserter、front_inserter、inserter
#include <vector>
#include 
<deque>

using std::vector;
using std::deque;

// Entrance
int main()
{
    vector
<unsigned> vecUint;
    
const unsigned uiElementNumber = 6U;
    
for (unsigned i = 0U; i < uiElementNumber; ++i)
    {
        vecUint.push_back(i);
    }

    deque
<unsigned> deqUint;
    copy(vecUint.begin(), vecUint.end(), back_inserter(deqUint));
    copy(vecUint.begin(), vecUint.end(), front_inserter(deqUint));
    copy(vecUint.begin(), vecUint.end(), inserter(deqUint, deqUint.begin()));
    
return EXIT_SUCCESS;
}

 

posted on 2010-06-21 21:27  RedWoft  阅读(958)  评论(0)    收藏  举报