Demonstrating multiset search member functions : multiset find « set multiset « 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 » set multiset » multiset find 
19.15.2.Demonstrating multiset search member functions
#include <iostream>
#include <cassert>
#include <list>
#include <string>
#include <set>
using namespace std;

int main()
{
  string s("There is no distinctly native American criminal class");
  string s2("American criminal class");

  list<char> list1(s.begin(), s.end());
  list<char> list2(s2.begin(), s2.end());

  list<char> found, not_found;
  list<char>::iterator k;

  multiset<char> multiset1;
  copy(list1.begin(), list1.end(),inserter(multiset1, multiset1.end()));

  for (k = list2.begin(); k != list2.end(); ++k)
    if (multiset1.find(*k!= multiset1.end())
      found.push_back(*k);
    else
      not_found.push_back(*k);

  for (k = found.begin(); k != found.end(); ++k)
    cout << *k;

  for (k = not_found.begin(); k != not_found.end(); ++k)
    cout << *k;

  return 0;
}
American criminal class"
19.15.multiset find
19.15.1.multiset::iterator from find() method
19.15.2.Demonstrating multiset search member functions
19.15.3.find returns iterator
19.15.4.equal_range
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.