pub trait RemFloor<RHS = Self>: Rem<RHS> {
fn rem_floor(self, other: RHS) -> Self::Output;
}
Floored division remainder.
The sign of the modulus is always the same as the sign of the divisor
or zero.
This is equivalent to the mod
function in Haskell.
Returns the remainder of the floored division operation.
Loading content...
Loading content...
impl<'a> RemFloor<&'a i128> for i128
[src]
impl<'a> RemFloor<&'a isize> for isize
[src]
impl<'a> RemFloor<&'a u128> for u128
[src]
impl<'a> RemFloor<&'a usize> for usize
[src]
impl<'a> RemFloor<i128> for &'a i128
[src]
impl<'a> RemFloor<isize> for &'a isize
[src]
impl<'a> RemFloor<u128> for &'a u128
[src]
impl<'a> RemFloor<usize> for &'a usize
[src]
impl<'a, 'b> RemFloor<&'a i8> for &'b i8
[src]
impl<'a, 'b> RemFloor<&'a i16> for &'b i16
[src]
impl<'a, 'b> RemFloor<&'a i32> for &'b i32
[src]
impl<'a, 'b> RemFloor<&'a i64> for &'b i64
[src]
impl<'a, 'b> RemFloor<&'a i128> for &'b i128
[src]
impl<'a, 'b> RemFloor<&'a isize> for &'b isize
[src]
impl<'a, 'b> RemFloor<&'a u8> for &'b u8
[src]
impl<'a, 'b> RemFloor<&'a u16> for &'b u16
[src]
impl<'a, 'b> RemFloor<&'a u32> for &'b u32
[src]
impl<'a, 'b> RemFloor<&'a u64> for &'b u64
[src]
impl<'a, 'b> RemFloor<&'a u128> for &'b u128
[src]
impl<'a, 'b> RemFloor<&'a usize> for &'b usize
[src]
Loading content...