template< class CharT, class Traits, class Engine, size_t w, class UIntType > std::basic_ostream<CharT,Traits>& operator<<( std::basic_ostream<CharT,Traits>& ost, const std::independent_bits_engine<Engine,w,UIntType>& e ); (1) (since C++11) template< class CharT, class Traits, class Engine, size_t w, class UIntType > std::basic_istream<CharT,Traits>& operator>>( std::basic_istre

size_type max_bucket_count() const; (since C++11) Returns the maximum number of buckets the container is able to hold due to system or library implementation limitations. Parameters (none). Return value Maximum number of buckets. Complexity Constant. See also bucket_count returns the number of buckets (public member function)

Defined in header <functional> template< class T > struct less_equal; (until C++14) template< class T = void > struct less_equal; (since C++14) Function object for performing comparisons. Unless specialized, invokes operator<= on type T. Specializations The partial specialization of std::less_equal for any pointer type yields a total order, even if the built-in operator<= does not. The standard library provides a specialization of std::less_equa

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)

static constexpr result_type min(); (since C++11) Returns the minimum value potentially generated by the random-number engine. This value is equal to 1u if increment is 0u, and is equal to 0u otherwise. 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 random-number engine. This value is one less than modulus. 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)

explicit linear_congruential_engine( result_type value = default_seed ); (1) (since C++11) template< class Sseq > explicit linear_congruential_engine( Sseq& s ); (2) (since C++11) linear_congruential_engine( const linear_congruential_engine& ); (3) (since C++11) (implicitly declared) Constructs the pseudo-random number engine. The overload (2) only participate in overload resolution if Sseq qualifies as a SeedSequence. In particular, it is excluded from the se

size_type bucket( const Key& key ) const; (since C++11) Returns the index of the bucket for key key. Elements (if any) with keys equivalent to key are always found in this bucket. The returned value is valid only for instances of the container for which bucket_count() returns the same value. The behavior is undefined if bucket_count() is zero. Parameters key - the value of the key to examine Return value Bucket index for the key key. Complexity Constant. See also

Defined in header <algorithm> template< class ForwardIt, class Generator > void generate( ForwardIt first, ForwardIt last, Generator g ); Assigns each element in range [first, last) a value generated by the given function object g. Parameters first, last - the range of elements to generate g - generator function object that will be called. The signature of the function should be equivalent to the following: Ret fun(); The type Ret must be such that

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)