Struct BlockLayout 

pub struct BlockLayout { /* private fields */ }

How a sequence is cut into cache blocks, and the sliding window (if any) those blocks must line up with.

Only constructible through BlockLayout::new, so a BlockLayout value is itself the proof that the alignment rule holds – there is no path that produces a mis-aligned one to be checked later and forgotten.

Implementations

impl BlockLayout

pub fn new( block_size: usize, sliding_window: Option<usize>, ) -> Result<Self, BlockLayoutError>

Validates and builds a layout. sliding_window is None for a full-causal model and Some(w) for one whose sliding layers use window w – including alternating models, where some layers are full-attention: those layers are unconstrained, so the model’s constraint is the window of the layers that have one.

pub fn full_attention(block_size: usize) -> Result<Self, BlockLayoutError>

A full-causal model’s layout. Cannot fail except on a zero block size.

pub fn block_size(&self) -> usize

pub fn sliding_window(&self) -> Option<usize>

pub fn blocks_per_window(&self) -> Option<usize>

How many whole blocks a sliding layer keeps resident. None for a full-causal model, which keeps all of them.

Exact by construction: the layout would not exist if the window were not a whole number of blocks.

Trait Implementations

impl Clone for BlockLayout

fn clone(&self) -> BlockLayout

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BlockLayout

impl Debug for BlockLayout

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

Formats the value using the given formatter.

impl Eq for BlockLayout

impl PartialEq for BlockLayout

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for BlockLayout