#include <stl_set.h>
Inheritance diagram for set:
Sets support bidirectional iterators.
Key | Type of key objects. | |
Compare | Comparison function object type, defaults to less<Key>. | |
Alloc | Allocator type, defaults to allocator<Key>. |
Definition at line 107 of file stl_set.h.
|
Public typedefs. |
|
Iterator-related typedefs. |
|
Default constructor creates no elements. |
|
Default constructor creates no elements.
|
|
Builds a set from a range.
|
|
Builds a set from a range.
|
|
Set copy constructor.
|
|
Returns a read/write iterator that points to the first element in the set. Iteration is done in ascending order according to the keys. Definition at line 238 of file stl_set.h. |
|
Erases all elements in a set. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibilty. Definition at line 412 of file stl_set.h. |
|
Finds the number of elements.
|
|
Returns true if the set is empty. |
|
Returns a read/write iterator that points one past the last element in the set. Iteration is done in ascending order according to the keys. Definition at line 246 of file stl_set.h. |
|
Finds a subsequence matching given key.
std::make_pair(c.lower_bound(val), c.upper_bound(val)) This function probably only makes sense for multisets. Definition at line 506 of file stl_set.h. |
|
Erases a [first,last) range of elements from a set.
|
|
Erases elements according to the provided key.
|
|
Erases an element from a set.
|
|
Tries to locate an element in a set.
end() ) iterator. Definition at line 444 of file stl_set.h. |
|
Returns the allocator object with which the set was constructed. |
|
A template function that attemps to insert a range of elements.
|
|
Attempts to insert an element into the set.
See http://gcc.gnu.org/onlinedocs/libstdc++/23_containers/howto.html#4 for more on "hinting". Insertion requires logarithmic time (if the hint is not taken). Definition at line 338 of file stl_set.h. |
|
Attempts to insert an element into the set.
Insertion requires logarithmic time. Definition at line 312 of file stl_set.h. |
|
Returns the comparison object with which the set was constructed. Definition at line 222 of file stl_set.h. Referenced by set< Key, Compare, Allocator >::key_comp(). |
|
Finds the beginning of a subsequence matching given key.
|
|
Returns the maximum size of the set. |
|
Set assignment operator.
|
|
Returns a read/write reverse iterator that points to the last element in the set. Iteration is done in descending order according to the keys. Definition at line 255 of file stl_set.h. |
|
Returns a read-only (constant) reverse iterator that points to the last pair in the map. Iteration is done in descending order according to the keys. Definition at line 264 of file stl_set.h. |
|
Returns the size of the set. |
|
Swaps data with another set.
Compare type (which itself is often stateless and empty), so it should be quite fast.) Note that the global std::swap() function is specialized such that std::swap(s1,s2) will feed to this function. Definition at line 294 of file stl_set.h.
Referenced by std::swap(). |
|
Finds the end of a subsequence matching given key.
|
|
Returns the comparison object with which the set was constructed. |