Struct KvCachePool 

pub struct KvCachePool { /* private fields */ }

A pool of KV-cache pages.

Pages are fixed-size slabs of f32 data backed by a single Vec per page. The pool uses a simple free-list: allocated pages are handed out by returning their index, and freed pages are pushed back onto the list.

The pool never shrinks — once a page is allocated it lives until the pool is dropped.

Implementations

impl KvCachePool

pub fn new(page_size: usize, initial_pages: usize) -> Self

Create a new pool with initial_pages pre-allocated pages of page_size f32 elements each.

All pages start on the free list, ready for immediate allocation.

pub fn alloc(&mut self) -> Option<usize>

Allocate a page from the free list.

Returns Some(page_idx) on success, or None if the pool is exhausted. The caller must pass the returned index to free when the page is no longer needed.

pub fn free(&mut self, page_idx: usize)

Return page page_idx to the free list.

The page data is not zeroed; callers should zero or overwrite the slice before treating it as a fresh allocation.

Panics

Panics in debug builds if page_idx >= total_pages().

pub fn page(&self, page_idx: usize) -> &[f32]

Get an immutable slice to page page_idx.

Panics

Panics if page_idx >= total_pages().

pub fn page_mut(&mut self, page_idx: usize) -> &mut [f32]

Get a mutable slice to page page_idx.

Panics

Panics if page_idx >= total_pages().

pub fn total_pages(&self) -> usize

Total number of pages ever allocated (including those on the free list).

pub fn free_pages(&self) -> usize

Number of pages currently on the free list (available for allocation).

pub fn used_pages(&self) -> usize

Number of pages currently in use (allocated but not yet freed).

pub fn page_size(&self) -> usize

The number of f32 elements in each page.