Struct hash_roll::mii::Mii

pub struct Mii { /* fields omitted */ }

C. Zhang et al., "MII: A Novel Content Defined Chunking Algorithm for Finding Incremental Data in Data Synchronization," in IEEE Access, vol. 7, pp. 86932-86945, 2019, doi: 10.1109/ACCESS.2019.2926195.

https://ieeexplore.ieee.org/abstract/document/8752387

Implementations

impl Mii

pub fn with_w(w: u64) -> Self

Create a new splitter with parameter w

w is the number of "increments" (positive changes in byte value) after which we split the input

Trait Implementations

impl Chunk for Mii

type SearchState = MiiSearchState

SearchState allows searching for the chunk edge to resume without duplicating work already done.

fn to_search_state(&self) -> Self::SearchState

Provide an initial [SearchState] for use with [find_chunk_edge()]. Generally, for each input one should generate a new [SearchState].

fn find_chunk_edge(
    &self,
    state: &mut Self::SearchState,
    data: &[u8]
) -> (Option<usize>, usize)

Find the next "chunk" in data to emit

impl Clone for Mii

fn clone(&self) -> Mii

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Mii

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

Formats the value using the given formatter.

impl Default for Mii

fn default() -> Self

The window of 5 is used in the paper for the generated graphs

It is compared against Rabin with a window of 7 and AE/LMC/RAM with a window of 700

impl<'_> From<&'_ Mii> for MiiIncr

fn from(src: &Mii) -> Self

Performs the conversion.

impl From<Mii> for MiiIncr

fn from(p: Mii) -> Self

Performs the conversion.

impl ToChunkIncr for Mii

type Incr = MiiIncr

Incr provides the incrimental interface to this chunking instance

fn to_chunk_incr(&self) -> Self::Incr

to_chunk_incr() returns a ChunkIncr which can be incrimentally fed data and emits chunks.