-
Notifications
You must be signed in to change notification settings - Fork 104
Expand file tree
/
Copy pathset.go
More file actions
223 lines (195 loc) · 4.8 KB
/
set.go
File metadata and controls
223 lines (195 loc) · 4.8 KB
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
// Copyright 2018 The go-python Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Set and FrozenSet types
//
// FIXME preliminary implementation only - doesn't work properly!
package py
var SetType = NewTypeX("set", "set() -> new empty set object\nset(iterable) -> new set object\n\nBuild an unordered collection of unique elements.", SetNew, nil)
type SetValue struct{}
type Set struct {
items map[Object]SetValue
}
// Type of this Set object
func (o *Set) Type() *Type {
return SetType
}
// Make a new empty set
func NewSet() *Set {
return &Set{
items: make(map[Object]SetValue),
}
}
// Make a new empty set with capacity for n items
func NewSetWithCapacity(n int) *Set {
return &Set{
items: make(map[Object]SetValue, n),
}
}
// Make a new set with the items passed in
func NewSetFromItems(items []Object) *Set {
s := NewSetWithCapacity(len(items))
for _, item := range items {
s.items[item] = SetValue{}
}
return s
}
// Add an item to the set
func (s *Set) Add(item Object) {
s.items[item] = SetValue{}
}
// SetNew
func SetNew(metatype *Type, args Tuple, kwargs StringDict) (Object, error) {
var iterable Object
err := UnpackTuple(args, kwargs, "set", 0, 1, &iterable)
if err != nil {
return nil, err
}
if iterable == nil {
return NewSet(), nil
}
// FIXME should be able to initialise from an iterable!
return NewSetFromItems(iterable.(Tuple)), nil
}
var FrozenSetType = NewType("frozenset", "frozenset() -> empty frozenset object\nfrozenset(iterable) -> frozenset object\n\nBuild an immutable unordered collection of unique elements.")
type FrozenSet struct {
Set
}
// Type of this FrozenSet object
func (o *FrozenSet) Type() *Type {
return FrozenSetType
}
// Make a new empty frozen set
func NewFrozenSet() *FrozenSet {
return &FrozenSet{
Set: *NewSet(),
}
}
// Make a new set with the items passed in
func NewFrozenSetFromItems(items []Object) *FrozenSet {
return &FrozenSet{
Set: *NewSetFromItems(items),
}
}
// Extend the set with items
func (s *Set) Update(items []Object) {
for _, item := range items {
s.items[item] = SetValue{}
}
}
func (s *Set) M__len__() (Object, error) {
return Int(len(s.items)), nil
}
func (s *Set) M__bool__() (Object, error) {
return NewBool(len(s.items) > 0), nil
}
func (s *Set) M__iter__() (Object, error) {
items := make(Tuple, 0, len(s.items))
for item := range s.items {
items = append(items, item)
}
return NewIterator(items), nil
}
func (s *Set) M__and__(other Object) (Object, error) {
ret := NewSet()
b, ok := other.(*Set)
if !ok {
return nil, ExceptionNewf(TypeError, "unsupported operand type(s) for &: '%s' and '%s'", s.Type().Name, other.Type().Name)
}
for i := range b.items {
if _, ok := s.items[i]; ok {
ret.items[i] = SetValue{}
}
}
return ret, nil
}
func (s *Set) M__or__(other Object) (Object, error) {
ret := NewSet()
b, ok := other.(*Set)
if !ok {
return nil, ExceptionNewf(TypeError, "unsupported operand type(s) for &: '%s' and '%s'", s.Type().Name, other.Type().Name)
}
for j := range s.items {
ret.items[j] = SetValue{}
}
for i := range b.items {
if _, ok := s.items[i]; !ok {
ret.items[i] = SetValue{}
}
}
return ret, nil
}
func (s *Set) M__sub__(other Object) (Object, error) {
ret := NewSet()
b, ok := other.(*Set)
if !ok {
return nil, ExceptionNewf(TypeError, "unsupported operand type(s) for &: '%s' and '%s'", s.Type().Name, other.Type().Name)
}
for j := range s.items {
ret.items[j] = SetValue{}
}
for i := range b.items {
if _, ok := s.items[i]; ok {
delete(ret.items, i)
}
}
return ret, nil
}
func (s *Set) M__xor__(other Object) (Object, error) {
ret := NewSet()
b, ok := other.(*Set)
if !ok {
return nil, ExceptionNewf(TypeError, "unsupported operand type(s) for &: '%s' and '%s'", s.Type().Name, other.Type().Name)
}
for j := range s.items {
ret.items[j] = SetValue{}
}
for i := range b.items {
_, ok := s.items[i]
if ok {
delete(ret.items, i)
} else {
ret.items[i] = SetValue{}
}
}
return ret, nil
}
// Check interface is satisfied
var _ I__len__ = (*Set)(nil)
var _ I__bool__ = (*Set)(nil)
var _ I__iter__ = (*Set)(nil)
// var _ richComparison = (*Set)(nil)
func (a *Set) M__eq__(other Object) (Object, error) {
b, ok := other.(*Set)
if !ok {
return NotImplemented, nil
}
if len(a.items) != len(b.items) {
return False, nil
}
// FIXME nasty O(n**2) algorithm, waiting for proper hashing!
for i := range a.items {
for j := range b.items {
eq, err := Eq(i, j)
if err != nil {
return nil, err
}
if eq == True {
goto found
}
}
return False, nil
found:
}
return True, nil
}
func (a *Set) M__ne__(other Object) (Object, error) {
eq, err := a.M__eq__(other)
if err != nil {
return nil, err
}
if eq == True {
return False, nil
}
return True, nil
}