Re: Pseudo-random numbers in [0, n), covering all numbers in n steps?

[Craig Dillabaugh via Digitalmars-d]

On Friday, 26 February 2016 at 15:15:11 UTC, Nicholas Wilson 
wrote:
On Friday, 26 February 2016 at 14:59:43 UTC, Andrei 
Alexandrescu wrote:
On 02/25/2016 06:46 PM, Nicholas Wilson wrote:
The technical name for the property of distribution you 
describe is
  k-Dimensional Equidistribution (in this case k=1).
I would suggest taking a look at http://www.pcg-random.org.
They claim to have both arbitrary period and k-Dimensional 
Equidistribution

Thanks, that's indeed closest! A hefty read. Anyone inclined 
to work on a PCG random implementation? -- Andrei

Dstep could be used to port the C++ version if needed.

I don't think Dstep can handle C++.