document iteration ordering on into_iter method instead of IntoIterator implementation
This commit is contained in:
parent
f6f89dc202
commit
f8a093c8ea
@ -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")]
|
#[stable(feature = "rust1", since = "1.0.0")]
|
||||||
impl<K, V, A: Allocator + Clone> IntoIterator for BTreeMap<K, V, A> {
|
impl<K, V, A: Allocator + Clone> IntoIterator for BTreeMap<K, V, A> {
|
||||||
type Item = (K, V);
|
type Item = (K, V);
|
||||||
type IntoIter = IntoIter<K, V, A>;
|
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> {
|
fn into_iter(self) -> IntoIter<K, V, A> {
|
||||||
let mut me = ManuallyDrop::new(self);
|
let mut me = ManuallyDrop::new(self);
|
||||||
if let Some(root) = me.root.take() {
|
if let Some(root) = me.root.take() {
|
||||||
|
@ -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")]
|
#[stable(feature = "rust1", since = "1.0.0")]
|
||||||
impl<T, A: Allocator + Clone> IntoIterator for BTreeSet<T, A> {
|
impl<T, A: Allocator + Clone> IntoIterator for BTreeSet<T, A> {
|
||||||
type Item = T;
|
type Item = T;
|
||||||
type IntoIter = IntoIter<T, A>;
|
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
|
/// # Examples
|
||||||
///
|
///
|
||||||
|
Loading…
x
Reference in New Issue
Block a user