bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

Rollup merge of #133530 - timvisee:master, r=jhpratt

Browse source 
Use consistent wording in docs, use is zero instead of is 0

In documentation, wording of _"`rhs` is zero"_ and _"`rhs` is 0"_ is intermixed. This is especially visible [here](https://doc.rust-lang.org/std/primitive.usize.html#method.div_ceil).

This changes all occurrences to _"`rhs` is zero"_ for better readability.
This commit is contained in:
Matthias Krüger 2024-11-29 10:18:58 +01:00 • committed by GitHub
commit 8ca5a907a5
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
8 changed files with 52 additions and 52 deletions
Download patch file Download diff file Expand all files Collapse all files

4
library/std/src/collections/hash/map.rs
View file

@ -235,7 +235,7 @@ impl<K, V> HashMap<K, V, RandomState> {
///
/// The hash map will be able to hold at least `capacity` elements without
/// reallocating. This method is allowed to allocate for more elements than
/// `capacity`. If `capacity` is 0, the hash map will not allocate.
/// `capacity`. If `capacity` is zero, the hash map will not allocate.
///
/// # Examples
///
@ -287,7 +287,7 @@ impl<K, V, S> HashMap<K, V, S> {
///
/// The hash map will be able to hold at least `capacity` elements without
/// reallocating. This method is allowed to allocate for more elements than
/// `capacity`. If `capacity` is 0, the hash map will not allocate.
/// `capacity`. If `capacity` is zero, the hash map will not allocate.
///
/// Warning: `hasher` is normally randomly generated, and
/// is designed to allow HashMaps to be resistant to attacks that

4
library/std/src/collections/hash/set.rs
View file

@ -130,7 +130,7 @@ impl<T> HashSet<T, RandomState> {
///
/// The hash set will be able to hold at least `capacity` elements without
/// reallocating. This method is allowed to allocate for more elements than
/// `capacity`. If `capacity` is 0, the hash set will not allocate.
/// `capacity`. If `capacity` is zero, the hash set will not allocate.
///
/// # Examples
///
@ -379,7 +379,7 @@ impl<T, S> HashSet<T, S> {
///
/// The hash set will be able to hold at least `capacity` elements without
/// reallocating. This method is allowed to allocate for more elements than
/// `capacity`. If `capacity` is 0, the hash set will not allocate.
/// `capacity`. If `capacity` is zero, the hash set will not allocate.
///
/// Warning: `hasher` is normally randomly generated, and
/// is designed to allow `HashSet`s to be resistant to attacks that