-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathstruct.go
349 lines (322 loc) · 8.16 KB
/
struct.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
339
340
341
342
343
344
345
346
347
348
349
/*
Copyright 2015 Lee Boynton
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 ell
import (
"bytes"
. "github.com/boynton/ell/data"
)
// StructLength - return the length (field count) of the <struct> object
func StructLength(strct *Struct) int {
return len(strct.Bindings)
}
// Get - return the value for the key of the object. The Value() function is first called to
// handle typed instances of <struct>.
// This is called by the VM, when a keyword is used as a function.
func Get(obj Value, key Value) (Value, error) {
if pi, ok := obj.(*Instance); ok {
obj = pi.Value
}
if p, ok := obj.(*Struct); ok {
return p.Get(key), nil
}
return nil, NewError(ArgumentErrorKey, "Expected a <struct> argument, got a ", obj.Type())
}
func Has(obj Value, key Value) (bool, error) {
tmp, err := Get(obj, key)
if err != nil || tmp == Null {
return false, err
}
return true, nil
}
func Put(obj Value, key Value, val Value) error {
if pi, ok := obj.(*Instance); ok {
obj = pi.Value
}
if p, ok := obj.(*Struct); ok {
p.Put(key, val)
return nil
}
return NewError(ArgumentErrorKey, "Expected a <struct> argument, got a ", obj.Type())
}
func Unput(obj Value, key Value) error {
if pi, ok := obj.(*Instance); ok {
obj = pi.Value
}
if p, ok := obj.(*Struct); ok {
p.Unput(key)
return nil
}
return NewError(ArgumentErrorKey, "Expected a <struct> argument, got a ", obj.Type())
}
func sliceContains(slice []Value, obj Value) bool {
for _, o := range slice {
if o == obj { //FIX: Equal() ?!
return true
}
}
return false
}
func slicePut(bindings []Value, key Value, val Value) []Value {
size := len(bindings)
for i := 0; i < size; i += 2 {
if key == bindings[i] {
bindings[i+1] = val
return bindings
}
}
return append(append(bindings, key), val)
}
func validateKeywordArgList(args *List, keys []Value) (Value, error) {
tmp, err := validateKeywordArgBindings(args, keys)
if err != nil {
return nil, err
}
return ListFromValues(tmp), nil
}
func validateKeywordArgBindings(args *List, keys []Value) ([]Value, error) {
count := ListLength(args)
bindings := make([]Value, 0, count)
for args != EmptyList {
key := Car(args)
switch p := key.(type) {
case *Symbol:
key = Intern(p.Text + ":")
if !sliceContains(keys, key) {
return nil, NewError(ArgumentErrorKey, key, " bad keyword parameter. Allowed keys: ", keys)
}
args = args.Cdr
if args == EmptyList {
return nil, NewError(ArgumentErrorKey, key, " mismatched keyword/value pair in parameter")
}
bindings = slicePut(bindings, key, Car(args))
case *Keyword:
if !sliceContains(keys, key) {
return nil, NewError(ArgumentErrorKey, key, " bad keyword parameter. Allowed keys: ", keys)
}
args = args.Cdr
if args == EmptyList {
return nil, NewError(ArgumentErrorKey, key, " mismatched keyword/value pair in parameter")
}
bindings = slicePut(bindings, key, Car(args))
case *Struct:
for k, v := range p.Bindings {
sym := Intern(k.Value)
if sliceContains(keys, sym) {
bindings = slicePut(bindings, sym, v)
}
}
default:
return nil, NewError(ArgumentErrorKey, "Not a keyword: ", key)
}
args = args.Cdr
}
return bindings, nil
}
// Equal returns true if the object is equal to the argument
func StructEqual(s1 *Struct, s2 *Struct) bool {
bindings1 := s1.Bindings
size := len(bindings1)
bindings2 := s2.Bindings
if size == len(bindings2) {
for k, v := range bindings1 {
v2, ok := bindings2[k]
if !ok {
return false
}
if !Equal(v, v2) {
return false
}
}
return true
}
return false
}
func structToString(s *Struct) string {
var buf bytes.Buffer
buf.WriteString("{")
first := true
for k, v := range s.Bindings {
if first {
first = false
} else {
buf.WriteString(" ")
}
buf.WriteString(k.Value)
buf.WriteString(" ")
buf.WriteString(v.String())
}
buf.WriteString("}")
return buf.String()
}
func StructToList(s *Struct) (*List, error) {
result := EmptyList
tail := EmptyList
for k, v := range s.Bindings {
tmp := NewList(k.ToValue(), v)
if result == EmptyList {
result = NewList(tmp)
tail = result
} else {
tail.Cdr = NewList(tmp)
tail = tail.Cdr
}
}
return result, nil
}
func StructToVector(s *Struct) *Vector {
size := len(s.Bindings)
el := make([]Value, size)
j := 0
for k, v := range s.Bindings {
el[j] = NewVector(k.ToValue(), v)
j++
}
return VectorFromElements(el, size)
}
func StructKeys(s Value) Value {
if ss, ok := s.(*Struct); ok {
return structKeyList(ss)
}
return EmptyList
}
func StructValues(s Value) Value {
if ss, ok := s.(*Struct); ok {
return structValueList(ss)
}
return EmptyList
}
func structKeyList(s *Struct) *List {
result := EmptyList
tail := EmptyList
for k := range s.Bindings {
key := k.ToValue()
if result == EmptyList {
result = NewList(key)
tail = result
} else {
tail.Cdr = NewList(key)
tail = tail.Cdr
}
}
return result
}
func structValueList(s *Struct) *List {
result := EmptyList
tail := EmptyList
for _, v := range s.Bindings {
if result == EmptyList {
result = NewList(v)
tail = result
} else {
tail.Cdr = NewList(v)
tail = tail.Cdr
}
}
return result
}
func listToStruct(lst *List) (Value, error) {
strct := NewStruct()
// strct.bindings = make(map[structKey]Value)
for lst != EmptyList {
k := lst.Car
lst = lst.Cdr
switch p := k.(type) {
case *List:
if EmptyList == p || EmptyList == p.Cdr || EmptyList != p.Cdr.Cdr {
return nil, NewError(ArgumentErrorKey, "Bad struct binding: ", k)
}
if !IsValidStructKey(p.Car) {
return nil, NewError(ArgumentErrorKey, "Bad struct key: ", p.Car)
}
strct.Put(p.Car, p.Cdr.Car)
case *Vector:
elements := p.Elements
n := len(elements)
if n != 2 {
return nil, NewError(ArgumentErrorKey, "Bad struct binding: ", k)
}
if !IsValidStructKey(elements[0]) {
return nil, NewError(ArgumentErrorKey, "Bad struct key: ", elements[0])
}
strct.Put(elements[0], elements[1])
default:
if !IsValidStructKey(k) {
return nil, NewError(ArgumentErrorKey, "Bad struct key: ", k)
}
if lst == EmptyList {
return nil, NewError(ArgumentErrorKey, "Mismatched keyword/value in list: ", k)
}
Put(strct, k, lst.Car)
lst = lst.Cdr
}
}
return strct, nil
}
func vectorToStruct(vec *Vector) (Value, error) {
count := len(vec.Elements)
strct := NewStruct()
i := 0
for i < count {
k := vec.Elements[i]
i++
switch p := k.(type) {
case *List:
if EmptyList == p || EmptyList == p.Cdr || EmptyList != p.Cdr.Cdr {
return nil, NewError(ArgumentErrorKey, "Bad struct binding: ", k)
}
if !IsValidStructKey(p.Car) {
return nil, NewError(ArgumentErrorKey, "Bad struct key: ", p.Car)
}
strct.Put(p.Car, p.Cdr.Car)
case *Vector:
elements := p.Elements
n := len(elements)
if n != 2 {
return nil, NewError(ArgumentErrorKey, "Bad struct binding: ", k)
}
if !IsValidStructKey(elements[0]) {
return nil, NewError(ArgumentErrorKey, "Bad struct key: ", elements[0])
}
strct.Put(elements[0], elements[1])
case *String, *Symbol, *Keyword, *Type:
default:
if !IsValidStructKey(k) {
return nil, NewError(ArgumentErrorKey, "Bad struct key: ", k)
}
if i == count {
return nil, NewError(ArgumentErrorKey, "Mismatched keyword/value in vector: ", k)
}
Put(strct, k, vec.Elements[i])
i++
}
}
return strct, nil
}
func ToStruct(obj Value) (Value, error) {
val := Value(obj)
switch p := val.(type) {
case *Struct:
return p, nil
case *List:
return listToStruct(p)
case *Vector:
return vectorToStruct(p)
}
return nil, NewError(ArgumentErrorKey, "to-struct cannot accept argument of type ", obj.Type())
}
func IsStruct(obj Value) bool {
if _, ok := obj.(*Struct); ok {
return true
}
return false
}