Struct tvix_store::pathinfoservice::combinators::Cache

pub struct Cache<PS1, PS2> {
    near: PS1,
    far: PS2,
}

Asks near first, if not found, asks far. If found in there, returns it, and inserts it into near. There is no negative cache. Inserts and listings are not implemented for now.

Fields

near: PS1

far: PS2

Implementations

impl<PS1, PS2> Cache<PS1, PS2>

pub fn new(near: PS1, far: PS2) -> Self

Trait Implementations

impl<PS1, PS2> PathInfoService for Cache<PS1, PS2>

where PS1: PathInfoService, PS2: PathInfoService,

fn get<'life0, 'async_trait>( &'life0 self, digest: [u8; 20] ) -> Pin<Box<dyn Future<Output = Result<Option<PathInfo>, Error>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Retrieve a PathInfo message by the output digest.

fn put<'life0, 'async_trait>( &'life0 self, _path_info: PathInfo ) -> Pin<Box<dyn Future<Output = Result<PathInfo, Error>> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Store a PathInfo message. Implementations MUST call validate and reject invalid messages.

fn list(&self) -> BoxStream<'static, Result<PathInfo, Error>>

Iterate over all PathInfo objects in the store. Implementations can decide to disallow listing.

fn nar_calculation_service(&self) -> Option<Box<dyn NarCalculationService>>