#[non_exhaustive]pub enum SplitKind {
DeepestNesting,
LargestSubblock,
HighestBranchCount,
}Expand description
Which strategy produced a ProposedSplit. Priority order
DeepestNesting > HighestBranchCount > LargestSubblock is enforced
at dedup time. The default variant is DeepestNesting because that
is the highest-priority strategy and the most useful candidate when
only one is needed.
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.
Implementations§
Trait Implementations§
Source§impl<'de> Deserialize<'de> for SplitKind
impl<'de> Deserialize<'de> for SplitKind
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
impl Copy for SplitKind
impl Eq for SplitKind
impl StructuralPartialEq for SplitKind
Auto Trait Implementations§
impl Freeze for SplitKind
impl RefUnwindSafe for SplitKind
impl Send for SplitKind
impl Sync for SplitKind
impl Unpin for SplitKind
impl UnsafeUnpin for SplitKind
impl UnwindSafe for SplitKind
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.