Struct Divisor

pub struct Divisor<T> { /* private fields */ }

Faster divisor for division and modulo operations.

Features

It’s implemented for the integer primitives enabled by the corresponding [capability features][crate:_info::features#capability-features]: _int_i8, _int_i16, _int_i32, _int_i64, _int_i128, _int_isize, _int_u8, _int_u16, _int_u32, _int_u64, _int_u128, _int_usize.

Derived Work

This is derived work from the quickdiv crate, including the following modifications:

• unify all types in a single one with const-generic implementations.
• constructors return Option instead of panicking.
• specific implementations are feature-gated.
• misc. refactoring and code compression.

Implementations

impl Divisor<i8>

Available on crate feature _int_i8 only.

pub const fn new_i8(d: i8) -> Option<Divisor<i8>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: i8) -> Option<Divisor<i8>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let d = Divisor::<i8>::new(-21).unwrap();

pub const fn get(&self) -> i8

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<i8>::new(-15).unwrap();
assert_eq!(d.get(), -15);

pub const fn divides(&self, n: i8) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<i8>::new(-9).unwrap();
assert!(d.divides(27));

pub const fn rem_of(&self, n: i8) -> i8

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<i8>::new(21).unwrap();
let rem = d.rem_of(-30);
assert_eq!(rem, -9);

pub const fn div_of(&self, n: i8) -> i8

Returns the result of dividing n by self.

This will perform a wrapping division, i.e. Divisor::<i8>::new(-1).unwrap().div_of(i8::MIN) will always silently return i8::MIN whether the program was compiled with overflow-checks turned off or not.

Examples

let d = Divisor::<i8>::new(13).unwrap();
let div = d.div_of(-30);
assert_eq!(div, -2);

impl Divisor<i16>

Available on crate feature _int_i16 only.

pub const fn new_i16(d: i16) -> Option<Divisor<i16>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: i16) -> Option<Divisor<i16>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let d = Divisor::<i16>::new(-21).unwrap();

pub const fn get(&self) -> i16

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<i16>::new(-15).unwrap();
assert_eq!(d.get(), -15);

pub const fn divides(&self, n: i16) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<i16>::new(-9).unwrap();
assert!(d.divides(27));

pub const fn rem_of(&self, n: i16) -> i16

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<i16>::new(21).unwrap();
let rem = d.rem_of(-30);
assert_eq!(rem, -9);

pub const fn div_of(&self, n: i16) -> i16

Returns the result of dividing n by self.

This will perform a wrapping division, i.e. Divisor::<i16>::new(-1).unwrap().div_of(i16::MIN) will always silently return i16::MIN whether the program was compiled with overflow-checks turned off or not.

Examples

let d = Divisor::<i16>::new(13).unwrap();
let div = d.div_of(-30);
assert_eq!(div, -2);

impl Divisor<i32>

Available on crate feature _int_i32 only.

pub const fn new_i32(d: i32) -> Option<Divisor<i32>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: i32) -> Option<Divisor<i32>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let d = Divisor::<i32>::new(-21).unwrap();

pub const fn get(&self) -> i32

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<i32>::new(-15).unwrap();
assert_eq!(d.get(), -15);

pub const fn divides(&self, n: i32) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<i32>::new(-9).unwrap();
assert!(d.divides(27));

pub const fn rem_of(&self, n: i32) -> i32

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<i32>::new(21).unwrap();
let rem = d.rem_of(-30);
assert_eq!(rem, -9);

pub const fn div_of(&self, n: i32) -> i32

Returns the result of dividing n by self.

This will perform a wrapping division, i.e. Divisor::<i32>::new(-1).unwrap().div_of(i32::MIN) will always silently return i32::MIN whether the program was compiled with overflow-checks turned off or not.

Examples

let d = Divisor::<i32>::new(13).unwrap();
let div = d.div_of(-30);
assert_eq!(div, -2);

impl Divisor<i64>

Available on crate feature _int_i64 only.

