void swap( queue& other ); (since C++11) Exchanges the contents of the container adaptor with those of other. Effectively calls using std::swap; swap(c, other.c); Parameters other - container adaptor to exchange the contents with Return value (none). Exceptions noexcept specification: noexcept(noexcept(std::swap(c, other.c))) Complexity Same as underlying container (typically constant). See also std::swap(std::queue) specializes the std::swap algorithm (

Defined in header <typeinfo> class bad_typeid : public std::exception; An exception of this type is thrown when a typeid operator is applied to a dereferenced null pointer value of a polymorphic type. Inheritance diagram. Member functions (constructor) constructs a new bad_typeid object (public member function) Inherited from std::exception Member functions (destructor) [virtual] destructs the exception object (virtual public member function of

reference operator[]( size_type pos ); const_reference operator[]( size_type pos ) const; Returns a reference to the element at specified location pos. No bounds checking is performed. Parameters pos - position of the element to return Return value Reference to the requested element. Complexity Constant. Notes Unlike std::map::operator[], this operator never inserts a new element into the container. Example The following code uses operator[] to read f

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

explicit lognormal_distribution( RealType m = 0.0, RealType s = 1.0 ); (1) (since C++11) explicit lognormal_distribution( const param_type& params ); (2) (since C++11) Constructs a new distribution object. The first version uses m and s as the distribution parameters, the second version uses params as the distribution parameters. Parameters m - the m distribution parameter (log-scale) s - the s distribution parameter (shape) params - the distribution parame

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

Defined in header <algorithm> template< class ForwardIt, class OutputIt > OutputIt rotate_copy( ForwardIt first, ForwardIt n_first, ForwardIt last, OutputIt d_first ); Copies the elements from the range [first, last), to another range beginning at d_first in such a way, that the element n_first becomes the first element of the new range and n_first - 1 becomes the last element. Parameters first, last - the range of elements to copy n_fi

(1) explicit unordered_set( size_type bucket_count = /*implementation-defined*/, const Hash& hash = Hash(), const KeyEqual& equal = KeyEqual(), const Allocator& alloc = Allocator() ); (since C++11) (until C++14) unordered_set() : unordered_set( size_type(/*implementation-defined*/) {} explicit unordered_set( size_type bucket_count, const Hash& hash = Hash(),

Defined in header <type_traits> template< class T > struct has_virtual_destructor; (since C++11) If T is a type with a virtual destructor, provides the member constant value equal true. For any other type, value is false. If T is a non-union class type, T shall be a complete type; otherwise, the behavior is undefined. Helper variable template template< class T > constexpr bool has_virtual_destructor_v = has_virtual_destructor<T>::value; (since C+

Usage thread local storage duration specifier (since C++11)