|
static _Uint() | min () |
|
static _Uint() | max () |
|
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
linear_congruential< _Uint, _Ax, _Cx, _Mx > _Mybase
Definition: random:657
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
const _Ty & _Right
Definition: algorithm:4087
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
const _Ty & _Right
Definition: algorithm:4087
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
template<class _Seed_seq , class = typename enable_if< !is_convertible<_Seed_seq, _Uint>::value, void>:: type>
void seed(_Uint _X0=_Mybase::default_seed)
Definition: random:683
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
708 return (_Cx != 0 ? 0 : 1);
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
void _Reset(_Uint _X0)
Definition: random:581
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
template<class _Seed_seq >
699 _Seq.generate(&_Arr[0], &_Arr[3 +
_Nw]);
700 for (
int _Idx =
_Nw; 0 < --_Idx; )
701 _Arr[3 + _Idx - 1] |=
702 _Arr[3 + _Idx] << _Lsh;
void _Reset(_Uint _X0)
Definition: random:581
static const int _Nw
Definition: random:688
#define _BITS_BYTE
Definition: random:19
template<class _Uint , _Uint _Ax, _Uint _Cx, _Uint _Mx>
The documentation for this class was generated from the following file: