pub struct ZipLimits {
pub max_total: u64,
pub max_entry: u64,
pub max_entries: usize,
pub max_ratio: u64,
}Expand description
Container limits.
Fields§
§max_total: u64Maximum total uncompressed size.
max_entry: u64Maximum uncompressed size of one entry.
max_entries: usizeMaximum number of entries.
max_ratio: u64Maximum uncompressed/compressed ratio for deflated entries.
Trait Implementations§
impl Copy for ZipLimits
impl Eq for ZipLimits
impl StructuralPartialEq for ZipLimits
Auto Trait Implementations§
impl Freeze for ZipLimits
impl RefUnwindSafe for ZipLimits
impl Send for ZipLimits
impl Sync for ZipLimits
impl Unpin for ZipLimits
impl UnsafeUnpin for ZipLimits
impl UnwindSafe for ZipLimits
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.impl<T> Scalar for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.