forked from desertbit/grumble
-
Notifications
You must be signed in to change notification settings - Fork 0
/
commands.go
154 lines (134 loc) · 3.7 KB
/
commands.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
/*
* The MIT License (MIT)
*
* Copyright (c) 2018 Roland Singer [[email protected]]
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
package grumble
import (
"sort"
)
// Commands collection.
type Commands struct {
list []*Command
}
// Add the command to the slice.
// Duplicates are ignored.
func (c *Commands) Add(cmd *Command) {
c.list = append(c.list, cmd)
}
// All returns a slice of all commands.
func (c *Commands) All() []*Command {
return c.list
}
// Get the command by the name. Aliases are also checked.
// Returns nil if not found.
func (c *Commands) Get(name string) *Command {
for _, cmd := range c.list {
if cmd.Name == name {
return cmd
}
for _, a := range cmd.Aliases {
if a == name {
return cmd
}
}
}
return nil
}
// FindCommand searches for the final command through all children.
// Returns a slice of non processed following command args.
// Returns cmd=nil if not found.
func (c *Commands) FindCommand(args []string) (cmd *Command, rest []string, err error) {
var cmds []*Command
cmds, _, rest, err = c.parse(args, nil, true)
if err != nil {
return
}
if len(cmds) > 0 {
cmd = cmds[len(cmds)-1]
}
return
}
// Sort the commands by their name.
func (c *Commands) Sort() {
sort.Slice(c.list, func(i, j int) bool {
return c.list[i].Name < c.list[j].Name
})
}
// SortRecursive sorts the commands by their name including all sub commands.
func (c *Commands) SortRecursive() {
c.Sort()
for _, cmd := range c.list {
cmd.commands.SortRecursive()
}
}
// parse the args and return a command path to the root.
// cmds slice is empty, if no command was found.
func (c *Commands) parse(
args []string,
parentFlagMap FlagMap,
skipFlagMaps bool,
) (
cmds []*Command,
flagsMap FlagMap,
rest []string,
err error,
) {
var fgs []FlagMap
cur := c
for len(args) > 0 && cur != nil {
// Extract the command name from the arguments.
name := args[0]
// Try to find the command.
cmd := cur.Get(name)
if cmd == nil {
break
}
args = args[1:]
cmds = append(cmds, cmd)
cur = &cmd.commands
// Parse the command flags.
fg := make(FlagMap)
args, err = cmd.flags.parse(args, fg)
if err != nil {
return
}
if !skipFlagMaps {
fgs = append(fgs, fg)
}
}
if !skipFlagMaps {
// Merge all the flag maps without default values.
flagsMap = make(FlagMap)
for i := len(fgs) - 1; i >= 0; i-- {
flagsMap.copyMissingValues(fgs[i], false)
}
flagsMap.copyMissingValues(parentFlagMap, false)
// Now include default values. This will ensure, that default values have
// lower rank.
for i := len(fgs) - 1; i >= 0; i-- {
flagsMap.copyMissingValues(fgs[i], true)
}
flagsMap.copyMissingValues(parentFlagMap, true)
}
rest = args
return
}