regex_iterator(); (1) (since C++11) regex_iterator(BidirIt a, BidirIt b, const regex_type& re, std::regex_constants::match_flag_type m = std::regex_constants::match_default); (2) (since C++11) regex_iterator(const regex_iterator&); (3) (since C++11) regex_iterator(BidirIt, BidirIt, const regex_type&&, std::regex_constants::match_flag_type = std::regex_constants::m

Defined in header <algorithm> (1) template< class T > const T& max( const T& a, const T& b ); (until C++14) template< class T > constexpr const T& max( const T& a, const T& b ); (since C++14) (2) template< class T, class Compare > const T& max( const T& a, const T& b, Compare comp ); (until C++14) template< class T, class Compare > constexpr const T& max( const T& a, const T& b, Compare co

This header was originally in the C standard library as <stdio.h>. This header is part of the C-style input/output library. Types FILE type, capable of holding all information needed to control a C I/O stream fpos_t type, capable of uniquely specifying a position in a file size_t unsigned integer type returned by the sizeof operator (typedef) Macros NULL implementation-defined null pointer constant (macro constant) stdinstdoutstderr expression of type FILE* as

Defined in header <algorithm> template< class RandomIt > void stable_sort( RandomIt first, RandomIt last ); (1) template< class RandomIt, class Compare > void stable_sort( RandomIt first, RandomIt last, Compare comp ); (2) Sorts the elements in the range [first, last) in ascending order. The order of equal elements is guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison functi

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