Defined in header <iterator> template <class Iterator> std::reverse_iterator<Iterator> make_reverse_iterator( Iterator i ); (since C++14) make_reverse_iterator is a convenience function template that constructs a std::reverse_iterator for the given iterator i with the type deduced from the type of the argument. Parameters i - input iterator to be converted to reverse iterator Return value A std::reverse_iterator constructed from i. Possible imple

Defined in header <cstring> char *strncat( char *dest, const char *src, std::size_t count ); Appends a byte string pointed to by src to a byte string pointed to by dest. At most count characters are copied. The resulting byte string is null-terminated. The destination byte string must have enough space for the contents of both dest and src plus the terminating null character, except that the size of src is limited to count. The behavior is undefined if the strings overlap.

template< class ForwardIt > string_type transform( ForwardIt first, ForwardIt last) const; Obtains the sort key for the character sequence [first, last), such that if a sort key compares less than another sort key with operator<, then the character sequence that produced the first sort key comes before the character sequence that produced the second sort key, in the currently imbued locale's collation order. For example when the regex flag std::regex_constants::collate is set,

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)

bad_weak_ptr(); Constructs new bad_weak_ptr object. what() returns "bad_weak_ptr" afterwards. Parameters (none). Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11)

Defined in header <memory> class bad_weak_ptr; (since C++11) std::bad_weak_ptr is the type of the object thrown as exceptions by the constructors of std::shared_ptr that take std::weak_ptr as the argument, when the std::weak_ptr refers to an already deleted object. Inheritance diagram. Member functions (constructor) constructs the bad_weak_ptr object (public member function) Inherited from std::exception Member functions (destructor) [virtual]

Defined in header <cstdio> void perror( const char *s ); Prints a textual description of the error code currently stored in the system variable errno to stderr. The description is formed by concatenating the following components: the contents of the null-terminated byte string pointed to by s (unless s is a null pointer) ": " implementation-defined error message describing the error code stored in errno. This message is identical to the output of std::strerror(errno).

Defined in header <locale> public: dateorder date_order() const; (1) protected: virtual dateorder do_date_order() const; (2) 1) Public member function, calls the protected virtual member function do_date_order of the most derived class. 2) Returns a value of type std::time_base::dateorder, which describes the default date format used by this locale (expected by get_date() and produced by std::strftime() with format specifier '%x'). The valid values (inherited from s

(since C++11) (member only of atomic<Integral> template specialization) T fetch_or( T arg, std::memory_order order = std::memory_order_seq_cst ); T fetch_or( T arg, std::memory_order order = std::memory_order_seq_cst ) volatile; Atomically replaces the current value with the result of bitwise OR of the value and arg. The operation is read-modify-write operation. Memory is affected according to the value of order. Parameters arg - the oth

(since C++11) void store( T desired, std::memory_order order = std::memory_order_seq_cst ); void store( T desired, std::memory_order order = std::memory_order_seq_cst ) volatile; Atomically replaces the current value with desired. Memory is affected according to the value of order. order must be one of std::memory_order_relaxed, std::memory_order_release or std::memory_order_seq_cst. Otherwise the behavior is undefined. Parameters desired - the value to store into the