Defined in header <ratio> template< class R1, class R2 > using ratio_multiply = /* see below */; The alias template std::ratio_multiply denotes the result of multiplying two exact rational fractions represented by the std::ratio specializations R1 and R2. The result is a std::ratio specialization std::ratio<U, V>, such that given Num == R1::num * R2::num and Denom == R1::den * R2::den (computed without arithmetic overflow), U is std::ratio<Num, Denom>::nu

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

std::pair<iterator,iterator> equal_range( const Key& key ); (since C++11) std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const; (since C++11) Returns a range containing all elements with key key in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range. Parameters key - key value to compare the elements to Re

bitset<N>& flip(); (1) bitset<N>& flip( size_t pos ); (2) Flips bits, i.e. changes true values to false and false values to true. Equivalent to a logical NOT operation on part or all of the bitset. 1) Flips all bits (equivalent to operator~) 2) Flips the bit at the position pos. Parameters pos - the position of the bit to flip Return value *this. Exceptions 1) (none) (until C++11) noexcept specification: noexcept (since C++11) 2) thro

Defined in header <algorithm> template< class InputIt, class OutputIt1, class OutputIt2, class UnaryPredicate > std::pair<OutputIt1, OutputIt2> partition_copy( InputIt first, InputIt last, OutputIt1 d_first_true, OutputIt2 d_first_false, UnaryPredicate p ); (since C++11) Copies the elements from the range [first, last) to two different ranges depending on the value returned by the predicate p. The elements

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)

bool empty() const; Checks if the container has no elements, i.e. whether begin() == end(). Parameters (none). Return value true if the container is empty, false otherwise. Exceptions (none) (until C++11) noexcept specification: noexcept (since C++11) Complexity Constant. Example The following code uses empty to check if a std::deque<int> contains any elements: #include <deque> #include <iostream> int main() { std::deque<int> numbers;

Defined in header <algorithm> (1) template< class T > std::pair<const T&,const T&> minmax( const T& a, const T& b ); (since C++11) (until C++14) template< class T > constexpr std::pair<const T&,const T&> minmax( const T& a, const T& b ); (since C++14) (2) template< class T, class Compare > std::pair<const T&,const T&> minmax( const T& a, const T& b,

Defined in header <locale> template< class charT > bool isalpha( charT ch, const locale& loc ); Checks if the given character is classified as an alphabetic character by the given locale's std::ctype facet. Parameters ch - character loc - locale Return value Returns true if the character is classified as alphabetic, false otherwise. Possible implementation template< class charT > bool isalpha( charT ch, const std::locale& loc ) {

void reset(); (since C++11) Resets the internal state of the distribution object. After a call to this function, the next call to operator() on the distribution object will not be dependent on previous calls to operator(). Parameters (none). Return value (none). Complexity Constant.