blob: d8d4ce5facb5545626ed6251be8613f25db1395e (
plain)
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
|
(.module:
[lux #*
[control
[monoid (#+ Monoid)]
[functor (#+ Functor)]
[equivalence (#+ Equivalence)]
fold]
[data
[collection [list ("list/" Fold<List>)]]
[product]]
])
(def: #export (new size)
(All [a] (-> Nat (Array a)))
("lux array new" size))
(def: #export (size xs)
(All [a] (-> (Array a) Nat))
("lux array size" xs))
(def: #export (read i xs)
(All [a]
(-> Nat (Array a) (Maybe a)))
("lux array get" xs i))
(def: #export (write i x xs)
(All [a]
(-> Nat a (Array a) (Array a)))
("lux array put" xs i x))
(def: #export (delete i xs)
(All [a]
(-> Nat (Array a) (Array a)))
("lux array remove" xs i))
(def: #export (copy length src-start src-array dest-start dest-array)
(All [a]
(-> Nat Nat (Array a) Nat (Array a)
(Array a)))
(if (n/= +0 length)
dest-array
(list/fold (function (_ offset target)
(case (read (n/+ offset src-start) src-array)
#.None
target
(#.Some value)
(write (n/+ offset dest-start) value target)))
dest-array
(list.n/range +0 (dec length)))))
(def: #export (occupied array)
{#.doc "Finds out how many cells in an array are occupied."}
(All [a] (-> (Array a) Nat))
(list/fold (function (_ idx count)
(case (read idx array)
#.None
count
(#.Some _)
(inc count)))
+0
(list.indices (size array))))
(def: #export (vacant array)
{#.doc "Finds out how many cells in an array are vacant."}
(All [a] (-> (Array a) Nat))
(n/- (occupied array) (size array)))
(def: #export (filter p xs)
(All [a]
(-> (-> a Bit) (Array a) (Array a)))
(list/fold (function (_ idx xs')
(case (read idx xs)
#.None
xs'
(#.Some x)
(if (p x)
xs'
(delete idx xs'))))
xs
(list.indices (size xs))))
(def: #export (find p xs)
(All [a]
(-> (-> a Bit) (Array a) (Maybe a)))
(let [arr-size (size xs)]
(loop [idx +0]
(if (n/< arr-size idx)
(case (read idx xs)
#.None
(recur (inc idx))
(#.Some x)
(if (p x)
(#.Some x)
(recur (inc idx))))
#.None))))
(def: #export (find+ p xs)
{#.doc "Just like 'find', but with access to the index of each value."}
(All [a]
(-> (-> Nat a Bit) (Array a) (Maybe [Nat a])))
(let [arr-size (size xs)]
(loop [idx +0]
(if (n/< arr-size idx)
(case (read idx xs)
#.None
(recur (inc idx))
(#.Some x)
(if (p idx x)
(#.Some [idx x])
(recur (inc idx))))
#.None))))
(def: #export (clone xs)
(All [a] (-> (Array a) (Array a)))
(let [arr-size (size xs)]
(list/fold (function (_ idx ys)
(case (read idx xs)
#.None
ys
(#.Some x)
(write idx x ys)))
(new arr-size)
(list.indices arr-size))))
(def: #export (from-list xs)
(All [a] (-> (List a) (Array a)))
(product.right (list/fold (function (_ x [idx arr])
[(inc idx) (write idx x arr)])
[+0 (new (list.size xs))]
xs)))
(def: underflow Nat (dec +0))
(def: #export (to-list array)
(All [a] (-> (Array a) (List a)))
(loop [idx (dec (size array))
output #.Nil]
(if (n/= underflow idx)
output
(recur (dec idx)
(case (read idx array)
(#.Some head)
(#.Cons head output)
#.None
output)))))
(structure: #export (Equivalence<Array> Equivalence<a>)
(All [a] (-> (Equivalence a) (Equivalence (Array a))))
(def: (= xs ys)
(let [sxs (size xs)
sxy (size ys)]
(and (n/= sxy sxs)
(list/fold (function (_ idx prev)
(and prev
(case [(read idx xs) (read idx ys)]
[#.None #.None]
true
[(#.Some x) (#.Some y)]
(:: Equivalence<a> = x y)
_
false)))
true
(list.n/range +0 (dec sxs)))))
))
(structure: #export Monoid<Array> (All [a] (Monoid (Array a)))
(def: identity (new +0))
(def: (compose xs ys)
(let [sxs (size xs)
sxy (size ys)]
(|> (new (n/+ sxy sxs))
(copy sxs +0 xs +0)
(copy sxy +0 ys sxs)))))
(structure: #export _ (Functor Array)
(def: (map f ma)
(let [arr-size (size ma)]
(if (n/= +0 arr-size)
(new arr-size)
(list/fold (function (_ idx mb)
(case (read idx ma)
#.None
mb
(#.Some x)
(write idx (f x) mb)))
(new arr-size)
(list.n/range +0 (dec arr-size)))
))))
(structure: #export _ (Fold Array)
(def: (fold f init xs)
(let [arr-size (size xs)]
(loop [so-far init
idx +0]
(if (n/< arr-size idx)
(case (read idx xs)
#.None
(recur so-far (inc idx))
(#.Some value)
(recur (f value so-far) (inc idx)))
so-far)))))
|
