Struct TaskMap 

pub struct TaskMap<T> { /* private fields */ }

A set of named tasks to run concurrently.

T is the success result type — all tasks in a TaskMap produce the same T. For heterogeneous batches, use tokio::join! directly.

Implementations

impl<T> TaskMap<T>

pub fn new() -> Self

Create an empty task map.

pub fn insert<F, Fut, E>(self, name: &'static str, task: F) -> Self

where F: FnOnce(CancellationToken) -> Fut + Send + 'static, Fut: Future<Output = Result<T, E>> + Send + 'static, E: Into<Box<dyn Error + Send + Sync>>, T: Send + 'static,

Insert a named task into the map.

The closure receives the active CancellationToken and must return a future producing Result<T, E> where E can be boxed into a std::error::Error.

Duplicate names

Backed by BTreeMap::insert — calling insert twice with the same name silently overwrites the earlier task (“last write wins”). If you need duplicate-name detection, check .len() before/after the second insert or use distinct names.

pub fn len(&self) -> usize

Return the number of tasks currently in the map.

pub fn is_empty(&self) -> bool

Return true if no tasks have been inserted.

Trait Implementations

impl<T> Default for TaskMap<T>

fn default() -> Self

Returns the “default value” for a type.