allocator_type get_allocator() const; (since C++11) Returns the allocator associated with the container. Parameters (none). Return value The associated allocator. Complexity Constant.

Defined in header <type_traits> template< class T > struct is_signed; (since C++11) If T is a signed arithmetic type, provides the member constant value equal true. For any other type, value is false. Template parameters T - a type to check Helper variable template template< class T > constexpr bool is_signed_v = is_signed<T>::value; (since C++17) Inherited from std::integral_constant Member constants value [static] true

Defined in header <cwchar> std::size_t mbsrtowcs( wchar_t* dst, const char** src, std::size_t len, std::mbstate_t* ps ); Converts a null-terminated multibyte character sequence, which begins in the conversion state described by *ps, from the array whose first element is pointed to by *src to its wide character representation. If dst is not null, converted characters are stored in the successive elements of

std::pair<iterator,bool> insert( const value_type& value ); (1) (since C++11) std::pair<iterator,bool> insert( value_type&& value ); (2) (since C++11) iterator insert( const_iterator hint, const value_type& value ); (3) (since C++11) iterator insert( const_iterator hint, value_type&& value ); (4) (since C++11) template< class InputIt > void insert( InputIt first, InputIt last ); (5) (since C++11) void insert( std::initiali

Transfers control to one of the several statements, depending on the value of a condition. Syntax attr(optional) switch ( condition ) statement attr(C++11) - any number of attributes condition - any expression of integral or enumeration type, or of a class type contextually implicitly convertible to an integral or enumeration type, or a declaration of a single non-array variable of such type with a brace-or-equals initializer. statement - any statement (typically a c

template< class Lock > void wait( Lock& lock ); (1) (since C++11) template< class Lock, class Predicate > void wait( Lock& lock, Predicate pred ); (2) (since C++11) wait causes the current thread to block until the condition variable is notified or a spurious wakeup occurs, optionally looping until some predicate is satisfied. 1) Atomically releases lock, blocks the current executing thread, and adds it to the list of threads waiting on *this. The thread will

Defined in header <memory> template< class ForwardIt, class Size, class T > void uninitialized_fill_n( ForwardIt first, Size count, const T& value ); (until C++11) template< class ForwardIt, class Size, class T > ForwardIt uninitialized_fill_n( ForwardIt first, Size count, const T& value ); (since C++11) Copies the given value value to the first count elements in an uninitialized memory area beginning at first as if by. for (; n--; ++first) ::new

std::size_t size() const; (until C++11) constexpr std::size_t size(); (since C++11) (until C++14) constexpr std::size_t size() const; (since C++14) Returns the number of bits that the bitset can hold. Parameters (none). Return value number of bits that the bitset can hold, i.e. the template parameter N. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) See also count returns the number of bits set to true (public member fun

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

(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