From 6814c2f1aa0b214a9d2767283c57446d0b66fa6f Mon Sep 17 00:00:00 2001 From: Pascal Hertleif Date: Sun, 3 May 2015 18:02:43 +0200 Subject: [PATCH] HashSet Docs: Split First Paragraph This way, the module index renders only the first sentence as a short description. --- src/libstd/collections/hash/set.rs | 10 ++++++---- 1 file changed, 6 insertions(+), 4 deletions(-) diff --git a/src/libstd/collections/hash/set.rs b/src/libstd/collections/hash/set.rs index f7e43b38539..9ff3ed88cc4 100644 --- a/src/libstd/collections/hash/set.rs +++ b/src/libstd/collections/hash/set.rs @@ -31,10 +31,12 @@ // to get rid of it properly. /// An implementation of a hash set using the underlying representation of a -/// HashMap where the value is (). As with the `HashMap` type, a `HashSet` -/// requires that the elements implement the `Eq` and `Hash` traits. This can -/// frequently be achieved by using `#[derive(Eq, Hash)]`. If you implement -/// these yourself, it is important that the following property holds: +/// HashMap where the value is (). +/// +/// As with the `HashMap` type, a `HashSet` requires that the elements +/// implement the `Eq` and `Hash` traits. This can frequently be achieved by +/// using `#[derive(Eq, Hash)]`. If you implement these yourself, it is +/// important that the following property holds: /// /// ```text /// k1 == k2 -> hash(k1) == hash(k2) -- 2.44.0