-
Notifications
You must be signed in to change notification settings - Fork 2
/
mapping.go
143 lines (133 loc) · 3.1 KB
/
mapping.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
// Package dig provides a map[string]any Mapping type that has ruby-like "dig" functionality.
//
// It can be used for example to access and manipulate arbitrary nested YAML/JSON structures.
package dig
import "fmt"
// Mapping is a nested key-value map where the keys are strings and values are any. In Ruby it is called a Hash (with string keys), in YAML it's called a "mapping".
type Mapping map[string]any
// UnmarshalYAML for supporting yaml.Unmarshal
func (m *Mapping) UnmarshalYAML(unmarshal func(any) error) error {
var result map[string]any
if err := unmarshal(&result); err != nil {
return err
}
*m = cleanUpInterfaceMap(result)
return nil
}
// Dig is a simplistic implementation of a Ruby-like Hash.dig functionality.
//
// It returns a value from a (deeply) nested tree structure.
func (m *Mapping) Dig(keys ...string) any {
v, ok := (*m)[keys[0]]
if !ok {
return nil
}
switch v := v.(type) {
case Mapping:
if len(keys) == 1 {
return v
}
return v.Dig(keys[1:]...)
default:
if len(keys) > 1 {
return nil
}
return v
}
}
// DigString is like Dig but returns the value as string
func (m *Mapping) DigString(keys ...string) string {
v := m.Dig(keys...)
val, ok := v.(string)
if !ok {
return ""
}
return val
}
// DigMapping always returns a mapping, creating missing or overwriting non-mapping branches in between
func (m *Mapping) DigMapping(keys ...string) Mapping {
k := keys[0]
cur := (*m)[k]
switch v := cur.(type) {
case Mapping:
if len(keys) > 1 {
return v.DigMapping(keys[1:]...)
}
return v
default:
n := Mapping{}
(*m)[k] = n
if len(keys) > 1 {
return n.DigMapping(keys[1:]...)
}
return n
}
}
// Dup creates a dereferenced copy of the Mapping
func (m *Mapping) Dup() Mapping {
new := make(Mapping, len(*m))
for k, v := range *m {
switch vt := v.(type) {
case Mapping:
new[k] = vt.Dup()
case *Mapping:
new[k] = vt.Dup()
case []Mapping:
var ns []Mapping
for _, sv := range vt {
ns = append(ns, sv.Dup())
}
new[k] = ns
case []*Mapping:
var ns []Mapping
for _, sv := range vt {
ns = append(ns, sv.Dup())
}
new[k] = ns
case []string:
var ns []string
ns = append(ns, vt...)
new[k] = ns
case []int:
var ns []int
ns = append(ns, vt...)
new[k] = ns
case []bool:
var ns []bool
ns = append(ns, vt...)
new[k] = ns
default:
new[k] = vt
}
}
return new
}
// Cleans up a slice of interfaces into slice of actual values
func cleanUpInterfaceArray(in []any) []any {
result := make([]any, len(in))
for i, v := range in {
result[i] = cleanUpMapValue(v)
}
return result
}
// Cleans up the map keys to be strings
func cleanUpInterfaceMap(in map[string]any) Mapping {
result := make(Mapping)
for k, v := range in {
result[fmt.Sprintf("%v", k)] = cleanUpMapValue(v)
}
return result
}
// Cleans up the value in the map, recurses in case of arrays and maps
func cleanUpMapValue(v any) any {
switch v := v.(type) {
case []any:
return cleanUpInterfaceArray(v)
case map[string]any:
return cleanUpInterfaceMap(v)
case string, int, bool, nil:
return v
default:
return fmt.Sprintf("%v", v)
}
}