Trait OverflowingSubMulAssign Copy item path Source pub trait OverflowingSubMulAssign<Y = Self, Z = Self> {
// Required method
fn overflowing_sub_mul_assign (&mut self, y: Y, z: Z) -> bool ;
}Expand description Subtracts a number by the product of two other numbers, in place.
Returns a tuple of the result along with a boolean indicating whether an arithmetic overflow
occurred. If an overflow occurred, then the wrapped number is returned.
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .
Subtracts a number by the product of two other numbers, in place.
Returns a boolean indicating whether an arithmetic overflow would occur. If an
overflow would have occurred, then the wrapped value is assigned.
§ Worst-case complexityConstant time and additional memory.
§ ExamplesSee here .