Trait wasmer_types::lib::std::ops::Rem

pub trait Rem<Rhs = Self> {
    type Output;
    #[must_use]
    fn rem(self, rhs: Rhs) -> Self::Output;
}

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

type Output

The resulting type after applying the % operator.

Required methods

#[must_use]

fn rem(self, rhs: Rhs) -> Self::Output

Performs the % operation.

Example

assert_eq!(12 % 10, 2);

Implementations on Foreign Types

impl Rem<Wrapping<u16>> for Wrapping<u16>

type Output = Wrapping<u16>

pub fn rem(self, other: Wrapping<u16>) -> Wrapping<u16>

impl<'a> Rem<usize> for &'a usize

type Output = <usize as Rem<usize>>::Output

pub fn rem(self, other: usize) -> <usize as Rem<usize>>::Output

impl Rem<u8> for u8

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.

type Output = u8

pub fn rem(self, other: u8) -> u8

impl<'a> Rem<Wrapping<i8>> for &'a Wrapping<i8>

type Output = <Wrapping<i8> as Rem<Wrapping<i8>>>::Output

pub fn rem(
    self,
    other: Wrapping<i8>
) -> <Wrapping<i8> as Rem<Wrapping<i8>>>::Output

impl Rem<Wrapping<i8>> for Wrapping<i8>

type Output = Wrapping<i8>

pub fn rem(self, other: Wrapping<i8>) -> Wrapping<i8>

impl Rem<Wrapping<i16>> for Wrapping<i16>

type Output = Wrapping<i16>

pub fn rem(self, other: Wrapping<i16>) -> Wrapping<i16>

impl<'_, '_> Rem<&'_ u64> for &'_ u64

type Output = <u64 as Rem<u64>>::Output

pub fn rem(self, other: &u64) -> <u64 as Rem<u64>>::Output

impl<'_, '_> Rem<&'_ i128> for &'_ i128

type Output = <i128 as Rem<i128>>::Output

pub fn rem(self, other: &i128) -> <i128 as Rem<i128>>::Output

impl<'_> Rem<&'_ u16> for u16

type Output = <u16 as Rem<u16>>::Output

pub fn rem(self, other: &u16) -> <u16 as Rem<u16>>::Output

impl Rem<NonZeroU8> for u8

pub fn rem(self, other: NonZeroU8) -> u8

This operation satisfies n % d == n - (n / d) * d, and cannot panic.

type Output = u8

impl<'_, '_> Rem<&'_ u32> for &'_ u32

type Output = <u32 as Rem<u32>>::Output

pub fn rem(self, other: &u32) -> <u32 as Rem<u32>>::Output

impl<'_, '_> Rem<&'_ i32> for &'_ i32

type Output = <i32 as Rem<i32>>::Output

pub fn rem(self, other: &i32) -> <i32 as Rem<i32>>::Output

impl<'_, '_> Rem<&'_ Wrapping<i32>> for &'_ Wrapping<i32>

type Output = <Wrapping<i32> as Rem<Wrapping<i32>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i32>
) -> <Wrapping<i32> as Rem<Wrapping<i32>>>::Output

impl<'_> Rem<&'_ f64> for f64

type Output = <f64 as Rem<f64>>::Output

pub fn rem(self, other: &f64) -> <f64 as Rem<f64>>::Output

impl<'a> Rem<u16> for &'a u16

type Output = <u16 as Rem<u16>>::Output

pub fn rem(self, other: u16) -> <u16 as Rem<u16>>::Output

impl<'_, '_> Rem<&'_ f32> for &'_ f32

type Output = <f32 as Rem<f32>>::Output

pub fn rem(self, other: &f32) -> <f32 as Rem<f32>>::Output

impl<'_> Rem<&'_ i8> for i8

type Output = <i8 as Rem<i8>>::Output

pub fn rem(self, other: &i8) -> <i8 as Rem<i8>>::Output

impl Rem<Wrapping<i64>> for Wrapping<i64>

type Output = Wrapping<i64>

