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)

The friend declaration appears in a class body and grants a function or another class access to private and protected members of the class where the friend declaration appears. Syntax friend function-declaration (1) friend function-definition (2) friend elaborated-class-name ; (3) friend simple-type-specifier ; friend typename-specifier ; (4) (since C++11) Description 1) Designates a function or several functions as friends of this class class Y { int data;

protected: void swap( basic_iostream& other ); (since C++11) Exchanges the state with another input/output stream object. Effectively calls basic_istream<CharT,Traits>::swap(other). This member function is protected: it is called by the swap member functions of the derived stream classes std::basic_stringstream and std::basic_fstream, which know how to correctly swap the associated stream buffers. Parameters other - another stream to exchange the state with Return

basic_istream& unget(); Makes the most recently extracted character available again. First clears eofbit. (since C++11) Then the function behaves as UnformattedInputFunction. After constructing and checking the sentry object, if any ios_base::iostate flags are set, the function sets failbit and returns. Otherwise, calls rdbuf()->sungetc(). If rdbuf()->sungetc() returns Traits::eof(), calls setstate(badbit). In any case, sets the gcount() counter to zero. Parameters (non

iterator find( const Key& key ); (1) const_iterator find( const Key& key ) const; (2) template< class K > iterator find( const K& x ); (3) (since C++14) template< class K > const_iterator find( const K& x ) const; (4) (since C++14) 1,2) Finds an element with key equivalent to key. 3,4) Finds an element with key that compares equivalent to the value x. This overload only participates in overload resolution if the qualified-id Compare::is_t

"Resource Acquisition Is Initialization" or RAII, is a C++ programming technique[1] which binds the life cycle of a resource (allocated memory, open socket, open file, mutex, database connection - anything that exists in limited supply) to the lifetime of an object with automatic storage duration. RAII guarantees that the resource is available to any function that may access the object (resource availability is a class invariant). It also guarantees that all resources are released when their co

Defined in header <iterator> Defined in header <array> Defined in header <deque> Defined in header <forward_list> Defined in header <list> Defined in header <map> Defined in header <regex> Defined in header <set> Defined in header <string> Defined in header <unordered_map> Defined in header <unordered_set> Defined in header <vector> templat

template< class Iterator > typename reverse_iterator<Iterator>::difference_type operator-( const reverse_iterator<Iterator>& lhs, const reverse_iterator<Iterator>& rhs ); (until C++11) template< class Iterator1, class Iterator2 > auto operator-( const reverse_iterator<Iterator1>& lhs, const reverse_iterator<Iterator2>& rhs ) -> decltype(rhs.base() - lhs.base()); (since C++11) Returns t

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

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