Struct Partitioning 

pub struct Partitioning { /* private fields */ }

A space with the levels that partition it, outermost first: what a kernel’s loops iterate.

Implementations

impl Partitioning

pub fn arrival_counters(&self) -> usize

The arrival counters a LastArrival under this partitioning counts its runs in through: one u32 a box of its shared cube level, holding zero.

pub fn arrival_slots(&self, axes: &[Axis]) -> Shape

The shape of a LastArrival’s slots for an output over axes, in that order: two cube boxes a run of the shared cube level, stacked along the first of axes.

impl Partitioning

pub fn relay_counters(&self) -> usize

The turn counters a Relay under this partitioning passes its boxes on through: one u32 a cube, holding zero.

impl Partitioning

pub fn levels(&self) -> &[Level]

The levels, outermost first.

pub fn level(&self, i: usize) -> Level

Level i, outermost first.

impl Partitioning

pub fn walk(&self) -> Walk

The regions of the first level: what for cube in space iterates.

pub fn over(&self, level: &Level) -> Walk

The regions of level over this space, a level of the kernel’s own.

pub fn __expand_walk( scope: &Scope, this: &<Self as CubeType>::ExpandType, ) -> <Walk as CubeType>::ExpandType

The regions of the first level: what for cube in space iterates.

pub fn __expand_over( scope: &Scope, this: &<Self as CubeType>::ExpandType, level: &Level, ) -> <Walk as CubeType>::ExpandType

The regions of level over this space, a level of the kernel’s own.

impl Partitioning

pub fn new(space: Space, levels: Vec<Level>) -> Self

space cut by levels, outermost first. Panics where two levels distribute over one scope: a scope’s instances take one level’s tiles.

pub fn space(&self) -> &Space

The space these levels cut.

pub fn all_dynamic(self) -> Self

This partitioning with every extent Dynamic.

pub fn table<'a>(&'a self, labels: &'a [(Axis, &'a str)]) -> LevelTable<'a>

This partitioning’s table with a name for each axis; unnamed axes print their index.

pub fn leaf(&self) -> Space

The leaf the levels reach.

pub fn overhangs(&self, axis: Axis) -> bool

Whether some level’s edge fails to divide the extent of axis handed to it.

pub fn level_distributed(&self, scope: ComputeScope) -> Option<&Level>

The one level distributed over scope’s workers, if any.

pub fn box_of(&self, scope: ComputeScope) -> Space

The box one of scope’s instances covers: the space cut down through the level distributed over it. Panics where no level distributes over scope.

pub fn walks(&self) -> impl Iterator<Item = &Level> + '_

The levels one instance walks, outermost first.

pub fn cube_count(&self) -> CubeCount

The cube grid these levels distribute to.

pub fn planes_per_cube(&self) -> u32

Planes one cube holds: the levels’ plane cuts, each plane group’s planes, plus any that only fill; where the planes or units span the launch, the cubes their order groups them in.

pub fn fillers(&self) -> u32

Planes the cube holds that fill a walk’s stages and take no tile (Levels::filled_by).

pub fn units(&self) -> u32

Units one instance holds; 1 where no level cuts to units or they take tiles in turns.

pub fn cube_dim(&self, plane_size: u32) -> CubeDim

The cube this partitioning asks for at plane_size; where the units span the launch, the cube they are grouped in, whatever plane_size.

pub fn unit_cube(&self) -> Option<UnitCube>

The cubes the launch’s units are grouped in, where a unit level spans the launch.

Trait Implementations

impl Clone for Partitioning

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl CubeType for Partitioning

type ExpandType = PartitioningExpand

impl Debug for Partitioning

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Partitioning

Prints the table with no axis named; see Partitioning::table.

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for Partitioning

impl Hash for Partitioning

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl IntoIterator for Partitioning

Host-side stand-in for for plane in space; never runs.

type Item = Region

The type of the elements being iterated over.

type IntoIter = IntoIter<Region>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for &Partitioning

type Item = Region

The type of the elements being iterated over.

type IntoIter = IntoIter<Region>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl LaunchArg for Partitioning

type RuntimeArg = PartitioningLaunch

The runtime argument for the kernel.

type CompilationArg = PartitioningCompilationArg

Compilation argument.

fn register( arg: Self::RuntimeArg, launcher: &mut KernelLauncher, ) -> Self::CompilationArg

fn expand( arg: &Self::CompilationArg, builder: &mut KernelBuilder, ) -> <Self as CubeType>::ExpandType

Register a variable during compilation that fill the KernelBuilder.

impl PartialEq for Partitioning

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Partitioning