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
// 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::basic::traits::One;
use malachite_nz::natural::Natural;
use malachite_nz::platform::{Limb, SignedLimb};
impl Rational {
/// Converts a [`Limb`](crate#limbs) to a [`Rational`].
///
/// This function is const, so it may be used to define constants.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// ```
/// use malachite_q::Rational;
///
/// const TEN: Rational = Rational::const_from_unsigned(10);
/// assert_eq!(TEN, 10);
/// ```
pub const fn const_from_unsigned(x: Limb) -> Self {
Self {
sign: true,
numerator: Natural::const_from(x),
denominator: Natural::ONE,
}
}
/// Converts a [`SignedLimb`](crate#limbs) to a [`Rational`].
///
/// This function is const, so it may be used to define constants.
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// ```
/// use malachite_q::Rational;
///
/// const TEN: Rational = Rational::const_from_signed(10);
/// assert_eq!(TEN, 10);
///
/// const NEGATIVE_TEN: Rational = Rational::const_from_signed(-10);
/// assert_eq!(NEGATIVE_TEN, -10);
/// ```
pub const fn const_from_signed(x: SignedLimb) -> Self {
Self {
sign: x >= 0,
numerator: Natural::const_from(x.unsigned_abs()),
denominator: Natural::ONE,
}
}
}
macro_rules! impl_from_unsigned {
($t: ident) => {
impl From<$t> for Rational {
/// Converts an unsigned primitive integer to a [`Rational`].
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::from_primitive_int#from).
#[inline]
fn from(u: $t) -> Rational {
Rational {
sign: true,
numerator: Natural::from(u),
denominator: Natural::ONE,
}
}
}
};
}
apply_to_unsigneds!(impl_from_unsigned);
macro_rules! impl_from_signed {
($t: ident) => {
impl From<$t> for Rational {
/// Converts a signed primitive integer to a [`Rational`].
///
/// # Worst-case complexity
/// Constant time and additional memory.
///
/// # Examples
/// See [here](super::from_primitive_int#from).
#[inline]
fn from(i: $t) -> Rational {
Rational {
sign: i >= 0,
numerator: Natural::from(i.unsigned_abs()),
denominator: Natural::ONE,
}
}
}
};
}
apply_to_signeds!(impl_from_signed);