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 fn is_superscript(c: &char) -> bool {
matches!(
c,
'⁰' | '¹'
| '²'
| '³'
| '⁴'
| '⁵'
| '⁶'
| '⁷'
| '⁸'
| '⁹'
| '⁺'
| '⁻'
| '⁼'
| '⁽'
| '⁾'
| 'ᵀ'
)
}
pub fn is_subscript(c: &char) -> bool {
matches!(
c,
'₀' | '₁'
| '₂'
| '₃'
| '₄'
| '₅'
| '₆'
| '₇'
| '₈'
| '₉'
| '₊'
| '₋'
| '₌'
| '₍'
| '₎'
| 'ₖ'
| 'ₗ'
| 'ₘ'
| 'ₙ'
| 'ₓ'
)
}
pub fn parse_subscript(chars: impl Iterator<Item = char>) -> Option<u8> {
subscript_to_normal(chars).parse::<u8>().ok()
}
pub fn subscript_to_normal(chars: impl Iterator<Item = char>) -> String {
let mut regular = String::new();
for c in chars {
regular.push(match c {
'₀' => '0',
'₁' => '1',
'₂' => '2',
'₃' => '3',
'₄' => '4',
'₅' => '5',
'₆' => '6',
'₇' => '7',
'₈' => '8',
'₉' => '9',
'₊' => '+',
'₋' => '-',
'₌' => '=',
'₍' => '(',
'₎' => ')',
'ₖ' => 'k',
'ₗ' => 'l',
'ₘ' => 'm',
'ₙ' => 'n',
'ᵀ' => 'T',
_ => c,
});
}
regular.trim().to_string()
}
pub fn normal_to_subscript(chars: impl Iterator<Item = char>) -> String {
let mut subscript = String::new();
for c in chars {
subscript.push(match c {
'0' => '₀',
'1' => '₁',
'2' => '₂',
'3' => '₃',
'4' => '₄',
'5' => '₅',
'6' => '₆',
'7' => '₇',
'8' => '₈',
'9' => '₉',
'+' => '₊',
'-' => '₋',
'=' => '₌',
'(' => '₍',
')' => '₎',
'k' => 'ₖ',
'l' => 'ₗ',
'm' => 'ₘ',
'n' => 'ₙ',
'x' => 'ₓ',
_ => c,
});
}
subscript
}