document into_iter in top level docs iterator ordering guarantees
This commit is contained in:
parent
f8a093c8ea
commit
beb0c22c09
2 changed files with 2 additions and 2 deletions
|
@ -72,7 +72,7 @@ pub(super) const MIN_LEN: usize = node::MIN_LEN_AFTER_SPLIT;
|
|||
/// `BTreeMap` that observed the logic error and not result in undefined behavior. This could
|
||||
/// include panics, incorrect results, aborts, memory leaks, and non-termination.
|
||||
///
|
||||
/// Iterators obtained from functions such as [`BTreeMap::iter`], [`BTreeMap::values`], or
|
||||
/// Iterators obtained from functions such as [`BTreeMap::iter`], [`BTreeMap::into_iter`], [`BTreeMap::values`], or
|
||||
/// [`BTreeMap::keys`] produce their items in order by key, and take worst-case logarithmic and
|
||||
/// amortized constant time per item returned.
|
||||
///
|
||||
|
|
|
@ -27,7 +27,7 @@ use crate::alloc::{Allocator, Global};
|
|||
/// `BTreeSet` that observed the logic error and not result in undefined behavior. This could
|
||||
/// include panics, incorrect results, aborts, memory leaks, and non-termination.
|
||||
///
|
||||
/// Iterators returned by [`BTreeSet::iter`] produce their items in order, and take worst-case
|
||||
/// Iterators returned by [`BTreeSet::iter`] and [`BTreeSet::into_iter`] produce their items in order, and take worst-case
|
||||
/// logarithmic and amortized constant time per item returned.
|
||||
///
|
||||
/// [`Cell`]: core::cell::Cell
|
||||
|
|
Loading…
Add table
Reference in a new issue