Defined in header <type_traits> template< class T > struct is_array; (since C++11) Checks whether T is an array type. Provides the member constant value which is equal to true, if T is an array type. Otherwise, value is equal to false. Template parameters T - a type to check Helper variable template template< class T > constexpr bool is_array_v = is_array<T>::value; (since C++17) Inherited from std::integral_constant Member con

(1) public: iter_type get( iter_type in, iter_type end, std::ios_base& str, std::ios_base::iostate& err, bool& v ) const; iter_type get( iter_type in, iter_type end, std::ios_base& str, std::ios_base::iostate& err, long& v ) const; iter_type get( iter_type in, iter_type end, std::ios_base& str, std::ios_base::iostate& err, long long& v ) const; iter_type get( iter_type in, iter_type end, std::i

Defined in header <random> template< class RealType = double > class extreme_value_distribution; (since C++11) Produces random numbers according to the extreme value distribution (it is also known as Gumbel Type I, log-Weibull, Fisher-Tippett Type I): p(x;a,b) = 1b exp⎛⎜⎝ a-xb - exp⎛⎜⎝ a-xb ⎞⎟⎠⎞⎟⎠ std::extreme_value_distribution satisfies all requirements of RandomNumberDistribution. Template parameters RealType - The result type generated by the gene

Argument-dependent lookup, also known as ADL, or Koenig lookup, is the set of rules for looking up the unqualified function names in function-call expressions, including implicit function calls to overloaded operators. These function names are looked up in the namespaces of their arguments in addition to the scopes and namespaces considered by the usual unqualified name lookup. Argument-dependent lookup makes it possible to use operators defined in a different namespace. #include <iostream&

Defined in header <algorithm> template< class InputIt1, class InputIt2 > bool equal( InputIt1 first1, InputIt1 last1, InputIt2 first2 ); (1) template< class InputIt1, class InputIt2, class BinaryPredicate > bool equal( InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p ); (2) template< class InputIt1, class InputIt2 > bool equal( InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2 );

Usage switch statement: as the declaration of the default case label explicitly-defaulted function definition: as an explicit instruction to the compiler to generate special member function for a class. (since C++11)

Defined in header <unordered_set> template< class Key, class Hash = std::hash<Key>, class KeyEqual = std::equal_to<Key>, class Allocator = std::allocator<Key> > class unordered_multiset; (since C++11) Unordered multiset is an associative container that contains set of possibly non-unique objects of type Key. Search, insertion, and removal have average constant-time complexity. Internally, the elements are not sorted in any particular

template< class Clock, class Duration > bool try_lock_until( const std::chrono::time_point<Clock,Duration>& timeout_time ); (since C++11) Tries to lock the mutex. Blocks until specified timeout_time has been reached or the lock is acquired, whichever comes first. On successful lock acquisition returns true, otherwise returns false. If timeout_time has already passed, this function behaves like try_lock(). The clock tied to timeout_time is used, which means that adjustmen

void notify_one(); (since C++11) If any threads are waiting on *this, calling notify_one unblocks one of the waiting threads. Parameters (none). Return value (none). Exceptions noexcept specification: noexcept Notes The effects of notify_one()/notify_all() and wait()/wait_for()/wait_until() take place in a single total order, so it's impossible for notify_one() to, for example, be delayed and unblock a thread that started waiting just after the call to notify_one() was mad

std::size_t size() const; (since C++11) Returns the size of the stored initial seed sequence. Parameters (none). Return value The size of the private container that was populated at construction time. Complexity Constant time. Exeptions (none) (until C++17) noexcept specification: noexcept (since C++17) Example #include <random> #include <iostream> int main() { std::seed_seq s1 = {-1, 0, 1}; std::cout << s1.size() << '\n'; } Output: 3