pub struct CompressionEngine { /* private fields */ }Expand description
Compression engine with adaptive algorithm selection
Implementations§
Source§impl CompressionEngine
impl CompressionEngine
Sourcepub fn new(config: CompressionConfig) -> Self
pub fn new(config: CompressionConfig) -> Self
Create a new compression engine
Sourcepub fn compress(&mut self, data: &[u8]) -> SnapshotResult<CompressionResult>
pub fn compress(&mut self, data: &[u8]) -> SnapshotResult<CompressionResult>
Compress data using optimal algorithm
Sourcepub fn decompress(
&self,
data: &[u8],
info: &CompressionInfo,
) -> SnapshotResult<Vec<u8>>
pub fn decompress( &self, data: &[u8], info: &CompressionInfo, ) -> SnapshotResult<Vec<u8>>
Decompress data
Sourcepub fn select_optimal_algorithm(
&self,
data: &[u8],
) -> SnapshotResult<CompressionAlgorithm>
pub fn select_optimal_algorithm( &self, data: &[u8], ) -> SnapshotResult<CompressionAlgorithm>
Select optimal compression algorithm for data
Sourcepub fn compress_with_algorithm(
&mut self,
data: &[u8],
algorithm: CompressionAlgorithm,
) -> SnapshotResult<CompressionResult>
pub fn compress_with_algorithm( &mut self, data: &[u8], algorithm: CompressionAlgorithm, ) -> SnapshotResult<CompressionResult>
Compress with specific algorithm
Sourcepub fn analyze_data(&self, data: &[u8]) -> DataCharacteristics
pub fn analyze_data(&self, data: &[u8]) -> DataCharacteristics
Analyze data characteristics for algorithm selection
Sourcepub fn stats(&self) -> &CompressionStats
pub fn stats(&self) -> &CompressionStats
Get compression statistics
Sourcepub fn reset_stats(&mut self)
pub fn reset_stats(&mut self)
Reset statistics
Auto Trait Implementations§
impl Freeze for CompressionEngine
impl RefUnwindSafe for CompressionEngine
impl Send for CompressionEngine
impl Sync for CompressionEngine
impl Unpin for CompressionEngine
impl UnsafeUnpin for CompressionEngine
impl UnwindSafe for CompressionEngine
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.