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

[Joseph Rushton Wakeling via Digitalmars-d]

On Friday, 26 February 2016 at 12:23:24 UTC, Andrei Alexandrescu 
wrote:
> On 02/26/2016 03:34 AM, Joseph Rushton Wakeling wrote:
>> http://apfelmus.nfshost.com/articles/random-permutations.html
>
> This touches the input, we just want to cover it.
>
>> http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.150.9347&rep=rep1&type=pdf
>
> This seems like a nice article but I don't find a part relevant 
> to this.

I may have misread, because I was in a rush this morning, but I 
thought that in section 2.3 it defined a method for lazily 
generating permutations of a list.  This was what I thought was 
relevant.