-
Notifications
You must be signed in to change notification settings - Fork 0
/
list.go
258 lines (228 loc) · 5.4 KB
/
list.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
package vesper
import (
"strings"
)
// QuoteSymbol represents a quoted expression
var QuoteSymbol = defaultVM.Intern("quote")
// QuasiquoteSymbol represents a quasiquoted expression
var QuasiquoteSymbol = defaultVM.Intern("quasiquote")
// UnquoteSymbol represents an unquoted expression
var UnquoteSymbol = defaultVM.Intern("unquote")
// UnquoteSplicingSymbol represents an unquote-splicing expression
var UnquoteSplicingSymbol = defaultVM.Intern("unquote-splicing")
// EmptyList - the value of (), terminates linked lists
var EmptyList = initEmpty()
// Cons - create a new list consisting of the first object and the rest of the list
func Cons(car *Object, cdr *Object) *Object {
return &Object{
Type: ListType,
car: car,
cdr: cdr,
}
}
// Car - return the first object in a list
func Car(lst *Object) *Object {
if lst == EmptyList {
return Null
}
return lst.car
}
// Cdr - return the rest of the list
func Cdr(lst *Object) *Object {
if lst == EmptyList {
return lst
}
return lst.cdr
}
// Caar - return the Car of the Car of the list
func Caar(lst *Object) *Object {
return Car(Car(lst))
}
// Cadr - return the Car of the Cdr of the list
func Cadr(lst *Object) *Object {
return Car(Cdr(lst))
}
// Cdar - return the Cdr of the Car of the list
func Cdar(lst *Object) *Object {
return Car(Cdr(lst))
}
// Cddr - return the Cdr of the Cdr of the list
func Cddr(lst *Object) *Object {
return Cdr(Cdr(lst))
}
// Cadar - return the Car of the Cdr of the Car of the list
func Cadar(lst *Object) *Object {
return Car(Cdr(Car(lst)))
}
// Caddr - return the Car of the Cdr of the Cdr of the list
func Caddr(lst *Object) *Object {
return Car(Cdr(Cdr(lst)))
}
// Cdddr - return the Cdr of the Cdr of the Cdr of the list
func Cdddr(lst *Object) *Object {
return Cdr(Cdr(Cdr(lst)))
}
// Cadddr - return the Car of the Cdr of the Cdr of the Cdr of the list
func Cadddr(lst *Object) *Object {
return Car(Cdr(Cdr(Cdr(lst))))
}
// Cddddr - return the Cdr of the Cdr of the Cdr of the Cdr of the list
func Cddddr(lst *Object) *Object {
return Cdr(Cdr(Cdr(Cdr(lst))))
}
func initEmpty() *Object {
return &Object{Type: ListType} //car and cdr are both nil
}
// ListEqual returns true if the object is equal to the argument
func ListEqual(lst *Object, a *Object) bool {
for lst != EmptyList {
if a == EmptyList {
return false
}
if !Equal(lst.car, a.car) {
return false
}
lst = lst.cdr
a = a.cdr
}
return lst == a
}
func listToString(lst *Object) string {
var buf strings.Builder
if lst != EmptyList && lst.cdr != EmptyList && Cddr(lst) == EmptyList {
switch lst.car {
case QuoteSymbol:
buf.WriteString("'")
buf.WriteString(Cadr(lst).String())
return buf.String()
case QuasiquoteSymbol:
buf.WriteString("`")
buf.WriteString(Cadr(lst).String())
return buf.String()
case UnquoteSymbol:
buf.WriteString("~")
buf.WriteString(Cadr(lst).String())
return buf.String()
case UnquoteSplicingSymbol:
buf.WriteString("~@")
buf.WriteString(Cadr(lst).String())
return buf.String()
}
}
buf.WriteString("(")
delim := ""
for lst != EmptyList {
buf.WriteString(delim)
delim = " "
buf.WriteString(lst.car.String())
lst = lst.cdr
}
buf.WriteString(")")
return buf.String()
}
// ListLength returns the length of the list
func ListLength(lst *Object) int {
if lst == EmptyList {
return 0
}
count := 1
o := lst.cdr
for o != EmptyList {
count++
o = o.cdr
}
return count
}
// MakeList creates a list of length count, with all values set to val
func MakeList(count int, val *Object) *Object {
result := EmptyList
for i := 0; i < count; i++ {
result = Cons(val, result)
}
return result
}
// ListFromValues creates a list from the given array
func ListFromValues(values []*Object) *Object {
p := EmptyList
for i := len(values) - 1; i >= 0; i-- {
v := values[i]
p = Cons(v, p)
}
return p
}
// List creates a new list from the arguments
func List(values ...*Object) *Object {
return ListFromValues(values)
}
func listToArray(lst *Object) *Object {
var elems []*Object
for lst != EmptyList {
elems = append(elems, lst.car)
lst = lst.cdr
}
return ArrayFromElementsNoCopy(elems)
}
// ToList - convert the argument to a List, if possible
func ToList(obj *Object) (*Object, error) {
switch obj.Type {
case ListType:
return obj, nil
case ArrayType:
return ListFromValues(obj.elements), nil
case StructType:
return structToList(obj)
case StringType:
return stringToList(obj), nil
}
return nil, Error(ArgumentErrorKey, "to-list cannot accept ", obj.Type)
}
// Reverse reverses a linked list
func Reverse(lst *Object) *Object {
rev := EmptyList
for lst != EmptyList {
rev = Cons(lst.car, rev)
lst = lst.cdr
}
return rev
}
// Flatten flattens a list into a single list
func Flatten(lst *Object) *Object {
result := EmptyList
tail := EmptyList
for lst != EmptyList {
item := lst.car
switch item.Type {
case ListType:
item = Flatten(item)
case ArrayType:
litem, _ := ToList(item)
item = Flatten(litem)
default:
item = List(item)
}
if tail == EmptyList {
result = item
tail = result
} else {
tail.cdr = item
}
for tail.cdr != EmptyList {
tail = tail.cdr
}
lst = lst.cdr
}
return result
}
// Concat joins two lists
func Concat(seq1 *Object, seq2 *Object) (*Object, error) {
rev := Reverse(seq1)
if rev == EmptyList {
return seq2, nil
}
lst := seq2
for rev != EmptyList {
lst = Cons(rev.car, lst)
rev = rev.cdr
}
return lst, nil
}