void wait() const; (since C++11) Blocks until the result becomes available. valid() == true after the call. The behavior is undefined if valid()== false before the call to this function. Parameters (none). Return value (none). Exceptions (none). Notes The implementations are encouraged to detect the case when valid == false before the call and throw a std::future_error with an error condition of std::future_errc::no_state. Calling wait on the same std::shared_future from mul

Defined in header <cmath> float atan2( float y, float x ); (1) double atan2( double y, double x ); (2) long double atan2( long double y, long double x ); (3) Promoted atan2( Arithmetic1 y, Arithmetic2 x ); (4) (since C++11) Computes the arc tangent of y/x using the signs of arguments to determine the correct quadrant. 4) A set of overloads or a function template for all combinations of arguments of arithmetic type not covered by 1-3). If any

Defined in header <type_traits> template< class T, unsigned N = 0> struct extent; (since C++11) If T is an array type, provides the member constant value equal to the number of elements along the Nth dimension of the array, if N is in [0, std::rank<T>::value). For any other type, or if T is array of unknown bound along its first dimension and N is 0, value is 0. Helper variable template template< class T, unsigned N = 0 > constexpr std::size_t extent

Defined in header <type_traits> template< class T > struct is_move_assignable; (1) (since C++11) template< class T > struct is_trivially_move_assignable; (2) (since C++11) template< class T > struct is_nothrow_move_assignable; (3) (since C++11) 1) If T is not a referenceable type (i.e., possibly cv-qualified void or a function type with a cv-qualifier-seq or a ref-qualifier), provides a member constant value equal to false. Otherwise, provides

Defined in header <type_traits> template< class T > struct is_trivially_copyable; (since C++11) If T is a TriviallyCopyable type, provides the member constant value equal true. For any other type, value is false. The only trivially copyable types are scalar types, trivially copyable classes, and arrays of such types/classes (possibly const-qualified, but not volatile-qualified). A trivially copyable class is a class that. Has no non-trivial copy constructors (this al

Defined in header <cstring> int strcoll( const char* lhs, const char* rhs ); Compares two null-terminated byte strings according to the current locale as defined by the LC_COLLATE category. Parameters lhs, rhs - pointers to the null-terminated byte 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 Collation order is the dictionary order: t

Defined in header <cmath> float rint( float arg ); (1) (since C++11) double rint( double arg ); (2) (since C++11) long double rint( long double arg ); (3) (since C++11) double rint( Integral arg ); (4) (since C++11) long lrint( float arg ); (5) (since C++11) long lrint( double arg ); (6) (since C++11) long lrint( long double arg ); (7) (since C++11) long lrint( Integral arg ); (8) (since C++11) long long llrint( float arg ); (9)

void assign( size_type count, const T& value ); (1) template< class InputIt > void assign( InputIt first, InputIt last ); (2) void assign( std::initializer_list<T> ilist ); (3) (since C++11) Replaces the contents of the container. 1) Replaces the contents with count copies of value value 2) Replaces the contents with copies of those in the range [first, last). This overload has the same effect as overload (1) if InputIt is an integral type. (until C++11) T

Defined in header <iomanip> template< class CharT > /*unspecified*/ quoted(const CharT* s, CharT delim=CharT('"'), CharT escape=CharT('\\')); (1) (since C++14) template< class CharT, class Traits, class Allocator > /*unspecified*/ quoted(const std::basic_string<CharT, Traits, Allocator>& s, CharT delim=CharT('"'), CharT escape=CharT('\\')); (2) (since C++14) template< class CharT, class Traits, clas

std::pair<iterator,iterator> equal_range( const Key& key ); (1) std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const; (2) template< class K > std::pair<iterator,iterator> equal_range( const K& x ); (3) (since C++14) template< class K > std::pair<const_iterator,const_iterator> equal_range( const K& x ) const; (4) (since C++14) Returns a range containing all elements with the given key in the con