Struct FetchAll 

pub struct FetchAll<T = String> { /* private fields */ }

The stream returned by Client::fetch_all: an unordered, completion-order stream of FetchResult, exactly one per input URL, that ends once every URL has settled.

Memory is O(concurrency), not O(count): a background feeder pulls the input lazily and submits into the worker pool’s bounded queue, so at most ~C URLs and ~C bodies are ever live — flat whether the input is a thousand URLs or a hundred million. Termination is driven by the results channel closing (every job’s sender clone dropped), never by total; total is for the progress display only, so a mis-sized size_hint degrades the ETA but never the end-of-stream.

Dropping a FetchAll early aborts the feeder and drops the results channel; in-flight workers then find the channel closed and discard their results instead of blocking forever.

Implementations

impl<T> FetchAll<T>

pub fn with_total(self, n: usize) -> Self

Supply a total when the source can’t size itself (a cursor, from_fn, an async stream). Sized inputs (ranges, vecs, maps) set it automatically from the iterator’s upper bound.

pub fn total(&self) -> Option<usize>

The expected number of results, if known — for progress display only (see the type docs).

Trait Implementations

impl<T> Drop for FetchAll<T>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.

impl<T> Stream for FetchAll<T>

type Item = FetchResult<T>

Values yielded by the stream.

fn poll_next( self: Pin<&mut Self>, cx: &mut TaskContext<'_>, ) -> Poll<Option<FetchResult<T>>>

Attempt to pull out the next value of this stream, registering the current task for wakeup if the value is not yet available, and returning None if the stream is exhausted.

fn size_hint(&self) -> (usize, Option<usize>)

Returns the bounds on the remaining length of the stream.