#include <stl_set.h>
Public Types | |
typedef Key | key_type |
Public typedefs. | |
typedef Key | value_type |
Public typedefs. | |
typedef Compare | key_compare |
Public typedefs. | |
typedef Compare | value_compare |
Public typedefs. | |
typedef Alloc::pointer | pointer |
Iterator-related typedefs. | |
typedef Alloc::const_pointer | const_pointer |
Iterator-related typedefs. | |
typedef Alloc::reference | reference |
Iterator-related typedefs. | |
typedef Alloc::const_reference | const_reference |
Iterator-related typedefs. | |
typedef Rep_type::const_iterator | iterator |
Iterator-related typedefs. | |
typedef Rep_type::const_iterator | const_iterator |
Iterator-related typedefs. | |
typedef Rep_type::const_reverse_iterator | reverse_iterator |
Iterator-related typedefs. | |
typedef Rep_type::const_reverse_iterator | const_reverse_iterator |
Iterator-related typedefs. | |
typedef Rep_type::size_type | size_type |
Iterator-related typedefs. | |
typedef Rep_type::difference_type | difference_type |
Iterator-related typedefs. | |
typedef Rep_type::allocator_type | allocator_type |
Iterator-related typedefs. | |
Public Member Functions | |
set () | |
Default constructor creates no elements. | |
set (const Compare &comp, const allocator_type &a=allocator_type()) | |
Default constructor creates no elements. | |
template<class InputIterator> | |
set (InputIterator first, InputIterator last) | |
Builds a set from a range. | |
template<class InputIterator> | |
set (InputIterator first, InputIterator last, const Compare &comp, const allocator_type &a=allocator_type()) | |
Builds a set from a range. | |
set (const set< Key, Compare, Alloc > &x) | |
Set copy constructor. | |
set< Key, Compare, Alloc > & | operator= (const set< Key, Compare, Alloc > &x) |
Set assignment operator. | |
key_compare | key_comp () const |
Returns the comparison object with which the set was constructed. | |
value_compare | value_comp () const |
Returns the comparison object with which the set was constructed. | |
allocator_type | get_allocator () const |
Returns the allocator object with which the set was constructed. | |
iterator | begin () const |
iterator | end () const |
reverse_iterator | rbegin () const |
reverse_iterator | rend () const |
bool | empty () const |
Returns true if the set is empty. | |
size_type | size () const |
Returns the size of the set. | |
size_type | max_size () const |
Returns the maximum size of the set. | |
void | swap (set< Key, Compare, Alloc > &x) |
Swaps data with another set. | |
pair< iterator, bool > | insert (const value_type &x) |
Attempts to insert an element into the set. | |
iterator | insert (iterator position, const value_type &x) |
Attempts to insert an element into the set. | |
template<class InputIterator> | |
void | insert (InputIterator first, InputIterator last) |
A template function that attemps to insert a range of elements. | |
void | erase (iterator position) |
Erases an element from a set. | |
size_type | erase (const key_type &x) |
Erases elements according to the provided key. | |
void | erase (iterator first, iterator last) |
Erases a [first,last) range of elements from a set. | |
void | clear () |
size_type | count (const key_type &x) const |
Finds the number of elements. | |
iterator | find (const key_type &x) |
Tries to locate an element in a set. | |
const_iterator | find (const key_type &x) const |
Tries to locate an element in a set. | |
iterator | lower_bound (const key_type &x) |
Finds the beginning of a subsequence matching given key. | |
const_iterator | lower_bound (const key_type &x) const |
Finds the beginning of a subsequence matching given key. | |
iterator | upper_bound (const key_type &x) |
Finds the end of a subsequence matching given key. | |
const_iterator | upper_bound (const key_type &x) const |
Finds the end of a subsequence matching given key. | |
pair< iterator, iterator > | equal_range (const key_type &x) |
Finds a subsequence matching given key. | |
pair< const_iterator, const_iterator > | equal_range (const key_type &x) const |
Finds a subsequence matching given key. | |
Private Types | |
typedef Rb_tree < key_type, value_type, Identity < value_type >, key_compare, Alloc > | Rep_type |
Private Attributes | |
Rep_type | M_t |
Meets the requirements of a container, a reversible container, and an associative container (using unique keys).
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.
typedef Key std::set< Key, Compare, Alloc >::key_type |
typedef Key std::set< Key, Compare, Alloc >::value_type |
typedef Compare std::set< Key, Compare, Alloc >::key_compare |
typedef Compare std::set< Key, Compare, Alloc >::value_compare |
typedef Alloc::pointer std::set< Key, Compare, Alloc >::pointer |
typedef Alloc::const_pointer std::set< Key, Compare, Alloc >::const_pointer |
typedef Alloc::reference std::set< Key, Compare, Alloc >::reference |
typedef Alloc::const_reference std::set< Key, Compare, Alloc >::const_reference |
typedef Rep_type::const_iterator std::set< Key, Compare, Alloc >::iterator |
typedef Rep_type::const_iterator std::set< Key, Compare, Alloc >::const_iterator |
typedef Rep_type::const_reverse_iterator std::set< Key, Compare, Alloc >::reverse_iterator |
typedef Rep_type::const_reverse_iterator std::set< Key, Compare, Alloc >::const_reverse_iterator |
typedef Rep_type::size_type std::set< Key, Compare, Alloc >::size_type |
typedef Rep_type::difference_type std::set< Key, Compare, Alloc >::difference_type |
typedef Rep_type::allocator_type std::set< Key, Compare, Alloc >::allocator_type |
std::set< Key, Compare, Alloc >::set | ( | const Compare & | comp, | |
const allocator_type & | a = allocator_type() | |||
) | [inline, explicit] |
std::set< Key, Compare, Alloc >::set | ( | InputIterator | first, | |
InputIterator | last | |||
) | [inline] |
Builds a set from a range.
Create a set consisting of copies of the elements from [first,last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(first,last)).
std::set< Key, Compare, Alloc >::set | ( | InputIterator | first, | |
InputIterator | last, | |||
const Compare & | comp, | |||
const allocator_type & | a = allocator_type() | |||
) | [inline] |
Builds a set from a range.
Create a set consisting of copies of the elements from [first,last). This is linear in N if the range is already sorted, and NlogN otherwise (where N is distance(first,last)).
std::set< Key, Compare, Alloc >::set | ( | const set< Key, Compare, Alloc > & | x | ) | [inline] |
Set copy constructor.
x | A set of identical element and allocator types. |
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
key_compare std::set< Key, Compare, Alloc >::key_comp | ( | ) | const [inline] |
Returns the comparison object with which the set was constructed.
Definition at line 222 of file stl_set.h.
Referenced by std::set< Key, Compare, Allocator >::key_comp().
value_compare std::set< Key, Compare, Alloc >::value_comp | ( | ) | const [inline] |
allocator_type std::set< Key, Compare, Alloc >::get_allocator | ( | ) | const [inline] |
iterator std::set< Key, Compare, Alloc >::begin | ( | ) | const [inline] |
Returns a read/write iterator that points to the first element in the set. Iteration is done in ascending order according to the keys.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
iterator std::set< Key, Compare, Alloc >::end | ( | ) | const [inline] |
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.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
reverse_iterator std::set< Key, Compare, Alloc >::rbegin | ( | ) | const [inline] |
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.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
reverse_iterator std::set< Key, Compare, Alloc >::rend | ( | ) | const [inline] |
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.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
bool std::set< Key, Compare, Alloc >::empty | ( | ) | const [inline] |
void std::set< Key, Compare, Alloc >::swap | ( | set< Key, Compare, Alloc > & | x | ) | [inline] |
Swaps data with another set.
x | A set of the same element and allocator types. |
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().
pair<iterator,bool> std::set< Key, Compare, Alloc >::insert | ( | const value_type & | x | ) | [inline] |
Attempts to insert an element into the set.
x | Element to be inserted. |
Insertion requires logarithmic time.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
iterator std::set< Key, Compare, Alloc >::insert | ( | iterator | position, | |
const value_type & | x | |||
) | [inline] |
Attempts to insert an element into the set.
position | An iterator that serves as a hint as to where the element should be inserted. | |
x | Element to be inserted. |
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).
void std::set< Key, Compare, Alloc >::insert | ( | InputIterator | first, | |
InputIterator | last | |||
) | [inline] |
A template function that attemps to insert a range of elements.
first | Iterator pointing to the start of the range to be inserted. | |
last | Iterator pointing to the end of the range. |
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
void std::set< Key, Compare, Alloc >::erase | ( | iterator | position | ) | [inline] |
Erases an element from a set.
position | An iterator pointing to the element to be erased. |
size_type std::set< Key, Compare, Alloc >::erase | ( | const key_type & | x | ) | [inline] |
Erases elements according to the provided key.
x | Key of element to be erased. |
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
void std::set< Key, Compare, Alloc >::erase | ( | iterator | first, | |
iterator | last | |||
) | [inline] |
Erases a [first,last) range of elements from a set.
first | Iterator pointing to the start of the range to be erased. | |
last | Iterator pointing to the end of the range to be erased. |
void std::set< Key, Compare, Alloc >::clear | ( | ) | [inline] |
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.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
iterator std::set< Key, Compare, Alloc >::find | ( | const key_type & | x | ) | [inline] |
Tries to locate an element in a set.
x | Element to be located. |
end()
) iterator.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
const_iterator std::set< Key, Compare, Alloc >::find | ( | const key_type & | x | ) | const [inline] |
Tries to locate an element in a set.
x | Element to be located. |
end()
) iterator.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
iterator std::set< Key, Compare, Alloc >::lower_bound | ( | const key_type & | x | ) | [inline] |
Finds the beginning of a subsequence matching given key.
x | Key to be located. |
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
const_iterator std::set< Key, Compare, Alloc >::lower_bound | ( | const key_type & | x | ) | const [inline] |
Finds the beginning of a subsequence matching given key.
x | Key to be located. |
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
iterator std::set< Key, Compare, Alloc >::upper_bound | ( | const key_type & | x | ) | [inline] |
Finds the end of a subsequence matching given key.
x | Key to be located. |
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
const_iterator std::set< Key, Compare, Alloc >::upper_bound | ( | const key_type & | x | ) | const [inline] |
Finds the end of a subsequence matching given key.
x | Key to be located. |
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
pair<iterator,iterator> std::set< Key, Compare, Alloc >::equal_range | ( | const key_type & | x | ) | [inline] |
Finds a subsequence matching given key.
x | Key to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
This function probably only makes sense for multisets.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.
pair<const_iterator,const_iterator> std::set< Key, Compare, Alloc >::equal_range | ( | const key_type & | x | ) | const [inline] |
Finds a subsequence matching given key.
x | Key to be located. |
std::make_pair(c.lower_bound(val), c.upper_bound(val))
This function probably only makes sense for multisets.
Reimplemented in __gnu_debug_def::set< Key, Compare, Allocator >.