Determine elements in one set but not in another set : set_difference « STL Algorithms Merge « C++

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » STL Algorithms Merge » set_differenceScreenshots 
Determine elements in one set but not in another set
 
 

#include <iostream>
using std::cout;
using std::endl;

#include <algorithm>
#include <iterator>

int main()
{
   const int SIZE1 = 10, SIZE2 = 5, SIZE3 = 20;
   int a1SIZE1 12345678910 };
   int a2SIZE2 4567};
   int a3SIZE2 4761115 };
   std::ostream_iterator< int > outputcout, " " );

   cout << "a1 contains: ";
   std::copya1, a1 + SIZE1, output );
   cout << "\na2 contains: ";
   std::copya2, a2 + SIZE2, output );
   cout << "\na3 contains: ";
   std::copya3, a3 + SIZE2, output );

   int differenceSIZE1 ];

   int *ptr = std::set_differencea1, a1 + SIZE1, a2, a2 + SIZE2, difference );
   cout << "\n\nset_difference of a1 and a2 is: ";
   std::copydifference, ptr, output );

   return 0;
}

/* 
a1 contains: 1 2 3 4 5 6 7 8 9 10
a2 contains: 4 5 6 7 8
a3 contains: 4 7 6 11 15

set_difference of a1 and a2 is: 1 2 3 9 10 
 */        
  
Related examples in the same category
1.Determine elements of first range without elements of second range by using set_difference()
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.