/
loader.go
69 lines (60 loc) · 1.59 KB
/
loader.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
package kongtoml
import (
"io"
"strings"
"github.com/alecthomas/kong"
"github.com/pelletier/go-toml"
)
func Loader(r io.Reader) (kong.Resolver, error) {
tree, err := toml.LoadReader(r)
if err != nil {
return nil, err
}
var filename string
if named, ok := r.(interface{ Name() string }); ok {
filename = named.Name()
}
return &Resolver{filename: filename, tree: tree.ToMap()}, nil
}
var _ kong.Resolver = (*Resolver)(nil)
type Resolver struct {
filename string
tree map[string]any
}
func (r *Resolver) Resolve(kctx *kong.Context, parent *kong.Path, flag *kong.Flag) (interface{}, error) {
value, ok := r.findValue(parent, flag)
if !ok {
return nil, nil
}
return value, nil
}
func (r *Resolver) Validate(app *kong.Application) error {
// TODO: Validate the configuration maps to valid flags.
return nil
}
func (r *Resolver) findValue(parent *kong.Path, flag *kong.Flag) (any, bool) {
keys := []string{
strings.ReplaceAll(parent.Node().Path(), " ", "-") + "-" + flag.Name,
flag.Name,
}
for _, key := range keys {
parts := strings.Split(key, "-")
if value, ok := r.findValueParts(parts[0], parts[1:], r.tree); ok {
return value, ok
}
}
return nil, false
}
func (r *Resolver) findValueParts(prefix string, suffix []string, tree map[string]any) (any, bool) {
if value, ok := tree[prefix]; ok {
if len(suffix) == 0 {
return value, true
}
if branch, ok := value.(map[string]any); ok {
return r.findValueParts(suffix[0], suffix[1:], branch)
}
} else if len(suffix) > 0 {
return r.findValueParts(prefix+"-"+suffix[0], suffix[1:], tree)
}
return nil, false
}