Defined in header <locale> public: int compare( const CharT* low1, const CharT* high1, const CharT* low2, const CharT* high2 ) const; (1) protected: virtual int do_compare( const CharT* low1, const CharT* high1, const CharT* low2, const CharT* high2 ) const; (2) 1) Public member function, calls the protected virtual member function do_compare of the most derived class. 2) Compares the character sequence [low1, high1) to the chara

Defined in header <complex> template< class T > T arg( const complex<T>& z ); (1) long double arg( long double z ); (2) (since C++11) template< class DoubleOrIngeter > double arg( DoubleOrInteger z ); (3) (since C++11) float arg( float z ); (4) (since C++11) Calculates the phase angle (in radians) of the complex number z. (since C++11)Additional overloads are provided for float, double, long double, and all integer types, which are t

Usage typeid operator

static const int digits10; (until C++11) static constexpr int digits10 (since C++11) The value of std::numeric_limits<T>::digits10 is the number of base-10 digits that can be represented by the type T without change, that is, any number with this many decimal digits can be converted to a value of type T and back to decimal form, without change due to rounding or overflow. For base-radix types, it is the value of digits (digits-1 for floating-point types) multiplied by log10(

Defined in header <type_traits> template< class T > struct is_destructible; (1) (since C++11) template< class T > struct is_trivially_destructible; (2) (since C++11) template< class T > struct is_nothrow_destructible; (3) (since C++11) 1) If an imaginary struct containing a member object of type T has a non-deleted destructor, provides the member constant value equal true. For any other type, value is false. (until C++14) 1) If T is a refere

Defined in header <cstdlib> int wctomb( char *s, wchar_t wc ); Converts a wide character wc to multibyte encoding and stores it (including any shift sequences) in the char array whose first element is pointed to by s. No more than MB_CUR_MAX characters are stored. If wc is the null character, the null byte is written to s, preceded by any shift sequences necessary to restore the initial shift state. If s is a null pointer, resets the global conversion state and determines w

Defined in header <algorithm> template< class InputIt, class RandomIt > RandomIt partial_sort_copy( InputIt first, InputIt last, RandomIt d_first, RandomIt d_last ); (1) template< class InputIt, class RandomIt, class Compare > RandomIt partial_sort_copy( InputIt first, InputIt last, RandomIt d_first, RandomIt d_last, Compare comp ); (2) Sorts some of the elements in the ran

reference at( size_type pos ); (since {std}) const_reference at( size_type pos ) const; Returns a reference to the element at specified location pos, with bounds checking. If pos not within the range of the container, an exception of type std::out_of_range is thrown. Parameters pos - position of the element to return Return value Reference to the requested element. Exceptions std::out_of_range if !(pos < size()). Complexity Constant. See also oper

template< class... Args > std::pair<iterator,bool> emplace( Args&&... args ); (since C++11) Inserts a new element into the container by constructing it in-place with the given args if there is no element with the key in the container. Careful use of emplace allows the new element to be constructed while avoiding unnecessary copy or move operations. The constructor of the new element (i.e. std::pair<const Key, T>) is called with exactly the same arguments as sup

Defined in header <algorithm> template< class ForwardIt, class T > bool binary_search( ForwardIt first, ForwardIt last, const T& value ); (1) template< class ForwardIt, class T, class Compare > bool binary_search( ForwardIt first, ForwardIt last, const T& value, Compare comp ); (2) Checks if an element equivalent to value appears within the range [first, last). For std::binary_search to succeed, the range [first, last) must be at least partially or