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.

I thought the whole point of that article was that it described a 
method where there _wasn't_ reliance on mutable input that would 
be shuffled in-place?