static constexpr result_type min(); (since C++11) Returns the minimum value potentially generated by the engine adaptor. This value is equal to e.min() where e is the underlying engine. Parameters (none). Return value The minimum potentially generated value. Complexity Constant. See also max [static] gets the largest possible value in the output range (public static member function)

static constexpr result_type max(); (since C++11) Returns the maximum value potentially generated by the engine adaptor. This value is equal to e.max() where e is the underlying engine. 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)

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

void discard( unsigned long long z ); (since C++11) Advances the internal state by z times. Equivalent to calling operator() z times and discarding the result. The state of the underlying engine may be advanced by more than z times. Parameters z - integer value specifying the number of times to advance the state by Return value (none). Exceptions (none). See also operator() advances the state of the underlying engine and returns the generated value (public membe

const Engine& base() const; (since C++11) Returns the underlying engine. Parameters (none). Return value The underlying engine. Exceptions noexcept specification: noexcept

Defined in header <random> template< class Engine, size_t P, size_t R > class discard_block_engine; (since C++11) discard_block_engine is a pseudo-random number generator adapter that discards a certain amount of data produced by the base engine. From each block of size P generated by the base engine, the adaptor keeps only R numbers, discarding the rest. Template parameters Engine - the type of the wrapped engine P - the size of a block. Must b

Defined in header <ctime> double difftime( std::time_t time_end, std::time_t time_beg ); Computes difference between two calendar times as std::time_t objects (time_end - time_beg) in seconds. If time_end refers to time point before time_beg then the result is negative. Parameters time_beg, time_end - times to compare Return value Difference between two times in seconds. Notes On POSIX systems, std::time_t is measured in seconds, and difftime is equivalent

void swap( deque& 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.g

size_type size() const; Returns the number of elements in the container, i.e. std::distance(begin(), end()). Parameters (none). Return value The number of elements in the container. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. Example The following code uses size to display the number of elements in a std::deque: #include <deque> #include <iostream> int main() { std::deque<int> nums {1, 3

void shrink_to_fit(); (since C++11) Requests the removal of unused capacity. It is a non-binding request to reduce capacity to size(). It depends on the implementation if the request is fulfilled. All iterators and references are potentially invalidated. Past-the-end iterator is also potentially invalidated. Parameters (none). Type requirements - T must meet the requirements of MoveInsertable. Return value (none). Complexity At most linear in the size of the container.