pub struct Winners {
pub smallest: Option<usize>,
pub fastest_compress: Option<usize>,
pub fastest_decompress: Option<usize>,
pub balance: Option<usize>,
pub least_memory: Option<usize>,
}Expand description
Indices into the rows slice, one per column; None when no row succeeded.
Fields§
§smallest: Option<usize>§fastest_compress: Option<usize>§fastest_decompress: Option<usize>§balance: Option<usize>§least_memory: Option<usize>Smallest max(compress, decompress) memory, among rows with both.
Trait Implementations§
impl Copy for Winners
impl Eq for Winners
impl StructuralPartialEq for Winners
Auto Trait Implementations§
impl Forget for Winners
impl Freeze for Winners
impl RefUnwindSafe for Winners
impl Send for Winners
impl Sync for Winners
impl Unpin for Winners
impl UnsafeUnpin for Winners
impl UnwindSafe for Winners
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,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.