forked from lynn9388/supsub
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathconvert_test.go
101 lines (89 loc) · 2.21 KB
/
convert_test.go
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
/*
* Copyright © 2018 Lynn <[email protected]>
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package supsub
import (
"fmt"
"sort"
"testing"
)
type runes []rune
func (r runes) Len() int { return len(r) }
func (r runes) Less(i, j int) bool { return r[i] < r[j] }
func (r runes) Swap(i, j int) { r[i], r[j] = r[j], r[i] }
func TestSup(t *testing.T) {
fmt.Println("Superscripts:")
for _, r := range getSortedKeys(superscripts) {
s, err := Sup(r)
if err != nil && s != r {
t.Errorf("no corresponding superscript and returns different value: Sup(%c) = %c", r, s)
}
fmt.Printf("%c%c ", r, s)
}
fmt.Println()
}
func TestToSup(t *testing.T) {
s := "0123456789"
fmt.Println(s + "\n" + ToSup(s))
}
func TestSub(t *testing.T) {
fmt.Println("Subscripts:")
for _, r := range getSortedKeys(subscripts) {
s, err := Sub(r)
if err != nil && s != r {
t.Errorf("no corresponding subscript and returns different value: Sub(%c) = %c", r, s)
}
fmt.Printf("%c%c ", r, s)
}
fmt.Println()
}
func TestToSub(t *testing.T) {
s := "0123456789"
fmt.Println(s + "\n" + ToSub(s))
}
func TestConvertList(t *testing.T) {
set := make(map[rune]struct{})
for k := range superscripts {
set[k] = struct{}{}
}
for k := range subscripts {
set[k] = struct{}{}
}
var keys []rune
for k := range set {
keys = append(keys, k)
}
sort.Sort(runes(keys))
fmt.Println("Convert list:")
for _, k := range keys {
sup, ok := superscripts[k]
if !ok {
sup = ' '
}
sub, ok := subscripts[k]
if !ok {
sub = ' '
}
fmt.Printf("%c %c %c\n", k, sup, sub)
}
}
func getSortedKeys(m map[rune]rune) []rune {
var keys []rune
for key := range m {
keys = append(keys, key)
}
sort.Sort(runes(keys))
return keys
}