-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathexpr_test.go
157 lines (138 loc) · 3.11 KB
/
expr_test.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
package gmars
import (
"strings"
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
)
func TestExpandExpressions(t *testing.T) {
values := map[string][]token{
"a": {{tokNumber, "1"}},
"c": {{tokText, "a"}, {tokSymbol, "*"}, {tokText, "b"}},
"b": {{tokText, "a"}, {tokSymbol, "+"}, {tokNumber, "2"}},
}
graph := map[string][]string{
"b": {"a"},
"c": {"b"},
}
output, err := expandExpressions(values, graph)
require.NoError(t, err)
require.Equal(t, map[string][]token{
"a": {{tokNumber, "1"}},
"b": {{tokNumber, "1"}, {tokSymbol, "+"}, {tokNumber, "2"}},
"c": {{tokNumber, "1"}, {tokSymbol, "*"}, {tokNumber, "1"}, {tokSymbol, "+"}, {tokNumber, "2"}},
}, output)
}
func TestCombineSigns(t *testing.T) {
testCases := []struct {
input string
output []token
}{
{
input: "1++-2",
output: []token{
{tokNumber, "1"},
{tokSymbol, "+"},
{tokSymbol, "-"},
{tokNumber, "2"},
},
},
{
input: "1-+-2",
output: []token{
{tokNumber, "1"},
{tokSymbol, "-"},
{tokSymbol, "-"},
{tokNumber, "2"},
},
},
}
for _, test := range testCases {
lexer := newLexer(strings.NewReader(test.input))
tokens, err := lexer.Tokens()
tokens = tokens[:len(tokens)-1]
require.NoError(t, err)
combinedTokens := combineSigns(tokens)
require.Equal(t, test.output, combinedTokens)
}
}
func TestFlipDoubleNegatives(t *testing.T) {
testCases := []struct {
input string
output []token
}{
{
input: "1--1",
output: []token{
{tokNumber, "1"},
{tokSymbol, "+"},
{tokNumber, "1"},
},
},
}
for _, test := range testCases {
lexer := newLexer(strings.NewReader(test.input))
tokens, err := lexer.Tokens()
tokens = tokens[:len(tokens)-1]
require.NoError(t, err)
combinedTokens := flipDoubleNegatives(tokens)
require.Equal(t, test.output, combinedTokens)
}
}
func TestEvaluateExpressionPositive(t *testing.T) {
testCases := map[string]int{
"1": 1,
"2": 2,
"-2": -2,
"1+2*3": 7,
"1*2+3": 5,
"(1+2)*3": 9,
"1 * -1": -1,
"1 + -1": 0,
// handle signs
"1 - -1": 2,
// logic
"1 > 2": 0,
"2 > 1": 1,
"1 < 2": 1,
"2 < 1": 0,
"1 >= 1": 1,
"2 <= 2": 1,
"8000 == 8000": 1,
"8000 == 800": 0,
// hmmm, these need to be fixed
// "1 && 1": 1,
// "1 && 0": 0,
// "1 || 1": 1,
// "1 || 0": 0,
"2 == 1 || 2 == 2": 1,
"2 == 1 || 2 == 3": 0,
}
for input, expected := range testCases {
lexer := newLexer(strings.NewReader(input))
tokens, err := lexer.Tokens()
require.NoError(t, err)
// trim EOF from input
tokens = tokens[:len(tokens)-1]
val, err := evaluateExpression(tokens)
require.NoError(t, err)
assert.Equal(t, expected, val)
}
}
func TestEvaluateExpressionNegative(t *testing.T) {
cases := []string{
")21",
"2^3",
"2{2",
}
for _, input := range cases {
lexer := newLexer(strings.NewReader(input))
tokens, err := lexer.Tokens()
if err != nil {
continue
}
val, err := evaluateExpression(tokens)
assert.Error(t, err)
assert.Equal(t, 0, val)
}
}