Defined in header <cmath> float fma( float x, float y, float z ); (1) (since C++11) double fma( double x, double y, double z ); (2) (since C++11) long double fma( long double x, long double y, long double z ); (3) (since C++11) Promoted fma( Arithmetic1 x, Arithmetic2 y, Arithmetic3 z ); (4) (since C++11) #define FP_FAST_FMA /* implementation-defined */ (5) (since C++11) #define FP_FAST_FMAF /* implementation-defined */ (6) (since C

Introduces a name that is defined elsewhere into the declarative region where this using-declaration appears. using typename(optional) nested-name-specifier unqualified-id ; nested-name-specifier - a sequence of names and scope resolution operators ::, ending with a scope resolution operator. A single :: refers to the global namespace. unqualified-id - an id-expression typename - the keyword typename may be used as necessary to resolve dependent names, when the using-de

Defined in header <type_traits> template< class T > struct is_member_object_pointer; (since C++11) Checks whether T is a non-static member object. Provides the member constant value which is equal to true, if T is a non-static member object type. Otherwise, value is equal to false. Template parameters T - a type to check Helper variable template template< class T > constexpr bool is_member_object_pointer_v = is_member_object_pointer<T>::va

template< class CharT, class Traits > basic_istream<CharT,Traits>& operator>>( basic_istream<CharT,Traits>& st, CharT& ch ); template< class Traits > basic_istream<char,Traits>& operator>>( basic_istream<char,Traits>& st, signed char& ch ); template< class Traits > basic_istream<char,Traits>& operator>>( basic_istream<char,Traits>& st, unsigned char& ch ); (1) template< class

iterator erase( const_iterator pos ); (1) (since C++11) iterator erase( const_iterator first, const_iterator last ); (2) (since C++11) size_type erase( const key_type& key ); (3) (since C++11) Removes specified elements from the container. 1) Removes the element at pos. 2) Removes the elements in the range [first; last), which must be a valid range in *this. 3) Removes all elements with the key equivalent to key. References and iterators to the erased elements are inv

Defined in header <type_traits> template< class T > struct is_arithmetic; (since C++11) If T is an arithmetic type (that is, an integral type or a floating-point type), provides the member constant value equal true. For any other type, value is false. Template parameters T - a type to check Helper variable template template< class T > constexpr bool is_arithmetic_v = is_arithmetic<T>::value; (since C++17) Inherited from std::inte

Defined in header <algorithm> template< class RandomIt > void random_shuffle( RandomIt first, RandomIt last ); (1) (until C++17)(deprecated in C++14) (2) template< class RandomIt, class RandomFunc > void random_shuffle( RandomIt first, RandomIt last, RandomFunc& r ); (until C++11) template< class RandomIt, class RandomFunc > void random_shuffle( RandomIt first, RandomIt last, RandomFunc&& r ); (since C++11) (until C++17)(deprecated in

Defined in header <array> template< class T, std::size_t N > struct array; (since C++11) std::array is a container that encapsulates fixed size arrays. This container is an aggregate type with the same semantics as a struct holding a C-style array T[N] as its only non-static data member. Unlike a C-style array, it doesn't decay to T* automatically. As an aggregate type, it can be initialized with aggregate-initialization given at most N initializers that ar

Defined in header <valarray> template< class T > valarray<T> log( const valarray<T>& va ); For each element in va computes natural logarithm of the value of the element. Parameters va - value array to apply the operation to Return value Value array natural logarithms of the values in va. Notes Unqualified function (log) is used to perform the computation. If such function is not available, std::log is used due to argument dependent loo

Defined in header <algorithm> template< class RandomIt > void push_heap( RandomIt first, RandomIt last ); (1) template< class RandomIt, class Compare > void push_heap( RandomIt first, RandomIt last, Compare comp ); (2) Inserts the element at the position last-1 into the max heap defined by the range [first, last-1). The first version of the function uses operator< to compare the elements, the second uses the given comparison function com