This repository was archived by the owner on May 23, 2022. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathvalue.go
More file actions
422 lines (360 loc) · 8.79 KB
/
value.go
File metadata and controls
422 lines (360 loc) · 8.79 KB
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
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
package support
import (
"github.com/confetti-framework/errors"
"github.com/spf13/cast"
"reflect"
"strconv"
"strings"
)
type Value struct {
source interface{}
}
type nonValueError struct {
error
}
func (w nonValueError) Unwrap() error {
return w.error
}
func NewValue(val interface{}, preErr ...error) Value {
if len(preErr) > 0 {
val = nonValueError{preErr[0]}
}
switch val.(type) {
case []byte:
return Value{val}
case Collection, Map:
return Value{val}
case Value:
return val.(Value)
}
switch Kind(val) {
case reflect.Slice, reflect.Array:
result := NewCollection(val)
return Value{result}
case reflect.Map:
result, err := NewMapE(val)
if err != nil {
val = nonValueError{err}
}
val = result
}
return Value{val}
}
func (v Value) Source() interface{} {
return v.source
}
func (v Value) Raw() interface{} {
if result, ok := v.source.(Value); ok {
return result.Raw()
}
if result, ok := v.source.(Collection); ok {
return result.Raw()
}
if result, ok := v.source.(Map); ok {
return result.Raw()
}
return v.source
}
func (v Value) Get(key string) Value {
result, err := v.GetE(key)
if err != nil {
panic(err)
}
return result
}
func (v Value) GetE(key string) (Value, error) {
if key == "" {
return v, nil
}
currentKey, rest := splitKey(key)
nextKey := joinRest(rest)
// when you request something with an Asterisk, you always develop a collection
if currentKey == "*" {
switch v.source.(type) {
case Collection:
return v.source.(Collection).GetE(nextKey)
case Map:
return v.source.(Map).GetE(nextKey)
default:
return Value{}, errors.New("*: is not a Collection or Map")
}
}
switch source := v.source.(type) {
case Collection:
keyInt, err := strconv.Atoi(currentKey)
if err != nil {
return Value{}, err
}
collection := v.source.(Collection)
if len(collection) < (keyInt + 1) {
return Value{}, errors.Wrap(CanNotFoundValueError, "key '%s'%s", currentKey, getKeyInfo(key, currentKey))
}
return collection[keyInt].GetE(nextKey)
case Map:
value, ok := v.source.(Map)[currentKey]
if !ok {
return value, errors.Wrap(CanNotFoundValueError, "key '%s'%s", currentKey, getKeyInfo(key, currentKey))
}
return value.GetE(nextKey)
default:
switch Kind(source) {
case reflect.Struct:
val := reflect.ValueOf(source).FieldByName(currentKey)
if val.IsValid() {
return NewValue(val.Interface()).GetE(nextKey)
} else {
return Value{}, errors.New(currentKey + ": can't find value")
}
}
return Value{}, errors.New(currentKey + ": is not a struct, Collection or Map")
}
}
// A value can contain a collection.
func (v Value) Collection() Collection {
if err, isPre := v.source.(nonValueError); isPre {
panic(err)
}
switch v.source.(type) {
case Collection:
return v.source.(Collection)
case Map:
return v.source.(Map).Collection()
default:
return NewCollection(v.source)
}
}
func (v Value) Map() Map {
result, err := v.MapE()
if err != nil {
panic(err)
}
return result
}
func (v Value) MapE() (Map, error) {
source := v.source
if err, isPre := source.(nonValueError); isPre {
return Map{}, errors.Unwrap(err)
}
switch valueType := source.(type) {
case Map:
return source.(Map), nil
default:
return nil, errors.New("can't create map from reflect.Kind " + strconv.Itoa(int(Kind(valueType))))
}
}
func (v Value) String() string {
result, err := v.StringE()
if err != nil {
panic(err)
}
return result
}
func (v Value) StringE() (string, error) {
var result string
var err error
source := v.source
if err, isPre := source.(nonValueError); isPre {
return "", errors.Unwrap(err)
}
switch source := source.(type) {
case Collection:
result, err = source.First().StringE()
case Map:
result, err = source.First().StringE()
default:
result, err = cast.ToStringE(source)
}
return result, err
}
func (v Value) Int() int {
values, err := v.IntE()
if err != nil {
panic(err)
}
return values
}
func (v Value) IntE() (int, error) {
var result int
var err error
source := v.source
if err, isPre := source.(nonValueError); isPre {
return 0, errors.Unwrap(err)
}
switch source := source.(type) {
case Collection:
result, err = source.First().IntE()
case Map:
result, err = source.First().IntE()
case []byte:
result, err = cast.ToIntE(string(source))
default:
result, err = cast.ToIntE(source)
}
return result, err
}
func (v Value) Float() float64 {
values, err := v.FloatE()
if err != nil {
panic(err)
}
return values
}
func (v Value) FloatE() (float64, error) {
var result float64
var err error
source := v.source
if err, isPre := source.(nonValueError); isPre {
return 0, errors.Unwrap(err)
}
switch source := source.(type) {
case Collection:
result, err = source.First().FloatE()
case Map:
result, err = source.First().FloatE()
case []byte:
result, err = cast.ToFloat64E(string(source))
default:
result, err = cast.ToFloat64E(source)
}
return result, err
}
func (v Value) Bool() bool {
source := v.source
switch v := source.(type) {
case []byte:
source = string(v)
}
switch source {
case true, 1, "1", "true", "on", "yes":
return true
default:
return false
}
}
func (v Value) Filled() bool {
return !(v.source == nil || len(v.Collection()) == 0 || v.source == "")
}
func (v Value) Empty() bool {
return v.source == nil || v.source == ""
}
// Split slices Value into all substrings separated by separator and returns a slice of
// the strings between those separators.
//
// If Value does not contain separator and separator is not empty, Split returns a
// slice of length 1 whose only element is Value.
func (v Value) Split(separator string) Collection {
rawStrings := strings.Split(v.String(), separator)
var result Collection
for _, rawString := range rawStrings {
result = append(result, NewValue(rawString))
}
return NewCollection(result)
}
func (v Value) Set(key string, input interface{}) Value {
result, err := v.SetE(key, input)
if err != nil {
panic(err)
}
return result
}
func (v Value) SetE(key string, input interface{}) (Value, error) {
currentKey, _ := splitKey(key)
if currentKey == "" {
v.source = input
}
// if key is an asterisk, create collection if necessary
if currentKey == "*" && v.source == nil {
v.source = NewCollection()
}
if _, isCollection := v.source.(Collection); !isCollection && currentKey == "*" {
return v, errors.Wrap(CanNotAppendValueError, "can not append value on '%s'", Kind(v.source))
}
// if value is nil, create a map to set the value
if v.source == nil {
v.source = NewMap()
}
switch source := v.source.(type) {
case Map:
nestedMap, err := source.SetE(key, input)
if err != nil {
return v, err
}
return NewValue(nestedMap), nil
case Collection:
collection, err := source.SetE(key, input)
v.source = collection
return v, err
}
return v, nil
}
func (v Value) Only(keys ...string) Value {
result, err := v.OnlyE(keys...)
if err != nil {
panic(err)
}
return result
}
func (v Value) OnlyE(keys ...string) (Value, error) {
switch source := v.source.(type) {
case Map:
result, err := source.OnlyE(keys...)
return NewValue(result), err
case Collection:
result, err := source.OnlyE(keys...)
return NewValue(result), err
}
return v, nil
}
func (v Value) Error() error {
if err, isPre := v.source.(nonValueError); isPre {
return errors.Unwrap(err)
}
return nil
}
// convert keys with an asterisk to usable keys
func GetSearchableKeys(originKeys []string, value Value) []Key {
var result []Key
for _, originKey := range originKeys {
keys := GetSearchableKeysByOneKey(originKey, value)
result = append(result, keys...)
}
return result
}
// convert key with an asterisk to usable keys
func GetSearchableKeysByOneKey(originKey string, input Value) []Key {
var keys []Key
if !strings.Contains(originKey, "*") {
return append(keys, originKey)
}
switch source := input.source.(type) {
case Map:
keys = getKeysByMap(keys, source, originKey)
case Collection:
keys = getKeysByCollection(keys, source, originKey)
}
return keys
}
func getKeysByCollection(keys []Key, source Collection, originKey string) []Key {
_, rest := splitKey(originKey)
for realKey, nestedValue := range source {
nestedKeys := GetSearchableKeysByOneKey(joinRest(rest), nestedValue)
keys = appendNestedKeys(keys, nestedKeys, strconv.Itoa(realKey))
}
return keys
}
func getKeysByMap(keys []Key, source Map, originKey string) []Key {
current, rest := splitKey(originKey)
for realKey, nestedValue := range source {
if current == realKey || current == "*" {
nestedKeys := GetSearchableKeysByOneKey(joinRest(rest), nestedValue)
keys = appendNestedKeys(keys, nestedKeys, realKey)
}
}
return keys
}
func appendNestedKeys(keys, nestedKeys []Key, realKey string) []Key {
for _, nestedKey := range nestedKeys {
keys = append(keys, PrefixKey(realKey, nestedKey))
}
return keys
}