std::ostreambuf_iterator::operator++

ostreambuf_iterator& operator++(); ostreambuf_iterator& operator++( int ); Does nothing. These operator overloads are provided to satisfy the requirements of OutputIterator. They make it possible for the expressions *iter++=value and *++iter=value to be used to output (insert) a value into the underlying stream. Parameters (none). Return value *this.

std::lognormal_distribution::max

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

std::shared_mutex::unlock_shared

void unlock_shared(); (since C++17) Releases the mutex from shared ownership by the calling thread. . The mutex must be locked by the current thread of execution in shared mode, otherwise, the behavior is undefined. This operation synchronizes-with (as defined in std::memory_order) any subsequent lock() operation that obtains ownership of the same mutex. Parameters (none). Return value (none). Exceptions (none). Notes unlock_shared() is usually not called directly: std::shar

std::vector::data

T* data(); (since C++11) const T* data() const; (since C++11) Returns pointer to the underlying array serving as element storage. The pointer is such that range [data(); data() + size()) is always a valid range, even if the container is empty. Parameters (none). Return value Pointer to the underlying element storage. For non-empty containers, returns &front(). Complexity Constant. Exceptions noexcept specification: noexcept See also front access the first

std::ctime

Defined in header <ctime> char* ctime( const std::time_t* time ); Converts given time since epoch to a calendar local time and then to a textual representation, as if by calling std::asctime(std::localtime(time)). The resulting string has the following format: Www Mmm dd hh:mm:ss yyyy Www - the day of the week (one of Mon, Tue, Wed, Thu, Fri, Sat, Sun). Mmm - the month (one of Jan, Feb, Mar, Apr, May, Jun, Jul, Aug, Sep, Oct, Nov, Dec). dd - the day of the month hh -

TrivialType

Specifies that a type is trivial type. Note, that the standard doesn't define a named requirement or concept with this name. This is a type category defined by the core language. It is included here as concept only for consistency. Requirements TriviallyCopyable Trivial default constructor See also is_trivial (C++11) checks if a type is trivial (class template)

std::insert_iterator::insert_iterator

explicit insert_iterator( Container& c, typename Container::iterator i ); Initializes the underlying pointer to the container to std::addressof(c) and the interlying iterator to iter. Parameters c - container to initialize the inserter with iter - iterator to initialize the inserter with

std::ctype::tolower

Defined in header <locale> public: CharT tolower( CharT c) const; (1) public: const CharT* tolower( CharT* beg, const CharT* end ) const; (2) protected: virtual CharT do_tolower( CharT c ) const; (3) protected: virtual const CharT* do_tolower( CharT* beg, const CharT* end ) const; (4) 1,2) public member function, calls the protected virtual member function do_tolower of the most derived class. 3) Converts the character c to lower case if a lower case for

std::reverse

Defined in header <algorithm> template< class BidirIt > void reverse( BidirIt first, BidirIt last ); Reverses the order of the elements in the range [first, last). Behaves as if applying std::iter_swap to every pair of iterators first+i, (last-i) - 1 for each non-negative i < (last-first)/2. Parameters first, last - the range of elements to reverse Type requirements - BidirIt must meet the requirements of BidirectionalIterator. -The type of dereferenc

std::unordered_multimap::hash_function

hasher hash_function() const; (since C++11) Returns the function that hashes the keys. Parameters (none). Return value The hash function. Complexity Constant. See also key_eq returns the function used to compare keys for equality (public member function)