nordic-dev.net/rust
nordic-dev.net/rust
2
0
Fork 0
mirror of https://github.com/rust-lang/rust.git synced 2025-06-04 19:29:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

Rollup merge of #120044 - Storyyeller:patch-2, r=lqd

Browse Source 
Fix typo in comments (in_place_collect)
This commit is contained in:
Matthias Krüger 2024-01-17 20:21:23 +01:00 committed by GitHub
commit a2eefd2718
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
library/alloc/src/vec/in_place_collect.rs
View File

@ -9,7 +9,7 @@
//! or [`BinaryHeap<T>`], the adapters guarantee to consume enough items per step to make room //! or [`BinaryHeap<T>`], the adapters guarantee to consume enough items per step to make room
//! for the results (represented by [`InPlaceIterable`]), provide transitive access to `source` //! for the results (represented by [`InPlaceIterable`]), provide transitive access to `source`
//! (via [`SourceIter`]) and thus the underlying allocation. //! (via [`SourceIter`]) and thus the underlying allocation.
//! And finally there are alignment and size constriants to consider, this is currently ensured via //! And finally there are alignment and size constraints to consider, this is currently ensured via
//! const eval instead of trait bounds in the specialized [`SpecFromIter`] implementation. //! const eval instead of trait bounds in the specialized [`SpecFromIter`] implementation.
//! //!
//! [`BinaryHeap<T>`]: crate::collections::BinaryHeap //! [`BinaryHeap<T>`]: crate::collections::BinaryHeap