mask_array( const mask_array& other ); mask_array() = delete; Constructs a mask_array from another mask_array other. The default constructor is implicitly deleted. Parameters other - mask_array to initialize with

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... Args > iterator emplace( Args&&... args ); (since C++11) Inserts a new element into the container by constructing it in-place with the given args . Careful use of emplace allows the new element to be constructed while avoiding unnecessary copy or move operations. The constructor of the new element is called with exactly the same arguments as supplied to emplace, forwarded via std::forward<Args>(args).... If rehashing occurs due to the insertion, al

bool test( size_t pos ) const; Returns the value of the bit at the position pos. Unlike operator[], performs a bounds check and throws std::out_of_range if pos does not correspond to a valid position in the bitset. Parameters pos - position of the bit to return Return value true if the requested bit is set, false otherwise. Exceptions std::out_of_range if pos does not correspond to a valid position within the bitset. Example #include <iostream> #include <b

Defined in header <type_traits> template< class T > struct is_class; (since C++11) Checks whether T is a class or struct type. Provides the member constant value which is equal to true, if T is an class or struct type (but not union). Otherwise, value is equal to false. Template parameters T - a type to check Helper variable template template< class T > constexpr bool is_class_v = is_class<T>::value; (since C++17) Inherited from

size_type size() const; (since C++11) (until C++14) constexpr size_type size() const; (since C++14) Returns the number of elements in the initializer list, i.e. std::distance(begin(), end()). Parameters (none). Return value the number of elements in the initializer list. Exceptions noexcept specification: noexcept Complexity Constant.

independent_bits_engine(); (1) (since C++11) explicit independent_bits_engine( result_type s ); (2) (since C++11) template< class Sseq > explicit independent_bits_engine( Sseq& seq ); (3) (since C++11) explicit independent_bits_engine( const Engine& e ); (4) (since C++11) explicit independent_bits_engine( Engine&& e ); (5) (since C++11) Constructs new pseudo-random engine adaptor. 1) Default constructor. The underlying engine is also defaul

static constexpr result_type max(); (since C++11) Returns the maximum value potentially generated by the engine adaptor. This value is equal to 2w-1. 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 <thread> template<> struct hash<std::thread::id>; (since C++11) The template specialization of std::hash for the std::thread::id class allows users to obtain hashes of the identifiers of threads. Example #include <iostream> #include <thread> #include <chrono> #include <vector> using namespace std::literals::chrono_literals; void foo() { std::this_thread::sleep_for(10ms); } int main() { std::vector<std::

void swap( vector& other ); Exchanges the contents of the container with those of other. Does not invoke any move, copy, or swap operations on individual elements. All iterators and references remain valid. The past-the-end iterator is invalidated. If std::allocator_traits<allocator_type>::propagate_on_container_swap::value is true, then the allocators are exchanged using an unqualified call to non-member swap. Otherwise, they are not swapped (and if get_allocator() != other.