set_intr.cpp

Go to the documentation of this file.

 
#include <algorithm>
#include <set>
#include <iostream>
#include <iterator>
 
int main ()
{
    // Initialize some sets.
    const int a1 [] = { 1, 3, 5, 7, 9, 11 };
    const int a3 [] = { 3, 5, 7, 8 };
    std::set<int, std::less<int>, std::allocator<int>  >
        odd (a1 + 0, a1 + 6),
        result,
        smalll (a3 + 0, a3 + 4);
 
    // Create an insert_iterator for result.
 
    std::insert_iterator<std::set<int, std::less<int>, std::allocator<int> > >
        res_ins (result, result.begin ());
 
    // Demonstrate set_intersection.
 
    typedef std::ostream_iterator<int, char, std::char_traits<char> > Iter;
 
    std::cout << "The result of:\n{";
 
    std::copy (smalll.begin (),smalll.end (), Iter (std::cout, " "));
    std::cout << "} intersection {";
 
    std::copy (odd.begin (), odd.end (), Iter (std::cout, " "));
    std::cout << "} =\n{";
 
    std::set_intersection (smalll.begin (),smalll.end (),
                           odd.begin (), odd.end(),
                           res_ins);
 
    std::copy (result.begin (), result.end (), Iter (std::cout, " "));
    std::cout << "}\n\n";
 
    return 0;
}