Determine lower bound of a value in intMultiset : multiset bound « 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 bound 
19.11.2.Determine lower bound of a value in intMultiset
#include <iostream>
using std::cout;
using std::endl;

#include <set> // multiset class-template definition

#include <algorithm> // copy algorithm
#include <iterator> // ostream_iterator

int main()
{
   int a10 722911830100228513 };
   std::multiset< int, std::less< int > > intMultiset;
   std::ostream_iterator< int > outputcout, " " );

   // insert elements of array a into intMultiset
   intMultiset.inserta, a + 10 );
   cout << "\nAfter insert, intMultiset contains:\n";
   std::copyintMultiset.begin(), intMultiset.end(), output );

   // determine lower bound of 22 in intMultiset
   cout << "\n\nLower bound of 22: "
      << *intMultiset.lower_bound22 ) );


   cout << endl;
   return 0;
}
After insert, intMultiset contains:
1 7 9 13 18 22 22 30 85 100

Lower bound of 22: 22
19.11.multiset bound
19.11.1.Determine lower and upper bound of a value in intMultiset
19.11.2.Determine lower bound of a value in intMultiset
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.