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
#[cfg(test)]
mod tests;
use std::fmt::{Display, Formatter, Result};
#[derive(Debug, Clone, Copy)]
pub struct Radix<T> {
n: T,
base: u32,
}
macro_rules! impl_display {
($i: ty, $u: ty) => {
impl Display for Radix<$i> {
fn fmt(&self, f: &mut Formatter) -> Result {
fn do_format(mut n: $u, base: u32, f: &mut Formatter) -> Result {
const BUF_SIZE: usize = 128;
let mut buffer = [0 as char; BUF_SIZE];
let mut index = BUF_SIZE - 1;
let b = base as $u;
for c in buffer.iter_mut().rev() {
let digit = (n % b) as u8;
*c = match digit {
0...9 => (digit + '0' as u8) as char,
10...35 =>
if f.alternate() {
(digit + 'A' as u8 - 10) as char
} else {
(digit + 'a' as u8 - 10) as char
},
_ => unreachable!("Digit is not in range [0..36]"),
};
n /= b;
if n == 0 {
break;
}
index -= 1;
}
for c in buffer[index..].iter() {
write!(f, "{}", c)?;
}
Ok(())
}
match self.base {
2 => write!(f, "{:b}", self.n),
8 => write!(f, "{:o}", self.n),
10 => write!(f, "{}", self.n),
16 => write!(f, "{:X}", self.n),
base => do_format(self.n as $u, base, f),
}
}
}
};
}
impl_display!(i8, u8);
impl_display!(u8, u8);
impl_display!(i16, u16);
impl_display!(u16, u16);
impl_display!(i32, u32);
impl_display!(u32, u32);
impl_display!(i64, u64);
impl_display!(u64, u64);
impl_display!(isize, usize);
impl_display!(usize, usize);
impl<T> Radix<T> {
pub fn new(n: T, base: u32) -> Self {
assert!(base >= 2 && base <= 36);
Radix { n, base }
}
}
pub fn radix<T>(n: T, base: u32) -> Radix<T> { Radix::new(n, base) }
pub fn radix_3<T>(n: T) -> Radix<T> { Radix::new(n, 3) }
pub fn radix_4<T>(n: T) -> Radix<T> { Radix::new(n, 4) }
pub fn radix_5<T>(n: T) -> Radix<T> { Radix::new(n, 5) }
pub fn radix_6<T>(n: T) -> Radix<T> { Radix::new(n, 6) }
pub fn radix_7<T>(n: T) -> Radix<T> { Radix::new(n, 7) }
pub fn radix_9<T>(n: T) -> Radix<T> { Radix::new(n, 9) }
pub fn radix_11<T>(n: T) -> Radix<T> { Radix::new(n, 11) }
pub fn radix_12<T>(n: T) -> Radix<T> { Radix::new(n, 12) }
pub fn radix_13<T>(n: T) -> Radix<T> { Radix::new(n, 13) }
pub fn radix_14<T>(n: T) -> Radix<T> { Radix::new(n, 14) }
pub fn radix_15<T>(n: T) -> Radix<T> { Radix::new(n, 15) }
pub fn radix_17<T>(n: T) -> Radix<T> { Radix::new(n, 17) }
pub fn radix_18<T>(n: T) -> Radix<T> { Radix::new(n, 18) }
pub fn radix_19<T>(n: T) -> Radix<T> { Radix::new(n, 19) }
pub fn radix_20<T>(n: T) -> Radix<T> { Radix::new(n, 20) }
pub fn radix_21<T>(n: T) -> Radix<T> { Radix::new(n, 21) }
pub fn radix_22<T>(n: T) -> Radix<T> { Radix::new(n, 22) }
pub fn radix_23<T>(n: T) -> Radix<T> { Radix::new(n, 23) }
pub fn radix_24<T>(n: T) -> Radix<T> { Radix::new(n, 24) }
pub fn radix_25<T>(n: T) -> Radix<T> { Radix::new(n, 25) }
pub fn radix_26<T>(n: T) -> Radix<T> { Radix::new(n, 26) }
pub fn radix_27<T>(n: T) -> Radix<T> { Radix::new(n, 27) }
pub fn radix_28<T>(n: T) -> Radix<T> { Radix::new(n, 28) }
pub fn radix_29<T>(n: T) -> Radix<T> { Radix::new(n, 29) }
pub fn radix_30<T>(n: T) -> Radix<T> { Radix::new(n, 30) }
pub fn radix_31<T>(n: T) -> Radix<T> { Radix::new(n, 31) }
pub fn radix_32<T>(n: T) -> Radix<T> { Radix::new(n, 32) }
pub fn radix_33<T>(n: T) -> Radix<T> { Radix::new(n, 33) }
pub fn radix_34<T>(n: T) -> Radix<T> { Radix::new(n, 34) }
pub fn radix_35<T>(n: T) -> Radix<T> { Radix::new(n, 35) }
pub fn radix_36<T>(n: T) -> Radix<T> { Radix::new(n, 36) }