pub fn rem(self, other: Wrapping<i64>) -> Wrapping<i64>

impl Rem<Wrapping<usize>> for Wrapping<usize>

type Output = Wrapping<usize>

pub fn rem(self, other: Wrapping<usize>) -> Wrapping<usize>

impl Rem<NonZeroUsize> for usize

pub fn rem(self, other: NonZeroUsize) -> usize

This operation satisfies n % d == n - (n / d) * d, and cannot panic.

type Output = usize

impl<'_> Rem<&'_ Wrapping<i32>> for Wrapping<i32>

type Output = <Wrapping<i32> as Rem<Wrapping<i32>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i32>
) -> <Wrapping<i32> as Rem<Wrapping<i32>>>::Output

impl Rem<i16> for i16

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.

type Output = i16

pub fn rem(self, other: i16) -> i16

impl<'a> Rem<Wrapping<isize>> for &'a Wrapping<isize>

type Output = <Wrapping<isize> as Rem<Wrapping<isize>>>::Output

pub fn rem(
    self,
    other: Wrapping<isize>
) -> <Wrapping<isize> as Rem<Wrapping<isize>>>::Output

impl<'a> Rem<u128> for &'a u128

type Output = <u128 as Rem<u128>>::Output

pub fn rem(self, other: u128) -> <u128 as Rem<u128>>::Output

impl Rem<u32> for u32

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.

type Output = u32

pub fn rem(self, other: u32) -> u32

impl<'_, '_> Rem<&'_ i64> for &'_ i64

type Output = <i64 as Rem<i64>>::Output

pub fn rem(self, other: &i64) -> <i64 as Rem<i64>>::Output

impl<'_, '_> Rem<&'_ Wrapping<i8>> for &'_ Wrapping<i8>

type Output = <Wrapping<i8> as Rem<Wrapping<i8>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i8>
) -> <Wrapping<i8> as Rem<Wrapping<i8>>>::Output

impl<'_, '_> Rem<&'_ Wrapping<u64>> for &'_ Wrapping<u64>

type Output = <Wrapping<u64> as Rem<Wrapping<u64>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u64>
) -> <Wrapping<u64> as Rem<Wrapping<u64>>>::Output

impl<'_> Rem<&'_ Wrapping<u32>> for Wrapping<u32>

type Output = <Wrapping<u32> as Rem<Wrapping<u32>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u32>
) -> <Wrapping<u32> as Rem<Wrapping<u32>>>::Output

impl<'a> Rem<Wrapping<u128>> for &'a Wrapping<u128>

type Output = <Wrapping<u128> as Rem<Wrapping<u128>>>::Output

pub fn rem(
    self,
    other: Wrapping<u128>
) -> <Wrapping<u128> as Rem<Wrapping<u128>>>::Output

impl<'a> Rem<Wrapping<u16>> for &'a Wrapping<u16>

type Output = <Wrapping<u16> as Rem<Wrapping<u16>>>::Output

pub fn rem(
    self,
    other: Wrapping<u16>
) -> <Wrapping<u16> as Rem<Wrapping<u16>>>::Output

impl<'_> Rem<&'_ usize> for usize

type Output = <usize as Rem<usize>>::Output

pub fn rem(self, other: &usize) -> <usize as Rem<usize>>::Output

impl<'_> Rem<&'_ isize> for isize

type Output = <isize as Rem<isize>>::Output

pub fn rem(self, other: &isize) -> <isize as Rem<isize>>::Output

impl Rem<Wrapping<u8>> for Wrapping<u8>

type Output = Wrapping<u8>

pub fn rem(self, other: Wrapping<u8>) -> Wrapping<u8>

impl<'_> Rem<&'_ Wrapping<i8>> for Wrapping<i8>

type Output = <Wrapping<i8> as Rem<Wrapping<i8>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i8>
) -> <Wrapping<i8> as Rem<Wrapping<i8>>>::Output

impl<'a> Rem<Wrapping<u64>> for &'a Wrapping<u64>

type Output = <Wrapping<u64> as Rem<Wrapping<u64>>>::Output

