/
main.go
97 lines (85 loc) · 1.32 KB
/
main.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
package main
import (
"fmt"
"log"
"unicode"
"github.com/tj/docopt"
)
const (
Usage = `Bee.
Bee prints a word with it's spelling alphabet.
Usage:
bee <word>...
bee -h | --help
bee --version
Options:
-h --help Show this screen.
--version Show version.`
Version = `1.0.0`
)
var Table = map[rune]string{
'a': "Alfa",
'b': "Bravo",
'c': "Charlie",
'd': "Delta",
'e': "Echo",
'f': "Foxtrot",
'g': "Golf",
'h': "Hotel",
'i': "India",
'j': "Juliett",
'k': "Kilo",
'l': "Lima",
'm': "Mike",
'n': "November",
'o': "Oscar",
'p': "Papa",
'q': "Quebec",
'r': "Romeo",
's': "Sierra",
't': "Tango",
'u': "Uniform",
'v': "Victor",
'w': "Whiskey",
'x': "X-ray",
'y': "Yankee",
'z': "Zulu",
'1': "1",
'2': "2",
'3': "3",
'4': "4",
'5': "5",
'6': "6",
'7': "7",
'8': "8",
'9': "9",
'0': "0",
}
func main() {
arguments, err := docopt.Parse(Usage, nil, true, Version, false)
check(err)
words := arguments["<word>"].([]string)
for _, w := range words {
Spell(w)
fmt.Println()
}
}
func Spell(w string) {
last := len(w) - 1
for i, c := range w {
c = unicode.To(unicode.LowerCase, c)
if val, ok := Table[c]; ok {
fmt.Print(val)
} else {
fmt.Print(string(c))
}
if i != last {
fmt.Print(" ")
}
}
}
func check(err error) {
if err != nil {
log.Fatal(err.Error())
}
}