void seed(); (1) (since C++11) void seed( result_type value ); (2) (since C++11) template< class Sseq > void seed( Sseq& seq ); (3) (since C++11) Reinitializes the internal state of the underlying engine using a new seed value. 1) Seeds the underlying engine with the default seed value. Effectively calls e.seed(), where e is the underlying engine. 2) Seeds the underlying engine with the seed value s. Effectively calls e.seed(value), where e is the underlying eng

id(); (since C++11) Default-constructs a new thread identifier. The identifier does not represent a thread. Parameters (none). Exceptions noexcept specification: noexcept

int value() const; (since C++11) Returns the platform dependent error value. Parameters (none). Return value The platform-dependent error value. Exceptions noexcept specification: noexcept See also category obtains the error_category for this error_code (public member function)

The iterator library provides definitions for five kinds of iterators as well as iterator traits, adapters, and utility functions. Iterator categories There are five (until C++17)six (since C++17) kinds of iterators: InputIterator, OutputIterator, ForwardIterator, BidirectionalIterator, RandomAccessIterator, and ContiguousIterator (since C++17). Instead of being defined by specific types, each category of iterator is defined by the operations that can be performed on it. This definition mean

Defined in header <memory> struct allocator_arg_t {}; (since C++11) std::allocator_arg_t is an empty class type used to disambiguate the overloads of constructors and member functions of allocator-aware objects, including std::tuple, std::function, std::promise, and std::packaged_task. See also allocator_arg (C++11) an object of type std::allocator_arg_t used to select allocator-aware constructors (constant) uses_allocator (C++11) checks if the specified typ

local_iterator begin( size_type n ); (since C++11) const_local_iterator begin( size_type n ) const; (since C++11) const_local_iterator cbegin( size_type n ) const; (since C++11) Returns an iterator to the first element of the bucket with index pos. Parameters n - the index of the bucket to access Return value Iterator to the first element. Complexity Constant. See also end(int) cend(int) returns an iterator to the end of the specified bucket (public m

Defined in header <tuple> template< class... TTypes, class... UTypes > bool operator==( const tuple<TTypes...>& lhs, const tuple<UTypes...>& rhs ); (1) (since C++11) (until C++14) template< class... TTypes, class... UTypes > constexpr bool operator==( const tuple<TTypes...>& lhs, const tuple<UTypes...>& rhs ); (1) (since C++14) template< class... TTypes, class... UTypes

Defined in header <algorithm> template< class ForwardIt, class T > ForwardIt lower_bound( ForwardIt first, ForwardIt last, const T& value ); (1) template< class ForwardIt, class T, class Compare > ForwardIt lower_bound( ForwardIt first, ForwardIt last, const T& value, Compare comp ); (2) Returns an iterator pointing to the first element in the range [first, last) that is not less than (i.e. greater or equal to) value. The range [first, last) must b

template< class T, class Alloc > void swap( forward_list<T,Alloc>& lhs, forward_list<T,Alloc>& rhs ); (since C++11) Specializes the std::swap algorithm for std::forward_list. Swaps the contents of lhs and rhs. Calls lhs.swap(rhs). Parameters lhs, rhs - containers whose contents to swap Return value (none). Complexity Constant. Exceptions noexcept specification: noexcept(noexcept(lhs.swap(rhs))) (since C++17) See also sw

This is a list of reserved keywords in C++. Since they are used by the language, these keywords are not available for re-definition or overloading. alignas (since C++11)alignof (since C++11)andand_eqasmauto(1)bitandbitorboolbreakcasecatchcharchar16_t (since C++11)char32_t (since C++11)classcomplconcept (concepts TS)constconstexpr (since C++11)const_castcontinuedecltype (since C++11)default(1)delete(1)dodoubledynamic_cast. elseenumexplicitexport(1)externfalsefloatforfriendgotoifinlineintlongm