测试 C++ map lower_bound

#include <iostream>
#include <map>
using namespace std;
void printIt(int v,map<int, char>::iterator& itFind, map<int, char>& m)
{
	cout << "find:" << v<<"结果：";
	if (itFind != m.end()) 
		cout << itFind->second << endl; 
	else 
		cout << "未找到" << endl; 
}
int main()
{
	map<int, char> m;
	m[1] = 'a';
	m[2] = 'b';
	//m[3] = 'c';
	m[4] = 'd';
	m[5] = 'e';
	m[6] = 'f';
	int v = 0;
	map<int, char>::iterator itFind;
	v = 0; itFind = m.lower_bound(v); printIt(v,itFind, m);
	v = 1; itFind = m.lower_bound(v); printIt(v,itFind, m);
	v = 3; itFind = m.lower_bound(v); printIt(v,itFind, m);
	v = 7; itFind = m.lower_bound(v); printIt(v,itFind, m);
}

输出结果：

find:0结果：a
find:1结果：a
find:3结果：d
find:7结果：未找到