# Use equal_range to determine lower and upper bound of a value in int Multiset : multiset equal_range « Set Multiset « 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++ » Set Multiset » multiset equal_range Screenshots
Use equal_range to determine lower and upper bound of a value in int Multiset
 ```    #include  using std::cout; using std::endl; #include  // multiset class-template definition #include  // copy algorithm #include  // ostream_iterator int main() {    int a[ 10 ] = { 7, 22, 9, 1, 18, 30, 100, 22, 85, 13 };    std::multiset< int, std::less< int > > intMultiset;    std::ostream_iterator< int > output( cout, " " );    // insert elements of array a into intMultiset    intMultiset.insert( a, a + 10 );    cout << "\nAfter insert, intMultiset contains:\n";    std::copy( intMultiset.begin(), intMultiset.end(), output );    // p represents pair of const_iterators    std::pair >::const_iterator,              std::multiset< int, std::less< int > >::const_iterator > p;    //    p = intMultiset.equal_range( 22 );    cout << "\n\nequal_range of 22:" << "\n   Lower bound: "       << *( p.first ) << "\n   Upper bound: " << *( p.second );    cout << endl;    return 0; }   /*  After insert, intMultiset contains: 1 7 9 13 18 22 22 30 85 100 equal_range of 22:    Lower bound: 22    Upper bound: 30  */         ```
Related examples in the same category