package jsonpath import ( "encoding/json" "fmt" "strconv" "strings" ) // Eval is a half-baked json path implementation that needs some love func Eval(path string, b []byte) (string, int, error) { if len(path) == 0 && !(len(b) != 0 && b[0] == '[' && b[len(b)-1] == ']') { // if there's no path AND the value is not a JSON array, then there's nothing to walk return string(b), len(b), nil } var object interface{} if err := json.Unmarshal(b, &object); err != nil { return "", 0, err } return walk(path, object) } // walk traverses the object and returns the value as a string as well as its length func walk(path string, object interface{}) (string, int, error) { var keys []string startOfCurrentKey, bracketDepth := 0, 0 for i := range path { if path[i] == '[' { bracketDepth++ } else if path[i] == ']' { bracketDepth-- } // If we encounter a dot, we've reached the end of a key unless we're inside a bracket if path[i] == '.' && bracketDepth == 0 { keys = append(keys, path[startOfCurrentKey:i]) startOfCurrentKey = i + 1 } } if startOfCurrentKey <= len(path) { keys = append(keys, path[startOfCurrentKey:]) } currentKey := keys[0] switch value := extractValue(currentKey, object).(type) { case map[string]interface{}: newPath := strings.Replace(path, fmt.Sprintf("%s.", currentKey), "", 1) if path == newPath { // If the path hasn't changed, it means we're at the end of the path // So we'll treat it as a string by re-marshaling it to JSON since it's a map. // Note that the output JSON will be minified. b, err := json.Marshal(value) return string(b), len(b), err } return walk(newPath, value) case string: if len(keys) > 1 { return "", 0, fmt.Errorf("couldn't walk through '%s', because '%s' was a string instead of an object", keys[1], currentKey) } return value, len(value), nil case []interface{}: return fmt.Sprintf("%v", value), len(value), nil case interface{}: newValue := fmt.Sprintf("%v", value) return newValue, len(newValue), nil default: return "", 0, fmt.Errorf("couldn't walk through '%s' because type was '%T', but expected 'map[string]interface{}'", currentKey, value) } } func extractValue(currentKey string, value interface{}) interface{} { // Check if the current key ends with [#] if strings.HasSuffix(currentKey, "]") && strings.Contains(currentKey, "[") { var isNestedArray bool var index string startOfBracket, endOfBracket, bracketDepth := 0, 0, 0 for i := range currentKey { if currentKey[i] == '[' { startOfBracket = i bracketDepth++ } else if currentKey[i] == ']' && bracketDepth == 1 { bracketDepth-- endOfBracket = i index = currentKey[startOfBracket+1 : i] if len(currentKey) > i+1 && currentKey[i+1] == '[' { isNestedArray = true // there's more keys. } break } } arrayIndex, err := strconv.Atoi(index) if err != nil { return nil } currentKeyWithoutIndex := currentKey[:startOfBracket] // if currentKeyWithoutIndex contains only an index (i.e. [0] or 0) if len(currentKeyWithoutIndex) == 0 { array, _ := value.([]interface{}) if len(array) > arrayIndex { if isNestedArray { return extractValue(currentKey[endOfBracket+1:], array[arrayIndex]) } return array[arrayIndex] } return nil } if value == nil || value.(map[string]interface{})[currentKeyWithoutIndex] == nil { return nil } // if currentKeyWithoutIndex contains both a key and an index (i.e. data[0]) array, _ := value.(map[string]interface{})[currentKeyWithoutIndex].([]interface{}) if len(array) > arrayIndex { if isNestedArray { return extractValue(currentKey[endOfBracket+1:], array[arrayIndex]) } return array[arrayIndex] } return nil } if valueAsSlice, ok := value.([]interface{}); ok { // If the type is a slice, return it return valueAsSlice } // otherwise, it's a map return value.(map[string]interface{})[currentKey] }