RedWoft

To be or not to be, it is a question.
std::transform()

 

#include <vector>
#include 
<deque>
#include 
<list>
#include 
<iterator>
#include 
<algorithm>

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

// Calculate the square of value.
inline unsigned CalculateSquare(unsigned p_uiNumber)
{
    
return p_uiNumber*p_uiNumber;
}

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

    deque
<unsigned> deqUint;
    transform(vecUint.begin(), vecUint.end(), back_inserter(deqUint), CalculateSquare);
    list
<unsigned> lstUint;
    transform(vecUint.begin(), vecUint.end(), deqUint.begin(), back_inserter(lstUint), std::multiplies
<unsigned>());
    
return EXIT_SUCCESS;
}

 

 

posted on 2010-06-22 14:09  RedWoft  阅读(883)  评论(0)    收藏  举报