user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Also use zero when referencing to capacity or length

Browse source
This commit is contained in:
timvisee 2024-11-28 09:46:26 +01:00
parent 74cf503341
commit 89b20e95fd
No known key found for this signature in database
GPG key ID: B8DB720BC383E172
6 changed files with 28 additions and 28 deletions
Download patch file Download diff file Expand all files Collapse all files

4
library/alloc/src/collections/binary_heap/mod.rs
View file

@ -452,7 +452,7 @@ impl<T: Ord> BinaryHeap<T> {
///
/// The binary heap 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 binary heap will not allocate.
/// `capacity`. If `capacity` is zero, the binary heap will not allocate.
///
/// # Examples
///
@ -496,7 +496,7 @@ impl<T: Ord, A: Allocator> BinaryHeap<T, A> {
///
/// The binary heap 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 binary heap will not allocate.
/// `capacity`. If `capacity` is zero, the binary heap will not allocate.
///
/// # Examples
///

8
library/alloc/src/vec/mod.rs
View file

@ -427,7 +427,7 @@ impl<T> Vec<T> {
///
/// The vector 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 vector will not allocate.
/// `capacity`. If `capacity` is zero, the vector will not allocate.
///
/// It is important to note that although the returned vector has the
/// minimum *capacity* specified, the vector will have a zero *length*. For
@ -487,7 +487,7 @@ impl<T> Vec<T> {
///
/// The vector 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 vector will not allocate.
/// `capacity`. If `capacity` is zero, the vector will not allocate.
///
/// # Errors
///
@ -745,7 +745,7 @@ impl<T, A: Allocator> Vec<T, A> {
///
/// The vector 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 vector will not allocate.
/// `capacity`. If `capacity` is zero, the vector will not allocate.
///
/// It is important to note that although the returned vector has the
/// minimum *capacity* specified, the vector will have a zero *length*. For
@ -808,7 +808,7 @@ impl<T, A: Allocator> Vec<T, A> {
///
/// The vector 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 vector will not allocate.
/// `capacity`. If `capacity` is zero, the vector will not allocate.
///
/// # Errors
///

4
library/core/src/iter/traits/iterator.rs
View file

@ -1553,7 +1553,7 @@ pub trait Iterator {
///
/// # Panics
///
/// Panics if `N` is 0. This check will most probably get changed to a
/// Panics if `N` is zero. This check will most probably get changed to a
/// compile time error before this method gets stabilized.
///
/// ```should_panic
@ -3454,7 +3454,7 @@ pub trait Iterator {
///
/// # Panics
///
/// Panics if `N` is 0.
/// Panics if `N` is zero.
///
/// # Examples
///

32
library/core/src/slice/mod.rs
View file

@ -1039,7 +1039,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `size` is 0.
/// Panics if `size` is zero.
///
/// # Examples
///
@ -1095,7 +1095,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `chunk_size` is 0.
/// Panics if `chunk_size` is zero.
///
/// # Examples
///
@ -1130,7 +1130,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `chunk_size` is 0.
/// Panics if `chunk_size` is zero.
///
/// # Examples
///
@ -1172,7 +1172,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `chunk_size` is 0.
/// Panics if `chunk_size` is zero.
///
/// # Examples
///
@ -1211,7 +1211,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `chunk_size` is 0.
/// Panics if `chunk_size` is zero.
///
/// # Examples
///
@ -1288,7 +1288,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `N` is 0. This check will most probably get changed to a compile time
/// Panics if `N` is zero. This check will most probably get changed to a compile time
/// error before this method gets stabilized.
///
/// # Examples
@ -1334,7 +1334,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `N` is 0. This check will most probably get changed to a compile time
/// Panics if `N` is zero. This check will most probably get changed to a compile time
/// error before this method gets stabilized.
///
/// # Examples
@ -1372,7 +1372,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `N` is 0. This check will most probably get changed to a compile time
/// Panics if `N` is zero. This check will most probably get changed to a compile time
/// error before this method gets stabilized.
///
/// # Examples
@ -1448,7 +1448,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `N` is 0. This check will most probably get changed to a compile time
/// Panics if `N` is zero. This check will most probably get changed to a compile time
/// error before this method gets stabilized.
///
/// # Examples
@ -1489,7 +1489,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `N` is 0. This check will most probably get changed to a compile time
/// Panics if `N` is zero. This check will most probably get changed to a compile time
/// error before this method gets stabilized.
///
/// # Examples
@ -1533,7 +1533,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `N` is 0. This check will most probably get changed to a compile time
/// Panics if `N` is zero. This check will most probably get changed to a compile time
/// error before this method gets stabilized.
///
/// # Examples
@ -1568,7 +1568,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `N` is 0. This check will most probably get changed to a compile time
/// Panics if `N` is zero. This check will most probably get changed to a compile time
/// error before this method gets stabilized.
///
/// # Examples
@ -1604,7 +1604,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `chunk_size` is 0.
/// Panics if `chunk_size` is zero.
///
/// # Examples
///
@ -1639,7 +1639,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `chunk_size` is 0.
/// Panics if `chunk_size` is zero.
///
/// # Examples
///
@ -1682,7 +1682,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `chunk_size` is 0.
/// Panics if `chunk_size` is zero.
///
/// # Examples
///
@ -1722,7 +1722,7 @@ impl<T> [T] {
///
/// # Panics
///
/// Panics if `chunk_size` is 0.
/// Panics if `chunk_size` is zero.
///
/// # Examples
///

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