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 © 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_integer::GaussianInteger;
use crate::integer::Integer;
use core::cmp::Ordering::{self, Greater};
use malachite_base::num::arithmetic::traits::AbsSquared;
use malachite_base::num::comparison::traits::PartialOrdAbs;
macro_rules! impl_unsigned {
($t: ident) => {
impl PartialOrdAbs<$t> for GaussianInteger {
/// Compares the absolute values of a [`GaussianInteger`] and an unsigned primitive
/// integer.
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the maximum number of
/// significant bits of the real and imaginary parts of `self`.
///
/// # Examples
/// See [here](super::cmp_abs_primitive_int#partial_cmp_abs).
fn partial_cmp_abs(&self, other: &$t) -> Option<Ordering> {
if self.imaginary == 0u32 {
self.real.partial_cmp_abs(other)
} else if self.real == 0u32 {
self.imaginary.partial_cmp_abs(other)
} else if !self.real.lt_abs(other) || !self.imaginary.lt_abs(other) {
Some(Greater)
} else {
Some(self.abs_squared().cmp(&Integer::from(*other).abs_squared()))
}
}
}
impl PartialOrdAbs<GaussianInteger> for $t {
/// Compares the absolute values of an unsigned primitive integer and a
/// [`GaussianInteger`].
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the maximum number of
/// significant bits of the real and imaginary parts of `other`.
///
/// # Examples
/// See [here](super::cmp_abs_primitive_int#partial_cmp_abs).
#[inline]
fn partial_cmp_abs(&self, other: &GaussianInteger) -> Option<Ordering> {
other.partial_cmp_abs(self).map(Ordering::reverse)
}
}
};
}
apply_to_unsigneds!(impl_unsigned);
macro_rules! impl_signed {
($t: ident) => {
impl PartialOrdAbs<$t> for GaussianInteger {
/// Compares the absolute values of a [`GaussianInteger`] and a signed primitive
/// integer.
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the maximum number of
/// significant bits of the real and imaginary parts of `self`.
///
/// # Examples
/// See [here](super::cmp_abs_primitive_int#partial_cmp_abs).
fn partial_cmp_abs(&self, other: &$t) -> Option<Ordering> {
if self.imaginary == 0u32 {
self.real.partial_cmp_abs(other)
} else if self.real == 0u32 {
self.imaginary.partial_cmp_abs(other)
} else if !self.real.lt_abs(other) || !self.imaginary.lt_abs(other) {
Some(Greater)
} else {
Some(self.abs_squared().cmp(&Integer::from(*other).abs_squared()))
}
}
}
impl PartialOrdAbs<GaussianInteger> for $t {
/// Compares the absolute values of a signed primitive integer and a
/// [`GaussianInteger`].
///
/// # Worst-case complexity
/// $T(n) = O(n \log n \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is the maximum number of
/// significant bits of the real and imaginary parts of `other`.
///
/// # Examples
/// See [here](super::cmp_abs_primitive_int#partial_cmp_abs).
#[inline]
fn partial_cmp_abs(&self, other: &GaussianInteger) -> Option<Ordering> {
other.partial_cmp_abs(self).map(Ordering::reverse)
}
}
};
}
apply_to_signeds!(impl_signed);