1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
// Copyright © 2026 Mikhail Hogrefe
//
// This file is part of Malachite.
//
// Malachite is free software: you can redistribute it and/or modify it under the terms of the GNU
// Lesser General Public License (LGPL) as published by the Free Software Foundation; either version
// 3 of the License, or (at your option) any later version. See <https://www.gnu.org/licenses/>.
use crate::num::arithmetic::traits::{WrappingMulSubMul, WrappingMulSubMulAssign};
macro_rules! impl_wrapping_mul_sub_mul {
($t:ident) => {
impl WrappingMulSubMul for $t {
type Output = $t;
/// Subtracts the product of one pair of numbers from the product of another, wrapping
/// around at the boundary of the type.
///
/// $f(x, y, z, w) = z$, where $z \\equiv xy - zw \\mod 2^W$ and $W$ is `Self::WIDTH`.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::wrapping_mul_sub_mul#wrapping_mul_sub_mul).
#[inline]
fn wrapping_mul_sub_mul(self, y: $t, z: $t, w: $t) -> $t {
self.wrapping_mul(y).wrapping_sub(z.wrapping_mul(w))
}
}
impl WrappingMulSubMulAssign for $t {
/// Subtracts the product of one pair of numbers from the product of another, in place,
/// wrapping around at the boundary of the type.
///
/// $x \\gets z$, where $z \\equiv xy - zw \\mod 2^W$ and $W$ is `Self::WIDTH`.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::wrapping_mul_sub_mul#wrapping_mul_sub_mul_assign).
#[inline]
fn wrapping_mul_sub_mul_assign(&mut self, y: $t, z: $t, w: $t) {
*self = self.wrapping_mul(y).wrapping_sub(z.wrapping_mul(w));
}
}
};
}
apply_to_primitive_ints!(impl_wrapping_mul_sub_mul);