Struct LayoutCache 

pub struct LayoutCache { /* private fields */ }

A memoizing cache of computed layout rectangles.

Implementations

impl LayoutCache

pub fn new() -> Self

Create an empty cache.

pub fn len(&self) -> usize

Number of stored entries.

pub fn is_empty(&self) -> bool

Whether the cache holds no entries.

pub fn hits(&self) -> u64

Cache hit count since creation (or last reset_stats).

pub fn misses(&self) -> u64

Cache miss count since creation (or last reset_stats).

pub fn hit_rate(&self) -> f32

Hit rate in [0, 1]; 0 when there have been no accesses.

pub fn reset_stats(&mut self)

Reset the hit/miss counters (leaves entries intact).

pub fn get( &mut self, id: WidgetId, avail: Size, content_hash: u64, ) -> Option<Rect>

Look up the cached rect for (id, avail, content_hash).

Returns None (a miss) when there is no matching entry or when id is currently marked dirty. Updates the hit/miss counters.

pub fn put(&mut self, id: WidgetId, avail: Size, content_hash: u64, rect: Rect)

Store the computed rect for (id, avail, content_hash), clearing any dirty flag on id (it is now freshly computed).

pub fn invalidate(&mut self, id: WidgetId)

Mark id dirty so its next get misses regardless of key. The stale entries are dropped immediately to bound memory.

pub fn invalidate_many(&mut self, ids: impl IntoIterator<Item = WidgetId>)

Mark several nodes dirty at once (e.g. an invalidated subtree).

pub fn is_dirty(&self, id: WidgetId) -> bool

Whether id is currently flagged dirty.

pub fn clear(&mut self)

Drop every entry and dirty flag (a full layout invalidation).

Trait Implementations

impl Debug for LayoutCache

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

Formats the value using the given formatter.

impl Default for LayoutCache

fn default() -> LayoutCache

Returns the “default value” for a type.