Struct ImageCache 

pub struct ImageCache { /* private fields */ }

Implementations

impl ImageCache

pub fn new(root: PathBuf) -> Self

pub fn read(&self, key: &str) -> Option<Vec<u8>>

pub fn contains(&self, key: &str) -> bool

pub async fn get_or_fetch(&self, key: &str) -> Option<Vec<u8>>

pub async fn preseed(&self, keys: &[String]) -> PreseedResult

pub fn check_room_for(&self, estimate_bytes: u64) -> Result<(), String>

The estimate comes from the caller: the per-variant sizes are measured in the UI and a second copy here could disagree.

pub fn stats(&self) -> CacheStats

pub fn reconcile(&self)

The one full walk, at startup, and the only place .part files left by a cancelled download are swept.

pub fn clear(&self, include_pinned: bool) -> Result<(), String>

pub fn unpin_all(&self)

Drops the mark without deleting: the art stays until it loses on age.

impl ImageCache

pub async fn download_all( &self, variants: &[String], estimate_bytes: u64, progress: impl Fn(BulkProgress), ) -> Result<PreseedResult, String>

Fetches every card’s art at the given variants, pinning as it goes. Resumable by design: what is already on disk is skipped, so a cancelled run picks up where it stopped. progress is called roughly every 25 cards and at the end, so a caller can render it however it likes.