Use includes() function to check if one set contains another set : includes « 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 » includesScreenshots 
Use includes() function to check if one set contains another set
  
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;


void print(int elem) {
  cout << elem << " ";
}

int main(int argc, char** argv) {
  vector<int> setOne, setTwo, setThree;
  setOne.push_back(1);
  setOne.push_back(2);
  setOne.push_back(3);
  
  setTwo.push_back(2);
  setTwo.push_back(3);
  setTwo.push_back(4);

  // set algorithms work on sorted ranges
  sort(setOne.begin(), setOne.end());
  sort(setTwo.begin(), setTwo.end());

  if (includes(setOne.begin(), setOne.end(), setTwo.begin(), setTwo.end())) {
    cout << "The second set is a subset of the first\n";
  }
  if (includes(setTwo.begin(), setTwo.end(), setOne.begin(), setOne.end())) {
    cout << "The first set is a subset of the second\n";
  }

  return (0);
}
  
    
  
Related examples in the same category
1.Container includes: generic includes algorithm
2.Determine whether one set is completely contained in another set
3.Use includes and search to check whether all elements in search are also in coll
4.Use includes() to check for subset
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.