Use equal_range to determine both the lower- and upper-bound insertion points : equal_range « STL Algorithms Binary search « 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 Binary search » equal_rangeScreenshots 
Use equal_range to determine both the lower- and upper-bound insertion points
  
 

#include <iostream>
using std::cout;
using std::endl;

#include <algorithm>
#include <vector>
#include <iterator>

int main()
{
   int a110 224446666};
   std::vector< int > va1, a1 + 10 );
   std::ostream_iterator< int > outputcout, " " );

   std::copyv.begin(), v.end(), output );

   std::pair< std::vector< int >::iterator, std::vector< int >::iterator > eq;
   eq = std::equal_rangev.begin(), v.end());
   cout << "\n\n\nLower bound of 6 is element " << eq.first - v.begin() ) << " of vector v \n\n\n";
   cout << "Upper bound of 6 is element " << eq.second - v.begin() ) << " of vector v";

   return 0;
}

/* 
2 2 4 4 4 6 6 6 6 8


Lower bound of 6 is element 5 of vector v


Upper bound of 6 is element 9 of vector v
 */        
    
  
Related examples in the same category
1.equal_range and distance
2.Use equal function to check whether both collections are equal
3.Use equal function to check for corresponding even and odd elements
4.Get equal range with 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.