(data any, p tree.Path, ignoreParseError bool)
| 78 | } |
| 79 | |
| 80 | func transform(data any, p tree.Path, ignoreParseError bool) (any, error) { |
| 81 | for pattern, transformer := range transformers { |
| 82 | if p.Matches(pattern) { |
| 83 | t, err := transformer(data, p, ignoreParseError) |
| 84 | if err != nil { |
| 85 | return nil, err |
| 86 | } |
| 87 | return t, nil |
| 88 | } |
| 89 | } |
| 90 | switch v := data.(type) { |
| 91 | case map[string]any: |
| 92 | a, err := transformMapping(v, p, ignoreParseError) |
| 93 | if err != nil { |
| 94 | return a, err |
| 95 | } |
| 96 | return v, nil |
| 97 | case []any: |
| 98 | a, err := transformSequence(v, p, ignoreParseError) |
| 99 | if err != nil { |
| 100 | return a, err |
| 101 | } |
| 102 | return v, nil |
| 103 | default: |
| 104 | return data, nil |
| 105 | } |
| 106 | } |
| 107 | |
| 108 | func transformSequence(v []any, p tree.Path, ignoreParseError bool) ([]any, error) { |
| 109 | for i, e := range v { |
no test coverage detected
searching dependent graphs…