Defined in header <algorithm> (1) template< class ForwardIt > ForwardIt max_element(ForwardIt first, ForwardIt last); (until C++17) template< class ForwardIt > constexpr ForwardIt max_element(ForwardIt first, ForwardIt last); (since C++17) (2) template< class ForwardIt, class Compare > ForwardIt max_element(ForwardIt first, ForwardIt last, Compare cmp); (until C++17) template< class ForwardIt, class Compare > constexpr ForwardIt max_ele

regex_token_iterator(); (1) (since C++11) regex_token_iterator( BidirectionalIterator a, BidirectionalIterator b, const regex_type& re, int submatch = 0, std::regex_constants::match_flag_type m = std::regex_constants::match_default ); (2) (since C++11) regex_token_iterator( BidirectionalIterator a, BidirectionalIterator b, const regex_type& re,

members of the primary template, unique_ptr<T> void reset( pointer ptr = pointer() ); (1) members of the specialization unique_ptr<T[]> void reset( pointer ptr = pointer() ); (2) (until C++17) (3) template< class U > void reset( U ) = delete; (until C++17) template< class U > void reset( U ); (since C++17) (4) void reset( std::nullptr_t p ); (until C++17) void reset( std::nullptr_t p = nullptr ); (since C++17) Replaces the

atomic() = default; (1) (since C++11) constexpr atomic( T desired ); (2) (since C++11) atomic( const atomic& ) = delete; (3) (since C++11) Constructs new atomic variable. 1) The default constructor is trivial: no initialization takes place other than zero initialization of static and thread-local objects. std::atomic_init may be used to complete initialization. 2) Initializes the underlying value with desired. The initialization is not atomic. 3) Atomic variables are

Usage bool type: as the declaration of the type

(1) explicit unordered_multiset( size_type bucket_count = /*implementation-defined*/, const Hash& hash = Hash(), const KeyEqual& equal = KeyEqual(), const Allocator& alloc = Allocator() ); (since C++11) (until C++14) unordered_multiset() : unordered_multiset( size_type(/*implementation-defined*/) {} explicit unordered_multiset( size_type bucket_count, const Has

local_iterator end( size_type n ); (since C++11) const_local_iterator end( size_type n ) const; (since C++11) const_local_iterator cend( size_type n ) const; (since C++11) Returns an iterator to the element following the last element of the bucket with index n. . This element acts as a placeholder, attempting to access it results in undefined behavior. Parameters n - the index of the bucket to access Return value iterator to the element following the last eleme

Defined in header <iterator> template< class T, class CharT = char, class Traits = std::char_traits<CharT>, class Distance = std::ptrdiff_t > class istream_iterator: public std::iterator<std::input_iterator_tag, T, Distance, const T*, const T&> (until C++17) template< class T, class CharT = char, class Traits = std::char_traits<CharT>, class

Defined in header <iterator> template< class CharT, class Traits = std::char_traits<CharT> > class istreambuf_iterator : public std::iterator< std::input_iterator_tag, CharT, typename Traits::off_type, /* unspecified, usually CharT* */, CharT > (until C++17) te

Defined in header <memory> template< class Ptr > struct pointer_traits; (1) (since C++11) template< class T > struct pointer_traits<T*>; (2) (since C++11) The pointer_traits class template provides the standardized way to access certain properties of pointer-like types. The standard template std::allocator_traits relies on pointer_traits to determine the defaults for various typedefs required by Allocator. 1) The non-specialized pointer_traits declar