Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/cpp_standard_library/cpp_set_lower_bound.htm below:

C++ Set Library - lower_bound Function

It returns an iterator pointing to the first element in the container which is not considered to go before val.

Following are the ways in which std::set::lower_bound works in various C++ versions.

iterator lower_bound (const value_type& val) const;

iterator lower_bound (const value_type& val);
const_iterator lower_bound (const value_type& val) const;

It returns an iterator pointing to the first element in the container which is not considered to go before val.

If an exception is thrown, there are no changes in the container.

Time complexity depens on logarithmic.

The following example shows the usage of std::set::lower_bound.

#include <iostream>
#include <set>

int main () {
   std::set<int> myset;
   std::set<int>::iterator itlow,itup;

   for (int i = 1; i < 10; i++) myset.insert(i*10); 

   itlow = myset.lower_bound (30);                
  
   myset.erase(itlow);

   std::cout << "myset contains:";
   for (std::set<int>::iterator it = myset.begin(); it!=myset.end(); ++it)
      std::cout << ' ' << *it;
   std::cout << '\n';

   return 0;
}

The above program will compile and execute properly.

myset contains: 10 20 40 50 60 70 80 90

set.htm

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4