summaryrefslogtreecommitdiffstats
path: root/vendor/github.com/pelletier/go-toml/query/match.go
blob: d7bb15a45ab24e64ed9d373f45457d9c291b97ff (plain)
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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
package query

import (
	"fmt"
	"github.com/pelletier/go-toml"
)

// base match
type matchBase struct {
	next pathFn
}

func (f *matchBase) setNext(next pathFn) {
	f.next = next
}

// terminating functor - gathers results
type terminatingFn struct {
	// empty
}

func newTerminatingFn() *terminatingFn {
	return &terminatingFn{}
}

func (f *terminatingFn) setNext(next pathFn) {
	// do nothing
}

func (f *terminatingFn) call(node interface{}, ctx *queryContext) {
	ctx.result.appendResult(node, ctx.lastPosition)
}

// match single key
type matchKeyFn struct {
	matchBase
	Name string
}

func newMatchKeyFn(name string) *matchKeyFn {
	return &matchKeyFn{Name: name}
}

func (f *matchKeyFn) call(node interface{}, ctx *queryContext) {
	if array, ok := node.([]*toml.Tree); ok {
		for _, tree := range array {
			item := tree.Get(f.Name)
			if item != nil {
				ctx.lastPosition = tree.GetPosition(f.Name)
				f.next.call(item, ctx)
			}
		}
	} else if tree, ok := node.(*toml.Tree); ok {
		item := tree.Get(f.Name)
		if item != nil {
			ctx.lastPosition = tree.GetPosition(f.Name)
			f.next.call(item, ctx)
		}
	}
}

// match single index
type matchIndexFn struct {
	matchBase
	Idx int
}

func newMatchIndexFn(idx int) *matchIndexFn {
	return &matchIndexFn{Idx: idx}
}

func (f *matchIndexFn) call(node interface{}, ctx *queryContext) {
	if arr, ok := node.([]interface{}); ok {
		if f.Idx < len(arr) && f.Idx >= 0 {
			if treesArray, ok := node.([]*toml.Tree); ok {
				if len(treesArray) > 0 {
					ctx.lastPosition = treesArray[0].Position()
				}
			}
			f.next.call(arr[f.Idx], ctx)
		}
	}
}

// filter by slicing
type matchSliceFn struct {
	matchBase
	Start, End, Step int
}

func newMatchSliceFn(start, end, step int) *matchSliceFn {
	return &matchSliceFn{Start: start, End: end, Step: step}
}

func (f *matchSliceFn) call(node interface{}, ctx *queryContext) {
	if arr, ok := node.([]interface{}); ok {
		// adjust indexes for negative values, reverse ordering
		realStart, realEnd := f.Start, f.End
		if realStart < 0 {
			realStart = len(arr) + realStart
		}
		if realEnd < 0 {
			realEnd = len(arr) + realEnd
		}
		if realEnd < realStart {
			realEnd, realStart = realStart, realEnd // swap
		}
		// loop and gather
		for idx := realStart; idx < realEnd; idx += f.Step {
			if treesArray, ok := node.([]*toml.Tree); ok {
				if len(treesArray) > 0 {
					ctx.lastPosition = treesArray[0].Position()
				}
			}
			f.next.call(arr[idx], ctx)
		}
	}
}

// match anything
type matchAnyFn struct {
	matchBase
}

func newMatchAnyFn() *matchAnyFn {
	return &matchAnyFn{}
}

func (f *matchAnyFn) call(node interface{}, ctx *queryContext) {
	if tree, ok := node.(*toml.Tree); ok {
		for _, k := range tree.Keys() {
			v := tree.Get(k)
			ctx.lastPosition = tree.GetPosition(k)
			f.next.call(v, ctx)
		}
	}
}

// filter through union
type matchUnionFn struct {
	Union []pathFn
}

func (f *matchUnionFn) setNext(next pathFn) {
	for _, fn := range f.Union {
		fn.setNext(next)
	}
}

func (f *matchUnionFn) call(node interface{}, ctx *queryContext) {
	for _, fn := range f.Union {
		fn.call(node, ctx)
	}
}

// match every single last node in the tree
type matchRecursiveFn struct {
	matchBase
}

func newMatchRecursiveFn() *matchRecursiveFn {
	return &matchRecursiveFn{}
}

func (f *matchRecursiveFn) call(node interface{}, ctx *queryContext) {
	originalPosition := ctx.lastPosition
	if tree, ok := node.(*toml.Tree); ok {
		var visit func(tree *toml.Tree)
		visit = func(tree *toml.Tree) {
			for _, k := range tree.Keys() {
				v := tree.Get(k)
				ctx.lastPosition = tree.GetPosition(k)
				f.next.call(v, ctx)
				switch node := v.(type) {
				case *toml.Tree:
					visit(node)
				case []*toml.Tree:
					for _, subtree := range node {
						visit(subtree)
					}
				}
			}
		}
		ctx.lastPosition = originalPosition
		f.next.call(tree, ctx)
		visit(tree)
	}
}

// match based on an externally provided functional filter
type matchFilterFn struct {
	matchBase
	Pos  toml.Position
	Name string
}

func newMatchFilterFn(name string, pos toml.Position) *matchFilterFn {
	return &matchFilterFn{Name: name, Pos: pos}
}

func (f *matchFilterFn) call(node interface{}, ctx *queryContext) {
	fn, ok := (*ctx.filters)[f.Name]
	if !ok {
		panic(fmt.Sprintf("%s: query context does not have filter '%s'",
			f.Pos.String(), f.Name))
	}
	switch castNode := node.(type) {
	case *toml.Tree:
		for _, k := range castNode.Keys() {
			v := castNode.Get(k)
			if fn(v) {
				ctx.lastPosition = castNode.GetPosition(k)
				f.next.call(v, ctx)
			}
		}
	case []*toml.Tree:
		for _, v := range castNode {
			if fn(v) {
				if len(castNode) > 0 {
					ctx.lastPosition = castNode[0].Position()
				}
				f.next.call(v, ctx)
			}
		}
	case []interface{}:
		for _, v := range castNode {
			if fn(v) {
				f.next.call(v, ctx)
			}
		}
	}
}