QBasic & Borland Pascal & C/Delphi5.iso/C/BC_502/STDLIB.PAK/SET_INTR.CPP

C/C++ Source or Header | 1997-05-06 | 902 b | 33 lines

 #include <algorithm>
 #include <set>

 using namespace std;

 int main ()
 {
   //
   // Initialize some sets.
   //
   int a1[10] = {1,3,5,7,9,11};
   int a3[4]  = {3,5,7,8};
   set<int, less<int> > odd(a1+0, a1+6), result, smalll(a3+0, a3+4);
   //
   // Create an insert_iterator for result.
   //
   insert_iterator<set<int, less<int> > > res_ins(result, result.begin());
   //
   // Demonstrate set_intersection.
   //
   cout << "The result of:" << endl << "{";
   copy(smalll.begin(),smalll.end(), ostream_iterator<int>(cout," "));
   cout << "} intersection {";
   copy(odd.begin(),odd.end(), ostream_iterator<int>(cout," "));
   cout << "} =" << endl << "{";
   set_intersection(smalll.begin(),smalll.end(),odd.begin(),odd.end(),res_ins);
   copy(result.begin(),result.end(), ostream_iterator<int>(cout," "));
   cout << "}" << endl << endl;

   return 0;
 }