size_type count( const Key& key ) const; (1) (since C++11) Returns the number of elements with key key. Parameters key - key value of the elements to count Return value Number of elements with key key. Complexity Constant on average, worst case linear in the size of the container. See also find finds element with specific key (public member function) equal_range returns range of elements matching a specific key (public member function)

size_type rfind( const basic_string& str, size_type pos = npos ) const; (1) size_type rfind( const CharT* s, size_type pos, size_type count ) const; (2) size_type rfind( const CharT* s, size_type pos = npos ) const; (3) size_type rfind( CharT ch, size_type pos = npos ) const; (4) Finds the last substring equal to the given character sequence. Search begins at pos, i.e. the found substring must not begin in a position following pos. If npos or any value not smaller

std::pair<iterator,bool> insert( const value_type& value ); (1) std::pair<iterator,bool> insert( value_type&& value ); (2) (since C++11) (3) iterator insert( iterator hint, const value_type& value ); (until C++11) iterator insert( const_iterator hint, const value_type& value ); (since C++11) iterator insert( const_iterator hint, value_type&& value ); (4) (since C++11) template< class InputIt > void insert( InputIt firs

Defined in header <algorithm> template< class BidirIt1, class BidirIt2 > BidirIt2 move_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last ); (since C++11) Moves the elements from the range [first, last), to another range ending at d_last. The elements are moved in reverse order (the last element is moved first), but their relative order is preserved. The behavior is undefined if d_last is within (first, last]. std::move must be used instead of std::move_backwar

Defined in header <cstdio> std::size_t fread( void* buffer, std::size_t size, std::size_t count, std::FILE* stream ); Reads up to count objects into the array buffer from the given input stream stream as if by calling std::fgetc size times for each object, and storing the results, in the order obtained, into the successive positions of buffer, which is reinterpreted as an array of unsigned char. The file position indicator for the stream is advanced by the number of charact

Defined in header <streambuf> template< class CharT, class Traits = std::char_traits<CharT> > class basic_streambuf; The class basic_streambuf controls input and output to a character sequence. It includes and provides access to. 1) The controlled character sequence, also called the buffer, which may contain input sequence (also called get area) for buffering the input operations and/or output sequence (also called put area) for buffering the output o

Usage void specifier used to declare void* type

Usage if statement: as the declaration of the alternative branch

Initialization of a variable provides its initial value at the time of construction. The initial value may be provided in the initializer section of a declarator or a new expression. It also takes place during function calls: function parameters and the function return values are also initialized. For each declarator, the initializer may be one of the following: ( expression-list ) (1) = expression (2) { initializer-list } (3) 1) comma-separated list of arbitrary expressi

Usage alternative operators: as an alternative for &