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

Home
C++ Tutorial
1.Language Basics
2.Data Types
3.Operators statements
4.Array
5.Development
6.Exceptions
7.Function
8.Structure
9.Class
10.Operator Overloading
11.Pointer
12.File Stream
13.template
14.STL Introduction
15.string
16.vector
17.list
18.bitset
19.set multiset
20.valarray
21.queue stack
22.deque
23.map multimap
24.STL Algorithms Modifying sequence operations
25.STL Algorithms Non modifying sequence operations
26.STL Algorithms Binary search
27.STL Algorithms Sorting
28.STL Algorithms Merge
29.STL Algorithms Min Max
30.STL Algorithms Iterator
31.STL Algorithms Heap
32.STL Algorithms Helper
C / ANSI-C
C Tutorial
C++
Visual C++ .NET
C++ Tutorial » STL Algorithms Merge » set_difference 
28.4.1.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
28.4.set_difference
28.4.1.Determine elements in one set but not in another set
28.4.2.Determine elements of first range without elements of second range by using set_difference()
28.4.3.includes, set_difference, set_intersection, set_symmetric_difference and set_union.
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.