difference_type length() const; Parameters (none). Return value Returns the number of characters in the match, i.e. std::distance(first, second) if the match is valid, 0 otherwise. Complexity Constant.

int compare( const sub_match& m ) const; (1) (since C++11) int compare( const string_type& s ) const; (2) (since C++11) int compare( const value_type* c ) const; (3) (since C++11) 1) Compares two sub_match directly by comparing their underlying character sequences. Equivalent to str().compare(m.str()) 2) Compares a sub_match with a std::basic_string. This function is implemented as follows. Equivalent to str().compare(s) 3) Compares a sub_match with a null-termi

Defined in header <regex> template< class BidirIt > class sub_match; (since C++11) The class template sub_match is used by the regular expression engine to denote sequences of characters matched by marked sub-expressions. A match is a [begin, end) pair within the target range matched by the regular expression, but with additional observer functions to enhance code clarity. Only the default constructor is publicly accessible. Instances of sub_match are normally con

explicit subtract_with_carry_engine( result_type value = default_seed ); (1) (since C++11) template< class Sseq > explicit subtract_with_carry_engine( Sseq& s ); (2) (since C++11) subtract_with_carry_engine( const subtract_with_carry_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

void seed( result_type value = default_seed ); (1) (since C++11) template< class Sseq > void seed( Sseq& seq ); (2) (since C++11) Reinitializes the internal state of the random-number engine using new seed value. Parameters value - seed value to use in the initialization of the internal state seq - seed sequence to use in the initialization of the internal state Exceptions (none). Complexity

static constexpr result_type min(); (since C++11) Returns the minimum value potentially generated by the random-number engine. This value is equal to 0u. 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 equal to 2w - 1, where w is word_size. 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)

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)

Defined in header <random> template< class UIntType, size_t w, size_t s, size_t r > class subtract_with_carry_engine; (since C++11) subtract_with_carry_engine is a random number engine that uses subtract with carry algorithm. The following typedefs define the random number engine with two commonly used parameter sets: Defined in header <random> Type Definition ranlux24_base std::subtract_with_carry_engine<std::uint_fast32_t, 24, 10, 24>

explicit student_t_distribution( RealType n = 1 ); (1) (since C++11) explicit student_t_distribution( const param_type& params ); (2) (since C++11) Constructs new distribution object. The first version uses n as the distribution parameter, the second version uses params as the distribution parameter. Parameters n - the n distribution parameter (degrees of freedom) params - the distribution parameter set