Defined in header <algorithm> template< class InputIt, class T > typename iterator_traits<InputIt>::difference_type count( InputIt first, InputIt last, const T &value ); (1) template< class InputIt, class UnaryPredicate > typename iterator_traits<InputIt>::difference_type count_if( InputIt first, InputIt last, UnaryPredicate p ); (2) Returns the number of elements in the range [first, last) satisfying specific criteria. The first ve

iterator begin(); (since C++11) const_iterator begin() const; (since C++11) const_iterator cbegin() const; (since C++11) Returns an iterator to the beginning of the list of sub-matches. If match was successful, the iterator will point to the entire matched expression. Parameters (none). Return value Iterator to the first sub-match. Exceptions noexcept specification: noexcept Complexity Constant. See also endcend returns iterator to the end of the list of

void pop(); Removes an element from the front of the queue. Effectively calls c.pop_front(). Parameters (none). Return value (none). Complexity Equal to the complexity of Container::pop_front. See also emplace (C++11) constructs element in-place at the end (public member function) push inserts element at the end (public member function) front access the first element (public member function)

Defined in header <type_traits> template< class T, class U > struct is_assignable; (1) (since C++11) template< class T, class U > struct is_trivially_assignable; (2) (since C++11) template< class T, class U > struct is_nothrow_assignable; (3) (since C++11) 1) If the expression std::declval<T>() = std::declval<U>() is well-formed in unevaluated context, provides the member constant value equal true. Otherwise, value is false. Access

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

The class template std::ratio and associated templates provide compile-time rational arithmetic support. Each instantiation of this template exactly represents any finite rational number. Compile-time fractions Defined in header <ratio> ratio represents exact rational fraction (class template) Several convenience typedefs that correspond to the SI ratios are provided by the standard library: Defined in header <ratio> Type Definition yocto std::ratio<1, 1000

Defined in header <cstdio> char* fgets( char* str, int count, std::FILE* stream ); Reads at most count - 1 characters from the given file stream and stores them in str. The produced character string is always null-terminated. Parsing stops if end-of-file occurs or a newline character is found, in which case str will contain that newline character. Parameters str - string to read the characters to count - the length of str stream - file stream to read the

(1) (since C++11) (member only of atomic<Integral> template specialization) T operator+=( T arg ); T operator+=( T arg ) volatile; (1) (since C++11) (member only of atomic<T*> template specialization) T* operator+=( std::ptrdiff_t arg ); T* operator+=( std::ptrdiff_t arg ) volatile; (2) (since C++11) (member only of atomic<Integral> template specialization) T operator-=( T arg ); T operator-=( T arg ) volatile; (2) (since C++11) (member

Definitions are declarations that fully define the entity introduced by the declaration. Every declaration is a definition, except for the following: Any declaration with an extern storage class specifier or with a language linkage specifier (such as extern "C") without an initializer extern const int a; // declares, but doesn't define a extern const int b = 1; // defines b A function declaration without a function body int f(int); // declares, but doesn't define f A parameter declaratio

size_type size() const; Returns the number of elements in the underlying container, that is, c.size(). Parameters (none). Return value The number of elements in the container. Complexity Constant. See also empty checks whether the underlying container is empty (public member function)