param_type param() const; (1) (since C++11) void param( const param_type& params ); (2) (since C++11) Manages the associated distribution parameter set. 1) Returns the associated parameter set. 2) Sets the associated parameter set to params. Parameters params - new contents of the associated parameter set Return value 1) The associated parameter set. 2) (none). Complexity Constant.

Defined in header <type_traits> template< class T > struct underlying_type; (since C++11) If T is a complete (since C++17) enumeration type, provides a member typedef type that names the underlying type of T. Otherwise, the behavior is undefined. Member types Name Definition type the underlying type of T Helper types template< class T > using underlying_type_t = typename underlying_type<T>::type; (since C++14) Notes Each enumerat

Defined in header <functional> template< class T > std::reference_wrapper<T> ref(T& t); (1) (since C++11) template< class T > std::reference_wrapper<T> ref( std::reference_wrapper<T> t ); (2) (since C++11) template <class T> void ref(const T&&) = delete; (3) (since C++11) template< class T > std::reference_wrapper<const T> cref( const T& t ); (4) (since C++11) template< class T > std::ref

Defined in header <mutex> template< class Mutex > class lock_guard; (since C++11) (until C++17) template< class... MutexTypes > class lock_guard; (since C++17) The class lock_guard is a mutex wrapper that provides a convenient RAII-style mechanism for owning a mutex or several mutexes (since C++17) for the duration of a scoped block. When a lock_guard object is created, it attempts to take ownership of the mutex it is given. When control leaves the scope i

Defined in header <algorithm> template< class InputIt, class UnaryPredicate > bool is_partitioned( InputIt first, InputIt last, UnaryPredicate p ); (since C++11) Returns true if all elements in the range [first, last) that satisfy the predicate p appear before all elements that don't. Also returns true if [first, last) is empty. Parameters first, last - the range of elements to check p - unary predicate which returns ​true for the elements expected to be

Defined in header <cmath> bool signbit( float arg ); (1) (since C++11) bool signbit( double arg ); (2) (since C++11) bool signbit( long double arg ); (3) (since C++11) bool signbit( Integral arg ); (4) (since C++11) 1-3) Determines if the given floating point number arg is negative. 4) A set of overloads or a function template accepting the from argument of any integral type. Equivalent to (2) (the argument is cast to double). Parameters arg - f

Defined in header <clocale> struct lconv; The class std::lconv contains numeric and monetary formatting rules as defined by a C locale. Objects of this struct may be obtained with std::localeconv. The members of std::lconv are values of type char and of type char*. Each char* member except decimal_point may be pointing at a null character (that is, at an empty C-string). The members of type char are all non-negative numbers, any of which may be CHAR_MAX if the corresponding

Defined in header <regex> template< class BidirIt, class Alloc > void swap( match_results<BidirIt,Alloc>& x1, match_results<BidirIt,Alloc>& x2 ); (since C++11) Specializes the std::swap algorithm for std::match_results. Exchanges the contents of x1 with those of x2. Effectively calls x1.swap(x2). Parameters x1, x2 - the match_results objects whose contents will be swapped Type requirements - BidirIt must meet the requirements

Defined in header <algorithm> template< class ForwardIt1, class ForwardIt2 > ForwardIt2 swap_ranges( ForwardIt1 first1, ForwardIt1 last1, ForwardIt2 first2 ); Exchanges elements between range [first1, last1) and another range starting at first2. Parameters first1, last1 - the first range of elements to swap first2 - beginning of the second range of elements to swap Type requirements - ForwardIt1, ForwardIt2 must meet the requirements of ForwardIterat

reference back(); const_reference back() const; Returns reference to the last element in the container. Calling back on an empty container is undefined. Parameters (none). Return value Reference to the last element. Complexity Constant. Notes For a container c, the expression return c.back(); is equivalent to { auto tmp = c.end(); --tmp; return *tmp; } Example The following code uses back to display the last element of a std::vector<char>: #include <vector