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
// 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::natural::Natural;
use crate::natural_vector::NaturalVector;
use malachite_base::num::arithmetic::traits::{ModElementSum, ModSum};
impl ModElementSum<Natural> for NaturalVector {
type Output = Natural;
/// Returns the sum of the elements of a [`NaturalVector`] modulo another number $m$, taking the
/// vector by reference and the modulus by value. The elements must already be reduced.
///
/// The 0-dimensional vector has no elements, and their sum is 0.
///
/// $$
/// f(v, m) = \sum_i v_i \bmod m.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is the total number of bits of the
/// elements, and $m$ is the number of bits of the modulus.
///
/// # Panics
/// Panics if `m` is zero, or if any element is greater than or equal to `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ModElementSum;
/// use malachite_nz::natural::Natural;
/// use malachite_nz::natural_vector::NaturalVector;
///
/// let v = NaturalVector::from_str("(5, 6, 7)").unwrap();
/// assert_eq!(v.to_mod_element_sum(Natural::from(10u32)), 8);
/// let v = NaturalVector::from_str("()").unwrap();
/// assert_eq!(v.to_mod_element_sum(Natural::from(10u32)), 0);
/// ```
#[inline]
fn to_mod_element_sum(&self, m: Natural) -> Natural {
Natural::mod_sum(self.elements.iter(), m)
}
/// Returns the sum of the elements of a [`NaturalVector`] modulo another number $m$, taking the
/// vector by value and the modulus by value. The elements must already be reduced.
///
/// The 0-dimensional vector has no elements, and their sum is 0.
///
/// $$
/// f(v, m) = \sum_i v_i \bmod m.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is the total number of bits of the
/// elements, and $m$ is the number of bits of the modulus.
///
/// # Panics
/// Panics if `m` is zero, or if any element is greater than or equal to `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ModElementSum;
/// use malachite_nz::natural::Natural;
/// use malachite_nz::natural_vector::NaturalVector;
///
/// let v = NaturalVector::from_str("(5, 6, 7)").unwrap();
/// assert_eq!(v.into_mod_element_sum(Natural::from(10u32)), 8);
/// let v = NaturalVector::from_str("()").unwrap();
/// assert_eq!(v.into_mod_element_sum(Natural::from(10u32)), 0);
/// ```
#[inline]
fn into_mod_element_sum(self, m: Natural) -> Natural {
Natural::mod_sum(self.elements.into_iter(), m)
}
}
impl ModElementSum<&Natural> for NaturalVector {
type Output = Natural;
/// Returns the sum of the elements of a [`NaturalVector`] modulo another number $m$, taking the
/// vector by reference and the modulus by reference. The elements must already be reduced.
///
/// The 0-dimensional vector has no elements, and their sum is 0.
///
/// $$
/// f(v, m) = \sum_i v_i \bmod m.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is the total number of bits of the
/// elements, and $m$ is the number of bits of the modulus.
///
/// # Panics
/// Panics if `m` is zero, or if any element is greater than or equal to `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ModElementSum;
/// use malachite_nz::natural::Natural;
/// use malachite_nz::natural_vector::NaturalVector;
///
/// let v = NaturalVector::from_str("(5, 6, 7)").unwrap();
/// assert_eq!(v.to_mod_element_sum(&Natural::from(10u32)), 8);
/// let v = NaturalVector::from_str("()").unwrap();
/// assert_eq!(v.to_mod_element_sum(&Natural::from(10u32)), 0);
/// ```
#[inline]
fn to_mod_element_sum(&self, m: &Natural) -> Natural {
Natural::mod_sum(self.elements.iter(), m)
}
/// Returns the sum of the elements of a [`NaturalVector`] modulo another number $m$, taking the
/// vector by value and the modulus by reference. The elements must already be reduced.
///
/// The 0-dimensional vector has no elements, and their sum is 0.
///
/// $$
/// f(v, m) = \sum_i v_i \bmod m.
/// $$
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(m)$
///
/// where $T$ is time, $M$ is additional memory, $n$ is the total number of bits of the
/// elements, and $m$ is the number of bits of the modulus.
///
/// # Panics
/// Panics if `m` is zero, or if any element is greater than or equal to `m`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::arithmetic::traits::ModElementSum;
/// use malachite_nz::natural::Natural;
/// use malachite_nz::natural_vector::NaturalVector;
///
/// let v = NaturalVector::from_str("(5, 6, 7)").unwrap();
/// assert_eq!(v.into_mod_element_sum(&Natural::from(10u32)), 8);
/// let v = NaturalVector::from_str("()").unwrap();
/// assert_eq!(v.into_mod_element_sum(&Natural::from(10u32)), 0);
/// ```
#[inline]
fn into_mod_element_sum(self, m: &Natural) -> Natural {
Natural::mod_sum(self.elements.into_iter(), m)
}
}