Defined in header <functional> template< class T > struct is_bind_expression; (since C++11) If T is the type produced by a call to std::bind, this template is derived from std::true_type. For any other type, this template is derived from std::false_type. This template may be specialized for a user-defined type T to implement UnaryTypeTrait with BaseCharacteristic of std::true_type to indicate that T should be treated by std::bind as if it were the type of a bind subex

void fill( const T& value ); (since {std}) Assigns the given value value to all elements in the container. Parameters value - the value to assign to the elements Return value (none). Complexity Linear in the size of the container.

Defined in header <random> template< class Engine, std::size_t W, class UIntType > class independent_bits_engine; (since C++11) independent_bits_engine is a random number engine adaptor that produces random numbers with different number of bits than that of the wrapped engine. Template parameters Engine - the type of the wrapped engine W - the number of bits the generated numbers should have UIntType - the type of the generated random

protected: virtual int_type pbackfail( int_type c = Traits::eof() ) This protected virtual function is called by the public functions basic_streambuf::sungetc and basic_streambuf::sputbackc (which, in turn, are called by basic_istream::unget and basic_istream::putback). 1) The caller is requesting that the get area is backed up by one character (pbackfail() is called with no arguments or with Traits::eof() as the argument) a) First, checks if there is a putback position, and if there

Defined in header <algorithm> template< class BidirIt, class UnaryPredicate > BidirIt partition( BidirIt first, BidirIt last, UnaryPredicate p ); (until C++11) template< class ForwardIt, class UnaryPredicate > ForwardIt partition( ForwardIt first, ForwardIt last, UnaryPredicate p ); (since C++11) Reorders the elements in the range [first, last) in such a way that all elements for which the predicate p returns true precede the elements for which predicate p

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

Defined in header <set> template< class Key, class Compare = std::less<Key>, class Allocator = std::allocator<Key> > class multiset; Multiset is an associative container that contains a sorted set of objects of type Key. Unlike set, multiple keys with equivalent values are allowed. Sorting is done using the key comparison function Compare. Search, insertion, and removal operations have logarithmic complexity. Everywhere the standard library use

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

Defined in header <atomic> (1) (since C++11) template< class Integral > Integral atomic_fetch_xor( std::atomic<Integral>* obj, Integral arg ); template< class Integral > Integral atomic_fetch_xor( volatile std::atomic<Integral>* obj, Integral arg ); (2) (since C++11) template< class Integral > Integral atomic_fetch_xor_explicit( std::atomic<Integral>* obj, Integral arg, std::memory_order order

A qualified name is a name that appears on the right hand side of the scope resolution operator :: (see also qualified identifiers). A qualified name may refer to a. class member (including static and non-static functions, types, templates, etc) namespace member (including another namespace) enumerator If there is nothing on the left hand side of the ::, the lookup considers only declarations made in the global namespace scope (or introduced into the global namespace by a using declarat