pub fn rem(
    self,
    other: Wrapping<u64>
) -> <Wrapping<u64> as Rem<Wrapping<u64>>>::Output

impl<'a> Rem<i32> for &'a i32

type Output = <i32 as Rem<i32>>::Output

pub fn rem(self, other: i32) -> <i32 as Rem<i32>>::Output

impl Rem<NonZeroU64> for u64

pub fn rem(self, other: NonZeroU64) -> u64

This operation satisfies n % d == n - (n / d) * d, and cannot panic.

type Output = u64

impl<'a> Rem<u32> for &'a u32

type Output = <u32 as Rem<u32>>::Output

pub fn rem(self, other: u32) -> <u32 as Rem<u32>>::Output

impl<'_> Rem<&'_ Wrapping<i64>> for Wrapping<i64>

type Output = <Wrapping<i64> as Rem<Wrapping<i64>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i64>
) -> <Wrapping<i64> as Rem<Wrapping<i64>>>::Output

impl<'a> Rem<i16> for &'a i16

type Output = <i16 as Rem<i16>>::Output

pub fn rem(self, other: i16) -> <i16 as Rem<i16>>::Output

impl<'_, '_> Rem<&'_ Wrapping<usize>> for &'_ Wrapping<usize>

type Output = <Wrapping<usize> as Rem<Wrapping<usize>>>::Output

pub fn rem(
    self,
    other: &Wrapping<usize>
) -> <Wrapping<usize> as Rem<Wrapping<usize>>>::Output

impl<'_, '_> Rem<&'_ u128> for &'_ u128

type Output = <u128 as Rem<u128>>::Output

pub fn rem(self, other: &u128) -> <u128 as Rem<u128>>::Output

impl<'_, '_> Rem<&'_ Wrapping<i128>> for &'_ Wrapping<i128>

type Output = <Wrapping<i128> as Rem<Wrapping<i128>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i128>
) -> <Wrapping<i128> as Rem<Wrapping<i128>>>::Output

impl<'_> Rem<&'_ i64> for i64

type Output = <i64 as Rem<i64>>::Output

pub fn rem(self, other: &i64) -> <i64 as Rem<i64>>::Output

impl<'a> Rem<Wrapping<i32>> for &'a Wrapping<i32>

type Output = <Wrapping<i32> as Rem<Wrapping<i32>>>::Output

pub fn rem(
    self,
    other: Wrapping<i32>
) -> <Wrapping<i32> as Rem<Wrapping<i32>>>::Output

impl Rem<i8> for i8

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.

type Output = i8

pub fn rem(self, other: i8) -> i8

impl<'_, '_> Rem<&'_ usize> for &'_ usize

type Output = <usize as Rem<usize>>::Output

pub fn rem(self, other: &usize) -> <usize as Rem<usize>>::Output

impl<'_, '_> Rem<&'_ f64> for &'_ f64

type Output = <f64 as Rem<f64>>::Output

pub fn rem(self, other: &f64) -> <f64 as Rem<f64>>::Output

impl Rem<u128> for u128

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.

type Output = u128

pub fn rem(self, other: u128) -> u128

impl<'a> Rem<Wrapping<usize>> for &'a Wrapping<usize>

type Output = <Wrapping<usize> as Rem<Wrapping<usize>>>::Output

pub fn rem(
    self,
    other: Wrapping<usize>
) -> <Wrapping<usize> as Rem<Wrapping<usize>>>::Output

impl<'_, '_> Rem<&'_ Wrapping<i16>> for &'_ Wrapping<i16>

type Output = <Wrapping<i16> as Rem<Wrapping<i16>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i16>
) -> <Wrapping<i16> as Rem<Wrapping<i16>>>::Output

impl<'_, '_> Rem<&'_ Wrapping<i64>> for &'_ Wrapping<i64>

type Output = <Wrapping<i64> as Rem<Wrapping<i64>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i64>
) -> <Wrapping<i64> as Rem<Wrapping<i64>>>::Output

