-
Notifications
You must be signed in to change notification settings - Fork 0
/
NotEqual.go
238 lines (225 loc) · 5.05 KB
/
NotEqual.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
// =================================================================
//
// Copyright (C) 2019 Spatial Current, Inc. - All Rights Reserved
// Released as open source under the MIT License. See LICENSE file.
//
// =================================================================
package dfl
import (
"fmt"
"net"
)
// NotEqual is a BinaryOperator that evaluates to true if the left value is not equal to the right value.
// The values may be of type int, int64, or float64.
type NotEqual struct {
*BinaryOperator
}
// Dfl returns the DFL expression representation of the node as a string value.
// For example
// "( @amenity != shop )"
func (ne NotEqual) Dfl(quotes []string, pretty bool, tabs int) string {
return ne.BinaryOperator.Dfl("!=", quotes, pretty, tabs)
}
// Sql returns the SQL representation of this node as a string
func (ne NotEqual) Sql(pretty bool, tabs int) string {
switch right := ne.Right.(type) {
case Literal:
switch right.Value.(type) {
case Null:
if pretty {
return ne.Left.Sql(pretty, tabs) + " IS NOT NULL"
}
}
}
return ne.BinaryOperator.Sql("!=", pretty, tabs)
}
func (ne NotEqual) Map() map[string]interface{} {
return ne.BinaryOperator.Map("notequal", ne.Left, ne.Right)
}
func (ne NotEqual) Compile() Node {
left := ne.Left.Compile()
right := ne.Right.Compile()
return NotEqual{&BinaryOperator{Left: left, Right: right}}
}
func (ne NotEqual) Evaluate(vars map[string]interface{}, ctx interface{}, funcs FunctionMap, quotes []string) (map[string]interface{}, interface{}, error) {
vars, lv, rv, err := ne.EvaluateLeftAndRight(vars, ctx, funcs, quotes)
if err != nil {
return vars, 0, err
}
switch lv.(type) {
case []interface{}:
lv = TryConvertArray(lv.([]interface{}))
}
switch lv.(type) {
case nil, Null:
switch rv.(type) {
case nil, Null:
return vars, false, nil
}
return vars, true, nil
case string:
lvs := lv.(string)
switch rv.(type) {
case Null:
return vars, true, nil
case string:
return vars, lvs != rv.(string), nil
case int:
return vars, lvs != fmt.Sprint(rv.(int)), nil
case uint8:
return vars, lvs != fmt.Sprint(rv.(uint8)), nil
case int64:
return vars, lvs != fmt.Sprint(rv.(int64)), nil
case float64:
return vars, lvs != fmt.Sprint(rv.(float64)), nil
}
case float64:
switch rv.(type) {
case Null:
return vars, true, nil
}
case net.IP:
lvip := lv.(net.IP)
switch rv.(type) {
case Null:
return vars, true, nil
case net.IP:
rvip := rv.(net.IP)
if len(lvip) != len(rvip) {
return vars, true, nil
}
for i, lvb := range lvip {
if lvb != rvip[i] {
return vars, true, nil
}
}
return vars, false, nil
}
case []string:
lva := lv.([]string)
switch rv.(type) {
case Null:
return vars, true, nil
case []string:
rva := rv.([]string)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if lvs != rva[i] {
return vars, true, nil
}
}
return vars, false, nil
}
case []int:
lva := lv.([]int)
switch rv.(type) {
case Null:
return vars, true, nil
case []int:
rva := rv.([]int)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if lvs != rva[i] {
return vars, true, nil
}
}
return vars, false, nil
case []uint8:
rva := rv.([]uint8)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if lvs != int(rva[i]) {
return vars, true, nil
}
}
return vars, false, nil
case []float64:
rva := rv.([]float64)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if float64(lvs) != rva[i] {
return vars, true, nil
}
}
return vars, false, nil
}
case []uint8:
lva := lv.([]uint8)
switch rv.(type) {
case []int:
rva := rv.([]int)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if int(lvs) != rva[i] {
return vars, true, nil
}
}
return vars, false, nil
case []uint8:
rva := rv.([]uint8)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if lvs != rva[i] {
return vars, true, nil
}
}
return vars, false, nil
case []float64:
rva := rv.([]float64)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if float64(lvs) != rva[i] {
return vars, true, nil
}
}
return vars, false, nil
}
case []float64:
lva := lv.([]float64)
switch rv.(type) {
case Null:
return vars, true, nil
case []int:
rva := rv.([]int)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if lvs != float64(rva[i]) {
return vars, true, nil
}
}
return vars, false, nil
case []float64:
rva := rv.([]float64)
if len(lva) != len(rva) {
return vars, true, nil
}
for i, lvs := range lva {
if lvs != rva[i] {
return vars, true, nil
}
}
return vars, false, nil
}
}
v, err := CompareNumbers(lv, rv)
if err != nil {
return vars, 0, err
}
return vars, v != 0, err
}