-
Notifications
You must be signed in to change notification settings - Fork 234
/
builtins.go
2816 lines (2507 loc) · 75.8 KB
/
builtins.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
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
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Copyright 2017 Google Inc. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package jsonnet
import (
"bytes"
"crypto/md5"
"crypto/sha1"
"crypto/sha256"
"crypto/sha512"
"encoding/base64"
"encoding/hex"
"encoding/json"
"fmt"
"io"
"math"
"reflect"
"regexp"
"sort"
"strconv"
"strings"
"github.com/google/go-jsonnet/ast"
"golang.org/x/crypto/sha3"
)
func builtinPlus(i *interpreter, x, y value) (value, error) {
// TODO(sbarzowski) perhaps a more elegant way to dispatch
switch right := y.(type) {
case valueString:
left, err := builtinToString(i, x)
if err != nil {
return nil, err
}
return concatStrings(left.(valueString), right), nil
}
switch left := x.(type) {
case *valueNumber:
right, err := i.getNumber(y)
if err != nil {
return nil, err
}
return makeDoubleCheck(i, left.value+right.value)
case valueString:
right, err := builtinToString(i, y)
if err != nil {
return nil, err
}
return concatStrings(left, right.(valueString)), nil
case *valueObject:
switch right := y.(type) {
case *valueObject:
return makeValueExtendedObject(left, right), nil
default:
return nil, i.typeErrorSpecific(y, &valueObject{})
}
case *valueArray:
right, err := i.getArray(y)
if err != nil {
return nil, err
}
return concatArrays(left, right), nil
default:
return nil, i.typeErrorGeneral(x)
}
}
func builtinMinus(i *interpreter, xv, yv value) (value, error) {
x, err := i.getNumber(xv)
if err != nil {
return nil, err
}
y, err := i.getNumber(yv)
if err != nil {
return nil, err
}
return makeDoubleCheck(i, x.value-y.value)
}
func builtinMult(i *interpreter, xv, yv value) (value, error) {
x, err := i.getNumber(xv)
if err != nil {
return nil, err
}
y, err := i.getNumber(yv)
if err != nil {
return nil, err
}
return makeDoubleCheck(i, x.value*y.value)
}
func builtinDiv(i *interpreter, xv, yv value) (value, error) {
x, err := i.getNumber(xv)
if err != nil {
return nil, err
}
y, err := i.getNumber(yv)
if err != nil {
return nil, err
}
if y.value == 0 {
return nil, i.Error("Division by zero.")
}
return makeDoubleCheck(i, x.value/y.value)
}
func builtinModulo(i *interpreter, xv, yv value) (value, error) {
x, err := i.getNumber(xv)
if err != nil {
return nil, err
}
y, err := i.getNumber(yv)
if err != nil {
return nil, err
}
if y.value == 0 {
return nil, i.Error("Division by zero.")
}
return makeDoubleCheck(i, math.Mod(x.value, y.value))
}
func valueCmp(i *interpreter, x, y value) (int, error) {
switch left := x.(type) {
case *valueNumber:
right, err := i.getNumber(y)
if err != nil {
return 0, err
}
return float64Cmp(left.value, right.value), nil
case valueString:
right, err := i.getString(y)
if err != nil {
return 0, err
}
return stringCmp(left, right), nil
case *valueArray:
right, err := i.getArray(y)
if err != nil {
return 0, err
}
return arrayCmp(i, left, right)
default:
return 0, i.typeErrorGeneral(x)
}
}
func arrayCmp(i *interpreter, x, y *valueArray) (int, error) {
for index := 0; index < minInt(x.length(), y.length()); index++ {
left, err := x.index(i, index)
if err != nil {
return 0, err
}
right, err := y.index(i, index)
if err != nil {
return 0, err
}
cmp, err := valueCmp(i, left, right)
if err != nil {
return 0, err
}
if cmp != 0 {
return cmp, nil
}
}
return intCmp(x.length(), y.length()), nil
}
func builtinLess(i *interpreter, x, y value) (value, error) {
r, err := valueCmp(i, x, y)
if err != nil {
return nil, err
}
return makeValueBoolean(r == -1), nil
}
func builtinGreater(i *interpreter, x, y value) (value, error) {
r, err := valueCmp(i, x, y)
if err != nil {
return nil, err
}
return makeValueBoolean(r == 1), nil
}
func builtinGreaterEq(i *interpreter, x, y value) (value, error) {
r, err := valueCmp(i, x, y)
if err != nil {
return nil, err
}
return makeValueBoolean(r >= 0), nil
}
func builtinLessEq(i *interpreter, x, y value) (value, error) {
r, err := valueCmp(i, x, y)
if err != nil {
return nil, err
}
return makeValueBoolean(r <= 0), nil
}
func builtinLength(i *interpreter, x value) (value, error) {
var num int
switch x := x.(type) {
case *valueObject:
num = len(objectFields(x, withoutHidden))
case *valueArray:
num = len(x.elements)
case valueString:
num = x.length()
case *valueFunction:
for _, param := range x.parameters() {
if param.defaultArg == nil {
num++
}
}
default:
return nil, i.typeErrorGeneral(x)
}
return makeValueNumber(float64(num)), nil
}
func valueToString(i *interpreter, x value) (string, error) {
switch x := x.(type) {
case valueString:
return x.getGoString(), nil
}
var buf bytes.Buffer
if err := i.manifestAndSerializeJSON(&buf, x, false, ""); err != nil {
return "", err
}
return buf.String(), nil
}
func builtinToString(i *interpreter, x value) (value, error) {
s, err := valueToString(i, x)
if err != nil {
return nil, err
}
return makeValueString(s), nil
}
func builtinTrace(i *interpreter, x value, y value) (value, error) {
xStr, err := i.getString(x)
if err != nil {
return nil, err
}
trace := i.stack.currentTrace
filename := trace.loc.File.DiagnosticFileName
line := trace.loc.Begin.Line
fmt.Fprintf(
i.traceOut, "TRACE: %s:%d %s\n", filename, line, xStr.getGoString())
return y, nil
}
// astMakeArrayElement wraps the function argument of std.makeArray so that
// it can be embedded in cachedThunk without needing to execute it ahead of
// time. It is equivalent to `local i = 42; func(i)`. It therefore has no
// free variables and needs only an empty environment to execute.
type astMakeArrayElement struct {
function *valueFunction
ast.NodeBase
index int
}
func builtinMakeArray(i *interpreter, szv, funcv value) (value, error) {
sz, err := i.getInt(szv)
if err != nil {
return nil, err
}
fun, err := i.getFunction(funcv)
if err != nil {
return nil, err
}
var elems []*cachedThunk
for i := 0; i < sz; i++ {
elem := &cachedThunk{
env: &environment{},
body: &astMakeArrayElement{
NodeBase: ast.NodeBase{},
function: fun,
index: i,
},
}
elems = append(elems, elem)
}
return makeValueArray(elems), nil
}
func builtinFlatMap(i *interpreter, funcv, arrv value) (value, error) {
fun, err := i.getFunction(funcv)
if err != nil {
return nil, err
}
switch arrv := arrv.(type) {
case *valueArray:
num := arrv.length()
// Start with capacity of the original array.
// This may spare us a few reallocations.
// TODO(sbarzowski) verify that it actually helps
elems := make([]*cachedThunk, 0, num)
for counter := 0; counter < num; counter++ {
returnedValue, err := fun.call(i, args(arrv.elements[counter]))
if err != nil {
return nil, err
}
returned, err := i.getArray(returnedValue)
if err != nil {
return nil, err
}
elems = append(elems, returned.elements...)
}
return makeValueArray(elems), nil
case valueString:
var str strings.Builder
for _, elem := range arrv.getRunes() {
returnedValue, err := fun.call(i, args(readyThunk(makeValueString(string(elem)))))
if err != nil {
return nil, err
}
returned, err := i.getString(returnedValue)
if err != nil {
return nil, err
}
str.WriteString(returned.getGoString())
}
return makeValueString(str.String()), nil
default:
return nil, i.Error("std.flatMap second param must be array / string, got " + arrv.getType().name)
}
}
func joinArrays(i *interpreter, sep *valueArray, arr *valueArray) (value, error) {
result := make([]*cachedThunk, 0, arr.length())
first := true
for _, elem := range arr.elements {
elemValue, err := i.evaluatePV(elem)
if err != nil {
return nil, err
}
switch v := elemValue.(type) {
case *valueNull:
continue
case *valueArray:
if !first {
result = append(result, sep.elements...)
}
result = append(result, v.elements...)
default:
return nil, i.typeErrorSpecific(elemValue, &valueArray{})
}
first = false
}
return makeValueArray(result), nil
}
func joinStrings(i *interpreter, sep valueString, arr *valueArray) (value, error) {
result := make([]rune, 0, arr.length())
first := true
for _, elem := range arr.elements {
elemValue, err := i.evaluatePV(elem)
if err != nil {
return nil, err
}
switch v := elemValue.(type) {
case *valueNull:
continue
case valueString:
if !first {
result = append(result, sep.getRunes()...)
}
result = append(result, v.getRunes()...)
default:
return nil, i.typeErrorSpecific(elemValue, emptyString())
}
first = false
}
return makeStringFromRunes(result), nil
}
func builtinJoin(i *interpreter, sep, arrv value) (value, error) {
arr, err := i.getArray(arrv)
if err != nil {
return nil, err
}
switch sep := sep.(type) {
case valueString:
return joinStrings(i, sep, arr)
case *valueArray:
return joinArrays(i, sep, arr)
default:
return nil, i.Error("join first parameter should be string or array, got " + sep.getType().name)
}
}
func builtinFoldl(i *interpreter, funcv, arrv, initv value) (value, error) {
fun, err := i.getFunction(funcv)
if err != nil {
return nil, err
}
var numElements int
var elements []*cachedThunk
switch arrType := arrv.(type) {
case valueString:
for _, item := range arrType.getRunes() {
elements = append(elements, readyThunk(makeStringFromRunes([]rune{item})))
}
numElements = len(elements)
case *valueArray:
numElements = arrType.length()
elements = arrType.elements
default:
return nil, i.Error("foldl second parameter should be string or array, got " + arrType.getType().name)
}
accValue := initv
for counter := 0; counter < numElements; counter++ {
accValue, err = fun.call(i, args([]*cachedThunk{readyThunk(accValue), elements[counter]}...))
if err != nil {
return nil, err
}
}
return accValue, nil
}
func builtinFoldr(i *interpreter, funcv, arrv, initv value) (value, error) {
fun, err := i.getFunction(funcv)
if err != nil {
return nil, err
}
var numElements int
var elements []*cachedThunk
switch arrType := arrv.(type) {
case valueString:
for _, item := range arrType.getRunes() {
elements = append(elements, readyThunk(makeStringFromRunes([]rune{item})))
}
numElements = len(elements)
case *valueArray:
numElements = arrType.length()
elements = arrType.elements
default:
return nil, i.Error("foldr second parameter should be string or array, got " + arrType.getType().name)
}
accValue := initv
for counter := numElements - 1; counter >= 0; counter-- {
accValue, err = fun.call(i, args([]*cachedThunk{elements[counter], readyThunk(accValue)}...))
if err != nil {
return nil, err
}
}
return accValue, nil
}
func builtinReverse(i *interpreter, arrv value) (value, error) {
arr, err := i.getArray(arrv)
if err != nil {
return nil, err
}
lenArr := len(arr.elements) // lenx holds the original array length
reversedArray := make([]*cachedThunk, lenArr) // creates a slice that refer to a new array of length lenx
for i := 0; i < lenArr; i++ {
j := lenArr - (i + 1) // j initially holds (lenx - 1) and decreases to 0 while i initially holds 0 and increase to (lenx - 1)
reversedArray[i] = arr.elements[j]
}
return makeValueArray(reversedArray), nil
}
func builtinFilter(i *interpreter, funcv, arrv value) (value, error) {
arr, err := i.getArray(arrv)
if err != nil {
return nil, err
}
fun, err := i.getFunction(funcv)
if err != nil {
return nil, err
}
num := arr.length()
// Start with capacity of the original array.
// This may spare us a few reallocations.
// TODO(sbarzowski) verify that it actually helps
elems := make([]*cachedThunk, 0, num)
for counter := 0; counter < num; counter++ {
includedValue, err := fun.call(i, args(arr.elements[counter]))
if err != nil {
return nil, err
}
included, err := i.getBoolean(includedValue)
if err != nil {
return nil, err
}
if included.value {
elems = append(elems, arr.elements[counter])
}
}
return makeValueArray(elems), nil
}
func builtinLstripChars(i *interpreter, str, chars value) (value, error) {
switch strType := str.(type) {
case valueString:
if strType.length() > 0 {
index, err := strType.index(i, 0)
if err != nil {
return nil, err
}
member, err := rawMember(i, chars, index)
if err != nil {
return nil, err
}
if member {
runes := strType.getRunes()
s := string(runes[1:])
return builtinLstripChars(i, makeValueString(s), chars)
} else {
return str, nil
}
}
return str, nil
default:
return nil, i.Error(fmt.Sprintf("Unexpected type %s, expected string", strType.getType().name))
}
}
func builtinRstripChars(i *interpreter, str, chars value) (value, error) {
switch strType := str.(type) {
case valueString:
if strType.length() > 0 {
index, err := strType.index(i, strType.length()-1)
if err != nil {
return nil, err
}
member, err := rawMember(i, chars, index)
if err != nil {
return nil, err
}
if member {
runes := strType.getRunes()
s := string(runes[:len(runes)-1])
return builtinRstripChars(i, makeValueString(s), chars)
} else {
return str, nil
}
}
return str, nil
default:
return nil, i.Error(fmt.Sprintf("Unexpected type %s, expected string", strType.getType().name))
}
}
func builtinStripChars(i *interpreter, str, chars value) (value, error) {
lstripChars, err := builtinLstripChars(i, str, chars)
if err != nil {
return nil, err
}
rstripChars, err := builtinRstripChars(i, lstripChars, chars)
if err != nil {
return nil, err
}
return rstripChars, nil
}
func rawMember(i *interpreter, arrv, value value) (bool, error) {
switch arrType := arrv.(type) {
case valueString:
valString, err := i.getString(value)
if err != nil {
return false, err
}
arrString, err := i.getString(arrv)
if err != nil {
return false, err
}
return strings.Contains(arrString.getGoString(), valString.getGoString()), nil
case *valueArray:
for _, elem := range arrType.elements {
cachedThunkValue, err := elem.getValue(i)
if err != nil {
return false, err
}
equal, err := rawEquals(i, cachedThunkValue, value)
if err != nil {
return false, err
}
if equal {
return true, nil
}
}
default:
return false, i.Error("std.member first argument must be an array or a string")
}
return false, nil
}
func builtinMember(i *interpreter, arrv, value value) (value, error) {
eq, err := rawMember(i, arrv, value)
if err != nil {
return nil, err
}
return makeValueBoolean(eq), nil
}
type sortData struct {
err error
i *interpreter
thunks []*cachedThunk
keys []value
}
func (d *sortData) Len() int {
return len(d.thunks)
}
func (d *sortData) Less(i, j int) bool {
r, err := valueCmp(d.i, d.keys[i], d.keys[j])
if err != nil {
d.err = err
panic("Error while comparing elements")
}
return r == -1
}
func (d *sortData) Swap(i, j int) {
d.thunks[i], d.thunks[j] = d.thunks[j], d.thunks[i]
d.keys[i], d.keys[j] = d.keys[j], d.keys[i]
}
func (d *sortData) Sort() (err error) {
defer func() {
if d.err != nil {
if r := recover(); r != nil {
err = d.err
}
}
}()
sort.Stable(d)
return
}
func builtinSort(i *interpreter, arguments []value) (value, error) {
arrv := arguments[0]
keyFv := arguments[1]
arr, err := i.getArray(arrv)
if err != nil {
return nil, err
}
keyF, err := i.getFunction(keyFv)
if err != nil {
return nil, err
}
num := arr.length()
data := sortData{i: i, thunks: make([]*cachedThunk, num), keys: make([]value, num)}
for counter := 0; counter < num; counter++ {
var err error
data.thunks[counter] = arr.elements[counter]
data.keys[counter], err = keyF.call(i, args(arr.elements[counter]))
if err != nil {
return nil, err
}
}
err = data.Sort()
if err != nil {
return nil, err
}
return makeValueArray(data.thunks), nil
}
func builtinRange(i *interpreter, fromv, tov value) (value, error) {
from, err := i.getInt(fromv)
if err != nil {
return nil, err
}
to, err := i.getInt(tov)
if err != nil {
return nil, err
}
elems := make([]*cachedThunk, to-from+1)
for i := from; i <= to; i++ {
elems[i-from] = readyThunk(intToValue(i))
}
return makeValueArray(elems), nil
}
func builtinNegation(i *interpreter, x value) (value, error) {
b, err := i.getBoolean(x)
if err != nil {
return nil, err
}
return makeValueBoolean(!b.value), nil
}
func builtinXnor(i *interpreter, xv, yv value) (value, error) {
p, err := i.getBoolean(xv)
if err != nil {
return nil, err
}
q, err := i.getBoolean(yv)
if err != nil {
return nil, err
}
return makeValueBoolean(p.value == q.value), nil
}
func builtinXor(i *interpreter, xv, yv value) (value, error) {
p, err := i.getBoolean(xv)
if err != nil {
return nil, err
}
q, err := i.getBoolean(yv)
if err != nil {
return nil, err
}
return makeValueBoolean(p.value != q.value), nil
}
func builtinBitNeg(i *interpreter, x value) (value, error) {
n, err := i.getNumber(x)
if err != nil {
return nil, err
}
intValue := int64(n.value)
return int64ToValue(^intValue), nil
}
func builtinIdentity(i *interpreter, x value) (value, error) {
return x, nil
}
func builtinUnaryPlus(i *interpreter, x value) (value, error) {
n, err := i.getNumber(x)
if err != nil {
return nil, err
}
return makeValueNumber(n.value), nil
}
func builtinUnaryMinus(i *interpreter, x value) (value, error) {
n, err := i.getNumber(x)
if err != nil {
return nil, err
}
return makeValueNumber(-n.value), nil
}
// TODO(sbarzowski) since we have a builtin implementation of equals it's no longer really
// needed and we should deprecate it eventually
func primitiveEquals(i *interpreter, x, y value) (value, error) {
if x.getType() != y.getType() {
return makeValueBoolean(false), nil
}
switch left := x.(type) {
case *valueBoolean:
right, err := i.getBoolean(y)
if err != nil {
return nil, err
}
return makeValueBoolean(left.value == right.value), nil
case *valueNumber:
right, err := i.getNumber(y)
if err != nil {
return nil, err
}
return makeValueBoolean(left.value == right.value), nil
case valueString:
right, err := i.getString(y)
if err != nil {
return nil, err
}
return makeValueBoolean(stringEqual(left, right)), nil
case *valueNull:
return makeValueBoolean(true), nil
case *valueFunction:
return nil, i.Error("Cannot test equality of functions")
default:
return nil, i.Error(
"primitiveEquals operates on primitive types, got " + x.getType().name,
)
}
}
func rawEquals(i *interpreter, x, y value) (bool, error) {
if x.getType() != y.getType() {
return false, nil
}
switch left := x.(type) {
case *valueBoolean:
right, err := i.getBoolean(y)
if err != nil {
return false, err
}
return left.value == right.value, nil
case *valueNumber:
right, err := i.getNumber(y)
if err != nil {
return false, err
}
return left.value == right.value, nil
case valueString:
right, err := i.getString(y)
if err != nil {
return false, err
}
return stringEqual(left, right), nil
case *valueNull:
return true, nil
case *valueArray:
right, err := i.getArray(y)
if err != nil {
return false, err
}
if left.length() != right.length() {
return false, nil
}
for j := range left.elements {
leftElem, err := i.evaluatePV(left.elements[j])
if err != nil {
return false, err
}
rightElem, err := i.evaluatePV(right.elements[j])
if err != nil {
return false, err
}
eq, err := rawEquals(i, leftElem, rightElem)
if err != nil {
return false, err
}
if !eq {
return false, nil
}
}
return true, nil
case *valueObject:
right, err := i.getObject(y)
if err != nil {
return false, err
}
leftFields := objectFields(left, withoutHidden)
rightFields := objectFields(right, withoutHidden)
sort.Strings(leftFields)
sort.Strings(rightFields)
if len(leftFields) != len(rightFields) {
return false, nil
}
for i := range leftFields {
if leftFields[i] != rightFields[i] {
return false, nil
}
}
for j := range leftFields {
fieldName := leftFields[j]
leftField, err := left.index(i, fieldName)
if err != nil {
return false, err
}
rightField, err := right.index(i, fieldName)
if err != nil {
return false, err
}
eq, err := rawEquals(i, leftField, rightField)
if err != nil {
return false, err
}
if !eq {
return false, nil
}
}
return true, nil
case *valueFunction:
return false, i.Error("Cannot test equality of functions")
}
panic(fmt.Sprintf("Unhandled case in equals %#+v %#+v", x, y))
}
func builtinEquals(i *interpreter, x, y value) (value, error) {
eq, err := rawEquals(i, x, y)
if err != nil {
return nil, err
}
return makeValueBoolean(eq), nil
}
func builtinNotEquals(i *interpreter, x, y value) (value, error) {
eq, err := rawEquals(i, x, y)
if err != nil {
return nil, err
}
return makeValueBoolean(!eq), nil
}
func builtinType(i *interpreter, x value) (value, error) {
return makeValueString(x.getType().name), nil
}
func builtinMd5(i *interpreter, x value) (value, error) {
str, err := i.getString(x)
if err != nil {
return nil, err
}
hash := md5.Sum([]byte(str.getGoString()))
return makeValueString(hex.EncodeToString(hash[:])), nil
}
func builtinSha1(i *interpreter, x value) (value, error) {
str, err := i.getString(x)
if err != nil {
return nil, err
}
hash := sha1.Sum([]byte(str.getGoString()))
return makeValueString(hex.EncodeToString(hash[:])), nil
}
func builtinSha256(i *interpreter, x value) (value, error) {
str, err := i.getString(x)
if err != nil {
return nil, err
}
hash := sha256.Sum256([]byte(str.getGoString()))
return makeValueString(hex.EncodeToString(hash[:])), nil
}
func builtinSha512(i *interpreter, x value) (value, error) {
str, err := i.getString(x)
if err != nil {
return nil, err
}
hash := sha512.Sum512([]byte(str.getGoString()))
return makeValueString(hex.EncodeToString(hash[:])), nil
}
func builtinSha3(i *interpreter, x value) (value, error) {
str, err := i.getString(x)
if err != nil {
return nil, err
}
hash := sha3.Sum512([]byte(str.getGoString()))
return makeValueString(hex.EncodeToString(hash[:])), nil
}
func builtinBase64(i *interpreter, input value) (value, error) {
var byteArr []byte
var sanityCheck = func(v int) (string, bool) {
if v < 0 || 255 < v {
msg := fmt.Sprintf("base64 encountered invalid codepoint value in the array (must be 0 <= X <= 255), got %d", v)
return msg, false
}
return "", true
}
switch input.(type) {
case valueString:
vStr, err := i.getString(input)
if err != nil {
return nil, err
}
str := vStr.getGoString()
for _, r := range str {
n := int(r)
msg, ok := sanityCheck(n)
if !ok {
return nil, makeRuntimeError(msg, i.getCurrentStackTrace())
}
}
byteArr = []byte(str)
case *valueArray:
vArr, err := i.getArray(input)
if err != nil {
return nil, err