impl<'a> Rem<Wrapping<i64>> for &'a Wrapping<i64>

type Output = <Wrapping<i64> as Rem<Wrapping<i64>>>::Output

pub fn rem(
    self,
    other: Wrapping<i64>
) -> <Wrapping<i64> as Rem<Wrapping<i64>>>::Output

impl<'_, '_> Rem<&'_ Wrapping<u32>> for &'_ Wrapping<u32>

type Output = <Wrapping<u32> as Rem<Wrapping<u32>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u32>
) -> <Wrapping<u32> as Rem<Wrapping<u32>>>::Output

impl<'_> Rem<&'_ Wrapping<u64>> for Wrapping<u64>

type Output = <Wrapping<u64> as Rem<Wrapping<u64>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u64>
) -> <Wrapping<u64> as Rem<Wrapping<u64>>>::Output

impl<'_, '_> Rem<&'_ i8> for &'_ i8

type Output = <i8 as Rem<i8>>::Output

pub fn rem(self, other: &i8) -> <i8 as Rem<i8>>::Output

impl Rem<Wrapping<u64>> for Wrapping<u64>

type Output = Wrapping<u64>

pub fn rem(self, other: Wrapping<u64>) -> Wrapping<u64>

impl Rem<NonZeroU32> for u32

pub fn rem(self, other: NonZeroU32) -> u32

This operation satisfies n % d == n - (n / d) * d, and cannot panic.

type Output = u32

impl Rem<Wrapping<u32>> for Wrapping<u32>

type Output = Wrapping<u32>

pub fn rem(self, other: Wrapping<u32>) -> Wrapping<u32>

impl<'a> Rem<u64> for &'a u64

type Output = <u64 as Rem<u64>>::Output

pub fn rem(self, other: u64) -> <u64 as Rem<u64>>::Output

impl<'a> Rem<f32> for &'a f32

type Output = <f32 as Rem<f32>>::Output

pub fn rem(self, other: f32) -> <f32 as Rem<f32>>::Output

impl Rem<NonZeroU16> for u16

pub fn rem(self, other: NonZeroU16) -> u16

This operation satisfies n % d == n - (n / d) * d, and cannot panic.

type Output = u16

impl<'_> Rem<&'_ i32> for i32

type Output = <i32 as Rem<i32>>::Output

pub fn rem(self, other: &i32) -> <i32 as Rem<i32>>::Output

impl Rem<isize> for isize

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.

type Output = isize

pub fn rem(self, other: isize) -> isize

impl<'_, '_> Rem<&'_ u16> for &'_ u16

type Output = <u16 as Rem<u16>>::Output

pub fn rem(self, other: &u16) -> <u16 as Rem<u16>>::Output

impl Rem<Wrapping<isize>> for Wrapping<isize>

type Output = Wrapping<isize>

pub fn rem(self, other: Wrapping<isize>) -> Wrapping<isize>

impl<'_> Rem<&'_ Wrapping<i128>> for Wrapping<i128>

type Output = <Wrapping<i128> as Rem<Wrapping<i128>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i128>
) -> <Wrapping<i128> as Rem<Wrapping<i128>>>::Output

impl Rem<i64> for i64

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.

type Output = i64

pub fn rem(self, other: i64) -> i64

impl Rem<f64> for f64

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);

type Output = f64

pub fn rem(self, other: f64) -> f64

impl<'_> Rem<&'_ i16> for i16

type Output = <i16 as Rem<i16>>::Output

pub fn rem(self, other: &i16) -> <i16 as Rem<i16>>::Output

impl<'_> Rem<&'_ Wrapping<u128>> for Wrapping<u128>

type Output = <Wrapping<u128> as Rem<Wrapping<u128>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u128>
) -> <Wrapping<u128> as Rem<Wrapping<u128>>>::Output

impl Rem<Wrapping<i128>> for Wrapping<i128>

type Output = Wrapping<i128>

pub fn rem(self, other: Wrapping<i128>) -> Wrapping<i128>

impl<'_, '_> Rem<&'_ isize> for &'_ isize

type Output = <isize as Rem<isize>>::Output

pub fn rem(self, other: &isize) -> <isize as Rem<isize>>::Output

impl<'a> Rem<i8> for &'a i8

type Output = <i8 as Rem<i8>>::Output

pub fn rem(self, other: i8) -> <i8 as Rem<i8>>::Output

impl<'a> Rem<u8> for &'a u8

type Output = <u8 as Rem<u8>>::Output

pub fn rem(self, other: u8) -> <u8 as Rem<u8>>::Output

impl Rem<u64> for u64

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.

type Output = u64

pub fn rem(self, other: u64) -> u64

impl<'_> Rem<&'_ Wrapping<usize>> for Wrapping<usize>

type Output = <Wrapping<usize> as Rem<Wrapping<usize>>>::Output

pub fn rem(
    self,
    other: &Wrapping<usize>
) -> <Wrapping<usize> as Rem<Wrapping<usize>>>::Output

impl<'_, '_> Rem<&'_ Wrapping<u8>> for &'_ Wrapping<u8>

type Output = <Wrapping<u8> as Rem<Wrapping<u8>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u8>
) -> <Wrapping<u8> as Rem<Wrapping<u8>>>::Output

impl Rem<f32> for f32

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);

type Output = f32

pub fn rem(self, other: f32) -> f32

impl Rem<NonZeroU128> for u128

pub fn rem(self, other: NonZeroU128) -> u128

This operation satisfies n % d == n - (n / d) * d, and cannot panic.

type Output = u128

impl Rem<i128> for i128

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.

type Output = i128

pub fn rem(self, other: i128) -> i128

impl Rem<i32> for i32

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.

type Output = i32

pub fn rem(self, other: i32) -> i32

impl<'_> Rem<&'_ Wrapping<isize>> for Wrapping<isize>

type Output = <Wrapping<isize> as Rem<Wrapping<isize>>>::Output

pub fn rem(
    self,
    other: &Wrapping<isize>
) -> <Wrapping<isize> as Rem<Wrapping<isize>>>::Output

impl<'a> Rem<Wrapping<u8>> for &'a Wrapping<u8>

type Output = <Wrapping<u8> as Rem<Wrapping<u8>>>::Output

pub fn rem(
    self,
    other: Wrapping<u8>
) -> <Wrapping<u8> as Rem<Wrapping<u8>>>::Output

impl<'_> Rem<&'_ u8> for u8

type Output = <u8 as Rem<u8>>::Output

pub fn rem(self, other: &u8) -> <u8 as Rem<u8>>::Output

impl Rem<usize> for usize

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.

type Output = usize

pub fn rem(self, other: usize) -> usize

impl<'_> Rem<&'_ u128> for u128

type Output = <u128 as Rem<u128>>::Output

pub fn rem(self, other: &u128) -> <u128 as Rem<u128>>::Output

impl<'_, '_> Rem<&'_ i16> for &'_ i16

type Output = <i16 as Rem<i16>>::Output

pub fn rem(self, other: &i16) -> <i16 as Rem<i16>>::Output

impl<'_> Rem<&'_ Wrapping<u8>> for Wrapping<u8>

type Output = <Wrapping<u8> as Rem<Wrapping<u8>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u8>
) -> <Wrapping<u8> as Rem<Wrapping<u8>>>::Output

impl<'_> Rem<&'_ u64> for u64

type Output = <u64 as Rem<u64>>::Output

pub fn rem(self, other: &u64) -> <u64 as Rem<u64>>::Output

impl<'a> Rem<Wrapping<i16>> for &'a Wrapping<i16>

type Output = <Wrapping<i16> as Rem<Wrapping<i16>>>::Output

pub fn rem(
    self,
    other: Wrapping<i16>
) -> <Wrapping<i16> as Rem<Wrapping<i16>>>::Output

impl<'a> Rem<Wrapping<u32>> for &'a Wrapping<u32>

type Output = <Wrapping<u32> as Rem<Wrapping<u32>>>::Output

