std::numpunct

Defined in header <locale> template< class CharT > class numpunct; The facet std::numpunct encapsulates numeric punctuation preferences. Stream I/O operations use std::numpunct through std::num_get and std::num_put for parsing numeric input and formatting numeric output. The numbers that are supported by std::numpunct have the format described below. Here digit represents the radix set specified by the fmtflags argument value, thousands-sep and decimal-point are the r

enumeration declaration

An enumeration is a distinct type whose value is restricted to one of several explicitly named constants ("enumerators"). The values of the constants are values of an integral type known as the underlying type of the enumeration. An enumeration is defined by enum-specifier, which appears in decl-specifier-seq of the declaration syntax. The enum-specifier has the following syntax: enum-key attr(optional) identifier(optional) enum-base(optional) { enumerator-list(optional) } (1) enum-key

std::qsort

Defined in header <cstdlib> extern "C" void qsort( void *ptr, std::size_t count, std::size_t size, int (*comp)(const void *, const void *) ); extern "C++" void qsort( void *ptr, std::size_t count, std::size_t size, int (*comp)(const void *, const void *) ); Sorts the given array pointed to by ptr in ascending order. The array contains count elements of size bytes. Function pointed to by comp is used for object comparison. If comp indicates two

std::exp2

Defined in header <cmath> double exp2( double n ); (1) (since C++11) float exp2( float n ); (2) (since C++11) long double exp2( long double n ); (3) (since C++11) double exp2( Integral n ); (4) (since C++11) 1-3) Computes 2 raised to the given power n 4) A set of overloads or a function template accepting an argument of any integral type. Equivalent to 2) (the argument is cast to double). Parameters n - value of floating-point or

std::min_element

Defined in header <algorithm> (1) template< class ForwardIt > ForwardIt min_element( ForwardIt first, ForwardIt last ); (until C++17) template< class ForwardIt > constexpr ForwardIt min_element( ForwardIt first, ForwardIt last ); (since C++17) (2) template< class ForwardIt, class Compare > ForwardIt min_element( ForwardIt first, ForwardIt last, Compare comp ); (until C++17) template< class ForwardIt, class Compare > constexpr ForwardIt

std::set_intersection

Defined in header <algorithm> template< class InputIt1, class InputIt2, class OutputIt > OutputIt set_intersection( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first ); (1) template< class InputIt1, class InputIt2, class OutputIt, class Compare > OutputIt set_intersection( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2,

std::sort

Defined in header <algorithm> template< class RandomIt > void sort( RandomIt first, RandomIt last ); (1) template< class RandomIt, class Compare > void sort( RandomIt first, RandomIt last, Compare comp ); (2) Sorts the elements in the range [first, last) in ascending order. The order of equal elements is not guaranteed to be preserved. The first version uses operator< to compare the elements, the second version uses the given comparison function object

Input/output library

C++ includes two input/output libraries: a modern, stream-based I/O library and the standard set of C-style I/O functions. Stream-based I/O The stream-based input/output library is organized around abstract input/output devices. These abstract devices allow the same code to handle input/output to files, memory streams, or custom adaptor devices that perform arbitrary operations (e.g. compression) on the fly. Most of the classes are templated, so they can be adapted to any basic character typ

std::independent_bits_engine::seed

void seed(); (1) (since C++11) void seed( result_type value ); (2) (since C++11) template< class Sseq > void seed( Sseq& seq ); (3) (since C++11) Reinitializes the internal state of the underlying engine using a new seed value. 1) Seeds the underlying engine with the default seed value. Effectively calls e.seed(), where e is the underlying engine. 2) Seeds the underlying engine with the seed value s. Effectively calls e.seed(value), where e is the underlying eng

std::list::rend

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