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
|
// Copyright © 2024 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 malachite_base::num::basic::integers::PrimitiveInt;
use malachite_base::num::basic::unsigneds::PrimitiveUnsigned;
use malachite_base::test_util::generators::{
unsigned_gen, unsigned_gen_var_1, unsigned_pair_gen_var_16, unsigned_triple_gen_var_12,
};
use std::panic::catch_unwind;
fn mod_square_helper<T: PrimitiveUnsigned>() {
let test = |x: T, m, out| {
assert_eq!(x.mod_mul(x, m), out);
assert_eq!(x.mod_square(m), out);
let mut mut_x = x;
mut_x.mod_square_assign(m);
assert_eq!(mut_x, out);
let data = T::precompute_mod_pow_data(&m);
assert_eq!(x.mod_square_precomputed(m, &data), out);
let mut mut_x = x;
mut_x.mod_square_precomputed_assign(m, &data);
assert_eq!(mut_x, out);
};
test(T::ZERO, T::ONE, T::ZERO);
test(T::ONE, T::exact_from(10), T::ONE);
test(T::TWO, T::exact_from(10), T::exact_from(4));
if T::WIDTH > u8::WIDTH {
test(T::exact_from(100), T::exact_from(497), T::exact_from(60));
test(T::exact_from(200), T::exact_from(497), T::exact_from(240));
test(T::exact_from(300), T::exact_from(497), T::exact_from(43));
}
}
#[test]
fn test_mod_square() {
apply_fn_to_unsigneds!(mod_square_helper);
}
fn mod_square_fail_helper<T: PrimitiveUnsigned>() {
assert_panic!(T::ZERO.mod_square(T::ZERO));
assert_panic!(T::from(123u8).mod_square(T::from(123u8)));
}
#[test]
fn mod_square_fail() {
apply_fn_to_unsigneds!(mod_square_fail_helper);
}
fn mod_square_assign_fail_helper<T: PrimitiveUnsigned>() {
assert_panic!({
let mut x = T::ZERO;
x.mod_square_assign(T::ZERO);
});
assert_panic!({
let mut x = T::from(123u8);
x.mod_square_assign(T::from(123u8));
});
}
#[test]
fn mod_square_assign_fail() {
apply_fn_to_unsigneds!(mod_square_assign_fail_helper);
}
fn mod_square_properties_helper<T: PrimitiveUnsigned>() {
unsigned_pair_gen_var_16::<T>().test_properties(|(x, m)| {
assert!(x.mod_is_reduced(&m));
let square = x.mod_square(m);
assert!(square.mod_is_reduced(&m));
let mut x_alt = x;
x_alt.mod_square_assign(m);
assert_eq!(x_alt, square);
let data = T::precompute_mod_pow_data(&m);
assert_eq!(x.mod_square_precomputed(m, &data), square);
let mut x_alt = x;
x_alt.mod_square_precomputed_assign(m, &data);
assert_eq!(x_alt, square);
assert_eq!(x.mod_mul(x, m), square);
assert_eq!(x.mod_neg(m).mod_square(m), square);
});
unsigned_gen_var_1::<T>().test_properties(|m| {
assert_eq!(T::ZERO.mod_square(m), T::ZERO);
if m != T::ONE {
assert_eq!(T::ONE.mod_square(m), T::ONE);
}
});
unsigned_triple_gen_var_12::<T>().test_properties(|(x, y, m)| {
assert_eq!(
x.mod_mul(y, m).mod_square(m),
x.mod_square(m).mod_mul(y.mod_square(m), m)
);
});
unsigned_gen::<T>().test_properties(|x| {
assert_panic!(x.mod_square(T::ZERO));
});
}
#[test]
fn mod_square_properties() {
apply_fn_to_unsigneds!(mod_square_properties_helper);
}
|
