multiset<Key>
the key_type and value_type are Key.Multisets support bidirectional iterators.
Definition at line 105 of file stl_multiset.h.
multiset | ( | ) | [inline] |
multiset | ( | _InputIterator | __first, | |
_InputIterator | __last | |||
) | [inline] |
Builds a multiset from a range.
Create a multiset 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)).
Definition at line 169 of file stl_multiset.h.
multiset | ( | _InputIterator | __first, | |
_InputIterator | __last, | |||
const _Compare & | __comp, | |||
const allocator_type & | __a = allocator_type() | |||
) | [inline] |
Builds a multiset from a range.
first | An input iterator. | |
last | An input iterator. | |
comp | A comparison functor. | |
a | An allocator object. |
Definition at line 185 of file stl_multiset.h.
Multiset copy constructor.
x | A multiset of identical element and allocator types. |
Definition at line 198 of file stl_multiset.h.
iterator begin | ( | ) | const [inline] |
Returns a read/write iterator that points to the first element in the multiset. Iteration is done in ascending order according to the keys.
Definition at line 236 of file stl_multiset.h.
void clear | ( | ) | [inline] |
Erases all elements in a multiset. 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 400 of file stl_multiset.h.
size_type count | ( | const key_type & | __x | ) | const [inline] |
Finds the number of elements with given key.
x | Key of elements to be located. |
Definition at line 411 of file stl_multiset.h.
References std::count().
bool empty | ( | ) | const [inline] |
iterator end | ( | ) | const [inline] |
Returns a read/write iterator that points one past the last element in the multiset. Iteration is done in ascending order according to the keys.
Definition at line 245 of file stl_multiset.h.
std::pair<const_iterator, const_iterator> 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.
Definition at line 495 of file stl_multiset.h.
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.
Definition at line 491 of file stl_multiset.h.
Erases a [first,last) range of elements from a multiset.
first | Iterator pointing to the start of the range to be erased. | |
last | Iterator pointing to the end of the range to be erased. |
Definition at line 390 of file stl_multiset.h.
size_type erase | ( | const key_type & | __x | ) | [inline] |
Erases elements according to the provided key.
x | Key of element to be erased. |
Definition at line 375 of file stl_multiset.h.
void erase | ( | iterator | __position | ) | [inline] |
Erases an element from a multiset.
position | An iterator pointing to the element to be erased. |
Definition at line 360 of file stl_multiset.h.
const_iterator find | ( | const key_type & | __x | ) | const [inline] |
Tries to locate an element in a set.
x | Element to be located. |
end()
) iterator.
Definition at line 433 of file stl_multiset.h.
iterator find | ( | const key_type & | __x | ) | [inline] |
Tries to locate an element in a set.
x | Element to be located. |
end()
) iterator.
Definition at line 429 of file stl_multiset.h.
allocator_type get_allocator | ( | ) | const [inline] |
void 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. |
Definition at line 346 of file stl_multiset.h.
Inserts an element into the multiset.
position | An iterator that serves as a hint as to where the element should be inserted. | |
x | Element to be inserted. |
Note that the first parameter is only a hint and can potentially improve the performance of the insertion process. A bad hint would cause no gains in efficiency.
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 333 of file stl_multiset.h.
iterator insert | ( | const value_type & | __x | ) | [inline] |
Inserts an element into the multiset.
x | Element to be inserted. |
Insertion requires logarithmic time.
Definition at line 309 of file stl_multiset.h.
key_compare key_comp | ( | ) | const [inline] |
const_iterator lower_bound | ( | const key_type & | __x | ) | const [inline] |
Finds the beginning of a subsequence matching given key.
x | Key to be located. |
Definition at line 454 of file stl_multiset.h.
iterator lower_bound | ( | const key_type & | __x | ) | [inline] |
Finds the beginning of a subsequence matching given key.
x | Key to be located. |
Definition at line 450 of file stl_multiset.h.
size_type max_size | ( | ) | const [inline] |
multiset<_Key,_Compare,_Alloc>& operator= | ( | const multiset< _Key, _Compare, _Alloc > & | __x | ) | [inline] |
Multiset assignment operator.
x | A multiset of identical element and allocator types. |
Definition at line 209 of file stl_multiset.h.
References multiset::_M_t.
reverse_iterator rbegin | ( | ) | const [inline] |
Returns a read/write reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.
Definition at line 254 of file stl_multiset.h.
reverse_iterator rend | ( | ) | const [inline] |
Returns a read/write reverse iterator that points to the last element in the multiset. Iteration is done in descending order according to the keys.
Definition at line 263 of file stl_multiset.h.
size_type size | ( | ) | const [inline] |
void swap | ( | multiset< _Key, _Compare, _Alloc > & | __x | ) | [inline] |
Swaps data with another multiset.
x | A multiset 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 293 of file stl_multiset.h.
References multiset::_M_t, and std::swap().
Referenced by std::swap().
const_iterator upper_bound | ( | const key_type & | __x | ) | const [inline] |
Finds the end of a subsequence matching given key.
x | Key to be located. |
Definition at line 470 of file stl_multiset.h.
iterator upper_bound | ( | const key_type & | __x | ) | [inline] |
Finds the end of a subsequence matching given key.
x | Key to be located. |
Definition at line 466 of file stl_multiset.h.
value_compare value_comp | ( | ) | 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.
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.