Struct Ram 

pub struct Ram { /* private fields */ }

Parameters for the Rapid Asymmetric Maximum (RAM) chunking algorithm

Is window free, with very small (

Implementations

impl Ram

pub fn with_w(w: u64) -> Self

Construct a RAM instance with window size w

w is also the minimum block size

Trait Implementations

impl Chunk for Ram

type SearchState = RamState

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 Ram

fn clone(&self) -> Ram

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Ram

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

Formats the value using the given formatter.

impl From<&Ram> for RamIncr

fn from(params: &Ram) -> Self

Converts to this type from the input type.

impl PartialEq for Ram

fn eq(&self, other: &Ram) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl ToChunkIncr for Ram

type Incr = RamIncr

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.

impl Eq for Ram

impl StructuralPartialEq for Ram