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
// 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::basic::unsigneds::PrimitiveUnsigned;
use crate::polynomial::{ExponentGcd, slice_exponent_gcd};
use crate::unsigned_polynomial::UnsignedPolynomial;
impl<T: PrimitiveUnsigned> ExponentGcd for UnsignedPolynomial<T> {
/// Computes the greatest common divisor of the exponents at which an [`UnsignedPolynomial`] has
/// nonzero coefficients.
///
/// $$
/// f(p) = \gcd \\{i : p_i \neq 0\\}.
/// $$
///
/// When the polynomial is not constant, this is the largest $k$ such that $p(x) = q(x^k)$ for
/// some polynomial $q$, and
/// [`compose_power_of_x`](crate::polynomial::ComposePowerOfX::compose_power_of_x) with $k$
/// recovers $p$ from $q$. A constant polynomial, including zero, gives 0.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.len()`.
///
/// # Examples
/// ```
/// use core::str::FromStr;
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::polynomial::ExponentGcd;
/// use malachite_base::unsigned_polynomial::UnsignedPolynomial;
///
/// assert_eq!(
/// UnsignedPolynomial::<u8>::from_str("x^6+2*x^3+1")
/// .unwrap()
/// .exponent_gcd(),
/// 3
/// );
/// assert_eq!(
/// UnsignedPolynomial::<u8>::from_str("x^4+x")
/// .unwrap()
/// .exponent_gcd(),
/// 1
/// );
/// assert_eq!(
/// UnsignedPolynomial::<u8>::from_str("x^4")
/// .unwrap()
/// .exponent_gcd(),
/// 4
/// );
/// assert_eq!(
/// UnsignedPolynomial::<u8>::from_str("5")
/// .unwrap()
/// .exponent_gcd(),
/// 0
/// );
/// assert_eq!(UnsignedPolynomial::<u8>::ZERO.exponent_gcd(), 0);
/// ```
///
/// This is equivalent to `nmod_poly_deflation` from `nmod_poly/deflation.c`, FLINT 3.6.0,
/// except that a constant gives 0 rather than 1.
#[inline]
fn exponent_gcd(&self) -> u64 {
slice_exponent_gcd(&self.coefficients, |c| *c == T::ZERO)
}
}