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
// 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::gaussian_rational::GaussianRational;
use malachite_base::num::arithmetic::traits::IsPowerOf2;
impl IsPowerOf2 for GaussianRational {
/// Determines whether a [`GaussianRational`] is an integer power of 2.
///
/// Only purely real, positive values qualify; in particular, $i$ and its multiples are not
/// powers of 2.
///
/// $f(x) = (\exists n \in \Z : 2^n = x)$.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(1)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.real.significant_bits()`.
///
/// # Examples
/// ```
/// use malachite_base::num::arithmetic::traits::IsPowerOf2;
/// use malachite_q::gaussian_rational::GaussianRational;
/// use std::str::FromStr;
///
/// assert_eq!(GaussianRational::from(0x80).is_power_of_2(), true);
/// assert_eq!(
/// GaussianRational::from_str("1/8").unwrap().is_power_of_2(),
/// true
/// );
/// assert_eq!(
/// GaussianRational::from_str("-1/8").unwrap().is_power_of_2(),
/// false
/// );
/// assert_eq!(
/// GaussianRational::from_str("22/7").unwrap().is_power_of_2(),
/// false
/// );
/// assert_eq!(
/// GaussianRational::from_str("i/8").unwrap().is_power_of_2(),
/// false
/// );
/// assert_eq!(
/// GaussianRational::from_str("8+i").unwrap().is_power_of_2(),
/// false
/// );
/// ```
#[inline]
fn is_power_of_2(&self) -> bool {
self.imaginary == 0u32 && self.real.is_power_of_2()
}
}