}

}

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

_NODISCARD _Uint _Next_linear_congruential_value(_Uint _Prev) noexcept {

// Choose intermediate type:

const auto _Mul =

static_cast<unsigned int>(_Prev) * static_cast<unsigned int>(_Ax) + static_cast<unsigned int>(_Cx);

return static_cast<_Uint>(_Mul % _Mx);

// unsigned long long is sufficient to store intermediate calculation

const auto _Mul = static_cast<unsigned long long>(_Prev) * _Ax + _Cx;

return static_cast<_Uint>(_Mul % _Mx);

} else { // no intermediate integral type fits; fall back to multiprecision

}

}

_STD_BEGIN

constexpr unsigned long long mask = ~(~0ULL << shift);

constexpr unsigned long long maxVal = mask + 1;

_MP_arr u) noexcept { // convert multi-word value to scalar value

return (u[1] << shift) + u[0];

}

}

}

_MP_arr u, unsigned long long v0) noexcept { // add scalar value to multi-word value

unsigned long long v[2];

v[0] = v0 & mask;

}

}

_MP_arr w, unsigned long long u0, unsigned long long v0) noexcept { // multiply multi-word value by multi-word value

constexpr int m = 2;

constexpr int n = 2;

return ulen;

}

_MP_arr u, unsigned long long v0) noexcept { // divide multi-word value by value, leaving remainder in u

unsigned long long v[2];

v[0] = v0 & mask;