set::lower_bound, set::upper_bound, と set::equal_range
Visual C++ で 設定 :: lower_bound,設定 :: upper_bound, と 設定 :: equal_range の標準テンプレート ライブラリ関数を使用する方法に (STL) ついて説明します。
template<class _K, class _Pr, class _A>
class set
{
public:
// Function 1:
const_iterator lower_bound(const _K& _Kv) const;
// Function 2:
const_iterator upper_bound(const _K& _Kv) const;
// Function 3:
_Paircc equal_range(const _K& _Kv) const;
}
解説
[!メモ]
プロトタイプのクラスやパラメーター名はヘッダー ファイルのバージョンと一致しない。ただし読みやすさが向上するように変更されました。
値と一致しないキーがある最も古い被制御シーケンスの要素への lower_bound 関数の戻り値は反復子 lower_bound に関数が渡されます。値に一致するキーがある最も古い被制御シーケンスの要素への upper_bound 関数の戻り値は反復子 upper_bound に関数が渡されます。そのような要素が存在しない場合関数の戻り値 終了 。いずれの場合も関数 set::key_comp(キーが一致するかどうかを確認するために key の x) が 使用されます。equal_range 関数の戻り値ペアの値。First は lower_bound の関数の結果であり.second は upper_bound の関数の結果。
使用例
// SetBoundRange.cpp
// compile with: /EHsc
//
// Illustrates how to use the lower_bound function to get an
// iterator to the earliest element in the controlled sequence
// that has a key that does not match the value passed to the
// function. It also illustrates how to use the upper_bound
// function to get an iterator to the earliest element in the
// controlled sequence that has a key that matches the value
// passed to the function. The last thing it illustrates is
// how to use the equal_range function to get a pair value that
// contains the lower_bound and upper_bound results of the key.
//
// Functions:
//
// lower_bound Returns an iterator whose value does not match the
// key passed to the function, or end() if no such
// element exists.
// upper_bound Returns an iterator whose value matches the key
// passed to the function, or end() if no such element
// exists.
// equal_range Returns a pair of (lower_bound,upper_bound).
//////////////////////////////////////////////////////////////////////
#pragma warning(disable:4786)
#include <set>
#include <iostream>
using namespace std ;
typedef set<int> SET_INT;
int main() {
SET_INT s1;
SET_INT::iterator i;
cout << "s1.insert(5)" << endl;
s1.insert(5);
cout << "s1.insert(10)" << endl;
s1.insert(10);
cout << "s1.insert(15)" << endl;
s1.insert(15);
cout << "s1.insert(20)" << endl;
s1.insert(20);
cout << "s1.insert(25)" << endl;
s1.insert(25);
cout << "s1 -- starting at s1.lower_bound(12)" << endl;
// prints: 15,20,25
for (i=s1.lower_bound(12);i!=s1.end();i++)
cout << "s1 has " << *i << " in its set." << endl;
cout << "s1 -- starting at s1.lower_bound(15)" << endl;
// prints: 15,20,25
for (i=s1.lower_bound(15);i!=s1.end();i++)
cout << "s1 has " << *i << " in its set." << endl;
cout << "s1 -- starting at s1.upper_bound(12)" << endl;
// prints: 15,20,25
for (i=s1.upper_bound(12);i!=s1.end();i++)
cout << "s1 has " << *i << " in its set." << endl;
cout << "s1 -- starting at s1.upper_bound(15)" << endl;
// prints: 20,25
for (i=s1.upper_bound(15);i!=s1.end();i++)
cout << "s1 has " << *i << " in its set." << endl;
cout << "s1 -- s1.equal_range(12)" << endl;
// does not print anything
for (i=s1.equal_range(12).first;i!=s1.equal_range(12).second;i++)
cout << "s1 has " << *i << " in its set." << endl;
cout << "s1 -- s1.equal_range(15)" << endl;
// prints: 15
for (i=s1.equal_range(15).first;i!=s1.equal_range(15).second;i++)
cout << "s1 has " << *i << " in its set." << endl;
}
出力
s1.insert(5)
s1.insert(10)
s1.insert(15)
s1.insert(20)
s1.insert(25)
s1 -- starting at s1.lower_bound(12)
s1 has 15 in its set.
s1 has 20 in its set.
s1 has 25 in its set.
s1 -- starting at s1.lower_bound(15)
s1 has 15 in its set.
s1 has 20 in its set.
s1 has 25 in its set.
s1 -- starting at s1.upper_bound(12)
s1 has 15 in its set.
s1 has 20 in its set.
s1 has 25 in its set.
s1 -- starting at s1.upper_bound(15)
s1 has 20 in its set.
s1 has 25 in its set.
s1 -- s1.equal_range(12)
s1 -- s1.equal_range(15)
s1 has 15 in its set.
必要条件
ヘッダー : <set>