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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
// 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 alloc::string::String;
use core::fmt::{Binary, Debug, Display, Formatter, LowerHex, Octal, Result, UpperHex, Write};
use malachite_base::num::conversion::traits::ToStringBase;
impl ToStringBase for Rational {
/// Converts a [`Rational`] to a [`String`] using a specified base.
///
/// The numerator is written first, followed by a `'/'` and the denominator, unless the
/// denominator is 1, in which case only the numerator is written. For bases up to 36, digits
/// from 0 to 9 become [`char`]s from `'0'` to `'9'` and digits from 10 to 35 become the
/// lowercase [`char`]s `'a'` to `'z'`. For bases from 37 through 62 the uppercase and lowercase
/// letters are distinct digits, `'A'` through `'Z'` representing 10 through 35 and `'a'`
/// through `'z'` representing 36 through 61, as in GMP.
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Panics
/// Panics if `base` is less than 2 or greater than 62.
///
/// # Examples
/// ```
/// use malachite_base::num::conversion::traits::ToStringBase;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::from(1000).to_string_base(10), "1000");
/// assert_eq!(Rational::from_signeds(22, 7).to_string_base(10), "22/7");
/// assert_eq!(Rational::from_signeds(-255, 7).to_string_base(16), "-ff/7");
/// assert_eq!(Rational::from_signeds(1000, 7).to_string_base(36), "rs/7");
/// // above base 36, the uppercase and lowercase letters are distinct digits
/// assert_eq!(
/// Rational::from_signeds(-1000, 61).to_string_base(62),
/// "-G8/z"
/// );
/// ```
fn to_string_base(&self, base: u8) -> String {
let mut s = String::new();
if !self.sign {
s.push('-');
}
s.push_str(&self.numerator.to_string_base(base));
if self.denominator != 1u32 {
s.push('/');
s.push_str(&self.denominator.to_string_base(base));
}
s
}
/// Converts a [`Rational`] to a [`String`] using a specified base, with the digits of the
/// numerator and denominator being uppercase.
///
/// The numerator is written first, followed by a `'/'` and the denominator, unless the
/// denominator is 1, in which case only the numerator is written. For bases up to 36, digits
/// from 0 to 9 become [`char`]s from `'0'` to `'9'` and digits from 10 to 35 become the
/// uppercase [`char`]s `'A'` to `'Z'`. For bases from 37 through 62 there is only one alphabet,
/// with the uppercase and lowercase letters as distinct digits, so the result is the same as
/// [`to_string_base`](ToStringBase::to_string_base)'s.
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Panics
/// Panics if `base` is less than 2 or greater than 62.
///
/// # Examples
/// ```
/// use malachite_base::num::conversion::traits::ToStringBase;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::from(1000).to_string_base_upper(10), "1000");
/// assert_eq!(
/// Rational::from_signeds(-255, 7).to_string_base_upper(16),
/// "-FF/7"
/// );
/// assert_eq!(
/// Rational::from_signeds(1000, 7).to_string_base_upper(36),
/// "RS/7"
/// );
/// // above base 36, the uppercase and lowercase letters are distinct digits
/// assert_eq!(
/// Rational::from_signeds(-1000, 61).to_string_base_upper(62),
/// "-G8/z"
/// );
/// ```
fn to_string_base_upper(&self, base: u8) -> String {
let mut s = String::new();
if !self.sign {
s.push('-');
}
s.push_str(&self.numerator.to_string_base_upper(base));
if self.denominator != 1u32 {
s.push('/');
s.push_str(&self.denominator.to_string_base_upper(base));
}
s
}
}
impl Binary for Rational {
/// Converts a [`Rational`] to a binary [`String`].
///
/// The numerator and denominator are each written in binary, separated by a `'/'`, unless the
/// denominator is 1, in which case only the numerator is written. Using the `#` format flag
/// prepends `"0b"` to each of them.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Examples
/// ```
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::strings::ToBinaryString;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::ZERO.to_binary_string(), "0");
/// assert_eq!(Rational::from(123).to_binary_string(), "1111011");
/// assert_eq!(
/// Rational::from_signeds(22, 7).to_binary_string(),
/// "10110/111"
/// );
/// assert_eq!(
/// Rational::from_signeds(-22, 7).to_binary_string(),
/// "-10110/111"
/// );
///
/// assert_eq!(format!("{:#b}", Rational::ZERO), "0b0");
/// assert_eq!(
/// format!("{:#b}", Rational::from_signeds(22, 7)),
/// "0b10110/0b111"
/// );
/// assert_eq!(
/// format!("{:#b}", Rational::from_signeds(-22, 7)),
/// "-0b10110/0b111"
/// );
/// ```
fn fmt(&self, f: &mut Formatter) -> Result {
if !self.sign {
f.write_char('-')?;
}
let result = Binary::fmt(&self.numerator, f);
if self.denominator == 1u32 {
result
} else {
f.write_char('/')?;
Binary::fmt(&self.denominator, f)
}
}
}
impl Octal for Rational {
/// Converts a [`Rational`] to an octal [`String`].
///
/// The numerator and denominator are each written in octal, separated by a `'/'`, unless the
/// denominator is 1, in which case only the numerator is written. Using the `#` format flag
/// prepends `"0o"` to each of them.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Examples
/// ```
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::strings::ToOctalString;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::ZERO.to_octal_string(), "0");
/// assert_eq!(Rational::from(123).to_octal_string(), "173");
/// assert_eq!(Rational::from_signeds(22, 7).to_octal_string(), "26/7");
/// assert_eq!(Rational::from_signeds(-22, 7).to_octal_string(), "-26/7");
///
/// assert_eq!(format!("{:#o}", Rational::ZERO), "0o0");
/// assert_eq!(format!("{:#o}", Rational::from_signeds(22, 7)), "0o26/0o7");
/// assert_eq!(
/// format!("{:#o}", Rational::from_signeds(-22, 7)),
/// "-0o26/0o7"
/// );
/// ```
fn fmt(&self, f: &mut Formatter) -> Result {
if !self.sign {
f.write_char('-')?;
}
let result = Octal::fmt(&self.numerator, f);
if self.denominator == 1u32 {
result
} else {
f.write_char('/')?;
Octal::fmt(&self.denominator, f)
}
}
}
impl LowerHex for Rational {
/// Converts a [`Rational`] to a hexadecimal [`String`] using lowercase characters.
///
/// The numerator and denominator are each written in hexadecimal, separated by a `'/'`, unless
/// the denominator is 1, in which case only the numerator is written. Using the `#` format flag
/// prepends `"0x"` to each of them.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Examples
/// ```
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::strings::ToLowerHexString;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::ZERO.to_lower_hex_string(), "0");
/// assert_eq!(Rational::from(123).to_lower_hex_string(), "7b");
/// assert_eq!(Rational::from_signeds(255, 7).to_lower_hex_string(), "ff/7");
/// assert_eq!(
/// Rational::from_signeds(-255, 7).to_lower_hex_string(),
/// "-ff/7"
/// );
///
/// assert_eq!(format!("{:#x}", Rational::ZERO), "0x0");
/// assert_eq!(format!("{:#x}", Rational::from_signeds(255, 7)), "0xff/0x7");
/// assert_eq!(
/// format!("{:#x}", Rational::from_signeds(-255, 7)),
/// "-0xff/0x7"
/// );
/// ```
fn fmt(&self, f: &mut Formatter) -> Result {
if !self.sign {
f.write_char('-')?;
}
let result = LowerHex::fmt(&self.numerator, f);
if self.denominator == 1u32 {
result
} else {
f.write_char('/')?;
LowerHex::fmt(&self.denominator, f)
}
}
}
impl UpperHex for Rational {
/// Converts a [`Rational`] to a hexadecimal [`String`] using uppercase characters.
///
/// The numerator and denominator are each written in hexadecimal, separated by a `'/'`, unless
/// the denominator is 1, in which case only the numerator is written. Using the `#` format flag
/// prepends `"0x"` to each of them.
///
/// # Worst-case complexity
/// $T(n) = O(n)$
///
/// $M(n) = O(n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Examples
/// ```
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::strings::ToUpperHexString;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::ZERO.to_upper_hex_string(), "0");
/// assert_eq!(Rational::from(123).to_upper_hex_string(), "7B");
/// assert_eq!(Rational::from_signeds(255, 7).to_upper_hex_string(), "FF/7");
/// assert_eq!(
/// Rational::from_signeds(-255, 7).to_upper_hex_string(),
/// "-FF/7"
/// );
///
/// assert_eq!(format!("{:#X}", Rational::ZERO), "0x0");
/// assert_eq!(format!("{:#X}", Rational::from_signeds(255, 7)), "0xFF/0x7");
/// assert_eq!(
/// format!("{:#X}", Rational::from_signeds(-255, 7)),
/// "-0xFF/0x7"
/// );
/// ```
fn fmt(&self, f: &mut Formatter) -> Result {
if !self.sign {
f.write_char('-')?;
}
let result = UpperHex::fmt(&self.numerator, f);
if self.denominator == 1u32 {
result
} else {
f.write_char('/')?;
UpperHex::fmt(&self.denominator, f)
}
}
}
impl Display for Rational {
/// Converts a [`Rational`] to a [`String`].
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Examples
/// ```
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_q::Rational;
/// use std::str::FromStr;
///
/// assert_eq!(Rational::ZERO.to_string(), "0");
/// assert_eq!(Rational::from(123).to_string(), "123");
/// assert_eq!(Rational::from_str("22/7").unwrap().to_string(), "22/7");
/// ```
fn fmt(&self, f: &mut Formatter) -> Result {
if !self.sign {
f.write_char('-')?;
}
let result = Display::fmt(&self.numerator, f);
if self.denominator == 1u32 {
result
} else {
f.write_char('/')?;
Display::fmt(&self.denominator, f)
}
}
}
impl Debug for Rational {
/// Converts a [`Rational`] to a [`String`].
///
/// This is the same implementation as for [`Display`].
///
/// # Worst-case complexity
/// $T(n) = O(n (\log n)^2 \log\log n)$
///
/// $M(n) = O(n \log n)$
///
/// where $T$ is time, $M$ is additional memory, and $n$ is `self.significant_bits()`.
///
/// # Examples
/// ```
/// use malachite_base::num::basic::traits::Zero;
/// use malachite_base::strings::ToDebugString;
/// use malachite_q::Rational;
///
/// assert_eq!(Rational::ZERO.to_debug_string(), "0");
/// assert_eq!(Rational::from(123).to_debug_string(), "123");
/// assert_eq!(Rational::from_signeds(22, 7).to_debug_string(), "22/7");
/// ```
#[inline]
fn fmt(&self, f: &mut Formatter) -> Result {
Display::fmt(self, f)
}
}