Trait AsyncIterator
trait AsyncIterator
A trait for dealing with asynchronous iterators.
This is the main async iterator trait. For more about the concept of async iterators
generally, please see the module-level documentation. In particular, you
may want to know how to implement AsyncIterator.
Associated Types
type ItemThe type of items yielded by the async iterator.
Required Methods
fn poll_next(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Option<<Self as >::Item>>Attempts to pull out the next value of this async iterator, registering the current task for wakeup if the value is not yet available, and returning
Noneif the async iterator is exhausted.Return value
There are several possible return values, each indicating a distinct async iterator state:
-
Poll::Pendingmeans that this async iterator's next value is not ready yet. Implementations will ensure that the current task will be notified when the next value may be ready. -
Poll::Ready(Some(val))means that the async iterator has successfully produced a value,val, and may produce further values on subsequentpoll_nextcalls. -
Poll::Ready(None)means that the async iterator has terminated, andpoll_nextshould not be invoked again.
Panics
Once an async iterator has finished (returned
Ready(None)frompoll_next), calling itspoll_nextmethod again may panic, block forever, or cause other kinds of problems; theAsyncIteratortrait places no requirements on the effects of such a call. However, as thepoll_nextmethod is not markedunsafe, Rust's usual rules apply: calls must never cause undefined behavior (memory corruption, incorrect use ofunsafefunctions, or the like), regardless of the async iterator's state.-
Provided Methods
fn size_hint(self: &Self) -> (usize, Option<usize>)Returns the bounds on the remaining length of the async iterator.
Specifically,
size_hint()returns a tuple where the first element is the lower bound, and the second element is the upper bound.The second half of the tuple that is returned is an
[Option]<[usize]>. ANonehere means that either there is no known upper bound, or the upper bound is larger thanusize.Implementation notes
It is not enforced that an async iterator implementation yields the declared number of elements. A buggy async iterator may yield less than the lower bound or more than the upper bound of elements.
size_hint()is primarily intended to be used for optimizations such as reserving space for the elements of the async iterator, but must not be trusted to e.g., omit bounds checks in unsafe code. An incorrect implementation ofsize_hint()should not lead to memory safety violations.That said, the implementation should provide a correct estimation, because otherwise it would be a violation of the trait's protocol.
The default implementation returns
(0, [None])which is correct for any async iterator.
Implementors
impl<S: ?Sized + AsyncIterator + Unpin> AsyncIterator for &mut Simpl<P> AsyncIterator for Pin<P>impl<I: Iterator> AsyncIterator for FromIter<I>impl<S: AsyncIterator> AsyncIterator for AssertUnwindSafe<S>