Function deepSearch

util.go:189–211

deepSearch scans deep maps, following the key indexes listed in the sequence "path". The last value is expected to be another map, and is returned. In case intermediate keys do not exist, or map to a non-map value, a new map is created and inserted, and the search continues from there: the initial

(m map[string]any, path []string)

// a new map is created and inserted, and the search continues from there:
// the initial map "m" may be modified!
func deepSearch(m map[string]any, path []string) map[string]any {
	for _, k := range path {
		m2, ok := m[k]
		if !ok {
			// intermediate key does not exist
			// => create it and continue from there
			m3 := make(map[string]any)
			m[k] = m3
			m = m3
			continue
		}
		m3, ok := m2.(map[string]any)
		if !ok {
			// intermediate key is a value
			// => replace with a new map
			m3 = make(map[string]any)
			m[k] = m3
		}
		// continue search from here
		m = m3
	}
	return m
}