Defined in header <locale> bool is(mask m, char c) const; (1) const char* is(const char* low, const char* high, mask* vec) const; (2) 1) Checks if the character c is classified by the mask m according to the classification table returned by the member function table(). Effectively calculates table()[(unsigned char)c] & m 2) For every character in the character array [low, high), reads its full classification mask from the classification table returned by the me

void pop_back(); Removes the last element of the container. Calling pop_back on an empty container is undefined. Iterators and references to the erased element are invalidated. It is unspecified whether the past-the-end iterator is invalidated. Other references and iterators are not affected. (until C++11) Iterators and references to the erased element are invalidated. The past-the-end iterator is also invalidated. Other references and iterators are not affected. (since C++11) P

This header was originally in the C standard library as <uchar.h>. This header is part of the null-terminated multibyte strings library. Macros __STDC_UTF_16__ indicates that UTF-16 encoding is used by mbrtoc16 and c16rtomb (macro constant) __STDC_UTF_32__ indicates that UTF-32 encoding is used by mbrtoc32 and c32rtomb (macro constant) Functions mbrtoc16 (C++11) generate the next 16-bit wide character from a narrow multibyte string (function) c16rtomb (C++11)

size_type copy( CharT* dest, size_type count, size_type pos = 0) const; Copies a substring [pos, pos+count) to character string pointed to by dest. If the requested substring lasts past the end of the string, or if count == npos, the copied substring is [pos, size()). The resulting character string is not null-terminated. If pos >= size(), std::out_of_range is thrown. Parameters dest - pointer to the destination character string pos - pos

void seed( result_type value = default_seed ); (1) (since C++11) template< class Sseq > void seed( Sseq& seq ); (2) (since C++11) Reinitializes the internal state of the random-number engine using new seed value. Parameters value - seed value to use in the initialization of the internal state seq - seed sequence to use in the initialization of the internal state Exceptions (none). Complexity Example #include <iostream> #include <rand

template< class UIntType, size_t w, size_t n, size_t m, size_t r, UIntType a, size_t u, UIntType d, size_t s, UIntType b, size_t t, UIntType c, size_t l, UIntType f > bool operator==( const mersenne_twister_engine<UIntType,w,n,m,r,a,u,d,s,b,t,c,l,f>& lhs, const mersenne_twister_engine<UIntType,w,n,m,r,a,u,d,s,b,t,c,l,f>& rhs ); (1) (since C++11) template< class UIntType, size_t w, size_t n, si

shared_lock(); (1) (since C++14) shared_lock( shared_lock&& other ); (2) (since C++14) explicit shared_lock( mutex_type& m ); (3) (since C++14) shared_lock( mutex_type& m, std::defer_lock_t t ); (4) (since C++14) shared_lock( mutex_type& m, std::try_to_lock_t t ); (5) (since C++14) shared_lock( mutex_type& m, std::adopt_lock_t t ); (6) (since C++14) template< class Rep, class Period > shared_lock( mutex_type& m,

static constexpr result_type max(); (since C++11) Returns the maximum value potentially generated by the random-number engine. This value is equal to 2w - 1, where w is word_size. Parameters (none). Return value The maximum potentially generated value. Complexity Constant. See also min [static] gets the smallest possible value in the output range (public static member function)

void swap( promise& other ); (since C++11) Exchanges the shared states of two promise objects. Parameters other - the promise to swap with Return value (none). Exceptions noexcept specification: noexcept Example See also std::swap(std::promise) (C++11) specializes the std::swap algorithm (function template)

Defined in header <ratio> template< class R1, class R2 > using ratio_multiply = /* see below */; The alias template std::ratio_multiply denotes the result of multiplying two exact rational fractions represented by the std::ratio specializations R1 and R2. The result is a std::ratio specialization std::ratio<U, V>, such that given Num == R1::num * R2::num and Denom == R1::den * R2::den (computed without arithmetic overflow), U is std::ratio<Num, Denom>::nu