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
pub struct DigitIterator<T>(pub T, bool);
pub trait IntoDigits<T> {
fn digits(self) -> DigitIterator<T>;
}
macro_rules! impl_digit_positive {
($T:ty) => {
impl IntoDigits<$T> for $T {
fn digits(self) -> DigitIterator<$T> {
DigitIterator(self, self == 0)
}
}
impl Iterator for DigitIterator<$T> {
type Item = u8;
fn next(&mut self) -> Option<Self::Item> {
if self.1 {
self.1 = false;
Some(0)
} else if self.0 != 0 {
let remainder = (self.0 % (10 as $T)) as Self::Item;
self.0 /= (10 as $T);
Some(remainder)
} else {
None
}
}
}
};
}
macro_rules! impl_digit_negative {
($T:ty) => {
impl IntoDigits<$T> for $T {
fn digits(self) -> DigitIterator<$T> {
DigitIterator(-self, self == 0)
}
}
impl Iterator for DigitIterator<$T> {
type Item = u8;
fn next(&mut self) -> Option<Self::Item> {
if self.1 {
self.1 = false;
Some(0)
} else if self.0 != 0 {
let remainder = (self.0 % (10 as $T)) as Self::Item;
self.0 /= (10 as $T);
Some(remainder)
} else {
None
}
}
}
};
}
impl_digit_positive!(u8);
impl_digit_positive!(u16);
impl_digit_positive!(u32);
impl_digit_positive!(u64);
impl_digit_positive!(u128);
impl_digit_negative!(i8);
impl_digit_negative!(i16);
impl_digit_negative!(i32);
impl_digit_negative!(i64);
impl_digit_negative!(i128);
#[test]
fn test_all_numbers() {
for x in u128::MIN..10000u128 {
let length = x
.digits()
.enumerate()
.map(|(idx, _)| idx + 1)
.last()
.unwrap();
assert_eq!(length, x.to_string().len());
}
for x in 0..-10000i128 {
let length = x
.digits()
.enumerate()
.map(|(idx, _)| idx + 1)
.last()
.unwrap();
assert_eq!(length, x.to_string().len());
}
}