-
Notifications
You must be signed in to change notification settings - Fork 60
/
Copy pathtypes.go
407 lines (361 loc) · 6.17 KB
/
types.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
package symexpr
import "sort"
type Leaf struct {
ExprStats
}
type Unary struct {
ExprStats
C Expr
}
type Binary struct {
ExprStats
C1, C2 Expr
}
type N_ary struct {
ExprStats
CS []Expr
}
// Leaf Nodes
type Time struct {
Leaf
}
func NewTime() *Time { return new(Time) }
func (t *Time) ExprType() ExprType { return TIME }
func (t *Time) Clone() Expr { return NewTime() }
type Var struct {
Leaf
P int
}
func NewVar(i int) *Var {
v := new(Var)
v.P = i
return v
}
func (v *Var) ExprType() ExprType { return VAR }
func (v *Var) Clone() Expr { return NewVar(v.P) }
type Constant struct {
Leaf
P int
}
func NewConstant(i int) *Constant {
c := new(Constant)
c.P = i
return c
}
func (c *Constant) ExprType() ExprType { return CONSTANT }
func (c *Constant) Clone() Expr { return NewConstant(c.P) }
type ConstantF struct {
Leaf
F float64
}
func NewConstantF(f float64) *ConstantF {
c := new(ConstantF)
c.F = f
return c
}
func (c *ConstantF) ExprType() ExprType { return CONSTANTF }
func (c *ConstantF) Clone() Expr { return NewConstantF(c.F) }
type System struct {
Leaf
P int
}
func NewSystem(i int) *System {
s := new(System)
s.P = i
return s
}
func (s *System) ExprType() ExprType { return SYSTEM }
func (s *System) Clone() Expr { return NewSystem(s.P) }
// Unary Operators
type Neg struct {
Unary
}
func NewNeg(e Expr) *Neg {
n := new(Neg)
n.C = e
return n
}
func (u *Neg) ExprType() ExprType { return NEG }
func (u *Neg) Clone() Expr {
var C Expr
if u.C != nil {
C = u.C.Clone()
}
return NewNeg(C)
}
type Abs struct {
Unary
}
func NewAbs(e Expr) *Abs {
n := new(Abs)
n.C = e
return n
}
func (u *Abs) ExprType() ExprType { return ABS }
func (u *Abs) Clone() Expr {
var C Expr
if u.C != nil {
C = u.C.Clone()
}
return NewAbs(C)
}
type Sqrt struct {
Unary
}
func NewSqrt(e Expr) *Sqrt {
n := new(Sqrt)
n.C = e
return n
}
func (u *Sqrt) ExprType() ExprType { return SQRT }
func (u *Sqrt) Clone() Expr {
var C Expr
if u.C != nil {
C = u.C.Clone()
}
return NewSqrt(C)
}
type Sin struct {
Unary
}
func NewSin(e Expr) *Sin {
n := new(Sin)
n.C = e
return n
}
func (u *Sin) ExprType() ExprType { return SIN }
func (u *Sin) Clone() Expr {
var C Expr
if u.C != nil {
C = u.C.Clone()
}
return NewSin(C)
}
type Cos struct {
Unary
}
func NewCos(e Expr) *Cos {
n := new(Cos)
n.C = e
return n
}
func (u *Cos) ExprType() ExprType { return COS }
func (u *Cos) Clone() Expr {
var C Expr
if u.C != nil {
C = u.C.Clone()
}
return NewCos(C)
}
type Tan struct {
Unary
}
func NewTan(e Expr) *Tan {
n := new(Tan)
n.C = e
return n
}
func (u *Tan) ExprType() ExprType { return TAN }
func (u *Tan) Clone() Expr {
var C Expr
if u.C != nil {
C = u.C.Clone()
}
return NewTan(C)
}
type Exp struct {
Unary
}
func NewExp(e Expr) *Exp {
n := new(Exp)
n.C = e
return n
}
func (u *Exp) ExprType() ExprType { return EXP }
func (u *Exp) Clone() Expr {
var C Expr
if u.C != nil {
C = u.C.Clone()
}
return NewExp(C)
}
type Log struct {
Unary
}
func NewLog(e Expr) *Log {
n := new(Log)
n.C = e
return n
}
func (u *Log) ExprType() ExprType { return LOG }
func (u *Log) Clone() Expr {
var C Expr
if u.C != nil {
C = u.C.Clone()
}
return NewLog(C)
}
// Hmmm... Operators
type PowI struct {
ExprStats
Base Expr
Power int
}
func NewPowI(e Expr, i int) *PowI {
n := new(PowI)
if e != nil {
n.Base = e.Clone()
}
n.Power = i
return n
}
func (u *PowI) ExprType() ExprType { return POWI }
func (u *PowI) Clone() Expr { return NewPowI(u.Base, u.Power) }
type PowF struct {
ExprStats
Base Expr
Power float64
}
func NewPowF(b Expr, f float64) *PowF {
n := new(PowF)
n.Base = b
n.Power = f
return n
}
func (u *PowF) ExprType() ExprType { return POWF }
func (u *PowF) Clone() Expr {
var base Expr
if u.Base != nil {
base = u.Base.Clone()
}
return NewPowF(base, u.Power)
}
type PowE struct {
ExprStats
Base Expr
Power Expr
}
func NewPowE(b, p Expr) *PowE {
n := new(PowE)
n.Base = b
n.Power = p
return n
}
func (n *PowE) ExprType() ExprType { return POWE }
func (n *PowE) Clone() Expr {
var base, pow Expr
if n.Base != nil {
base = n.Base.Clone()
}
if n.Power != nil {
pow = n.Power.Clone()
}
return NewPowE(base, pow)
}
type Div struct {
ExprStats
Numer Expr
Denom Expr
}
func NewDiv(n, d Expr) *Div {
D := new(Div)
D.Numer = n
D.Denom = d
return D
}
func (n *Div) ExprType() ExprType { return DIV }
func (n *Div) Clone() Expr {
var N, D Expr
if n.Numer != nil {
N = n.Numer.Clone()
}
if n.Denom != nil {
D = n.Denom.Clone()
}
return NewDiv(N, D)
}
// N-ary Operators
type Add struct {
N_ary
}
func NewAdd() *Add {
a := new(Add)
a.CS = make([]Expr, 0)
return a
}
func (n *Add) ExprType() ExprType { return ADD }
func (n *Add) Clone() Expr {
a := new(Add)
a.CS = make([]Expr, len(n.CS))
for i, C := range n.CS {
if C != nil {
a.CS[i] = C.Clone()
}
}
return a
}
func (a *Add) Insert(e Expr) {
if len(a.CS) == cap(a.CS) {
tmp := make([]Expr, len(a.CS), 2*len(a.CS))
copy(tmp[:len(a.CS)], a.CS)
a.CS = tmp
}
a.CS = append(a.CS, e)
sort.Sort(a)
}
type Mul struct {
N_ary
}
func NewMul() *Mul {
m := new(Mul)
m.CS = make([]Expr, 0)
return m
}
func (n *Mul) ExprType() ExprType { return MUL }
func (n *Mul) Clone() Expr {
a := NewMul()
a.CS = make([]Expr, len(n.CS))
for i, C := range n.CS {
if C != nil {
a.CS[i] = C.Clone()
}
}
return a
}
func (a *Mul) Insert(e Expr) {
if len(a.CS) == cap(a.CS) {
tmp := make([]Expr, len(a.CS), 2*len(a.CS))
copy(tmp[:len(a.CS)], a.CS)
a.CS = tmp
}
a.CS = append(a.CS, e)
sort.Sort(a)
}
func (n *Add) Len() int { return len(n.CS) }
func (n *Add) Swap(i, j int) { n.CS[i], n.CS[j] = n.CS[j], n.CS[i] }
func (n *Add) Less(i, j int) bool {
if n.CS[i] == nil && n.CS[j] == nil {
return false
}
if n.CS[i] == nil {
return false
}
if n.CS[j] == nil {
return true
}
return n.CS[i].AmILess(n.CS[j])
}
func (n *Mul) Len() int { return len(n.CS) }
func (n *Mul) Swap(i, j int) { n.CS[i], n.CS[j] = n.CS[j], n.CS[i] }
func (n *Mul) Less(i, j int) bool {
if n.CS[i] == nil && n.CS[j] == nil {
return false
}
if n.CS[i] == nil {
return false
}
if n.CS[j] == nil {
return true
}
return n.CS[i].AmILess(n.CS[j])
}