std::pair<iterator,iterator> equal_range( const Key& key ); (1) std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const; (2) template< class K > std::pair<iterator,iterator> equal_range( const K& x ); (3) (since C++14) template< class K > std::pair<const_iterator,const_iterator> equal_range( const K& x ) const; (4) (since C++14) Returns a range containing all elements with the given key in the con

iterator end(); const_iterator end() const; const_iterator cend() const; (since C++11) Returns an iterator to the element following the last element of the container. This element acts as a placeholder; attempting to access it results in undefined behavior. Parameters (none). Return value Iterator to the element following the last element. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. See also begin

bool empty() const; Checks if the container has no elements, i.e. whether begin() == end(). Parameters (none). Return value true if the container is empty, false otherwise. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. Example The following code uses empty to check if a std::multiset<int> contains any elements: #include <set> #include <iostream> int main() { std::multiset<int> numbers

template <class... Args> iterator emplace_hint( const_iterator hint, Args&&... args ); (since C++11) Inserts a new element to the container as close as possible to the position just before hint. The element is constructed in-place, i.e. no copy or move operations are performed. The constructor of the element is called with exactly the same arguments as supplied to the function, forwarded with std::forward<Args>(args).... No iterators or references are invalidated.

template< class... Args > iterator emplace( Args&&... args ); (since C++11) Inserts a new element into the container by constructing it in-place with the given args . Careful use of emplace allows the new element to be constructed while avoiding unnecessary copy or move operations. The constructor of the new element is called with exactly the same arguments as supplied to emplace, forwarded via std::forward<Args>(args).... No iterators or references are invalidated.

size_type count( const Key& key ) const; (1) template< class K > size_type count( const K& x ) const; (2) (since C++14) 1) Returns the number of elements with key key. 2) Returns the number of elements with key that compares equivalent to the value x. This overload only participates in overload resolution if the qualified-id Compare::is_transparent is valid and denotes a type. They allow calling this function without constructing an instance of Key. Parameters

void clear(); Removes all elements from the container. Invalidates any references, pointers, or iterators referring to contained elements. May invalidate any past-the-end iterators. Parameters (none). Return value (none). Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Linear in the size of the container. See also erase erases elements (public member function)

iterator begin(); const_iterator begin() const; const_iterator cbegin() const; (since C++11) Returns an iterator to the first element of the container. If the container is empty, the returned iterator will be equal to end(). Parameters (none). Return value Iterator to the first element. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. Example See also end cend returns an iterator to the end (publ

Defined in header <set> template< class Key, class Compare = std::less<Key>, class Allocator = std::allocator<Key> > class multiset; Multiset is an associative container that contains a sorted set of objects of type Key. Unlike set, multiple keys with equivalent values are allowed. Sorting is done using the key comparison function Compare. Search, insertion, and removal operations have logarithmic complexity. Everywhere the standard library use

Defined in header <functional> template<> class multiplies<void>; (since C++14) std::multiplies<> is a specialization of std::multiplies with parameter and return type deduced. Member types Member type Definition is_transparent /* unspecified */ Member functions operator() returns the product of two arguments (public member function) std::multiplies<>::operator() template< class T, class U> constexpr auto operator()