Defined in header <algorithm> template< class ForwardIt, class T > void replace( ForwardIt first, ForwardIt last, const T& old_value, const T& new_value ); (1) template< class ForwardIt, class UnaryPredicate, class T > void replace_if( ForwardIt first, ForwardIt last, UnaryPredicate p, const T& new_value ); (2) Replaces all elements satisfying specific criteria with new_value in the range [first, last). The first

Defined in header <functional> template <typename ArgumentType, typename ResultType> struct unary_function; (until C++17)(deprecated since c++11) unary_function is a base class for creating function objects with one argument. unary_function does not define operator(); it is expected that derived classes will define this. unary_function provides only two types - argument_type and result_type - defined by the template parameters. Some standard library function object ad

The following table lists the precedence and associativity of C++ operators. Operators are listed top to bottom, in descending precedence. Precedence Operator Description Associativity 1 :: Scope resolution Left-to-right 2 ++ -- Suffix/postfix increment and decrement type() type{} Functional cast () Function call [] Subscript . -> Member access 3 ++ -- Prefix increment and decrement Right-to-left + - Unary plus and minus ! ~ Logical NOT an

Defined in header <chrono> template< class Rep, class Period = std::ratio<1> > class duration; (since C++11) Class template std::chrono::duration represents a time interval. It consists of a count of ticks of type Rep and a tick period, where the tick period is a compile-time rational constant representing the number of seconds from one tick to the next. The only data stored in a duration is a tick count of type Rep. If Rep is floating point, then the

Defined in header <atomic> template< class T > struct atomic; (1) (since C++11) template<> struct atomic<Integral>; (2) (since C++11) template< class T > struct atomic<T*>; (3) (since C++11) Each instantiation and full specialization of the std::atomic template defines an atomic type. Objects of atomic types are the only C++ objects that are free from data races; that is, if one thread writes to an atomic object while another thread

Defined in header <algorithm> template< class ForwardIt > ForwardIt adjacent_find( ForwardIt first, ForwardIt last ); (1) template< class ForwardIt, class BinaryPredicate> ForwardIt adjacent_find( ForwardIt first, ForwardIt last, BinaryPredicate p ); (2) Searches the range [first, last) for two consecutive identical elements. The first version uses operator== to compare the elements, the second version uses the given binary predicate p. Parameters firs

Defined in header <tuple> constexpr tuple(); (1) (since C++11) explicit tuple( const Types&... args ); (2) (since C++11) (until C++14) explicit constexpr tuple( const Types&... args ); (2) (since C++14) template< class... UTypes > explicit tuple( UTypes&&... args ); (3) (since C++11) (until C++14) template< class... UTypes > explicit constexpr tuple( UTypes&&... args ); (3) (since C++14) template< class... UTypes

Defined in header <cwctype> int iswgraph( std::wint_t ch ); Checks if the given wide character has a graphical representation, i.e. it is either a number (0123456789), an uppercase letter (ABCDEFGHIJKLMNOPQRSTUVWXYZ), a lowercase letter (abcdefghijklmnopqrstuvwxyz), a punctuation character(!"#$%&'()*+,-./:;<=>?@[\]^_`{|}~) or any graphical character specific to the current C locale. Parameters ch - wide character Return value Non-zero value if the wi

Defined in header <new> replaceable deallocation functions void operator delete ( void* ptr ); (1) void operator delete[]( void* ptr ); (2) void operator delete ( void* ptr, const std::nothrow_t& tag ); (3) void operator delete[]( void* ptr, const std::nothrow_t& tag ); (4) void operator delete ( void* ptr, std::size_t sz ); (5) (since C++14) void operator delete[]( void* ptr, std::size_t sz ); (6) (since C++14) placement dealloca

Defined in header <numeric> template< class InputIt, class OutputIt > OutputIt partial_sum( InputIt first, InputIt last, OutputIt d_first ); (1) template< class InputIt, class OutputIt, class BinaryOperation > OutputIt partial_sum( InputIt first, InputIt last, OutputIt d_first, BinaryOperation op ); (2) Computes the partial sums of the elements in the subranges of the range [first, last) and writes them to the range beginning at d_fir