Struct L1Cache 

pub struct L1Cache { /* private fields */ }

L1 cache implementation with special-token-boundary prefix matching

Implementations

impl L1Cache

pub fn new(max_memory: usize) -> Self

Create a new L1 cache with the specified memory limit

pub fn longest_prefix_match( &self, input: &str, special_tokens: &[&str], ) -> Option<(Vec<TokenIdType>, usize)>

Try to find the longest prefix match at special token boundaries Returns (cached_tokens, byte_offset) if found

Uses pre-computed tokens cached during insertion. Returns Vec as the caller needs to extend it with suffix tokens.

pub fn insert_at_boundaries<E: Encoder + ?Sized>( &self, input: &str, tokenizer: &E, special_tokens: &[&str], add_special_tokens: bool, ) -> Result<()>

Insert prefix entries at ALL special token boundaries

Uses incremental hashing and tokenization for O(N) performance.

Optimized for workloads with high prefix reuse (e.g., chat templates with repeated system prompts).

pub fn len(&self) -> usize

Get the number of entries in the cache

pub fn is_empty(&self) -> bool

Check if the cache is empty

pub fn stats(&self) -> L1CacheStats

Get cache statistics

pub fn clear(&self)

Clear the cache