pub const fn new_i64(d: i64) -> Option<Divisor<i64>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: i64) -> Option<Divisor<i64>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let d = Divisor::<i64>::new(-21).unwrap();

pub const fn get(&self) -> i64

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<i64>::new(-15).unwrap();
assert_eq!(d.get(), -15);

pub const fn divides(&self, n: i64) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<i64>::new(-9).unwrap();
assert!(d.divides(27));

pub const fn rem_of(&self, n: i64) -> i64

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<i64>::new(21).unwrap();
let rem = d.rem_of(-30);
assert_eq!(rem, -9);

pub const fn div_of(&self, n: i64) -> i64

Returns the result of dividing n by self.

This will perform a wrapping division, i.e. Divisor::<i64>::new(-1).unwrap().div_of(i64::MIN) will always silently return i64::MIN whether the program was compiled with overflow-checks turned off or not.

Examples

let d = Divisor::<i64>::new(13).unwrap();
let div = d.div_of(-30);
assert_eq!(div, -2);

impl Divisor<i128>

Available on crate feature _int_i128 only.

pub const fn new_i128(d: i128) -> Option<Divisor<i128>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: i128) -> Option<Divisor<i128>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let d = Divisor::<i128>::new(-21).unwrap();

pub const fn get(&self) -> i128

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<i128>::new(-15).unwrap();
assert_eq!(d.get(), -15);

pub const fn divides(&self, n: i128) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<i128>::new(-9).unwrap();
assert!(d.divides(27));

pub const fn rem_of(&self, n: i128) -> i128

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<i128>::new(21).unwrap();
let rem = d.rem_of(-30);
assert_eq!(rem, -9);

pub const fn div_of(&self, n: i128) -> i128

Returns the result of dividing n by self.

This will perform a wrapping division, i.e. Divisor::<i128>::new(-1).unwrap().div_of(i128::MIN) will always silently return i128::MIN whether the program was compiled with overflow-checks turned off or not.

Examples

let d = Divisor::<i128>::new(13).unwrap();
let div = d.div_of(-30);
assert_eq!(div, -2);

impl Divisor<isize>

Available on crate feature _int_isize only.

pub const fn new_isize(d: isize) -> Option<Divisor<isize>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: isize) -> Option<Divisor<isize>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let d = Divisor::<isize>::new(-21).unwrap();

pub const fn get(&self) -> isize

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<isize>::new(-15).unwrap();
assert_eq!(d.get(), -15);

pub const fn divides(&self, n: isize) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<isize>::new(-9).unwrap();
assert!(d.divides(27));

pub const fn rem_of(&self, n: isize) -> isize

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<isize>::new(21).unwrap();
let rem = d.rem_of(-30);
assert_eq!(rem, -9);

pub const fn div_of(&self, n: isize) -> isize

Returns the result of dividing n by self.

This will perform a wrapping division, i.e. Divisor::<isize>::new(-1).unwrap().div_of(isize::MIN) will always silently return isize::MIN whether the program was compiled with overflow-checks turned off or not.

Examples

let d = Divisor::<isize>::new(13).unwrap();
let div = d.div_of(-30);
assert_eq!(div, -2);

impl Divisor<u8>

Available on crate feature _int_u8 only.

pub const fn new_u8(d: u8) -> Option<Divisor<u8>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: u8) -> Option<Divisor<u8>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let _d = Divisor::<u8>::new(5);

pub const fn get(&self) -> u8

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<u8>::new(7).unwrap();
assert_eq!(d.get(), 7);

pub const fn divides(&self, n: u8) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<u8>::new(17).unwrap();
assert!(d.divides(34));

pub const fn rem_of(&self, n: u8) -> u8

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<u8>::new(11).unwrap();
let rem = d.rem_of(30);
assert_eq!(rem, 8);

pub const fn div_of(&self, n: u8) -> u8

Returns the result of dividing n by self.

Examples

let d = Divisor::<u8>::new(17).unwrap();
let div = d.div_of(34);
assert_eq!(div, 2);

