std::remquo

Defined in header <cmath> float remquo( float x, float y, int* quo ); (1) (since C++11) double remquo( double x, double y, int* quo ); (2) (since C++11) long double remquo( long double x, long double y, int* quo ); (3) (since C++11) Promoted remquo( Arithmetic1 x, Arithmetic2 y, int* quo ); (4) (since C++11) 1-3) Computes the floating-point remainder of the division operation x/y as the std::remainder() function does. Additionally, the sign

std::scoped_allocator_adaptor::destroy

Defined in header <scoped_allocator> template< class T > void destroy( T* p ); (since C++11) Uses the outer allocator to call the destructor of the object pointed to by p, by calling. std::allocator_traits<OUTERMOST>::destroy(OUTERMOST(*this), p). where OUTERMOST is the type that would be returned by calling this->outer_allocator(), and then calling the outer_allocator() member function recursively on the result of this call until reaching the type that has n

std::binary_search

Defined in header <algorithm> template< class ForwardIt, class T > bool binary_search( ForwardIt first, ForwardIt last, const T& value ); (1) template< class ForwardIt, class T, class Compare > bool binary_search( ForwardIt first, ForwardIt last, const T& value, Compare comp ); (2) Checks if an element equivalent to value appears within the range [first, last). For std::binary_search to succeed, the range [first, last) must be at least partially or

std::map::emplace

template< class... Args > std::pair<iterator,bool> emplace( Args&&... args ); (since C++11) Inserts a new element into the container by constructing it in-place with the given args if there is no element with the key in the container. Careful use of emplace allows the new element to be constructed while avoiding unnecessary copy or move operations. The constructor of the new element (i.e. std::pair<const Key, T>) is called with exactly the same arguments as sup

ATOMIC_FLAG_INIT

Defined in header <atomic> #define ATOMIC_FLAG_INIT /* implementation-defined */ Defines the expression which can be used to initialize std::atomic_flag to clear (false) state with the statement std::atomic_flag v = ATOMIC_FLAG_INIT;. It is unspecified if it can be used with other initialization contexts. If the flag has static storage duration, this initialization is static. This is the only way to initialize std::atomic_flag to a definite value: the value held after any o

std::mbtowc

Defined in header <cstdlib> int mbtowc( wchar_t* pwc, const char* s, std::size_t n ); Converts a multibyte character whose first byte is pointed to by s to a wide character, written to *pwc if pwc is not null. If s is a null pointer, resets the global conversion state and determines whether shift sequences are used. Parameters s - pointer to the multibyte character n - limit on the number of bytes in s that can be examined pwc - pointer to the wide chara

Library Concepts

Concept is a term that describes a named set of requirements for a type. Formal specification of concepts (ISO/IEC TS 19217:2015) is an experimental technical specification, which makes it possible to verify that template arguments satisfy the expectations of a template or function during overload resolution and template specialization. The library concepts listed on this page are the named requirements used in the normative text of the C++ standard to define the expectations of the standard li

std::wctomb

Defined in header <cstdlib> int wctomb( char *s, wchar_t wc ); Converts a wide character wc to multibyte encoding and stores it (including any shift sequences) in the char array whose first element is pointed to by s. No more than MB_CUR_MAX characters are stored. If wc is the null character, the null byte is written to s, preceded by any shift sequences necessary to restore the initial shift state. If s is a null pointer, resets the global conversion state and determines w

std::partial_sort_copy

Defined in header <algorithm> template< class InputIt, class RandomIt > RandomIt partial_sort_copy( InputIt first, InputIt last, RandomIt d_first, RandomIt d_last ); (1) template< class InputIt, class RandomIt, class Compare > RandomIt partial_sort_copy( InputIt first, InputIt last, RandomIt d_first, RandomIt d_last, Compare comp ); (2) Sorts some of the elements in the ran

std::dynarray::at

reference at( size_type pos ); (since {std}) const_reference at( size_type pos ) const; Returns a reference to the element at specified location pos, with bounds checking. If pos not within the range of the container, an exception of type std::out_of_range is thrown. Parameters pos - position of the element to return Return value Reference to the requested element. Exceptions std::out_of_range if !(pos < size()). Complexity Constant. See also oper