-
-
Notifications
You must be signed in to change notification settings - Fork 6
/
flagset.go
154 lines (133 loc) · 3.5 KB
/
flagset.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
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
package pflagfork
import (
"reflect"
"regexp"
"strings"
"github.com/spf13/pflag"
)
type FlagSet struct {
*pflag.FlagSet
}
func (f FlagSet) IsInterspersed() bool {
if fv := reflect.ValueOf(f.FlagSet).Elem().FieldByName("interspersed"); fv.IsValid() {
return fv.Bool()
}
return false
}
func (f FlagSet) IsPosix() bool {
if method := reflect.ValueOf(f.FlagSet).MethodByName("IsPosix"); method.IsValid() {
if values := method.Call([]reflect.Value{}); len(values) == 1 && values[0].Kind() == reflect.Bool {
return values[0].Bool()
}
}
return true
}
func (f FlagSet) IsShorthandSeries(arg string) bool {
re := regexp.MustCompile("^-(?P<shorthand>[^-].*)")
return re.MatchString(arg) && f.IsPosix()
}
func (f FlagSet) IsMutuallyExclusive(flag *pflag.Flag) bool {
if groups, ok := flag.Annotations["cobra_annotation_mutually_exclusive"]; ok {
for _, group := range groups {
for _, name := range strings.Split(group, " ") {
if other := f.Lookup(name); other != nil && other.Changed {
return true
}
}
}
}
return false
}
func (f *FlagSet) VisitAll(fn func(*Flag)) {
f.FlagSet.VisitAll(func(flag *pflag.Flag) {
fn(&Flag{Flag: flag, Args: []string{}})
})
}
func (fs FlagSet) LookupArg(arg string) (result *Flag) {
isPosix := fs.IsPosix()
switch {
case strings.HasPrefix(arg, "--"):
return fs.lookupPosixLonghandArg(arg)
case isPosix:
return fs.lookupPosixShorthandArg(arg)
case !isPosix:
return fs.lookupNonPosixShorthandArg(arg)
}
return
}
func (fs FlagSet) ShorthandLookup(name string) *Flag {
if f := fs.FlagSet.ShorthandLookup(name); f != nil {
return &Flag{
Flag: f,
Args: []string{},
}
}
return nil
}
func (fs FlagSet) lookupPosixLonghandArg(arg string) (flag *Flag) {
if !strings.HasPrefix(arg, "--") {
return nil
}
fs.VisitAll(func(f *Flag) { // TODO needs to be sorted to try longest matching first
if flag != nil || f.Mode() != Default {
return
}
splitted := strings.SplitAfterN(arg, string(f.OptargDelimiter()), 2)
if strings.TrimSuffix(splitted[0], string(f.OptargDelimiter())) == "--"+f.Name {
flag = f
flag.Prefix = splitted[0]
if len(splitted) > 1 {
flag.Args = splitted[1:]
}
}
})
return
}
func (fs FlagSet) lookupPosixShorthandArg(arg string) *Flag {
if !strings.HasPrefix(arg, "-") || !fs.IsPosix() || len(arg) < 2 {
return nil
}
for index, r := range arg[1:] {
index += 1
flag := fs.ShorthandLookup(string(r))
switch {
case flag == nil:
return flag
case len(arg) == index+1:
flag.Prefix = arg
return flag
case arg[index+1] == byte(flag.OptargDelimiter()) && len(arg) > index+2:
flag.Prefix = arg[:index+2]
flag.Args = []string{arg[index+2:]}
return flag
case arg[index+1] == byte(flag.OptargDelimiter()):
flag.Prefix = arg[:index+2]
flag.Args = []string{""}
return flag
case !flag.IsOptarg() && len(arg) > index+1:
flag.Prefix = arg[:index+1]
flag.Args = []string{arg[index+1:]}
return flag
}
}
return nil
}
func (fs FlagSet) lookupNonPosixShorthandArg(arg string) (result *Flag) { // TODO pretty much duplicates longhand lookup
if !strings.HasPrefix(arg, "-") {
return nil
}
fs.VisitAll(func(f *Flag) { // TODO needs to be sorted to try longest matching first
if result != nil {
return
}
splitted := strings.SplitAfterN(arg, string(f.OptargDelimiter()), 2)
if strings.TrimSuffix(splitted[0], string(f.OptargDelimiter())) == "-"+f.Shorthand {
result = f
result.Prefix = splitted[0]
if len(splitted) > 1 {
result.Args = splitted[1:]
}
}
})
return
}