pub trait WrappingDivAssign<RHS = Self> {
    fn wrapping_div_assign(&mut self, other: RHS);
}
Expand description

Divides a number by another number in place, wrapping around at the boundary of the type.

Required Methods

Implementations on Foreign Types

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Divides a number by another number in place, wrapping around at the boundary of the type.

Wrapping only occurs when Self is signed, self is Self::MIN, and other is -1. The “actual” result, -Self::MIN, can’t be represented and is wrapped back to Self::MIN.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors