mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

document iteration ordering on into_iter method instead of IntoIterator implementation

Browse Source
This commit is contained in:
ultrabear 2024-03-21 02:05:11 -07:00
parent f6f89dc202
commit f8a093c8ea
No known key found for this signature in database
GPG Key ID: 6A5BDAF57DFFD6A0
2 changed files with 2 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
library/alloc/src/collections/btree/map.rs
View File

@ -1632,12 +1632,12 @@ impl<'a, K, V> IterMut<'a, K, V> {
}
}
/// Gets an owning iterator over the entries of the map, sorted by key.
#[stable(feature = "rust1", since = "1.0.0")]
impl<K, V, A: Allocator + Clone> IntoIterator for BTreeMap<K, V, A> {
type Item = (K, V);
type IntoIter = IntoIter<K, V, A>;
/// Gets an owning iterator over the entries of the map, sorted by key.
fn into_iter(self) -> IntoIter<K, V, A> {
let mut me = ManuallyDrop::new(self);
if let Some(root) = me.root.take() {

3
library/alloc/src/collections/btree/set.rs
View File

@ -1232,13 +1232,12 @@ impl<T: Ord, const N: usize> From<[T; N]> for BTreeSet<T> {
}
}
/// Gets an owning iterator over the elements of the `BTreeSet` in ascending order.
#[stable(feature = "rust1", since = "1.0.0")]
impl<T, A: Allocator + Clone> IntoIterator for BTreeSet<T, A> {
type Item = T;
type IntoIter = IntoIter<T, A>;
/// Gets an iterator for moving out the `BTreeSet`'s contents.
/// Gets an iterator for moving out the `BTreeSet`'s contents in ascending order.
///
/// # Examples
///