-
Notifications
You must be signed in to change notification settings - Fork 15
/
value_set_generic.go
338 lines (289 loc) · 7.46 KB
/
value_set_generic.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
package rel
import (
"context"
"fmt"
"reflect"
"github.com/arr-ai/frozen"
"github.com/arr-ai/wbnf/parser"
"github.com/arr-ai/arrai/pkg/fu"
)
// GenericSet is a set of Values.
type GenericSet struct {
set frozen.Set
}
// genericSet equivalents for Boolean true and false
var (
None = Set(EmptySet{})
False = None
True = Set(TrueSet{})
stringCharTupleType = reflect.TypeOf(StringCharTuple{})
bytesByteTupleType = reflect.TypeOf(BytesByteTuple{})
arrayItemTupleType = reflect.TypeOf(ArrayItemTuple{})
dictEntryTupleType = reflect.TypeOf(DictEntryTuple{})
// TODO: uncomment when relation is implemented
// genericTupleType = reflect.TypeOf(&GenericTuple{})
)
func CanonicalSet(s Set) Set {
if s, ok := s.(GenericSet); ok {
b := NewSetBuilder()
for e := s.Enumerator(); e.MoveNext(); {
b.Add(e.Current())
}
result, err := b.Finish()
if err != nil {
panic(err)
}
return result
}
return s
}
func newGenericSetFromSet(s Set) Set {
sb := frozen.SetBuilder{}
for e := s.Enumerator(); e.MoveNext(); {
sb.Add(e.Current())
}
return newSetFromFrozenSet(sb.Finish())
}
func newSetFromFrozenSet(s frozen.Set) Set {
switch s.Count() {
case 0:
return None
case 1:
if s.Has(EmptyTuple) {
return True
}
}
return GenericSet{s}
}
// NewBool constructs a bool as a relation.
func NewBool(b bool) Set {
if b {
return True
}
return False
}
// Hash computes a hash for a genericSet.
func (s GenericSet) Hash(seed uintptr) uintptr {
h := seed
for e := s.Enumerator(); e.MoveNext(); {
h ^= e.Current().Hash(0)
}
return h
}
// Equal tests two Sets for equality. Any other type returns false.
func (s GenericSet) Equal(v interface{}) bool {
if t, ok := v.(GenericSet); ok {
return s.set.Equal(t.set)
}
return false
}
// String returns a string representation of a genericSet.
func (s GenericSet) String() string {
return fu.String(s)
}
// Format formats a genericSet.
func (s GenericSet) Format(f fmt.State, verb rune) {
// {} == none
if !s.IsTrue() {
if verb == 'v' {
fu.WriteString(f, sEmptySet)
}
return
}
// {()} == true
if s.Count() == 1 {
e := s.Enumerator()
e.MoveNext()
if tuple, ok := e.Current().(Tuple); ok && !tuple.IsTrue() {
fu.WriteString(f, sTrue)
return
}
}
reprOrderableSet(f, s)
}
// Eval returns the set.
func (s GenericSet) Eval(ctx context.Context, local Scope) (Value, error) {
return s, nil
}
// Source returns a scanner locating the GenericSet's source code.
func (s GenericSet) Source() parser.Scanner {
return *parser.NewScanner("")
}
var genericSetKind = registerKind(200, reflect.TypeOf(Function{}))
// Kind returns a number that is unique for each major kind of Value.
func (s GenericSet) Kind() int {
return genericSetKind
}
// Bool returns true iff the tuple has attributes.
func (s GenericSet) IsTrue() bool {
return s.Count() > 0
}
// Less returns true iff v.Kind() < genericSet.Kind() or v is a
// genericSet and t precedes v in a lexicographical comparison of their
// sorted values.
func (s GenericSet) Less(v Value) bool {
if s.Kind() != v.Kind() {
return s.Kind() < v.Kind()
}
x := v.(GenericSet)
a, b := s.OrderedValues(), x.OrderedValues()
for {
if !a.MoveNext() {
return b.MoveNext()
}
if !b.MoveNext() {
return false
}
ai := a.Current()
bi := b.Current()
if ai.Less(bi) {
return true
}
if bi.Less(ai) {
return false
}
}
}
// Negate returns {(negateTag): s}.
func (s GenericSet) Negate() Value {
if !s.IsTrue() {
return s
}
return NewTuple(NewAttr(negateTag, s))
}
// Export exports a genericSet as an array of exported Values.
func (s GenericSet) Export(ctx context.Context) interface{} {
if s.set.IsEmpty() {
return []interface{}{}
}
result := make([]interface{}, 0, s.set.Count())
for e := s.Enumerator(); e.MoveNext(); {
result = append(result, e.Current().Export(ctx))
}
return result
}
func (GenericSet) getSetBuilder() setBuilder {
return newGenericTypeSetBuilder()
}
func (GenericSet) getBucket() fmt.Stringer {
return genericType
}
// Count returns the number of elements in the genericSet.
func (s GenericSet) Count() int {
return s.set.Count()
}
// Has returns true iff the given Value is in the genericSet.
func (s GenericSet) Has(value Value) bool {
return s.set.Has(value)
}
// With returns the original genericSet with given value added. Iff the value was
// already present, the original genericSet is returned.
func (s GenericSet) With(v Value) Set {
if v.getBucket() == genericType {
return GenericSet{s.set.With(v)}
}
return toUnionSetWithItem(s, v)
}
// Without returns the original genericSet without the given value. Iff the value was
// already absent, the original genericSet is returned.
func (s GenericSet) Without(value Value) Set {
return newSetFromFrozenSet(s.set.Without(value))
}
// Map maps values per f.
func (s GenericSet) Map(f func(v Value) (Value, error)) (Set, error) {
sb := NewSetBuilder()
for e := s.Enumerator(); e.MoveNext(); {
v, err := f(e.Current())
if err != nil {
return nil, err
}
sb.Add(v)
}
return sb.Finish()
}
// Where returns a new genericSet with all the Values satisfying predicate p.
func (s GenericSet) Where(p func(v Value) (bool, error)) (_ Set, err error) {
set := s.set.Where(func(elem interface{}) bool {
if err != nil {
return false
}
if elem == nil {
return false
}
match, err2 := p(elem.(Value))
if err2 != nil {
err = err2
return false
}
return match
})
if err != nil {
return nil, err
}
return newSetFromFrozenSet(set), nil
}
var errElementsNotMatchingAt = fmt.Errorf("cannot call sets with elements not matching (@: _, _: _)")
func (s GenericSet) CallAll(_ context.Context, arg Value, b SetBuilder) error {
// generic set does not hold tuples
return errElementsNotMatchingAt
}
func (GenericSet) unionSetSubsetBucket() string {
return genericType.String()
}
// Enumerator returns an enumerator over the Values in the genericSet.
func (s GenericSet) Enumerator() ValueEnumerator {
return &genericSetEnumerator{s.set.Range()}
}
// Any return any value from the set.
func (s GenericSet) Any() Value {
for e := s.Enumerator(); e.MoveNext(); {
return e.Current()
}
panic("Any(): empty set")
}
type genericSetValueEnumerator struct {
*genericSetEnumerator
}
func (g *genericSetValueEnumerator) Current() Value {
// TODO: this is just a placeholder to replicate old functionality
// this should return anything that's not @
return g.i.Value().(Tuple).MustGet(ArrayItemAttr)
}
func (s GenericSet) ArrayEnumerator() ValueEnumerator {
return &genericSetValueEnumerator{
&genericSetEnumerator{
s.set.OrderedRange(
func(a, b interface{}) bool {
return a.(Tuple).MustGet("@").(Number) < b.(Tuple).MustGet("@").(Number)
},
),
},
}
}
// genericSetEnumerator represents an enumerator over a genericSet.
type genericSetEnumerator struct {
i frozen.Iterator
}
// MoveNext moves the enumerator to the next Value.
func (e *genericSetEnumerator) MoveNext() bool {
return e.i.Next()
}
// Current returns the enumerator's current Value.
func (e *genericSetEnumerator) Current() Value {
return e.i.Value().(Value)
}
// ValueList represents a []Value for use in sort.Sort().
type ValueList []Value
func (vl ValueList) Len() int {
return len(vl)
}
func (vl ValueList) Less(i, j int) bool {
return vl[i].Less(vl[j])
}
func (vl ValueList) Swap(i, j int) {
vl[i], vl[j] = vl[j], vl[i]
}
// OrderedValues returns Values in a canonical ordering.
func (s GenericSet) OrderedValues() ValueEnumerator {
return OrderedValueEnumerator(s.Enumerator(), ValueLess)
}