Trait malachite_base::num::arithmetic::traits::SaturatingAddMulAssign

pub trait SaturatingAddMulAssign<Y = Self, Z = Self> {
    // Required method
    fn saturating_add_mul_assign(&mut self, y: Y, z: Z);
}

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

Required Methods

fn saturating_add_mul_assign(&mut self, y: Y, z: Z)

Implementations on Foreign Types

impl SaturatingAddMulAssign for i8

fn saturating_add_mul_assign(&mut self, y: i8, z: i8)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for i16

fn saturating_add_mul_assign(&mut self, y: i16, z: i16)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for i32

fn saturating_add_mul_assign(&mut self, y: i32, z: i32)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for i64

fn saturating_add_mul_assign(&mut self, y: i64, z: i64)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for i128

fn saturating_add_mul_assign(&mut self, y: i128, z: i128)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for isize

fn saturating_add_mul_assign(&mut self, y: isize, z: isize)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for u8

fn saturating_add_mul_assign(&mut self, y: u8, z: u8)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for u16

fn saturating_add_mul_assign(&mut self, y: u16, z: u16)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for u32

fn saturating_add_mul_assign(&mut self, y: u32, z: u32)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for u64

fn saturating_add_mul_assign(&mut self, y: u64, z: u64)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for u128

fn saturating_add_mul_assign(&mut self, y: u128, z: u128)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SaturatingAddMulAssign for usize

fn saturating_add_mul_assign(&mut self, y: usize, z: usize)

Adds a number and the product of two other numbers in place, saturating at the numeric bounds instead of overflowing.

$$ x \gets \begin{cases} x + yz & \text{if} \quad m \leq x + yz \leq M, \\ M & \text{if} \quad x + yz > M, \\ m & \text{if} \quad x + yz < m, \end{cases} $$ where $m$ is Self::MIN and $M$ is Self::MAX.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors