Trait otter_api_tests::imports::failure::_core::ops::Rem 1.0.0[−][src]
Expand description
The remainder operator %
.
Note that Rhs
is Self
by default, but this is not mandatory.
Examples
This example implements Rem
on a SplitSlice
object. After Rem
is
implemented, one can use the %
operator to find out what the remaining
elements of the slice would be after splitting it into equal slices of a
given length.
use std::ops::Rem; #[derive(PartialEq, Debug)] struct SplitSlice<'a, T: 'a> { slice: &'a [T], } impl<'a, T> Rem<usize> for SplitSlice<'a, T> { type Output = Self; fn rem(self, modulus: usize) -> Self::Output { let len = self.slice.len(); let rem = len % modulus; let start = len - rem; Self {slice: &self.slice[start..]} } } // If we were to divide &[0, 1, 2, 3, 4, 5, 6, 7] into slices of size 3, // the remainder would be &[6, 7]. assert_eq!(SplitSlice { slice: &[0, 1, 2, 3, 4, 5, 6, 7] } % 3, SplitSlice { slice: &[6, 7] });
Associated Types
Required methods
Implementations on Foreign Types
impl Rem<i16> for i16
[src]
impl Rem<i16> for i16
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
or if self / other
results in overflow.
impl Rem<i8> for i8
[src]
impl Rem<i8> for i8
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
or if self / other
results in overflow.
impl Rem<u16> for u16
[src]
impl Rem<u16> for u16
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
.
impl Rem<NonZeroUsize> for usize
[src]
impl Rem<NonZeroUsize> for usize
[src]impl Rem<u128> for u128
[src]
impl Rem<u128> for u128
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
.
impl Rem<u8> for u8
[src]
impl Rem<u8> for u8
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
.
impl Rem<NonZeroU128> for u128
[src]
impl Rem<NonZeroU128> for u128
[src]impl Rem<usize> for usize
[src]
impl Rem<usize> for usize
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
.
impl Rem<NonZeroU32> for u32
[src]
impl Rem<NonZeroU32> for u32
[src]impl Rem<i64> for i64
[src]
impl Rem<i64> for i64
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
or if self / other
results in overflow.
impl Rem<u32> for u32
[src]
impl Rem<u32> for u32
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
.
impl Rem<NonZeroU16> for u16
[src]
impl Rem<NonZeroU16> for u16
[src]impl Rem<u64> for u64
[src]
impl Rem<u64> for u64
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
.
impl Rem<f64> for f64
[src]
impl Rem<f64> for f64
[src]The remainder from the division of two floats.
The remainder has the same sign as the dividend and is computed as:
x - (x / y).trunc() * y
.
Examples
let x: f32 = 50.50; let y: f32 = 8.125; let remainder = x - (x / y).trunc() * y; // The answer to both operations is 1.75 assert_eq!(x % y, remainder);
impl Rem<f32> for f32
[src]
impl Rem<f32> for f32
[src]The remainder from the division of two floats.
The remainder has the same sign as the dividend and is computed as:
x - (x / y).trunc() * y
.
Examples
let x: f32 = 50.50; let y: f32 = 8.125; let remainder = x - (x / y).trunc() * y; // The answer to both operations is 1.75 assert_eq!(x % y, remainder);
impl Rem<i128> for i128
[src]
impl Rem<i128> for i128
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
or if self / other
results in overflow.
impl Rem<i32> for i32
[src]
impl Rem<i32> for i32
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
or if self / other
results in overflow.
impl Rem<NonZeroU64> for u64
[src]
impl Rem<NonZeroU64> for u64
[src]impl Rem<isize> for isize
[src]
impl Rem<isize> for isize
[src]This operation satisfies n % d == n - (n / d) * d
. The
result has the same sign as the left operand.
Panics
This operation will panic if other == 0
or if self / other
results in overflow.
Implementors
impl Rem<usize> for LibInBundleI
[src]
impl Rem<usize> for LibInBundleI
[src]impl<'a, T> Rem<&'a &'a OrderedFloat<T>> for &'a OrderedFloat<T> where
&'a T: Rem<&'a T>,
impl<'a, T> Rem<&'a &'a OrderedFloat<T>> for &'a OrderedFloat<T> where
&'a T: Rem<&'a T>,
type Output = OrderedFloat<<&'a T as Rem<&'a T>>::Output>
pub fn rem(
self,
other: &'a &'a OrderedFloat<T>
) -> <&'a OrderedFloat<T> as Rem<&'a &'a OrderedFloat<T>>>::Output
self,
other: &'a &'a OrderedFloat<T>
) -> <&'a OrderedFloat<T> as Rem<&'a &'a OrderedFloat<T>>>::Output
impl<'a, T> Rem<&'a OrderedFloat<T>> for &'a OrderedFloat<T> where
&'a T: Rem<&'a T>,
impl<'a, T> Rem<&'a OrderedFloat<T>> for &'a OrderedFloat<T> where
&'a T: Rem<&'a T>,
type Output = OrderedFloat<<&'a T as Rem<&'a T>>::Output>
pub fn rem(
self,
other: &'a OrderedFloat<T>
) -> <&'a OrderedFloat<T> as Rem<&'a OrderedFloat<T>>>::Output
self,
other: &'a OrderedFloat<T>
) -> <&'a OrderedFloat<T> as Rem<&'a OrderedFloat<T>>>::Output
impl<'a, T> Rem<&'a OrderedFloat<T>> for OrderedFloat<T> where
T: Rem<&'a T>,
impl<'a, T> Rem<&'a OrderedFloat<T>> for OrderedFloat<T> where
T: Rem<&'a T>,
type Output = OrderedFloat<<T as Rem<&'a T>>::Output>
pub fn rem(
self,
other: &'a OrderedFloat<T>
) -> <OrderedFloat<T> as Rem<&'a OrderedFloat<T>>>::Output
self,
other: &'a OrderedFloat<T>
) -> <OrderedFloat<T> as Rem<&'a OrderedFloat<T>>>::Output
impl<'a, T> Rem<&'a T> for OrderedFloat<T> where
T: Rem<&'a T>,
impl<'a, T> Rem<&'a T> for OrderedFloat<T> where
T: Rem<&'a T>,
impl<'a, T> Rem<OrderedFloat<T>> for &'a OrderedFloat<T> where
&'a T: Rem<T>,
impl<'a, T> Rem<OrderedFloat<T>> for &'a OrderedFloat<T> where
&'a T: Rem<T>,
type Output = OrderedFloat<<&'a T as Rem<T>>::Output>
pub fn rem(
self,
other: OrderedFloat<T>
) -> <&'a OrderedFloat<T> as Rem<OrderedFloat<T>>>::Output
self,
other: OrderedFloat<T>
) -> <&'a OrderedFloat<T> as Rem<OrderedFloat<T>>>::Output
impl<'a, T> Rem<T> for &'a OrderedFloat<T> where
&'a T: Rem<T>,
impl<'a, T> Rem<T> for &'a OrderedFloat<T> where
&'a T: Rem<T>,
type Output = OrderedFloat<<&'a T as Rem<T>>::Output>
pub fn rem(self, other: T) -> <&'a OrderedFloat<T> as Rem<T>>::Output
impl<T> Rem<OrderedFloat<T>> for OrderedFloat<T> where
T: Rem<T>,
impl<T> Rem<OrderedFloat<T>> for OrderedFloat<T> where
T: Rem<T>,
type Output = OrderedFloat<<T as Rem<T>>::Output>
pub fn rem(
self,
other: OrderedFloat<T>
) -> <OrderedFloat<T> as Rem<OrderedFloat<T>>>::Output
self,
other: OrderedFloat<T>
) -> <OrderedFloat<T> as Rem<OrderedFloat<T>>>::Output
impl<T> Rem<T> for OrderedFloat<T> where
T: Rem<T>,
impl<T> Rem<T> for OrderedFloat<T> where
T: Rem<T>,
type Output = OrderedFloat<<T as Rem<T>>::Output>
pub fn rem(self, other: T) -> <OrderedFloat<T> as Rem<T>>::Output
impl<T> Rem<T> for NotNan<T> where
T: Float,
impl<T> Rem<T> for NotNan<T> where
T: Float,
Calculates %
with a float directly.
Panics if the provided value is NaN or the computation results in NaN
impl<Ul, Bl, Ur, Br> Rem<UInt<Ur, Br>> for UInt<Ul, Bl> where
Ul: Unsigned,
Ur: Unsigned,
Br: Bit,
Bl: Bit,
UInt<Ul, Bl>: Len,
<UInt<Ul, Bl> as Len>::Output: Sub<B1>,
(): PrivateDiv<UInt<Ul, Bl>, UInt<Ur, Br>, UTerm, UTerm, <<UInt<Ul, Bl> as Len>::Output as Sub<B1>>::Output>,
impl<Ul, Bl, Ur, Br> Rem<UInt<Ur, Br>> for UInt<Ul, Bl> where
Ul: Unsigned,
Ur: Unsigned,
Br: Bit,
Bl: Bit,
UInt<Ul, Bl>: Len,
<UInt<Ul, Bl> as Len>::Output: Sub<B1>,
(): PrivateDiv<UInt<Ul, Bl>, UInt<Ur, Br>, UTerm, UTerm, <<UInt<Ul, Bl> as Len>::Output as Sub<B1>>::Output>,
impl<Ul, Ur> Rem<NInt<Ur>> for NInt<Ul> where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
impl<Ul, Ur> Rem<NInt<Ur>> for NInt<Ul> where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
impl<Ul, Ur> Rem<NInt<Ur>> for PInt<Ul> where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
impl<Ul, Ur> Rem<NInt<Ur>> for PInt<Ul> where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, NInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
impl<Ul, Ur> Rem<PInt<Ur>> for NInt<Ul> where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur> Rem<PInt<Ur>> for NInt<Ul> where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
NInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>
impl<Ul, Ur> Rem<PInt<Ur>> for PInt<Ul> where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
impl<Ul, Ur> Rem<PInt<Ur>> for PInt<Ul> where
Ul: Unsigned + NonZero + Rem<Ur>,
Ur: Unsigned + NonZero,
PInt<Ul>: PrivateRem<<Ul as Rem<Ur>>::Output, PInt<Ur>>,
$A<Ul> % $B<Ur> = $R<Ul % Ur>