diff options
| author | Andrew Paseltiner <apaseltiner@gmail.com> | 2015-04-13 10:21:32 -0400 |
|---|---|---|
| committer | Andrew Paseltiner <apaseltiner@gmail.com> | 2015-04-13 13:57:51 -0400 |
| commit | 6fa16d6a473415415cb87a1fe6754aace32cbb1c (patch) | |
| tree | 6009800c0605908efff7b33c6711b5924d4f70d0 /src/libstd/collections/hash/set.rs | |
| parent | 588d37c653ddac491c2c1cb8974f56781533b173 (diff) | |
| download | rust-6fa16d6a473415415cb87a1fe6754aace32cbb1c.tar.gz rust-6fa16d6a473415415cb87a1fe6754aace32cbb1c.zip | |
pluralize doc comment verbs and add missing periods
Diffstat (limited to 'src/libstd/collections/hash/set.rs')
| -rw-r--r-- | src/libstd/collections/hash/set.rs | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/libstd/collections/hash/set.rs b/src/libstd/collections/hash/set.rs index f897d565321..6b0546b1ee7 100644 --- a/src/libstd/collections/hash/set.rs +++ b/src/libstd/collections/hash/set.rs @@ -111,7 +111,7 @@ pub struct HashSet<T, S = RandomState> { } impl<T: Hash + Eq> HashSet<T, RandomState> { - /// Create an empty HashSet. + /// Creates an empty HashSet. /// /// # Examples /// @@ -125,7 +125,7 @@ impl<T: Hash + Eq> HashSet<T, RandomState> { HashSet::with_capacity(INITIAL_CAPACITY) } - /// Create an empty HashSet with space for at least `n` elements in + /// Creates an empty HashSet with space for at least `n` elements in /// the hash table. /// /// # Examples @@ -166,7 +166,7 @@ impl<T, S> HashSet<T, S> HashSet::with_capacity_and_hash_state(INITIAL_CAPACITY, hash_state) } - /// Create an empty HashSet with space for at least `capacity` + /// Creates an empty HashSet with space for at least `capacity` /// elements in the hash table, using `hasher` to hash the keys. /// /// Warning: `hasher` is normally randomly generated, and @@ -402,7 +402,7 @@ impl<T, S> HashSet<T, S> Union { iter: self.iter().chain(other.difference(self)) } } - /// Return the number of elements in the set + /// Returns the number of elements in the set. /// /// # Examples /// @@ -417,7 +417,7 @@ impl<T, S> HashSet<T, S> #[stable(feature = "rust1", since = "1.0.0")] pub fn len(&self) -> usize { self.map.len() } - /// Returns true if the set contains no elements + /// Returns true if the set contains no elements. /// /// # Examples /// |