|
1 | | -use num_traits::Zero; |
| 1 | +use core::fmt::Write; |
| 2 | +use num_traits::{Num, ToPrimitive, Zero}; |
2 | 3 |
|
3 | 4 | use super::{make_empty_error, make_overflow_err, make_parse_int_err, FixedUInt, MachineWord}; |
4 | 5 |
|
|
55 | 56 | self.hex_fmt(formatter, false) |
56 | 57 | } |
57 | 58 | } |
| 59 | + |
| 60 | +impl<T: MachineWord, const N: usize> core::fmt::Display for FixedUInt<T, N> { |
| 61 | + fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result { |
| 62 | + const MAX_DIGITS: usize = 20; |
| 63 | + |
| 64 | + if self.is_zero() { |
| 65 | + return f.write_char('0'); |
| 66 | + } |
| 67 | + |
| 68 | + // 20 is sized for u64 |
| 69 | + let mut digit_blocks = [[0u8; MAX_DIGITS]; N]; |
| 70 | + let mut digit_count = 0; |
| 71 | + let mut number = *self; |
| 72 | + let ten = Self::from(10u8); |
| 73 | + |
| 74 | + // Extract digits into our storage |
| 75 | + while !number.is_zero() && digit_count < N * MAX_DIGITS { |
| 76 | + let (quotient, remainder) = number.div_rem(&ten); |
| 77 | + let digit = remainder.to_u8().unwrap(); |
| 78 | + |
| 79 | + let block_idx = digit_count / MAX_DIGITS; |
| 80 | + let digit_idx = digit_count % MAX_DIGITS; |
| 81 | + digit_blocks[block_idx][digit_idx] = b'0' + digit; |
| 82 | + |
| 83 | + digit_count += 1; |
| 84 | + number = quotient; |
| 85 | + } |
| 86 | + |
| 87 | + // Write digits in reverse order |
| 88 | + for i in (0..digit_count).rev() { |
| 89 | + let block_idx = i / MAX_DIGITS; |
| 90 | + let digit_idx = i % MAX_DIGITS; |
| 91 | + f.write_char(digit_blocks[block_idx][digit_idx] as char)?; |
| 92 | + } |
| 93 | + |
| 94 | + Ok(()) |
| 95 | + } |
| 96 | +} |
| 97 | + |
| 98 | +impl<T: MachineWord, const N: usize> core::str::FromStr for FixedUInt<T, N> { |
| 99 | + type Err = core::num::ParseIntError; |
| 100 | + |
| 101 | + fn from_str(s: &str) -> Result<Self, Self::Err> { |
| 102 | + Self::from_str_radix(s, 10) |
| 103 | + } |
| 104 | +} |
0 commit comments