-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtree_test.go
247 lines (237 loc) · 4.44 KB
/
tree_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
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
package gal_test
import (
"testing"
"github.com/google/go-cmp/cmp"
"github.com/stretchr/testify/assert"
"github.com/seborama/gal/v9"
)
func TestTree_FullLen(t *testing.T) {
tt := map[string]struct {
tree gal.Tree
wantLen int
}{
"empty tree": {
tree: gal.Tree{},
wantLen: 0,
},
"simple tree": {
tree: gal.Tree{
gal.Plus,
gal.NewNumberFromInt(-4),
},
wantLen: 2,
},
"semi-complex tree": {
tree: gal.Tree{
gal.NewNumberFromInt(-4),
gal.Plus,
gal.Tree{},
},
wantLen: 2,
},
"complex tree": {
tree: gal.Tree{
gal.NewNumberFromInt(-4),
gal.Plus,
gal.Tree{
gal.NewNumberFromInt(-4),
gal.Plus,
gal.Tree{
gal.NewNumberFromInt(-4),
gal.Plus,
gal.Tree{
gal.NewNumberFromInt(-4),
gal.Plus,
gal.Tree{
gal.NewNumberFromInt(-4),
gal.Plus,
gal.Tree{
gal.NewNumberFromInt(-4),
},
},
},
},
},
},
wantLen: 11,
},
}
for name, tc := range tt {
name := name
tc := tc
t.Run(name, func(t *testing.T) {
got := tc.tree.FullLen()
assert.Equal(t, tc.wantLen, got)
})
}
}
func TestTree_Eval_Expressions(t *testing.T) {
tt := map[string]struct {
tree gal.Tree
want gal.Value
}{
"starts with *": {
tree: gal.Tree{
gal.Multiply,
gal.NewNumberFromInt(-4),
},
want: gal.NewUndefinedWithReasonf("syntax error: missing left hand side value for operator '*'"),
},
"starts with + -4": {
tree: gal.Tree{
gal.Plus,
gal.NewNumberFromInt(-4),
},
want: gal.NewNumberFromInt(-4),
},
"starts with - -4": {
tree: gal.Tree{
gal.Minus,
gal.NewNumberFromInt(-4),
},
want: gal.NewNumberFromInt(4),
},
"chained * and /": {
tree: gal.Tree{
gal.NewNumberFromInt(3),
gal.Multiply,
gal.NewNumberFromInt(4),
gal.Divide,
gal.NewNumberFromInt(2),
gal.Divide,
gal.NewNumberFromInt(3),
gal.Multiply,
gal.NewNumberFromInt(4),
},
want: gal.NewNumberFromInt(8),
},
"chained and tree'ed * and /": {
tree: gal.Tree{
gal.Tree{
gal.Tree{
gal.Tree{
gal.NewNumberFromInt(3),
},
},
gal.Multiply,
gal.Tree{
gal.NewNumberFromInt(4),
},
},
gal.Divide,
gal.Tree{
gal.NewNumberFromInt(2),
},
gal.Divide,
gal.Tree{
gal.NewNumberFromInt(3),
},
gal.Multiply,
gal.Tree{
gal.NewNumberFromInt(4),
},
},
want: gal.NewNumberFromInt(8),
},
"rich tree": {
tree: gal.Tree{
gal.NewNumberFromInt(3),
gal.Minus,
gal.NewNumberFromInt(4),
gal.Multiply,
gal.Tree{
gal.Minus,
gal.NewNumberFromInt(2),
},
gal.Minus,
gal.NewNumberFromInt(5),
},
want: gal.NewNumberFromInt(6),
},
"multiple levels of decreasing operator precedence": {
tree: gal.Tree{
gal.NewNumberFromInt(10),
gal.Power,
gal.NewNumberFromInt(2),
gal.Multiply,
gal.NewNumberFromInt(4),
gal.Plus,
gal.NewNumberFromInt(3),
},
want: gal.NewNumberFromInt(403),
},
"multiple levels of operator precedence": {
tree: gal.Tree{
gal.NewNumberFromInt(10),
gal.Plus,
gal.NewNumberFromInt(5),
gal.Multiply,
gal.NewNumberFromInt(4),
gal.Power,
gal.NewNumberFromInt(3),
gal.Multiply,
gal.NewNumberFromInt(2),
gal.Plus,
gal.NewNumberFromInt(6),
gal.Multiply,
gal.NewNumberFromInt(7),
},
want: gal.NewNumberFromInt(692),
},
"rich sub-trees": {
tree: gal.Tree{
gal.NewNumberFromInt(10),
gal.Plus,
gal.Tree{
gal.NewNumberFromInt(5),
gal.Multiply,
gal.Tree{
gal.Minus,
gal.NewNumberFromInt(4),
gal.Modulus,
gal.Tree{
gal.Minus,
gal.NewNumberFromInt(3),
},
},
},
},
want: gal.NewNumberFromInt(5),
},
"function": {
tree: gal.Tree{
gal.NewNumberFromInt(10),
gal.Plus,
gal.NewFunction(
"trunc",
gal.Trunc,
gal.Tree{
gal.NewFunction(
"sqrt",
gal.Sqrt,
gal.Tree{
gal.NewNumberFromInt(10),
},
),
},
gal.Tree{
gal.NewNumberFromInt(6),
},
),
},
want: gal.NewNumberFromFloat(13.162277),
},
}
for name, tc := range tt {
tc := tc
t.Run(name, func(t *testing.T) {
val := tc.tree.Eval()
if !cmp.Equal(tc.want, val) {
if _, ok := val.(gal.Undefined); ok {
t.Log("Value:", val.String())
}
t.Errorf(cmp.Diff(tc.want, val))
}
})
}
}