Struct BlockRange 

pub struct BlockRange {
    pub start: usize,
    pub end: usize,
}

Recursive block range for cache-oblivious algorithms.

This structure represents a range that can be recursively split for divide-and-conquer algorithms.

Fields

start: usize

Start index (inclusive)

end: usize

End index (exclusive)

Implementations

impl BlockRange

pub const fn new(start: usize, end: usize) -> Self

Creates a new block range.

pub const fn from_len(n: usize) -> Self

Creates a range from 0 to n.

pub const fn len(&self) -> usize

Returns the length of this range.

pub const fn is_empty(&self) -> bool

Returns true if this range is empty.

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

Returns true if this range is a base case (should not be split further).

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

Splits this range in half.

Returns (left_half, right_half).

pub fn split_at(&self, point: usize) -> (Self, Self)

Splits at a specific point.

Trait Implementations

impl Clone for BlockRange

fn clone(&self) -> BlockRange

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BlockRange

impl Debug for BlockRange

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

Formats the value using the given formatter.