operators (std::pair)

Defined in header <utility> template< class T1, class T2 > bool operator==( const pair<T1,T2>& lhs, const pair<T1,T2>& rhs ); (1) (until C++14) template< class T1, class T2 > constexpr bool operator==( const pair<T1,T2>& lhs, const pair<T1,T2>& rhs ); (1) (since C++14) template< class T1, class T2 > bool operator!=( const pair<T1,T2>& lhs, const pair<T1,T2>& rhs ); (2) (until C++14) tem

std::is_empty

Defined in header <type_traits> template< class T > struct is_empty; (since C++11) If T is an empty type (that is, a non-union class type with no non-static data members other than bit-fields of size 0, no virtual functions, no virtual base classes, and no non-empty base classes), 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. Templat

std::unordered_multiset::bucket

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

operators (std::cauchy_distribution)

template< class ResultType > bool operator==( const cauchy_distribution<ResultType>& lhs, const cauchy_distribution<ResultType>& rhs ); (1) template< class ResultType > bool operator!=( const cauchy_distribution<ResultType>& lhs, const cauchy_distribution<ResultType>& rhs ); (2) Compares two distribution objects. Two distribution objects are equal when parameter values and internal state is the s

operators (std::gamma_distribution)

template< class CharT, class Traits, class ResultType > std::basic_ostream<CharT,Traits>& operator<<( std::basic_ostream<CharT,Traits>& ost, const gamma_distribution<ResultType>& d ); (1) template< class CharT, class Traits, class ResultType > std::basic_istream<CharT,Traits>& operator>>( std::basic_istream<CharT,Traits>& ist,

std::chrono::duration::operators (unary)

constexpr duration operator+() const; (1) constexpr duration operator-() const; (2) Implements unary plus and unary minus for the durations. If rep_ is a member variable holding the number of ticks in a duration object, 1) Equivalent to return *this; 2) Equivalent to return duration(-rep_); Parameters (none). Return value 1) a copy of this duration object 2) a copy of this duration object, with the number of ticks negated Example #include <chrono> #include &

std::messages::get

Defined in header <locale> public: string_type get( catalog cat, int set, int msgid, const string_type& dfault ) const; (1) protected: virtual string_type do_get( catalog cat, int set, int msgid, const string_type& dfault ) const; (2) 1) Public member function, calls the protected virtual member function do_get of the most derived class. 2) Obtains a message from the open message catalog cat using the values set, msgid and dfault in implementation-defined mann

std::chrono::steady_clock

Defined in header <chrono> class steady_clock; (since C++11) Class std::chrono::steady_clock represents a monotonic clock. The time points of this clock cannot decrease as physical time moves forward. This clock is not related to wall clock time, and is best suitable for measuring intervals. std::chrono::steady_clock meets the requirements of TrivialClock. Member types Member type Definition rep arithmetic type representing the number of ticks in the clock's durat

std::shuffle_order_engine::min

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)

std::linear_congruential_engine::discard

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. Parameters z - integer value specifying the number of times to advance the state by Return value (none). Complexity See also operator() advances the engine's state and returns the generated value (public member function)