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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
// numera::number::integer::z::ops::add
//
//! Implement the addition operations, and the Sum trait.
//
use crate::number::{integer::*, traits::ConstZero};
use core::{
iter::Sum,
ops::{Add, AddAssign},
};
use devela::paste;
macro_rules! impl_integer_add {
// impl Add ops for multiple integer types
//
// # Args
// $t: integer base name. e.g. Integer
// $p: inner primitive base name. e.g. i
// $b: integer and primitive bitsize. e.g. 8
( $($t:ident + $p:ident + $b:literal, cast: $bcast:literal);+ ) => {
$( impl_integer_add![add: $t + $p + $b]; )+
};
// addition operations
//
// impl variants:
// - add
// - checked_
// - saturating_
// - wrapping_
// - overflowing_
// - modular_ TODO
// - modular_counting_ TODO
(add: $t:ident + $p:ident + $b:literal) => { paste! {
impl Add<[<$t$b>]> for [<$t$b>] {
type Output = [<$t$b>];
/// Performs the `+` operation.
///
/// # Panics
/// Panics in debug, on overflow.
/// While in release, it performs two's complement wrapping.
#[inline]
#[must_use]
fn add(self, rhs: [<$t$b>]) -> Self::Output {
self.add(rhs)
}
}
// impl<'a> Add<&'a[<$t$b>]> for &'a [<$t$b>] {} // MAYBE
impl AddAssign for [<$t$b>] {
/// Performs the `+=` operation.
///
/// # Panics
/// Panics in debug, on overflow.
/// While in release, it performs two's complement wrapping.
#[inline]
fn add_assign(&mut self, rhs: [<$t$b>]) {
*self = self.add(rhs);
}
}
impl Sum for [<$t$b>] {
fn sum<I: Iterator<Item=Self>>(iter: I) -> Self {
iter.fold(
[<$t$b>]::ZERO,
|a, b| a + b,
)
}
}
impl<'a> Sum<&'a [<$t$b>]> for [<$t$b>] {
fn sum<I: Iterator<Item=&'a Self>>(iter: I) -> Self {
iter.fold(
[<$t$b>]::ZERO,
|a, b| a + *b,
)
}
}
/// # Addition
impl [<$t$b>] {
/// Integer addition.
///
/// # Panics
/// Panics in debug, on overflow.
/// While in release, it performs two's complement wrapping.
#[inline]
#[must_use]
pub const fn add(self, rhs: [<$t$b>]) -> [<$t$b>] {
Self(self.0 + rhs.0)
}
/// Checked addition.
///
/// Returns `None` on overflow.
#[inline]
#[must_use]
pub const fn checked_add(self, rhs: [<$t$b>]) -> Option<[<$t$b>]> {
if let Some(result) = self.0.checked_add(rhs.0) {
Some(Self(result))
} else {
None
}
}
/// Saturating addition.
/// Computes `self + rhs`, saturating at the numeric bounds instead of overflowing.
#[inline]
#[must_use]
pub const fn saturating_add(self, rhs: [<$t$b>]) -> [<$t$b>] {
Self(self.0.saturating_add(rhs.0))
}
/// Wrapping (modular) addition.
/// Computes `self + rhs`, wrapping around at the boundary of the type.
#[inline]
#[must_use]
pub const fn wrapping_add(self, rhs: [<$t$b>]) -> [<$t$b>] {
Self(self.0.wrapping_add(rhs.0))
}
/// Overflowing addition.
///
/// Returns a tuple of the addition along with a boolean indicating
/// whether an arithmetic overflow would occur. If an overflow would
/// have occurred then the wrapped value is returned.
#[inline]
#[must_use]
pub const fn overflowing_add(self, rhs: [<$t$b>]) -> ([<$t$b>], bool) {
let (result, overflown) = self.0.overflowing_add(rhs.0);
(Self(result), overflown)
}
// /// Modular addition with a custom `modulo`.
// #[inline]
// #[must_use]
// pub const fn modular_add(self, rhs: [<$t$b>], modulo: [<$t$b>]) -> [<$t$b>] {
// // self.wrapping_add(rhs).op_rem(modulo) // CHECK wrapping
//
// // use core::num::Wrapping; // MAYBE?
// // let wrapped_sum = Wrapping(self.0).wrapping_add(Wrapping(rhs.0));
//
// // let wrapped_sum = self.0.wrapping_add(rhs.0);
// // Self((wrapped_sum % modulo.0 + modulo.0) % modulo.0)
//
// // TEST
// Self(self.0.wrapping_add(rhs.0) % modulo.0)
// }
// TEST
// /// Addition with a custom `modulo`, and counting of the number of wraps.
// ///
// /// Returns the wrapped result and the number of times the modulo has wrapped around.
// #[inline]
// #[must_use]
// pub fn modular_counting_add(&self, other: [<$t$b>], modulo: [<$t$b>]) -> ([<$t$b>], [<$t$b>]) {
// let modulo_abs = modulo.0.abs();
// let mut result = self.0 + other.0;
// if result < 0 {
// result += modulo_abs;
// }
// let count = result / modulo_abs;
// (Self(result), Self(count))
// }
}
}};
}
impl_integer_add![
Integer+i+8, cast:16;
Integer+i+16, cast:32;
Integer+i+32, cast:64;
Integer+i+64, cast:128;
Integer+i+128, cast:128
];
#[cfg(feature = "dashu-int")]
mod big {
use super::*;
impl Add<IntegerBig> for IntegerBig {
type Output = IntegerBig;
/// Performs the `+` operation.
#[inline]
#[must_use]
fn add(self, rhs: IntegerBig) -> Self::Output {
Self(self.0 + rhs.0)
}
}
impl AddAssign for IntegerBig {
/// Performs the `-=` operation.
#[inline]
fn add_assign(&mut self, rhs: IntegerBig) {
self.0 += rhs.0;
}
}
impl Sum for IntegerBig {
fn sum<I: Iterator<Item = Self>>(iter: I) -> Self {
iter.fold(IntegerBig::new(0), |a, b| a + b)
}
}
impl<'a> Sum<&'a IntegerBig> for IntegerBig {
fn sum<I: Iterator<Item = &'a Self>>(iter: I) -> Self {
iter.fold(
IntegerBig::new(0),
|a, b| a + b.clone(), // CHECK performance
)
}
}
}