static constexpr result_type max(); (since C++11) Returns the maximum value potentially generated by the random-number engine. This value is equal to 2w - 1, where w is word_size. Parameters (none). Return value The maximum potentially generated value. Complexity Constant. See also min [static] gets the smallest possible value in the output range (public static member function)

Defined in header <memory> void declare_reachable( void* p ); (since C++11) Declares the object referenced by the pointer p reachable. Reachable objects will not be deleted by the garbage collector or considered to be a leak by a leak detector even if all pointers to it are destroyed. An object may be declared reachable multiple times, in which case multiple calls to std::undeclare_reachable would be needed to remove this property. For example, a XOR linked list needs to de

void reset(); (since C++11) Resets the internal state of the distribution object. After a call to this function, the next call to operator() on the distribution object will not be dependent on previous calls to operator(). Parameters (none). Return value (none). Complexity Constant.

const std::error_code& code() const; (since C++11) Returns the stored error code. Parameters (none). Return value The stored error code. Exceptions noexcept specification: noexcept See also what [virtual] returns explanatory string (virtual public member function)

The TimedMutex concept extends the TimedLockable concept to include inter-thread synchronization. Requirements TimedLockable Mutex Additionally, for object m of TimedMutex type. The expression m.try_lock_for(duration) has the following properties Behaves as an atomic operation. Attempts to obtain exclusive ownership of the mutex within the duration specified by duration. If duration is less or equal duration.zero(), attempts to obtain the ownership without locking (as if by try_loc

Defined in header <thread> void yield(); (since C++11) Provides a hint to the implementation to reschedule the execution of threads, allowing other threads to run. Parameters (none). Return value (none). Notes The exact behavior of this function depends on the implementation, in particular on the mechanics of the OS scheduler in use and the state of the system. For example, a first-in-first-out realtime scheduler (SCHED_FIFO in Linux) would suspend the current thre

result_type max() const; (since C++11) Returns the maximum value potentially generated by the distribution. Parameters (none). Return value The maximum value potentially generated by the distribution. Complexity Constant. See also min returns the minimum potentially generated value (public member function)

template< class T, class Deleter > void swap( unique_ptr<T,Deleter>& lhs, unique_ptr<T,Deleter>& rhs ); (since C++11) Specializes the std::swap algorithm for std::unique_ptr. Swaps the pointers of lhs and rhs. Calls lhs.swap(rhs). Parameters lhs, rhs - smart pointers whose contents to swap Return value (none). Exceptions noexcept specification: noexcept Complexity Constant. See also swap swaps the values of two objects (function tem

void rehash( size_type count ); (since C++11) Sets the number of buckets to count and rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed. If the new number of buckets makes load factor more than maximum load factor (count < size() / max_load_factor()), then the new number of buckets is at least size() / max_load_factor(). Parameters count - new number of buckets Return value (none). Complexity

Defined in header <cwchar> unsigned long wcstoul( const wchar_t* str, wchar_t** str_end, int base ); unsigned long long wcstoull( const wchar_t* str, wchar_t** str_end, int base ); (since C++11) Interprets an unsigned integer value in a wide string pointed to by str. Discards any whitespace characters (as identified by calling isspace()) until the first non-whitespace character is found, then takes as many characters as possible to form a valid base-n (where n=ba