Unique random number set computation

Shuffling huge integer sets given as disjoint intervals: with naive Fisher-Yates needing 8GB for 2^31 values, the authors derive a uniform, low-memory algorithm released as the leeloo C++ library.