Struct TileCache 

pub struct TileCache {
    pub max_entries: usize,
    pub max_bytes: u64,
    pub current_bytes: u64,
    pub hit_count: u64,
    pub miss_count: u64,
    pub eviction_count: u64,
    /* private fields */
}

LRU tile cache with entry-count and byte-budget eviction.

Entries at the back of access_order are most recently used; the front is evicted first.

Fields

max_entries: usize

Maximum number of entries before LRU eviction.

max_bytes: u64

Maximum total bytes before LRU eviction.

current_bytes: u64

Current total bytes of cached tile data.

hit_count: u64

Cumulative cache hits.

miss_count: u64

Cumulative cache misses.

eviction_count: u64

Cumulative evictions.

Implementations

impl TileCache

pub fn new(max_entries: usize, max_bytes: u64) -> Self

Creates a new TileCache with the given capacity limits.

pub fn get(&mut self, key: &TileKey, now: u64) -> Option<&CachedTile>

Looks up key in the cache. On a hit the access metadata is updated and the key is promoted to the back of the LRU queue.

pub fn insert(&mut self, tile: CachedTile)

Inserts tile into the cache, evicting LRU entries as needed.

pub fn invalidate(&mut self, key: &TileKey) -> bool

Removes key from the cache. Returns true if the entry existed.

pub fn invalidate_layer(&mut self, layer: &str) -> u64

Removes all tiles belonging to layer. Returns the number of entries removed.

pub fn invalidate_zoom_range(&mut self, min_z: u8, max_z: u8) -> u64

Removes all tiles whose zoom level falls within [min_z, max_z]. Returns the number of entries removed.

pub fn hit_rate(&self) -> f64

Returns the cache hit rate in [0.0, 1.0], or 0.0 if no requests.

pub fn stats(&self) -> CacheStats

Returns a snapshot of current cache statistics.