-
Notifications
You must be signed in to change notification settings - Fork 30
/
Collections.ns
393 lines (336 loc) · 9.93 KB
/
Collections.ns
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
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
(* Copyright (c) 2001-2015 see AUTHORS file
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the 'Software'), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*)
class Collections usingKernel: kernel = Value (
| private Array = kernel Array.
private Pair = kernel Pair.
private Vector = kernel Vector.
private initialSize = 10.
private initialCapacity = 16.
|
)(
public class Set new: size = (
| public items ::= Vector new: size. |
) (
public = otherSet = (
self size = otherSet size ifFalse: [^ false ].
self do: [:item | (otherSet contains: item) ifFalse: [^ false]. ].
^ true.
)
public add: anObject = (
(self contains: anObject)
ifFalse: [ items append: anObject ]
)
public addAll: aCollection = (
aCollection do: [:each |
self add: each]
)
public union: aCollection = (
| new |
new:: Set new.
new addAll: self.
new addAll: aCollection.
^ new
)
public intersection: aCollection = (
| new |
new:: Set new.
self do: [:it |
(aCollection contains: it) ifTrue: [ new add: it ]].
^ new
)
public - aCollection = ( (* set difference *)
| new |
new:: Set new.
self do: [:it |
(aCollection contains: it) ifFalse: [ new add: it ]].
^ new
)
public contains: anObject = (
items do: [ :it | it = anObject ifTrue: [ ^ true ] ].
^ false
)
public remove: anObject = (
| newItems |
newItems:: Vector new.
[ items isEmpty ]
whileFalse: [ | it |
it:: items remove.
it = anObject ifFalse: [ newItems append: it ] ].
items:: newItems
)
(* Sets do not have the notion of ordering, but
for convenience we provide those accessors *)
public first = (
^ items at: 1
)
public isEmpty = (
^ items isEmpty
)
(* Iteration *)
public do: block = ( items do: block )
(* Collection *)
public collect: block = ( | coll |
coll:: Vector new.
self do: [ :e | coll append: (block value: e) ].
^coll
)
(* Printing *)
public println = (
'(' print.
self do: [ :it | '(' print. it print. ')' print ].
')' println
)
public asString = (
| result |
result:: 'a Set('.
items do: [:e | result:: result + e asString + ', '].
result:: result + ')'.
^ result
)
public size = (
^ items size
)
(* preserves capacity *)
public removeAll = (
items removeAll
)
public asArray = (
^ items asArray
)
) : (
public new = ( ^ self new: initialSize )
)
public class IdentitySet new: size = Set new: size ()(
public contains: anObject = (
items do: [ :it | it == anObject ifTrue: [ ^ true ] ].
^ false
)
public remove: anObject = (
| newItems |
newItems:: Vector new.
[ items isEmpty ]
whileFalse: [ | it |
it:: items remove.
it == anObject ifFalse: [ newItems append: it ] ].
items:: newItems
)
) : (
public new = ( ^ self new: initialSize )
)
public class Dictionary new: size = (
| protected buckets ::= Array new: size.
protected size_ ::= 0.
|)(
protected class Entry new: hash key: key value: val next: next = (
| public hash = hash.
public key = key.
public value ::= val.
public next ::= next.
|)(
public match: aHash key: aKey = (
^ hash = aHash and: [key = aKey]
)
)
private hash: key = (
| hash |
key isNil ifTrue: [ ^ 0 ].
hash:: key hashcode.
^ hash bitXor: (hash >>> 16)
)
private bucketIdx: hash = (
^ 1 + ((buckets size - 1) & hash)
)
private bucket: hash = (
^ buckets at: (bucketIdx: hash)
)
public at: aKey = (
^ at: aKey ifAbsent: nil
)
public at: aKey ifAbsent: aBlock = (
| hash e |
hash:: hash: aKey.
e:: bucket: hash.
[ e notNil ] whileTrue: [
(e match: hash key: aKey)
ifTrue: [ ^ e value ].
e:: e next ].
^ aBlock value
)
public containsKey: aKey = (
| hash e |
hash:: hash: aKey.
e:: bucket: hash.
[ e notNil ] whileTrue: [
(e match: hash key: aKey)
ifTrue: [ ^ true ].
e:: e next ].
^ false
)
public at: aKey put: aVal = (
| hash i current |
hash:: hash: aKey.
i:: bucketIdx: hash.
current:: buckets at: i.
current isNil
ifTrue: [
buckets at: i put: (newEntry: aKey value: aVal hash: hash).
size_:: size_ + 1 ]
ifFalse: [
insertBucketEntry: aKey value: aVal hash: hash head: current ].
size_ > buckets size ifTrue: [ resize ]
)
protected newEntry: aKey value: value hash: hash = (
^ Entry new: hash key: aKey value: value next: nil
)
private insertBucketEntry: key value: value hash: hash head: head = (
| current |
current:: head.
[true] whileTrue: [
(current match: hash key: key) ifTrue: [
current value: value.
^ self ].
current next isNil ifTrue: [
size_:: size_ + 1.
current next: (newEntry: key value: value hash: hash).
^ self ].
current:: current next ]
)
public remove: aKey = (
^ remove: aKey ifAbsent: nil
)
public remove: aKey ifAbsent: aBlock = (
| hash i current |
hash:: hash: aKey.
i:: bucketIdx: hash.
current:: buckets at: i.
current isNil
ifTrue: [ ^ aBlock value ]
ifFalse: [
^ removeBucketEntry: aKey hash: hash idx: i head: current ifAbsent: aBlock ]
)
private removeBucketEntry: key hash: hash idx: i head: head ifAbsent: aBlock = (
| current prev |
current:: head.
[true] whileTrue: [
(current match: hash key: key) ifTrue: [
prev isNil
ifTrue: [ buckets at: i put: current next ]
ifFalse: [ prev next: current next ].
size_:: size_ - 1.
^ current value ].
current next isNil ifTrue: [
^ aBlock value ].
prev:: current.
current:: current next ]
)
private resize = (
| oldStorage |
oldStorage:: buckets.
buckets:: Array new: oldStorage size * 2.
transferEntries: oldStorage
)
private transferEntries: oldStorage = (
1 to: oldStorage size do: [:i |
| current |
current:: oldStorage at: i.
current notNil ifTrue: [
oldStorage at: i put: nil.
current next isNil
ifTrue: [
buckets at: 1 + (current hash & (buckets size - 1)) put: current ]
ifFalse: [
splitBucket: oldStorage bucket: i head: current ] ] ]
)
private splitBucket: oldStorage bucket: i head: head = (
| loHead loTail hiHead hiTail current |
loHead:: nil. loTail:: nil.
hiHead:: nil. hiTail:: nil.
current:: head.
[current notNil] whileTrue: [
(current hash & oldStorage size) = 0
ifTrue: [
loTail isNil
ifTrue: [ loHead:: current ]
ifFalse: [ loTail next: current ].
loTail:: current ]
ifFalse: [
hiTail isNil
ifTrue: [ hiHead:: current ]
ifFalse: [ hiTail next: current ].
hiTail:: current ].
current:: current next ].
loTail notNil ifTrue: [
loTail next: nil.
buckets at: i put: loHead ].
hiTail notNil ifTrue: [
hiTail next: nil.
buckets at: i + oldStorage size put: hiHead ]
)
public size = ( ^ size_ )
public isEmpty = ( ^ size_ = 0 )
public removeAll = (
buckets:: Array new: buckets size.
size_:: 0.
)
public keys = (
| keys |
keys:: Vector new: size_.
buckets do: [:b |
| current |
current:: b.
[ current notNil ] whileTrue: [
keys append: current key.
current:: current next ] ].
^ keys
)
public do: block = (
buckets do: [:b |
| current |
current:: b.
[ current notNil ] whileTrue: [
block value: current value.
current:: current next ] ].
)
public values = (
| values |
values:: Vector new: size_.
buckets do: [:b |
| current |
current:: b.
[ current notNil ] whileTrue: [
values append: current value.
current:: current next ] ].
^ values
)
) : (
public new = ( ^ self new: initialCapacity )
)
public class IdentityDictionary new: size = Dictionary new: size ()(
protected class IdEntry new: hash key: key value: val next: next = Entry new: hash key: key value: val next: next (
)(
public match: aHash key: aKey = (
^ hash = aHash and: [key == aKey]
)
)
protected newEntry: aKey value: value hash: hash = (
^ IdEntry new: hash key: aKey value: value next: nil
)
) : (
public new = ( ^ self new: initialCapacity )
)
)