请问stl中set的用法

[tmp_love3]

请问stl中set的用法
lower_bound和upper_bound怎么用啊，有什么区别？

[taodm]

这个，看一下帮助文档就清楚了。

[jixingzhong]

C++ Sets

The C++ Set is an associative container that contains a sorted set of unique objects.

Display all entries for C++ Sets on one page, or view entries individually:
Container constructors & destructors default methods to allocate, copy, and deallocate sets
Container operators assign and compare sets
begin returns an iterator to the beginning of the set
clear removes all elements from the set
count returns the number of elements matching a certain key
empty true if the set has no elements
end returns an iterator just past the last element of a set
equal_range returns iterators to the first and just past the last elements matching a specific key
erase removes elements from a set
find returns an iterator to specific elements
insert insert items into a set
key_comp returns the function that compares keys
lower_bound returns an iterator to the first element greater than or equal to a certain value
max_size returns the maximum number of elements that the set can hold
rbegin returns a reverse_iterator to the end of the set
rend returns a reverse_iterator to the beginning of the set
size returns the number of items in the set
swap swap the contents of this set with another
upper_bound returns an iterator to the first element greater than a certain value
value_comp returns the function that compares values

[jixingzhong]

lower_bound
Syntax:

#include <set>
iterator lower_bound( const key_type& key );

The lower_bound() function returns an iterator to the first element which has a value greater than or equal to key.

=============================
upper_bound
Syntax:

#include <set>
iterator upper_bound( const key_type& key );

The function upper_bound() returns an iterator to the first element in the set with a key greater than key.

[jixingzhong]

www.cppreference.com/cppset/index.html