Struct PrStatusCache 

pub struct PrStatusCache { /* private fields */ }

The poller-written, snapshot-read badge cache.

A plain std::Mutex map: writes come from the poll loop, reads from the tree snapshot build. The lock is never held across an .await — every method takes it, finishes, and drops it.

Implementations

impl PrStatusCache

pub fn new() -> Self

An empty cache. Until the first poll lands, every lookup misses and the tree simply renders no badge.

pub fn get(&self, owner: &str, name: &str, branch: &str) -> Option<PrBadge>

The badge for one (repo, branch), if resolved.

pub fn replace(&self, next: HashMap<PrTarget, PrBadge>) -> bool

Replaces the cache wholesale, returning whether anything actually changed.

The bool is load-bearing: the caller bumps the registry’s change-notify only when it is true. Bumping unconditionally would defeat the server’s diff-and-drop and re-push an identical snapshot to every window on every poll — the cost this whole design exists to avoid.

pub fn any_pending(&self) -> bool

Whether any cached badge is still pending — the poller’s cadence signal.

Trait Implementations

impl Debug for PrStatusCache

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

Formats the value using the given formatter.

impl Default for PrStatusCache

fn default() -> PrStatusCache

Returns the “default value” for a type.