partition.cpp

Go to the documentation of this file.

 
#include <algorithm>    // for copy
#include <deque>        // for deque
#include <functional>   // for unary_function
#include <iostream>     // for cout, endl
#include <iterator>     // for ostream_iterator
 
#include <examples.h>
 
typedef std::modulus<int>               int_modulus;
typedef std::binder2nd<int_modulus>     bnd_modulus;
typedef std::unary_negate<bnd_modulus>  is_even;
 
int main ()
{
    typedef std::deque<int, std::allocator<int> >                     Deque;
    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, 8, 9, 10 };
 
    Deque d1 (a + 0, a + sizeof a / sizeof *a);
    Deque d2 (d1);
 
    // Print out the original values.
    std::cout << "Unpartitioned values: \t\t";
    std::copy (d1.begin (), d1.end (), Iter (std::cout, " "));
 
    // A partition of the deque according to even/oddness.
    std::partition (d2.begin (), d2.end (), is_even ( bnd_modulus(int_modulus (), 2)) );
 
    // Output result of partition.
    std::cout << "\nPartitioned values: \t\t";
    std::copy (d2.begin (), d2.end (), Iter (std::cout, " "));
 
    // A stable partition of the deque according to even/oddness.
    std::stable_partition (d1.begin (), d1.end (),  is_even ( bnd_modulus(int_modulus (), 2)) );
 
    // Output result of partition.
    std::cout << "\nStable partitioned values: \t";
    std::copy (d1.begin (), d1.end (), Iter (std::cout, " "));
    std::cout << std::endl;
 
    return 0;
}