about summary refs log tree commit diff
diff options
context:
space:
mode:
authorGuillaume Gomez <guillaume.gomez@huawei.com>2022-06-10 11:57:53 +0200
committerGuillaume Gomez <guillaume.gomez@huawei.com>2022-06-10 11:57:53 +0200
commit28ca3bdeb278cdf0d8b1a87777183689da6f9509 (patch)
tree1139ba2fe5df264ffaadb2cffbddba8c43808079
parent79b6bad406155cad4481150fc5dfa0da5394e3b6 (diff)
downloadrust-28ca3bdeb278cdf0d8b1a87777183689da6f9509.tar.gz
rust-28ca3bdeb278cdf0d8b1a87777183689da6f9509.zip
Use relative links instead of linking to doc.rust-lang.org when possible
-rw-r--r--library/core/src/hash/sip.rs2
-rw-r--r--library/core/src/mem/maybe_uninit.rs2
2 files changed, 2 insertions, 2 deletions
diff --git a/library/core/src/hash/sip.rs b/library/core/src/hash/sip.rs
index 97e32ca77db..81bf1dfdf45 100644
--- a/library/core/src/hash/sip.rs
+++ b/library/core/src/hash/sip.rs
@@ -38,7 +38,7 @@ struct SipHasher24 {
 /// SipHash is a general-purpose hashing function: it runs at a good
 /// speed (competitive with Spooky and City) and permits strong _keyed_
 /// hashing. This lets you key your hash tables from a strong RNG, such as
-/// [`rand::os::OsRng`](https://doc.rust-lang.org/rand/rand/os/struct.OsRng.html).
+/// [`rand::os::OsRng`](https://docs.rs/rand/latest/rand/rngs/struct.OsRng.html).
 ///
 /// Although the SipHash algorithm is considered to be generally strong,
 /// it is not intended for cryptographic purposes. As such, all
diff --git a/library/core/src/mem/maybe_uninit.rs b/library/core/src/mem/maybe_uninit.rs
index cac7f435573..b4ea5360833 100644
--- a/library/core/src/mem/maybe_uninit.rs
+++ b/library/core/src/mem/maybe_uninit.rs
@@ -865,7 +865,7 @@ impl<T> MaybeUninit<T> {
     ///
     /// For instance, you cannot [`Read`] into an uninitialized buffer:
     ///
-    /// [`Read`]: https://doc.rust-lang.org/std/io/trait.Read.html
+    /// [`Read`]: ../../std/io/trait.Read.html
     ///
     /// ```rust,no_run
     /// use std::{io, mem::MaybeUninit};