std::front_inserter

Defined in header <iterator> template< class Container > std::front_insert_iterator<Container> front_inserter( Container& c ); front_inserter is a convenience function template that constructs a std::front_insert_iterator for the container c with the type deduced from the type of the argument. Parameters c - container that supports a push_front operation Return value A std::front_insert_iterator which can be used to add elements to the beginnin

std::basic_ios::copyfmt

basic_ios& copyfmt(const basic_ios& other); Copies the state of the stream other into *this. This is done in the following sequence: 1) Calls every callback registered by register_callback() passing erase_event as parameter 2) Copies all member objects from other to *this except for rdstate(), the exception mask, and rdbuf(). In particular, makes copies of the locale, the formatting flags, the contents of the arrays std::ios_base::iword and std::ios_base::pword (but not the iw

std::pointer_to_binary_function

template< class Arg1, class Arg2, class Result > class pointer_to_binary_function : public std::binary_function<Arg1, Arg2, Result>; (until C++17)(deprecated since C++11) std::pointer_to_binary_function is a function object that acts as a wrapper around a binary function. Member functions (constructor) constructs a new pointer_to_binary_function object with the supplied function (public member function) operator() calls the stored function (public me

std::get_terminate

Defined in header <exception> std::terminate_handler get_terminate(); (since C++11) Returns the currently installed std::terminate_handler, which may be a null pointer. This function is thread-safe. Prior call to std::set_terminate synchronizes-with (see std::memory_order) this function. (since C++11) Parameters (none). Return value The currently installed std::terminate_handler. Exceptions noexcept specification: noexcept See also terminate_handler th

std::is_const

Defined in header <type_traits> template< class T > struct is_const; (since C++11) If T is a const-qualified type (that is, const, or const volatile), 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_const_v = is_const<T>::value; (since C++17) Inherited from std::integral_constant Member const

std::transform

Defined in header <algorithm> template< class InputIt, class OutputIt, class UnaryOperation > OutputIt transform( InputIt first1, InputIt last1, OutputIt d_first, UnaryOperation unary_op ); (1) template< class InputIt1, class InputIt2, class OutputIt, class BinaryOperation > OutputIt transform( InputIt1 first1, InputIt1 last1, InputIt2 first2, OutputIt d_first, BinaryOperation binary_op ); (2) std::transform applies

std::isfinite

Defined in header <cmath> bool isfinite( float arg ); (1) (since C++11) bool isfinite( double arg ); (2) (since C++11) bool isfinite( long double arg ); (3) (since C++11) bool isfinite( Integral arg ); (4) (since C++11) 1-3) Determines if the given floating point number arg has finite value i.e. it is normal, subnormal or zero, but not infinite or NaN. 4) A set of overloads or a function template accepting the from argument of any integral type. Equivale

std::unordered_set::equal_range

std::pair<iterator,iterator> equal_range( const Key& key ); (since C++11) std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const; (since C++11) Returns a range containing all elements with key key in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range. Parameters key - key value to compare the elements to Re

std::copy_backward

Defined in header <algorithm> template< class BidirIt1, class BidirIt2 > BidirIt2 copy_backward( BidirIt1 first, BidirIt1 last, BidirIt2 d_last ); Copies the elements from the range, defined by [first, last), to another range ending at d_last. The elements are copied in reverse order (the last element is copied first), but their relative order is preserved. The behavior is undefined if d_last is within (first, last]. std::copy must be used instead of std::copy_backwar

std::srand

Defined in header <cstdlib> void srand( unsigned seed ); Seeds the pseudo-random number generator used by std::rand() with the value seed. If rand() is used before any calls to srand(), rand() behaves as if it was seeded with srand(1). Each time rand() is seeded with srand(), it must produce the same sequence of values. srand() is not guaranteed to be thread-safe. Parameters seed - the seed value Return value (none). Notes Generally speaking, the pseudo-ran