home | login | register | DMCA | contacts | help | donate |      

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Э Ю Я


my bookshelf | genres | recommend | rating of books | rating of authors | reviews | new | форум | collections | читалки | авторам | add
fantasy
space fantasy
fantasy is horrors
heroic
prose
  military
  child
  russian
detective
  action
  child
  ironical
  historical
  political
western
adventure
adventure (child)
child's stories
love
religion
antique
Scientific literature
biography
business
home pets
animals
art
history
computers
linguistics
mathematics
religion
home_garden
sport
technique
publicism
philosophy
chemistry
close

Loading...


Members

Member Where defined Description
value_type Container The type of object, T, stored in the multiset.
key_type Associative Container The key type associated with value_type.
key_compare Sorted Associative Container Function object that compares two keys for ordering.
value_compare Sorted Associative Container Function object that compares two values for ordering.
pointer Container Pointer to T.
reference Container Reference to T
const_reference Container Const reference to T
size_type Container An unsigned integral type.
difference_type Container A signed integral type.
iterator Container Iterator used to iterate through a multiset.
const_iterator Container Const iterator used to iterate through a multiset. (Iterator and const_iterator are the same type.)
reverse_iterator Reversible Container Iterator used to iterate backwards through a multiset.
const_reverse_iterator Reversible Container Const iterator used to iterate backwards through a multiset. (Reverse_iterator and const_reverse_iterator are the same type.)
iterator begin() const Container Returns an iterator pointing to the beginning of the multiset.
iterator end() const Container Returns an iterator pointing to the end of the multiset.
reverse_iterator rbegin() const Reversible Container Returns a reverse_iterator pointing to the beginning of the reversed multiset.
reverse_iterator rend() const Reversible Container Returns a reverse_iterator pointing to the end of the reversed multiset.
size_type size() const Container Returns the size of the multiset.
size_type max_size() const Container Returns the largest possible size of the multiset.
bool empty() const Container true if the multiset 's size is 0.
key_compare key_comp() const Sorted Associative Container Returns the key_compare object used by the multiset.
value_compare value_comp() const Sorted Associative Container Returns the value_compare object used by the multiset.
multiset() Container Creates an empty multiset.
multiset(const key_compare& comp) Sorted Associative Container Creates an empty multiset, using comp as the key_compare object.
template multiset(InputIterator f, InputIterator l) [1] Multiple Sorted Associative Container Creates a multiset with a copy of a range.
template multiset(InputIterator f, InputIterator l, const key_compare& comp) [1] Multiple Sorted Associative Container Creates a multiset with a copy of a range, using comp as the key_compare object.
multiset(const multiset&) Container The copy constructor.
multiset& operator=(const multiset&) Container The assignment operator
void swap(multiset&) Container Swaps the contents of two multisets.
iterator insert(const value_type& x) Multiple Associative Container Inserts x into the multiset.
iterator insert(iterator pos, const value_type& x) Multiple Sorted Associative Container Inserts x into the multiset, using pos as a hint to where it will be inserted.
template void insert(InputIterator, InputIterator) [1] Multiple Sorted Associative Container Inserts a range into the multiset.
void erase(iterator pos) Associative Container Erases the element pointed to by pos.
size_type erase(const key_type& k) Associative Container Erases the element whose key is k.
void erase(iterator first, iterator last) Associative Container Erases all elements in a range.
void clear() Associative Container Erases all of the elements.
iterator find(const key_type& k) const Associative Container Finds an element whose key is k.
size_type count(const key_type& k) const Associative Container Counts the number of elements whose key is k.
iterator lower_bound(const key_type& k) const Sorted Associative Container Finds the first element whose key is not less than k.
iterator upper_bound(const key_type& k) const Sorted Associative Container Finds the first element whose key greater than k.
pair equal_range(const key_type& k) const Sorted Associative Container Finds a range containing all elements whose key is k.
bool operator==(const multiset&, const multiset&) Forward Container Tests two multisets for equality. This is a global function, not a member function.
bool operator<(const multiset&, const multiset&) Forward Container Lexicographical comparison. This is a global function, not a member function.


Type requirements | Standard Template Library Programmer`s Guide | New members







Loading...