impl Divisor<u16>

Available on crate feature _int_u16 only.

pub const fn new_u16(d: u16) -> Option<Divisor<u16>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: u16) -> Option<Divisor<u16>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let _d = Divisor::<u16>::new(5);

pub const fn get(&self) -> u16

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<u16>::new(7).unwrap();
assert_eq!(d.get(), 7);

pub const fn divides(&self, n: u16) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<u16>::new(17).unwrap();
assert!(d.divides(34));

pub const fn rem_of(&self, n: u16) -> u16

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<u16>::new(11).unwrap();
let rem = d.rem_of(30);
assert_eq!(rem, 8);

pub const fn div_of(&self, n: u16) -> u16

Returns the result of dividing n by self.

Examples

let d = Divisor::<u16>::new(17).unwrap();
let div = d.div_of(34);
assert_eq!(div, 2);

impl Divisor<u32>

Available on crate feature _int_u32 only.

pub const fn new_u32(d: u32) -> Option<Divisor<u32>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: u32) -> Option<Divisor<u32>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let _d = Divisor::<u32>::new(5);

pub const fn get(&self) -> u32

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<u32>::new(7).unwrap();
assert_eq!(d.get(), 7);

pub const fn divides(&self, n: u32) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<u32>::new(17).unwrap();
assert!(d.divides(34));

pub const fn rem_of(&self, n: u32) -> u32

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<u32>::new(11).unwrap();
let rem = d.rem_of(30);
assert_eq!(rem, 8);

pub const fn div_of(&self, n: u32) -> u32

Returns the result of dividing n by self.

Examples

let d = Divisor::<u32>::new(17).unwrap();
let div = d.div_of(34);
assert_eq!(div, 2);

impl Divisor<u64>

Available on crate feature _int_u64 only.

pub const fn new_u64(d: u64) -> Option<Divisor<u64>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: u64) -> Option<Divisor<u64>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let _d = Divisor::<u64>::new(5);

pub const fn get(&self) -> u64

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<u64>::new(7).unwrap();
assert_eq!(d.get(), 7);

pub const fn divides(&self, n: u64) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<u64>::new(17).unwrap();
assert!(d.divides(34));

pub const fn rem_of(&self, n: u64) -> u64

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<u64>::new(11).unwrap();
let rem = d.rem_of(30);
assert_eq!(rem, 8);

pub const fn div_of(&self, n: u64) -> u64

Returns the result of dividing n by self.

Examples

let d = Divisor::<u64>::new(17).unwrap();
let div = d.div_of(34);
assert_eq!(div, 2);

impl Divisor<u128>

Available on crate feature _int_u128 only.

pub const fn new_u128(d: u128) -> Option<Divisor<u128>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: u128) -> Option<Divisor<u128>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let _d = Divisor::<u128>::new(5);

pub const fn get(&self) -> u128

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<u128>::new(7).unwrap();
assert_eq!(d.get(), 7);

pub const fn divides(&self, n: u128) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<u128>::new(17).unwrap();
assert!(d.divides(34));

pub const fn rem_of(&self, n: u128) -> u128

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<u128>::new(11).unwrap();
let rem = d.rem_of(30);
assert_eq!(rem, 8);

pub const fn div_of(&self, n: u128) -> u128

Returns the result of dividing n by self.

Examples

let d = Divisor::<u128>::new(17).unwrap();
let div = d.div_of(34);
assert_eq!(div, 2);

impl Divisor<usize>

Available on crate feature _int_usize only.

pub const fn new_usize(d: usize) -> Option<Divisor<usize>>

Alias of new with a unique name that helps type inference.

pub const fn new(d: usize) -> Option<Divisor<usize>>

Creates a divisor which can be used for faster computation of division and modulo by d.

Returns None if d equals zero.

Examples

let _d = Divisor::<usize>::new(5);

pub const fn get(&self) -> usize

Returns the value that was used to construct this divisor as a primitive type.

Examples

