Specifies that a type is standard layout type. Standard layout types are useful for communicating with code written in other programming languages. Note, that the standard doesn't define a named requirement or concept with this name. This is a type category defined by the core language. It is included here as concept only for consistency. Requirements All non-static data members have the same access control Has no virtual functions or virtual base classes All non-static data members and

const std::error_category& category() const; (since C++11) Returns the error category of the error value. Parameters (none). Return value The error category of the error value. Exceptions noexcept specification: noexcept See also value obtains the value of the error_code (public member function)

Defined in header <locale> template< class charT > bool isxdigit( charT ch, const locale& loc ); Checks if the given character is classified as a hexadecimal digit by the given locale's std::ctype facet. Parameters ch - character loc - locale Return value Returns true if the character is classified as a hexadecimal digit, false otherwise. Possible implementation template< class charT > bool isxdigit( charT ch, const std::locale& l

Defined in header <utility> struct piecewise_construct_t { }; (since C++11) std::piecewise_construct_t is an empty struct tag type used to disambiguate between different functions that take two tuple arguments. The overloads that do not use std::piecewise_construct_t assume that each tuple argument becomes the element of a pair. The overloads that use std::piecewise_construct_t assume that each tuple argument is used to construct, piecewise, a new object of specified type,

Defined in header <algorithm> template< class ForwardIt, class UnaryPredicate > ForwardIt partition_point( ForwardIt first, ForwardIt last, UnaryPredicate p ); (1) (since C++11) Examines the partitioned (as if by std::partition) range [first, last) and locates the end of the first partition, that is, the first element that does not satisfy p or last if all elements satisfy p. Parameters first, last - the partitioned range of elements to examine p - unary

void discard( unsigned long long z ); (since C++11) Advances the internal state by z times. Equivalent to calling operator() z times and discarding the result. Parameters z - integer value specifying the number of times to advance the state by Return value (none). Complexity See also operator() advances the engine's state and returns the generated value (public member function)

reverse_iterator rend(); const_reverse_iterator rend() const; const_reverse_iterator crend() const; (since C++11) Returns a reverse iterator to the element following the last element of the reversed container. It corresponds to the element preceding the first element of the non-reversed container. This element acts as a placeholder, attempting to access it results in undefined behavior. Parameters (none). Return value Reverse iterator to the element following the last

bool is_open(); (until C++11) bool is_open() const; (since C++11) Checks if the file stream has an associated file. Effectively calls rdbuf()->is_open(). Parameters (none). Return value true if the file stream has an associated file, false otherwise. Example See also open opens a file and associates it with the stream (public member function) close closes the associated file (public member function)

std::streamsize readsome( char_type* s, std::streamsize count ); Extracts up to count immediately available characters from the input stream. The extracted characters are stored into the character array pointed to by s. Behaves as UnformattedInputFunction. After constructing and checking the sentry object, If rdbuf()->in_avail() == -1, calls setstate(eofbit) and extracts no characters. If rdbuf()->in_avail() == 0, extracts no characters. If rdbuf()->in_avail() > 0, extr

void rehash( size_type count ); (since C++11) Sets the number of buckets to count and rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed. If the new number of buckets makes load factor more than maximum load factor (count < size() / max_load_factor()), then the new number of buckets is at least size() / max_load_factor(). Parameters count - new number of buckets Return value (none). Complexity