Struct RecursiveTask 

pub struct RecursiveTask {
    pub rows: BlockRange,
    pub cols: BlockRange,
}

Task for cache-oblivious recursive algorithm.

This represents a subproblem in a recursive decomposition.

Fields

rows: BlockRange

Row range

cols: BlockRange

Column range

Implementations

impl RecursiveTask

pub const fn new(rows: BlockRange, cols: BlockRange) -> Self

Creates a new recursive task.

pub const fn from_dims(m: usize, n: usize) -> Self

Creates a task for an m×n matrix.

pub fn size(&self) -> usize

Returns the number of elements in this task.

pub fn is_base_case(&self, threshold: usize) -> bool

Returns true if this is a base case.

pub fn split(&self) -> (Self, Self)

Splits along the larger dimension.

Returns two subtasks by splitting the larger dimension in half.

pub fn quadrants(&self) -> (Self, Self, Self, Self)

Quadrant decomposition for 2D recursive algorithms.

Returns (top_left, top_right, bottom_left, bottom_right).

Trait Implementations

impl Clone for RecursiveTask

fn clone(&self) -> RecursiveTask

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RecursiveTask

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

Formats the value using the given formatter.

impl Copy for RecursiveTask