Illustrate set_intersection : set_intersection « 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_intersection 
28.5.1.Illustrate set_intersection
#include <iostream>
#include <cassert>
#include <algorithm>
#include <vector>
using namespace std;

int main()
{
  bool result;

  string s("abcde");
  string s2("aeiou");

  vector<char> vector1(s.begin(), s.end());
  vector<char> vector2(s2.begin(), s2.end());

  
  vector<char> setIntersection;
  set_intersection(vector1.begin(), vector1.end(),vector2.begin(), vector2.end(),back_inserter(setIntersection));

  for(int i=0;i<setIntersection.size();i++){
    cout << setIntersection[i];
  }

  return 0;
}
ae
28.5.set_intersection
28.5.1.Illustrate set_intersection
28.5.2.Intersect the ranges by using set_intersection()
28.5.3.Determine elements in both two sets
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.