multiset<Key>
the key_type and value_type are Key.Multisets support bidirectional iterators.
Definition at line 105 of file stl_multiset.h.
|
Default constructor creates no elements.
Definition at line 147 of file stl_multiset.h. |
|
Builds a multiset from a range.
Definition at line 165 of file stl_multiset.h. |
|
Builds a multiset from a range.
Definition at line 181 of file stl_multiset.h. |
|
Multiset copy constructor.
Definition at line 194 of file stl_multiset.h. |
|
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 232 of file stl_multiset.h. |
|
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 405 of file stl_multiset.h. |
|
Finds the number of elements with given key.
Definition at line 416 of file stl_multiset.h. |
|
Returns true if the set is empty.
Definition at line 264 of file stl_multiset.h. |
|
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 241 of file stl_multiset.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 496 of file stl_multiset.h. |
|
Erases a [first,last) range of elements from a multiset.
Definition at line 392 of file stl_multiset.h. |
|
Erases elements according to the provided key.
Definition at line 377 of file stl_multiset.h. |
|
Erases an element from a multiset.
Definition at line 359 of file stl_multiset.h. |
|
Tries to locate an element in a set.
end() ) iterator.
Definition at line 434 of file stl_multiset.h. |
|
Returns the memory allocation object.
Definition at line 223 of file stl_multiset.h. |
|
A template function that attemps to insert a range of elements.
Definition at line 345 of file stl_multiset.h. |
|
Inserts an element into the multiset.
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 329 of file stl_multiset.h. |
|
Inserts an element into the multiset.
Insertion requires logarithmic time. Definition at line 305 of file stl_multiset.h. |
|
Returns the comparison object.
Definition at line 215 of file stl_multiset.h. |
|
Finds the beginning of a subsequence matching given key.
Definition at line 455 of file stl_multiset.h. |
|
Returns the maximum size of the set.
Definition at line 274 of file stl_multiset.h. |
|
Multiset assignment operator.
Definition at line 205 of file stl_multiset.h. |
|
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 250 of file stl_multiset.h. |
|
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 259 of file stl_multiset.h. |
|
Returns the size of the set.
Definition at line 269 of file stl_multiset.h. |
|
Swaps data with another multiset.
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 289 of file stl_multiset.h. |
|
Finds the end of a subsequence matching given key.
Definition at line 471 of file stl_multiset.h. |
|
Returns the comparison object.
Definition at line 219 of file stl_multiset.h. |