C++ Set lower_bound()
C++ Set lower_bound()
C++ Set lower_bound()函数用于返回指向set容器中等效键的迭代器
如果 Set 的容器中不存在val，它将返回一个迭代器，该迭代器指向刚好大于val的下一个直接元素。
语法
iterator lower_bound (const value_type& val); //until C++ 11
iterator lower_bound (const value_type& val); //since C++ 11
const_iterator lower_bound (const value_type& val) const; //since C++ 11
参数
val : 要在 Set 的容器中搜索的值。
返回值
它返回一个迭代器，该迭代器指向set容器中的值，该值等于在参数中传递的val。如果没有这样的元素，则返回end()。
复杂度
大小为对数。
迭代器有效性
没有变化。
Data Races
访问容器(const和非const版本都不能修改容器)。
同时访问以下元素一个集合是安全的。
异常安全性
如果引发异常，则容器中没有任何更改。
示例1
让我们看一下获取给定密钥下限的简单示例:
#include <iostream>
#include <set>
using namespace std;
int main(void) {
set<char> m = {'a','b','c','d','e'};
auto it = m.lower_bound('c');
cout << "Lower bound is(=) " << *it;
return 0;
}
输出:
在上面的示例中，c的下界是c。
示例2
让我们看一个简单的示例，将下位的set元素删除绑定到上限:
#include <iostream>
#include <set>
using namespace std;
int main ()
{
set<int> myset;
set<int>::iterator itlow,itup;
for (int i=1; i<10; i++) myset.insert(i*10); // 10 20 30 40 50 60 70 80 90
itlow=myset.lower_bound (30); // ^
itup=myset.upper_bound (60); // ^
myset.erase(itlow,itup); // 10 20 70 80 90
std::cout << "myset contains:";
for (set<int>::iterator it=myset.begin(); it!=myset.end(); ++it)
cout << ' ' << *it;
cout << '\n';
return 0;
}
输出:
myset contains: 10 20 70 80 90
在上面的示例中，delete()函数将set的元素从下限(=)擦除到上限(>)，并打印其余内容。
示例3
让我们看一个简单的示例:
#include <set>
#include <iostream>
using namespace std;
int main( )
{
using namespace std;
set <int> s1;
set <int> :: const_iterator s1_AcIter, s1_RcIter;
s1.insert( 10 );
s1.insert( 20 );
s1.insert( 30 );
s1_RcIter = s1.lower_bound( 20 );
cout << "The element of set s1 with a key of 20 is: "
<< *s1_RcIter << "." << endl;
s1_RcIter = s1.lower_bound( 40 );
// if no match is found for the key, end( ) is returned
if ( s1_RcIter == s1.end( ) )
cout << "The set s1 doesn't have an element "
<< "with a key of 40." << endl;
else
cout << "The element of set s1 with a key of 40 is: "
<< *s1_RcIter << "." << endl;
// The element at a specific location in the set can be found
// by using a dereferenced iterator that addresses the location
s1_AcIter = s1.end( );
s1_AcIter--;
s1_RcIter = s1.lower_bound( *s1_AcIter );
cout << "The element of s1 with a key matching "
<< "that of the last element is: "
<< *s1_RcIter << "." << endl;
return 0;
}
输出:
The element of set s1 with a key of 20 is: 20.
The set s1 doesn't have an element with a key of 40.
The element of s1 with a key matching that of the last element is: 30.
示例4
让我们看一个简单的示例:
#include<set>
#include<iostream>
using namespace std;
int main()
{
set<int> mp;
// insert elements in random order
mp.insert( 2 );
mp.insert( 1 );
mp.insert( 5 );
mp.insert( 4 );
cout<<"Elements are: \n";
for (auto it = mp.begin(); it != mp.end(); it++) {
cout << (*it)<< endl;
}
// when 2 is present
auto it = mp.lower_bound(2);
cout << "The lower bound of key 2 is ";
cout << (*it)<< endl;
// when 3 is not present
// points to next greater after 3
it = mp.lower_bound(3);
cout << "The lower bound of key 3 is ";
cout << (*it)<< endl;
// when 6 exceeds
it = mp.lower_bound(6);
cout << "The lower bound of key 6 is ";
cout << (*it);
return 0;
}
输出:
Elements are:
1
2
4
5
The lower bound of key 2 is 2
The lower bound of key 3 is 4
The lower bound of key 6 is 4
在上面的示例中，当我们尝试查找超出容器的值的下限或可以说 Set 的容器中不存在该值的下限时，它将返回到末尾。