let d = Divisor::<usize>::new(7).unwrap();
assert_eq!(d.get(), 7);

pub const fn divides(&self, n: usize) -> bool

Returns true if n is divisible by self.

We take 0 to be divisible by all non-zero numbers.

Examples

let d = Divisor::<usize>::new(17).unwrap();
assert!(d.divides(34));

pub const fn rem_of(&self, n: usize) -> usize

Returns the remainder of dividing n by self.

Examples

let d = Divisor::<usize>::new(11).unwrap();
let rem = d.rem_of(30);
assert_eq!(rem, 8);

pub const fn div_of(&self, n: usize) -> usize

Returns the result of dividing n by self.

Examples

let d = Divisor::<usize>::new(17).unwrap();
let div = d.div_of(34);
assert_eq!(div, 2);

Trait Implementations

impl<T: Clone> Clone for Divisor<T>

fn clone(&self) -> Divisor<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Divisor<i128>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<i16>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<i32>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<i64>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<i8>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<isize>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<u128>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<u16>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<u32>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<u64>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<u8>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Debug for Divisor<usize>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<i128>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<i16>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<i32>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<i64>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<i8>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<isize>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<u128>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<u16>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<u32>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<u64>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<u8>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for Divisor<usize>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Div<Divisor<i128>> for i128

type Output = i128

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<i128>) -> Self::Output

Performs the / operation.

impl Div<Divisor<i16>> for i16

type Output = i16

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<i16>) -> Self::Output

Performs the / operation.

impl Div<Divisor<i32>> for i32

type Output = i32

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<i32>) -> Self::Output

Performs the / operation.

impl Div<Divisor<i64>> for i64

type Output = i64

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<i64>) -> Self::Output

Performs the / operation.

impl Div<Divisor<i8>> for i8

type Output = i8

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<i8>) -> Self::Output

Performs the / operation.

impl Div<Divisor<isize>> for isize

type Output = isize

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<isize>) -> Self::Output

Performs the / operation.

impl Div<Divisor<u128>> for u128

type Output = u128

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<u128>) -> Self::Output

Performs the / operation.

impl Div<Divisor<u16>> for u16

type Output = u16

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<u16>) -> Self::Output

Performs the / operation.

impl Div<Divisor<u32>> for u32

type Output = u32

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<u32>) -> Self::Output

Performs the / operation.

impl Div<Divisor<u64>> for u64

type Output = u64

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<u64>) -> Self::Output

Performs the / operation.

impl Div<Divisor<u8>> for u8

type Output = u8

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<u8>) -> Self::Output

Performs the / operation.

impl Div<Divisor<usize>> for usize

type Output = usize

The resulting type after applying the / operator.

fn div(self, rhs: Divisor<usize>) -> Self::Output

Performs the / operation.

impl DivAssign<Divisor<i128>> for i128

fn div_assign(&mut self, rhs: Divisor<i128>)

Performs the /= operation.

impl DivAssign<Divisor<i16>> for i16

fn div_assign(&mut self, rhs: Divisor<i16>)

Performs the /= operation.

impl DivAssign<Divisor<i32>> for i32

fn div_assign(&mut self, rhs: Divisor<i32>)

Performs the /= operation.

impl DivAssign<Divisor<i64>> for i64

fn div_assign(&mut self, rhs: Divisor<i64>)

Performs the /= operation.

impl DivAssign<Divisor<i8>> for i8

fn div_assign(&mut self, rhs: Divisor<i8>)

Performs the /= operation.

impl DivAssign<Divisor<isize>> for isize

fn div_assign(&mut self, rhs: Divisor<isize>)

Performs the /= operation.

impl DivAssign<Divisor<u128>> for u128

fn div_assign(&mut self, rhs: Divisor<u128>)

Performs the /= operation.

impl DivAssign<Divisor<u16>> for u16

fn div_assign(&mut self, rhs: Divisor<u16>)

Performs the /= operation.

impl DivAssign<Divisor<u32>> for u32

fn div_assign(&mut self, rhs: Divisor<u32>)

