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
// 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 malachite_base::num::arithmetic::traits::UnsignedAbs;
use malachite_base::num::basic::traits::One;
use malachite_nz::integer::Integer;
use malachite_nz::natural::Natural;
impl From<Integer> for Rational {
/// Converts an [`Integer`] to a [`Rational`], taking the [`Integer`] by value.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// ```
/// use malachite_nz::integer::Integer;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::from(Integer::from(123)), 123);
/// assert_eq!(Rational::from(Integer::from(-123)), -123);
/// ```
fn from(value: Integer) -> Self {
Self {
sign: value >= 0,
numerator: value.unsigned_abs(),
denominator: Natural::ONE,
}
}
}
impl From<&Integer> for Rational {
/// Converts an [`Integer`] to a [`Rational`], taking the [`Integer`] by reference.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `value.significant_bits()`.
///
/// # Examples
/// ```
/// use malachite_nz::integer::Integer;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::from(&Integer::from(123)), 123);
/// assert_eq!(Rational::from(&Integer::from(-123)), -123);
/// ```
fn from(value: &Integer) -> Self {
Self {
sign: *value >= 0,
numerator: value.unsigned_abs(),
denominator: Natural::ONE,
}
}
}