pub struct FastCdc<'a> { /* private fields */ }
Expand description
An instance of the “FastCDC” algorithm
Default parameters:
- Minimum chunk size: 2 KiB
- Maximum chunk size: 64 KiB
- Normal size: 8 KiB
- internal 64-bit gear table:
super::gear_table::GEAR_64
Implementations§
Trait Implementations§
Source§impl<'a> Chunk for FastCdc<'a>
impl<'a> Chunk for FastCdc<'a>
Source§type SearchState = FastCdcState
type SearchState = FastCdcState
SearchState
allows searching for the chunk edge to resume without duplicating work
already done.Source§fn to_search_state(&self) -> Self::SearchState
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
].Source§fn find_chunk_edge(
&self,
state: &mut Self::SearchState,
data: &[u8],
) -> (Option<usize>, usize)
fn find_chunk_edge( &self, state: &mut Self::SearchState, data: &[u8], ) -> (Option<usize>, usize)
Find the next “chunk” in
data
to emit Read moreSource§impl<'a> From<&FastCdc<'a>> for FastCdcIncr<'a>
impl<'a> From<&FastCdc<'a>> for FastCdcIncr<'a>
Source§impl<'a> ToChunkIncr for FastCdc<'a>
impl<'a> ToChunkIncr for FastCdc<'a>
Source§type Incr = FastCdcIncr<'a>
type Incr = FastCdcIncr<'a>
Incr
provides the incrimental interface to this chunking instanceimpl<'a> Copy for FastCdc<'a>
impl<'a> Eq for FastCdc<'a>
Auto Trait Implementations§
impl<'a> Freeze for FastCdc<'a>
impl<'a> RefUnwindSafe for FastCdc<'a>
impl<'a> Send for FastCdc<'a>
impl<'a> Sync for FastCdc<'a>
impl<'a> Unpin for FastCdc<'a>
impl<'a> UnwindSafe for FastCdc<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more