Performs the /= operation.

impl DivAssign<Divisor<u64>> for u64

fn div_assign(&mut self, rhs: Divisor<u64>)

Performs the /= operation.

impl DivAssign<Divisor<u8>> for u8

fn div_assign(&mut self, rhs: Divisor<u8>)

Performs the /= operation.

impl DivAssign<Divisor<usize>> for usize

fn div_assign(&mut self, rhs: Divisor<usize>)

Performs the /= operation.

impl Hash for Divisor<i128>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<i16>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<i32>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<i64>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<i8>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<isize>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<u128>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<u16>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<u32>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<u64>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<u8>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Hash for Divisor<usize>

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Divisor<i128>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<i16>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<i32>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<i64>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<i8>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<isize>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<u128>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<u16>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<u32>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<u64>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<u8>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for Divisor<usize>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Rem<Divisor<i128>> for i128

type Output = i128

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<i128>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<i16>> for i16

type Output = i16

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<i16>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<i32>> for i32

type Output = i32

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<i32>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<i64>> for i64

type Output = i64

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<i64>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<i8>> for i8

type Output = i8

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<i8>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<isize>> for isize

type Output = isize

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<isize>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<u128>> for u128

type Output = u128

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<u128>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<u16>> for u16

type Output = u16

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<u16>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<u32>> for u32

type Output = u32

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<u32>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<u64>> for u64

type Output = u64

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<u64>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<u8>> for u8

type Output = u8

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<u8>) -> Self::Output

Performs the % operation.

impl Rem<Divisor<usize>> for usize

type Output = usize

The resulting type after applying the % operator.

fn rem(self, rhs: Divisor<usize>) -> Self::Output

Performs the % operation.

impl RemAssign<Divisor<i128>> for i128

fn rem_assign(&mut self, rhs: Divisor<i128>)

Performs the %= operation.

impl RemAssign<Divisor<i16>> for i16

fn rem_assign(&mut self, rhs: Divisor<i16>)

Performs the %= operation.

impl RemAssign<Divisor<i32>> for i32

fn rem_assign(&mut self, rhs: Divisor<i32>)

Performs the %= operation.

impl RemAssign<Divisor<i64>> for i64

fn rem_assign(&mut self, rhs: Divisor<i64>)

Performs the %= operation.

impl RemAssign<Divisor<i8>> for i8

fn rem_assign(&mut self, rhs: Divisor<i8>)

Performs the %= operation.

impl RemAssign<Divisor<isize>> for isize

fn rem_assign(&mut self, rhs: Divisor<isize>)

Performs the %= operation.

impl RemAssign<Divisor<u128>> for u128

fn rem_assign(&mut self, rhs: Divisor<u128>)

Performs the %= operation.

impl RemAssign<Divisor<u16>> for u16

fn rem_assign(&mut self, rhs: Divisor<u16>)

Performs the %= operation.

impl RemAssign<Divisor<u32>> for u32

fn rem_assign(&mut self, rhs: Divisor<u32>)

Performs the %= operation.

impl RemAssign<Divisor<u64>> for u64

fn rem_assign(&mut self, rhs: Divisor<u64>)

Performs the %= operation.

impl RemAssign<Divisor<u8>> for u8

fn rem_assign(&mut self, rhs: Divisor<u8>)

Performs the %= operation.

impl RemAssign<Divisor<usize>> for usize

fn rem_assign(&mut self, rhs: Divisor<usize>)

Performs the %= operation.

impl<T: Copy> Copy for Divisor<T>

impl Eq for Divisor<i128>

impl Eq for Divisor<i16>

impl Eq for Divisor<i32>

impl Eq for Divisor<i64>

impl Eq for Divisor<i8>

impl Eq for Divisor<isize>

impl Eq for Divisor<u128>

impl Eq for Divisor<u16>

impl Eq for Divisor<u32>

impl Eq for Divisor<u64>

impl Eq for Divisor<u8>

impl Eq for Divisor<usize>