Struct DigestMap 

pub struct DigestMap<ObjectID: FsVerityHashValue> {
    pub map: Vec<DigestMapEntry<ObjectID>>,
}

A map of content digests to object IDs, maintained in sorted order for binary search.

Fields

map: Vec<DigestMapEntry<ObjectID>>

Vector of digest map entries, kept sorted by body hash

Implementations

impl<ObjectID: FsVerityHashValue> DigestMap<ObjectID>

pub fn new() -> Self

Creates a new empty digest map.

pub fn lookup(&self, body: &Sha256Digest) -> Option<&ObjectID>

Looks up an object ID by its content SHA256 hash.

Returns the object ID if found, or None if not present in the map.

pub fn insert(&mut self, body: &Sha256Digest, verity: &ObjectID)

Inserts a new digest mapping, maintaining sorted order.

If the body hash already exists, asserts that the verity ID matches.

Trait Implementations

impl<ObjectID: Debug + FsVerityHashValue> Debug for DigestMap<ObjectID>

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

Formats the value using the given formatter.

impl<ObjectID: FsVerityHashValue> Default for DigestMap<ObjectID>

fn default() -> Self

Returns the “default value” for a type.