Struct Cache 

pub struct Cache<T, K: Tiled = Key> { /* private fields */ }

Painted tiles, keyed by theme, level, column and row, holding at most cap of cost — bytes of pixels, or a count — the least recently used dropped first. Damage marks the tiles it overlaps stale; a stale tile is still there, and says so, until it is painted again. What a tile holds is the cache’s user’s: pixels in the server, a texture on the GPU.

Implementations

impl<T, K: Tiled> Cache<T, K>

pub fn new(cap: usize) -> Cache<T, K>

pub fn get(&mut self, key: &K) -> Option<(&T, bool)>

The tile at key, and whether it is stale; it counts as used.

pub fn peek(&self, key: &K) -> Option<(&T, bool)>

The tile at key and whether it is stale, without counting a use.

pub fn insert(&mut self, key: K, value: T, cost: usize) -> Vec<(K, T)>

Keeps value as the current tile at key, costing cost, and drops the least recently used others until the cache is within its cap. Returns what was dropped.

pub fn remove(&mut self, key: &K) -> Option<T>

Takes the tile at key out.

pub fn damage(&mut self, theme: Theme, origin: (f64, f64), rects: &[KRect])

Marks stale every tile of theme that overlaps one of rects — in the design’s coordinates, the drawing’s top-left at origin — at every level.

pub fn damage_where( &mut self, which: impl Fn(&K) -> bool, origin: (f64, f64), rects: &[KRect], )

Marks stale every tile which picks that overlaps one of rects, as Cache::damage does.

pub fn damage_all(&mut self, theme: Theme)

Marks every tile of theme stale.

pub fn damage_all_where(&mut self, which: impl Fn(&K) -> bool)

Marks every tile which picks stale.

pub fn forget(&mut self, which: impl Fn(&K) -> bool)

Drops every tile which picks.

pub fn iter(&self) -> impl Iterator<Item = (&K, &T, bool)>

Every tile, with whether it is stale.

pub fn clear(&mut self) -> Vec<T>

Drops every tile.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn cost(&self) -> usize

What the tiles held cost together.