Struct Layout 

pub struct Layout { /* private fields */ }

Validated, ordered CPU topology used to map one exact startup resource per worker.

Implementations

impl Layout

pub fn pinned(cpus: impl IntoIterator<Item = Cpu>) -> Result<Self, Error>

pub fn count(&self) -> NonZeroUsize

pub fn try_assign<I, R>(self, items: R) -> Result<Runtime<I>, Error>

where R: IntoIterator<Item = I>, R::IntoIter: ExactSizeIterator,

Assigns exactly one affine input to each CPU, in topology order.

pub fn try_map<T, I, R>( self, items: R, issue: impl Fn(T) -> I, ) -> Result<Runtime<I>, Error>

where R: IntoIterator<Item = T>, R::IntoIter: ExactSizeIterator,

Consumes exactly one affine resource for each CPU, in topology order.

pub fn try_fork<O, T, I, E, R>( self, owner: O, items: R, issue: impl Fn(&O, T) -> Result<I, E>, finish: impl FnOnce(O, T) -> I, ) -> Result<Runtime<I>, Error<E>>

where R: IntoIterator<Item = T>, R::IntoIter: ExactSizeIterator,

Replicates prior inputs and moves the original owner into the final CPU.