Defined in header <algorithm> (1) template< class T > std::pair<const T&,const T&> minmax( const T& a, const T& b ); (since C++11) (until C++14) template< class T > constexpr std::pair<const T&,const T&> minmax( const T& a, const T& b ); (since C++14) (2) template< class T, class Compare > std::pair<const T&,const T&> minmax( const T& a, const T& b,

Defined in header <locale> public: std::string grouping() const; (1) protected: virtual std::string do_grouping() const; (2) 1) Public member function, calls the member function do_grouping of the most derived class. 2) Returns the pattern that determines the grouping of the digits in the monetary output, with the same exact meaning as std::numpunct::do_grouping Return value The object of type std::string holding the groups. The standard specializations of std::

static constexpr result_type max(); (since C++11) Returns the maximum value potentially generated by the engine adaptor. This value is equal to e.max() where e is the underlying engine. Parameters (none). Return value The maximum potentially generated value. Complexity Constant. See also min [static] gets the smallest possible value in the output range (public static member function)

A RandomAccessIterator is a BidirectionalIterator that can be moved to point to any element in constant time. A pointer to an element of an array satisfies all requirements of RandomAccessIterator. Requirements The type It satisfies RandomAccessIterator if. The type It satisfies BidirectionalIterator And, given. value_type, the type denoted by std::iterator_traits<It>::value_type difference_type, the type denoted by std::iterator_traits<It>::difference_type reference, the

Terminates current function and returns specified value to the caller function. Syntax attr(optional) return expression(optional) ; (1) attr(optional) return braced-init-list ; (2) (since C++11) attr(C++11) - optional sequence of any number of attributes expression - expression, convertible to the function return type braced-init-list - brace-enclosed list of initializers and other braced-init-lists Explanation 1) Evaluates the expression, terminates the

result_type min() const; (since C++11) Returns the minimum value potentially generated by the distribution. Parameters (none). Return value The minimum value potentially generated by the distribution. Complexity Constant. See also max returns the maximum potentially generated value (public member function)

Defined in header <future> template< class T > class future; (1) (since C++11) template< class T > class future<T&>; (2) (since C++11) template<> class future<void>; (3) (since C++11) The class template std::future provides a mechanism to access the result of asynchronous operations: An asynchronous operation (created via std::async, std::packaged_task, or std::promise) can provide a std::future object to the creator o

Defined in header <locale> explicit num_get( std::size_t refs = 0 ); Creates a std::num_get facet and forwards the starting reference count refs to the base class constructor, locale::facet::facet(). Parameters refs - starting reference count

Defined in header <cmath> float fmin( float x, float y ); (1) (since C++11) double fmin( double x, double y ); (2) (since C++11) long double fmin( long double x, long double y ); (3) (since C++11) Promoted fmin( Arithmetic x, Arithmetic y ); (4) (since C++11) 1-3) Returns the smaller of two floating point arguments, treating NaNs as missing data (between a NaN and a numeric value, the numeric value is chosen) 4) A set of overloads or a func

Defined in header <cmath> float pow( float base, float exp ); (1) double pow( double base, double exp ); (2) long double pow( long double base, long double exp ); (3) float pow( float base, int iexp ); (4) (until C++11) double pow( double base, int iexp ); (5) (until C++11) long double pow( long double base, int iexp ); (6) (until C++11) Promoted pow( Arithmetic1 base, Arithmetic2 exp ); (7) (since C++11) 1-6) Co