pub enum DivisorKind {
Whole,
WholeLossy,
Fractional,
}Expand description
Which arithmetic the validator uses for a multipleOf divisor. A rewrite that moves a divisor
between kinds can change verdicts, so only same-kind rewrites preserve membership.
Variants§
Whole
Integer instances take exact integer modulo.
WholeLossy
A whole divisor past the exact-modulo guard, where instances go through f64 remainder.
Fractional
Every instance goes through rational division.
Trait Implementations§
Source§impl Clone for DivisorKind
impl Clone for DivisorKind
Source§fn clone(&self) -> DivisorKind
fn clone(&self) -> DivisorKind
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 moreimpl Copy for DivisorKind
Source§impl Debug for DivisorKind
impl Debug for DivisorKind
impl Eq for DivisorKind
Source§impl PartialEq for DivisorKind
impl PartialEq for DivisorKind
impl StructuralPartialEq for DivisorKind
Auto Trait Implementations§
impl Freeze for DivisorKind
impl RefUnwindSafe for DivisorKind
impl Send for DivisorKind
impl Sync for DivisorKind
impl Unpin for DivisorKind
impl UnsafeUnpin for DivisorKind
impl UnwindSafe for DivisorKind
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