forked from TomWright/dasel
-
Notifications
You must be signed in to change notification settings - Fork 0
/
parse_selector.go
150 lines (128 loc) · 3.48 KB
/
parse_selector.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
144
145
146
147
148
149
150
package dasel
import (
"fmt"
"strconv"
"strings"
)
// ParseSelector parses the given selector string and returns a Selector.
func ParseSelector(selector string) (Selector, error) {
sel := Selector{
Raw: selector,
Current: "",
Remaining: "",
Type: "",
Property: "",
Conditions: make([]Condition, 0),
}
{
nextSelector, read := ExtractNextSelector(sel.Raw)
sel.Current = nextSelector
sel.Remaining = sel.Raw[read:]
}
nextSel := strings.TrimPrefix(sel.Current, ".")
var err error
switch {
case strings.HasPrefix(nextSel, "(?:") && strings.HasSuffix(nextSel, ")"):
sel, err = processParseSelectorSearch(nextSel, sel)
case strings.HasPrefix(nextSel, "(") && strings.HasSuffix(nextSel, ")"):
sel, err = processParseSelectorDynamic(nextSel, sel)
case nextSel == "[]":
sel, err = processParseSelectorNextAvailableIndex(nextSel, sel)
case nextSel == "[*]":
sel, err = processParseSelectorIndexAny(nextSel, sel)
case strings.HasPrefix(nextSel, "[") && strings.HasSuffix(nextSel, "]"):
sel, err = processParseSelectorIndex(nextSel, sel)
default:
sel, err = processParseSelectorProperty(nextSel, sel)
}
return sel, err
}
func processParseSelectorDynamic(selector string, sel Selector) (Selector, error) {
sel.Type = "DYNAMIC"
dynamicGroups, err := DynamicSelectorToGroups(selector)
if err != nil {
return sel, err
}
for _, g := range dynamicGroups {
m := dynamicSelectorRegexp.FindStringSubmatch(g)
if m == nil {
return sel, fmt.Errorf("invalid search format")
}
var cond Condition
switch m[2] {
case "=":
cond = &EqualCondition{
Key: m[1],
Value: m[3],
}
default:
return sel, &UnknownComparisonOperatorErr{Operator: m[2]}
}
sel.Conditions = append(sel.Conditions, cond)
}
return sel, nil
}
func processParseSelectorSearch(selector string, sel Selector) (Selector, error) {
sel.Type = "SEARCH"
dynamicGroups, err := DynamicSelectorToGroups(selector)
if err != nil {
return sel, err
}
if len(dynamicGroups) != 1 {
return sel, fmt.Errorf("require exactly 1 group in search selector")
}
for _, g := range dynamicGroups {
m := dynamicSelectorRegexp.FindStringSubmatch(g)
if m == nil {
return sel, fmt.Errorf("invalid search format")
}
m[1] = strings.TrimPrefix(m[1], "?:")
var cond Condition
switch m[1] {
case "-", "keyValue":
switch m[2] {
case "=":
cond = &KeyEqualCondition{
Value: m[3],
}
default:
return sel, &UnknownComparisonOperatorErr{Operator: m[2]}
}
default:
switch m[2] {
case "=":
cond = &EqualCondition{
Key: strings.TrimPrefix(m[1], "?:"),
Value: m[3],
}
default:
return sel, &UnknownComparisonOperatorErr{Operator: m[2]}
}
}
sel.Conditions = append(sel.Conditions, cond)
}
return sel, nil
}
func processParseSelectorNextAvailableIndex(selector string, sel Selector) (Selector, error) {
sel.Type = "NEXT_AVAILABLE_INDEX"
return sel, nil
}
func processParseSelectorIndexAny(selector string, sel Selector) (Selector, error) {
sel.Type = "INDEX_ANY"
return sel, nil
}
func processParseSelectorIndex(selector string, sel Selector) (Selector, error) {
sel.Type = "INDEX"
indexStr := selector[1 : len(selector)-1]
index, err := strconv.ParseInt(indexStr, 10, 32)
if err != nil {
return sel, &InvalidIndexErr{Index: indexStr}
}
sel.Index = int(index)
return sel, nil
}
func processParseSelectorProperty(selector string, sel Selector) (Selector, error) {
sel.Type = "PROPERTY"
sel.Property = selector
return sel, nil
}