/
equality.go
214 lines (189 loc) · 4.91 KB
/
equality.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
// Copyright 2020 CUE Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package adt
type Flag uint16
const (
// IgnoreOptional allows optional information to be ignored. This only
// applies when CheckStructural is given.
IgnoreOptional Flag = 1 << iota
// CheckStructural indicates that closedness information should be
// considered for equality. Equal may return false even when values are
// equal.
CheckStructural Flag = 1 << iota
)
func Equal(ctx *OpContext, v, w Value, flags Flag) bool {
if x, ok := v.(*Vertex); ok {
return equalVertex(ctx, x, w, flags)
}
if y, ok := w.(*Vertex); ok {
return equalVertex(ctx, y, v, flags)
}
return equalTerminal(ctx, v, w, flags)
}
func equalVertex(ctx *OpContext, x *Vertex, v Value, flags Flag) bool {
y, ok := v.(*Vertex)
if !ok {
return false
}
if x == y {
return true
}
if x.ArcType != y.ArcType {
return false
}
xk := x.Kind()
yk := y.Kind()
if xk != yk {
return false
}
maxArcType := ArcMember
if flags&CheckStructural != 0 {
// Do not ignore optional fields
// TODO(required): consider making this unconditional
maxArcType = ArcOptional
}
// TODO: this really should be subsumption.
if flags != 0 {
if x.IsClosedStruct() != y.IsClosedStruct() {
return false
}
if !equalClosed(ctx, x, y, flags) {
return false
}
}
loop1:
for _, a := range x.Arcs {
if a.ArcType > maxArcType {
continue
}
for _, b := range y.Arcs {
if a.Label == b.Label {
if a.ArcType != b.ArcType || !Equal(ctx, a, b, flags) {
return false
}
continue loop1
}
}
return false
}
loop2:
for _, b := range y.Arcs {
if b.ArcType > maxArcType {
continue
}
for _, a := range x.Arcs {
if a.Label == b.Label {
if a.ArcType > maxArcType {
// No need to continue: arc with label not found.
break
}
// Label found. Equality was already tested in loop 1.
continue loop2
}
}
// Arc with same label not found.
return false
}
v, ok1 := x.BaseValue.(Value)
w, ok2 := y.BaseValue.(Value)
if !ok1 && !ok2 {
return true // both are struct or list.
}
return equalTerminal(ctx, v, w, flags)
}
// equalClosed tests if x and y have the same set of close information.
// TODO: the following refinements are possible:
// - unify optional fields and equate the optional fields
// - do the same for pattern constraints, where the pattern constraints
// are collated by pattern equality.
// - a further refinement would collate patterns by ranges.
//
// For all these refinements it would be necessary to have well-working
// structure sharing so as to not repeatedly recompute optional arcs.
func equalClosed(ctx *OpContext, x, y *Vertex, flags Flag) bool {
return verifyStructs(x, y, flags) && verifyStructs(y, x, flags)
}
func verifyStructs(x, y *Vertex, flags Flag) bool {
outer:
for _, s := range x.Structs {
if (flags&IgnoreOptional != 0) && !s.StructLit.HasOptional() {
continue
}
if s.span()&DefinitionSpan == 0 {
if !s.StructLit.HasOptional() {
continue
}
}
for _, t := range y.Structs {
if s.StructLit == t.StructLit {
continue outer
}
}
return false
}
return true
}
func equalTerminal(ctx *OpContext, v, w Value, flags Flag) bool {
if v == w {
return true
}
switch x := v.(type) {
case *Bottom:
// All errors are logically the same.
_, ok := w.(*Bottom)
return ok
case *Num, *String, *Bool, *Bytes, *Null:
if b, ok := BinOp(ctx, EqualOp, v, w).(*Bool); ok {
return b.B
}
return false
// TODO: for the remainder we are dealing with non-concrete values, so we
// could also just not bother.
case *BoundValue:
if y, ok := w.(*BoundValue); ok {
return x.Op == y.Op && Equal(ctx, x.Value, y.Value, flags)
}
case *BasicType:
if y, ok := w.(*BasicType); ok {
return x.K == y.K
}
case *Conjunction:
y, ok := w.(*Conjunction)
if !ok || len(x.Values) != len(y.Values) {
return false
}
// always ordered the same
for i, xe := range x.Values {
if !Equal(ctx, xe, y.Values[i], flags) {
return false
}
}
return true
case *Disjunction:
// The best way to compute this is with subsumption, but even that won't
// be too accurate. Assume structural equivalence for now.
y, ok := w.(*Disjunction)
if !ok || len(x.Values) != len(y.Values) {
return false
}
for i, xe := range x.Values {
if !Equal(ctx, xe, y.Values[i], flags) {
return false
}
}
return true
case *BuiltinValidator:
}
return false
}