|
| 1 | +package libkv |
| 2 | + |
| 3 | +import ( |
| 4 | + "fmt" |
| 5 | + "strings" |
| 6 | + |
| 7 | + "github.com/docker/libkv/store" |
| 8 | + "github.com/go-mixins/loader" |
| 9 | + "github.com/mitchellh/mapstructure" |
| 10 | +) |
| 11 | + |
| 12 | +// Load loads the target from environment |
| 13 | +func (l *Loader) Load(dest interface{}) error { |
| 14 | + cfg := &mapstructure.DecoderConfig{ |
| 15 | + Result: dest, |
| 16 | + WeaklyTypedInput: true, |
| 17 | + } |
| 18 | + decoder, err := mapstructure.NewDecoder(cfg) |
| 19 | + if err != nil { |
| 20 | + return loader.Errors.Wrap(err, "creating map decoder") |
| 21 | + } |
| 22 | + data, err := l.getRecursive(l.prefix) |
| 23 | + if err != nil { |
| 24 | + return err |
| 25 | + } |
| 26 | + fmt.Printf("*** %+v\n", data) |
| 27 | + return loader.Errors.Wrap(decoder.Decode(data), "decoding values") |
| 28 | +} |
| 29 | + |
| 30 | +func put(dest map[string]interface{}, prefix string, val interface{}) { |
| 31 | + path := strings.Split(strings.Trim(prefix, "/"), "/") |
| 32 | + fmt.Printf("&&& %s %#v\n", prefix, path) |
| 33 | + if len(path) == 0 { |
| 34 | + return |
| 35 | + } |
| 36 | + for i := len(path) - 1; i >= 1; i-- { |
| 37 | + val = map[string]interface{}{ |
| 38 | + path[i]: val, |
| 39 | + } |
| 40 | + } |
| 41 | + dest[path[0]] = val |
| 42 | +} |
| 43 | + |
| 44 | +func (l *Loader) getRecursive(prefix string) (interface{}, error) { |
| 45 | + fmt.Printf("### %s\n", prefix) |
| 46 | + pairs, err := l.store.List(prefix) |
| 47 | + if err == store.ErrKeyNotFound { |
| 48 | + return nil, nil |
| 49 | + } |
| 50 | + if err != nil { |
| 51 | + return nil, loader.Errors.Wrap(err, "getting KV list") |
| 52 | + } |
| 53 | + if len(pairs) == 0 { |
| 54 | + val, err := l.store.Get(prefix) |
| 55 | + if err != nil { |
| 56 | + return nil, loader.Errors.Wrap(err, "getting key value") |
| 57 | + } |
| 58 | + if val != nil { |
| 59 | + return string(val.Value), nil |
| 60 | + } |
| 61 | + return nil, nil |
| 62 | + } |
| 63 | + res := make(map[string]interface{}) |
| 64 | + for _, p := range pairs { |
| 65 | + val, err := l.getRecursive(p.Key) |
| 66 | + if err != nil { |
| 67 | + return res, err |
| 68 | + } |
| 69 | + put(res, strings.TrimPrefix(p.Key, prefix), val) |
| 70 | + } |
| 71 | + return res, nil |
| 72 | +} |
0 commit comments