diff options
| author | bors <bors@rust-lang.org> | 2020-11-13 14:53:55 +0000 |
|---|---|---|
| committer | bors <bors@rust-lang.org> | 2020-11-13 14:53:55 +0000 |
| commit | f2a11a25378293e41cfcb00dbf67c524ffd79b39 (patch) | |
| tree | 0408fb65f32c44940088084727863b4ded39c2f8 /library/std/src | |
| parent | a1f7ca788d28f8df9ccd161137c3429be1ed9d0e (diff) | |
| parent | 7ea8e32adb091a7cd342208eda5559652af57da6 (diff) | |
| download | rust-f2a11a25378293e41cfcb00dbf67c524ffd79b39.tar.gz rust-f2a11a25378293e41cfcb00dbf67c524ffd79b39.zip | |
Auto merge of #79017 - GuillaumeGomez:rollup-5orhudd, r=GuillaumeGomez
Rollup of 6 pull requests Successful merges: - #77151 (Add regression test for issue #76042) - #77996 (Doc change: Remove mention of `fnv` in HashMap) - #78463 (Add type to `ConstKind::Placeholder`) - #78984 (Rustdoc check option) - #78985 (add dropck test for const params) - #78996 (add explicit test for const param promotion) Failed merges: r? `@ghost` `@rustbot` modify labels: rollup
Diffstat (limited to 'library/std/src')
| -rw-r--r-- | library/std/src/collections/hash/map.rs | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/library/std/src/collections/hash/map.rs b/library/std/src/collections/hash/map.rs index fa229251703..27d90e66137 100644 --- a/library/std/src/collections/hash/map.rs +++ b/library/std/src/collections/hash/map.rs @@ -34,8 +34,8 @@ use crate::sys; /// attacks such as HashDoS. /// /// The hashing algorithm can be replaced on a per-`HashMap` basis using the -/// [`default`], [`with_hasher`], and [`with_capacity_and_hasher`] methods. Many -/// alternative algorithms are available on crates.io, such as the [`fnv`] crate. +/// [`default`], [`with_hasher`], and [`with_capacity_and_hasher`] methods. +/// There are many alternative [hashing algorithms available on crates.io]. /// /// It is required that the keys implement the [`Eq`] and [`Hash`] traits, although /// this can frequently be achieved by using `#[derive(PartialEq, Eq, Hash)]`. @@ -57,6 +57,7 @@ use crate::sys; /// The original C++ version of SwissTable can be found [here], and this /// [CppCon talk] gives an overview of how the algorithm works. /// +/// [hashing algorithms available on crates.io]: https://crates.io/keywords/hasher /// [SwissTable]: https://abseil.io/blog/20180927-swisstables /// [here]: https://github.com/abseil/abseil-cpp/blob/master/absl/container/internal/raw_hash_set.h /// [CppCon talk]: https://www.youtube.com/watch?v=ncHmEUmJZf4 @@ -154,7 +155,6 @@ use crate::sys; /// [`default`]: Default::default /// [`with_hasher`]: Self::with_hasher /// [`with_capacity_and_hasher`]: Self::with_capacity_and_hasher -/// [`fnv`]: https://crates.io/crates/fnv /// /// ``` /// use std::collections::HashMap; |
