Struct MemNarRefIndex 

pub struct MemNarRefIndex { /* private fields */ }

In-memory NarRefIndex — the reference semantics, and what every test double uses.

Exported rather than test-only on purpose: a StorageBackend double that has to hand-roll an index will hand-roll it differently, and a double whose reverse index disagrees with production’s is a gate that proves nothing.

Implementations

impl MemNarRefIndex

pub fn new() -> MemNarRefIndex

An empty index.

pub fn len(&self) -> usize

Total edge count, across every NAR. Diagnostics and gates.

pub fn is_empty(&self) -> bool

Whether the index holds no edges at all.

Trait Implementations

impl Debug for MemNarRefIndex

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

Formats the value using the given formatter.

impl Default for MemNarRefIndex

fn default() -> MemNarRefIndex

Returns the “default value” for a type.

impl NarRefIndex for MemNarRefIndex

fn record<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, nar_path: &'life1 str, hash: &'life2 str, ) -> Pin<Box<dyn Future<Output = Result<(), StoreError>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, MemNarRefIndex: 'async_trait,

Record “hash’s narinfo advertises nar_path”. Idempotent.

fn forget<'life0, 'life1, 'life2, 'async_trait>( &'life0 self, nar_path: &'life1 str, hash: &'life2 str, ) -> Pin<Box<dyn Future<Output = Result<(), StoreError>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, MemNarRefIndex: 'async_trait,

Forget that edge. Idempotent — forgetting an absent edge is Ok(()).

fn referrers<'life0, 'life1, 'async_trait>( &'life0 self, nar_path: &'life1 str, ) -> Pin<Box<dyn Future<Output = Result<Vec<String>, StoreError>> + Send + 'async_trait>>

where 'life0: 'async_trait, 'life1: 'async_trait, MemNarRefIndex: 'async_trait,

Every store-path hash whose narinfo advertises nar_path, sorted and deduplicated.