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
|
package minimist
import (
"os"
"regexp"
//"strings"
)
func nextString(list []string, i int) *string {
if i+1 < len(list) {
return &list[i+1]
}
return nil
}
func sliceContains(slice []string, needle string) bool {
if slice == nil {
return false
}
for _, s := range slice {
if s == needle {
return true
}
}
return false
}
var integerRe = regexp.MustCompile(`^-?\d+$`)
var numberRe = regexp.MustCompile(`^-?\d+(\.\d+)?(e-?\d+)?$`)
// --port=8000
var longFormEqualRe = regexp.MustCompile(`^--.+=`)
var longFormEqualValsRe = regexp.MustCompile(`^--([^=]+)=(.*)$`)
// --port 8000
var longFormRe = regexp.MustCompile(`^--.+`)
var longFormKeyRe = regexp.MustCompile(`^--(.+)`)
//longFormSpaceValsRe := regexp.MustCompile(`^--([^=])=([\s\S]*)$`)
// --no-debug
var negateRe = regexp.MustCompile(`^--no-.+`)
var negateValsRe = regexp.MustCompile(`^--no-(.+)`)
// -abc
var shortFormRe = regexp.MustCompile(`^-[^-]+`)
var lettersRe = regexp.MustCompile(`^[A-Za-z]`)
var notWordRe = regexp.MustCompile(`\W`)
var dashesRe = regexp.MustCompile(`^(-|--)`)
var trueFalseRe = regexp.MustCompile(`^(true|false)`)
// Parse parses os.Args excluding os.Args[0].
func Parse() ArgMap {
return ParseArgv(os.Args[1:])
}
// ParseArgv parses an argv for options.
func ParseArgv(argv []string) ArgMap {
rest := []string{}
result := map[string]interface{}{
"_": rest,
"--": []string{},
}
setArg := func(key string, val interface{}) {
result[key] = val
}
l := len(argv)
argsAt := func(i int) string {
if i > -1 && i < l {
return argv[i]
}
return ""
}
i := 0
for i < len(argv) {
arg := argv[i]
if arg == "--" {
result["--"] = argv[i+1:]
break
}
argAt := func(i int) string {
if i >= 0 && i < len(arg) {
return arg[i : i+1]
}
return ""
}
if longFormEqualRe.MatchString(arg) {
// --long-form=value
m := longFormEqualValsRe.FindStringSubmatch(arg)
//fmt.Printf("--long-form= %s\n", arg)
setArg(m[1], m[2])
} else if negateRe.MatchString(arg) {
//fmt.Printf("--no-flag %s\n", arg)
m := negateValsRe.FindStringSubmatch(arg)
setArg(m[1], false)
} else if longFormRe.MatchString(arg) {
// --long-form
//fmt.Printf("--long-form %s\n", arg)
key := longFormKeyRe.FindStringSubmatch(arg)[1]
next := argsAt(i + 1)
if next == "" {
// --arg
setArg(key, true)
} else if next[0:1] == "-" {
// --arg -o | --arg --other
setArg(key, true)
} else {
setArg(key, next)
i++
}
} else if shortFormRe.MatchString(arg) {
// -abc a, b are boolean c is undetermined
//fmt.Printf("-short-form %s\n", arg)
letters := arg[1:]
L := len(letters)
lettersAt := func(i int) string {
if i < L {
return letters[i : i+1]
}
return ""
}
broken := false
k := 0
for k < len(letters) {
next := arg[k+2:]
if next == "-" {
setArg(lettersAt(k), next)
k++
continue
}
if lettersRe.MatchString(lettersAt(k)) && numberRe.MatchString(next) {
setArg(lettersAt(k), next)
broken = true
break
}
if k+1 < len(letters) && notWordRe.MatchString(lettersAt(k+1)) {
setArg(lettersAt(k), next)
broken = true
break
}
setArg(lettersAt(k), true)
k++
}
key := argAt(len(arg) - 1)
if !broken && key != "-" {
if i+1 < len(argv) {
nextArg := argv[i+1]
if !dashesRe.MatchString(nextArg) {
setArg(key, nextArg)
i++
}
} else {
setArg(key, true)
}
}
} else {
rest = append(rest, arg)
result["_"] = rest
}
i++
}
return result
}
|
