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

Defined in header <type_traits> template< class T, class... Args > struct is_constructible; (1) (since C++11) template< class T, class... Args > struct is_trivially_constructible; (2) (since C++11) template< class T, class... Args > struct is_nothrow_constructible; (3) (since C++11) 1) If the variable definition T obj(std::declval<Args>()...); is well-formed, provides the member constant value equal true. Otherwise, value is false. For th

hasher hash_function() const; (since C++11) Returns the function that hashes the keys. Parameters (none). Return value The hash function. Complexity Constant. See also key_eq returns the function used to compare keys for equality (public member function)

Defined in header <cstdlib> extern "C" void* bsearch( const void* key, const void* ptr, std::size_t count, std::size_t size, int (*comp)(const void*, const void*) ); extern "C++" void* bsearch( const void* key, const void* ptr, std::size_t count, std::size_t size, int (*comp)(const void*, const void*) ); Finds an element equal to element pointed to by key in an array pointed to by ptr. The array contains count elements of size bytes each

void merge( forward_list& other ); (1) (since C++11) void merge( forward_list&& other ); (1) (since C++11) template <class Compare> void merge( forward_list& other, Compare comp ); (2) (since C++11) template <class Compare> void merge( forward_list&& other, Compare comp ); (2) (since C++11) Merges two sorted lists into one. The lists should be sorted into ascending order. No elements are copied. The container other becomes empty af

Defined in header <cwchar> int wcscoll( const wchar_t* lhs, const wchar_t* rhs ); Compares two null-terminated wide strings according to the locale most recently installed by std::setlocale, as defined by the LC_COLLATE category. Parameters lhs, rhs - pointers to the null-terminated wide strings to compare Return value Negative value if lhs is less than (precedes) rhs. ​0​ if lhs is equal to rhs. Positive value if lhs is greater than (follows) rhs. Notes Co

Defined in header <random> template< class Engine, std::size_t K > class shuffle_order_engine; (since C++11) shuffle_order_engine is a random number engine adaptor that shuffles the random numbers generated by the base engine. It maintains a table of size K and delivers a randomly selected number from that table when requested, replacing it with a number generated by the base engine. The following typedef defines the random number engine with one commonly use

move_iterator(); (1) explicit move_iterator( Iterator x ); (2) template< class U > move_iterator( const move_iterator<U>& other ); (3) Constructs a new iterator adaptor. 1) Default constructor. current is value-initialized. Operations on the resulting iterator have defined behavior if and only if the corresponding operations on a value-initialized Iterator also have defined behavior. 2) current is initialized with x. 3) Copy constructor. The underlying it