std::nth_element

Defined in header <algorithm> template< class RandomIt > void nth_element( RandomIt first, RandomIt nth, RandomIt last ); (1) template< class RandomIt, class Compare > void nth_element( RandomIt first, RandomIt nth, RandomIt last, Compare comp ); (2) nth_element is a partial sorting algorithm that rearranges elements in [first, last) such that: The element pointed at by nth is changed to whatever element would occur in that position if [first, last) was s

std::log(std::valarray)

Defined in header <valarray> template< class T > valarray<T> log( const valarray<T>& va ); For each element in va computes natural logarithm of the value of the element. Parameters va - value array to apply the operation to Return value Value array natural logarithms of the values in va. Notes Unqualified function (log) is used to perform the computation. If such function is not available, std::log is used due to argument dependent loo

std::array

Defined in header <array> template< class T, std::size_t N > struct array; (since C++11) std::array is a container that encapsulates fixed size arrays. This container is an aggregate type with the same semantics as a struct holding a C-style array T[N] as its only non-static data member. Unlike a C-style array, it doesn't decay to T* automatically. As an aggregate type, it can be initialized with aggregate-initialization given at most N initializers that ar

std::random_shuffle

Defined in header <algorithm> template< class RandomIt > void random_shuffle( RandomIt first, RandomIt last ); (1) (until C++17)(deprecated in C++14) (2) template< class RandomIt, class RandomFunc > void random_shuffle( RandomIt first, RandomIt last, RandomFunc& r ); (until C++11) template< class RandomIt, class RandomFunc > void random_shuffle( RandomIt first, RandomIt last, RandomFunc&& r ); (since C++11) (until C++17)(deprecated in

std::realloc

Defined in header <cstdlib> void* realloc( void* ptr, std::size_t new_size ); Reallocates the given area of memory. It must be previously allocated by std::malloc(), std::calloc() or std::realloc() and not yet freed with std::free(), otherwise, the results are undefined. The reallocation is done by either: a) expanding or contracting the existing area pointed to by ptr, if possible. The contents of the area remain unchanged up to the lesser of the new and old sizes. If the

std::alignment_of

Defined in header <type_traits> template< class T > struct alignment_of; (since C++11) Provides the member constant value equal to the alignment requirement of the type T, as if obtained by an alignof expression. If T is an array type, returns the alignment requirements of the element type. If T is a reference type, returns the alignment requirements of the type referred to. If alignof(T) is not a valid expression, the behavior is undefined. Helper variable templat

std::erfc

Defined in header <cmath> float erfc( float arg ); (1) (since C++11) double erfc( double arg ); (2) (since C++11) long double erfc( long double arg ); (3) (since C++11) double erfc( Integral arg ); (4) (since C++11) 1-3) Computes the complementary error function of arg, that is 1.0-erf(arg), but without loss of precision for large arg 4) A set of overloads or a function template accepting an argument of any integral type. Equivalent to 2

std::is_arithmetic

Defined in header <type_traits> template< class T > struct is_arithmetic; (since C++11) If T is an arithmetic type (that is, an integral type or a floating-point 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_arithmetic_v = is_arithmetic<T>::value; (since C++17) Inherited from std::inte

std::unordered_multiset::erase

iterator erase( const_iterator pos ); (1) (since C++11) iterator erase( const_iterator first, const_iterator last ); (2) (since C++11) size_type erase( const key_type& key ); (3) (since C++11) Removes specified elements from the container. 1) Removes the element at pos. 2) Removes the elements in the range [first; last), which must be a valid range in *this. 3) Removes all elements with the key equivalent to key. References and iterators to the erased elements are inv

sstream

This header is part of the Input/Output library. Classes basic_stringbuf implements raw string device (class template) basic_istringstream implements high-level string stream input operations (class template) basic_ostringstream implements high-level string stream output operations (class template) basic_stringstream implements high-level string stream input/output operations (class template) Typedefs stringbuf basic_stringbuf<char> wstringbuf basic_str