pub fn rem(
    self,
    other: Wrapping<u32>
) -> <Wrapping<u32> as Rem<Wrapping<u32>>>::Output

impl<'_, '_> Rem<&'_ u8> for &'_ u8

type Output = <u8 as Rem<u8>>::Output

pub fn rem(self, other: &u8) -> <u8 as Rem<u8>>::Output

impl<'a> Rem<Wrapping<i128>> for &'a Wrapping<i128>

type Output = <Wrapping<i128> as Rem<Wrapping<i128>>>::Output

pub fn rem(
    self,
    other: Wrapping<i128>
) -> <Wrapping<i128> as Rem<Wrapping<i128>>>::Output

impl<'_> Rem<&'_ Wrapping<u16>> for Wrapping<u16>

type Output = <Wrapping<u16> as Rem<Wrapping<u16>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u16>
) -> <Wrapping<u16> as Rem<Wrapping<u16>>>::Output

impl<'a> Rem<i64> for &'a i64

type Output = <i64 as Rem<i64>>::Output

pub fn rem(self, other: i64) -> <i64 as Rem<i64>>::Output

impl<'_, '_> Rem<&'_ Wrapping<u128>> for &'_ Wrapping<u128>

type Output = <Wrapping<u128> as Rem<Wrapping<u128>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u128>
) -> <Wrapping<u128> as Rem<Wrapping<u128>>>::Output

impl<'_> Rem<&'_ Wrapping<i16>> for Wrapping<i16>

type Output = <Wrapping<i16> as Rem<Wrapping<i16>>>::Output

pub fn rem(
    self,
    other: &Wrapping<i16>
) -> <Wrapping<i16> as Rem<Wrapping<i16>>>::Output

impl<'_, '_> Rem<&'_ Wrapping<isize>> for &'_ Wrapping<isize>

type Output = <Wrapping<isize> as Rem<Wrapping<isize>>>::Output

pub fn rem(
    self,
    other: &Wrapping<isize>
) -> <Wrapping<isize> as Rem<Wrapping<isize>>>::Output

impl<'a> Rem<isize> for &'a isize

type Output = <isize as Rem<isize>>::Output

pub fn rem(self, other: isize) -> <isize as Rem<isize>>::Output

impl<'a> Rem<i128> for &'a i128

type Output = <i128 as Rem<i128>>::Output

pub fn rem(self, other: i128) -> <i128 as Rem<i128>>::Output

impl Rem<Wrapping<u128>> for Wrapping<u128>

type Output = Wrapping<u128>

pub fn rem(self, other: Wrapping<u128>) -> Wrapping<u128>

impl<'_> Rem<&'_ i128> for i128

type Output = <i128 as Rem<i128>>::Output

pub fn rem(self, other: &i128) -> <i128 as Rem<i128>>::Output

impl<'_, '_> Rem<&'_ Wrapping<u16>> for &'_ Wrapping<u16>

type Output = <Wrapping<u16> as Rem<Wrapping<u16>>>::Output

pub fn rem(
    self,
    other: &Wrapping<u16>
) -> <Wrapping<u16> as Rem<Wrapping<u16>>>::Output

impl<'a> Rem<f64> for &'a f64

type Output = <f64 as Rem<f64>>::Output

pub fn rem(self, other: f64) -> <f64 as Rem<f64>>::Output

impl<'_> Rem<&'_ f32> for f32

type Output = <f32 as Rem<f32>>::Output

pub fn rem(self, other: &f32) -> <f32 as Rem<f32>>::Output

impl<'_> Rem<&'_ u32> for u32

type Output = <u32 as Rem<u32>>::Output

pub fn rem(self, other: &u32) -> <u32 as Rem<u32>>::Output

impl Rem<u16> for u16

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.

type Output = u16

pub fn rem(self, other: u16) -> u16

impl Rem<Wrapping<i32>> for Wrapping<i32>

type Output = Wrapping<i32>

pub fn rem(self, other: Wrapping<i32>) -> Wrapping<i32>

Implementors