@@ -34,8 +34,8 @@ const RAND_SIZE: usize = 1 << RAND_SIZE_LEN;
34
34
/// In spite of being designed with cryptographic security in mind, ISAAC hasn't
35
35
/// been stringently cryptanalyzed and thus cryptographers do not not
36
36
/// consensually trust it to be secure. When looking for a secure RNG, prefer
37
- /// `Hc128Rng` from [`rand_hc`] crate instead, which, like ISAAC, is an
38
- /// array-based RNG and one of the stream-ciphers selected the by eSTREAM
37
+ /// `Hc128Rng` from the [`rand_hc`] crate instead, which, like ISAAC, is an
38
+ /// array-based RNG and one of the stream-ciphers selected the by eSTREAM
39
39
///
40
40
/// In 2006 an improvement to ISAAC was suggested by Jean-Philippe Aumasson,
41
41
/// named ISAAC+[^3]. But because the specification is not complete, because
@@ -117,7 +117,7 @@ impl SeedableRng for IsaacRng {
117
117
fn from_seed ( seed : Self :: Seed ) -> Self {
118
118
IsaacRng ( BlockRng :: < IsaacCore > :: from_seed ( seed) )
119
119
}
120
-
120
+
121
121
/// Create an ISAAC random number generator using an `u64` as seed.
122
122
/// If `seed == 0` this will produce the same stream of random numbers as
123
123
/// the reference implementation when used unseeded.
@@ -166,7 +166,7 @@ impl BlockRngCore for IsaacCore {
166
166
/// of the algorithm in the `IsaacRng` documentation.
167
167
///
168
168
/// Optimisations used (similar to the reference implementation):
169
- ///
169
+ ///
170
170
/// - The loop is unrolled 4 times, once for every constant of mix().
171
171
/// - The contents of the main loop are moved to a function `rngstep`, to
172
172
/// reduce code duplication.
@@ -320,7 +320,7 @@ impl SeedableRng for IsaacCore {
320
320
}
321
321
Self :: init ( seed_extended, 2 )
322
322
}
323
-
323
+
324
324
/// Create an ISAAC random number generator using an `u64` as seed.
325
325
/// If `seed == 0` this will produce the same stream of random numbers as
326
326
/// the reference implementation when used unseeded.
0 commit comments