#[non_exhaustive]pub enum EmptyCellPolicy {
SplitHighestDistortion,
FailClosed,
}Expand description
Empty-cell handling during Lloyd-Max refinement.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
SplitHighestDistortion
Split the occupied cell with highest distortion.
FailClosed
Fail if any cell is empty.
Trait Implementations§
Source§impl Clone for EmptyCellPolicy
impl Clone for EmptyCellPolicy
Source§fn clone(&self) -> EmptyCellPolicy
fn clone(&self) -> EmptyCellPolicy
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for EmptyCellPolicy
impl Debug for EmptyCellPolicy
Source§impl<'de> Deserialize<'de> for EmptyCellPolicy
impl<'de> Deserialize<'de> for EmptyCellPolicy
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl PartialEq for EmptyCellPolicy
impl PartialEq for EmptyCellPolicy
Source§fn eq(&self, other: &EmptyCellPolicy) -> bool
fn eq(&self, other: &EmptyCellPolicy) -> bool
Tests for
self and other values to be equal, and is used by ==.Source§impl Serialize for EmptyCellPolicy
impl Serialize for EmptyCellPolicy
impl Eq for EmptyCellPolicy
impl StructuralPartialEq for EmptyCellPolicy
Auto Trait Implementations§
impl Freeze for EmptyCellPolicy
impl RefUnwindSafe for EmptyCellPolicy
impl Send for EmptyCellPolicy
impl Sync for EmptyCellPolicy
impl Unpin for EmptyCellPolicy
impl UnsafeUnpin for EmptyCellPolicy
impl UnwindSafe for EmptyCellPolicy
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<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.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.