Skip to content

Commit

Permalink
Merge pull request #848 from Armavica/doc-link-fixes
Browse files Browse the repository at this point in the history
Fix syntax of some links in documentation
  • Loading branch information
dhardy committed Jul 24, 2019
2 parents 122b729 + 16893c8 commit e6309d8
Show file tree
Hide file tree
Showing 4 changed files with 9 additions and 9 deletions.
10 changes: 5 additions & 5 deletions rand_core/src/lib.rs
Original file line number Diff line number Diff line change
Expand Up @@ -137,23 +137,23 @@ pub trait RngCore {
/// RNGs must implement at least one method from this trait directly. In
/// the case this method is not implemented directly, it can be implemented
/// using `self.next_u64() as u32` or via
/// [`fill_bytes`][impls::next_u32_via_fill].
/// [`fill_bytes`](impls::next_u32_via_fill).
fn next_u32(&mut self) -> u32;

/// Return the next random `u64`.
///
/// RNGs must implement at least one method from this trait directly. In
/// the case this method is not implemented directly, it can be implemented
/// via [`next_u32`][impls::next_u64_via_u32] or via
/// [`fill_bytes`][impls::next_u64_via_fill].
/// via [`next_u32`](impls::next_u64_via_u32) or via
/// [`fill_bytes`](impls::next_u64_via_fill).
fn next_u64(&mut self) -> u64;

/// Fill `dest` with random data.
///
/// RNGs must implement at least one method from this trait directly. In
/// the case this method is not implemented directly, it can be implemented
/// via [`next_u*`][impls::fill_bytes_via_next] or
/// via [`try_fill_bytes`][RngCore::try_fill_bytes]; if this generator can
/// via [`next_u*`](impls::fill_bytes_via_next) or
/// via [`try_fill_bytes`](RngCore::try_fill_bytes); if this generator can
/// fail the implementation must choose how best to handle errors here
/// (e.g. panic with a descriptive message or log a warning and retry a few
/// times).
Expand Down
2 changes: 1 addition & 1 deletion rand_distr/src/exponential.rs
Original file line number Diff line number Diff line change
Expand Up @@ -73,7 +73,7 @@ impl Distribution<f64> for Exp1 {
/// This distribution has density function: `f(x) = lambda * exp(-lambda * x)`
/// for `x > 0`.
///
/// Note that [`Exp1`][crate::Exp1] is an optimised implementation for `lambda = 1`.
/// Note that [`Exp1`](crate::Exp1) is an optimised implementation for `lambda = 1`.
///
/// # Example
///
Expand Down
2 changes: 1 addition & 1 deletion src/distributions/exponential.rs
Original file line number Diff line number Diff line change
Expand Up @@ -57,7 +57,7 @@ impl Distribution<f64> for Exp1 {
/// This distribution has density function: `f(x) = lambda * exp(-lambda * x)`
/// for `x > 0`.
///
/// Note that [`Exp1`][crate::distributions::Exp1] is an optimised implementation for `lambda = 1`.
/// Note that [`Exp1`](crate::distributions::Exp1) is an optimised implementation for `lambda = 1`.
#[deprecated(since="0.7.0", note="moved to rand_distr crate")]
#[derive(Clone, Copy, Debug)]
pub struct Exp {
Expand Down
4 changes: 2 additions & 2 deletions src/rngs/small.rs
Original file line number Diff line number Diff line change
Expand Up @@ -34,8 +34,8 @@ type Rng = rand_pcg::Pcg32;
/// 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 [`StdRng`].
/// The current algorithm is [`Pcg64Mcg`][rand_pcg::Pcg64Mcg] on 64-bit
/// platforms and [`Pcg32`][rand_pcg::Pcg32] on 32-bit platforms. Both are
/// The current algorithm is [`Pcg64Mcg`](rand_pcg::Pcg64Mcg) on 64-bit
/// platforms and [`Pcg32`](rand_pcg::Pcg32) on 32-bit platforms. Both are
/// implemented by the [rand_pcg] crate.
///
/// # Examples
Expand Down

0 comments on commit e6309d8

Please sign in to comment.