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,

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

constexpr enable_shared_from_this(); (1) (since C++11) enable_shared_from_this( const enable_shared_from_this<T>&obj ); (2) (since C++11) Constructs new enable_shared_from_this object. Parameters obj - an enable_shared_from_this to copy Exceptions noexcept specification: noexcept Example #include <memory> struct Foo : public std::enable_shared_from_this<Foo> { Foo() {} // implicitly calls enable_shared_from_this constructor std

Usage public access specifier

An AssociativeContainer is an ordered Container that provides fast lookup of objects based on keys. Requirements Legend X Container type a Object of type X a_uniq Object in X when X supports unique keys a_eq Object in X when X supports multiple keys a_trans Object in X when type X::key_compare::is_transparent exists i, j InputIterators denoting a valid range p const_iterator to a q dereferenceable const_iterator to a q1, q2 const_iterators denoting a va

Usage double type: as the declaration of the type

Defined in header <unordered_set> template< class Key, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key> > class unordered_set; (since C++11) Unordered set is an associative container that contains a set of unique objects of type Key. Search, insertion, and removal have average constant-time complexity. Internally, the elements are not sorted in any particular order, but organized

This header was originally in the C standard library as <ctype.h>. This header is part of the null-terminated byte strings library. Functions isalnum checks if a character is alphanumeric (function) isalpha checks if a character is alphabetic (function) islower checks if a character is lowercase (function) isupper checks if a character is an uppercase character (function) isdigit checks if a character is a digit (function) isxdigit checks if a character i

(1) iterator erase( iterator pos ); (until C++11) iterator erase( const_iterator pos ); (since C++11) (2) iterator erase( iterator first, iterator last ); (until C++11) iterator erase( const_iterator first, const_iterator last ); (since C++11) Removes specified elements from the container. 1) Removes the element at pos. 2) Removes the elements in the range [first; last). All iterators and references are invalidated, unless the erased elements are at the end or the be

Defined in header <future> template< class R > class promise; (1) (since C++11) template< class R > class promise<R&>; (2) (since C++11) template<> class promise<void>; (3) (since C++11) 1) base template 2) non-void specialization, used to communicate objects between threads 3) void specialization, used to communicate stateless events The class template std::promise provides a facility to store a value or an exceptio