linear_congruential< _Uint, _Ax, _Cx, _Mx > Class Template Reference

Inheritance diagram for linear_congruential< _Uint, _Ax, _Cx, _Mx >:

Public Types
typedef linear_congruential< _Uint, _Ax, _Cx, _Mx >	_Myt
typedef _Uint	result_type

Public Member Functions
	linear_congruential (_Uint _X0=default_seed)
template<class _Gen , class = typename _Enable_if_seed_seq<_Gen, _Myt>::type>
	linear_congruential (_Gen &_Gx)
void	seed (_Uint _X0=default_seed)
template<class _Gen >
void	seed (_Gen &_Gx, bool=false)
_Uint()	min () const
_Uint()	max () const
_Uint	operator() ()
void	discard (unsigned long long _Nskip)
bool	_Equals (const _Myt &_Right) const
template<class _Elem , class _Traits >
basic_ostream< _Elem, _Traits > &	_Write (basic_ostream< _Elem, _Traits > &_Ostr) const

Static Public Attributes
static constexpr _Uint	multiplier = _Ax
static constexpr _Uint	increment = _Cx
static constexpr _Uint	modulus = _Mx
static constexpr _Uint	default_seed = 1U

Protected Member Functions
template<class _Gen >
void	_Seed (_Gen &_Gx, true_type)
template<class _Gen >
void	_Seed (_Gen &_Gx, false_type)
void	_Reset (_Uint _X0)

Protected Attributes
_Select< _Uint, _Ax, _Cx, _Mx >::type	_Imp

Member Typedef Documentation

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

typedef linear_congruential<_Uint, _Ax, _Cx, _Mx> linear_congruential< _Uint, _Ax, _Cx, _Mx >::_Myt

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

typedef _Uint linear_congruential< _Uint, _Ax, _Cx, _Mx >::result_type

Constructor & Destructor Documentation

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

linear_congruential< _Uint, _Ax, _Cx, _Mx >::linear_congruential ( _Uint  _X0 = default_seed )

inlineexplicit

        {   // construct from initial value
        seed(_X0);
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

template<class _Gen , class = typename _Enable_if_seed_seq<_Gen, _Myt>::type>

linear_congruential< _Uint, _Ax, _Cx, _Mx >::linear_congruential ( _Gen &  _Gx )

inline

        {   // construct from generator
        seed(_Gx);
        }

Member Function Documentation

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

bool linear_congruential< _Uint, _Ax, _Cx, _Mx >::_Equals ( const _Myt &  _Right ) const

inline

        {   // return true if *this will generate same sequence as _Right
        return (_Imp._Prev == _Right._Imp._Prev);
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

void linear_congruential< _Uint, _Ax, _Cx, _Mx >::_Reset ( _Uint  _X0 )

inlineprotected

        {   // reset sequence
        _Imp._Prev = _Mx != 0 ? _X0 % _Mx : _X0;
        if (_Imp._Prev == 0 && _Cx == 0)
            _Imp._Prev = 1;
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

template<class _Gen >

void linear_congruential< _Uint, _Ax, _Cx, _Mx >::_Seed ( _Gen &  _Gx, true_type    )

inlineprotected

        {   // reset sequence from numeric value
        _Reset((_Uint)_Gx);
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

template<class _Gen >

void linear_congruential< _Uint, _Ax, _Cx, _Mx >::_Seed ( _Gen &  _Gx, false_type    )

inlineprotected

        {   // reset sequence from generator
        _Reset(_Gx());
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

template<class _Elem , class _Traits >

basic_ostream<_Elem, _Traits>& linear_congruential< _Uint, _Ax, _Cx, _Mx >::_Write ( basic_ostream< _Elem, _Traits > &  _Ostr ) const

inline

        {   // write state to _Ostr
        return (_Ostr << _Imp._Prev);
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

void linear_congruential< _Uint, _Ax, _Cx, _Mx >::discard ( unsigned long long  _Nskip )

inline

        {   // discard _Nskip elements
        for (; 0 < _Nskip; --_Nskip)
            (*this)();
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

_Uint() linear_congruential< _Uint, _Ax, _Cx, _Mx >::max ( ) const

inline

        {   // return maximum possible generated value
        return (_Mx != 0 ? _Mx - 1 : (numeric_limits<_Uint>::max)());
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

_Uint() linear_congruential< _Uint, _Ax, _Cx, _Mx >::min ( ) const

inline

        {   // return minimum possible generated value
        return (_Cx != 0 ? 0 : 1);
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

_Uint linear_congruential< _Uint, _Ax, _Cx, _Mx >::operator() ( )

inline

        {   // return next value
        return (_Imp());
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

void linear_congruential< _Uint, _Ax, _Cx, _Mx >::seed ( _Uint  _X0 = default_seed )

inline

        {   // reset sequence from numeric value
        _Reset(_X0);
        }

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

template<class _Gen >

void linear_congruential< _Uint, _Ax, _Cx, _Mx >::seed ( _Gen &  _Gx, bool  = false  )

inline

        {   // reset sequence from generator
        _Seed(_Gx, is_arithmetic<_Gen>());
        }

Member Data Documentation

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

_Select<_Uint, _Ax, _Cx, _Mx>::type linear_congruential< _Uint, _Ax, _Cx, _Mx >::_Imp

protected

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

constexpr _Uint linear_congruential< _Uint, _Ax, _Cx, _Mx >::default_seed = 1U

static

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

constexpr _Uint linear_congruential< _Uint, _Ax, _Cx, _Mx >::increment = _Cx

static

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

constexpr _Uint linear_congruential< _Uint, _Ax, _Cx, _Mx >::modulus = _Mx

static

template<class _Uint, _Uint _Ax, _Uint _Cx, _Uint _Mx>

constexpr _Uint linear_congruential< _Uint, _Ax, _Cx, _Mx >::multiplier = _Ax

static

---

The documentation for this class was generated from the following file:

• VS2017/inc/random