forked from gorgonia/gorgonia
-
Notifications
You must be signed in to change notification settings - Fork 0
/
equalities.go
213 lines (193 loc) · 3.18 KB
/
equalities.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
package gorgonia
import (
"gorgonia.org/dawson"
"gorgonia.org/tensor"
)
func scalarEq(a, b Scalar) bool {
switch at := a.(type) {
case *F64:
if bt, ok := b.(*F64); ok {
if at == bt {
return true
}
return *at == *bt
}
return false
case *F32:
if bt, ok := b.(*F32); ok {
if at == bt {
return true
}
return *at == *bt
}
return false
case *I:
if bt, ok := b.(*I); ok {
if at == bt {
return true
}
return *at == *bt
}
return false
case *I32:
if bt, ok := b.(*I32); ok {
if at == bt {
return true
}
return *at == *bt
}
return false
case *I64:
if bt, ok := b.(*I64); ok {
if at == bt {
return true
}
return *at == *bt
}
return false
case *U8:
if bt, ok := b.(*U8); ok {
if at == bt {
return true
}
return *at == *bt
}
return false
case *B:
if bt, ok := b.(*B); ok {
if at == bt {
return true
}
return *at == *bt
}
return false
}
return false
}
func scalarClose(a, b Scalar) bool {
switch at := a.(type) {
case *F64:
if bt, ok := b.(*F64); ok {
return dawson.CloseF64(float64(*at), float64(*bt))
}
return false
case *F32:
if bt, ok := b.(*F32); ok {
return dawson.CloseF32(float32(*at), float32(*bt))
}
return false
default:
return scalarEq(a, b)
}
}
func tensorClose(a, b tensor.Tensor) bool {
aDt := a.Dtype()
bDt := b.Dtype()
if aDt != bDt {
return false
}
switch aDt {
case tensor.Float64:
aFs := a.Data().([]float64)
bFs := b.Data().([]float64)
if len(aFs) != len(bFs) {
return false
}
aFs = aFs[:]
bFs = bFs[:len(aFs)]
for i, v := range aFs {
if !dawson.CloseF64(v, bFs[i]) {
return false
}
}
return true
case tensor.Float32:
aFs := a.Data().([]float32)
bFs := b.Data().([]float32)
if len(aFs) != len(bFs) {
return false
}
aFs = aFs[:]
bFs = bFs[:len(aFs)]
for i, v := range aFs {
if !dawson.CloseF32(v, bFs[i]) {
return false
}
}
return true
default:
return a.Eq(b)
}
}
/*
func axesEq(a, b axes) bool {
if len(a) != len(b) {
return false
}
for i, s := range a {
if b[i] != s {
return false
}
}
return true
}
// yes it's exactly the same as axesEq
func coordEq(a, b coordinates) bool {
if len(a) != len(b) {
return false
}
for i, s := range a {
if b[i] != s {
return false
}
}
return true
}
*/
func constEq(a, b constant) (ok bool) {
switch at := a.(type) {
case constantScalar:
var bt constantScalar
if bt, ok = b.(constantScalar); !ok {
return
}
return bt == at
case constantTensor:
var bt constantTensor
if bt, ok = b.(constantTensor); !ok {
return
}
return at.v.Eq(bt.v)
default:
panic("Not yet implemented")
}
}
// fastest comparisons to least fastest
func nodeEq(a, b *Node) bool {
if a == b {
return true
}
if a.isInput() {
if !b.isInput() {
return false
}
return a.name == b.name
}
if b.isInput() {
return false
}
// hashcode is good for comparing Op (TODO: benchmark this vs reflect.DeepEq)
if a.op.Hashcode() != b.op.Hashcode() {
return false
}
if len(a.children) != len(b.children) {
return false
}
if a.t != b.t {
return false
}
if !a.shape.Eq(b.shape) {
return false
}
return true
}