pub struct Divisor<T> { /* private fields */ }
Expand description
Faster divisor for division and modulo operations.
§Features
It’s implemented for the integer primitives enabled by the corresponding
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
.
§Vendored
This is adapted work from quickdiv.
Implementations§
Source§impl Divisor<i64>
Available on crate feature _int_i64
only.
impl Divisor<i64>
_int_i64
only.Sourcepub const fn new_i64(d: i64) -> Option<Divisor<i64>> ⓘ
pub const fn new_i64(d: i64) -> Option<Divisor<i64>> ⓘ
Alias of new
with a unique name that helps type inference.
Sourcepub const fn new(d: i64) -> Option<Divisor<i64>> ⓘ
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();
Sourcepub const fn get(&self) -> i64 ⓘ
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);
Sourcepub const fn divides(&self, n: i64) -> bool
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));
Sourcepub const fn rem_of(&self, n: i64) -> i64 ⓘ
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);
Sourcepub const fn div_of(&self, n: i64) -> i64 ⓘ
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);
Source§impl Divisor<u32>
Available on crate feature _int_u32
only.
impl Divisor<u32>
_int_u32
only.Sourcepub const fn new_u32(d: u32) -> Option<Divisor<u32>> ⓘ
pub const fn new_u32(d: u32) -> Option<Divisor<u32>> ⓘ
Alias of new
with a unique name that helps type inference.
Sourcepub const fn new(d: u32) -> Option<Divisor<u32>> ⓘ
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);
Sourcepub const fn get(&self) -> u32 ⓘ
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);
Sourcepub const fn divides(&self, n: u32) -> bool
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));
Trait Implementations§
impl<T: Copy> Copy for Divisor<T>
impl Eq for Divisor<i64>
impl Eq for Divisor<u32>
Auto Trait Implementations§
impl<T> Freeze for Divisor<T>where
T: Freeze,
impl<T> RefUnwindSafe for Divisor<T>where
T: RefUnwindSafe,
impl<T> Send for Divisor<T>where
T: Send,
impl<T> Sync for Divisor<T>where
T: Sync,
impl<T> Unpin for Divisor<T>where
T: Unpin,
impl<T> UnwindSafe for Divisor<T>where
T: UnwindSafe,
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
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize
fn byte_align(&self) -> usize
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn type_hash_with<H: Hasher>(&self, hasher: H) -> u64
fn type_hash_with<H: Hasher>(&self, hasher: H) -> u64
TypeId
of Self
using a custom hasher.Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of<T>() -> usize
fn mem_align_of<T>() -> usize
Source§fn mem_align_of_val(&self) -> usize
fn mem_align_of_val(&self) -> usize
Source§fn mem_size_of<T>() -> usize
fn mem_size_of<T>() -> usize
Source§fn mem_size_of_val(&self) -> usize
fn mem_size_of_val(&self) -> usize
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more