Struct HashStore 

pub struct HashStore { /* private fields */ }

An in-memory hash store that maps digests to file entries.

Supports fast lookup by digest and retrieval of duplicate groups.

Implementations

impl HashStore

pub fn new() -> Self

Create an empty hash store.

pub fn with_capacity(cap: usize) -> Self

Create a hash store with pre-allocated capacity.

pub fn insert(&mut self, entry: HashEntry)

Insert an entry into the store.

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

Check if a digest exists in the store.

pub fn get(&self, digest: &str) -> Option<&[HashEntry]>

Look up entries by digest.

pub fn len(&self) -> usize

Return the total number of entries.

pub fn is_empty(&self) -> bool

Return true if the store is empty.

pub fn unique_count(&self) -> usize

Return the number of unique digests.

pub fn duplicate_groups(&self) -> Vec<(&str, &[HashEntry])>

Return all digest groups that have more than one entry (duplicates).

pub fn duplicate_count(&self) -> usize

Return the number of duplicate entries (entries beyond the first in each group).

pub fn duplicate_bytes(&self) -> u64

Return the total file size of all duplicate entries.

pub fn remove(&mut self, digest: &str) -> Vec<HashEntry>

Remove all entries for a given digest. Returns the removed entries.

pub fn clear(&mut self)

Clear the entire store.

pub fn digests(&self) -> impl Iterator<Item = &str>

Return an iterator over all unique digests.

pub fn dedup_ratio(&self) -> f64

Return deduplication ratio as a fraction.

1.0 means no duplicates, lower means more duplication.

Trait Implementations

impl Default for HashStore

fn default() -> Self

Returns the “default value” for a type.