Struct CacheFriendlyState 

pub struct CacheFriendlyState {
    pub interleaved_buffers: HashMap<usize, Vec<f32>>,
    pub param_metadata: HashMap<usize, ParameterMetadata>,
    pub step: usize,
    pub cache_config: CacheConfig,
}

Cache-friendly memory layout for optimizer state.

This structure organizes optimizer state data to maximize cache utilization by grouping frequently accessed data together.

Fields

interleaved_buffers: HashMap<usize, Vec<f32>>

Interleaved momentum and variance data for cache efficiency Format: [momentum[i], variance[i], momentum[i+1], variance[i+1], …]

param_metadata: HashMap<usize, ParameterMetadata>

Parameter metadata for efficient access

step: usize

Current step counter

cache_config: CacheConfig

Cache configuration

Implementations

impl CacheFriendlyState

pub fn new(cache_config: CacheConfig) -> Self

Creates a new cache-friendly state with the given configuration.

pub fn allocate_parameter(&mut self, param_id: usize, size: usize) -> Result<()>

Allocates buffers for a parameter with optimal memory layout.

pub fn get_interleaved_buffer_mut( &mut self, param_id: usize, ) -> Option<(&mut [f32], usize)>

Gets direct access to interleaved buffer for efficient in-place operations.

pub fn get_buffers_mut( &mut self, param_id: usize, ) -> Option<(Vec<f32>, Vec<f32>)>

Gets momentum and variance slices for a parameter (backward compatibility). Note: This creates temporary vectors and is less efficient than get_interleaved_buffer_mut.

pub fn update_buffers( &mut self, param_id: usize, momentum: &[f32], variance: &[f32], ) -> Result<()>

Updates interleaved buffers with new momentum and variance values.

pub fn garbage_collect(&mut self, access_threshold: usize)

Clears unused buffers to free memory.

Trait Implementations

impl Debug for CacheFriendlyState

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

Formats the value using the given formatter.