Small doc polishing

Author: pitdicker

src/lib.rs

@@ -642,7 +642,7 @@ impl<R: RngCore + ?Sized> Rng for R {}
 /// PRNGs, though two alternatives may be considered:
 ///
 /// *   Deterministic creation using [`SeedableRng::from_seed`] with a fixed seed
-/// *   Seeding from `thread_rng`: `SeedableRng::from_rng(thread_rng())?`;
+/// *   Seeding from [`thread_rng`]: `SeedableRng::from_rng(thread_rng())?`;
 ///     this will usually be faster and should also be secure, but requires
 ///     trusting one extra component.
 ///
@@ -658,6 +658,7 @@ impl<R: RngCore + ?Sized> Rng for R {}
 /// [`EntropyRng`]: rngs/struct.EntropyRng.html
 /// [`SeedableRng`]: trait.SeedableRng.html
 /// [`SeedableRng::from_seed`]: trait.SeedableRng.html#tymethod.from_seed
+/// [`thread_rng`]: fn.thread_rng.html
 #[cfg(feature="std")]
 pub trait FromEntropy: SeedableRng {
     /// Creates a new instance, automatically seeded with fresh entropy.
@@ -703,6 +704,9 @@ impl<R: SeedableRng> FromEntropy for R {
 /// documentation of the entropy source and [`Standard`] for documentation of
 /// distributions and type-specific generation.
 ///
+/// Use [`thread_rng`] directly when you need more features, for example
+/// `thread_rng().gen_range(a, b)` to generate values uniformly in some range.
+///
 /// # Examples
 ///
 /// ```

src/rngs/entropy.rs

@@ -30,8 +30,8 @@ use {OsRng, JitterRng};
 /// external entropy then primarily use the local PRNG ([`thread_rng`] is
 /// provided as a convenient, local, automatically-seeded CSPRNG).
 ///
-/// [`OsRng`]: os/struct.OsRng.html
-/// [`JitterRng`]: jitter/struct.JitterRng.html
+/// [`OsRng`]: struct.OsRng.html
+/// [`JitterRng`]: struct.JitterRng.html
 /// [`thread_rng`]: ../fn.thread_rng.html
 #[derive(Debug)]
 pub struct EntropyRng {

src/rngs/read.rs

@@ -23,8 +23,8 @@ use rand_core::{RngCore, Error, ErrorKind, impls};
 ///
 /// `ReadRng` uses `std::io::read_exact`, which retries on interrupts. All other
 /// errors from the underlying reader, including when it does not have enough
-/// data, will only be reported through `try_fill_bytes`. The other `RngCore`
-/// methods will panic in case of an error error.
+/// data, will only be reported through [`try_fill_bytes`]. The other
+/// [`RngCore`] methods will panic in case of an error.
 ///
 /// # Example
 ///
@@ -35,6 +35,9 @@ use rand_core::{RngCore, Error, ErrorKind, impls};
 /// let mut rng = read::ReadRng::new(&data[..]);
 /// println!("{:x}", rng.gen::<u32>());
 /// ```
+///
+/// [`RngCore`]: ../trait.RngCore.html
+/// [`try_fill_bytes`]: ../trait.RngCore.html#tymethod.try_fill_bytes
 #[derive(Debug)]
 pub struct ReadRng<R> {
     reader: R

src/rngs/small.rs

@@ -14,9 +14,11 @@ use {RngCore, SeedableRng, Error};
 use prng::XorShiftRng;
 
 /// An RNG recommended when small state, cheap initialization and good
-/// performance are required. The PRNG algorithm in `SmallRng` is chosen to be
-/// efficient on the current platform, **without consideration for cryptography
-/// or security**. The size of its state is much smaller than for [`StdRng`].
+/// performance are required.
+///
+/// The PRNG algorithm in `SmallRng` is chosen to be efficient on the current
+/// platform, **without consideration for cryptography or security**. The size
+/// of its state is much smaller than for [`StdRng`].
 ///
 /// Reproducibility of output from this generator is however not required, thus
 /// future library versions may use a different internal generator with