pnt2fnct.cpp

Go to the documentation of this file.

 
#include <algorithm>    // for copy, transform
#include <functional>   // for ptr_fun
#include <iostream>     // cout, endl
#include <iterator>     // for ostream_iterator
#include <deque>        // for deque
#include <vector>       // for vector
 
#include <examples.h>
 
 
int factorial (int x)
{
    return x > 1 ? x * factorial (x - 1) : x;
}
 
 
int main ()
{
    typedef std::deque<int, std::allocator<int> >                     Deque;
    typedef std::vector<int, std::allocator<int> >                    Vector;
    typedef std::ostream_iterator<int, char, std::char_traits<char> > Iter;
 
    // Initialize a deque with an array of integers.
    const Deque::value_type a[] = { 1, 2, 3, 4, 5, 6, 7 };
    Deque d (a + 0, a + sizeof a / sizeof *a);
 
    // Create an empty vector to store the factorials.
    Vector v (Vector::size_type (7));
 
    // Compute factorials of the contents of `d' store results in `v'.
    std::transform (d.begin (), d.end (), v.begin (),
                    std::ptr_fun (factorial));
 
    // Print the results.
    std::cout << "The following numbers: \n     ";
    std::copy (d.begin (), d.end (), Iter (std::cout," "));
 
    std::cout << "\n\nHave the factorials: \n     ";
    std::copy (v.begin (), v.end (), Iter (std::cout, " "));
    std::cout << std::endl;
 
    return 0;
}