Determine whether one set is completely contained in another set : includes « 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 » includes 
28.1.2.Determine whether one set is completely contained 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 4561115 };
   std::ostream_iterator< int > outputcout, " " );

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

   if std::includesa1, a1 + SIZE1, a2, a2 + SIZE2 ) )
      cout << "\n\na1 includes a2";
   else
      cout << "\n\na1 does not include a2";

   return 0;
}
1 2 3 4 5 6 7 8 9 10
4 5 6 7 8
4 5 6 11 15

a1 includes a2
28.1.includes
28.1.1.Container includes: generic includes algorithm
28.1.2.Determine whether one set is completely contained in another set
28.1.3.Use includes and search to check whether all elements in search are also in coll
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.