malachite-q 0.14.0

The arbitrary-precision type Rational, with efficient algorithms partially derived from GMP and FLINT.
Documentation 
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

// 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::Rational;
use crate::gaussian_rational::GaussianRational;
use malachite_base::num::conversion::traits::ConvertibleFrom;

#[derive(Clone, Copy, Debug, Eq, PartialEq)]
pub struct PrimitiveIntFromGaussianRationalError;

fn try_from_helper<'a, T: TryFrom<&'a Rational>>(
    x: &'a GaussianRational,
) -> Result<T, PrimitiveIntFromGaussianRationalError> {
    if x.imaginary == 0u32 {
        T::try_from(&x.real).map_err(|_| PrimitiveIntFromGaussianRationalError)
    } else {
        Err(PrimitiveIntFromGaussianRationalError)
    }
}

fn convertible_from_helper<T: for<'a> ConvertibleFrom<&'a Rational>>(x: &GaussianRational) -> bool {
    x.imaginary == 0u32 && T::convertible_from(&x.real)
}

macro_rules! impl_primitive_int_from_gaussian_rational {
    ($t:ident) => {
        impl TryFrom<&GaussianRational> for $t {
            type Error = PrimitiveIntFromGaussianRationalError;

            /// Converts a [`GaussianRational`] to a primitive integer, returning an error if the
            /// [`GaussianRational`] is not real or cannot be represented.
            ///
            /// # Worst-case complexity
            /// Constant time and additional memory.
            ///
            /// # Examples
            /// See [here](super::primitive_int_from_gaussian_rational#try_from).
            #[inline]
            fn try_from(x: &GaussianRational) -> Result<$t, Self::Error> {
                try_from_helper(x)
            }
        }

        impl ConvertibleFrom<&GaussianRational> for $t {
            /// Determines whether a [`GaussianRational`] can be converted to a primitive integer
            /// (that is, whether it is real and representable), taking the [`GaussianRational`] by
            /// reference.
            ///
            /// # Worst-case complexity
            /// Constant time and additional memory.
            ///
            /// # Examples
            /// See [here](super::primitive_int_from_gaussian_rational#convertible_from).
            #[inline]
            fn convertible_from(x: &GaussianRational) -> bool {
                convertible_from_helper::<$t>(x)
            }
        }
    };
}
apply_to_primitive_ints!(impl_primitive_int_from_gaussian_rational);